299 search results - page 2 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
In this work we present a unified view on Markov random fields and recently proposed continuous tight convex relaxations for multi-label assignment in the image plane. These rel...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We propose a new algorithm for learning kernels for variants of the Normalized Cuts (NCuts) objective – i.e., given a set of training examples with known partitions, how should ...
ICCV
2009
IEEE
14 years 9 months ago
2009
IEEE
In this work we revisit the Mumford-Shah functional, one
of the most studied variational approaches to image segmentation.
The contribution of this paper is to propose an
algori...
GD
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...