[Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing 1992
DOI: 10.1109/icassp.1992.226148
|View full text |Cite
|
Sign up to set email alerts
|

Satellite image classification using a modified Metropolis dynamics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
55
0

Year Published

1996
1996
2014
2014

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 55 publications
(55 citation statements)
references
References 8 publications
0
55
0
Order By: Relevance
“…The resolution of the SAR mosaics was 500 m. After this a segmentation step was performed for the daily mosaic. Here we have used an MRF-based segmentation adapted from Kato et al (1992) and Berthod et al (1996), but in practice any feasible segmentation, such as ICM (iterated conditional modes) (Besag, 1986) or even K means (MacQueen, 1967), can be used with rather similar results. The SAR segments smaller than 100 pixels (corresponding to an area of 25 km 2 ) were combined with the adjacent larger segments with the closest HH backscattering value (by an iterative process).…”
Section: Sar Processingmentioning
confidence: 99%
“…The resolution of the SAR mosaics was 500 m. After this a segmentation step was performed for the daily mosaic. Here we have used an MRF-based segmentation adapted from Kato et al (1992) and Berthod et al (1996), but in practice any feasible segmentation, such as ICM (iterated conditional modes) (Besag, 1986) or even K means (MacQueen, 1967), can be used with rather similar results. The SAR segments smaller than 100 pixels (corresponding to an area of 25 km 2 ) were combined with the adjacent larger segments with the closest HH backscattering value (by an iterative process).…”
Section: Sar Processingmentioning
confidence: 99%
“…(3). For this optimization problem the iterative deterministic modified Metropolis dynamics (MMD) [40] algorithm was adopted. This is a compromise between the deterministic "iterated conditional modes" algorithm (ICM) [36], which is a fast local minimization technique, that is strongly dependent on the initial configuration, and simulated annealing (SA) [37], which is a very computationally intensive global minimization approach.…”
Section: A Dual-pol Casementioning
confidence: 99%
“…This is a compromise between the deterministic "iterated conditional modes" algorithm (ICM) [36], which is a fast local minimization technique, that is strongly dependent on the initial configuration, and simulated annealing (SA) [37], which is a very computationally intensive global minimization approach. MMD is computationally feasible and provides reasonable results in real classification problems [40]. MMD is set with a cooling schedule (like SA) and proceeds as follows:…”
Section: A Dual-pol Casementioning
confidence: 99%
“…This step involves the minimization of the energy (3). For this optimization the deterministic Modified Metropolis Dynamics (MMD) [20] algorithm is suggested. It is a compromise solution between the deterministic Iterated Conditional Modes algorithm [17], which is fast and finds local a minimum, and Simulated Annealing [18], that is slow, but finds the global minimum.…”
Section: Methods Overviewmentioning
confidence: 99%