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...
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 ...
Douglas Moore, John Stevens, Scott Lundberg, Bruce...
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...
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 ...
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...