scispace - formally typeset
Search or ask a question

Showing papers on "Content-based image retrieval published in 2008"


Journal ArticleDOI
TL;DR: Almost 300 key theoretical and empirical contributions in the current decade related to image retrieval and automatic image annotation are surveyed, and the spawning of related subfields are discussed, to discuss the adaptation of existing image retrieval techniques to build systems that can be useful in the real world.
Abstract: We have witnessed great interest and a wealth of promise in content-based image retrieval as an emerging technology. While the last decade laid foundation to such promise, it also paved the way for a large number of new techniques and systems, got many new people involved, and triggered stronger association of weakly related fields. In this article, we survey almost 300 key theoretical and empirical contributions in the current decade related to image retrieval and automatic image annotation, and in the process discuss the spawning of related subfields. We also discuss significant challenges involved in the adaptation of existing image retrieval techniques to build systems that can be useful in the real world. In retrospect of what has been achieved so far, we also conjecture what the future may hold for image retrieval research.

3,433 citations


Proceedings ArticleDOI
30 Oct 2008
TL;DR: This paper presents a collection for the MIR community comprising 25000 images from the Flickr website which are redistributable for research purposes and represent a real community of users both in the image content and image tags.
Abstract: In most well known image retrieval test sets, the imagery typically cannot be freely distributed or is not representative of a large community of users. In this paper we present a collection for the MIR community comprising 25000 images from the Flickr website which are redistributable for research purposes and represent a real community of users both in the image content and image tags. We have extracted the tags and EXIF image metadata, and also make all of these publicly available. In addition we discuss several challenges for benchmarking retrieval and classification methods.

1,451 citations


Book ChapterDOI
01 Nov 2008
TL;DR: Content-based image retrieval (CBIR), emerged as a promising mean for retrieving images and browsing large images databases and is the process of retrieving images from a collection based on automatically extracted features.
Abstract: "A picture is worth one thousand words". This proverb comes from Confucius a Chinese philosopher before about 2500 years ago. Now, the essence of these words is universally understood. A picture can be magical in its ability to quickly communicate a complex story or a set of ideas that can be recalled by the viewer later in time. Visual information plays an important role in our society, it will play an increasingly pervasive role in our lives, and there will be a growing need to have these sources processed further. The pictures or images are used in many application areas like architectural and engineering design, fashion, journalism, advertising, entertainment, etc. Thus it provides the necessary opportunity for us to use the abundance of images. However, the knowledge will be useless if one can't _nd it. In the face of the substantive and increasing apace images, how to search and to retrieve the images that we interested with facility is a fatal problem: it brings a necessity for image retrieval systems. As we know, visual features of the images provide a description of their content. Content-based image retrieval (CBIR), emerged as a promising mean for retrieving images and browsing large images databases. CBIR has been a topic of intensive research in recent years. It is the process of retrieving images from a collection based on automatically extracted features.

727 citations


Journal ArticleDOI
TL;DR: This work cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and proposes VisualRank to analyze the visual link structures among images and describes the techniques required to make this system practical for large-scale deployment in commercial search engines.
Abstract: Because of the relative ease in understanding and processing text, commercial image-search systems often rely on techniques that are largely indistinguishable from text search. Recently, academic studies have demonstrated the effectiveness of employing image-based features to provide either alternative or additional signals to use in this process. However, it remains uncertain whether such techniques will generalize to a large number of popular Web queries and whether the potential improvement to search quality warrants the additional computational cost. In this work, we cast the image-ranking problem into the task of identifying "authority" nodes on an inferred visual similarity graph and propose VisualRank to analyze the visual link structures among images. The images found to be "authorities" are chosen as those that answer the image-queries well. To understand the performance of such an approach in a real system, we conducted a series of large-scale experiments based on the task of retrieving images for 2,000 of the most popular products queries. Our experimental results show significant improvement, in terms of user satisfaction and relevancy, in comparison to the most recent Google image search results. Maintaining modest computational cost is vital to ensuring that this procedure can be used in practice; we describe the techniques required to make this system practical for large-scale deployment in commercial search engines.

503 citations


Proceedings ArticleDOI
26 Oct 2008
TL;DR: LIRe (Lucene Image Retrieval) is a light weight open source Java library for content based image retrieval which provides common and state of the art global image features and offers means for indexing and retrieval.
Abstract: LIRe (Lucene Image Retrieval) is a light weight open source Java library for content based image retrieval. It provides common and state of the art global image features and offers means for indexing and retrieval. Due to the fact that it is based on a light weight embedded text search engine, it can be integrated easily in applications without relying on a database server.

