Affinity Matrix Learning Via Nonnegative Matrix Factorization for Hyperspectral Imagery Clustering
نویسندگان
چکیده
In this article, we integrate the spatial-spectral information of hyperspectral image (HSI) samples into nonnegative matrix factorization (NMF) for affinity learning to address issue HSI clustering. This technique consists three main components: 1) oversegmentation computing spectral-spatial matrix; 2) NMF with guidance obtained and 3) density-based spectral clustering on final matrix. First, is oversegmented superpixels via entropy rate superpixel algorithm. The defined based class-consistency assumption all in each similar between adjacent superpixels. Second, NMF, used guide iterative process NMF. then weighted by low-dimensional subspace form Third, applied obtain maps. Experimental results public benchmark HSIs demonstrate that proposed method superior considered state-of-the-art baseline methods both computational cost accuracy.
منابع مشابه
Sparse Nonnegative Matrix Factorization for Clustering
Properties of Nonnegative Matrix Factorization (NMF) as a clustering method are studied by relating its formulation to other methods such as K-means clustering. We show how interpreting the objective function of K-means as that of a lower rank approximation with special constraints allows comparisons between the constraints of NMF and K-means and provides the insight that some constraints can b...
متن کاملSymmetric Nonnegative Matrix Factorization for Graph Clustering
Nonnegative matrix factorization (NMF) provides a lower rank approximation of a nonnegative matrix, and has been successfully used as a clustering method. In this paper, we offer some conceptual understanding for the capabilities and shortcomings of NMF as a clustering method. Then, we propose Symmetric NMF (SymNMF) as a general framework for graph clustering, which inherits the advantages of N...
متن کاملAdaptive Graph via Multiple Kernel Learning for Nonnegative Matrix Factorization
Nonnegative Matrix Factorization (NMF) has been continuously evolving in several areas like pattern recognition and information retrieval methods. It factorizes a matrix into a product of 2 low-rank non-negative matrices that will define parts-based, and linear representation of nonnegative data. Recently, Graph regularized NMF (GrNMF) is proposed to find a compact representation,which uncovers...
متن کاملMulti-View Clustering via Joint Nonnegative Matrix Factorization
Many real-world datasets are comprised of different representations or views which often provide information complementary to each other. To integrate information from multiple views in the unsupervised setting, multiview clustering algorithms have been developed to cluster multiple views simultaneously to derive a solution which uncovers the common latent structure shared by multiple views. In...
متن کاملDocument clustering using nonnegative matrix factorization
Amethodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank nonnegative matrix factorization algorithm to retain natural data nonnegativity, thereby eliminating the need to use subtractive basis vector and encoding calculations present in other techniques such as principal compone...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
سال: 2021
ISSN: ['2151-1535', '1939-1404']
DOI: https://doi.org/10.1109/jstars.2020.3040218