A new efficient matching algorithm dedicated to catadioptric sensors is proposed in this paper. The presented approach is designed to overcome the varying resolution of the mirror. The aim of this work is to provide a matcher that gives reliable results similar to the ones obtained by classical operators on planar projection images. The matching is based on a dynamical size windows extraction, computed from the viewing angular aperture of the neighborhood around the points of interest. An angular scaling of this angular aperture provides a certain number of different neighborhood resolution around the same considered point. A combinatory cost method is introduced in order to determine the best match between the different angular neighborhood patches of two interest points. Results are presented on sparse matched corner points, that can be used to estimate the epipolar geometry of the scene in order to provide a dense 3D map of the observed environment.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Efficient Dynamic Multi-Angular Feature Points Matcher for Catadioptric Views


    Contributors:


    Publication date :

    2003-06-01


    Size :

    141452 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Structure and motion from uncalibrated catadioptric views

    Geyer, C. / Daniilidis, K. | IEEE | 2001


    Structure and Motion from Uncalibrated Catadioptric Views

    Geyer, C. / Daniilidis, K. / IEEE | British Library Conference Proceedings | 2001


    Region proposal-based semantic matcher

    Moiseenko, Anastasiia / Vizilter, Yuri / Vishnyakov, Boris et al. | SPIE | 2019


    UAV attitude estimation by vanishing points in catadioptric images

    Bazin, J.C. / Kweon, Inso / Demonceaux, C. et al. | Tema Archive | 2008


    Patch-based face recognition using a hierarchical multi-label matcher

    Zhang, L. / Dou, P. / Kakadiaris, I.A. | British Library Online Contents | 2018