339 citations


Journal ArticleDOI
TL;DR: Experimental results show that the proposed method yields higher retrieval accuracy than some conventional methods even though its feature vector dimension is not higher than those of the latter for six test DBs.
Abstract: In this paper, we propose a content-based image retrieval method based on an efficient combination of multiresolution color and texture features. As its color features, color autocorrelo- grams of the hue and saturation component images in HSV color space are used. As its texture features, BDIP and BVLC moments of the value component image are adopted. The color and texture features are extracted in multiresolution wavelet domain and combined. The dimension of the combined feature vector is determined at a point where the retrieval accuracy becomes saturated. Experimental results show that the proposed method yields higher retrieval accuracy than some conventional methods even though its feature vector dimension is not higher than those of the latter for six test DBs. Especially, it demonstrates more excellent retrieval accuracy for queries and target images of various resolutions. In addition, the proposed method almost always shows performance gain in precision versus recall and in ANMRR over the other methods.

255 citations


Proceedings ArticleDOI
23 Jun 2008
TL;DR: A novel semi-supervised distance metric learning technique, called ldquoLaplacian Regularized Metric Learningrdquo (LRML), for learning robust distance metrics for CIR, which shows that reliable metrics can be learned from real log data even they may be noisy and limited at the beginning stage of a CIR system.
Abstract: Typical content-based image retrieval (CBIR) solutions with regular Euclidean metric usually cannot achieve satisfactory performance due to the semantic gap challenge. Hence, relevance feedback has been adopted as a promising approach to improve the search performance. In this paper, we propose a novel idea of learning with historical relevance feedback log data, and adopt a new paradigm called ldquoCollaborative Image Retrievalrdquo (CIR). To effectively explore the log data, we propose a novel semi-supervised distance metric learning technique, called ldquoLaplacian Regularized Metric Learningrdquo (LRML), for learning robust distance metrics for CIR. Different from previous methods, the proposed LRML method integrates both log data and unlabeled data information through an effective graph regularization framework. We show that reliable metrics can be learned from real log data even they may be noisy and limited at the beginning stage of a CIR system. We conducted extensive evaluation to compare the proposed method with a large number of competing methods, including 2 standard metrics, 3 unsupervised metrics, and 4 supervised metrics with side information.

242 citations


Journal ArticleDOI
TL;DR: A localized CBIR system is presented that uses labeled images in conjunction with a multiple-instance learning algorithm to first identify the desired object and weight the features accordingly, and then to rank images in the database using a similarity measure that is based upon only the relevant portions of the image.
Abstract: We define localized content-based image retrieval as a CBIR task where the user is only interested in a portion of the image, and the rest of the image is irrelevant. In this paper we present a localized CBIR system, ACCIO, that uses labeled images in conjunction with a multiple-instance learning algorithm to first identify the desired object and weight the features accordingly, and then to rank images in the database using a similarity measure that is based upon only the relevant portions of the image. A challenge for localized CBIR is how to represent the image to capture the content. We present and compare two novel image representations, which extend traditional segmentation-based and salient point-based techniques respectively, to capture content in a localized CBIR setting.

199 citations


Journal ArticleDOI
TL;DR: This work proposes a novel semisupervised method for dimensionality reduction called Maximum Margin Projection (MMP), which aims at maximizing the margin between positive and negative examples at each local neighborhood.
Abstract: One of the fundamental problems in Content-Based Image Retrieval (CBIR) has been the gap between low-level visual features and high-level semantic concepts. To narrow down this gap, relevance feedback is introduced into image retrieval. With the user-provided information, a classifier can be learned to distinguish between positive and negative examples. However, in real-world applications, the number of user feedbacks is usually too small compared to the dimensionality of the image space. In order to cope with the high dimensionality, we propose a novel semisupervised method for dimensionality reduction called Maximum Margin Projection (MMP). MMP aims at maximizing the margin between positive and negative examples at each local neighborhood. Different from traditional dimensionality reduction algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA), which effectively see only the global euclidean structure, MMP is designed for discovering the local manifold structure. Therefore, MMP is likely to be more suitable for image retrieval, where nearest neighbor search is usually involved. After projecting the images into a lower dimensional subspace, the relevant images get closer to the query image; thus, the retrieval performance can be enhanced. The experimental results on Corel image database demonstrate the effectiveness of our proposed algorithm.

194 citations


