1012 search results - page 6 / 203 » Segment intersection searching problems in general settings |
ICML
2006
IEEE
14 years 8 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...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...
ALGORITHMICA
2007
13 years 7 months ago
2007
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
SCIA
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...