• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.112-122
• /
• 1994

Number plates of vehicles operating in real world are sometimes difficult to recognize due to the number plate degradation (bent or dirty plates). To recognize the vehicle number from a number plate with severe degradation, good segmentation is necessary, which in turn requires good thresholding. This paper proposes a binarization method that combines the fast processing speed of global thresholding methods with the local thresholding methods' ability to adapt to lacal gray level characteristics. The proposed method overcomes the degradation of number plates quickly and maintains the widths of digit strokes uniform. The paper presents results of comparison with existing global and local thresholding methods.

• Journal of the Optical Society of Korea
• /
• v.14 no.4
• /
• pp.368-375
• /
• 2010

Unlike document images, license plate images are mostly captured under uneven lighting conditions. In particular, a shadowed region has sharp intensity variation and sometimes that region has very high intensity by reflected light. This paper presents a new technique for thresholding license plate images. This approach consists of three parts. In the first part, it performs a rough thresholding and classifies the type of license plate to adjust some parameters optimally. Next, it identifies a shadow type and binarizes license plate images by adjusting the window size and location according to the shadow type. And finally, post-processing based on the cluster analysis is performed. Experimental results show that the proposed method outperformed five well-known methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.4
• /
• pp.406-414
• /
• 1997

A real-time inspection system is developed using line scan cameras. Several improved algorithms are proposed for real-time detection of defects in this automated inspection system. The major improved algorithms include the preprocessing, the threshold decision, and the clustering algorithms. The preprocessing algorithms are for exact binarization and the threshold decision algorithm is for fast detection of defects in 1-D binary images. The clustering algorithm is also developed for fast classifying of the defects. The system is applied to PCBs(Printed Circuit Boards) inspection. The typical defects in PCBs are pits, dent, wrinkle, scratch, and black spots. The results show that most defects are detected and classified successfully.

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

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.1
• /
• pp.105-113
• /
• 1998

A new image processor is implemented for high-speed digital copiers and facsimiles. The imgage processor performs CCD and CIS interface, pre-processing, enlargement andreduction of gray level image, and various halftoning algorithms. Implemented halftoning algorithms are simple thresholding, fuzzy based mixed mode thresholding, dithering, and edge enhanced error diffusion. The result of binarization is transferred to a printer with serial or paralel output ports. Line by line pipelined data prodessing architecture is employed with time sharing access of the external memory. In receiving mode, it converts the resolution of received binary image for compatibility with conventional facsimile. In copy mode, a line of A3 paper with 400 dpi is processed with in 2.5 ms. The prototype of image processor was implemented usig Laser Programmable Gate Array (LPGA) with 0.8.mu.m technology.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.510-513
• /
• 2002

대부분의 이진화 알고리즘은 임계치를 결정하기 위하여 히스토그램을 사용하여 밝기분포를 분석한다. 배경과 물체의 명도차이가 큰 경우에는 분할을 위해 양봉(bimodal) 히스토그램으로 표현하여 최적의 임계치를 찾기 위해 히스토그램 골짜기(valley)를 선택하는 것만으로도 양호한 임계치 결과를 얻을수 있으나, 배경과 물체의 밝기 차이가 크지 않거나 밝기 분포가 양봉 특성을 보이지 않을 때는 히스토그램 분석만으로 적절한 임계치를 얻기 어렵다. 그리고 한 영상에서는 넓은 영역에 걸쳐 명암도 변화가 일어나고 다양한 유형의 물체가 포함되어 있으므로 스케치 특징점 유무를 판별하는 임계치의 결정에는 애매 모호함이 존재한다. 따라서 본 논문에서는 영상에 대해 삼각형 타입의 소속함수를 적용하여 임계치를 동적으로 설정하고 영상을 이진화하는 방법을 제안한다. 제안된 퍼지 이진화 방법은 평균 밝기 값을 기준으로 가장 어두운 픽셀 값과 가장 밝은 픽셀값의 거리를 계산하여 밝기의 조정률을 구하여 최소 밝기값과 최대 밝기 값을 설정하고 삼각형의 소속 함수에 적용한다. 소속 함수에 적용된 소속도를 a-cut 을 적용하여 영상을 이진화한다. 다양한 영상에 적용한 결과, 기존의 이진화 방법보다 제안된 퍼지 이진화 방법이 효율적인 것을 알 수 있었다.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1014-1023
• /
• 2017

In this paper, we propose a method for estimating the human height by using downward depth images. We detect a point with the lowest depth value in an object as top of the head and estimate the height by calculating the depth difference with the floor. Since the depth of the floor varies depending on the angle of the camera, the correction formula is applied. In addition, the binarization threshold is variably applied so that height can be estimated even when several people are adjacent. Simulation results show that the proposed method has better performance than the conventional methods. The proposed method is expected to be widely used in body measurement, intelligent surveillance, and marketing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.345-359
• /
• 2017

Optical Character Recognition (OCR) that has been a main research topic of computer vision and artificial intelligence now extend its applications to detection of text area from video or image contents taken by camera devices and retrieval of text information from the area. This paper aims to implement a binarization algorithm that removes user intervention and provides robust performance to outdoor lights by using TopHat algorithm and channel transformation technique. In this study, we particularly concentrate on text information of outdoor signboards and validate our proposed technique using those data.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2004.11a
• /
• pp.159-162
• /
• 2004

본 논문은 디지털 방송 환경에서 TV-AnyTime을 이용한 메타데이터 서비스를 위한 메타데이터 부/복호화 시스템 구현에 관한 논문이다. 부호화 시스템은 생성된 TV-AnyTime 메타데이터의 효율적인 전송을 위해 메타데이터를 TV-AnyTime에 정의된 fragment로 분할하고, 분할된 fragment를 부호화하는 과정을 포항하고 있다. 또한 fragment의 id와 version을 부여하여 container를 구성하는 것과, 전송된 container의 내용에서 요청된 fragment을 축출하여 처리하는 것을 정의한다. 복호화 시스템은 축출된 fragment들을 분석하고, 사용자의 요청에 따라 해당 fragment를 복호화 한다. 그리고 fragment에 포함된 정보를 이용해 fragment를 관리하는 방법에 대해 정의한다.