Sublabel-Accurate Discretization of Nonconvex Free-Discontinuity Problems

11/21/2016
by   Thomas Möllenhoff, et al.
0

In this work we show how sublabel-accurate multilabeling approaches can be derived by approximating a classical label-continuous convex relaxation of nonconvex free-discontinuity problems. This insight allows to extend these sublabel-accurate approaches from total variation to general convex and nonconvex regularizations. Furthermore, it leads to a systematic approach to the discretization of continuous convex relaxations. We study the relationship to existing discretizations and to discrete-continuous MRFs. Finally, we apply the proposed approach to obtain a sublabel-accurate and convex solution to the vectorial Mumford-Shah functional and show in several experiments that it leads to more precise solutions using fewer labels.

READ FULL TEXT

page 1

page 7

page 8

research
12/04/2015

Sublabel-Accurate Relaxation of Nonconvex Energies

We propose a novel spatially continuous framework for convex relaxations...
research
04/07/2016

Sublabel-Accurate Convex Relaxation of Vectorial Multilabel Energies

Convex relaxations of nonconvex multilabel problems have been demonstrat...
research
06/20/2022

Efficient and Flexible Sublabel-Accurate Energy Minimization

We address the problem of minimizing a class of energy functions consist...
research
07/28/2017

Simplified Energy Landscape for Modularity Using Total Variation

Networks capture pairwise interactions between entities and are frequent...
research
02/10/2023

Efficient and accurate separable models for discrete material optimization: A continuous perspective

Multi-material design optimization problems can, after discretization, b...
research
05/02/2019

Lifting Vectorial Variational Problems: A Natural Formulation based on Geometric Measure Theory and Discrete Exterior Calculus

Numerous tasks in imaging and vision can be formulated as variational pr...
research
07/13/2021

Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields

Dual decomposition approaches in nonconvex optimization may suffer from ...

Please sign up or login with your details

Forgot password? Click here to reset