Proceedings ArticleDOI
23 Jun 2008
TL;DR: This paper proposes a novel scheme that exploits both semi-supervised kernel learning and batch mode active learning for relevance feedback in CBIR and shows that the proposed scheme is significantly more effective than other state-of-the-art approaches.
Abstract: Active learning has been shown as a key technique for improving content-based image retrieval (CBIR) performance. Among various methods, support vector machine (SVM) active learning is popular for its application to relevance feedback in CBIR. However, the regular SVM active learning has two main drawbacks when used for relevance feedback. First, SVM often suffers from learning with a small number of labeled examples, which is the case in relevance feedback. Second, SVM active learning usually does not take into account the redundancy among examples, and therefore could select multiple examples in relevance feedback that are similar (or even identical) to each other. In this paper, we propose a novel scheme that exploits both semi-supervised kernel learning and batch mode active learning for relevance feedback in CBIR. In particular, a kernel function is first learned from a mixture of labeled and unlabeled examples. The kernel will then be used to effectively identify the informative and diverse examples for active learning via a min-max framework. An empirical study with relevance feedback of CBIR showed that the proposed scheme is significantly more effective than other state-of-the-art approaches.

183 citations


Journal ArticleDOI
TL;DR: This paper presents an optimal visualization scheme, supporting users in interacting with large image collections, and shows that the proposed scheme significantly improves performance for a given task compared to the 2D grid-based visualizations commonly used in content-based image retrieval.
Abstract: Image collections are getting larger and larger. To access those collections, systems for managing, searching, and browsing are necessary. Visualization plays an essential role in such systems. Existing visualization systems do not analyze all the problems occurring when dealing with large visual collections. In this paper, we make these problems explicit. From there, we establish three general requirements: overview, visibility, and structure preservation. Solutions for each requirement are proposed, as well as functions balancing the different requirements. We present an optimal visualization scheme, supporting users in interacting with large image collections. Experimental results with a collection of 10,000 Corel images, using simulated user actions, show that the proposed scheme significantly improves performance for a given task compared to the 2D grid-based visualizations commonly used in content-based image retrieval.

Proceedings ArticleDOI
20 Jul 2008
TL;DR: The problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based image retrieval, is studied and a ranking-based distance metric learning method is proposed.
Abstract: We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based image retrieval Piloted by the rich textual information of Web images, the proposed framework tries to learn a new distance measure in the visual space, which can be used to retrieve more semantically relevant images for any unseen query image The framework differentiates with traditional distance metric learning methods in the following ways 1) A ranking-based distance metric learning method is proposed for image retrieval problem, by optimizing the leave-one-out retrieval performance on the training data 2) To be scalable, millions of images together with rich textual information have been crawled from the Web to learn the similarity measure, and the learning framework particularly considers the indexing problem to ensure the retrieval efficiency 3) To alleviate the noises in the unbalanced labels of images and fully utilize the textual information, a Latent Dirichlet Allocation based topic-level text model is introduced to define pairwise semantic similarity between any two images The learnt distance measure can be directly applied to applications such as content-based image retrieval and search-based image annotation Experimental results on the two applications in a two million Web image database show both the effectiveness and efficiency of the proposed framework

Proceedings ArticleDOI
05 Nov 2008
TL;DR: A new image feature based on curvelet transform has been proposed, which significantly outperforms the widely used Gabor texture feature and compute the low order statistics from the transformed images.
Abstract: Feature extraction is a key issue in content-based image retrieval (CBIR). In the past, a number of texture features have been proposed in literature, including statistic methods and spectral methods. However, most of them are not able to accurately capture the edge information which is the most important texture feature in an image. Recent researches on multi-scale analysis, especially the curvelet research, provide good opportunity to extract more accurate texture feature for image retrieval. Curvelet was originally proposed for image denoising and has shown promising performance. In this paper, a new image feature based on curvelet transform has been proposed. We apply discrete curvelet transform on texture images and compute the low order statistics from the transformed images. Images are then represented using the extracted texture features. Retrieval results show, it significantly outperforms the widely used Gabor texture feature.

Proceedings ArticleDOI
07 Mar 2008
TL;DR: A new approach is introduced, which based on low level image histogram features, the image classification is analyzed and the main advantage is the very quick generation and comparison of the applied feature vectors.
Abstract: In content-based image retrieval systems (CBIR) the most efficient and simple searches are the color based searches. Although this methods can be improved if some prepocessing steps are used. In this paper one of the prepocessing algorithms, the image classification is analyzed. In CBIR image classification has to be computationally fast and efficient. In this paper a new approach is introduced, which based on low level image histogram features. The main advantage of this method is the very quick generation and comparison of the applied feature vectors.

