NDLI: A convex relaxation approach for computing minimal partitions

Content Provider	IEEE Xplore Digital Library
Author	Pock, T. Chambolle, A. Cremers, D. Bischof, H.
Copyright Year	2009
Description	Author affiliation: Graz Univ. of Technol., Graz, Austria (Pock, T.; Bischof, H.) \|\| Ecole Polytech., Paris, France (Chambolle, A.) \|\| Bonn Univ., Bonn, Germany (Cremers, D.)
Abstract	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 model) in terms of a primal dual Total Variation functional. We show that the Potts prior can be incorporated by means of convex constraints on the dual variables. For minimization we propose an efficient primal dual projected gradient algorithm which also allows a fast implementation on parallel hardware. Although our approach does not guarantee to find global minimizers of the Potts model we can give a tight bound on the energy between the computed solution and the true minimizer. Furthermore we show that our relaxation approach dominates recently proposed relaxations. As a consequence, our approach allows to compute solutions closer to the true minimizer. For many practical problems we even find the global minimizer. We demonstrate the excellent performance of our approach on several multi-label image segmentation and stereo problems.
Starting Page	810
Ending Page	817
File Size	867603
Page Count	8
File Format	PDF
ISBN	9781424439928
ISSN	10636919
DOI	10.1109/CVPR.2009.5206604
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2009-06-20
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer vision Labeling Image segmentation Stereo vision Pixel Minimization methods Partitioning algorithms Hardware Color Mathematics
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Symmetric Pixel-Group Based Stereo Matching for Occlusion Handling

Associative hierarchical CRFs for object class image segmentation

Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling

Globally optimal pixel labeling algorithms for tree metrics

Color image segmentation

Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling

A stereo approach that handles the matting problem via image warping

Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach

A study on continuous max-flow and min-cut approaches

A convex relaxation approach for computing minimal partitions

Similar Documents

Symmetric Pixel-Group Based Stereo Matching for Occlusion Handling

Associative hierarchical CRFs for object class image segmentation

Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling

Globally optimal pixel labeling algorithms for tree metrics

Color image segmentation

Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation, and Occlusion Handling

A stereo approach that handles the matting problem via image warping

Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach

A study on continuous max-flow and min-cut approaches

A convex relaxation approach for computing minimal partitions