The equivalence of the taut string algorithm and BV-regularization

DOI10.1007/s10851-006-9796-4zbMath1478.94041OpenAlexW2021345239MaRDI QIDQ2384101

Markus Grasmair

Publication date: 20 September 2007

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-006-9796-4

zbMATH Keywords

optimizationregularizationvariational methodstotal-variationvariational derivativesequivalence-relations

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for ill-posed problems for integral equations (65R30) Linear operators and ill-posed problems, regularization (47A52)

Related Items (17)

Analytical aspects of spatially adapted total variation regularisation ⋮ Relation between total variation and persistence distance and its application in signal processing ⋮ An algorithmic framework for Mumford–Shah regularization of inverse problems in imaging ⋮ A unified approach for a 1D generalized total variation problem ⋮ Total Variation on a Tree ⋮ Univariate fast initial response statistical process control with taut strings ⋮ Renewal structure of the Brownian taut string ⋮ Generalizations of the Taut String Method ⋮ Invariant $\varphi$-Minimal Sets and Total Variation Denoising on Graphs ⋮ Energy of taut strings accompanying a Wiener process and random walk in a band of variable width ⋮ The taut string approach to statistical inverse problems: theory and applications ⋮ Boundedness and unboundedness in total variation regularization ⋮ Statistical multiresolution Dantzig estimation in imaging: fundamental concepts and algorithmic framework ⋮ Persistence barcodes versus Kolmogorov signatures: detecting modes of one-dimensional signals ⋮ Modular proximal optimization for multidimensional total-variation regularization ⋮ On the taut string interpretation and other properties of the Rudin-Osher-Fatemi model in one dimension ⋮ A study of the one dimensional total generalised variation regularisation problem

Uses Software

• ftnonpar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Tube methods for BV regularization
• Locally adaptive regression splines
• Image recovery via total variation minimization and related problems
• Local extremes, runs, strings and multiresolution. (With discussion)
• Relations between regularization and diffusion filtering
• Local and global bivariational gradients and singular variational derivatives of functionals on Cn[a,b]
• Least squares and bounded variation regularization with nondifferentiable functionals
• An active set strategy based on the augmented Lagrangian formulation for image restoration
• Analysis of bounded variation penalty methods for ill-posed problems
• Convergence of an Iterative Method for Total Variation Denoising
• Iterative Methods for Total Variation Denoising
• Scale Space and PDE Methods in Computer Vision

This page was built for publication: The equivalence of the taut string algorithm and BV-regularization