Sparsity based methods for overparameterized variational problems
From MaRDI portal
Publication:3454487
total variationdenoisingsparsityimage segmentationcompressed sensingvariational methodsoverparameterizationcosparsityline segmentation
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Computing methodologies for image processing (68U10) Variational methods applied to PDEs (35A15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Inverse problems in optimal control (49N45) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical solution to inverse problems in abstract spaces (65J22) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20)
Abstract: Two complementary approaches have been extensively used in signal and image processing leading to novel results, the sparse representation methodology and the variational strategy. Recently, a new sparsity based model has been proposed, the cosparse analysis framework, which may potentially help in bridging sparse approximation based methods to the traditional total-variation minimization. Based on this, we introduce a sparsity based framework for solving overparameterized variational problems. The latter has been used to improve the estimation of optical flow and also for general denoising of signals and images. However, the recovery of the space varying parameters involved was not adequately addressed by traditional variational methods. We first demonstrate the efficiency of the new framework for one dimensional signals in recovering a piecewise linear and polynomial function. Then, we illustrate how the new technique can be used for denoising and segmentation of images.
Recommendations
- Over-parameterized variational optical flow
- A variational formulation for frame-based inverse problems
- On globally optimal local modeling: from moving least squares to over-parametrization
- Sparse template-based variational image segmentation
- Sparsity of solutions for variational inverse problems with finite-dimensional data
Cites work
- scientific article; zbMATH DE number 1111402 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A Survey on Variational Optic Flow Methods for Small Displacements
- A Theory for Sampling Signals From a Union of Subspaces
- Active contours without edges
- Adaptive greedy approximations
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
- Analysis versus synthesis in signal priors
- Approximation of functional depending on jumps by elliptic functional via t-convergence
- Approximation to Data by Splines with Free Knots
- Atomic Decomposition by Basis Pursuit
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Compressed sensing with coherent and redundant dictionaries
- Efficient graph-based image segmentation
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Geodesic active contours
- Greedy signal space methods for incoherence and beyond
- Greedy-like algorithms for the cosparse analysis model
- Hard thresholding pursuit: an algorithm for compressive sensing
- Image Processing and Analysis
- Iterative hard thresholding for compressed sensing
- Matching pursuits with time-frequency dictionaries
- Model Selection and Estimation in Regression with Grouped Variables
- Model-Based Compressive Sensing
- Modern statistical estimation via oracle inequalities
- Near oracle performance and block analysis of signal space greedy methods
- Nonlinear total variation based noise removal algorithms
- On globally optimal local modeling: from moving least squares to over-parametrization
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- On the stability of the basis pursuit in the presence of noise
- Optimal approximations by piecewise smooth functions and associated variational problems
- Orthogonal least squares methods and their application to non-linear system identification
- Over-parameterized variational optical flow
- Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model
- RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries
- Sparse components of images and optimal atomic decompositions
- Sparse representations in unions of bases
- Sparse solutions to linear inverse problems with multiple measurement vectors
- Stable image reconstruction using total variation minimization
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- The cosparse analysis model and algorithms
- Variational methods in image segmentation with 7 image processing experiments
Cited in
(6)- Sparsity-Inducing Nonconvex Nonseparable Regularization for Convex Image Processing
- Sparse approximation based on a random overcomplete basis
- Near oracle performance and block analysis of signal space greedy methods
- Overparameterized Models for Vector Fields
- On globally optimal local modeling: from moving least squares to over-parametrization
- Hyper-sparsity in the revised simplex method and how to exploit it
This page was built for publication: Sparsity based methods for overparameterized variational problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454487)
