The problem of fast rigid matching of 3D curves with subvoxel precision is addressed. More invariant parameters are used, and new hash tables are implemented in order to process larger and more complex sets of data curves. There exists a Bayesian theory of geometric hashing that explains why local minima are not really a problem. The more likely transformation always wins. It is also possible to predict the uncertainty on the match with the help of the Kalman filter, and compare it with real measures.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    New developments on geometric hashing for curve matching


    Contributors:
    Gueziec, A. (author) / Ayache, N. (author)


    Publication date :

    1993-01-01


    Size :

    215868 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    A Bayesian Approach to Model Matching with Geometric Hashing

    Rigoutsos, I. / Hummel, R. | British Library Online Contents | 1995


    Where's Wally? - Geometric Hashing for Model Based Image Matching

    Deguchi, K. | British Library Online Contents | 1993


    Geometric hashing with attributed features

    Jyh-Jong Liu / Hummel, R. | IEEE | 1994


    Geometric Hashing with Attributed Features

    Liu, J.-J. / Hummel, R. / IEEE Computer Society; Technical Committee on Pattern Analysis and Machine Intelligence | British Library Conference Proceedings | 1994


    Content-based image retrieval by interest-point matching and geometric hashing [4925-14]

    Hsu, C.-T. / Shih, M.-C. / Society of Photo-optical Instrumentation Engineers et al. | British Library Conference Proceedings | 2002