• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.12 no.1
• /
• pp.13-21
• /
• 2019

The content based on image retrieval makes use of features of information within image such as color, texture and share for Retrieval data. we present a novel approach for improving retrieval accuracy based on DCT Filter-Bank. First, we perform DCT on a given image, and generate a Filter-Bank using the DCT coefficients for each color channel. In this step, DC and the limited number of AC coefficients are used. Next, a feature vector is obtained from the histogram of the quantized DC coefficients. Then, AC coefficients in the Filter-Bank are separated into three main groups indicating horizontal, vertical, and diagonal edge directions, respectively, according to their spatial-frequency properties. Each directional group creates its histogram after employing Otsu binarization technique. Finally, we project each histogram on the horizontal and vertical axes, and generate a feature vector for each group. The computed DC and AC feature vectors bins are concatenated, and it is used in the similarity checking procedure. We experimented using 1,000 databases, and as a result, this approach outperformed the old retrieval method which used color information.

• The Journal of the Acoustical Society of Korea
• /
• v.17 no.5
• /
• pp.22-27
• /
• 1998

본 논문에서는 차량 자동 인식 시스템(AVI:Automatic Vehicle Identification)구현에 있어 목표 영역이 되는 차량 번호판과 운전자 얼굴의 특진요소를 효율적으로 추출하기 위한 방법에 대해 다루고자 한다. 이를 위해 카메라를 두 대 설치하여 한 대의 카메라로부터는 차량 번호판 영역을 추출하고 또 하나의 카메라로는 운전자의 얼굴영역을 추출한다. 목표가 되는 두 영역의 추출을 위해 환경에 불변인 경계선 추출 방법을 제안하였고, 히스토그램의 특성을 이용하여 목표영역을 추출한다. 최종적으로 차량 번호판의 경우 추출된 번호판 영역 에 다시 X, Y 라인히스토그램을 이용하여 문자영역의 분리를 행하였고, 운전자의 경우 눈, 코, 입 등에 대한 특징을 추출하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.685-687
• /
• 2004

MPEG-7은 형태나 질감, 컬러 등의 속성 및 분포 등을 나타내기 위한 여러 가지 기술자(descriptor)들을 제공함으로써 검색의 효율을 높일 수 있는 방법을 포함한 표준화를 제시하고 있다. 본 논문에서는 영상의 특징을 MPEG-7의 설러 기술자중 에지 히스토그램 기술자(Edge Histogram Descriptor)를 통해 얻는다 추출된 에지 특징을 이용하여 영상의 정해진 각 역의 전체 후보영상과의 상대적 유사도를 비교하여 검색에 반영함으로써 검색의 효율을 향상시키는 방법을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.8 no.2
• /
• pp.181-191
• /
• 2005

The classification error of 'ㅁ', 'ㅇ' is one of the main causes of incorrect recognition in Korean characters, but there haven't been enough researches to solve this problem. In this paper, a new feature extraction method from Korean grapheme is proposed to recognize 'ㅁ', 'ㅇ'effectively. First, we defined an optimal neighbor-distance selection measure using modified Hausdorff distance, which we determined the optimal neighbor-distance by. And we extracted neighbor-angle feature which was used as the effective feature to classify the two graphemes 'ㅁ', 'ㅇ'. Experimental results show that the proposed feature extraction method worked efficiently with the small number of features and could recognize the untrained patterns better than the conventional methods. It proves that the proposed method has a generality and stability for pattern recognition.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.45-50
• /
• 2009

The environment exploration is an essential process for indoor robots such as clean robot and security robot. Apartment house and office building has common frame structure, but internal arrangement of each room may be slightly different. So, it is more convenient to use a common frame map than to build a new map at every time the arrangement is changed. In this case, it is important to recognize invariant features such as wall, door and window. In this paper, an indoor mobile robot is implemented, and by using the laser scanner data and line segment histogram with respect to segment orientation and distance, an environment exploration method is presented and tested. This robot is fitted with a laser scanner, gyro sensor, ultra sonic sensor and IR sensor, and programed with C language.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.269-270
• /
• 2006

내용 기반 영상검색을 위한 효과적 특징 추출 방법에 대한 관심이 집중되고 있다. 본 논문에서는 물체의 크기에 강인한 영상검색을 위한 색상 특징정보와 상관관계를 이용한 RGB 칼라 검색 기법을 제안하였다. R, G, B 영상을 각 칼라 R, G, B 크기 순으로 배열한 후 칼라 R, G, B 간의 분산 차이를 특징 벡터로 사용하였다. 그리고 각 계산된 분산차를 3개의 구역으로 표본화여 재배열하였다. 제안된 알고리즘은 실험을 통하여 기존의 칼라 히스토그램, CCV, 칼라 코렐로그램 보다 검색 성능이 더 향상됨을 보였다.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.355-364
• /
• 2011

In most applications requiring high-confidential images, reversible watermarking is an effective way to ensure the integrity of images. Many watermarking researches which have been adapted to authenticate contents cannot recover the original image after authentication. However, reversible watermarking inserts the watermark signal into digital contents in such a way that the original contents can be restored without any quality loss while preserving visual quality. To detect malicious tampering, this paper presents a new block-based image authentication algorithm using differential histogram-based reversible watermarking. To generate an authentication code, the DCT-based authentication feature from each image block is extracted and combined with user-specific code. Then, the authentication code is embedded into image itself with reversible watermarking. The image can be authenticated by comparing the extracted code and the newly generated code and restored into the original image. Through experiments using multiple images, we prove that the presented algorithm has achieved over 97% authentication rate with high visual quality and complete reversibility.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.25 no.5
• /
• pp.483-488
• /
• 2015

This paper presents a local binary pattern(LBP) for effectively classifying textures, which is based on the multidimensional intensity difference between the adjacent pixels in the block image. The intensity difference by considering the a extent of 4 directional changes(verticality, horizontality, diagonality, inverse diagonality) in brightness between the adjacent pixels is applied to reduce the computation load as a results of decreasing the levels of histogram for classifying textures of image. And the binary patterns that is represented by the relevant intensities within a block image, is also used to effectively classify the textures by accurately reflecting the local attributes. The proposed method has been applied to classify 24 block images from USC Texture Mosaic #2 of 128*128 pixels gray image. The block images are different in size and texture. The experimental results show that the proposed method has a speedy classification and makes a free size block images classify possible. In particular, the proposed method gives better results than the conventional LBP by increasing the range of histogram level reduction as the block size becomes larger.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.3
• /
• pp.721-726
• /
• 2004

The image binarization is applied frequently as one part of the preprocessing phase for a variety of image processing techniques such as character recognition and image analysis, etc. 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. So, this paper proposed the novel algorithm for image binarization, which, first, segments the intensity range of grayscale images to several intervals and calculates mean value of intensity for each interval, and next, 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 of the proposed binarization algorithm showed that the proposed algorithm generates the more effective threshold value than the previous algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.147-154
• /
• 2006

Effective and efficient representation of color features of multiple video frames is an important vet challenging task for visual information management systems. This paper Proposes a Video Browsing Service(VBS) that provides both the video content retrieval and the video browsing by the real-time user interface on Web. For the scene segmentation and key frame extraction of video sequence, we proposes an efficient scene change detection method that combine the RGB color histogram with the X2 (Chi Square) histogram. Resulting key frames are linked by both physical and logical indexing. This system involves the video editing and retrieval function of a VCR's. Three elements that are the date, the need and the subject are used for video browsing. A Video Browsing Service is implemented with MySQL, PHP and JMF under Apache Web Server.