Parallel unmixing of hyperspectral data using complexity pursuit

Stefan Robila, Martin Butler

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

Accurate and fast data unmixing is key to most applications employing hyperspectral data. Among the large number unmixing approaches, Blind Source Separation (BSS) has been employed successfully through a variety of techniques, yet most of these approaches continue to be computationally expensive due to their iterative nature. In this context, it is imperative to seek efficient approaches that leverage the accuracy of the algorithms and the availability of off-the-shelf computationally performant systems such as multi-cpu and multi core. In this paper we tackle the spatial complexity based unmixing, a new technique shown to outperform many BSS solutions. We develop a new parallel algorithm that, without decreasing the accuracy ensures significant computational speedup when compared to the original technique. We provide a theoretical analysis on its equivalency with the algorithm. Furthermore we show through both complexity analysis and experimental results that the algorithm provides a speedup in execution linear to the number of computing cores used.

Original languageEnglish
Title of host publication2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010
Pages1035-1038
Number of pages4
DOIs
StatePublished - 1 Dec 2010
Event2010 30th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010 - Honolulu, HI, United States
Duration: 25 Jul 201030 Jul 2010

Other

Other2010 30th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010
CountryUnited States
CityHonolulu, HI
Period25/07/1030/07/10

Fingerprint

Blind source separation
Parallel algorithms
Availability
analysis

Keywords

  • Blind source separation
  • Complexity pursuit
  • High performance computing
  • Hyperspectral imagery
  • Linear unmixing

Cite this

Robila, S., & Butler, M. (2010). Parallel unmixing of hyperspectral data using complexity pursuit. In 2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010 (pp. 1035-1038). [5648919] https://doi.org/10.1109/IGARSS.2010.5648919
Robila, Stefan ; Butler, Martin. / Parallel unmixing of hyperspectral data using complexity pursuit. 2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010. 2010. pp. 1035-1038
@inproceedings{3c9040e728c24dc68d10e4ef201beb73,
title = "Parallel unmixing of hyperspectral data using complexity pursuit",
abstract = "Accurate and fast data unmixing is key to most applications employing hyperspectral data. Among the large number unmixing approaches, Blind Source Separation (BSS) has been employed successfully through a variety of techniques, yet most of these approaches continue to be computationally expensive due to their iterative nature. In this context, it is imperative to seek efficient approaches that leverage the accuracy of the algorithms and the availability of off-the-shelf computationally performant systems such as multi-cpu and multi core. In this paper we tackle the spatial complexity based unmixing, a new technique shown to outperform many BSS solutions. We develop a new parallel algorithm that, without decreasing the accuracy ensures significant computational speedup when compared to the original technique. We provide a theoretical analysis on its equivalency with the algorithm. Furthermore we show through both complexity analysis and experimental results that the algorithm provides a speedup in execution linear to the number of computing cores used.",
keywords = "Blind source separation, Complexity pursuit, High performance computing, Hyperspectral imagery, Linear unmixing",
author = "Stefan Robila and Martin Butler",
year = "2010",
month = "12",
day = "1",
doi = "10.1109/IGARSS.2010.5648919",
language = "English",
isbn = "9781424495658",
pages = "1035--1038",
booktitle = "2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010",

}

Robila, S & Butler, M 2010, Parallel unmixing of hyperspectral data using complexity pursuit. in 2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010., 5648919, pp. 1035-1038, 2010 30th IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010, Honolulu, HI, United States, 25/07/10. https://doi.org/10.1109/IGARSS.2010.5648919

Parallel unmixing of hyperspectral data using complexity pursuit. / Robila, Stefan; Butler, Martin.

2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010. 2010. p. 1035-1038 5648919.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Parallel unmixing of hyperspectral data using complexity pursuit

AU - Robila, Stefan

AU - Butler, Martin

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Accurate and fast data unmixing is key to most applications employing hyperspectral data. Among the large number unmixing approaches, Blind Source Separation (BSS) has been employed successfully through a variety of techniques, yet most of these approaches continue to be computationally expensive due to their iterative nature. In this context, it is imperative to seek efficient approaches that leverage the accuracy of the algorithms and the availability of off-the-shelf computationally performant systems such as multi-cpu and multi core. In this paper we tackle the spatial complexity based unmixing, a new technique shown to outperform many BSS solutions. We develop a new parallel algorithm that, without decreasing the accuracy ensures significant computational speedup when compared to the original technique. We provide a theoretical analysis on its equivalency with the algorithm. Furthermore we show through both complexity analysis and experimental results that the algorithm provides a speedup in execution linear to the number of computing cores used.

AB - Accurate and fast data unmixing is key to most applications employing hyperspectral data. Among the large number unmixing approaches, Blind Source Separation (BSS) has been employed successfully through a variety of techniques, yet most of these approaches continue to be computationally expensive due to their iterative nature. In this context, it is imperative to seek efficient approaches that leverage the accuracy of the algorithms and the availability of off-the-shelf computationally performant systems such as multi-cpu and multi core. In this paper we tackle the spatial complexity based unmixing, a new technique shown to outperform many BSS solutions. We develop a new parallel algorithm that, without decreasing the accuracy ensures significant computational speedup when compared to the original technique. We provide a theoretical analysis on its equivalency with the algorithm. Furthermore we show through both complexity analysis and experimental results that the algorithm provides a speedup in execution linear to the number of computing cores used.

KW - Blind source separation

KW - Complexity pursuit

KW - High performance computing

KW - Hyperspectral imagery

KW - Linear unmixing

UR - http://www.scopus.com/inward/record.url?scp=78650898662&partnerID=8YFLogxK

U2 - 10.1109/IGARSS.2010.5648919

DO - 10.1109/IGARSS.2010.5648919

M3 - Conference contribution

SN - 9781424495658

SN - 9781424495665

SP - 1035

EP - 1038

BT - 2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010

ER -

Robila S, Butler M. Parallel unmixing of hyperspectral data using complexity pursuit. In 2010 IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2010. 2010. p. 1035-1038. 5648919 https://doi.org/10.1109/IGARSS.2010.5648919