Konferencja
Conference on Computer Graphics and Image Processing, GKPO' 98 (5 ; 18-22.05.1998 ; Borki, Poland)
Języki publikacji
Abstrakty
The paper presents a new technique of segmentating digital contours using multiple segmentation primitives. Therefore segmentation results are a combination of line segments, arcs. corners,etc., depending on how well these shapesmath the orginal contour. In yhr first step, the prospective instances of all avaible segmentation primitives are detected within the input digital contours. Then, the detected instances are ranked according to how accurately they fit the corresponding fragment of the contour. Finally, the top-rank segmantation primitives are selected one by one until the whole contour is approximeted. The algorithms has relatively low computational complexity, and it allows paraqllel implementation. Moreover, the algorithm is not sensitive to the performance of edge detectors so that similar results are produced no matter what edge detector has extracted contours from the original image. Therefore, if the quality of camera-captured images is satisfactofily high, the algorithm can analyse them whitout any pre- processing required (except, of course, edge detection).
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
269--279
Opis fizyczny
Bibliogr. 12 poz.
Twórcy
autor
- School of Applied Science and Robotics Research Centre, Nanyang Technological University, Nanyang Avenue, Singapore 639 798, assluzek@ntu.edu.sg
Identyfikator YADDA
bwmeta1.element.baztech-article-BWA1-0001-0060