Journal ArticleDOI
TL;DR: The aim of this survey paper is to provide a structured overview of the different models that have been explored over the last one to two decades, to highlight the particular challenges of the browsing approach and to focus attention on a few interesting issues that warrant more intense research.
Abstract: The problem of content based image retrieval (CBIR) has traditionally been investigated within a framework that emphasises the explicit formulation of a query: users initiate an automated search for relevant images by submitting an image or draw a sketch that exemplifies their information need. Often, relevance feedback is incorporated as a post-retrieval step for optimising the way evidence from different visual features is combined. While this sustained methodological focus has helped CBIR to mature, it has also brought out its limitations more clearly: There is often little support for exploratory search and scaling to very large collections is problematic. Moreover, the assumption that users are always able to formulate an appropriate query is questionable. An effective, albeit much less studied, method of accessing image collections based on visual content is that of browsing. The aim of this survey paper is to provide a structured overview of the different models that have been explored over the last one to two decades, to highlight the particular challenges of the browsing approach and to focus attention on a few interesting issues that warrant more intense research.

Journal Article
TL;DR: A novel approach for generalized image retrieval based on semantic contents is presented, a combination of three feature extraction methods namely color, texture, and edge histogram descriptor, developed based on greedy strategy.
Abstract: In this paper a novel approach for generalized image retrieval based on semantic contents is presented. A combination of three feature extraction methods namely color, texture, and edge histogram descriptor. There is a provision to add new features in future for better retrieval efficiency. Any combination of these methods, which is more appropriate for the application, can be used for retrieval. This is provided through User Interface (UI) in the form of relevance feedback. The image properties analyzed in this work are by using computer vision and image processing algorithms. For color the histogram of images are computed, for texture cooccurrence matrix based entropy, energy, etc, are calculated and for edge density it is Edge Histogram Descriptor (EHD) that is found. For retrieval of images, a novel idea is developed based on greedy strategy to reduce the computational complexity. The entire system was developed using AForge.Imaging (an open source product), MATLAB .NET Builder, C#, and Oracle 10g. The system was tested with Coral Image database containing 1000 natural images and achieved better results. Keywords—Content Based Image Retrieval (CBIR), Cooccurrence matrix, Feature vector, Edge Histogram Descriptor (EHD), Greedy strategy.

Proceedings ArticleDOI
21 Oct 2008
TL;DR: A content-based image retrieval (CBIR) system for matching and retrieving tattoo images based on scale invariant feature transform (SIFT) features extracted from tattoo images and optional accompanying demographical information that computes feature-based similarity between the query tattoo image and tattoos in the criminal database.
Abstract: Scars, marks and tattoos (SMT) are being increasingly used for suspect and victim identification in forensics and law enforcement agencies. Tattoos, in particular, are getting serious attention because of their visual and demographic characteristics as well as their increasing prevalence. However, current tattoo matching procedure requires human-assigned class labels in the ANSI/NIST ITL 1-2000 standard which makes it time consuming and subjective with limited retrieval performance. Further, tattoo images are complex and often contain multiple objects with large intra-class variability, making it very difficult to assign a single category in the ANSI/NIST standard. We describe a content-based image retrieval (CBIR) system for matching and retrieving tattoo images. Based on scale invariant feature transform (SIFT) features extracted from tattoo images and optional accompanying demographical information, our system computes feature-based similarity between the query tattoo image and tattoos in the criminal database. Experimental results on two different tattoo databases show encouraging results.

Proceedings ArticleDOI
23 Jun 2008
TL;DR: This work proposes algorithms for PCBIR, when the database is indexed using hierarchical index structure or hash based indexing scheme, and observed that specialty and subjectivity of image retrieval enables in computationally efficient yet private solutions.
Abstract: For content level access, very often database needs the query as a sample image. However, the image may contain private information and hence the user does not wish to reveal the image to the database. Private content based image retrieval (PCBIR) deals with retrieving similar images from an image database without revealing the content of the query image - not even to the database server. We propose algorithms for PCBIR, when the database is indexed using hierarchical index structure or hash based indexing scheme. Experiments are conducted on real datasets with popular features and state of the art data structures. It is observed that specialty and subjectivity of image retrieval (unlike SQL queries to a relational database) enables in computationally efficient yet private solutions.

Journal ArticleDOI
TL;DR: A hierarchical medical image classification method including two levels using a perfect set of various shape and texture features, including a tessellation-based spectral feature as well as a directional histogram has been proposed.

