• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3001-3003
• /
• 1999

Color 이미지 데이터 베이스로부터 원하는 이미지를 찾아내는 방법으로 image indexing에 대한 많은 연구가 이루어지고 있다. 본 논문에서는 image indexing의 한 방법인 color indexing을 이용하여 이동 로봇의 위치 추정 문제를 해결하고자 한다. Color indexing은 영상의 color 분포를 분석하여 원하는 이미지를 찾아내는 기법으로 로봇은 사전에 저장되어 있는 주변 환경에 대한 모델 이미지들로부터 현재 입력되는 영상과 가장 가까운 이미지를 찾아낸다. 또한 로봇은 찾아진 영상을 이용하여 사전에 저장되어 있는 지도상에서의 자신의 위치를 추정할 수 있다. 본 논문에서는 일반적으로 로봇이 작업하는 환경의 조명 상황이 일정하지 않음을 고려하여 다양한 조명 상태에 대하여 여러 가지 color indexing 알고리즘을 적용하여 실험하였으며 matching된 이미지를 이용하여 지도상에서의 로봇의 위치를 추정하는 구체적인 방법을 제시하고 실험을 통하여 타당성을 검증하였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.810-813
• /
• 2004

Indexing and Retrieving images from large and varied collections using image content as a key is a challenging and important problem in computer vision application. In this paper, a color Content-based Image Retrieval (CBIR) system using hierarchical Region of Interest (ROI) query and indexing is presented. During indexing process, First, The ROIs on every image in the image database are extracted using a region-based image segmentation technique, The JSEG approach is selected to handle this problem in order to create color-texture regions. Then, Color features in form of histogram and correlogram are then extracted from each segmented regions. Finally, The features are stored in the database as the key to retrieve the relevant images. As in the retrieval system, users are allowed to select ROI directly over the sample or user's submission image and the query process then focuses on the content of the selected ROI in order to find those images containing similar regions from the database. The hierarchical region-of-interest query is performed to retrieve the similar images. Two-level search is exploited in this paper. In the first level, the most important regions, usually the large regions at the center of user's query, are used to retrieve images having similar regions using static search. This ensures that we can retrieve all the images having the most important regions. In the second level, all the remaining regions in user's query are used to search from all the retrieved images obtained from the first level. The experimental results using the indexing technique show good retrieval performance over a variety of image collections, also great reduction in the amount of searching time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.149-159
• /
• 2008

We present new methods which transfer the color style of a source image into an arbitrary given reference image. Misidentification problem of color cause wrong indexing in low saturation. Therefore, the proposed method do indexing after Image separating chromatic and achromatic color from saturation. The proposed method is composed of the following four steps : In the first step, Image separate chromatic and achromatic color from saturation using threshold. In the second step, image of separation do indexing using cylindrical metric. In the third step, the number and positional dispersion of pixel decide the order of priority for each index color. And average and standard deviation of each index color be calculated. In the final step, color be transferred in Lab color space, and post processing to removal noise and pseudo-contour. Experimental results show that the proposed method is effective on indexing and color transfer.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.1-10
• /
• 2007

This paper proposes a new indexing mechanism for MPEG-7 visual descriptors, especially Dominant Color and Contour Shape descriptors, that guarantees an efficient similarity search for the multimedia database whose visual meta-data are represented with MPEG-7. Since the similarity metric used in the Dominant Color descriptor is based on Gaussian mixture model, the descriptor itself could be transform into a color histogram in which the distribution of the color values follows the Gauss distribution. Then, the transformed Dominant Color descriptor (i.e., the color histogram) is indexed in the proposed indexing mechanism. For the indexing of Contour Shape descriptor, we have used a two-pass algorithm. That is, in the first pass, since the similarity of two shapes could be roughly measured with the global parameters such as eccentricity and circularity used in Contour shape descriptor, the dissimilar image objects could be excluded with these global parameters first. Then, the similarities between the query and remaining image objects are measured with the peak parameters of Contour Shape descriptor. This two-pass approach helps to reduce the computational resources to measure the similarity of image objects using Contour Shape descriptor. This paper also proposes two integration schemes of visual descriptors for an efficient retrieval of multimedia database. The one is to use the weight of descriptor as a yardstick to determine the number of selected similar image objects with respect to that descriptor, and the other is to use the weight as the degree of importance of the descriptor in the global similarity measurement. Experimental results show that the proposed indexing and integration schemes produce a remarkable speed-up comparing to the exact similarity search, although there are some losses in the accuracy because of the approximated computation in indexing. The proposed schemes could be used to build a multimedia database represented in MPEG-7 that guarantees an efficient retrieval.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.225-228
• /
• 2001

