A blind identification and source separation method based on subspace intersections for hyperspectral astrophysical data

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a geometric method for solving the Blind Source Separation problem. The method is based on a weak sparsity assumption: for each source, there should exist at least one pair of zones that share only this source. The process consists first in finding the pairs of zones sharing a unique source with an original geometric approach. Each pair of zones, having a mono-dimensional intersection, yields an estimate of a column of the mixing matrix up to a scale factor. All intersections are identified by Singular Value Decomposition. The intersections corresponding to the same column of the mixing matrix are then grouped by a clustering algorithm so as to derive a single estimate of each column. The sources are finally reconstructed from the observed vectors and mixing parameters with a least square algorithm. Various tests on synthetic and real hyperspectral astrophysical data illustrate the efficiency of this approach.

Cite

CITATION STYLE

APA

Boulais, A., Deville, Y., & Berné, O. (2017). A blind identification and source separation method based on subspace intersections for hyperspectral astrophysical data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10169 LNCS, pp. 367–380). Springer Verlag. https://doi.org/10.1007/978-3-319-53547-0_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free