• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.163-164
• /
• 2015

In order to decode the bar code image binarization process is indispensable. The traditional binarization method is a global threshold binarization and local threshold binarization. Global threshold binarization method using a single threshold. In some cases there is a blur, or if the brightness is different from the bar code image. Therefore, binary pattern information is not retained. Local threshold method is binaized pattern information is maintained but processing speed is slow than global threshold binarization. The algorithm for solving this problem, there is modified binary algorithm. In this paper, we proposed hardware IP implemented by Vivado of modified binary algorithm.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2076-2079
• /
• 2003

This paper describes an efficient thresholding method for the binarization of a grey-level letter image. This method determines the adaptive threshold for letter image binarization by introducing the readjusting parameter, based on the global variance of the input image. Experimental results show that the proposed binarization method outperforms on the various letter images with a texture or noise when compared to the other methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.10
• /
• pp.1877-1884
• /
• 2006

Image binarization is an important preprocessing to identify objects of interest by dividing pixels into background and objects. Usually binarization methods are classified into global and local thresholding approaches. In this paper, we propose an efficient and adaptive binarization method for the character segmentation by combining both advantages of the global and the local thresholding methods. Experimental results with the korean character images present that the proposed method binarizes character image faster and better than other local binarization methods.

• Journal of Korea Multimedia Society
• /
• v.11 no.12
• /
• pp.1649-1657
• /
• 2008

In this paper, to overcome the failure of binarization for the characters suffered from low contrast and non-uniform illumination in license plate character recognition system, we improved the binarization method by combining local thresholding with global thresholding and edge detection. Firstly, apply the local thresholding method to locate the characters in the license plate image and then get the threshold value for the character based on edge detector. This method solves the problem of local low contrast and non-uniform illumination. Finally, back-propagation Neural Network is selected as a powerful tool to perform the recognition process. The results of the experiments i1lustrate that the proposed binarization method works well and the selected classifier saves the processing time. Besides, the character recognition system performed better recognition accuracy 95.7%, and the recognition speed is controlled within 0.3 seconds.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.801-814
• /
• 2004

In this paper, we propose a block adaptive binarization (BAB) using a modified quadratic filter (MQF) to binarize business card images acquired by personal digital assistant (PDA) cameras effectively. In the proposed method, a business card image is first partitioned into blocks of 8${\times}$8 and the blocks are then classified into character Hocks (CBs) and background blocks (BBs). Each classified CB is windowed with a 24${\times}$24 rectangular window centering around the CB and the windowed blocks are improved by the pre-processing filter MQF, in which the scheme of threshold selection in QF is modified. The 8${\times}$8 center block of the improved block is barbarized with the threshold selected in the MQF. A binary image is obtained tiling each binarized block in its original position. Experimental results show that the MQF and the BAB have much better effects on the performance of binarization compared to the QF and the global binarization (GB), respectively, for the test business card images acquired in a PDA. Also the proposed BAB using MQF gives binary images of much better quality, in which the characters appear much better clearly, over the conventional GB using QF. In addition, the binary images by the proposed BAB using MQF yields about 87.7% of character recognition rate so that about 32.0% performance improvement over those by the GB using QF yielding about 55.7% of character recognition rate using a commercial character recognition software.

• International Journal of Knowledge Content Development & Technology
• /
• v.5 no.2
• /
• pp.11-24
• /
• 2015

It is common for archive libraries to provide public access to historical and ancient document image collections. It is common for such document images to require specialized processing in order to remove background noise and become more legible. Document images may be contaminated with noise during transmission, scanning or conversion to digital form. We can categorize noises by identifying their features and can search for similar patterns in a document image to choose appropriate methods for their removal. In this paper, we propose a hybrid binarization approach for improving the quality of old documents using a combination of global and local thresholding. This article also reviews noises that might appear in scanned document images and discusses some noise removal methods.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.438-441
• /
• 2004

Image binarization using a global threshold value [3] performs at high speed, but usually results in undesired binary images when the source images are of poor quality. In such cases, adaptive local thresholding algorithms [1][2][3] are used to obtain better results, and the algorithm proposed by A.E.Savekis which chooses local threshold using fore­ground and background clustering [1] is one of the best thresholding algorithms. However, this algorithm runs slowly due to its re-computing threshold value of each central pixel in a local window MxM. In this paper, we present a dynamic programming approach for the step of calculating local threshold value that reduces many redundant computations and improves the execution speed significantly. Experiments show that our proposal improvement runs more ten times faster than the original algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.4
• /
• pp.1-5
• /
• 2001

A new approach for determining global threshold value for image binarization is proposed in this paper. In the proposed algorithm, bit-plane information which involve the shapes of original image is used for dividing image into two parts object and background, and then compared each average values. Optimal threshold value are selected in center of two averages. Proposed method is relatively simple but robust and achieved good results in continuous tone images and document image.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.1
• /
• pp.49-56
• /
• 2017

Recently, many research works on the icebreaking vessels have been published as the possibility of passing Arctic routes has been increasing. The model ship test on the pack ice model in the ice basin is actively carried out as a way to investigate the performance of icebreaking vessels. In this test, the concentration of pack ice is important since it directly affects the performance. However, it is difficult to measure the concentration because not only the pack ice has uneven shape but also it keeps floating around in the basin. In this paper, an algorithm to identify the concentration of pack ice is introduced. From a digital image of pack ice obtained in the ice basin, the goal is to measure the area of pack ice using an image processing technique. Instead of the general global binarization that yields numerical errors in this problem, a local binarization technique, coupled with image subdivision based on the quadtree structure, is developed. The concentration results obtained by the developed algorithm are compared with the manually measured data to prove its accuracy.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.3
• /
• pp.608-618
• /
• 2007

Image binarization is an important preprocessing to identify the object of interest by dividing pixels into the background and object. We proposes efficient binarization method and a stroke reconstruction method of the low quality character image for an effective character recognition. First, the character image is binarized by using the both advantages of local and global thresholding method and then the noise elimination around the character stroke and the hole filling on the stoke by the analysis of the binarized stroke image are performed to enhance the quality of the character stroke. Proposed binarization algorithm for character image achieved an efficiency of both processing speed and performance by the adaptive threshold selection. Moreover, We could get a high qualify binary image by a stroke reconstruction of the step-by-step denoising process.