체인코드의 방향정보를 이용한 Filling과 Labelling

Filling and Labelling Algorithm Using Directional Information of Chain-code

  • 발행 : 1992.09.01

초록

A new algorithm for filling the interior of contours and labelling each filled region concurrently is presented. Filling is simply accomplished by inversion method. The labelling information in every scan lines is extracted directly from current direction of chain code so that the proposed algorithm needs less comparision and is more efficient. The contours are followed by two different directions, clockwise for the outer contour and counterclockwise for the inner contour to get filling and labelling information. This algorithm can be applied in case that contours are nested or regions are continous. Simulataneously the proposed algorithm can find the structure tree of object without additional post processing.

키워드