2003
DOI: 10.1109/tip.2003.816005
|View full text |Cite
|
Sign up to set email alerts
|

Minimum description length synthetic aperture radar image segmentation

Abstract: We present a new minimum description length (MDL) approach based on a deformable partition--a polygonal grid--for automatic segmentation of a speckled image composed of several homogeneous regions. The image segmentation thus consists in the estimation of the polygonal grid, or, more precisely, its number of regions, its number of nodes and the location of its nodes. These estimations are performed by minimizing a unique MDL criterion which takes into account the probabilistic properties of speckle fluctuation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
78
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 79 publications
(78 citation statements)
references
References 38 publications
0
78
0
Order By: Relevance
“…However, this method is quite complicated and has the side effect of boundary leakage (see Figure 3c). Fortunately, the Laplacian operator can solve this problem which has been demonstrated in [33,36]. Therefore, instead of the reinitialization process, we introduced a diffusion term "ωg∆φ" into the LSE Equation (17), and the final RD LSE equation can be expressed as…”
Section: The Proposed Modelmentioning
confidence: 99%
“…However, this method is quite complicated and has the side effect of boundary leakage (see Figure 3c). Fortunately, the Laplacian operator can solve this problem which has been demonstrated in [33,36]. Therefore, instead of the reinitialization process, we introduced a diffusion term "ωg∆φ" into the LSE Equation (17), and the final RD LSE equation can be expressed as…”
Section: The Proposed Modelmentioning
confidence: 99%
“…In the following, the purpose will thus be to generalize the MDL-based partitioning technique proposed in 18,25 to such circular data.…”
Section: Partition Into Regions With Homogeneous Orientationsmentioning
confidence: 99%
“…Researchers have proposed many kinds of segmentation algorithms for SAR images, which include threshold methods, 3,[17][18][19] spectral clustering (SC) algorithms, 20,21 statistic model-based methods, 1,14,15,[22][23][24][25] artificial intelligence methods, [26][27][28][29][30] support vector machine (SVM), 6,31 region growing methods, 15,[32][33][34][35] and so on. Among these algorithms, cluster-based algorithms form one popular and representative family, whose main idea is to group pixels in such a way that the pixels in the same group are more similar to each other than those in other groups.…”
Section: Introductionmentioning
confidence: 99%