SUnGP: A greedy sparse approximation algorithm for hyperspectral unmixing

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    14 Citations (Scopus)


    © 2014 IEEE. Spectra measured at a pixel of a remote sensing hyper spectral sensor is usually a mixture of multiple spectra (end-members) of different materials on the ground. Hyper spectral unmixing aims at identifying the end members and their proportions (fractional abundances) in the mixed pixels. Hyper spectral unmixing has recently been casted into a sparse approximation problem and greedy sparse approximation approaches are considered desirable for solving it. However, the high correlation among the spectra of different materials seriously affects the accuracy of the greedy algorithms. We propose a greedy sparse approximation algorithm, called SUnGP, for unmixing of hyper spectral data. SUnGP shows high robustness against the correlation of the spectra of materials. The algorithm employees a subspace pruning strategy for the identification of the end members. Experiments show that the proposed algorithm not only outperforms the state of the art greedy algorithms, its accuracy is comparable to the algorithms based on the convex relaxation of the problem, but with a considerable computational advantage.
    Original languageEnglish
    Title of host publicationProceedings - International Conference on Pattern Recognition
    Place of PublicationUSA
    PublisherIEEE, Institute of Electrical and Electronics Engineers
    ISBN (Print)9781479952083
    Publication statusPublished - 2014
    Event22nd International Conference on Pattern Recognition - Stockholm, Sweden
    Duration: 24 Aug 201428 Aug 2014
    Conference number: 109641


    Conference22nd International Conference on Pattern Recognition
    Abbreviated titleICPR 2014


    Dive into the research topics of 'SUnGP: A greedy sparse approximation algorithm for hyperspectral unmixing'. Together they form a unique fingerprint.

    Cite this