A finite hyperplane traversal algorithm for 1-dimensional L^1pTV minimization, for 0
From MaRDI portal
Publication:493699
Recommendations
Cites work
- scientific article; zbMATH DE number 2132148 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 2062604 (Why is no real title available?)
- scientific article; zbMATH DE number 1827348 (Why is no real title available?)
- Aspects of Total Variation RegularizedL1Function Approximation
- Direct methods in the calculus of variations
- Edge-preserving and scale-dependent properties of total variation regularization
- Efficient Minimization Methods of Mixed l2-l1 and l1-l1 Norms for Image Restoration
- Minimizers of Cost-Functions Involving Nonsmooth Data-Fidelity Terms. Application to the Processing of Outliers
- Nonlinear total variation based noise removal algorithms
- Parametric maximum flow algorithms for fast total variation minimization
Cited in
(6)- The \(L^1\)-Potts functional for robust jump-sparse reconstruction
- Exact algorithms for \(L^1\)-TV regularization of real-valued or circle-valued signals
- Rayleigh quotient minimization for absolutely one-homogeneous functionals
- \(L^{1}\mathrm{TV}\) computes the flat norm for boundaries
- Anisotropic variation formulas for imaging applications
- There are thin minimizers of the \(L^{1}TV\) functional
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)