The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Hyperspectral image unsupervised classification by robust manifold matrix factorization
Abstract
Abstract Hyperspectral remote sensing image unsupervised classification, which assigns each pixel of the image into a certain land-cover class without any training samples, plays an important role in the hyperspectral image processing but still leaves huge challenges due to the complicated and high-dimensional data observation. Although many advanced hyperspectral remote sensing image classification techniques based on supervised and semi-supervised learning had been proposed and confirmed effective in recent years, they require a certain number of high quality training samples to learn a classifier, and thus can’t work in the unsupervised manner. In this work, we propose a hyperspectral image unsupervised classification framework based on robust manifold matrix factorization and its out-of-sample extension. In order to address the high feature dimensionality of the hyperspectral image, we propose a unified low-rank matrix factorization to jointly perform the dimensionality reduction and data clustering, by which the clustering result can be exactly reproduced, which is significantly superior to the existing data clustering algorithms such as the k-means and spectral clustering. In particular, in the proposed matrix factorization, the l2,1-norm is used to measure the reconstruction loss, which helps to reduce the errors brought by the possible noisy observation. The widely considered manifold regularization is also adopted to further promote the proposed model. Furthermore, we have designed a novel Augmented Lagrangian Method (ALM) based procedure to seek the local optimal solution of the proposed optimization and suggested an additional out-of-sample extension trick to make the method can deal with the large-scale hyperspectral remote sensing images. Several experimental results on the standard hyperspectral images show that the proposed method presents competitive clustering accuracy and comparative running time compared to the existing data clustering algorithms.
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
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Cited by
A review of the application of machine learning in water quality evaluation
Zhu, M., Wang, J., Yang, X., Zhang, Y., Zhang, L., Ren, H., Wu, B., & Ye, L. (2022) · Eco-Environment & Health · doi:10.1016/j.eehl.2022.06.001 · Cited by 793
Self-citationA Survey on Multiview Clustering
Chao, G., Sun, S., & Bi, J. (2021) · IEEE Transactions on Artificial Intelligence · doi:10.1109/tai.2021.3065894 · Cited by 427
Regularizing Hyperspectral and Multispectral Image Fusion by CNN Denoiser
Dian, R., Li, S., & Kang, X. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2980398 · Cited by 328
Understanding of Convolutional Neural Network (CNN): A Review
Purwono, P., Ma'arif, A., Rahmaniar, W., Fathurrahman, H. I. K., Frisky, A. Z. K., & Haq, Q. M. U. (2023) · International Journal of Robotics and Control Systems · doi:10.31763/ijrcs.v2i4.888 · Cited by 319
Geography-Aware Self-Supervised Learning
Ayush, K., Uzkent, B., Meng, C., Tanmay, K., Burke, M., Lobell, D., & Ermon, S. (2021) · 2021 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.01002 · Cited by 288
Metadata
- Authors
- Zhang, L., Zhang, L., Du, B., You, J., & Tao, D.
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 485
- Pages
- 154-169
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2914429466
- Cited by
- 237
- References
- 1
- FWCI
- 30.29
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hyperspectral image unsupervised classification by robust manifold matrix factorization. https://app.cochat.ai/papers/10.1016/j.ins.2019.02.008
- The paper
- Zhang, L., Zhang, L., Du, B., You, J., & Tao, D. (2019). Hyperspectral image unsupervised classification by robust manifold matrix factorization. Information Sciences. https://doi.org/10.1016/j.ins.2019.02.008
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.