Descripteur
Termes IGN > 1-Candidats > factorisation de matrice non-négative
factorisation de matrice non-négative |
Documents disponibles dans cette catégorie (17)
Ajouter le résultat dans votre panier
Visionner les documents numériques
Affiner la recherche Interroger des sources externes
Etendre la recherche sur niveau(x) vers le bas
Double constrained NMF for hyperspectral unmixing / Xiaoqiang Lu in IEEE Transactions on geoscience and remote sensing, vol 52 n° 5 tome 1 (May 2014)
[article]
Titre : Double constrained NMF for hyperspectral unmixing Type de document : Article/Communication Auteurs : Xiaoqiang Lu, Auteur ; Hao Wu, Auteur ; Yuan Yuan, Auteur Année de publication : 2014 Article en page(s) : pp 2746 - 2758 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse des mélanges spectraux
[Termes IGN] contrainte spectrale
[Termes IGN] factorisation
[Termes IGN] factorisation de matrice non-négative
[Termes IGN] image hyperspectraleRésumé : (Auteur) Given only the collected hyperspectral data, unmixing aims at obtaining the latent constituent materials and their corresponding fractional abundances. Recently, many nonnegative matrix factorization (NMF)-based algorithms have been developed to deal with this issue. Considering that the abundances of most materials may be sparse, the sparseness constraint is intuitively introduced into NMF. Although sparse NMF algorithms have achieved advanced performance in unmixing, the result is still susceptible to unstable decomposition and noise corruption. To reduce the aforementioned drawbacks, the structural information of the data is exploited to guide the unmixing. Since similar pixel spectra often imply similar substance constructions, clustering can explicitly characterize this similarity. Through maintaining the structural information during the unmixing, the resulting fractional abundances by the proposed algorithm can well coincide with the real distributions of constituent materials. Moreover, the additional clustering-based regularization term also lessens the interference of noise to some extent. The experimental results on synthetic and real hyperspectral data both illustrate the superiority of the proposed method compared with other state-of-the-art algorithms. Numéro de notice : A2014-263 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2013.2265322 En ligne : https://doi.org/10.1109/TGRS.2013.2265322 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=33166
in IEEE Transactions on geoscience and remote sensing > vol 52 n° 5 tome 1 (May 2014) . - pp 2746 - 2758[article]Exemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2014051A RAB Revue Centre de documentation En réserve L003 En circulation
Exclu du prêtManifold regularized sparse NMF for hyperspectral unmixing / Xiaqiang Lu in IEEE Transactions on geoscience and remote sensing, vol 51 n° 5 Tome 1 (May 2013)
[article]
Titre : Manifold regularized sparse NMF for hyperspectral unmixing Type de document : Article/Communication Auteurs : Xiaqiang Lu, Auteur ; Hao Wu, Auteur ; Pingkun Yan, Auteur ; et al., Auteur Année de publication : 2013 Article en page(s) : pp 2815 - 2826 Note générale : Bibliographie Langues : Anglais (eng) Descripteur : [Vedettes matières IGN] Traitement d'image optique
[Termes IGN] analyse des mélanges spectraux
[Termes IGN] factorisation
[Termes IGN] factorisation de matrice non-négative
[Termes IGN] image hyperspectrale
[Termes IGN] matrice creuseRésumé : (Auteur) Hyperspectral unmixing is one of the most important techniques in analyzing hyperspectral images, which decomposes a mixed pixel into a collection of constituent materials weighted by their proportions. Recently, many sparse nonnegative matrix factorization (NMF) algorithms have achieved advanced performance for hyperspectral unmixing because they overcome the difficulty of absence of pure pixels and sufficiently utilize the sparse characteristic of the data. However, most existing sparse NMF algorithms for hyperspectral unmixing only consider the Euclidean structure of the hyperspectral data space. In fact, hyperspectral data are more likely to lie on a low-dimensional submanifold embedded in the high-dimensional ambient space. Thus, it is necessary to consider the intrinsic manifold structure for hyperspectral unmixing. In order to exploit the latent manifold structure of the data during the decomposition, manifold regularization is incorporated into sparsity-constrained NMF for unmixing in this paper. Since the additional manifold regularization term can keep the close link between the original image and the material abundance maps, the proposed approach leads to a more desired unmixing performance. The experimental results on synthetic and real hyperspectral data both illustrate the superiority of the proposed method compared with other state-of-the-art approaches. Numéro de notice : A2013-258 Affiliation des auteurs : non IGN Thématique : IMAGERIE Nature : Article nature-HAL : ArtAvecCL-RevueIntern DOI : 10.1109/TGRS.2012.2213825 En ligne : https://doi.org/10.1109/TGRS.2012.2213825 Format de la ressource électronique : URL article Permalink : https://documentation.ensg.eu/index.php?lvl=notice_display&id=32396
in IEEE Transactions on geoscience and remote sensing > vol 51 n° 5 Tome 1 (May 2013) . - pp 2815 - 2826[article]Réservation
Réserver ce documentExemplaires(1)
Code-barres Cote Support Localisation Section Disponibilité 065-2013051A RAB Revue Centre de documentation En réserve L003 Disponible