Title :
Image processing in a tree of peano coded images
Author :
Seetharaman, Guna S. ; Zavidovique, Bertrand
Author_Institution :
Center for Adv. Comput. Studies, Univ. of Southwestern Louisiana, Lafayette, LA, USA
Abstract :
The authors investigate some attractive features of the 1-D sequence of pixels produced by the peano traversal of an image. They introduce two new hardware operations called bit-spreaded-meshing and its inverse brit-collation to produce and invert the sequence in real-time. A compact binary tree built using this sequence at its base implicitly contains the well known quadtree of the image also. The binary tree representation supports efficient design and implementation of divide and conquer algorithms. Its construction is readily extendable to higher dimensional images. They present a global optimization algorithm for image segmentation whose design is based on the binary tree. It produces a minimal cutset of homogeneous nodes in the tree using a dynamic programming technique. The experimental results assert the merit of the binary tree based implementation compared to its counterpart the quadtree
Keywords :
divide and conquer methods; dynamic programming; image representation; image segmentation; image sequences; real-time systems; tree data structures; 1D pixel sequence; binary tree representation; bit-spreaded-meshing; compact binary tree; divide and conquer algorithms; dynamic programming technique; global optimization algorithm; hardware operations; image processing; image segmentation; inverse brit-collation; minimal homogeneous node cutset; peano coded image tree; peano traversal; quadtree; real-time sequence inversion; real-time sequence production; Algorithm design and analysis; Binary trees; Design optimization; Dynamic programming; Hardware; Image processing; Image segmentation; Partitioning algorithms; Pixel; Tree graphs;
Conference_Titel :
Computer Architecture for Machine Perception, 1997. CAMP 97. Proceedings. 1997 Fourth IEEE International Workshop on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-8186-7987-5
DOI :
10.1109/CAMP.1997.632021