• Title/Summary/Keyword: Binarization Thinning

Search Result 18, Processing Time 0.025 seconds

A study on crack detection using Image processing (화상처리 기법을 이용한 균열 검출에 관한 연구)

  • 이방연;김진근;박석균
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2003.11a
    • /
    • pp.655-658
    • /
    • 2003
  • The crack of concrete structure plays an important role in the durability and safety of structure. Therefore, the features such as width, length, and direction of that must be measured periodically. The conventional method of measurement of cracks is manually sketched, however. it takes a fairly long time and lacks quantitative objectivity. This study proposes the algorithm to extract and analyze cracks automatically. The proposed algorithm is composed of two sub-algorithms. The extraction algorithm includes elimination of effect due to light, binarization. and noise reduction. The analysis algorithm includes thinning process, labeling, and calculation of crack width, length, and direction. The test to demonstrate the algorithm is fulfilled using the images of cracks on real concrete surface.

  • PDF

An extraction technique of automatic recognizing regions on Power distribution facility map (배전설비도면에서의 자동인식 대상 영역 추출 방법)

  • Kim, Gye-Young;Keun, Bok-Hee;Lee, Bong-Jae;Cho, Seon-Ku
    • Proceedings of the KIEE Conference
    • /
    • 1999.07g
    • /
    • pp.2914-2916
    • /
    • 1999
  • A power distribution facility map is composed of distribution facility information regions, cadastral regions and grid lines. In this map, our goal is automatic interpretation of power distribution region. For the goal, it is the first work to extract the power distribution facility region. In this paper, we propose a method to extract power distribution facility regions. The proposed method is consist of two phases, binarization phase and extending phase. The first phase generate a power distribution facility image using threshold value. The image contains many part of power distribution facility regions, but not all. The second phase extends thinned image which is generated by appling thinning operator to the power distribution facility image.

  • PDF

Fingerprint Pattern Recognition Algorithm (지문 Pattern 인식 Algorithm)

  • 김정규;김봉일
    • Korean Journal of Remote Sensing
    • /
    • v.3 no.1
    • /
    • pp.25-39
    • /
    • 1987
  • The purpose of this research is to develop the Automatic Fingerprint Verfication System by digital computer based on specially in PC level. Fingerprint is used as means of personal identity verification in view of that it has the high reliability and safety. Fingerprint pattern recognition algorithm is constitute of 3 stages, namely of the preprocessing, the feature extraction and the recognition. The preprocessing stage includes smoothing, binarization, thinning and restoration. The feature extraction stage includes the extraction of minutiae and its features. The recognition stage includes the registration and the matching score calculation which measures the similarity between two images. Tests for this study with 325 pairs of fingerprint resulted in 100% of separation which which in turn is turned out to be the reliability of this algorithm.

Automatic fingerprint recognition using directional information in wavelet transform domain (웨이블렛 변환 영역에서의 방향 정보를 이용한 지문인식 알고리즘)

  • 이우규;정재호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.10
    • /
    • pp.2317-2328
    • /
    • 1997
  • The objective of this paper is to develop an algorithm for a real-time automatic fingerprint recognition system. The algorithm employs the wavelet transform(WT) and the dominat local orientation that derived from the gradient Gaussian(GoG) and coherence in determining the directions of ridges in fingerprint images. By using the WT, the algorithm does not require conventional preprocessing procedures such as smothing, binarization, thining and restoration. For recognition, two fingerprint images are compared in three different ST domains;one that represents the original image compressed to quarter(LL), another that shows vertical directional characteristic(LH), and third as the block that contains horizontal direction(HL) in WT domain. Each block has dominat local orientation that derived from the GoG and coherence. The proposed algorithm is imprlemented on a SunSparc-2 workstation under X-window environment. Our simulation results, in real-time have shown that while the rate of Type II error-Incorrect recognition of two identical fingerprints as the identical fingerprints-is held at 0%, the rate of Type I error-Incorrect recognitionof two identical fingerprints as the different ones-is 2.5%.

  • PDF

