L1-L2 Optimization in Signal and Image Processing

@article{Zibulevsky2010L1L2OI,
  title={L1-L2 Optimization in Signal and Image Processing},
  author={Michael Zibulevsky and Michael Elad},
  journal={IEEE Signal Processing Magazine},
  year={2010},
  volume={27},
  pages={76-88}
}
Sparse, redundant representations offer a powerful emerging model for signals. This model approximates a data source as a linear combination of few atoms from a prespecified and over-complete dictionary. Often such models are fit to data by solving mixed ¿1-¿2 convex optimization problems. Iterative-shrinkage algorithms constitute a new family of highly effective numerical methods for handling these problems, surpassing traditional optimization techniques. In this article, we give a broad view… 
View on IEEE
cs.technion.ac.il
421 Citations
Highly Influential Citations
26
Background Citations
126
Methods Citations
130
Results Citations
1

Figures from this paper

421 Citations

Citation Type

Citation Type

Compressive Sensing via Nonlocal Low-Rank Regularization
TLDR
A nonlocal low-rank regularization approach toward exploiting structured sparsity and its application into CS of both photographic and MRI images is proposed and the use of a nonconvex log det as a smooth surrogate function for the rank instead of the convex nuclear norm is proposed.
Learning Sparse Data Models via Geometric Optimization with Applications to Image Processing
TLDR
This thesis investigates the problem of learning sparse data models and their applications to image processing, regarding both the synthesis and the analysis point of view, and proposes an extension of the analysis model that is able to model dependencies of different signal modalities.
Local sparse representation for astronomical image denoising
TLDR
The experimental results show that the proposed LSR method is superior to the traditional denoising method and reaches state-of-the-art performance on astronomical image.
Compressively Sampled MR Image Reconstruction Using Hyperbolic Tangent-Based Soft-Thresholding
TLDR
It has been shown that by using the proposed thresholding function in the sparsifying domain and a data consistency step in the k-space, the iterative-shrinkage algorithms can be used effectively to recover the under-sampled MR images.
A STOCHASTIC 3 MG ALGORITHMWITH APPLICATION TO 2 D FILTER IDENTIFICATION
TLDR
Simulation results illustrate the good practical performance of the proposed MM Memory Gradient (3MG) algorithm when applied to 2D filter identification.
Gradient-Based Image Recovery Methods From Incomplete Fourier Measurements
TLDR
An algorithm called GradientRec is developed that uses a CS algorithm to recover the horizontal and vertical gradients and then estimates the original image from these gradients, and presents two methods of solving the latter inverse problem, one based on least-square optimization and the other based on a generalized Poisson solver.
Sparsity-Based Data Reconstruction Models for Biomedical Imaging
TLDR
A proper statistically-based discretization paradigm for inverse problems is introduced and a practical phase reconstruction algorithm that incorporates a sparsity-based regularization is developed.
Compressive Sensing via Nonlocal Smoothed Rank Function
TLDR
A non-convex smoothed rank function based model for CS image reconstruction is proposed and an efficient alternating minimization method is proposed to solve the proposed model, which reduces a difficult and coupled problem to two tractable subproblems.
LSR based astronomical image denoising via adaptive dictionary learning
TLDR
This work proposes a new image representation model called local sparse representation (LSR) and incorporates the LSR model and adaptive dictionary learning into a unified optimization framework, and explicitly establish the inner connection of them.
LSR based astronomical image denoising via adaptive dictionary learning
TLDR
This work proposes a new image representation model called local sparse representation (LSR) for astronomical image denoising and incorporates the LSR model and adaptive dictionary learning into a unified optimization framework, explicitly establish the inner connection of them.
...
...

References

SHOWING 1-10 OF 59 REFERENCES
Sparse Representation-based Image Deconvolution by iterative Thresholding
TLDR
Recent advances in fast solution algorithms of deconvolution problems, i.e. Stagewise Iterative Thresholding, are exploited to solve the optimization problem and provide fast and good image recovery results.
Block coordinate relaxation methods for nonparametric signal denoising with wavelet dictionaries
TLDR
It is shown that the B CR algorithm is globally convergent, and empirically, the BCR algorithm is faster than the IP algorithm for a variety of signal denoising problems.
A bound optimization approach to wavelet-based image deconvolution
TLDR
An algorithm based on the bound optimization approach is proposed; this approach allows deriving EM-type algorithms without using the concept of missing/hidden data and has provable monotonicity both with orthogonal or redundant wavelet transforms.
Signal Recovery by Proximal Forward-Backward Splitting
We show that various inverse problems in signal recovery can be formulated as the generic problem of minimizing the sum of two convex functions with certain regularity properties. This formulation…
Iterative Thresholding for Sparse Approximations
TLDR
This paper studies two iterative algorithms that are minimising the cost functions of interest and adapts the algorithms and shows on one example that this adaptation can be used to achieve results that lie between those obtained with Matching Pursuit and those found with Orthogonal Matching pursuit, while retaining the computational complexity of the Matching pursuit algorithm.
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ1 minimization
  • D. Donoho, Michael Elad
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2003
TLDR
This article obtains parallel results in a more general setting, where the dictionary D can arise from two or several bases, frames, or even less structured systems, and sketches three applications: separating linear features from planar ones in 3D data, noncooperative multiuser encoding, and identification of over-complete independent component models.
Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
Sparse MRI: The application of compressed sensing for rapid MR imaging
TLDR
Practical incoherent undersampling schemes are developed and analyzed by means of their aliasing interference and demonstrate improved spatial resolution and accelerated acquisition for multislice fast spin‐echo brain imaging and 3D contrast enhanced angiography.
Majorization–Minimization Algorithms for Wavelet-Based Image Restoration
TLDR
Several new results are proved which strongly support the claim that the SI does not compromise the usefulness of this class of algorithms, and introduce a new algorithm, resulting from using bounds for nonconvex regularizers, which confirms the superior performance of this method, when compared to the one based on quadratic majorization.
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
TLDR
The aim of this paper is to introduce a few key notions and applications connected to sparsity, targeting newcomers interested in either the mathematical aspects of this area or its applications.
...
...