Multiresolution object detection and delineation

This paper describes methods of detecting and extracting (“delineating,” i.e., segmenting) compact objects from an image. The methods are designed for implementation on an exponentially tapering “pyramid” of processors, and require only O (log n ) time for an n by n image. Objects are detected using an “interest measure” derived from local comparisons between fathers and sons in the pyramid. They are extracted by a top-down tree growing process in which the leaves of the tree are the pixels belonging to the detected object.

[1]  Hendrik James Antonisse Image segmentation in pyramids , 1982, Comput. Graph. Image Process..

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

[3]  Michael Shneier,et al.  Extracting Compact Objects Using Linked Pyramids , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Azriel Rosenfeld,et al.  Split-and-link algorithms for image segmentation , 1982, Pattern Recognit..

[5]  Azriel Rosenfeld,et al.  Segmentation and Estimation of Image Region Properties through Cooperative Hierarchial Computation , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[6]  Azriel Rosenfeld,et al.  Image Smoothing and Segmentation by Multiresolution Pixel Linking: Further Experiments and Extensions , 1982, IEEE Transactions on Systems, Man, and Cybernetics.