Hierarchical Image Analysis Using Irregular Tessellations

In this paper we have presented an image analysis technique in which a separate hierarchy is built over every compact object of the input. The approach is made possible by a stochastic decimation algorithm which adapts the structure of the hierarchy to the analyzed image. For labeled images the final description is unique. For gray level images the classes are defined by converging local processes and slight differences may appear. At the apex every root can recover information about the represented object in logirhtmic number of processing steps, and thus the adjacency graph can become the foundation for a reulational model of the scene.

[1]  Azriel Rosenfeld,et al.  Compact Region Extraction Using Weighted Pixel Linking in a Pyramid , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Azriel Rosenfeld,et al.  Multiresolution image processing and analysis , 1984 .

[3]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[4]  Leonard Uhr,et al.  Parallel computer vision , 1987 .

[5]  Peter Meer,et al.  Stochastic image pyramids , 1989, Comput. Vis. Graph. Image Process..

[6]  Peter Meer,et al.  A fast parallel method for synthesis of random patterns , 1989, Pattern Recognit..

[7]  Azriel Rosenfeld,et al.  Hierarchical Image Analysis Using Irregular Tessellations , 1991, IEEE Trans. Pattern Anal. Mach. Intell..