• Title/Summary/Keyword: content- based retrieval

Search Result 717, Processing Time 0.03 seconds

Content-based Image Retrieval Using Data Fusion Strategy (데이터 융합을 이용한 내용기반 이미지 검색에 관한 연구)

  • Paik, Woo-Jin;Jung, Sun-Eun;Kim, Gi-Young;Ahn, Eui-Gun;Shin, Moon-Sun
    • Journal of the Korean Society for information Management
    • /
    • v.25 no.2
    • /
    • pp.49-68
    • /
    • 2008
  • In many information retrieval experiments, the data fusion techniques have been used to achieve higher effectiveness in comparison to the single evidence-based retrieval. However, there had not been many image retrieval studies using the data fusion techniques especially in combining retrieval results based on multiple retrieval methods. In this paper, we describe how the image retrieval effectiveness can be improved by combining two sets of the retrieval results using the Sobel operator-based edge detection and the Self Organizing Map(SOM) algorithms. We used the clip art images from a commercial collection to develop a test data set. The main advantage of using this type of the data set was the clear cut relevance judgment, which did not require any human intervention.

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

A Content-based Audio Retrieval System Supporting Efficient Expansion of Audio Database (음원 데이터베이스의 효율적 확장을 지원하는 내용 기반 음원 검색 시스템)

  • Park, Ji Hun;Kang, Hyunchul
    • Journal of Digital Contents Society
    • /
    • v.18 no.5
    • /
    • pp.811-820
    • /
    • 2017
  • For content-based audio retrieval which is one of main functions in audio service, the techniques for extracting fingerprints from the audio source, storing and indexing them in a database are widely used. However, if the fingerprints of new audio sources are continually inserted into the database, there is a problem that space efficiency as well as audio retrieval performance are gradually deteriorated. Therefore, there is a need for techniques to support efficient expansion of audio database without periodic reorganization of the database that would increase the system operation cost. In this paper, we design a content-based audio retrieval system that solves this problem by using MapReduce and NoSQL database in a cluster computing environment based on the Shazam's fingerprinting algorithm, and evaluate its performance through a detailed set of experiments using real world audio data.

An Extended Concept-based Image Retrieval System : E-COIRS (확장된 개념 기반 이미지 검색 시스템)

  • Kim, Yong-Il;Yang, Jae-Dong;Yang, Hyoung-Jeong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.3
    • /
    • pp.303-317
    • /
    • 2002
  • In this paper, we design and implement E-COIRS enabling users to query with concepts and image features used for further refining the concepts. For example, E-COIRS supports the query "retrieve images containing black home appliance to north of reception set. "The query includes two types of concepts: IS-A and composite. "home appliance"is an IS-A concept, and "reception set" is a composite concept. For evaluating such a query. E-COIRS includes three important components: a visual image indexer, thesauri and a query processor. Each pair of objects in an mage captured by the visual image indexer is converted into a triple. The triple consists of the two object identifiers (oids) and their spatial relationship. All the features of an object is referenced by its old. A composite concept is detected by the triple thesaurus and IS-A concept is recolonized by the fuzzy term thesaurus. The query processor obtains an image set by matching each triple in a user with an inverted file and CS-Tree. To support efficient storage use and fast retrieval on high-dimensional feature vectors, E-COIRS uses Cell-based Signature tree(CS-Tree). E-COIRS is a more advanced content-based image retrieval system than other systems which support only concepts or image features.

Implementation of Annotation-Based and Content-Based Image Retrieval System using (영상의 에지 특징정보를 이용한 주석기반 및 내용기반 영상 검색 시스템의 구현)

  • Lee, Tae-Dong;Kim, Min-Koo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.5
    • /
    • pp.510-521
    • /
    • 2001
  • Image retrieval system should be construct for searching fast, efficient image be extract the accurate feature information of image with more massive and more complex characteristics. Image retrieval system are essential differences between image databases and traditional databases. These differences lead to interesting new issues in searching of image, data modeling. So, cause us to consider new generation method of database, efficient retrieval method of image. In this paper, To extract feature information of edge using in searching from input image, we was performed to extract the edge by convolution Laplacian mask and input image, and we implemented the annotation-based and content-based image retrieval system for searching fast, efficient image by generation image database from extracting feature information of edge and metadata. We can improve the performance of the image contents retrieval, because the annotation-based and content-based image retrieval system is using image index which is made up of the content-based edge feature extract information represented in the low level of image and annotation-based edge feature information represented in the high level of image. As a conclusion, image retrieval system proposed in this paper is possible the accurate management of the accumulated information for the image contents and the information sharing and reuse of image because the proposed method do construct the image database by metadata.

  • PDF

