Non-Linear Spectral Unmixing by Geodesic Simplex Volume Maximization
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Spectral mixtures observed in hyperspectral imagery often display nonlinear mixing effects. Since most traditional unmixing techniques are based upon the linear mixing model, they perform poorly in finding the correct endmembers and their abundances in the case of nonlinear spectral mixing. In this paper, we present an unmixing algorithm that is capable of extracting endmembers and determining their abundances in hyperspectral imagery under nonlinear mixing assumptions. The algorithm is based upon simplex volume maximization, and uses shortest-path distances in a nearest-neighbor graph in spectral space, hereby respecting the nontrivial geometry of the data manifold in the case of nonlinearly mixed pixels. We demonstrate the algorithm on an artificial data set, the AVIRIS Cuprite data set, and a hyperspectral image of a heathland area in Belgium.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Keshava, N., & Mustard, J. F. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.974727 · Cited by 2,549 · cited 2×
“I. INTRODUCTION O NE of the inescapable implications of hyperspectral re-mote sensing is that a single pixel can often record only a mixed signature of distinct surface materials.”
Background
Cited by
Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-Based Approaches
Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., & Chanussot, J. (2012) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2012.2194696 · Cited by 2,836
“in [72] where a strategy is introduced to extract endmembers that have been nonlinearly mixed.”
Hyperspectral remote sensing data analysis and future challenges
Bioucas-Dias, J. M., Plaza, A., Camps-Valls, G., Scheunders, P., Nasrabadi, N., & Chanussot, J. (2013) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2013.2244672 · Cited by 2,223
“These representations have been actively exploited, namely, in dimensionality reduction, feature extraction, unmixing, classification, segmentation, and detection [1], [5].”
MethodSelf-citationA Review of Nonlinear Hyperspectral Unmixing Methods
Heylen, R., Parente, M., & Gader, P. (2014) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2014.2320576 · Cited by 591
Self-citationNonlinear Unmixing of Hyperspectral Images: Models and Algorithms
Dobigeon, N., Tourneret, J.-Y., Richard, C., Bermudez, J. C. M., McLaughlin, S., & Hero, A. O. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279274 · Cited by 420
“Conversely, when the endmember signatures are not known, a geometrical-based unmixing technique can be used, based on graph-based approximate geodesic distances [43], or manifold learning techniques [44,45].”
MethodLunga, D., Prasad, S., Crawford, M. M., & Ersoy, O. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279894 · Cited by 293
Metadata
- Authors
- Heylen, R., Burazerovic, D., & Scheunders, P.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2011-06
- Volume
- 5
- Issue
- 3
- Pages
- 534-542
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W2003896345
- Cited by
- 125
- References
- 4
- FWCI
- 24.62
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.