The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
Open accessAbstract
We propose a new fast algorithm for solving one of the standard approaches to ill-posed linear inverse problems (IPLIP), where a (possibly nonsmooth) regularizer is minimized under the constraint that the solution explains the observations sufficiently well. Although the regularizer and constraint are usually convex, several particular features of these problems (huge dimensionality, nonsmoothness) preclude the use of off-the-shelf optimization tools and have stimulated a considerable amount of research. In this paper, we propose a new efficient algorithm to handle one class of constrained problems (often known as basis pursuit denoising) tailored to image recovery applications. The proposed algorithm, which belongs to the family of augmented Lagrangian methods, can be used to deal with a variety of imaging IPLIP, including deconvolution and reconstruction from compressive observations (such as MRI), using either total-variation or wavelet-based (or, more generally, frame-based) regularization. The proposed algorithm is an instance of the so-called alternating direction method of multipliers, for which convergence sufficient conditions are known; we show that these conditions are satisfied by the proposed algorithm. Experiments on a set of image restoration and reconstruction benchmark problems show that the proposed algorithm is a strong contender for the state-of-the-art.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
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
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Stable signal recovery from incomplete and inaccurate measurements
Candès, E. J., Romberg, J. K., & Tao, T. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20124 · Cited by 7,036
Sparse MRI: The application of compressed sensing for rapid MR imaging
Lustig, M., Donoho, D., & Pauly, J. M. (2007) · Magnetic Resonance in Medicine · doi:10.1002/mrm.21391 · Cited by 6,952
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
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Figueiredo, M. A. T., Nowak, R. D., & Wright, S. J. (2007) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2007.910281 · Cited by 3,524
Self-citationchambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
ISTA-Net: Interpretable Optimization-Inspired Deep Network for Image Compressive Sensing
Zhang, J., & Ghanem, B. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00196 · Cited by 1,309
Semantic Image Inpainting with Deep Generative Models
Yeh, R. A., Chen, C., Lim, T. Y., Schwing, A. G., Hasegawa-Johnson, M., & Do, M. N. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.728 · Cited by 1,206
The Little Engine That Could: Regularization by Denoising (RED)
Romano, Y., Elad, M., & Milanfar, P. (2017) · SIAM Journal on Imaging Sciences · doi:10.1137/16m1102884 · Cited by 934
A Convex Formulation for Hyperspectral Image Superresolution via Subspace-Based Regularization
Simoes, M., Bioucas-Dias, J., Almeida, L. B., & Chanussot, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2375320 · Cited by 826
Self-citationHyperspectral Pansharpening: A Review
Loncan, L., de Almeida, L. B., Bioucas-Dias, J. M., Briottet, X., Chanussot, J., Dobigeon, N., Fabre, S., Liao, W., Licciardi, G. A., Simoes, M., et al. (2015) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2015.2440094 · Cited by 824
Self-citationTotal Variation Spatial Regularization for Sparse Hyperspectral Unmixing
Iordache, M.-D., Bioucas-Dias, J. M., & Plaza, A. (2012) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2191590 · Cited by 753
Self-citationHyperspectral and Multispectral Data Fusion: A comparative review of the recent literature
Yokoya, N., Grohnfeldt, C., & Chanussot, J. (2017) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2016.2637824 · Cited by 712
Hyperspectral and Multispectral Image Fusion Based on a Sparse Representation
Wei, Q., Bioucas-Dias, J., Dobigeon, N., & Tourneret, J.-Y. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2381272 · Cited by 698
Self-citationAccelerated Dynamic MRI Exploiting Sparsity and Low-Rank Structure: k-t SLR
Lingala, S. G., Hu, Y., DiBella, E., & Jacob, M. (2011) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2010.2100850 · Cited by 664
Single-shot compressed ultrafast photography at one hundred billion frames per second
Gao, L., Liang, J., Li, C., & Wang, L. V. (2014) · Nature · doi:10.1038/nature14005 · Cited by 629
BM3D Frames and Variational Image Deblurring
Danielyan, A., Katkovnik, V., & Egiazarian, K. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2176954 · Cited by 611
Templates for convex cone problems with applications to sparse signal recovery
Becker, S. R., Candès, E. J., & Grant, M. C. (2011) · Mathematical Programming Computation · doi:10.1007/s12532-011-0029-5 · Cited by 608
Collaborative Sparse Regression for Hyperspectral Unmixing
Iordache, M.-D., Bioucas-Dias, J. M., & Plaza, A. (2014) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2013.2240001 · Cited by 485
Self-citationFast Fusion of Multi-Band Images Based on Solving a Sylvester Equation
Wei, Q., Dobigeon, N., & Tourneret, J.-Y. (2015) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2458572 · Cited by 474
Komodakis, N., & Pesquet, J.-C. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2377273 · Cited by 419
Efficient Algorithms for Convolutional Sparse Representations
Wohlberg, B. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2015.2495260 · Cited by 413
Hyperspectral Image Denoising via Sparse Representation and Low-Rank Constraint
Zhao, Y.-Q., & Yang, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2321557 · Cited by 392
Fast $\ell_{1}$-Minimization Algorithms for Robust Face Recognition
Yang, A. Y., Zhou, Z., Balasubramanian, A. G., Sastry, S. S., & Ma, Y. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2262292 · Cited by 341
High-quality hyperspectral reconstruction using a spectral prior
Choi, I., Jeon, D. S., Nam, G., Gutierrez, D., & Kim, M. H. (2017) · ACM Transactions on Graphics · doi:10.1145/3130800.3130810 · Cited by 320
A Splitting-Based Iterative Algorithm for Accelerated Statistical X-Ray CT Reconstruction
Ramani, S., & Fessler, J. A. (2012) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2011.2175233 · Cited by 257
Representer Theorems for Sparsity-Promoting $\ell _{1}$ Regularization
Unser, M., Fageot, J., & Gupta, H. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2590421 · Cited by 36
Metadata
- Authors
- Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2011-03
- Volume
- 20
- Issue
- 3
- Pages
- 681-695
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2123031198
- Cited by
- 938
- References
- 43
- FWCI
- 37.22
- 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.