2016 IEEE International Geoscience and Remote Sensing Symposium (IGARSS) 2016
DOI: 10.1109/igarss.2016.7730623
|View full text |Cite
|
Sign up to set email alerts
|

Change detection under the forest in multitemporal full-polarimetric P-band SAR images using Pauli decomposition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…Pauli decomposition is the most popular and widely used coherent decomposition due to its simplicity and availability [14]. The aim of the Pauli decomposition is to express the scatter matrix [S] as the weighted sum of elementary scattering matrices, which represents certain types of deterministic scattering mechanisms [4, 15]. On the condition of orthogonal linear ( h , v ) basis and S hv = S vh , the Pauli basis is expressed as follows:][Sa = 1 2 1 0 0 1][Sb = 1 2 1 0 0 1][Sc = 1 2 0 1 1 0 Consequently, given a scattering matrix [S], it is expressed as][S = ][1em4ptS hh S hv S hv S vv = α ][Sa + β ][Sb + γ ][Sc where:α = S hh + S vv 2β <...>…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…Pauli decomposition is the most popular and widely used coherent decomposition due to its simplicity and availability [14]. The aim of the Pauli decomposition is to express the scatter matrix [S] as the weighted sum of elementary scattering matrices, which represents certain types of deterministic scattering mechanisms [4, 15]. On the condition of orthogonal linear ( h , v ) basis and S hv = S vh , the Pauli basis is expressed as follows:][Sa = 1 2 1 0 0 1][Sb = 1 2 1 0 0 1][Sc = 1 2 0 1 1 0 Consequently, given a scattering matrix [S], it is expressed as][S = ][1em4ptS hh S hv S hv S vv = α ][Sa + β ][Sb + γ ][Sc where:α = S hh + S vv 2β <...>…”
Section: Methodsmentioning
confidence: 99%
“…At present, polarisation decomposition methods include the coherent target decomposition methods based on the scattering matrix and the non‐coherent polarisation decomposition methods based on the second‐order moment. Coherent target decomposition methods include Pauli decomposition [4], Krogager decomposition [5], Cameron decomposition [6] and so on. Non‐coherent target polarisation decomposition methods include Freeman–Durden decomposition [7], Yamaguchi decomposition [8], and Van Zyl decomposition [9].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Among these features, it is concluded that backscattering coefficients of HV polarization mode related to the forest canopy showed high sensitivity to the forest GSV. Although several features can be extracted from C2 matric by dual decomposition approaches, the sensitivity between the forest GSV and extracted features is so low that it cannot be involved in the estimation of forest GSV [31,42,43]. In addition, textural features obtained by GLCM are widely extracted from intensity images of different polarizations for vegetation classification.…”
Section: The Sensitivity Of Features Extracted From Dual-polarization...mentioning
confidence: 99%
“…In other words, polarimetric target decompositions are a powerful approach for the interpretation and analysis of complex scattering mechanisms, since they separate the polarimetric measurements (covariance/coherency matrices) into several independent secondary elements, and then provide significant information regarding various scattering mechanisms [20]. During the last decades, researchers have studied polarimetric target decomposition for a long time, and numerous approaches have been put forward, such as Krogager decomposition [21], Cloude-Pottier [19], Freeman decomposition [22], Pauli decomposition [23], Huynen decomposition [24], and so on. Furthermore, some machine learning algorithms have broken the limitations of traditional algorithms and have made great achievements in the field of PolSAR image classification, such as the Wishart Classifier [25], Bagging [26], the Support Vector Machine (SVM) [27,28], and Random Forest (RF) [29,30].…”
Section: Introductionmentioning
confidence: 99%