Paper
19 February 1988 VLSI Implementation Of A Fast Contour Tracing Method
H. S. Hou
Author Affiliations +
Proceedings Volume 0848, Intelligent Robots and Computer Vision VI; (1988) https://doi.org/10.1117/12.942812
Event: Advances in Intelligent Robotics Systems, 1987, Cambridge, CA, United States
Abstract
This paper discusses a VLSI implementation of a fast contour tracing algorithm. Since Freeman published his chain code method for encoding the contour of binary images in 1961, this contour tracing method has been used in many different applications. In this paper, Freeman's chain code algorithm has been reformulated so that it can be implemented in array processing. A complete look-up table was first presented and we have derived from that an adaptive selection-inhibition circuit coupled with a priority encoder. From a VLSI implementation point of view, those circuits not only have area and speed advantages, but also are easy to lay out.
© (1988) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. S. Hou "VLSI Implementation Of A Fast Contour Tracing Method", Proc. SPIE 0848, Intelligent Robots and Computer Vision VI, (19 February 1988); https://doi.org/10.1117/12.942812
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Very large scale integration

Computer vision technology

Logic

Machine vision

Robot vision

Robots

RELATED CONTENT

Techniques for high-performance analog neural networks
Proceedings of SPIE (March 01 1992)
An Architecture For Boundary-Based Segmentation
Proceedings of SPIE (February 19 1988)
Vertices and corners: a maximum likelihood approach
Proceedings of SPIE (August 20 1993)
Ho-Kashyap CAAP 1:1 associative processors
Proceedings of SPIE (February 01 1991)
Default Knowledge With Partial Matching
Proceedings of SPIE (March 01 1990)

Back to Top