299 search results - page 1 / 60 » A Convex Relaxation Approach for Computing Minimal Partition... |
CVPR
2009
IEEE
14 years 11 months ago
2009
IEEE
In this work we propose a convex relaxation approach
for computing minimal partitions. Our approach is based
on rewriting the minimal partition problem (also known as
Potts mode...
EMMCVPR
2011
Springer
12 years 4 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
IJCV
2011
12 years 11 months ago
2011
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
CVPR
2009
IEEE
2009
IEEE
Continuous Ratio Optimization via Convex Relaxation with Applications to Multiview 3D Reconstruction
14 years 11 months ago
We introduce a convex relaxation framework to optimally
minimize continuous surface ratios. The key idea is to minimize
the continuous surface ratio by solving a sequence
of con...
ICCV
2009
IEEE
13 years 2 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 algorith...