Journal ArticleDOI
TL;DR: A content-based image retrieval framework for diverse collections of medical images of different modalities, anatomical regions, acquisition views, and biological systems and an adaptive similarity fusion approach based on a linear combination of individual feature level similarities are presented.

Journal ArticleDOI
TL;DR: A novel computer-based image analysis method that is being developed to assist and automate the diagnosis of retinal disease is described and statistically relevant predictions regarding the presence, severity, and manifestations of common retinal diseases from digital images in an automated and deterministic manner are made.
Abstract: Purpose: To describe a novel computer-based image analysis method that is being developed to assist and automate the diagnosis of retinal disease. Methods: Content-based image retrieval is the process of retrieving related images from large database collections using their pictorial content. The content feature list becomes the index for storage, search, and retrieval of related images from a library based upon specific visual characteristics. Low-level analyses use feature description models and higher-level analyses use perceptual organization and spatial relationships, including clinical metadata, to extract semantic information. Results: We defined, extracted, and tested a large number of region- and lesion-based features from a dataset of 395 retinal images. Using a statistical hold-one-out method, independent queries for each image were submitted to the system and a diagnostic prediction was formulated. The diagnostic sensitivity for all stratified levels of age-related macular degeneration ranged from 75% to 100%. Similarly, the sensitivity of detection and accuracy for proliferative diabetic retinopathy ranged from 75% to 91.7% and for nonproliferative diabetic retinopathy, ranged from 75% to 94.7%. The overall purity of the diagnosis (specificity) for all disease states in the dataset was 91.3%. Conclusions: The probabilistic nature of content-based image retrieval permits us to make statistically relevant predictions regarding the presence, severity, and manifestations of common retinal diseases from digital images in an automated and deterministic manner.

Proceedings ArticleDOI
Haiming Liu1, Dawei Song1, Stefan Rüger1, Rui Hu1, Victoria Uren1 
15 Jan 2008
TL;DR: A systematic performance comparison is carried out to test the effectiveness of fourteen core dissimilarity measures with six different feature spaces and some of their combinations on the Corel image collection.
Abstract: Dissimilarity measurement plays a crucial role in content-based image retrieval, where data objects and queries are represented as vectors in high-dimensional content feature spaces. Given the large number of dissimilarity measures that exist in many fields, a crucial research question arises: Is there a dependency, if yes, what is the dependency, of a dissimilarity measure's retrieval performance, on different feature spaces? In this paper, we summarize fourteen core dissimilarity measures and classify them into three categories. A systematic performance comparison is carried out to test the effectiveness of these dissimilarity measures with six different feature spaces and some of their combinations on the Corel image collection. From our experimental results, we have drawn a number of observations and insights on dissimilarity measurement in content-based image retrieval, which will lay a foundation for developing more effective image search technologies.

Journal ArticleDOI
TL;DR: Comparisons between principal and complement components of image features in CBIR RF are made and an orthogonal complement component analysis is proposed to solve the problem of which features can benefit this human-computer iteration procedure.
Abstract: With many potential industrial applications, content-based image retrieval (CBIR) has recently gained more attention for image management and web searching. As an important tool to capture users' preferences and thus to improve the performance of CBIR systems, a variety of relevance feedback (RF) schemes have been developed in recent years. One key issue in RF is: which features (or feature dimensions) can benefit this human-computer iteration procedure? In this paper, we make theoretical and practical comparisons between principal and complement components of image features in CBIR RF. Most of the previous RF approaches treat the positive and negative feedbacks equivalently although this assumption is not appropriate since the two groups of training feedbacks have very different properties. That is, all positive feedbacks share a homogeneous concept while negative feedbacks do not. We explore solutions to this important problem by proposing an orthogonal complement component analysis. Experimental results are reported on a real-world image collection to demonstrate that the proposed complement components method consistently outperforms the conventional principal components method in both linear and kernel spaces when users want to retrieve images with a homogeneous concept.

Journal ArticleDOI
TL;DR: This paper proposes a new framework for context-aware recommendation of visual documents by modeling the user needs, the context and also the visual document collection together in a unified model and addresses also the user's need for diversified recommendations.
Abstract: Existing recommender systems provide an elegant solution to the information overload in current digital libraries such as the Internet archive. Nowadays, the sensors that capture the user's contextual information such as the location and time are become available and have raised a need to personalize recommendations for each user according to his/her changing needs in different contexts. In addition, visual documents have richer textual and visual information that was not exploited by existing recommender systems. In this paper, we propose a new framework for context-aware recommendation of visual documents by modeling the user needs, the context and also the visual document collection together in a unified model. We address also the user's need for diversified recommendations. Our pilot study showed the merits of our approach in content based image retrieval.

