이진 경계 코드를 이용한 새로운 영역채움 알고리듬

A New Interior-Filling Algorithm Based on Binary Boundary Coding

One of the most common problems in pattern recognition and image processing is filling the interior of a region when its contour is given. The existing algorithms of the filling are parity check technique, seeding technique, and technique based on chain coding the boundaries. In this paper, a very simple but effective technique for filling the interior of bounded region is proposed. This algorithm is based on the information of binary-coded boundary direction and covers some of the drawbacks reported in the earlier relevant works.