Automatic Real-time Identification of Fingerprint Images Using Block-FFT (블럭 FFT를 이용한 실시간 지문 인식 알고리즘)

  • 안도성;김학일
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.6
    • /
    • pp.909-921
    • /
    • 1995
  • The objective of this paper is to develop an algorithm for a real-time automatic fingerprint recognition system. The algorithm employs the Fast Fourier Transform (FFT) in determining the directions of ridges in fingerprint images, and utilizes statistical information in recognizing the fingerprints. The information used in fingerprint recognition is based on the dircetions along ridge curves and characteristic points such as core points and delta points. In order to find ridge directions, the algorithm applies the FFT to a small block of the size 8x8 pixels, and decides the directions by interpreting the resulted Fourier spectrum. By using the FFT, the algorithm does not require conventional preprocessing procedures such as smoothing, binarization, thinning, and restorationl. Finally, in matching two fingerprint images, the algorithm searches and compares two kinds of feature blocks, one as the blocks where the dircetions cannot be defined from the Fourier spectrum, and the other as the blocks where the changes of directions become abrupt. The proposed algorithm has been implemented on a SunSparc-2 workstation under the Open Window environment. In the experiment, the proposed algorithm has been applied to a set of fingerprint images obtained by a prism system. The result has shown that while the rate of Type II error - Incorrect recognition of two different fingerprints as the identical fingerprints - is held at 0.0%, the rate of Type I error - Incorrect recognition of two identical fingerprints as the different ones - is 2.2%.

  • PDF

A Study on the Dynamic Binary Fingerprint Recognition Method using Artificial Intelligence (인공지능기법을 이용한 동적 이진화 지문인식 방법에 관한 연구)

  • Kang, Jong-Yoon;Lee, Joo-Sang;Lee, Jae-Hyun;Kong, Suk-Min;Kim, Dong-Han;Lee, Sang-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.1
    • /
    • pp.57-62
    • /
    • 2003
  • Among the procedure of automatic fingerprint recognition, binary code is important for the optimum thinning and singular point extraction while reserving the fingerprint image data. Binarization is to convert gray scale images into 0s and 255s values. For this conversion, you should set up the proper threshold value not to lose fingerprint image data. In this paper, we suggest the method to extract the standard threshold in real-time from fingerprint images entered by applying artificial intelligent methods in the binary code procedure. We show improved features while comparing the experiment results with the existing methods.

Fingerprint Recognition Using Artificial Neural Network (인공신경망을 이용한 지문인식)

  • Jung, Jung-hyun;Choi, Byung-Yoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2014.05a
    • /
    • pp.417-420
    • /
    • 2014
  • Importance of security system to prevent recently increased financial security accident is increasing. Biometric system between the security systems is focused. Fingerprint recognition has many useful aspects such as security, reliability and portability. In this treatise, fingerprint recognition technique is realized by using artificial neural network. Artificial Neural Network(ANN) is a mathematics learning model that makes specific patterns that a program can recognize to show a nerve network's characteristic on a computer. Input fingerprint images have a preprocessing process such as equalization, binarization and thinning. We extract minutiae feature in the images and program can recognize a fingerprint through ANN.

  • PDF

A Study on Stroke Extraction for Handwritten Korean Character Recognition (필기체 한글 문자 인식을 위한 획 추출에 관한 연구)

  • Choi, Young-Kyoo;Rhee, Sang-Burm
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.375-382
    • /
    • 2002
  • Handwritten character recognition is classified into on-line handwritten character recognition and off-line handwritten character recognition. On-line handwritten character recognition has made a remarkable outcome compared to off-line hacdwritten character recognition. This method can acquire the dynamic written information such as the writing order and the position of a stroke by means of pen-based electronic input device such as a tablet board. On the contrary, Any dynamic information can not be acquired in off-line handwritten character recognition since there are extreme overlapping between consonants and vowels, and heavily noisy images between strokes, which change the recognition performance with the result of the preprocessing. This paper proposes a method that effectively extracts the stroke including dynamic information of characters for off-line Korean handwritten character recognition. First of all, this method makes improvement and binarization of input handwritten character image as preprocessing procedure using watershed algorithm. The next procedure is extraction of skeleton by using the transformed Lu and Wang's thinning: algorithm, and segment pixel array is extracted by abstracting the feature point of the characters. Then, the vectorization is executed with a maximum permission error method. In the case that a few strokes are bound in a segment, a segment pixel array is divided with two or more segment vectors. In order to reconstruct the extracted segment vector with a complete stroke, the directional component of the vector is mortified by using right-hand writing coordinate system. With combination of segment vectors which are adjacent and can be combined, the reconstruction of complete stroke is made out which is suitable for character recognition. As experimentation, it is verified that the proposed method is suitable for handwritten Korean character recognition.