164 search results - page 9 / 33 » Outlier-Robust Convex Segmentation |
209
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
163
click to vote
SCALESPACE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we provide a method to find global minimizers of certain non-convex 2-phase image segmentation problems. This is achieved by formulating a convex minimizat...
214
click to vote
SMA
2009
ACM
16 years 29 days ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
158
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Assume that a set of imprecise points is given, where each point is specified by a region in which the point may lie. We study the problem of computing the smallest and largest pos...
156
click to vote
CVPR
2001
IEEE
16 years 8 months ago
2001
IEEE
The dichromatic reflectance model introduced by Shafer [16] predicts that the colour signals of most materials fall on a plane spanned by a vector due to the material and a vector...