Issue No. 02 - February (1989 vol. 11)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.16712
<p>A method for studying problems in digital image processing, based on a combination of renormalization group ideas, the Markov random-field modeling of images, and metropolis-type Monte Carlo algorithms, is presented. The method is efficiently implementable on parallel architectures, and provides a unifying procedure for performing a hierarchical, multiscale, coarse-to-fine analysis of image-processing tasks such as restoration, texture analysis, coding, motion analysis, etc. The method is formulated and applied to the restoration of degraded images. The restoration algorithm is a global-optimization algorithm applicable to other optimization problems. It generates iteratively a multilevel cascode of restored images corresponding to different levels of resolution, or scale. In the lower levels of the cascade appear the large-scale features of the image, and in the higher levels, the microscopic features of the image.</p>
image restoration; computerised picture processing; renormalization group; digital image processing; Markov random-field modeling; Monte Carlo algorithms; coarse-to-fine analysis; texture analysis; global-optimization; multilevel cascode; computerised picture processing; Markov processes; Monte Carlo methods; optimisation
B. Gidas, "A Renormalization Group Approach to Image Processing Problems," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 11, no. , pp. 164-180, 1989.