Content-Based Image Indexing

Published 12 September 1994

Tzi‐cker Chiueh

Citations157

TL;DR

This paper forms the content-based image indexing problem as a multi-dimensional nearest-neighbor search problem, and develops/implement an optimistic vantage-point tree algorithm that can dynamically adapt the indexed search process to the characteristics of given queries.

Abstract

We formulate the content-based image in-dexing problem as a multi-dimensional nearest-neighbor search problem, and de-velop/implement an optimistic vantage-point tree algorithm that can dynamically adapt the indexed search process to the character-istics of given queries. Based on our perfor-mance study, the system typically only needs to touch less than 20 % of the index entries for well-behaved queries, i.e., when the query images are relatively close to their nearest neighbors in the database. We also report in this paper the results of extensive perfor-mance experiments, which characterise the

Keywords

Computer Science

ComputerQuery by image and video content: the QBIC system

3,058 Citations1995Myron Flickner, Harpreet Sawhney +10 more

The QBIC system is described and its query capabilities are demonstrated, which allows queries on large image and video databases based on example images, user-constructed sketches and drawings, selected color and texture patterns, camera and object motion, and other graphical information.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE<title>QBIC project: querying images by content, using color, texture, and shape</title>

1,760 Citations1993Carlton W. Niblack, Ron Barber +7 more

The main algorithms for color texture, shape and sketch query that are presented, show example query results, and discuss future directions are presented.

Symposium on Discrete AlgorithmsData structures and algorithms for nearest neighbor search in general metric spaces

984 Citations1993P.N. Yianilos

The up-tree (vantage point tree) is introduced in several forms, together‘ with &&ciated algorithms, as an improved method for these difficult search problems in general metric spaces.

Approximate nearest neighbor queries in fixed dimensions

312 Citations1993Sunil Arya, David M. Mount

A practical variant of this algorithm is implemented, and it is shown empirically that for many point distributions this variant of the algorithm finds the nearest neighbor in moderately large dimension significantly faster than existing practical approaches.

A retrieval technique for similar shapes

251 Citations1991H. V. Jagadish

An organization for a database of objects that permits the efficient retrieval of all objects in the database with a shape similar to a search template is proposed, which can have the computer reproduce, on a huge database of images, the process performed by a human in ‘ ‘riffling’ through a book, using an index structure to retrieve likely candidates quickly.

View PDF

Feature-based retrieval of similar shapes

82 Citations2002R. Mehrotra, James E. Gary

A shape similarity-based retrieval method for image databases that supports a variety of queries that is flexible with respect to the choice of feature and definition of similarity and is implementable using existing multidimensional point access methods.

Some Extensions of the K-Means Algorithm for Image Segmentation and Pattern Classification

64 Citations1993José L. Marroquín, Federico Girosi

By introducing a certain set of state variables it is possible to find the representative centers of the lower dimensional manifolds that define the boundaries between classes, which permits one, for example, to find class boundaries directly from sparse data or to efficiently place centers for pattern classification.

View PDF

ComputerExample-based graphical database query languages

62 Citations1993Gültekin Özsoyoğlu, H. Wang

Several user-friendly graphical database query languages that let users formulate a query by specifying a graphically aided example on the screen are compared.

Data & Knowledge EngineeringA pictorial index mechanism for model-based matching

54 Citations1992William I. Grosky, Peter Neo +1 more

A secondary memory implementation of data-driven indexed hypotheses is described along with some performance studies the authors have conducted, describing a secondary memory implementation of data-driven indexed hypotheses along with some performance studies they have conducted.