The DOI matches its Crossref record; 44 of the 44 references it cites were found in a registry or an index.
Image Clustering Using Local Discriminant Models and Global Integration
Abstract
In this paper, we propose a new image clustering algorithm, referred to as clustering using local discriminant models and global integration (LDMGI). To deal with the data points sampled from a nonlinear manifold, for each data point, we construct a local clique comprising this data point and its neighboring data points. Inspired by the Fisher criterion, we use a local discriminant model for each local clique to evaluate the clustering performance of samples within the local clique. To obtain the clustering result, we further propose a unified objective function to globally integrate the local models of all the local cliques. With the unified objective function, spectral relaxation and spectral rotation are used to obtain the binary cluster indicator matrix for all the samples. We show that LDMGI shares a similar objective function with the spectral clustering (SC) algorithms, e.g., normalized cut (NCut). In contrast to NCut in which the Laplacian matrix is directly calculated based upon a Gaussian function, a new Laplacian matrix is learnt in LDMGI by exploiting both manifold structure and local discriminant information. We also prove that K-means and discriminative K-means (DisKmeans) are both special cases of LDMGI. Extensive experiments on several benchmark image datasets demonstrate the effectiveness of LDMGI. We observe in the experiments that LDMGI is more robust to algorithmic parameter, when compared with NCut. Thus, LDMGI is more appealing for the real image clustering applications in which the ground truth is generally not available for tuning algorithmic parameters.
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
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
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
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Combinatorial Optimization: Algorithms and Complexity.
Johnson, D. S., Papadimitriou, C. H., & Steiglitz, K. (1984) · The American Mathematical Monthly · doi:10.2307/2322374 · Cited by 5,942
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
Introduction to statistical pattern recognition (2nd ed.)
Fukunaga, K. (1990) · Academic Press Professional, Inc. eBooks · Cited by 3,797
Cited by
Unsupervised deep embedding for clustering analysis
Xie, J., Girshick, R., & Farhadi, A. (2015) · arXiv · doi:10.48550/arxiv.1511.06335 · Cited by 2,476
Feature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Trevino, R. P., Tang, J., & Liu, H. (2018) · ACM Computing Surveys · doi:10.1145/3136625 · Cited by 2,442
“Following the definition of global discriminative information (Yang et al. 2010; Fukunaga 2013), the local discriminative score for each instance xi is DSi = tr [(S (i ) t + λId ) −1S(i ) b ] = tr [W′X′P(i )X̃i ′ (X̃i X̃i ′ + λId ) −1X̃i P ′ (i )XW].”
MethodSoft Filter Pruning for Accelerating Deep Convolutional Neural Networks
He, Y., Kang, G., Dong, X., Fu, Y., & Yang, Y. (2018) · Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2018/309 · Cited by 1,020
Self-citationFeature Selection: A Data Perspective
Li, J., Cheng, K., Wang, S., Morstatter, F., Treviño, R. P., Tang, J., & Liu, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.07996 · Cited by 739
Variational Deep Embedding: An Unsupervised and Generative Approach to Clustering
Jiang, Z., Zheng, Y., Tan, H., Tang, B., & Zhou, H. (2017) · Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/273 · Cited by 706
A General and Adaptive Robust Loss Function
Barron, J. T. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00446 · Cited by 689
Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization
Dizaji, K. G., Herandi, A., Deng, C., Cai, W., & Huang, H. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.612 · Cited by 579
l 2,1 -norm regularized discriminative feature selection for unsupervised learning
Yang, Y. P., Shen, H. T., Ma, Z., Huang, Z. H., & Zhou, X. (2011) · Rare & Special e-Zone (The Hong Kong University of Science and Technology) · doi:10.5591/978-1-57735-516-8/ijcai11-267 · Cited by 549
Self-citationGraph Learning for Multiview Clustering
Zhan, K., Zhang, C., Guan, J., & Wang, J. (2018) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2017.2751646 · Cited by 543
Deep Adaptive Image Clustering
Chang, J., Wang, L., Meng, G., Xiang, S., & Pan, C. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.626 · Cited by 535
Structural Deep Clustering Network
Bo, D., Wang, X., Shi, C., Zhu, M., Lu, E., & Cui, P. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380214 · Cited by 534
Spectral Embedded Clustering: A Framework for In-Sample and Out-of-Sample Spectral Clustering
Nie, F., Zeng, Z., Tsang, I. W., Xu, D., & Zhang, C. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2162000 · Cited by 325
Self-citationClustering-Guided Sparse Structural Learning for Unsupervised Feature Selection
Li, Z., Liu, J., Yang, Y., Zhou, X., & Lu, H. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.65 · Cited by 303
Self-citationDynamic Affinity Graph Construction for Spectral Clustering Using Multiple Features
Li, Z., Nie, F., Chang, X., Yang, Y., Zhang, C., & Sebe, N. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2829867 · Cited by 268
Self-citation
Metadata
- Authors
- Yang, Y., Xu, D., Nie, F., Yan, S., & Zhuang, Y.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2010-10
- Volume
- 19
- Issue
- 10
- Pages
- 2761-2773
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2129793592
- Cited by
- 389
- References
- 44
- FWCI
- 19.39
- 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.