Hidden tree-like quasi-Markov model and generalized technique for a class of image processing problems

• Published in: Proceedings of 13th International Conference on Pattern Recognition Vol. 2; pp. 715 - 719 vol.2
• Main Authors: Mottl, V.V., Muchnik, I.B., Blinov, A.B., Kopylov, A.V.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 1996
• Subjects: Brightness; Buildings; Data mining; Image processing; Image segmentation; Image texture analysis; Operations research; Pixel; Smoothing methods; Tree graphs
• ISBN: 9780818672828; 081867282X
• ISSN: 1051-4651; 2831-7475
• DOI: 10.1109/ICPR.1996.546916

Four problems of image processing, namely, those of smoothing. texture image segmentation, matching two images of similar structure, and building the local texture orientation map, are considered jointly as problems which can be treated as those of transforming the original image into another function on the image plane. We generalized statistical image processing procedure is aimed at finding a compromise between the local image-dependent information on the values of the hidden function at each pixel and the a priori information expressed in the form of some Markov smoothness constraints. For attaining a higher computation speed, instead of a full unitary prior Markov model of the hidden field, a compromise composite model is used which consists of a set of independent identical tree-like Markov neighborhood graphs.