A finite hyperplane traversal algorithm for 1-dimensional L^1pTV minimization, for 0

DOI10.1007/S10589-015-9738-4zbMATH Open1330.90108OpenAlexW188373354MaRDI QIDQ493699FDOQ493699

Authors: Heather A. Moon, Thomas J. Asaki 

Publication date: 4 September 2015

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-015-9738-4

Recommendations

• Exact algorithms for \(L^1\)-TV regularization of real-valued or circle-valued signals
• Total variation minimization with an \(H^{-1}\) constraint
• A Finite Smoothing Algorithm for Linear $l_1 $ Estimation
• An algorithm for total variation minimization and applications
• Combinatorial Image Analysis

zbMATH Keywords

scalessignal processingnonsmooth optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Nonlinear total variation based noise removal algorithms
• Title not available (Why is that?)
• Edge-preserving and scale-dependent properties of total variation regularization
• Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
• Aspects of Total Variation RegularizedL¹Function Approximation
• Direct methods in the calculus of variations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
• Title not available (Why is that?)
• Parametric maximum flow algorithms for fast total variation minimization

Cited In (6)

• Anisotropic variation formulas for imaging applications
• \(L^{1}\mathrm{TV}\) computes the flat norm for boundaries
• There are thin minimizers of the \(L^{1}TV\) functional
• The \(L^1\)-Potts functional for robust jump-sparse reconstruction
• Rayleigh quotient minimization for absolutely one-homogeneous functionals
• Exact algorithms for \(L^1\)-TV regularization of real-valued or circle-valued signals

This page was built for publication: A finite hyperplane traversal algorithm for 1-dimensional \(L^1pTV\) minimization, for \(0<p\leq 1\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493699)