• Journal of Korea Multimedia Society
• /
• v.25 no.5
• /
• pp.670-675
• /
• 2022

This study proposes an improved binarization method to improve image recognition rate. The research goal is to minimize the information loss that occurs during the binarization process, and to transform the object of the original image that cannot be determined through the transformation process into an image that can be judged. The proposed method uses a stepwise segmentation method of an image and divides blocks using prime numbers. Also, within one block, a trapezoidal type of fuzzy is applied. The fuzzy trapezoid is binarized by dividing the brightness histogram area into three parts according to the degree of membership. As a result of the experiment, information loss was minimized in general images. In addition, it was found that the converted binarized image expressed the object better than the original image in the special image in which the brightness region was tilted to one side.

• 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.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2128-2131
• /
• 2003

We present an efficient algorithm for skew correction of business card images obtained by a PDA camera. The proposed method is composed of four parts: block adaptive binarization (BAB), stripe generation, skew angle calculation, and image rotation. In the BAB, an input image is binarized block by block so as to lessen the effects of irregular illumination and shadows over the input image. In the stripe generation, character string clusters are generated merging character strings and their inter-spaces, and then only clusters useful for skew angle calculation are output as stripes. In the skew angle calculation, the direction angles of the stripes are calculated using their central moments and then the skew angle of the input image is determined averaging the direction angles. In the image rotation, the input image is rotated by the skew angle. Experimental results shows that the proposed method yields correction rates of 97％ for business card images.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.3
• /
• pp.179-185
• /
• 2019

This paper proposes a block-type classification based image binarization for the implementation of the low-power feature extraction algorithm. The proposed method can be implemented with threshold value re-use technique approach when the image divided into $64{\times}64$ macro blocks size and calculating the threshold value for each block type only once. The algorithm is validated based on quantitative results that only a threshold value change rate of up to 9% occurs within the same image/block type. Existing algorithms should compute the threshold value for 64 blocks when the macro block is divided by $64{\times}64$ on the basis of $512{\times}512$ images, but all suggestions can be made only once for best cases where the same block type is printed, and for the remaining 63 blocks, the adaptive threshold calculation can be reduced by only performing a block type classification process. The threshold calculation operation is performed five times when all block types occur, and only the block type separation process can be performed for the remaining 59 blocks, so 93% adaptive threshold calculation operation can be reduced.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12C
• /
• pp.1225-1238
• /
• 2003

We present an efficient algorithm for skew correction of business card images obtained by a PDA (personal digital assistant) camera. The proposed method is composed of four parts: block adaptive binarization (BAB), stripe generation, skew angle calculation, and image rotation. In the BAB, an input image is binarized block by block so as to lessen the effect of irregular illumination and shadow over the input image. In the stripe generation, character string clusters are generated merging adjacent characters and their strings, and then only clusters useful for skew angle calculation are output as stripes. In the skew angle calculation, the direction angles of the stripes are calculated using their central moments and then the skew angle of the input image is determined averaging the direction angles. In the image rotation, the input image is rotated by the skew angle. Experimental results shows that the proposed method yields skew correction rates of about 93% for test images of several types of business cards acquired by a PDA under various surrounding conditions.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.8
• /
• pp.137-147
• /
• 1994

In this paper,we propose a knowledge-based system for locating Destination Address Block(DAB) by analyzing the structure of Korean envelope images. In the proposed system the preprocessing steps such as adaptive binarization connected component extraction and deskewing are carried out first for the effective structure analysis of the envelope image. Then DAB containing address name and zipcode parts of the input envelope image is extracted by an iterative procedure based on the knowledge acquired from the statistical feature analysis of the various envelope images. Most of the system for slocating address blocks on envelopes have extracted DAB by segmenting an envelope image into several candidate blocks followed by selecting one among the candidate blocks. Because it is very difficult to segment a Korean envelope image into several blocks due to the specific writing habits that the addresses on the envelope are written in close proximity to each other the proposed iterative procedure determines DAB by splitting or merging the connected components and verifies the determined DAB without segmentation and selection. Experiments with a great number of the live envelopes provided from Seoul Mail Center in Koorea were carried out. The results reveal that the proposed system is very effective for address block location on Korean envelopes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.3
• /
• pp.267-275
• /
• 2019

Currently, due to the widespread use of a smartphone, QR codes allow users to access a variety of added services. However, the QR codes posted on curved surfaces tend to be non-uniformly illuminated and bring about the decline of recognition rate. So, in this paper, the block-adaptive binarization policy is adopted to find an optimal threshold appropriate for bimodal image like QR codes. For a large block, its histogram distribution is found to get an initial threshold and then the block is partitioned to reflect the local characteristics of small blocks. Also, morphological operation is applied to their neighboring boundary at the discontinuous at the QR code junction. This paper proposes an authentication method based on the color code, uniquely painted within QR code. Through a variety of practical experiments, it is shown that the proposed algorithm outperforms the conventional method in detecting QR code and also maintains good recognition rate up to 40 degrees on curved surfaces.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.2
• /
• pp.127-132
• /
• 2019

In this paper, we propose a visual inspection method of automotive parts for injection molding to improve the appearance quality and productivity of automotive parts. Exterior inspection of existing injection molding automobile parts was generally done by manual sampling inspection by human. First, we applied the edge-tolerance vision inspection algorithm ([1] - [4]) for vision inspection of electronic components (TFT-LCD and PCB) And we propose a new visual inspection method to overcome the problem. In the proposed visual inspection, the inspection images of the parts to be inspected are aligned on the basis of the reference image of good quality. Then, after partial adaptive binarization, the binary block matching algorithm is used to compare the good binary image and the test binary image. We verified the effectiveness of the edge-tolerance vision check algorithm and the proposed appearance vision test method through various comparative experiments using actual developed equipment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.181-188
• /
• 2007

This paper proposed a watermark embedding/extracting method using CABAC(Context-based Adaptive Binary Arithmetic Coding) which is the entropy encoder for the main profile of MPEG-4 Part 10 H.264/AVC. This algorithm selects the blocks and the coefficients in a block on the bases of the contexts extracted from the relationship to the adjacent blocks and coefficients. A watermark bit is embedded without any modification of coefficient or with replacing the LSB(Least Significant Bit) of the coefficient with a watermark bit by considering both the absolute value of the selected coefficient and the watermark bit. Therefore, it makes it hard for an attacker to find out the watermarked locations. By selecting a few coefficients near the DC coefficient according to the contexts, this algorithm satisfies the robustness requirement. From the results from experiments with various kinds and various strengths of attacks the maximum error ratio of the extracted watermark was 5.02% in maximum, which makes certain that the proposed algorithm has very high level of robustness. Because it embeds the watermark during the context modeling and binarization process of CABAC, the additional amount of calculation for locating and selecting the coefficients to embed watermark is very small. Consequently, it is highly expected that it is very useful in the application area that the video must be compressed right after acquisition.