Translator Disclaimer
20 August 1993 Convex shape refinement using dynamic programming for surface defect classification on wooden materials
Author Affiliations +
Proceedings Volume 2055, Intelligent Robots and Computer Vision XII: Algorithms and Techniques; (1993) https://doi.org/10.1117/12.150148
Event: Optical Tools for Manufacturing and Advanced Automation, 1993, Boston, MA, United States
Abstract
This paper deals with a two-step segmentation algorithm for 2-D convex objects. First the objects are approximated by an elliptic shape description, and then the boundary of the object is refined using dynamic programming. The reason for refinement is accurate shape classification.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Wolfgang Poelzleitner "Convex shape refinement using dynamic programming for surface defect classification on wooden materials", Proc. SPIE 2055, Intelligent Robots and Computer Vision XII: Algorithms and Techniques, (20 August 1993); https://doi.org/10.1117/12.150148
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

Pattern recognition using stochastic neural networks
Proceedings of SPIE (August 19 1993)
Pattern recognition using Hilbert space
Proceedings of SPIE (October 31 1992)
Default Knowledge With Partial Matching
Proceedings of SPIE (February 28 1990)

Back to Top