The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
Laplacian Regularized Low-Rank Representation and Its Applications
Abstract
Low-rank representation (LRR) has recently attracted a great deal of attention due to its pleasing efficacy in exploring low-dimensional subspace structures embedded in data. For a given set of observed data corrupted with sparse errors, LRR aims at learning a lowest-rank representation of all data jointly. LRR has broad applications in pattern recognition, computer vision and signal processing. In the real world, data often reside on low-dimensional manifolds embedded in a high-dimensional ambient space. However, the LRR method does not take into account the non-linear geometric structures within data, thus the locality and similarity information among data may be missing in the learning process. To improve LRR in this regard, we propose a general Laplacian regularized low-rank representation framework for data representation where a hypergraph Laplacian regularizer can be readily introduced into, i.e., a Non-negative Sparse Hyper-Laplacian regularized LRR model (NSHLRR). By taking advantage of the graph regularizer, our proposed method not only can represent the global low-dimensional structures, but also capture the intrinsic non-linear geometric information in data. The extensive experimental results on image clustering, semi-supervised image classification and dimensionality reduction tasks demonstrate the effectiveness of the proposed method.
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
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
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
Chiang, L. H., Russell, E. L., & Braatz, R. D. (2001) · Advanced Textbooks in Control and Signal Processing · doi:10.1007/978-1-4471-0347-9_4 · Cited by 6,594
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Chung, F. (1996) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/092 · Cited by 5,524
Dimensionality Reduction by Learning an Invariant Mapping
Hadsell, R., Chopra, S., & LeCun, Y. (2006) · 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (CVPR'06) · doi:10.1109/cvpr.2006.100 · Cited by 5,336
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
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Self-citationSemi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Face recognition using Laplacianfaces
He, X., Yan, S., Hu, Y., Niyogi, P., & Zhang, H.-J. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.55 · Cited by 3,264
Graph Embedding and Extensions: A General Framework for Dimensionality Reduction
Yan, S., Xu, D., Zhang, B., Zhang, H.-J., Yang, Q., & Lin, S. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.250598 · Cited by 3,031
Graph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451
Kuybeda, O., Frank, G. A., Bartesaghi, A., Borgnia, M., Subramaniam, S., & Sapiro, G. (2013) · Journal of Structural Biology · doi:10.1016/j.jsb.2012.10.010 · Cited by 2,162
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
Robust Subspace Segmentation by Low-Rank Representation
Liu, G., Lin, Z., & Yu, Y. H. (2010) · Cited by 1,534
Self-citationNeighborhood preserving embedding
He, X., Cai, D., Yan, S., & Zhang, H.-J. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.167 · Cited by 1,502
Wright, J. N., Ganesh, A., Rao, S., Peng, Y., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 1,495
Learning with Hypergraphs: Clustering, Classification, and Embedding
Zhou, D., Huang, J., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0205 · Cited by 1,283
The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices
Lin, Z., Chen, M., & Ma, Y. (2010) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · doi:10.48550/arxiv.1009.5055 · Cited by 1,176
Self-citationRandom Walks and Electric Networks
Doyle, P., & Snell, J. (1984) · Carus Mathematical Monographs · doi:10.5948/upo9781614440222 · Cited by 1,061
Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
Lin, Z., Liu, R., & Su, Z. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.0367 · Cited by 992
Self-citationToh, K.-C., & Yun, S. (2009) · National University of Singapore · Cited by 923
(2002) · Springer Series in Statistics · doi:10.1007/b98835 · Cited by 919
Latent Low-Rank Representation for subspace segmentation and feature extraction
Liu, G., & Yan, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126422 · Cited by 679
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
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
Graph Regularized Sparse Coding for Image Representation
Zheng, M., Bu, J., Chen, C., Wang, C., Zhang, L., Qiu, G., & Cai, D. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2010.2090535 · Cited by 562
An accelerated gradient method for trace norm minimization
Ji, S., & Ye, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553434 · Cited by 517
Fast Convex Optimization Algorithms for Exact Recovery of a Corrupted Low-Rank Matrix
Lin, Z., Ganesh, A., Wright, J. N., Wu, L., Chen, M., & Ma, Y. (2009) · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · Cited by 462
Self-citationRecovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Tao, M., & Yuan, X. (2011) · SIAM Journal on Optimization · doi:10.1137/100781894 · Cited by 453
Robust principal component analysis for computer vision
De la Torre, F., & Black, M. J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937541 · Cited by 387
Alternating direction augmented Lagrangian methods for semidefinite programming
Wen, Z., Goldfarb, D., & Yin, W. (2010) · Mathematical Programming Computation · doi:10.1007/s12532-010-0017-1 · Cited by 359
Laplacian Sparse Coding, Hypergraph Laplacian Sparse Coding, and Applications
Gao, S., Tsang, I. W.-H., & Chia, L.-T. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.63 · Cited by 357
Graph-Regularized Low-Rank Representation for Destriping of Hyperspectral Images
Lu, X., Wang, Y., & Yuan, Y. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2226730 · Cited by 337
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Babacan, S. D., Luessi, M., Molina, R., & Katsaggelos, A. K. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2197748 · Cited by 327
Non-negative low rank and sparse graph for semi-supervised learning
Zhuang, L., Gao, H., Lin, Z., Ma, Y., Zhang, X., & Yu, N. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247944 · Cited by 316
Self-citationTILT: Transform Invariant Low-Rank Textures
Zhang, Z., Ganesh, A., Liang, X., & Ma, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-012-0515-x · Cited by 277
Laplacian Regularized Gaussian Mixture Model for Data Clustering
He, X., Cai, D., Shao, Y., Bao, H., & Han, J. (2011) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2010.259 · Cited by 246
Locality preserving nonnegative matrix factorization
Cai, D., He, X., Wang, X., Bao, H., & Han, J. (2009) · International Joint Conference on Artificial Intelligence · Cited by 243
Low-rank matrix recovery with structural incoherence for robust face recognition
Chen, C.-F., Wei, C.-P., & Wang, Y.-C. F. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6247981 · Cited by 215
Spectral Regression: A Unified Approach for Sparse Subspace Learning
Cai, D., He, X., & Han, J. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.89 · Cited by 212
Low-Rank Matrix Approximation with Manifold Regularization
Zhang, Z., & Zhao, K. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.274 · Cited by 180
Lin, Z., Liu, R., & Li, H. (2015) · Machine Learning · doi:10.1007/s10994-014-5469-5 · Cited by 179
Self-citationLinear Neighborhood Propagation and Its Applications
Wang, J., Wang, F., Zhang, C., Shen, H. C., & Quan, L. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.216 · Cited by 165
TILT: Transform Invariant Low-Rank Textures
Zhang, Z., Liang, X., Ganesh, A., & Ma, Y. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19318-7_25 · Cited by 100
Robust L1 Principal Component Analysis and Its Bayesian Variational Inference
Gao, J. (2007) · Neural Computation · doi:10.1162/neco.2007.11-06-397 · Cited by 97
Self-citationSemi‐supervised low‐rank representation graph for pattern recognition
Yang, S., Wang, X., Wang, M., Han, Y., & Jiao, L. (2013) · IET Image Processing · doi:10.1049/iet-ipr.2012.0322 · Cited by 22
Transposed Low Rank Representation for Image Classification
Bull, G., & Gao, J. (2012) · International Conference on Digital Image Computing: Techniques and Applications (DICTA) · doi:10.1109/dicta.2012.6411718 · Cited by 12
Self-citation
Cited by
A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications
Cai, H., Zheng, V. W., & Chang, K. C.-C. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2807452 · Cited by 2,034
Graph and Total Variation Regularized Low-Rank Representation for Hyperspectral Anomaly Detection
Cheng, T., & Wang, B. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2019.2936609 · Cited by 266
Metadata
- Authors
- Yin, M., Gao, J., & Lin, Z.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2016-03-01
- Volume
- 38
- Issue
- 3
- Pages
- 504-517
- ISSN
- 0162-8828 (ISSN-L)
- 2160-9292
- OpenAlex
- W2262946425
- Cited by
- 442
- References
- 56
- FWCI
- 33.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.