7351 search results - page 18 / 1471 » Segmenting Point Sets |
IWCIA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
This paper develops a weakly supervised algorithm that learns to segment rigid multi-colored objects from a set of training images and key points. The approach uses congealing to ...
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (w...
128
click to vote
PAMI
2010
14 years 6 months ago
2010
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
100
click to vote
CCCG
2009
15 years 27 days ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...