• Title/Summary/Keyword: 내용 기반 이미지 검색

Search Result 244, Processing Time 0.022 seconds

RGB Channel Selection Technique for Efficient Image Segmentation (효율적인 이미지 분할을 위한 RGB 채널 선택 기법)

  • 김현종;박영배
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.10
    • /
    • pp.1332-1344
    • /
    • 2004
  • Upon development of information super-highway and multimedia-related technoiogies in recent years, more efficient technologies to transmit, store and retrieve the multimedia data are required. Among such technologies, firstly, it is common that the semantic-based image retrieval is annotated separately in order to give certain meanings to the image data and the low-level property information that include information about color, texture, and shape Despite the fact that the semantic-based information retrieval has been made by utilizing such vocabulary dictionary as the key words that given, however it brings about a problem that has not yet freed from the limit of the existing keyword-based text information retrieval. The second problem is that it reveals a decreased retrieval performance in the content-based image retrieval system, and is difficult to separate the object from the image that has complex background, and also is difficult to extract an area due to excessive division of those regions. Further, it is difficult to separate the objects from the image that possesses multiple objects in complex scene. To solve the problems, in this paper, I established a content-based retrieval system that can be processed in 5 different steps. The most critical process of those 5 steps is that among RGB images, the one that has the largest and the smallest background are to be extracted. Particularly. I propose the method that extracts the subject as well as the background by using an Image, which has the largest background. Also, to solve the second problem, I propose the method in which multiple objects are separated using RGB channel selection techniques having optimized the excessive division of area by utilizing Watermerge's threshold value with the object separation using the method of RGB channels separation. The tests proved that the methods proposed by me were superior to the existing methods in terms of retrieval performances insomuch as to replace those methods that developed for the purpose of retrieving those complex objects that used to be difficult to retrieve up until now.

Design and Implementation of a XML Repository System using RDBMS and IRS (RDBMS와 IRS를 이용한 XML 저장관리 시스템 설계 및 구현)

  • Gang, Hyeong-Il;Choe, Yeong-Gil;Lee, Jong-Seol;Yu, Jae-Su;Jo, Gi-Hyeong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.1
    • /
    • pp.1-11
    • /
    • 2001
  • 본 논문에서는 관계형 데이타베이스인 오라클과 IRS중 하나인 BRS를 사용하여 XML 저장관리 시스템을 설계 및 구현한다. XML저장관리 시스템의 내용 검색과 인덱스 추출을 위해 BRS 검색 시스템을 사용하였으며, XML 문서, 구조정보, DTD, 이미지 등을 저장하기 위해 오라클을 사용하였다. 본 논문에서 구현한 저장관리 시스템은 질의 처리기, 검색결과생성기, XML 객체관리자, XML 인덱스 관리자, 구조검색엔진 등으로 구성된다. 구현된 XML 저장관리 시스템은 XML 문서에 대한 내용검색뿐만 아니라 구조적 특징 또는 대트리뷰트에 기반한 검색을 효율적으로 제공한다. 구현한 저장관리 시스템은 문서 저장 시간, 문서 추출 시간, 내용 검색 시긴 등에 대해서 분할 모델 저장관리 시스템과 비교한다.

  • PDF

A Distributed High Dimensional Indexing Structure for Content-based Retrieval of Large Scale Data (대용량 데이터의 내용 기반 검색을 위한 분산 고차원 색인 구조)

  • Cho, Hyun-Hwa;Lee, Mi-Young;Kim, Young-Chang;Chang, Jae-Woo;Lee, Kyu-Chul
    • Journal of KIISE:Databases
    • /
    • v.37 no.5
    • /
    • pp.228-237
    • /
    • 2010
  • Although conventional index structures provide various nearest-neighbor search algorithms for high-dimensional data, there are additional requirements to increase search performances as well as to support index scalability for large scale data. To support these requirements, we propose a distributed high-dimensional indexing structure based on cluster systems, called a Distributed Vector Approximation-tree (DVA-tree), which is a two-level structure consisting of a hybrid spill-tree and VA-files. We also describe the algorithms used for constructing the DVA-tree over multiple machines and performing distributed k-nearest neighbors (NN) searches. To evaluate the performance of the DVA-tree, we conduct an experimental study using both real and synthetic datasets. The results show that our proposed method contributes to significant performance advantages over existing index structures on difference kinds of datasets.

Clipart Image Retrieval System using Shape Information (모양 정보를 이용한 클립아트 이미지 검색 시스템)

  • Cheong, Seong-Il;Kim, Seung-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.1
    • /
    • pp.116-125
    • /
    • 2002
  • This paper presented a method of extracting shape information from a clipart image and then measured the similarity between clipart images using the extracted shape information. The results indicated that the outlines of the extracted clipart images were clearer that those of the original images. Previous methods of extracting shape information could be classified into outline-based methods and region-based methods. Included in the former category, the proposed method expressed the convex and concave aspects of an outline using the ratio of a rectangle. Accordingly, the proposed method was superior in expressing shape information than previous outline-based feature methods.

