The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Half-Quadratic-Based Iterative Minimization for Robust Sparse Representation
Abstract
Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explores their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an ℓ1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an ℓ1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the ℓ1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
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
$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
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
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470
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
Robust principal component analysis?
Candès, E. J., Li, X., Ma, Y., & Wright, J. (2011) · Journal of the ACM · doi:10.1145/1970392.1970395 · Cited by 6,921
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
Atomic Decomposition by Basis Pursuit
Chen, S. S., Donoho, D. L., & Saunders, M. A. (2001) · SIAM Review · doi:10.1137/s003614450037906x · Cited by 5,085
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
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
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Martínez, A. M. (1998) · CTIT technical reports series · Cited by 2,778
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
Efficient sparse coding algorithms
Lee, H., Battle, A., Raina, R., & Ng, A. Y. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0105 · Cited by 2,394
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 2×
“Based on conjugate function, a loss function in image restoration and signal recovery can be defined as [33], [39], [40],”
BackgroundMethodSparse representation or collaborative representation: Which helps face recognition?
Zhang, L., Yang, M., & Feng, X. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126277 · Cited by 1,952
Sparse Representation for Computer Vision and Pattern Recognition
Wright, J., Ma, Y., Mairal, J., Sapiro, G., Huang, T. S., & Yan, S. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044470 · Cited by 1,847
Correntropy: Properties and Applications in Non-Gaussian Signal Processing
Liu, W., Pokharel, P. P., & Principe, J. C. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.896065 · Cited by 1,695
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Yin, W., Osher, S., Goldfarb, D., & Darbon, J. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/070703983 · Cited by 1,414
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
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
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Constrained restoration and the recovery of discontinuities
Geman, D., & Reynolds, G. (1992) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.120331 · Cited by 1,085
Linear Regression for Face Recognition
Naseem, I., Togneri, R., & Bennamoun, M. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.128 · Cited by 1,012
Nonlinear image recovery with half-quadratic regularization
Geman, D., & Yang, C. (1995) · IEEE Transactions on Image Processing · doi:10.1109/83.392335 · Cited by 1,000
Parameter estimation techniques: a tutorial with application to conic fitting
Zhang, Z. (1997) · Image and Vision Computing · doi:10.1016/s0262-8856(96)01112-2 · Cited by 975
Information Theoretic Learning: Renyi's Entropy and Kernel Perspectives
Principe, J. C. (2010) · Information Science and Statistics · doi:10.1007/978-1-4419-1570-2 · Cited by 939
Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
Donoho, D. L., & Tsaig, Y. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2008.929958 · Cited by 829
Maximum Correntropy Criterion for Robust Face Recognition
He, R., Zheng, W.-S., & Hu, B.-G. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.220 · Cited by 670
Self-citationWagner, A., Wright, J., Ganesh, A., Zhou, Z., Mobahi, H., & Ma, Y. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.112 · Cited by 629
A Framework for Robust Subspace Learning
De la Torre, F., & Black, M. J. (2003) · International Journal of Computer Vision · doi:10.1023/a:1023709501986 · Cited by 604
Learning with $\ell ^{1}$-graph for image analysis
Cheng, B., Yang, J., Yan, S., Fu, Y., & Huang, T. S. (2010) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2038764 · Cited by 602
Robust sparse coding for face recognition
Yang, M., Zhang, L., Yang, J., & Zhang, D. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995393 · Cited by 589
A new compressive imaging camera architecture using optical-domain compression:
Takhar, D., Laska, J. N., Wakin, M. B., Duarte, M. F., Baron, D., Sarvotham, S., Kelly, K. F., & Baraniuk, R. G. (2006) · SPIE Proceedings · doi:10.1117/12.659602 · Cited by 497
Analysis of Half-Quadratic Minimization Methods for Signal and Image Recovery
Nikolova, M., & Ng, M. K. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030600862 · Cited by 478
Learning Multiscale Sparse Representations for Image and Video Restoration
Mairal, J., Sapiro, G., & Elad, M. (2008) · Multiscale Modeling & Simulation · doi:10.1137/070697653 · Cited by 460
Donoho, D., & Tanner, J. (2009) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2009.0152 · Cited by 436
ROBUST PRINCIPAL COMPONENT ANALYSIS
Alanzi, A. R. A. (2014) · OpenSIUC (Southern Illinois University Carbondale) · Cited by 419
Fast ℓ1-minimization algorithms and an application in robust face recognition: A review
Yang, A. Y., Sastry, S. S., Ganesh, A., & Ma, Y. (2010) · 2010 IEEE International Conference on Image Processing · doi:10.1109/icip.2010.5651522 · Cited by 414
An Architecture for Compressive Imaging
Wakin, M. B., Laska, J. N., Duarte, M. F., Baron, D., Sarvotham, S., Takhar, D., Kelly, K. F., & Baraniuk, R. G. (2006) · 2006 International Conference on Image Processing · doi:10.1109/icip.2006.312577 · Cited by 323
Dense Error Correction Via $\ell^1$-Minimization
Wright, J., & Ma, Y. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048473 · Cited by 305
Structured Sparse Principal Component Analysis
Jenatton, R., Obozinski, G., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0909.1440 · Cited by 277
Is face recognition really a Compressive Sensing problem?
Shi, Q., Eriksson, A., van den Hengel, A., & Shen, C. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995556 · Cited by 277
Proximal Thresholding Algorithm for Minimization over Orthonormal Bases
Combettes, P. L., & Pesquet, J.-C. (2008) · SIAM Journal on Optimization · doi:10.1137/060669498 · Cited by 190
Sparse reconstruction by separable approximation
Wright, S. J., Nowak, R. D., & Figueiredo, M. A. T. (2008) · 2008 IEEE International Conference on Acoustics, Speech and Signal Processing · doi:10.1109/icassp.2008.4518374 · Cited by 189
Fidler, S., Skocaj, D., & Leonardis, A. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.46 · Cited by 170
l2, 1 Regularized correntropy for robust feature selection
He, R., Tan, T., Wang, L., & Zheng, W. (2012) · 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.2012.6247966 · Cited by 152
Self-citationConvex half-quadratic criteria and interacting auxiliary variables for image restoration
Idier, J. (2001) · IEEE Transactions on Image Processing · doi:10.1109/83.931094 · Cited by 151
Robust feature extraction via information theoretic learning
Yuan, X., & Hu, B.-G. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553526 · Cited by 147
Robust Lasso With Missing and Grossly Corrupted Observations
Nguyen, N. H., & Tran, T. D. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2232347 · Cited by 134
Structured Sparse Error Coding for Face Recognition With Occlusion
Li, X., Dai, D., Zhang, X., & Ren, C.-X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2013.2237920 · Cited by 122
Bajwa, W. U., Haupt, J., Sayeed, A. M., et al. (2006) · International Conference on Information Processing in Sensor Networks (IPSN) · doi:10.1109/ipsn.2006.244128 · Cited by 121
A Regularized Correntropy Framework for Robust Pattern Recognition
He, R., Zheng, W., Hu, B.-G., & Kong, X. (2011) · Neural Computation · doi:10.1162/neco_a_00155 · Cited by 113
Self-citationRobust Sparse Analysis Regularization
Vaiter, S., Gabriel Peyré, A., Dossal, C., & Fadili, J. M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2233859 · Cited by 112
On global and local convergence of half-quadratic algorithms
Allain, M., Idier, J., & Goussard, Y. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2005.864173 · Cited by 95
Multi-stage Convex Relaxation for Learning with Sparse Regularization
Zhang, T. (2008) · Cited by 81
Expression of Concern:Implementation models for analog-to-information conversion via random sampling
Ragheb, T., Kirolos, S., Laska, J. N., et al. (2007) · doi:10.1109/mwscas.2007.4488599 · Cited by 78
Compressed signal reconstruction using the correntropy induced metric
Seth, S., & Príncipe, J. C. (2008) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2008.4518492 · Cited by 74
Fast wavelet-based image deconvolution using the EM algorithm
Nowak, R. D., & Figueiredo, M. A. T. (2001) · 2018 52nd Asilomar Conference on Signals, Systems, and Computers · doi:10.1109/acssc.2001.986953 · Cited by 67
Recovery of corrupted low-rank matrices via half-quadratic based nonconvex minimization
He, R., Sun, Z., Tan, T., & Zheng, W. (2011) · 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.2011.5995328 · Cited by 48
Self-citationSparse Representation-based Image Deconvolution by iterative Thresholding
Fadili, J. M., & Starck, J. (2006) · HAL · Cited by 47
A Connection Between Half-Quadratic Criteria and EM Algorithms
Champagnat, F., & Idier, J. (2004) · IEEE Signal Processing Letters · doi:10.1109/lsp.2004.833511 · Cited by 44
An energy-based framework for dense 3D registration of volumetric brain images
Pierre Hellier, J., Barillot, C., Mémin, É., & Pérez, P. (2002) · 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.2000.854805 · Cited by 15
Cited by
Yang, J., Luo, L., Qian, J., Tai, Y., Zhang, F., & Xu, Y. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2535218 · Cited by 360
Deep Generalized Unfolding Networks for Image Restoration
Mou, C., Wang, Q., & Zhang, J. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01688 · Cited by 290
Metadata
- Authors
- He, R., Zheng, W.-S., Tan, T., & Sun, Z.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2014-02
- Volume
- 36
- Issue
- 2
- Pages
- 261-275
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2050849575
- Cited by
- 342
- References
- 69
- FWCI
- 25.22
- Type
- journal article
- 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.