메뉴 건너뛰기
소속 기관 / 학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
고객센터 ENG
주제분류

피인용 0

검색

    초록·키워드

    This paper proposes a new thinning algorithm and proves its validity. This new thinning algorithm can solve the problems explored in one-pass algorithm[5]. A processor suitable for this thinning algorithm is designed to operate on single cycle per iteration. And it also has capability of handling the variable-width input image. Flexible and high-speed operation of this processor shown its applicability in many applications. window has been regarded as optimal size, but it doesn't guarantee the connectedness over the edges of input pattern. Hence, additional windows are used to extract better skeleton. Although these windows show improved results, they still exhibit end-point reduction and disconnected feature in specific condition. In this paper, a modified algorithm is proposed and estimated. Since many thinning algorithms concentrate on the performance of algorithm itself, it is often noted that an algorithm is not easily implemented due to cost and/or technical limitations. Moreover, existing hardware processors are designed to operate only for the fixed image-width, which necessitates the time consuming "normalization process". Now we propose a thinning processor that is flexible over an image-width. Experimental results show its outstanding applicability in various pattern recognition systems.

    최근 본 자료 전체보기

      UCI(KEPA) : I410-ECN-0101-2009-569-013188793