Earticle

초록

영어

The performance of binarization algorithms is determined by the selection of threshold value for binarization, and most of the previous binarization algorithms analyze the intensity distribution of the original images by using the histogram and determine the threshold value using the mean value of intensity or the intensity value corresponding to the valley of the histogram. The previous algorithms could not get the proper threshold value in the case that doesn't show the bimodal characteristic in the intensity histogram or for the case that tries to separate the feature area from the original image. Therefore, this paper proposed a novel algorithm for image binarization, which, first segments the intensity range of grayscale images to several intervals and calculates a mean value of intensity for each interval, and then repeats the interval integration until getting the final threshold value. The interval integration of two neighborhood intervals calculates the ratio of the distances between mean value and adjacent boundary value of two intervals and determine as the threshold value of the new integrated interval the intensity value that divides the distance between mean values of two intervals according to the ratio. The experiment for performance evaluation showed that the proposed algorithm generates the more effective threshold value than the previous algorithms.

목차

Abstract
 1. Introduction
 2. Related Studies
 3. Enhanced Image Binarization with Intensity Information
  3.1. Second-Order Headings
  3.2 The Calculation of Final Threshold Value
 4. Experiments and Results Analysis
 5. Conclusions
 References

키워드

저자

• Kwang Baek Kim [ Department of Computer Engineering, Silla University, 140 Baegyang-daero(Blvd) 700 beon-gil(Rd), Sasang-gu, Busan 617-736, Korea ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Multimedia and Ubiquitous Engineering

• 간기

  월간

• pISSN

  1975-0080

• 수록기간

  2008~2016

• 등재여부

  SCOPUS

• 십진분류

  KDC 505 DDC 605