A Semantic-based Video Retrieval System using Method of Automatic Annotation Update and Multi-Partition Color Histogram (자동 주석 갱신 및 멀티 분할 색상 히스토그램 기법을 이용한 의미기반 비디오 검색 시스템)

  • 이광형;전문석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8C
    • /
    • pp.1133-1141
    • /
    • 2004
  • In order to process video data effectively, it is required that the content information of video data is loaded in database and semantic-based retrieval method can be available for various query of users. In this paper, we propose semantic-based video retrieval system which support semantic retrieval of various users by feature-based retrieval and annotation-based retrieval of massive video data. By user's fundamental query and selection of image for key frame that extracted from query, the agent gives the detail shape for annotation of extracted key frame. Also, key frame selected by user become query image and searches the most similar key frame through feature based retrieval method that propose. From experiment, the designed and implemented system showed high precision ratio in performance assessment more than 90 percents.

Performance Analysis of the Time-series Pattern Index File for Content-based Music Genre Retrieval (내용기반 음악장르 검색에서 시계열 패턴 인덱스 화일의 성능 분석)

  • Kim, Young-In;Kim, Seon-Jong
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.5
    • /
    • pp.18-27
    • /
    • 2006
  • Rapid increase of the amount of music data demands for a new method that allows efficient similarity retrieval of music genre using audio features in music databases. To build this similarity retrieval, an indexing techniques that support audio features as a time-series pattern and data mining technologies are needed. In this paper, we address the development of a system that retrieves similar genre music based on the indexing techniques. We first propose the structure of content-based music genre retrieval system based on the time-series pattern index file and data mining technologies. In addition, we implement the time-series pattern index file using audio features and present performance analysis of the time-series pattern index file for similar genre retrieval. The experiments are performed on real data to verify the performance of the proposed method.

  • PDF

An Approach for the Cross Modality Content-Based Image Retrieval between Different Image Modalities

  • Jeong, Inseong;Kim, Gihong
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.31 no.6_2
    • /
    • pp.585-592
    • /
    • 2013
  • CBIR is an effective tool to search and extract image contents in a large remote sensing image database queried by an operator or end user. However, as imaging principles are different by sensors, their visual representation thus varies among image modality type. Considering images of various modalities archived in the database, image modality difference has to be tackled for the successful CBIR implementation. However, this topic has been seldom dealt with and thus still poses a practical challenge. This study suggests a cross modality CBIR (termed as the CM-CBIR) method that transforms given query feature vector by a supervised procedure in order to link between modalities. This procedure leverages the skill of analyst in training steps after which the transformed query vector is created for the use of searching in target images with different modalities. Current initial results show the potential of the proposed CM-CBIR method by delivering the image content of interest from different modality images. Despite its retrieval capability is outperformed by that of same modality CBIR (abbreviated as the SM-CBIR), the lack of retrieval performance can be compensated by employing the user's relevancy feedback, a conventional technique for retrieval enhancement.

Analysis of Pre-Processing Methods for Music Information Retrieval in Noisy Environments using Mobile Devices

  • Kim, Dae-Jin;Koo, Ddeo-Ol-Ra
    • International Journal of Contents
    • /
    • v.8 no.2
    • /
    • pp.1-6
    • /
    • 2012
  • Recently, content-based music information retrieval (MIR) systems for mobile devices have attracted great interest. However, music retrieval systems are greatly affected by background noise when music is recorded in noisy environments. Therefore, we evaluated various pre-processing methods using the Philips method to determine the one that performs most robust music retrieval in such environments. We found that dynamic noise reduction (DNR) is the best pre-processing method for a music retrieval system in noisy environments.

Content based image retrieval using maximum color

  • Park, Jong-An
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.6 no.4
    • /
    • pp.232-237
    • /
    • 2013
  • This paper presents image database retrieval based on maximum color occurrenceusing Hue, Saturation and Value (HSV) color space. Our system is based on color segmentation. We dividedthe image into n number of areas based on different selected ranges of hue and value, then each area is partitioned into m number of segments based on the number of pixels it contains, after this we calculated the maximumcolor occurrence in each segment and used its HSV value. This is used as a feature vector.