The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Morphological Component Analysis: An Adaptive Thresholding Strategy
Open accessAbstract
In a recent paper, a method called morphological component analysis (MCA) has been proposed to separate the texture from the natural part in images. MCA relies on an iterative thresholding algorithm, using a threshold which decreases linearly towards zero along the iterations. This paper shows how the MCA convergence can be drastically improved using the mutual incoherence of the dictionaries associated to the different components. This modified MCA algorithm is then compared to basis pursuit, and experiments show that MCA and BP solutions are similar in terms of sparsity, as measured by the l1 norm, but MCA is much faster and gives us the possibility of handling large scale data sets.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
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
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-citationFast Discrete Curvelet Transforms
Candès, E., Demanet, L., Donoho, D., & Ying, L. (2006) · Multiscale Modeling & Simulation · doi:10.1137/05064182x · Cited by 2,573
Self-citationThe 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
Self-citationDonoho, D. L., Tsaig, Y., Drori, I., & Starck, J.-L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2173241 · Cited by 1,509
Self-citationJust 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
The transformation of poisson, binomial and negative-binomial data
ANSCOMBE, F. J. (1948) · Biometrika · doi:10.1093/biomet/35.3-4.246 · Cited by 1,300
Image decomposition via the combination of sparse representations and a variational approach
Starck, J.-L., Elad, M., & Donoho, D. L. (2005) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.852206 · Cited by 987
Self-citationSparse representations in unions of bases
Gribonval, R., & Nielsen, M. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.820031 · Cited by 960
Cited by
Image De-Raining Using a Conditional Generative Adversarial Network
Zhang, H., Sindagi, V., & Patel, V. M. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2920407 · Cited by 1,214
Dong, W., Zhang, L., Shi, G., & Wu, X. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2108306 · Cited by 1,124
Automatic Single-Image-Based Rain Streaks Removal via Image Decomposition
Kang, L.-W., Lin, C.-W., & Fu, Y.-H. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2179057 · Cited by 905
Sparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0722-8 · Cited by 489
Ma, J., & Plonka, G. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2009.935453 · Cited by 464
L1-L2 Optimization in Signal and Image Processing
Zibulevsky, M., & Elad, M. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936023 · Cited by 426
Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing
Maleki, A., & Donoho, D. L. (2010) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2009.2039176 · Cited by 289
Self-citation
Metadata
- Authors
- Bobin, J., Starck, J.-L., Fadili, J. M., Moudden, Y., & Donoho, D. L.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2007-11
- Volume
- 16
- Issue
- 11
- Pages
- 2675-2681
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2121651107
- Cited by
- 314
- References
- 21
- FWCI
- 14.60
- Type
- journal article
- Language
- en
- Open access
- green
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.