• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1171-1176
• /
• 2003

In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.7
• /
• pp.483-489
• /
• 2017

The purpose of this study was to propose useful suggestions for enhancing reliability to determine the resistance against surface wetting, KS K 0590, by an imaging process. We validated the standard spray test rating chart for determining quantification standard using JAVA script-based imaging process program. All of the acquired images were processed with the image software, Image J (NIH, Nethesda, MD, USA). The study results are as follows. We established the surface area measurement-based quantitative criteria for determining resistance to surface wetting. The standard spray test rating chart was converted into a numerical standard which leads easy-to-determine ratings. We also validated the procedure for imaging treatment by analyzing quantitative data. We introduced the fluorescence image for determining ratings by enabling threshold settings and binary image conversion as an optimal imaging process. It is expected that imaging-based determination for resistant to surface wetting will serve as an accurate and reliable method for KS K 0590.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.73-86
• /
• 2009

This paper proposes a new data hiding scheme for binary image authentication with minimizing the distortion of host image. Based on the Hamming-Code-Based data embedding algorithm, the proposed scheme makes it possible to embed authentication information into host image with only flipping small number of pixels. To minimize visual distortion, the proposed scheme only modifies the values of the flippable pixels that are selected based on Yang et al's flippablity criteria. In addition to this, by randomly shuffling the bit-order of the authentication information to be embedded, only the designated receiver, who has the secret key that was used for data embedding, can extract the embedded data. To show the superiority of the proposed scheme, the two measurement metrics, the miss detection rate and the number of flipped pixels by data embedding, are used for the comparison analysis between the proposed scheme and the previous schemes. As a result of analysis, it has been shown that the proposed scheme flips smaller number of pixels than the previous schemes to embed the authentication information of the same bit-length. Moreover, it has been shown that the proposed scheme causes smaller visual distortion and more resilient against recent steg-analysis attacks than the previous schemes by the experimental results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.96-104
• /
• 2011

A halftoning method is used to obtain a binary image visually similar to a continuous gray-level image through the image output devices employing the limited number of gray-levels. As a halftoning method, the error diffusion method is widely used in various applications because of its low computational complexity and good image quality. However, this method weakens the edge in the process of error diffusion to the neighboring pixels. In this case, degradation of the edge quality and damage of the vivid image is expected. To solve these problems, the proposed method determines the adaptive error filter considering the error information of the present pixel and edge distribution of the neighbor pixels. Compared with the conventional methods for enhancing edges, the proposed method involves relatively a few process resources because of its simple procedure, still considerably improving the edges in the halftone image. To evaluate the objective image quality, the performance of the proposed method is compared with that of the conventional method in terms of the edge correlation and the local average accordance.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.243-246
• /
• 2001

턱 논문에서는 복잡한 배경에서 다양한 조명과 얼굴의 크기 변화를 가지는 영상으로부터 눈을 검출하는 새로운 방법을 제안한다. 반사 대칭 조건과 타원 모델링을 이용하여 먼저 얼굴을 검출하고 그 영역 내에서 수리 형태학을 이용한 valley detection, binary opening을 수행함으로써 눈 후보 영역을 추출한다. 그리고 정확한 눈동자의 위치를 검출하기 위하여 눈동자 정합 마스크를 제안하였다 얼굴 검출 과정에서 타원의 단축 길이를 추정하여 추출된 얼굴 영상의 크기를 정규화 하였다. 정규화 된 얼굴 영상에서 눈 검출에 적합한 형태소(structuring element)를 결정하여 눈 검출 결과를 보다 견실하게 하였다.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.129-131
• /
• 2001

오류 제어 부호화(ECC : Error Control Coding) 의 기법을 이용한 이진 영상의 강인한 워터마킹에 관하여 다룬다. 워터마크를 채널 부호화법을 이용하여 부호화하고, 매입할 대상 영상을 DCT변환을 하여 주파수 영역으로 표현한 후, 부호화된 워터마크를 저전력 영역과 고전력 영역에 매입한다. 이러한 과정을 거친 워터마크된 영상은 외부의 다양한 공격에 대해 강인함을 실험을 통하여 보인다.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.689-692
• /
• 2000

본 논문에서는 이동 통신에서 사용될 저 복잡도를 갖는 이진 영상 압축 알고리즘을 제안한다. 기존의 이진영상의 부호화에 사용되는 알고리즘에는 JBIG, G.4등과 같은 방식이 있으나, JBIG의 경우 산술 부호화로 인한 높은 복잡도를 필요로 하고, G.4의 경우 일반 A4 문서를 대상으로 하고 있어 이러한 알고리즘을 이동 통신에서 사용하기에는 부적합하다. 따라서 본 논문에서는 단순한 이진 영상에 대해서 낮은 복잡도를 가지며 기존의 부호화 방식들 보다 좋은 성능을 얻을 수 있는 효과적인 압축 방법을 제시한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1987.04a
• /
• pp.31-34
• /
• 1987

A new efficientcoding system which can transmit video conferenceof viedeophone signals at a 64kbps is proposed. In addition to the interframe and CRC (Conditional Repleni shment Coding) system, BTVQ (Binary Tree searched Vector Quantizer)and RLC (Run Length Coding) methods are incorporated. Couble buffer memory is used for simple comtrol of channel symbol transmission and memory underflow And also buffer memory onerfolw is easily controlled by the thresholds of a MAD (Moving Area Betector)

• Proceedings of the KAIS Fall Conference
• /
• 2007.05a
• /
• pp.216-219
• /
• 2007

본 논문에서는 영상 인식을 위해 그레이 레벨로 획득된 영상을 이진화할 때 발생되어 패턴의 윤곽선을 울퉁불퉁하게 만드는 랜덤 노이즈를 제거하기 위한 방법으로 체인 코드 트리밍(chain code trimming) 을 제안한다. 제안된 방법은 패턴의 외부 윤곽선과 내부 윤곽선의 체인 코드 분석을 통해 랜텀 노이즈의 체인 코드를 제거, 교정함으로서 이루어진다. 실험에서는 트리밍을 사용하기전과, 단순 트리밍을 한 경우, 체인 코드 트리밍을 한 경우를 서로 바로, 분석한다. 실험 결과는 패턴에 첨부되었던 랜덤 노이즈가 모두 성공리에 제거된 것을 보인다.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.529-532
• /
• 2003

In this paper, we describe new method to detect face in real-time. We use color information, edge information, and binary information to detect candidate regions of eyes from input image, and then extract face region using the detected eye pall. We verify both eye candidate regions and face region using Support Vector Machines(SVM). It is possible to perform fast and reliable face detection because we can protect false detection through these verification processes. From the experimental results, we confirmed the proposed algorithm shows very excellent face detection performance.