7351 search results - page 229 / 1471 » Segmenting Point Sets |
173
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
167
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In many situations it is convenient to represent pictorial data in the form of contours. It may become necessary to compress such contour data for efficient storage and transmissi...
193
click to vote
BMVC
2002
15 years 9 months ago
2002
Interest point detectors are commonly employed to reduce the amount of data to be processed. The ideal interest point detector would robustly select those features which are most ...
160
click to vote
NIPS
2003
15 years 8 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
187
click to vote
CGF
2005
15 years 6 months ago
2005
This paper describes a method to obtain a closed surface that approximates a general 3D data point set with non-uniform density. Aside from the positions of the initial data point...