Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing

Details Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing

2011-11-03

arxiv.org/abs/1111.0885v1

Computer Science

Computer Vision and Pattern Recognition

4 pages, conference

Scientific paper

Spectral unmixing is an important tool in hyperspectral data analysis for estimating endmembers and abundance fractions in a mixed pixel. This paper examines the applicability of a recently developed algorithm called graph regularized nonnegative matrix factorization (GNMF) for this aim. The proposed approach exploits the intrinsic geometrical structure of the data besides considering positivity and full additivity constraints. Simulated data based on the measured spectral signatures, is used for evaluating the proposed algorithm. Results in terms of abundance angle distance (AAD) and spectral angle distance (SAD) show that this method can effectively unmix hyperspectral data.

Affiliated with

Also associated with

No associations

Rating

Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph Regularized Nonnegative Matrix Factorization for Hyperspectral Data Unmixing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-703066