Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is presented, and shown to be effective at solving problems where the point sets are related by a projective transformation. Random starts local search is shown to be capable of solving. very difficult point matching problems, and a heuristic key feature algorithm is presented which can substantially improve the effectiveness of local search in most cases.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Two dimensional projective point matching


    Contributors:


    Publication date :

    2002-01-01


    Size :

    301453 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Two Dimensional Projective Point Matching

    Denton, J. / Beveridge, J. R. / IEEE Computer Society et al. | British Library Conference Proceedings | 2002


    Robust Point Feature Matching in Projective Space

    Chen, G. Q. / IEEE | British Library Conference Proceedings | 2001



    Linear projective reconstruction from matching tensors

    Triggs, B. | British Library Online Contents | 1997