We propose a method which has effective scalable indexing characteristics of large color image archives. Color key and energy key method which uses provides high performance of fast accessing and has almost constant query response time over DH size.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.6
• /
• pp.307-315
• /
• 2000

For the autonomy of a mobile robot it is first needed to know its position and orientation. Various methods of estimating the position of a robot have been developed. However, it is still difficult to localize the robot without any initial position or orientation. In this paper we present the method how to make the colored map and how to calculate the position and direction of a robot using the angle data of an omnidirectional image. The wall of the map is rendered with the corresponding color images and the color histograms of images and the coordinates of feature points are stored in the map. Then a mobile robot gets the color omnidirectional image at arbitrary position and orientation, segments it and recognizes objects by multiple color indexing. Using the information of recognized objects robot can have enough feature points and localize itself.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.1
• /
• pp.11-16
• /
• 2006

To manipulate large video databases, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-w]so user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm to extract key frames using color histograms and to match the video sequences using edge features. To effectively match video sequences with low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with several real sequences show that the proposed video retrieval algorithm using color and edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.5
• /
• pp.35-44
• /
• 2004

With increase in digitalmedia data, various video indexing and video sequence matching algorithms have been proposed to efficiently manage and utilize digital media. In this paper, we propose a robust video indexing algorithm to detect scene changes for video sequences with abrupt luminance variations and an efficient video sequence matching algorithm for video sequence query. To improve the accuracy and to reduce the computational complexity for video indexing with abrupt luminance variations, the proposed algorithm utilizes edge features as well as color features, which yields a remarkably better performance than conventional algorithms. In the proposed algorithm first we extract the candidate shot boundaries using color histograms and then determine using edge matching and luminance compensation if they are shot boundaries or luminance changes. If the scene contains trivial brighness variations, the edge matching and luminance compensation are performed only for shot boundaries. In experimental results, the proposed method gives remarkably a high performance and efficiency than the conventional methods with the similar computational complexity.

• The KIPS Transactions:PartB
• /
• v.10B no.6
• /
• pp.681-686
• /
• 2003

In recent years automatic image indexing and retrieval have been increasingly studied. However, content-based retrieval techniques for general images are still inadequate for many purposes. The novelty and originality of this thesis are the definition and use of a spatial information model as a contribution to the accuracy and efficiency of image search. In addition, the model is applied to represent color and shape image contents as a vector using the method of image features extraction, which was inspired by the previous work on the study of human visual perception. The indexing scheme using the color, shape and spatial model shows the potential of being applied with the well-developed algorithms of features extraction and image search, like ranking operations. To conclude, user can retrieved more similar images with high precision and fast speed using the proposed system.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.3D
• /
• pp.519-525
• /
• 2006

The traditional area-based matching or efficient matching methods using epipolar geometry and height restriction of stereo images, which have a confined search space for image matching, have still some disadvantages such as mismatching and timeconsuming, especially in the dense metropolitan city that very high and similar buildings exist. To solve these problems, a new image matching method through building recognition has been presented. This paper described building recognition in color stereo images using edge and color information as a elementary study of new matching scheme. We introduce the modified Hausdorff distance for using edge information, and the modified color indexing with 3-D RGB histogram for using color information. Color information or edge information alone is not enough to find conjugate building pairs. For edge information only, building recognition rate shows 46.5%, for color information only, 7.1%. However, building recognition rate distinctly increase 78.5% when both information are combined.