IGARSS 2018 - 2018 IEEE International Geoscience and Remote Sensing Symposium 2018
DOI: 10.1109/igarss.2018.8518428
|View full text |Cite
|
Sign up to set email alerts
|

Relative Attribute Based Unmixing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 12 publications
0
5
0
Order By: Relevance
“…In the AA unmixing model, the original data samples are expressed as a linearly weighted sum of these archetypes, and the archetype is generated from the original data in an additive manner. When the AA method [28] is introduced into spectral unmixing, the obtained archetypes can be used as endmembers which are generated as a linear combination of the original data [29,30]. This process can be formulated as:…”
Section: Archetypal Analysis Spectral Unmixingmentioning
confidence: 99%
See 2 more Smart Citations
“…In the AA unmixing model, the original data samples are expressed as a linearly weighted sum of these archetypes, and the archetype is generated from the original data in an additive manner. When the AA method [28] is introduced into spectral unmixing, the obtained archetypes can be used as endmembers which are generated as a linear combination of the original data [29,30]. This process can be formulated as:…”
Section: Archetypal Analysis Spectral Unmixingmentioning
confidence: 99%
“…With regard to the first issue encountered by using MV-NMF unmixing method for AD, the first objective of this study is to introduce the model of Archetypal Analysis (AA) [28] to implement spectral unmixing and to aid in sparse representation-based AD. In fact, this model has been demonstrated to be of a great potential for spectral unmixing [29,30]. AA explicitly provides the generation of a mutual relationship between the endmembers and the original data.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In this study, the relative attribute learning (RAL) algorithm integrated with the rank support vector machine (rankSVM) ranking model [38,39] was deployed to learn the relative relation of the age attribute (denoted as a function of the successional stage, as a) of a given forest. Given the training data set X ∈ R N×G with G selected metric features, the RAL uses the relative relation between sample pairs and is treated as a "learn-to-rank" problem on the rankSVM framework (Equation ( 9) [38]).…”
Section: Relative Attribute Learning For Tdfs Succession Age Attributementioning
confidence: 99%
“…The first objective was to develop a fast nonlinear archetypal analysis model to conduct different metric configurations for forest-age-attribute learning. The second objective was to use "relative attribute learning" (RAL) [38,39], which is formulated as a "learn-to-rank" problem and uses a rank support vector machine (SVM) framework, to calculate the relative score/belonging levels of a sample to a certain class attribute. This allowed us to learn and predict the associate score of the succession age attribute by using the smallest set of informative spectral indices, as well as LiDAR metrics.…”
Section: Introductionmentioning
confidence: 99%