Locating indexing structures in engineering drawing databases using location hashing

Fast and robust localization of image regions that are likely to come from a query object is a critical operation needed in several image database applications. In this paper, we address this problem in the context of locating indexing structures in engineering drawing databases. Specifically, we present a general 2d pattern localization technique called location hashing and apply it to the problem of localizing title block structures in engineering drawings. Location hashing is a variation of geometric hashing that directly identifies locations in images of a database that are likely to contain a query object, possibly depicted under different imaging conditions. We also describe an engineering drawing indexing system that combines title block localization with test recognition to enable automatic index creation of engineering drawing databases.

[1]  Yehezkel Lamdan,et al.  Geometric Hashing: A General And Efficient Model-based Recognition Scheme , 1988, [1988 Proceedings] Second International Conference on Computer Vision.

[2]  Amarnath Gupta,et al.  Visual information retrieval , 1997, CACM.

[3]  Robert A. Hummel,et al.  Massively parallel model matching: geometric hashing on the Connection Machine , 1992, Computer.

[4]  Christos Faloutsos,et al.  QBIC project: querying images by content, using color, texture, and shape , 1993, Electronic Imaging.

[5]  Shih-Fu Chang,et al.  VisualSEEk: a fully automated content-based image query system , 1997, MULTIMEDIA '96.

[6]  I. Rigoutsos,et al.  Geometric Hashing , 1997, IEEE Computational Science and Engineering.