You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.
20 August 1993Vertices and corners: a maximum likelihood approach
Scenes of polyhedral objects may be accurately represented in 2-D using line sketches. An aim of low level image processing is to generate useful binary images from grey scale images. The binary images generated by enhancement/threshold edge detectors are usually unrefined outlines of the underlying 3-D scene. Such images must be further processed to isolate and identify region boundaries; which, in the case of polyhedra, consist of line segments. The intersection or connection points of these line segments are known as vertices or corners. The work reported in this paper employs a decision theoretic approach to detect vertices in grey scale images.
Raashid Malik andSiu So
"Vertices and corners: a maximum likelihood approach", Proc. SPIE 2055, Intelligent Robots and Computer Vision XII: Algorithms and Techniques, (20 August 1993); https://doi.org/10.1117/12.150176
The alert did not successfully save. Please try again later.
Raashid Malik, Siu So, "Vertices and corners: a maximum likelihood approach," Proc. SPIE 2055, Intelligent Robots and Computer Vision XII: Algorithms and Techniques, (20 August 1993); https://doi.org/10.1117/12.150176