7351 search results - page 35 / 1471 » Segmenting Point Sets |
COMPGEOM
2011
ACM
13 years 10 days ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
VIIP
2001
13 years 10 months ago
2001
In this paper, we present an easy, efficient and practical algorithm, which extracts the feature silhouette from a photograph for virtual human modeling. Our segmentation algorith...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
Presentation
A nice presentation by Daniel Cremers at the European Conference on Computer Vision (ECCV) 2006, covering a wide range of computer vision applications that the level set methods ca...
ICML
2006
IEEE
14 years 9 months ago
2006
IEEE
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...