The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
A Generalized Iterated Shrinkage Algorithm for Non-convex Sparse Coding
Abstract
In many sparse coding based image restoration and image classification problems, using non-convex Ip-norm minimization (0 ≤ p1-norm minimization. A number of algorithms, e.g., iteratively reweighted least squares (IRLS), iteratively thresholding method (ITM-Ip), and look-up table (LUT), have been proposed for non-convex Ip-norm sparse coding, while some analytic solutions have been suggested for some specific values of p. In this paper, by extending the popular soft-thresholding operator, we propose a generalized iterated shrinkage algorithm (GISA) for Ip-norm non-convex sparse coding. Unlike the analytic solutions, the proposed GISA algorithm is easy to implement, and can be adopted for solving non-convex sparse coding problems with arbitrary p values. Compared with LUT, GISA is more general and does not need to compute and store the look-up tables. Compared with IRLS and ITM-Ip, GISA is theoretically more solid and can achieve more accurate solutions. Experiments on image restoration and sparse coding based face recognition are conducted to validate the performance of GISA.
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
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
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Robust Face Recognition via Sparse Representation
Wright, J., Yang, A. Y., Ganesh, A., Sastry, S. S., & Ma, Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.79 · Cited by 9,388
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Candes, E. J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.885507 · Cited by 6,839
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
From few to many: illumination cone models for face recognition under variable lighting and pose
Georghiades, A. S., Belhumeur, P. N., & Kriegman, D. J. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.927464 · Cited by 4,912
Enhancing Sparsity by Reweighted ℓ 1 Minimization
Candès, E. J., Wakin, M. B., & Boyd, S. P. (2008) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-008-9045-x · Cited by 4,863
Sparse Approximate Solutions to Linear Systems
Natarajan, B. K. (1995) · SIAM Journal on Computing · doi:10.1137/s0097539792240406 · Cited by 2,783
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20132 · Cited by 2,490
Acquiring linear subspaces for face recognition under variable lighting
Lee, K.-C., Ho, J., & Kriegman, D. J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.92 · Cited by 2,391
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064 · cited 1×
“, Two-step IST (TwIST) [5] and accelerated proximal gradient (APG) [4], have been proposed to speedup IST.”
Beck, A., & Teboulle, M. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028250 · Cited by 2,004
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Sparse and Redundant Representations: From Theory to Applications in Signal and Image Processing
Elad, M. (2010) · doi:10.1007/978-1-4419-7011-4 · Cited by 1,897
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
Exact Reconstruction of Sparse Signals via Nonconvex Minimization
Chartrand, R. (2007) · IEEE Signal Processing Letters · doi:10.1109/lsp.2007.898300 · Cited by 1,277
Iteratively reweighted algorithms for compressive sensing
Chartrand, R., & Yin, W. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518498 · Cited by 1,248
Fast Image Recovery Using Variable Splitting and Constrained Optimization
Afonso, M. V., Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2047910 · Cited by 1,223
Fast Image Deconvolution using Hyper-Laplacian Priors
Krishnan, D., & Fergus, R. (2009) · Cited by 1,205
$L_{1/2}$ Regularization: A Thresholding Representation Theory and a Fast Solver
Xu, Z., Chang, X., Xu, F., & Zhang, H. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197412 · Cited by 1,062
Image and depth from a conventional camera with a coded aperture
Levin, A., Fergus, R., Durand, F., & Freeman, W. T. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276464 · Cited by 1,023
Image and depth from a conventional camera with a coded aperture
Levin, A., Fergus, R., Durand, F., & Freeman, W. T. (2007) · ACM Transactions on Graphics · doi:10.1145/1276377.1276464 · Cited by 980
Sparsest solutions of underdetermined linear systems via ℓq-minimization for 0<q⩽1
Foucart, S., & Lai, M.-J. (2009) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2008.09.001 · Cited by 715
Donoho, D. L. (2006) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20131 · Cited by 634
Noise removal via Bayesian wavelet coring
Simoncelli, E. P., & Adelson, E. H. (2002) · Proceedings of 3rd IEEE International Conference on Image Processing · doi:10.1109/icip.1996.559512 · Cited by 612
Restricted isometry properties and nonconvex compressive sensing
Chartrand, R., & Staneva, V. (2008) · Inverse Problems · doi:10.1088/0266-5611/24/3/035020 · Cited by 597
Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization
Cetin, M., & Karl, W. C. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.913596 · Cited by 562
Quantitative Robust Uncertainty Principles and Optimally Sparse Decompositions
Candes, E. J., & Romberg, J. (2006) · Foundations of Computational Mathematics · doi:10.1007/s10208-004-0162-x · Cited by 504
SparseNet: Coordinate Descent With Nonconvex Penalties
Mazumder, R., Friedman, J. H., & Hastie, T. (2011) · Journal of the American Statistical Association · doi:10.1198/jasa.2011.tm09738 · Cited by 449
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
Recovering Sparse Signals With a Certain Family of Nonconvex Penalties and DC Programming
Gasso, G., Rakotomamonjy, A., & Canu, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2026004 · Cited by 304
Wavelets in statistics: A review
Antoniadis, A. (1997) · Journal of the Italian Statistical Society · doi:10.1007/bf03178905 · Cited by 229
On $l_q$ Optimization and Matrix Completion
Marjanovic, G., & Solo, V. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2212015 · Cited by 194
Lai, M.-J., & Wang, J. (2011) · SIAM Journal on Optimization · doi:10.1137/090775397 · Cited by 188
Image deblurring and denoising using color priors
Joshi, N., Zitnick, C. L., Szeliski, R., & Kriegman, D. J. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206802 · Cited by 188
Image Restoration by Matching Gradient Distributions
Cho, T. S., Zitnick, C. L., Joshi, N., Kang, S. B., Szeliski, R., & Freeman, W. T. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.166 · Cited by 156
Thresholding-based iterative selection procedures for model selection and shrinkage
She, Y. (2009) · Electronic Journal of Statistics · doi:10.1214/08-ejs348 · Cited by 139
A comparison of typical ℓ minimization algorithms
Lyu, Q., Lin, Z., She, Y., & Zhang, C. (2013) · Neurocomputing · doi:10.1016/j.neucom.2013.03.017 · Cited by 119
A Generalized Accelerated Proximal Gradient Approach for Total-Variation-Based Image Restoration
Zuo, W., & Lin, Z. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2131665 · Cited by 110
Self-citationFast L1-Minimization Algorithms For Robust Face RecognitionPreprint
Yang, A. Y., Zhou, Z., Ganesh, A., Sastry, S., & Ma, Y. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1007.3753 · Cited by 102
Cho, T. S., Joshi, N., Zitnick, C. L., Kang, S. B., Szeliski, R., & Freeman, W. T. (2010) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2010.5540214 · Cited by 102
She, Y. (2011) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2011.11.013 · Cited by 80
High-quality image deblurring with panchromatic pixels
Wang, S., Hou, T., Border, J., et al. (2012) · ACM Transactions on Graphics · doi:10.1145/2231816.2231818 · Cited by 9
Cited by
Rank Minimization for Snapshot Compressive Imaging
Liu, Y., Yuan, X., Suo, J., Brady, D. J., & Dai, Q. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2873587 · Cited by 466
Learning Iteration-wise Generalized Shrinkage-Thresholding Operators for Blind Deconvolution
Zuo, W., Ren, D., Zhang, D., Gu, S., & Zhang, L. (2016) · IEEE Transactions on Image Processing · doi:10.1109/tip.2016.2531905 · Cited by 107
Self-citation
Metadata
- Authors
- Zuo, W., Meng, D., Zhang, L., Feng, X., & Zhang, D.
- Venue
- 2013 IEEE International Conference on Computer Vision
- Publisher
- IEEE
- Published
- 2013-12
- Pages
- 217-224
- OpenAlex
- W2111854674
- Cited by
- 396
- References
- 43
- FWCI
- 35.30
- Type
- conference paper
- Language
- en
- Open access
- closed
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.