• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.153-158
• /
• 1992

We propose, in this paper, a new thinning algorithm and demonstrate Its effectiveness with some concrete experimental results. This new thinning process can solve the problems of disconnectivity and end point reduction explored in one-Pass algorithm Furthermore, this algorithm is proven effective particularly In high speed operation. A processor for this algorithm that is capable of hand-ling Input Image width(between 25 and 4t) bits ) and also operates on pipelining, is implemented and tested. Flexibility and high speed operation of this thinning processor should find excellent applicability in various areas.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05c
• /
• pp.277-281
• /
• 2002

본 논문에서는 '지문 인식의 전처리 과정 단축에 관한 연구'의 알고리즘의 구현에 대한 내용을 언급했으며, 향우 보완에 대한 내용을 다루고 있다[6]. 기존의 알고리즘을 보면 지문 매칭을 하기 전에 이미지 이진화와 세선화, 방향성 추출, 특징점 추출을 거친 후에 지문의 매칭이 이루어지는 단계이다. 이런 단계를 줄이기 위해 논문에서는 세선화 과정에서 기존의 알고리즘을 쓰지 않고 융선을 추적해 나가는 방법으로 세선화를 함과 동시에 방향성 추출과 특징점 추출을 함께 해 나갈 수 있는 방향을 제시하고 있다. 이렇게 됨으로써 인식 시간을 단축 할 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.73-81
• /
• 2004

To extract the creditable features in fingerprint image, many people use the thinning algorithm that has a very important position in the preprocessing. In this paper, we propose the robust parallel thinning algorithm that can preserve the connectivity of the binarized fingerprint image, make the thinnest skeleton with 1-pixel width and get near to the medial axis extremely. The proposed thinning method repeats three sub-iterations. The first sub-iteration takes off only the outer boundary pixel by using the interior points. To extract the one side skeletons, the second sub-iteration finds the skeletons with 2-pixel width. The third sub-iteration prunes the needless pixels with 2-pixel width existing in the obtained skeletons and then the proposed thinning algorithm has the robustness against the rotation and noise and can make the balanced medial axis. To evaluate the performance of the proposed thinning algorithm we compare with and analyze the previous algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.719-721
• /
• 2013

A thinning stage of fingerprint algorithm occupies 39% cycle of microprocessor system for identification processing of image from fingerprint sensor. Hardware block processing is more effective than software one in speed and power consumption, because a thinning algorithm is iteration of simple instructions without a transcendental function. This paper describes an effective hardware scheme for thinning stage processing using Verilog-HDL in $64{\times}64$ Pixel Array. The hardware scheme is designed and simulated in RTL. The logic is also synthesized by XST in FPGA environment and tested. Experimental results show the performance of the proposed scheme and possibility of application for a soft microprocessor and thinning processor embedded fingerprint SoC.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.651-656
• /
• 2001

In this paper, we propose Improved Self-Organized Graph(Improved SOG：$SOG^*$)thinning method, which maintains the excellent thinning results of Self-organized graph(SOG) built from Self-Organizing features map and improves the performance of modified SOG using a new incremental learning method of Kohonen features map. In the experiments, this method shows the thinning results equal to those of SOG and the time complexity O((logM)3) superior to it. Therefore, the proposed method is useful for the feature extraction from digits and characters in the preprocessing step.

• Korean Journal of Cognitive Science
• /
• v.2 no.2
• /
• pp.341-358
• /
• 1990

In this paper, A thinning algorithm which can solve a noise problem os proposed. The proposed method is based on the pavlidis thinning algorithm. During a contour tracing period of the given image, the masks of $3{\times}3$ pixels are proposed. They check all possible caseds of the noise conditions. As soon as the contour tracing is finished, the candidates of the noise are automatically deleted. As a result of the implementation of the proposed algorithm, the similar results which is obtained by noise-free image are obtained and they show the simplified structures comparing with the thinning results of the noisy images. Thus, They illustrate that a simple recognition part is needed to identify the objects.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.45-53
• /
• 1999

Geographic Information System(GIS) which facilitates efficient storage and retrieval of geographic information is very useful tools. It is of extreme importance to develop automated vectorizing system as input method for GIS, because it takes a large amount of time and effort in constructing a GIS. In all kinds of map processed by GIS, contour line map specially takes a large amount of effort. In this paper we have considered an optimal thinning algorithm for the contour line vectorizing in the GIS. Based on the experimental results, it has been proved that thinning algorithm using the connection value is most excellent algorithm in the similarity and connectivity.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.701-710
• /
• 1995

A thinning algorithm is a very important procedure in order to increase recognition rate in the character recognition. This paper is the study of a parallel thinning algorithm available for the recognition of various characters, and it proposes the parallel thinning algorithm using the 8-neighbors connectivity value. Characteristics of the proposed algorithm are easiness of implementation of parallelism, the result of thinning is perfectly-8 connectivity and represented by numeric information. The proposed algorithm is very suitable for characters having many curve segments such as English, Japanese etc. Performance evaluation was performed by the measure of similarity to reference skeleton.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.111-114
• /
• 2008

This paper proposes an effective hardware scheme for gabor filter and thinning stage processing of a fingerprint identification algorithm based on minutiae with 80% cycle occupation of 32-bit RISC microprocessor. The algorithm was developed based on minutiae with bifurcation and ending point. The analysis of an algorithm source rode was performed using ARM emulator.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.284-285
• /
• 2008

논문에서는 비전센서로 전방도로영상을 획득하여 차선인식과 정을 거쳐 자율주행에 필요한 도로정보를 추출하고 사고를 방지할 수 있게 경보음을 발생하는 기법을 제시한다. 비전을 통해 입력되는 정보중 직선도로나 곡선도로의 외곽에 해당하는 백색 선만을 인식하는 알고리즘이 필요하다. 이러한 알고리즘을 수행하기 위해서는 많은 계산량이 필요로 하기 때문에 실시간의 자율주행 시스템에의 적용은 제약이 수반된다. 본 논문은 이와 같은 문제를 해결하기 위해 세선화 영역 및 차선이탈경보시스템(LDWS) 알고리즘을 제시한다.