Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming

  title={Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming},
  author={Jens Keuchel and Christoph Schn{\"o}rr and Christian Schellewald and Daniel Cremers},
  journal={IEEE Trans. Pattern Anal. Mach. Intell.},
We introduce a novel optimization method based on semidefinite programming relaxations to the field of computer vision and apply it to the combinatorial problem of minimizing quadratic functionals in binary decision variables subject to linear constraints. The approach is (tuning) parameter-free and computes high-quality combinatorial solutions using interior-point methods (convex programming) and a randomized hyperplane technique. Apart from a symmetry condition, no assumptions (such as metric… 

Robust Binary Image Deconvolution with Positive Semidefinite Programming

This paper reports on a novel approach to binary image deconvolution using Positive Semidefinite (PSD) Programming, which first compute the optimal solution of the convex relaxation of the original problem, and then uses the randomized-hyperplane method to find the combinatorial solution.

Probabilistic Subgraph Matching Based on Convex Relaxation

It is shown that the global minimum of the relaxed convex problem can be interpreted as probability distribution over the original space of matching matrices, providing a basis for efficiently sampling all close-to-optimal combinatorial matchings within the original solution space.

Solving Large Scale Binary Quadratic Problems: Spectral Methods vs. Semidefinite Programming

Two new methods for solving binary quadratic problems based on spectral subgradients and can be applied to large scale SDPs with binary decision variables and the second one is based on the trust region problem, combining the merits of both spectral and SDP relaxations.

Convex Optimisation for Multiclass Image Labeling

  • Zhouyu FuA. Robles-Kelly
  • Computer Science
    9th Biennial Conference of the Australian Pattern Recognition Society on Digital Image Computing Techniques and Applications (DICTA 2007)
  • 2007
This paper addresses multiclass pairwise labeling problems by proposing an alternative approach to continuous relaxation techniques which makes use of a quadratic cost function over the class labels which is convex and related to the target function used in discrete Markov Random Field approaches.

Local Submodularization for Binary Pairwise Energies

A general optimization framework based on local submodular approximations (LSA) for pairwise energies, which obtain state-of-the-art results on a wide range of applications such as binary deconvolution, curvature regularization, inpainting, segmentation with repulsion and two types of shape priors.

Restoration of Binary Images Using Positive Semidefinite Programming

We present a novel approach, using positive semidefinite (PSD) programming, to restore blurred and noisy binary images when the point spread function (PSF) is known. The combinatorial nature of the

Biconvex Relaxation for Semidefinite Programming in Computer Vision

This work proposes a general framework to approximately solve large-scale semidefinite problems (SDPs) at low complexity, and transforms a general SDP into a specific biconvex optimization problem, which can then be solved in the original, low-dimensional variable space atLow complexity.

A Fast Semidefinite Approach to Solving Binary Quadratic Problems

This work presents a new SDP formulation for BQPs, with two desirable properties, which leads to a significantly more efficient and scalable dual optimization approach, which has the same degree of complexity as spectral methods.

Large-Scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications

This work presents a semidefinite programming (SDP) formulation for BQPs, with two desirable properties, and proposes two solvers, namely, quasi-Newton and smoothing Newton methods, for the simplified dual problem.



Image Labeling and Grouping by Minimizing Linear Functionals over Cones

A novel and general optimization technique is introduced to the field of computer vision which amounts to compute a suboptimal solution by just solving a convex optimization problem.

Mixed linear and semidefinite programming for combinatorial and quadratic optimization

Computational results for approximating graph-partition and quadratic problems with dimensions 800 to 10,000 are reported, which is the first computational evidence of the effectiveness of these approximation algorithms for solving large-scale problems.

Multiscale minimization of global energy functions in some visual recovery problems

A new comprehensive approach to minimize global energy functions using a multiscale relaxation algorithm that appears to be far less sensitive to local minima than standard relaxation algorithms is investigated.

Normalized cuts and image segmentation

  • Jianbo ShiJ. Malik
  • Computer Science
    Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition
  • 1997
This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.

Segmentation using eigenvectors: a unifying view

  • Yair Weiss
  • Computer Science
    Proceedings of the Seventh IEEE International Conference on Computer Vision
  • 1999
A unified treatment of eigenvectors of block matrices based on eigendecompositions in the context of segmentation is given, and close connections between them are shown while highlighting their distinguishing features.

Global Optimization Using Embedded Graphs

This thesis introduces two new optimization methods that use graph algorithms and proves that the convexity of the smoothing function in the energy is essential for the applicability of the method and provides an exact criterion in terms of the MRF energy.

Markov random fields with efficient approximations

  • Yuri BoykovO. VekslerR. Zabih
  • Computer Science, Mathematics
    Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231)
  • 1998
This paper shows that the maximum a posteriori estimate of such an MRF can be obtained by solving a multiway minimum cut problem on a graph, and develops efficient algorithms for computing good approximations to the minimum multiway, cut.

Constructing simple stable descriptions for image partitioning

  • Y. G. Leclerc
  • Computer Science
    International Journal of Computer Vision
  • 2004
A new formulation of the image partitioning problem is presented: construct a complete and stable description of an image-in terms of a specified descriptive language-that is simplest in the sense of being shortest, which yields intuitively satisfying partitions for a wide class of images.

Figure-Ground Discrimination: A Combinatorial Optimization Approach

A mathematical model encoding the figure-ground discrimination problem that makes explicit a definition of shape based on cocircularity, smoothness, proximity, and contrast is presented and may be viewed as a benchmark.