A Fast Implementation of a Perfect Hash Function for Picture Objects

Author

Sanjiv K. Bhatia
Chaman Sabharwal, Missouri University of Science and TechnologyFollow

Abstract

In image database systems, symbolic pictures are represented by two-dimensional (2D) strings that are converted into triples. Each triple is mapped to a unique hash address for timely retrieval of pictures, reducing the pattern-matching problem corresponding to a query to that of computation of a hash function. The values associated with the picture objects are used to compute hash addresses for triples developed from the query. Heuristics are proposed to speed up the computation of the associated values for the picture objects. Experimental results show that the new algorithm achieves almost a 90% gain, in search space, over existing algorithms to compute the associated values. © 1994.

Recommended Citation

S. K. Bhatia and C. Sabharwal, "A Fast Implementation of a Perfect Hash Function for Picture Objects," Pattern Recognition, vol. 27, no. 3, pp. 365 - 376, Elsevier, Jan 1994.

The definitive version is available at https://doi.org/10.1016/0031-3203(94)90114-7

Department(s)

Computer Science

Keywords and Phrases

2D string; A* search algorithm; Associated value function; Image database systems; Perfect hashing function

International Standard Serial Number (ISSN)

0031-3203

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Elsevier, All rights reserved.

Publication Date

01 Jan 1994