Given a query fingerprint, the goal of indexing is to identify and retrieve a set of candidate fingerprints from a large database in order to determine a possible match. This significantly improves the response time of fingerprint recognition systems operating in the identification mode. In this work, we extend the indexing framework based on minutiae triplets by utilizing ridge curve parameter...

Color histogram matching has been shown to be a promising way of quickly indexing into a large image database. Yet, few experiments have been done to test the method on truly large databases, and even if they were performed, they would give little guidance to a user wondering if the technique would be useful with his or her database. In this paper we de ne and analyze measures relevant to exten...

Several indexing techniques have been proposed to accelerate database operations in object-oriented databases. A database operation gives rise to the processing of a path. We address the problem of optimal index connguration for a given logical schema, the workload deened on the schema and some other database characteristics such as the cardinality of a class, page size, etc. As will be shown a...

This paper proposes a new image representation scheme for database indexing. The application domain is \image-based" indexing as opposed to \content-based" indexing. In other words, given a database of images and associated data, we want to search the database for a known image so as to retrieve the data associated with the image. A concrete example is to search a database of aerial images so a...

The performance of an indexing technique, namely, a system of feature extraction and similarity measure, is strongly related to the test bed in content-based image retrieval. A theoretical framework is proposed for image database modeling. The goal is to investigate the relationship between a given indexing technique and a given image database. As an analogy to the concept of perplexity of a te...

Database indexing is a well studied problem. However, the advent of Hypertext databases opens new questions in indexing. Searches are often demarcated by pointers between text items. Thus the scope of the search may change dynamically, whereas traditional indexes cover a statically defined region such as a relation. We present techniques for indexing in hypertext databases and compare their per...

Broadly speaking, if the primary objective of the back-ofthe-book indexer is to help the reader locate specific topics within a single, usually lengthy, document, the primary objective of the database indexer is to help the reader find entire documents, typically journal articles, on specific topics within some large document collection. While a back-of-the-book index is usually part of the doc...