Edge Feature Extract CBIRS for Car Retrieval : CBIRS/EFI (차량 검색을 위한 측면 에지 특징 추출 내용기반 검색 : CBIRS/EFI)

  • Koo, Gun-Seo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.11
    • /
    • pp.75-82
    • /
    • 2010
  • The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

MPEG-7 based Video/Image Retrieval System (VIRS) (MPEG-7 기반 비디오/이미지 검색 시스템(VIRS))

  • Lee, Jae-Ho;Kim, Hyoung-Joon;Kim, Whoi-Yul
    • The KIPS Transactions:PartB
    • /
    • v.10B no.5
    • /
    • pp.543-552
    • /
    • 2003
  • An increasing in quantity of multimedia data brought a new problem that expected data should be retrieved fast and exactly. The adequate representation is a key element for the efficient retrieval. For this reason, MPEG-7 standard was established for description of multimedia data in 2001. However, the content of the standard is massive and the approach method is not clear for real application system yet, because of properties of MPEG-7 standard that has to include a lot of potential cases. In this paper, we suggested implementation scheme of retrieval system with using of only visual descriptors and presented the performance results of developed system. From the result of developed system, MPEG-7 VIRS (Video/Image Retrieval System), we analyzed the retrieval results between using individual descriptor and using multiple descriptors, and showed a layout for real application system.

Integrating Color, Texture and Edge Features for Content-Based Image Retrieval (내용기반 이미지 검색을 위한 색상, 텍스쳐, 에지 기능의 통합)

  • Ma Ming;Park Dong-Won
    • Science of Emotion and Sensibility
    • /
    • v.7 no.4
    • /
    • pp.57-65
    • /
    • 2004
  • In this paper, we present a hybrid approach which incorporates color, texture and shape in content-based image retrieval. Colors in each image are clustered into a small number of representative colors. The feature descriptor consists of the representative colors and their percentages in the image. A similarity measure similar to the cumulative color histogram distance measure is defined for this descriptor. The co-occurrence matrix as a statistical method is used for texture analysis. An optimal set of five statistical functions are extracted from the co-occurrence matrix of each image, in order to render the feature vector for eachimage maximally informative. The edge information captured within edge histograms is extracted after a pre-processing phase that performs color transformation, quantization, and filtering. The features where thus extracted and stored within feature vectors and were later compared with an intersection-based method. The content-based retrieval system is tested to be effective in terms of retrieval and scalability through experimental results and precision-recall analysis.

  • PDF

Wine Label Recognition System using Image Similarity (이미지 유사도를 이용한 와인라벨 인식 시스템)

  • Jung, Jeong-Mun;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Kim, Sun-Hee
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.5
    • /
    • pp.125-137
    • /
    • 2011
  • Recently the research on the system using images taken from camera phones as input is actively conducted. This paper proposed a system that shows wine pictures which are similar to the input wine label in order. For the calculation of the similarity of images, the representative color of each cell of the image, the recognized text color, background color and distribution of feature points are used as the features. In order to calculate the difference of the colors, RGB is converted into CIE-Lab and the feature points are extracted by using Harris Corner Detection Algorithm. The weights of representative color of each cell of image, text color and background color are applied. The image similarity is calculated by normalizing the difference of color similarity and distribution of feature points. After calculating the similarity between the input image and the images in the database, the images in Database are shown in the descent order of the similarity so that the effort of users to search for similar wine labels again from the searched result is reduced.

Meta Data Design for Video Data based on XML (XML 기반 비디오 데이터의 메타데이터 설계)

  • Ko, Eun-Kyung;Hwang, Bu-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05c
    • /
    • pp.1659-1662
    • /
    • 2003
  • 웹 환경에서 사용되고 있는 데이터의 종류는 텍스트뿐만 아니라 멀티미디어 데이터까지 다양하게 사용되어 지고 있다. 그러나 오디오, 이미지, 비디오와 같은 미디어 객체들은 2진화, 비구조화 되어 있으므로 기계 번역이 용이하지 않다. 이런 비정형화 된 비디오 데이터에 대한 검색을 효율적으로 처리하기 위해서는 비디오의 논리적 구조와 의미적 내용을 표현할 수 있어야 한다. 멀티미디어 데이터의 메타 데이터를 표현하기 위해서 XML 문서를 이용하여 표현하고, 표현된 문서를 효율적으로 검색 할 수 있도록 설계하였다.

  • PDF

A Study on Association-Rules for Recurrent Items Mining of Multimedia Data (멀티미디어 데이타의 재발생 항목 마이닝을 위한 연관규칙 연구)

  • 김진옥;황대준
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.3
    • /
    • pp.281-289
    • /
    • 2002
  • Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.

  • PDF