2003
DOI: 10.1007/978-3-642-55760-6
|View full text |Cite
|
Sign up to set email alerts
|

Image Analysis, Random Fields and Markov Chain Monte Carlo Methods

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
225
0

Year Published

2008
2008
2015
2015

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 280 publications
(226 citation statements)
references
References 0 publications
1
225
0
Order By: Relevance
“…The MCMC fitting is non-deterministic alternative and tests a wider range of values in parameter space than fminsearch, causing it to be more capable of locating sinks that contain global minima (Winkler, 2003;Gilks et al, 1996;Brooks et al, 2011). Markov chain fitting itself starts by choosing an initial condition, a point in parameter space, denoted by p 0 .…”
Section: Markov Chain Fitting With Simulated Annealingmentioning
confidence: 99%
See 2 more Smart Citations
“…The MCMC fitting is non-deterministic alternative and tests a wider range of values in parameter space than fminsearch, causing it to be more capable of locating sinks that contain global minima (Winkler, 2003;Gilks et al, 1996;Brooks et al, 2011). Markov chain fitting itself starts by choosing an initial condition, a point in parameter space, denoted by p 0 .…”
Section: Markov Chain Fitting With Simulated Annealingmentioning
confidence: 99%
“…This serves two purposes-to escape more easily from a local minimum that is not a global minimum, and to allow repeated iterations of the same algorithm to increase the accuracy of the results. The stochasticity in the algorithm allows for different outcomes even among trials with the same initial conditions (Winkler, 2003;Gilks et al, 1996;Brooks et al, 2011). This process is repeated n times-where n is an arbitrary number chosen by the user-before stopping.…”
Section: Markov Chain Fitting With Simulated Annealingmentioning
confidence: 99%
See 1 more Smart Citation
“…We can see that SA provides lower energies (and hence better approximations to the global fibrous structure according to our model) than classical ICM. The proposed deterministic optimization strategy (ICM with α-relaxation and (t 2 )+(t 4 )-moves) shows similar performance to SA with communication q 1 , and the corresponding computational gain is 20 6 ∼ 3.33. The graph-based approach together with either SA or our modified ICM algorithm presents longer fiber bundles and lower fiber-length dispersion.…”
Section: Quantitative Analysismentioning
confidence: 91%
“…The inversion was based on the exponential Markov Random Fields (MRF) model. The MRF is a global model uniquely determined by a local statistical description of a single image or multispectral images for image pattern analysis, texture modeling and image classification [58][59][60][61][62][63][64]. In this paper, we use MRF model to determine relative surface roughness from standard deviation of cross-polarized ratio of series of SAR imagery.…”
Section: Methodsmentioning
confidence: 99%