Node Linking Strategies in Pyramids for Image Segmentation

A one-pass, bottom-up overlapped pyramid-1inking algorithm is described. This algorithm differs from other pyramid-linking methods in (a) the ordering of node linking, (b) pyramid initialization, and (c) root and leaf marking schemes for determining region segmentation trees. A proof of the convergence of the algorithm is also given.

[1]  Theodosios Pavlidis,et al.  Picture Segmentation by a Tree Traversal Algorithm , 1976, JACM.

[2]  Azriel Rosenfeld,et al.  Multiresolution Pixel Linking For Image Smoothing And Segmentation , 1981, Other Conferences.

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

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

[5]  Azriel Rosenfeld,et al.  Pyramid linking is a special case of ISODATA , 1983, IEEE Transactions on Systems, Man, and Cybernetics.