The DOI matches its Crossref record; 64 of the 64 references it cites were found in a registry or an index.
Label Consistent K-SVD: Learning a Discriminative Dictionary for Recognition
Abstract
A label consistent K-SVD (LC-KSVD) algorithm to learn a discriminative dictionary for sparse coding is presented. In addition to using class labels of training data, we also associate label information with each dictionary item (columns of the dictionary matrix) to enforce discriminability in sparse codes during the dictionary learning process. More specifically, we introduce a new label consistency constraint called "discriminative sparse-code error" and combine it with the reconstruction error and the classification error to form a unified objective function. The optimal solution is efficiently obtained using the K-SVD algorithm. Our algorithm learns a single overcomplete dictionary and an optimal linear classifier jointly. The incremental dictionary learning algorithm is presented for the situation of limited memory resources. It yields dictionaries so that feature points with the same class labels have similar sparse codes. Experimental results demonstrate that our algorithm outperforms many recently proposed sparse-coding techniques for face, action, scene, and object category recognition under the same learning conditions.
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
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
Tropp, J. A., & Gilbert, A. C. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.909108 · Cited by 9,653
$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
Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories
Lazebnik, S., Schmid, C., & Ponce, J. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.68 · Cited by 7,916
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
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
Locality-constrained Linear Coding for image classification
Wang, J., Yang, J., Yu, K., Lv, F., Huang, T., & Gong, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5540018 · Cited by 3,100
Linear spatial pyramid matching using sparse coding for image classification
Yang, J., Yu, K., Gong, Y., & Huang, T. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206757 · Cited by 2,828
Martínez, A. M. (1998) · CTIT technical reports series · Cited by 2,778
Cited by
A comprehensive review on ensemble deep learning: Opportunities and challenges
Mohammed, A., & Kora, R. (2023) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2023.01.014 · Cited by 1,127
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
Multi-focus image fusion using dictionary-based sparse representation
Nejati, M., Samavi, S., & Shirani, S. (2015) · Information Fusion · doi:10.1016/j.inffus.2014.10.004 · Cited by 544
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
Semi-Supervised Learning With Graph Learning-Convolutional Networks
Jiang, B., Zhang, Z., Lin, D., Tang, J., & Luo, B. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.01157 · Cited by 471
Patch Group Based Nonlocal Self-Similarity Prior Learning for Image Denoising
Xu, J., Zhang, L., Zuo, W., Zhang, D., & Feng, X. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.36 · Cited by 393
Transfer adaptation learning: A decade survey
Zhang, L., & Gao, X. (2024) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3183326 · Cited by 314
Fang, L., Li, S., Kang, X., & Benediktsson, J. A. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2392755 · Cited by 266
A group lasso based sparse KNN classifier
Zheng, S., & Ding, C. (2020) · Pattern Recognition Letters · doi:10.1016/j.patrec.2019.12.020 · Cited by 22
Facial expression recognition using dual dictionary learning
Moeini, A., Faez, K., Moeini, H., & Safai, A. M. (2017) · Journal of Visual Communication and Image Representation · doi:10.1016/j.jvcir.2017.02.007 · Cited by 21
Fastfood dictionary learning for periocular-based full face hallucination
Juefei-Xu, F., & Savvides, M. (2016) · 2016 IEEE 8th International Conference on Biometrics Theory, Applications and Systems (BTAS) · doi:10.1109/btas.2016.7791174 · Cited by 19
Learning a Class-specific and Shared Dictionary for Classifying Surface Defects of Steel Sheet
Zhou, S., Chen, Y., Zhang, D., Xie, J., & Zhou, Y. (2017) · ISIJ International · doi:10.2355/isijinternational.isijint-2016-478 · Cited by 9
Metadata
- Authors
- Jiang, Z., Lin, Z., & Davis, L. S.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2013-11
- Volume
- 35
- Issue
- 11
- Pages
- 2651-2664
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W1963932623
- Cited by
- 1,222
- References
- 64
- FWCI
- 112.63
- 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.