Image databases and near-perfect hash table

@article{Sabharwal1997ImageDA,
  title={Image databases and near-perfect hash table},
  author={Chaman L. Sabharwal and Sanjiv K. Bhatia},
  journal={Pattern Recognition},
  year={1997},
  volume={30},
  pages={1867-1876}
}
The 2D-string is one of the important data structures to represent spatial information in images and has been used to perform queries in image database systems. A 2D string can be readily converted to a set of triples which can be used to generate a perfect hash table for indexing the image database. The perfect hash table allows for O(1) retrieval in image database but the computation of the hash table itself, by the fastest heuristic algorithm, is of exponential time complexity. Every time… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Neural Based Approach for Fast Retrieval of Symbolic Images in Database

2009 Second International Conference on Machine Vision • 2009
View 2 Excerpts

Real-Time Commercial Recognition Using Color Moments and Hashing

Fourth Canadian Conference on Computer and Robot Vision (CRV '07) • 2007
View 1 Excerpt

Indexing of Document Images Based on Nine-Directional Codes

2006 Fourth International Conference on Intelligent Sensing and Information Processing • 2006
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Retrieval of similar pictures on pictorial databases

Pattern Recognition • 1991
View 10 Excerpts
Highly Influenced

Iconic Indexing by 2-D Strings

IEEE Transactions on Pattern Analysis and Machine Intelligence • 1987
View 7 Excerpts
Highly Influenced

Picture Indexing and Abstraction Techniques for Pictorial Databases

IEEE Transactions on Pattern Analysis and Machine Intelligence • 1984
View 7 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…