non-linear fully-constrained spectral unmixing
TRANSCRIPT
![Page 1: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/1.jpg)
1
Non-linear fully-constrained spectral unmixing.
Rob Heylen, D evdet Burazerović, Paul ScheundersẑIBBT-Visionlab, University of Antwerp, Belgium
IGARSS 2011July 25-29, Vancouver, Canada
![Page 2: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/2.jpg)
2
Outline
• Introduction: Spectral unmixing• Non-linear endmember extraction• Distance-based unmixing algorithm• Results• Conclusions and future work
![Page 3: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/3.jpg)
3
Spectral unmixing
The linear mixing model
Non-linear mixing models are far more generic
One does not always know the function F:• Model-based unmixing• Data-driven manifold techniques
![Page 4: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/4.jpg)
4
Non-linear unmixing
A data driven, fully-constrained non-linear unmixing method:
• Endmember extraction by combining graph-based manifold learning with N-findR.
• Unmixing via a distance-geometry based fully-constrained unmixing algorithm, applied to the geodesic distances.
![Page 5: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/5.jpg)
5
Distance geometry
All properties are expressed as (Euclidean) distances between the constituents.
![Page 6: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/6.jpg)
6
Endmember extraction
• Rewrite N-findR to work with mutual distances. e.g.:
• Use approximate geodesic distances on the data manifold: Shortest-path distances in nearest-neighbor graph
![Page 7: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/7.jpg)
7
Endmember extraction
![Page 8: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/8.jpg)
8
Non-linear unmixing
Next step: Unmix the data to find abundances of each pixel.
Aim: Use geodesic distance matrix as input of the unmixing algorithm.
The DSPU algorithm is fit for this task.
![Page 9: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/9.jpg)
9
The minimization problem
Linear spectral unmixing can be viewed as a minimization problem
Simplex projection is equivalent problem:
![Page 10: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/10.jpg)
10
Simplex projection unmixingRecursive simplex projection unmixing (SPU) algorithm:
1. Project the point orthogonally onto the simplex plane.2. If the point lies inside the simplex, finish.3. Else, find which abundance has to be zero.4. Remove the endmember from the set of endmembers and go to step 1.
Can be expressed in distance geometry: DSPU
![Page 11: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/11.jpg)
11
Results: Cuprite data set
• Cuprite data set• Linear unmixing via N-findR and FCLSU/DSPU• Non-linear unmixing via the proposed method
![Page 12: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/12.jpg)
12
Cuprite: Linear unmixing
Typical situation: 99.7% of abundances differ by less than 10-7 . E.g. for the alunite endmember:
FCLSU DSPU
![Page 13: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/13.jpg)
13
Cuprite: Non-linear EEA
Kaolinite 0.056, Montmorrilonite 0.048, Alunite 0.043
![Page 14: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/14.jpg)
14
Cuprite: Non-linear unmixing
Alunite endmember:
N-findR + FCLSU Non-lin. EEA + DSPU
![Page 15: NON-LINEAR FULLY-CONSTRAINED SPECTRAL UNMIXING](https://reader034.vdocuments.mx/reader034/viewer/2022052508/559e19e61a28ab9c4e8b45f0/html5/thumbnails/15.jpg)
15
Conclusions and future work
• A data-driven non-linear unmixing algorithm.• Promising results on artificial data.• Significant deviations from linear unmixing results. Hard to quantify on Cuprite data set.
• Assess method on non-linearly mixed data with ground truth.• Lots of testing