Speeding up of microstructure reconstruction: I. Application to labyrinth patterns
R. Piasecki, W. Olchawa

TL;DR
This paper improves the speed of microstructure reconstruction by using a cellular automaton-generated initial pattern and biased Monte Carlo steps, demonstrating faster convergence with comparable accuracy for labyrinth patterns.
Contribution
It introduces a hybrid reconstruction method combining cellular automaton initialization with biased Monte Carlo simulation to accelerate microstructure reconstruction.
Findings
The mixed #2m approach was the fastest and most accurate.
Biased Monte Carlo methods improved efficiency over random approaches.
The method achieved comparable reconstruction quality with reduced computational steps.
Abstract
Recently, entropic descriptors based the Monte Carlo hybrid reconstruction of the microstructure of a binary/greyscale pattern has been proposed (Piasecki 2011 Proc. R. Soc. A 467 806). We try to speed up this method applied in this instance to the reconstruction of a binary labyrinth target. Instead of a random configuration, we propose to start with a suitable synthetic pattern created by cellular automaton. The occurrence of the characteristic attributes of the target is the key factor for reducing the computational cost that can be measured by the total number of MC steps required. For the same set of basic parameters, we investigated the following simulation scenarios: the biased/random alternately mixed #2m approach, the strictly biased #2b and the random/partially biased #2rp one. The series of 25 runs were performed for each scenario. To maintain comparable accuracy of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
