A unified approach for a 1D generalized total variation problem

DOI10.1007/S10107-021-01633-2zbMath1492.90013OpenAlexW3136445733MaRDI QIDQ2149555

Cheng Lu, Dorit S. Hochbaum

Publication date: 29 June 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-021-01633-2

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on necessary conditions (49M05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mathematical modeling or simulation for problems pertaining to operations research and mathematical programming (90-10)

Uses Software

• condat_tv

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Locally adaptive regression splines
• Local extremes, runs, strings and multiresolution. (With discussion)
• Extensions of smoothing via taut strings
• The equivalence of the taut string algorithm and BV-regularization
• Exact Algorithms for $L^1$-TV Regularization of Real-Valued or Circle-Valued Signals
• Multi-Label Markov Random Fields as an Efficient and Effective Tool for Image Segmentation, Total Variations and Regularization
• Generalized methods and solvers for noise removal from piecewise constant signals. I. Background theory
• Solving the Convex Cost Integer Dual Network Flow Problem
• Total Variation on a Tree
• $\ell_1$ Trend Filtering
• A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems
• Modular proximal optimization for multidimensional total-variation regularization
• Total Variation Regularization for Manifold-Valued Data
• An efficient algorithm for image segmentation, Markov random fields and related problems
• Robust Estimation of a Location Parameter
• Convex separable optimization is not much harder than linear optimization

This page was built for publication: A unified approach for a 1D generalized total variation problem