27 March 1989 An Efficient Grid-Based Representation Of Arbitrary Object Boundaries
Author Affiliations +
Proceedings Volume 1002, Intelligent Robots and Computer Vision VII; (1989) https://doi.org/10.1117/12.960265
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States
We present an efficient scheme for representing irregular object boundaries which belongs to the grid-based chain coding family. The scheme which is called polycurve codes extends the chain coding family, e.g., chain codes and generalized chain codes, by employing predefined circular-arc segments as boundary approximators in addition to straight-line segments. Each circular-arc segment in polycurve codes is predefined around the associated line segment and labeled as an integer. Polycurve codes enables direct extraction and labeling of high-level line and arc segments from arbitrary boundaries. Once the object boundaries are encoded by poly-curve codes, feature calculation and shape analysis may be done solely based on the look-up table indexed by the integer labels. Experimental results show that polycurve codes improve performance, such as compactness and encoding time, over the existing chain coding family.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chang Y. Choo, Chang Y. Choo, } "An Efficient Grid-Based Representation Of Arbitrary Object Boundaries", Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960265; https://doi.org/10.1117/12.960265


Model-Based Object Recognition Using The Connection Machine
Proceedings of SPIE (February 18 1988)
A Hierarchical Segmentation Algorithm
Proceedings of SPIE (June 08 1986)
Robust regression in computer vision
Proceedings of SPIE (January 31 1991)

Back to Top