7351 search results - page 151 / 1471 » Segmenting Point Sets |
121
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
- The ICP (Iterative Closest Point) algorithm remains a very popular method for the registration of 3D data sets, when an initial guess of the relative pose between them is known. ...
118
click to vote
MP
2008
15 years 4 months ago
2008
Abstract. We attempt a broad exploration of properties and connections between the symmetry function of a convex set S IRn and other arenas of convexity including convex functions...
135
click to vote
JMLR
2011
14 years 11 months ago
2011
Following Hartigan (1975), a cluster is defined as a connected component of the t-level set of the underlying density, that is, the set of points for which the density is greater...
109
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
To find how many clusters in a sample set is an old yet unsolved problem in unsupervised clustering. Many segmentation methods require the user to specify the number of regions in...
146
click to vote
RIAO
2004
15 years 5 months ago
2004
In this paper we introduce a machine learning approach for automatic text segmentation. Our text segmenter clusters text-segments containing similar concepts. It first discovers th...