4.5 Article

Convex Relaxation of a Class of Vertex Penalizing Functionals

Journal

JOURNAL OF MATHEMATICAL IMAGING AND VISION
Volume 47, Issue 3, Pages 278-302

Publisher

SPRINGER
DOI: 10.1007/s10851-012-0347-x

Keywords

Variational methods; Convex relaxation; Higher order penalties; Roto-translation space; Vertex counting regularization; Total curvature regularization; Binary image segmentation; Image denoising; Image inpainting

Funding

  1. Austrian Science Fund (FWF) [SFB F32, P22492-N23]
  2. Austrian Science Fund (FWF) [P 22492, F 3203] Funding Source: researchfish
  3. Austrian Science Fund (FWF) [P22492] Funding Source: Austrian Science Fund (FWF)

Ask authors/readers for more resources

We investigate a class of variational problems that incorporate in some sense curvature information of the level lines. The functionals we consider incorporate metrics defined on the orientations of pairs of line segments that meet in the vertices of the level lines. We discuss two particular instances: One instance that minimizes the total number of vertices of the level lines and another instance that minimizes the total sum of the absolute exterior angles between the line segments. In case of smooth level lines, the latter corresponds to the total absolute curvature. We show that these problems can be solved approximately by means of a tractable convex relaxation in higher dimensions. In our numerical experiments we present preliminary results for image segmentation, image denoising and image inpainting.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Review Mathematics, Applied

Higher-order total variation approaches and generalisations

Kristian Bredies, Martin Holler

INVERSE PROBLEMS (2020)

Article Mathematics, Applied

An optimal transport approach for solving dynamic inverse problems in spaces of measures

Kristian Bredies, Silvio Fanzon

ESAIM-MATHEMATICAL MODELLING AND NUMERICAL ANALYSIS-MODELISATION MATHEMATIQUE ET ANALYSE NUMERIQUE (2020)

Article Mathematics, Applied

Approximation of the Mumford-Shah functional by phase fields of bounded variation

Sandro Belz, Kristian Bredies

Summary: This paper introduces a new phase field approximation method, in which the phase field is allowed to be a function of bounded variation instead of an H1-function, leading to sharper phase fields compared to traditional methods. This new approximation can be widely used in image segmentation and image processing problems to achieve better results.

ANALYSIS AND APPLICATIONS (2021)

Article Computer Science, Theory & Methods

Tensor-Free Proximal Methods for Lifted Bilinear/Quadratic Inverse Problems with Applications to Phase Retrieval

Robert Beinert, Kristian Bredies

Summary: The article introduces a novel algorithm designed to address bilinear and quadratic inverse problems, using tensorial lifting and first-order proximal algorithms for numerical solutions. By deriving tensor-free versions of singular value thresholding methods and employing reweighting techniques, the iterative algorithms show improved convergence behavior and rank evolution. Applied to the two-dimensional masked Fourier phase retrieval problem, the method yields an efficient recovery approach that can incorporate smoothness constraints for enhanced results.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2021)

Article Mathematics

On the extremal points of the ball of the Benamou-Brenier energy

Kristian Bredies, Marcello Carioni, Silvio Fanzon, Francisco Romero

Summary: This paper characterizes the extremal points of the unit ball of the Benamou-Brenier energy and a generalization of it under the homogeneous continuity equation constraint. It is proven that extremal points are pairs of measures concentrated on absolutely continuous curves, which are characteristics of the continuity equation. This result is then applied to provide a representation formula for sparse solutions of dynamic inverse problems with finite-dimensional data and optimal-transport based regularization.

BULLETIN OF THE LONDON MATHEMATICAL SOCIETY (2021)

Article Radiology, Nuclear Medicine & Medical Imaging

Streaking artifact suppression of quantitative susceptibility mapping reconstructions via L1-norm data fidelity optimization (L1-QSM)

Carlos Milovic, Mathias Lambert, Christian Langkammer, Kristian Bredies, Pablo Irarrazaval, Cristian Tejos

Summary: The novel L1-norm data fidelity approach effectively prevents streaking artifacts in QSM reconstructions and is robust against outliers. It demonstrates better performance in testing and does not require the use of additional brain masks.

MAGNETIC RESONANCE IN MEDICINE (2022)

Article Computer Science, Artificial Intelligence

Non-linear fitting with joint spatial regularization in arterial spin labeling

Oliver Maier, Stefan M. Spann, Daniela Pinter, Thomas Gattringer, Nicole Hinteregger, Gerhard G. Thallinger, Christian Enzinger, Josef Pfeuffer, Kristian Bredies, Rudolf Stollberger

Summary: A new estimation method for ASL imaging with joint spatial regularization is proposed, enhancing image sharpness and noise suppression. The method is evaluated on synthetic data, healthy volunteers, and patient data, outperforming two reference methods in terms of SNR, sharpness, and quantitative accuracy.

MEDICAL IMAGE ANALYSIS (2021)

Article Engineering, Biomedical

An ultrastructural 3D reconstruction method for observing the arrangement of collagen fibrils and proteoglycans in the human aortic wall under mechanical load

