The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Classification and clustering via dictionary learning with structured incoherence and shared features
Abstract
A clustering framework within the sparse modeling and dictionary learning setting is introduced in this work. Instead of searching for the set of centroid that best fit the data, as in k-means type of approaches that model the data as distributions around discrete points, we optimize for a set of dictionaries, one for each cluster, for which the signals are best reconstructed in a sparse coding manner. Thereby, we are modeling the data as a union of learned low dimensional subspaces, and data points associated to subspaces spanned by just a few atoms of the same learned dictionary are clustered together. An incoherence promoting term encourages dictionaries associated to different classes to be as independent as possible, while still allowing for different classes to share features. This term directly acts on the dictionaries, thereby being applicable both in the supervised and unsupervised settings. Using learned dictionaries for classification and clustering makes this method robust and well suited to handle large datasets. The proposed framework uses a novel measurement for the quality of the sparse representation, inspired by the robustness of the ℓ1regularization term in sparse coding. In the case of unsupervised classification and/or clustering, a new initialization based on combining sparse coding with spectral clustering is proposed. This initialization clusters the dictionary atoms, and therefore is based on solving a low dimensional eigen-decomposition problem, being applicable to large datasets. We first illustrate the proposed framework with examples on standard image and speech datasets in the supervised classification setting, obtaining results comparable to the state-of-the-art with this simple approach. We then present experiments for fully unsupervised clustering on extended standard datasets and texture images, obtaining excellent performance.
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 new look at the statistical model identification
Akaike, H. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100705 · Cited by 51,879
A tutorial on spectral clustering
von Luxburg, U. (2007) · Statistics and Computing · doi:10.1007/s11222-007-9033-z · Cited by 10,349
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
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
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
ANew Look at the Statistical Model Identification
AKAlKE, H. (2011) · Cited by 4,177
Greed is Good: Algorithmic Results for Sparse Approximation
Tropp, J. A. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834793 · Cited by 3,635
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
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
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Self-citationFrom Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Online dictionary learning for sparse coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553463 · Cited by 2,114
Self-citationSparse 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
Self-citationElhamifar, E., & Vidal, R. (2009) · 2009 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2009.5206547 · Cited by 1,243
Robust Recovery of Signals From a Structured Union of Subspaces
Eldar, Y. C., & Mishali, M. (2009) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2030471 · Cited by 1,044
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
Self-citationOptimized Projections for Compressed Sensing
Elad, M. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.900760 · Cited by 835
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
Self-citationSharing Visual Features for Multiclass and Multiview Object Detection
Torralba, A., Murphy, K. P., & Freeman, W. T. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1055 · Cited by 700
Sparse Representation for Signal Classification
Huang, K., & Aviyente, S. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0081 · Cited by 610
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/cvprw.2009.5206757 · Cited by 496
Generic object recognition with boosting
Opelt, A., Pinz, A., Fussenegger, M., & Auer, P. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.54 · Cited by 369
Vector Quantizing Feature Space with a Regular Lattice
Tuytelaars, T., & Schmid, C. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408924 · Cited by 169
Peyré, G. (2009) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-008-0120-3 · Cited by 165
Collaborative hierarchical sparse modeling
Sprechmann, P., Ramírez, I., Sapiro, G., & Eldar, Y. C. (2010) · Conference on Information Sciences and Systems · doi:10.1109/ciss.2010.5464845 · Cited by 44
Self-citationCombining Regions and Patches for Object Class Localization
Pantofaru, C., Dorkó, G., Schmid, C., & Hebert, M. (2006) · IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2006.57 · Cited by 28
Universal priors for sparse modeling
Ramírez, I., Lecumberry, F., & Sapiro, G. (2009) · IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing · doi:10.1109/camsap.2009.5413302 · Cited by 27
Self-citation
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
Fadlullah, Z. M., Tang, F., Mao, B., Kato, N., Akashi, O., Inoue, T., & Mizutani, K. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2707140 · Cited by 810
Metadata
- Authors
- Ramirez, I., Sprechmann, P., & Sapiro, G.
- Venue
- 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 3501-3508
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W1992405901
- Cited by
- 753
- References
- 28
- FWCI
- 62.62
- 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.