Unsupervised Content Based Image Retrieval by Combining Visual Features of an Image With A Threshold

Content-based image retrieval (CBIR) uses the visual features of an image such as color, shape and texture to represent and index the image. In a typical content based image retrieval system, a set of images that exhibit visual features similar to that of the query image are returned in response to a query. CLUE (CLUster based image rEtrieval) is a popular CBIR technique that retrieves images by clustering. In this paper, we propose a CBIR system that also retrieves images by clustering just like CLUE. But, the proposed system combines all the features (shape, color, and texture) with a threshold for the purpose. The combination of all the features provides a robust feature set for image retrieval. We evaluated the performance of the proposed system using images of varying size and resolution from image database and compared its performance with that of the other two existing CBIR systems namely UFM and CLUE. We have used four different resolutions of image. Experimentally, we find that the proposed system outperforms the other two existing systems in ecery resolution of imag

Content-Based Image Retrieval using SURF and Colour Moments

Content-Based Image Retrieval (CBIR) is a challenging task which retrieves the similar images from the large database. Most of the CBIR system uses the low-level features such as colour, texture and shape to extract the features from the images. In Recent years the Interest points are used to extract the most similar images with different view point and different transformations. In this paper the SURF is combined with the colour feature to improve the retrieval accuracy. SURF is fast and robust interest points detector/descriptor which is used in many computer vision applications. To improve the performance of the system the SURF is combined with Colour Moments since SURF works only on gray scale images. The KD-tree with the Best Bin First (BBF) search algorithm is to index and match the similarity etween the features of the images. Finally, Voting Scheme algorithm is used to rank and retrieve the matched images from the database

Index Trees for Efficient Deformable Shape-based Retrieval

An improved method for deformable shape-based image indexing and retrieval is described. A pre-computed index tree is used to improve the speed of our previously reported on-line model fitting method; simple shape features are used as keys in a pre-generated index tree of model instances. In addition, a coarse to fine indexing scheme is used at different levels of the tree to further improve speed while maintaining matching accuracy. Experimental results show that the speedup is significant, while accuracy of shape-based indexing is maintained. A method for shape population-based retrieval is also described. The method allows query formulation based on the population distributions of shapes in each image. Results of population-based image queries for a database of blood cell micrographs are shown.Office of Naval Research (Young Investigator Award, N00014-96-1-066); National Science Foundation (IIS-9624168, EIA-9623865

Digital Image Access & Retrieval

The 33th Annual Clinic on Library Applications of Data Processing, held at the University of Illinois at Urbana-Champaign in March of 1996, addressed the theme of "Digital Image Access & Retrieval." The papers from this conference cover a wide range of topics concerning digital imaging technology for visual resource collections. Papers covered three general areas: (1) systems, planning, and implementation; (2) automatic and semi-automatic indexing; and (3) preservation with the bulk of the conference focusing on indexing and retrieval.published or submitted for publicatio

Asymmetric Feature Maps with Application to Sketch Based Retrieval

We propose a novel concept of asymmetric feature maps (AFM), which allows to evaluate multiple kernels between a query and database entries without increasing the memory requirements. To demonstrate the advantages of the AFM method, we derive a short vector image representation that, due to asymmetric feature maps, supports efficient scale and translation invariant sketch-based image retrieval. Unlike most of the short-code based retrieval systems, the proposed method provides the query localization in the retrieved image. The efficiency of the search is boosted by approximating a 2D translation search via trigonometric polynomial of scores by 1D projections. The projections are a special case of AFM. An order of magnitude speed-up is achieved compared to traditional trigonometric polynomials. The results are boosted by an image-based average query expansion, exceeding significantly the state of the art on standard benchmarks.Comment: CVPR 201