The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Discriminative K-SVD for dictionary learning in face recognition
Abstract
In a sparse-representation-based face recognition scheme, the desired dictionary should have good representational power (i.e., being able to span the subspace of all faces) while supporting optimal discrimination of the classes (i.e., different human subjects). We propose a method to learn an over-complete dictionary that attempts to simultaneously achieve the above two goals. The proposed method, discriminative K-SVD (D-KSVD), is based on extending the K-SVD algorithm by incorporating the classification error into the objective function, thus allowing the performance of a linear classifier and the representational power of the dictionary being considered at the same time by the same optimization procedure. The D-KSVD algorithm finds the dictionary and solves for the classifier using a procedure derived from the K-SVD algorithm, which has proven efficiency and performance. This is in contrast to most existing work that relies on iteratively solving sub-problems with the hope of achieving the global optimal through iterative approximation. We evaluate the proposed method using two commonly-used face databases, the Extended YaleB database and the AR database, with detailed comparison to 3 alternative approaches, including the leading state-of-the-art in the literature. The experiments show that the proposed method outperforms these competing methods in most of the cases. Further, using Fisher criterion and dictionary incoherence, we also show that the learned dictionary and the corresponding classifier are indeed better-posed to support sparse-representation-based recognition.
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
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
Candes, E. J., Romberg, J., & Tao, T. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.862083 · Cited by 15,639
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Belhumeur, P. N., Hespanha, J. P., & Kriegman, D. J. (1997) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.598228 · Cited by 11,707
$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
Face recognition: A literature survey
Zhao, W., Chellappa, R., Phillips, P. J., & Rosenfeld, A. (2003) · ACM Computing Surveys · doi:10.1145/954339.954342 · Cited by 6,163
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
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
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
Orthogonal least squares learning algorithm for radial basis function networks
Chen, S., Cowan, C. F. N., & Grant, P. M. (1991) · IEEE Transactions on Neural Networks · doi:10.1109/72.80341 · Cited by 3,362
Martínez, A. M. (1998) · Medical Entomology and Zoology · Cited by 2,830
Martínez, A. M. (1998) · CTIT technical reports series · Cited by 2,778
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
Sparse Representation for Color Image Restoration
Mairal, J., Elad, M., & Sapiro, G. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.911828 · Cited by 1,716
Lambertian reflectance and linear subspaces
Basri, R., & Jacobs, D. W. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1177153 · Cited by 1,576
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
Supervised Dictionary Learning
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0809.3083 · Cited by 938
Discriminative learned dictionaries for local image analysis
Mairal, J., Bach, F., Ponce, J., Sapiro, G., & Zisserman, A. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587652 · Cited by 726
11-magic : Recovery of sparse signals via convex programming
Candès, E. J. (2005) · Medical Entomology and Zoology · Cited by 725
Compression of facial images using the K-SVD algorithm
Bryt, O., & Elad, M. (2008) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2008.03.001 · Cited by 311
Joint learning and dictionary construction for pattern recognition
Pham, D.-S., & Venkatesh, S. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587408 · Cited by 232
Cited by
Dictionary learning for integrative, multimodal and scalable single-cell analysis
Hao, Y., Stuart, T., Kowalski, M. H., Choudhary, S., Hoffman, P., Hartman, A., Srivastava, A., Molla, G., Madad, S., Fernandez-Granda, C., et al. (2024) · Nature Biotechnology · doi:10.1038/s41587-023-01767-y · Cited by 5,631
Label Consistent K-SVD: Learning a Discriminative Dictionary for Recognition
Jiang, Z., Lin, Z., & Davis, L. S. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.88 · Cited by 1,222
A Survey of Sparse Representation: Algorithms and Applications
Zhang, Z., Xu, Y., Yang, J., Li, X., & Zhang, D. (2015) · IEEE Access · doi:10.1109/access.2015.2430359 · Cited by 1,092
Fisher Discrimination Dictionary Learning for sparse representation
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126286 · Cited by 934
Removing Rain from a Single Image via Discriminative Sparse Coding
Luo, Y., Xu, Y., & Ji, H. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.388 · Cited by 837
Metadata
- Authors
- Zhang, Q., & Li, B.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 2691-2698
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2027805700
- Cited by
- 1,237
- References
- 23
- FWCI
- 35.46
- 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.