2006
DOI: 10.1007/11867586_4
|View full text |Cite
|
Sign up to set email alerts
|

Frozen-State Hierarchical Annealing

Abstract: There is significant interest in the synthesis of discrete-state random fields, particularly those possessing structure over a wide range of scales. However, given a model on some finest, pixellated scale, it is computationally very difficult to synthesize both large and small-scale structures, motivating research into hierarchical methods.This thesis proposes a frozen-state approach to hierarchical modelling, in which simulated annealing is performed on each scale, constrained by the state estimates at the pa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…Considering the limitation of the traditional hierarchical annealing algorithm, a novel cooling–solidification annealing algorithm is introduced, which greatly improves the computational and modeling ability of the traditional hierarchical annealing algorithm. Unlike the binary state of the traditional hierarchical annealing algorithm, an intermediate gray value is introduced into the reconstruction process as follows 28 : xi,js{}0,g,1,()i,jLs Similar to the traditional hierarchical annealing algorithm, an interpolation operator ρ is also used in the cooling–solidification annealing algorithm. Nevertheless, the annealing process of the cooling–solidification annealing algorithm is different from the annealing process of the traditional hierarchical annealing algorithm.…”
Section: Cooling–solidification Annealing Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Considering the limitation of the traditional hierarchical annealing algorithm, a novel cooling–solidification annealing algorithm is introduced, which greatly improves the computational and modeling ability of the traditional hierarchical annealing algorithm. Unlike the binary state of the traditional hierarchical annealing algorithm, an intermediate gray value is introduced into the reconstruction process as follows 28 : xi,js{}0,g,1,()i,jLs Similar to the traditional hierarchical annealing algorithm, an interpolation operator ρ is also used in the cooling–solidification annealing algorithm. Nevertheless, the annealing process of the cooling–solidification annealing algorithm is different from the annealing process of the traditional hierarchical annealing algorithm.…”
Section: Cooling–solidification Annealing Algorithmmentioning
confidence: 99%
“…In the reconstruction process, the black (whose value is 1) and white (whose value is 0) elements on the coarser scale remain unchanged when the reconstruction moves on to the next finer scale. The elements and their subset must satisfy 28 : xi,js+1={00.5emif0.25emall0.25emsubsets of0.25emxi,js+10.25emat0.25emscale0.25emnormals0.25emare0.25em010.5emif0.25emall0.25emsubsets of0.25emxi,js+10.25emat0.25emscale0.25emnormals0.25emare0.25em1g0.5emotherwise Then, the energy function can be defined as 29 Es()x=nfsunf1sun2 Es()xtrue¯=nfsunf1sun2 The function f 1 s ( u n ) is the control function of the reference model, which is built by the CT image data for rocks, and f s ( u n ) and f ′ s ( u n ) are the actual values of the control function measured before and after the iteration step t , respectively.…”
Section: Cooling–solidification Annealing Algorithmmentioning
confidence: 99%