Anna Pukaluk, Anna-Sophie Wittgenstein, Gerd Leitinger, Dagmar Kolb, Dominique Pernitsch, Sarah A. Schneider, Patrick Knoebelreiter, Verena Horak, Kristian Bredies, Gerhard A. Holzapfel, Thomas Pock, Gerhard Sommer

Summary: This study offers a method to investigate the arrangement of collagen fibrils and proteoglycans in the mechanically loaded aortic wall. The 3D reconstructions reveal a complex organization of collagen fibrils and PGs and provide insights into the ultrastructural changes caused by mechanical stimuli. This method has significant implications for understanding the response of soft biological tissues to mechanical loading.

ACTA BIOMATERIALIA (2022)

Article Computer Science, Theory & Methods

A Generalized Conditional Gradient Method for Dynamic Inverse Problems with Optimal Transport Regularization

Kristian Bredies, Marcello Carioni, Silvio Fanzon, Francisco Romero

Summary: We propose a dynamic generalized conditional gradient method for dynamic inverse problems with optimal transport regularization. The method effectively reconstructs heavily undersampled dynamic data and demonstrates convergence and optimization performance.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2023)

Article Mathematics, Applied

Regularization graphs-a unified framework for variational regularization of inverse problems

Kristian Bredies, Marcello Carioni, Martin Holler

Summary: We introduce and study a mathematical framework called regularization graphs for a broad class of regularization functionals. This framework allows for the construction of regularization methods and covers existing approaches while also allowing for flexibility in creating new ones. Well-posedness and convergence results are provided, and a bilevel optimization approach is presented to learn optimal weights for the regularization graphs.

INVERSE PROBLEMS (2022)

Article Mathematics, Applied

A superposition principle for the inhomogeneous continuity equation with Hellinger-Kantorovich-regular coefficients

Kristian Bredies, Marcello Carioni, Silvio Fanzon

Summary: This study investigates measure-valued solutions of the inhomogeneous continuity equation with low regularity coefficients. A new superposition principle is proven for positive measure solutions and coefficients with finite dynamic Hellinger-Kantorovich energy. This principle provides a decomposition of the solution into curves that satisfy the characteristic system in an appropriate sense and generalizes existing superposition principles to cases with low-regularity coefficients.

COMMUNICATIONS IN PARTIAL DIFFERENTIAL EQUATIONS (2022)

Article Mathematics, Applied

DEGENERATE PRECONDITIONED PROXIMAL POINT ALGORITHMS

Kristian Bredies, Enis Chenchene, Dirk A. Lorenz, Emanuele Naldi

Summary: This paper presents a systematic procedure for analyzing the convergence of degenerate preconditioned proximal point algorithms. Weak convergence results are established under mild assumptions, which can be easily applied to splitting methods for monotone inclusion and convex minimization problems. The degeneracy of the preconditioner allows for a reduction in the variables involved in iteration updates. The proposed framework demonstrates its strength in the context of splitting algorithms, providing simplified proofs of convergence and highlighting the connection between existing schemes from a preconditioned proximal point perspective.

SIAM JOURNAL ON OPTIMIZATION (2022)

Article Mathematics, Applied

Boundedness and Unboundedness in Total Variation Regularization

Kristian Bredies, Jose A. Iglesias, Gwenael Mercier

Summary: The paper investigates whether the minimizers of total variation regularization in linear inverse problems belong to L-8 space, even if the measured data does not. It presents a simple proof of boundedness for the minimizer with a fixed regularization parameter and derives the existence of uniform bounds under certain conditions. The paper also discusses the limitation of these results and proposes the possibility of extending them to higher-order regularization functionals.

APPLIED MATHEMATICS AND OPTIMIZATION (2023)

Article Computer Science, Software Engineering

Asymptotic linear convergence of fully-corrective generalized conditional gradient methods

Kristian Bredies, Marcello Carioni, Silvio Fanzon, Daniel Walter

Summary: We propose a fully-corrective generalized conditional gradient method (FC-GCG) for minimizing the sum of a smooth, convex loss function and a convex one homogeneous regularizer over a Banach space. The algorithm updates a finite set Ak of extremal points of the regularizer's unit ball and an iterate uk ? cone(Ak). Each iteration involves solving a linear problem to update Ak and a finite-dimensional convex minimization problem to update the iterate. We prove that under standard hypotheses, the algorithm converges sublinearly and can achieve a linear rate of convergence with additional assumptions on the dual variables using Choquet's theorem and the Primal-Dual-Active-Point method.

MATHEMATICAL PROGRAMMING (2023)

Article Mathematics, Applied

CONVERGENCE ANALYSIS OF PIXEL-DRIVEN RADON AND FANBEAM TRANSFORMS

Kristian Bredies, Richard Huber

Summary: This paper introduces a novel mathematical framework for understanding pixel-driven approaches for the parallel beam Radon transform and fanbeam transform, demonstrating that convergence can be achieved with the correct discretization strategy. The study shows that setting the pixel resolution in the Radon transform to be asymptotically smaller than the detector size leads to convergence, and discusses possible adjustments for limited-angle and sparse-angle Radon transforms. In addition, the convergence results are extended to a new pixel-driven approach for the fanbeam transform, emphasizing the importance of correct discretization strategies in avoiding high-frequency artifacts.

SIAM JOURNAL ON NUMERICAL ANALYSIS (2021)

No Data Available