An Improved Method of Geometric Hashing Pattern Recognition

Geometric hashing (GH) is a general modelbased recognition scheme. GH is widely used in the industrial products assembly and inspection tasks. The aim of this study is to speed up the geometric hashing pattern recognition method for the purpose of real-time object detection applications. In our method, a pattern is decomposed into some sub-patterns to reduce the data number in hash table bins. In addition, the sub-patterns are recorded in a plurality of hash tables. Finally we improve the recognition performance by combining with image pyramid and edge direction information. To confirm the validity of our proposed method, we make a complexity analysis, and apply our method to some images. Both complexity analysis and experiment evaluations have demonstrated the efficiency of this technique.

[1]  Haim J. Wolfson,et al.  Geometric hashing: an overview , 1997 .

[2]  Md. Saiful Islam,et al.  Relative scale method to locate an object in cluttered environment , 2008, Image Vis. Comput..

[3]  Ai Qun Hu,et al.  The Automatic Fuzzy Fingerprint Vault Based on Geometric Hashing: Vulnerability Analysis and Security Enhancement , 2009, 2009 International Conference on Multimedia Information Networking and Security.

[4]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Tomonobu Ozaki,et al.  Partial Geometric Hashing for Retrieving Similar Interaction Protein Using Profile , 2007, Fourth International Conference on Information Technology (ITNG'07).

[6]  Dana H. Ballard,et al.  Generalizing the Hough transform to detect arbitrary shapes , 1981, Pattern Recognit..

[7]  P. Anandan,et al.  A computational framework and an algorithm for the measurement of visual motion , 1987, International Journal of Computer Vision.