Proceedings ArticleDOI
25 Sep 2008
TL;DR: This paper proposed a novel approach to retrieve images by texture characterization using a composition of edge information and co-occurrence matrix properties, which gives encouraging results when comparing its retrieval performance to that of the traditional co- Occurrence matrices and Yaopsilas approach.
Abstract: Content-Based Image Retrieval (CBIR) system is emerging as an important research area, users can search and retrieve images based on their properties such as shape, color and texture from the image database. Usually texture-based image retrieval just consider an original image of coarseness, contrast and roughness, actually there is much texture information in the edge image. This paper proposed a novel approach to retrieve images by texture characterization using a composition of edge information and co-occurrence matrix properties. The proposed method gives encouraging results when comparing its retrieval performance to that of the traditional co-occurrence matrices and Yaopsilas approach.

Journal ArticleDOI
TL;DR: A method to combine a given set of dissimilarity functions is proposed and for each similarity function, a probability distribution is built and used to design a new similarity measure which combines the results obtained with each independent function.

Proceedings ArticleDOI
Rui Hu1, Stefan Rüger1, Dawei Song1, Haiming Liu1, Zi Huang1 
26 Aug 2008
TL;DR: 16 core dissimilarity measures are introduced and evaluated, and a systematic performance comparison on three image collections, Corel, Getty and Trecvid2003, with 7 different feature spaces is carried out.
Abstract: Dissimilarity measurement plays a crucial role in content-based image retrieval. In this paper, 16 core dissimilarity measures are introduced and evaluated. We carry out a systematic performance comparison on three image collections, Corel, Getty and Trecvid2003, with 7 different feature spaces. Two search scenarios are considered: single image queries based on the vector space model, and multi-image queries based on k-nearest neighbours search. A number of observations are drawn, which will lay a foundation for developing more effective image search technologies.

Journal ArticleDOI
TL;DR: Experiments show that the proposed feature selection system improves semantic performance results in image retrieval systems and is compared against competing techniques from the literature.
Abstract: In this article, we propose a novel system for feature selection, which is one of the key problems in content-based image indexing and retrieval as well as various other research fields such as pattern classification and genomic data analysis. The proposed system aims at enhancing semantic image retrieval results, decreasing retrieval process complexity, and improving the overall system usability for end-users of multimedia search engines. Three feature selection criteria and a decision method construct the feature selection system. Two novel feature selection criteria based on inner-cluster and intercluster relations are proposed in the article. A majority voting-based method is adapted for efficient selection of features and feature combinations. The performance of the proposed criteria is assessed over a large image database and a number of features, and is compared against competing techniques from the literature. Experiments show that the proposed feature selection system improves semantic performance results in image retrieval systems.

Journal ArticleDOI
TL;DR: Experimental results show that the proposed graph-theoretic matching criterion outperforms other existing methods which include no spatial information in the matching criterion and can be further improved with the proposed relevance feedback scheme.
Abstract: This paper presents a graph-theoretic approach for interactive region-based image retrieval. When dealing with image matching problems, we use graphs to represent images, transform the region correspondence estimation problem into an inexact graph matching problem, and propose an optimization technique to derive the solution. We then define the image distance in terms of the estimated region correspondence. In the relevance feedback steps, with the estimated region correspondence, we propose to use a maximum likelihood method to re-estimate the ideal query and the image distance measurement. Experimental results show that the proposed graph-theoretic image matching criterion outperforms the other methods incorporating no spatially adjacent relationship within images. Furthermore, our maximum likelihood method combined with the estimated region correspondence improves the retrieval performance in feedback steps.

Journal ArticleDOI
01 Aug 2008-Ubiquity
TL;DR: The CBIR process is used to describe the process of retrieving desired images from a large collection on the basis of syntactical image features, using techniques, tools and algorithms that originate from fields such as statistics, pattern recognition, signal processing, and VLSI design.
Abstract: The term CBIR seems to have originated in 1992, when it was describe experiments into automatic retrieval of images from a database, based on the colors and shapes present. Since then, the term has been used to describe the process of retrieving desired images from a large collection on the basis of syntactical image features. The techniques, tools and algorithms that are used originate from fields such as statistics, pattern recognition, signal processing, and VLSI design [1].