The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
The cosparse analysis model and algorithms
Open accessAbstract
After a decade of extensive study of the sparse representation synthesis model, we can safely say that this is a mature and stable field, with clear theoretical foundations, and appealing applications. Alongside this approach, there is an analysis counterpart model, which, despite its similarity to the synthesis alternative, is markedly different. Surprisingly, the analysis model did not get a similar attention, and its understanding today is shallow and partial. In this paper we take a closer look at the analysis approach, better define it as a generative model for signals, and contrast it with the synthesis one. This work proposes effective pursuit methods that aim to solve inverse problems regularized with the analysis-model prior, accompanied by a preliminary theoretical study of their performance. We demonstrate the effectiveness of the analysis model in several experiments, and provide a detailed study of the model associated with the 2D finite difference analysis operator, a close cousin of the TV norm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
Aharon, M., Elad, M., & Bruckstein, A. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.881199 · Cited by 9,451
Self-citationMatching pursuits with time-frequency dictionaries
Mallat, S. G., & Zhang, Z. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.258082 · Cited by 9,112
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596304010 · Cited by 6,845
Image Denoising Via Sparse and Redundant Representations Over Learned Dictionaries
Elad, M., & Aharon, M. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881969 · Cited by 5,321
Self-citationThe contourlet transform: an efficient directional multiresolution image representation
Do, M. N., & Vetterli, M. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.859376 · Cited by 3,952
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Donoho, D. L., & Elad, M. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0437847100 · Cited by 2,898
Self-citationSparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Subspace Pursuit for Compressive Sensing Signal Reconstruction
Dai, W., & Milenkovic, O. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2016006 · Cited by 2,388
The curvelet transform for image denoising
Starck, J.-L., Candes, E. J., & Donoho, D. L. (2002) · IEEE Transactions on Image Processing · doi:10.1109/tip.2002.1014998 · Cited by 2,253
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Self-citationUncertainty principles and ideal atomic decomposition
Donoho, D. L., & Huo, X. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.959265 · Cited by 1,949
Sparse signal reconstruction from limited data using FOCUSS: a re-weighted minimum norm algorithm
Gorodnitsky, I. F., & Rao, B. D. (1997) · IEEE Transactions on Signal Processing · doi:10.1109/78.558475 · Cited by 1,834
The Dantzig selector: Statistical estimation when p is much larger than n
Candes, E., & Tao, T. (2007) · The Annals of Statistics · doi:10.1214/009053606000001523 · Cited by 1,747
Just relax: convex programming methods for identifying sparse signals in noise
Tropp, J. A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.864420 · Cited by 1,407
Iteratively reweighted least squares minimization for sparse recovery
Daubechies, I., DeVore, R., Fornasier, M., & Güntürk, C. S. (2010) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20303 · Cited by 1,295
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Sparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Self-citationSimultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
Elad, M., Starck, J.-L., Querre, P., & Donoho, D. L. (2005) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2005.03.005 · Cited by 904
Self-citationCompressed sensing with coherent and redundant dictionaries
Candès, E. J., Eldar, Y. C., Needell, D., & Randall, P. (2011) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2010.10.002 · Cited by 898
Zero-crossings of a wavelet transform
Mallat, S. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86995 · Cited by 704
Analysis versus synthesis in signal priors
Elad, M., Milanfar, P., & Rubinstein, R. (2007) · Inverse Problems · doi:10.1088/0266-5611/23/3/007 · Cited by 698
Self-citationSplit Bregman Methods and Frame Based Image Restoration
Cai, J.-F., Osher, S., & Shen, Z. (2010) · Multiscale Modeling & Simulation · doi:10.1137/090753504 · Cited by 670
Advances and challenges in super‐resolution
Farsiu, S., Robinson, D., Elad, M., et al. (2004) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20007 · Cited by 623
Self-citationRedundant Multiscale Transforms and Their Application for Morphological Component Separation
Starck, J.-L., Elad, M., & Donoho, D. (2004) · Advances in Imaging and Electron Physics · doi:10.1016/s1076-5670(04)32006-9 · Cited by 443
Self-citationRecursive Least Squares Dictionary Learning Algorithm
Skretting, K., & Engan, K. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2040671 · Cited by 387
A Theory for Sampling Signals From a Union of Subspaces
Lu, Y. M., & Do, M. N. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.914346 · Cited by 286
Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
Blumensath, T., & Davies, M. E. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2013003 · Cited by 269
Self-citationMulti-frame compression: theory and design
Engan, K., Aase, S. O., & Husøy, J. H. (2000) · Signal Processing · doi:10.1016/s0165-1684(00)00072-4 · Cited by 255
Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise
Ben-Haim, Z., Eldar, Y. C., & Elad, M. (2010) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2010.2052460 · Cited by 241
Self-citationSparse Representations in Audio and Music: From Coding to Source Separation
Plumbley, M. D., Blumensath, T., Daudet, L., Gribonval, R., & Davies, M. E. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2009.2030345 · Cited by 207
Self-citationHighly sparse representations from dictionaries are unique and independent of the sparseness measure
Gribonval, R., & Nielsen, M. (2007) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2006.09.003 · Cited by 185
Self-citationSignal restoration with overcomplete wavelet transforms: comparison of analysis and synthesis priors
Selesnick, I. W., & Figueiredo, M. A. T. (2009) · SPIE Proceedings · doi:10.1117/12.826663 · Cited by 175
Wavelet footprints: theory, algorithms, and applications
Dragotti, P. L., & Vetterli, M. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.810296 · Cited by 128
Image restoration through l0 analysis-based sparse optimization in tight frames
Portilla, J. (2009) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2009.5413975 · Cited by 98
Blind Audiovisual Source Separation Based on Sparse Redundant Representations
Casanovas, A. L., Monaci, G., Vandergheynst, P., & Gribonval, R. (2010) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2010.2050650 · Cited by 79
Self-citation
Cited by
An introduction to continuous optimization for imaging
Chambolle, A., & Pock, T. (2016) · Acta Numerica · doi:10.1017/s096249291600009x · Cited by 545
Analysis K-SVD: A Dictionary-Learning Algorithm for the Analysis Sparse Model
Rubinstein, R., Peleg, T., & Elad, M. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2226445 · Cited by 471
Self-citationSparse Regularization via Convex Analysis
Selesnick, I. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2711501 · Cited by 429
A survey of sound source localization with deep learning methods
Grumiaux, P.-A., Kitić, S., Girin, L., & Guérin, A. (2022) · The Journal of the Acoustical Society of America · doi:10.1121/10.0011809 · Cited by 347
AMP-Net: Denoising-Based Deep Unfolding for Compressive Image Sensing
Zhang, Z., Liu, Y., Liu, J., Wen, F., & Zhu, C. (2021) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.3044472 · Cited by 311
Metadata
- Authors
- Nam, S., Davies, M. E., Elad, M., & Gribonval, R.
- Venue
- Applied and Computational Harmonic Analysis
- Publisher
- Elsevier BV
- Published
- 2013-01
- Volume
- 34
- Issue
- 1
- Pages
- 30-56
- ISSN
- 1063-5203 (ISSN-L)
- OpenAlex
- W2152171106
- Cited by
- 353
- References
- 39
- FWCI
- 32.09
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.