2013
DOI: 10.1109/tgrs.2012.2222029
|View full text |Cite
|
Sign up to set email alerts
|

Entropy-Based Statistical Analysis of PolSAR Data

Abstract: Abstract-Images obtained from coherent illumination processes are contaminated with speckle noise, with polarimetric synthetic aperture radar (PolSAR) imagery as a prominent example. With an adequacy widely attested in the literature, the scaled complex Wishart distribution is an acceptable model for PolSAR data. In this perspective, we derive analytic expressions for the Shannon, Rényi, and restricted Tsallis entropies under this model. Relationships between the derived measures and the parameters of the scal… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
31
0

Year Published

2014
2014
2024
2024

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 39 publications
(31 citation statements)
references
References 49 publications
0
31
0
Order By: Relevance
“…Frery et al [7,8] obtained such statistics under the assumption of the scaled complex multivariate complex Wishart distribution, a widely accepted model for full PolSAR data from textureless targets. The authors present examples of classification procedures based on those statistics.…”
Section: Information-theoretic Tools For Polsarmentioning
confidence: 99%
See 1 more Smart Citation
“…Frery et al [7,8] obtained such statistics under the assumption of the scaled complex multivariate complex Wishart distribution, a widely accepted model for full PolSAR data from textureless targets. The authors present examples of classification procedures based on those statistics.…”
Section: Information-theoretic Tools For Polsarmentioning
confidence: 99%
“…These distances and entropies are from the (h-φ) family of stochastic measures [7,8], so users can experiment and compare results. The same holds true for the measures of similarity employed to build the convolution matrices on which the Nonlocal Means technique relies.…”
Section: System Architecturementioning
confidence: 99%
“…The position p gbest of the best one among all the particles in the population is represented as p g = (p g1 , p g2 , · · · , p gD ). The velocity and position of each particle are updated toward its p best and p gbest locations according to (11) 1] is the inertia weight, determining how much of the previous velocity of the particle is preserved. And rand 1 , rand 2 ∈ [0, 1] denote two uniform random numbers, c 1 , c 2 are acceleration constants.…”
Section: Modified Non-negative Matrix Factorizationmentioning
confidence: 99%
“…And rand 1 , rand 2 ∈ [0, 1] denote two uniform random numbers, c 1 , c 2 are acceleration constants. In (11), the first term is the movement of particles on the current self-confidence, and is related to their speed and inertia weight; the second term represents a "cognitive" process, which is the movement of particles from some of their own experience; the third term is the social part, which represents the cooperation among the individuals. The updating position of each particle is made up of these three terms as shown in Fig.…”
Section: Modified Non-negative Matrix Factorizationmentioning
confidence: 99%
See 1 more Smart Citation