This paper proposes a technique for refining a previous segmentation by using different properties of K-distributed SAR clutter simultaneously. We first consider approximate forms for the K distribution based on a Maximum Entropy approach which assumes that only two moments of the data can be estimated with sufficient accuracy over a small sample region. The choice of moments defines the form of the approximate probability density functions (PDF). After the initial segmentation we then propose a post-processing stage in which the values of the moments of the complete previously-identified segments are assumed exact and an optimum fit to the edge position is defined. We demonstrate that joint estimation of the edge position, based on estimates of the mean of the data and of its logarithm, provides a close approximation to the full K- distribution treatment, while being significantly simpler to implement.
[1]
Jan M. Van Campenhout,et al.
Maximum entropy and conditional probability
,
1981,
IEEE Trans. Inf. Theory.
[2]
Christopher J. Oliver,et al.
Optimum texture analysis of SAR images
,
1994,
Defense, Security, and Sensing.
[3]
R. G. White.
Low Level Segmentation of Noisy Imagery
,
1986
.
[4]
Pierfrancesco Lombardo,et al.
Estimation of texture parameters in K-distributed clutter
,
1994
.
[5]
C. Oliver.
Optimum texture estimators for SAR clutter
,
1993
.
[6]
D. Blacknell,et al.
Comparison of parameter estimators for K-distribution
,
1994
.
[7]
R. G. White,et al.
Change detection in SAR imagery
,
1990
.