Sciweavers

Share
42 search results - page 1 / 9
» Optimality Bounds for a Variational Relaxation of the Image ...
Sort
View
EMMCVPR
2011
Springer
7 years 7 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
CVPR
2009
IEEE
10 years 2 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
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...
Thomas Pock (Graz University of Technology), Anton...
UAI
2004
8 years 8 months ago
Variational Chernoff Bounds for Graphical Models
Recent research has made significant progress on the problem of bounding log partition functions for exponential family graphical models. Such bounds have associated dual paramete...
Pradeep D. Ravikumar, John D. Lafferty
ICCV
2009
IEEE
10 years 11 days ago
Convex Optimization for Multi-Class Image Labeling with a Novel Family of Total Variation Based Regularizers
We introduce a linearly weighted variant of the total variation for vector fields in order to formulate regularizers for multi-class labeling problems with non-trivial interclass...
J. Lellmann, F. Becker, C. Schn¨orr
JMIV
2007
145views more  JMIV 2007»
8 years 7 months ago
Level Lines Selection with Variational Models for Segmentation and Encoding
Abstract. This paper discusses the interest of the Tree of Shapes of an image as a region oriented image representation. The Tree of Shapes offers a compact and structured represen...
Coloma Ballester, Vicent Caselles, Laura Igual, Ll...
books