Exact Solution of Permuted Submodular MinSum Problems

In this work we show, that for each permuted submodular MinSum problem (Energy Minimization Task) the corresponding submodular MinSum problem can be found in polynomial time. It follows, that permuted submodular MinSum problems are exactly solvable by transforming them into corresponding submodular tasks followed by applying standart approaches (e.g. using MinCut-MaxFlow based techniques).

[1]  Václav Hlavác,et al.  Ten Lectures on Statistical and Structural Pattern Recognition , 2002, Computational Imaging and Vision.

[2]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[3]  Dmitrij Schlesinger,et al.  Unifying Registration and Segmentation for Multi-sensor Images , 2002, DAGM-Symposium.

[4]  D. Schlesinger,et al.  TRANSFORMING AN ARBITRARY MINSUM PROBLEM INTO A BINARY ONE , 2006 .

[5]  Vladimir Kolmogorov,et al.  Convergent Tree-Reweighted Message Passing for Energy Minimization , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Mads Nielsen,et al.  Computer Vision — ECCV 2002 , 2002, Lecture Notes in Computer Science.

[7]  D. Greig,et al.  Exact Maximum A Posteriori Estimation for Binary Images , 1989 .

[8]  Davi Geiger,et al.  Segmentation by grouping junctions , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[9]  M. I. Schlesinger,et al.  Some solvable subclasses of structural recognition problems , 2000 .

[10]  Dmytro Shlezinger,et al.  Strukturelle Ansätze für die Stereorekonstruktion , 2005 .

[11]  Dmitrij Schlesinger.  Gibbs Probability Distributions for Stereo Reconstruction , 2003, DAGM-Symposium.

[12]  Daniel Cremers,et al.  Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Hiroshi Ishikawa,et al.  Exact Optimization for Markov Random Fields with Convex Priors , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Tomás Werner,et al.  A Linear Programming Approach to Max-Sum Problem: A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Olga Veksler,et al.  Fast Approximate Energy Minimization via Graph Cuts , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Vladimir Kolmogorov,et al.  Computing visual correspondence with occlusions using graph cuts , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.