Paper
1 March 1991 Efficient object contour tracing in a quadtree encoded image
G. N. Kumar, Nagaraj Nandhakumar
Author Affiliations +
Abstract
A new algorithm is presented to extract the chain-code representation of the boundary of a binary image. The quadtree representation of this image acts as the input to the algorithm. This algorithm is more efficient than the previously reported algorithm. The algorithm can trace the boundary according to either eight-connected or four-connected neighborhood definitions without any modification. The boundary is traced in the clock-wise direction with respect to the object. The algorithm is based on the following two observations; (1) Visiting a sequence of four-connected white nodes that lie along the object boundary yields an eight-connected boundary while (2) visiting a sequence of four-connected black nodes that lie along the object boundary yields a four-connected boundary. In other words, tracing the object boundary from outside the object using four-connected neighborhood definition extracts an eight-connected boundary, and tracing the object boundary from within the object using four-connected neighborhood definition extracts a four-connected boundary.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
G. N. Kumar and Nagaraj Nandhakumar "Efficient object contour tracing in a quadtree encoded image", Proc. SPIE 1468, Applications of Artificial Intelligence IX, (1 March 1991); https://doi.org/10.1117/12.45527
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Evolutionary algorithms

Artificial intelligence

Binary data

Detection and tracking algorithms

Algorithm development

Image processing

Visualization

Back to Top