Abstract Establishing correspondence between features of a set of images has been a long-standing issue amongst the computer vision community. We propose a method that solves the multi-frame correspondence problem by imposing a rank constraint on the observed scene, i.e. rigidity is assumed. Since our algorithm is based solely on a geometrical (global) criterion, it does not suffer from issues usually associated to local methods, such as the aperture problem. We model feature matching by introducing the assignment tensor, which allows simultaneous feature alignment for all images, thus providing a coherent solution to the calibrated multi-frame correspondence problem in a single step of linear complexity. Also, an iterative method is presented that is able to cope with the non-calibrated case. Moreover, our method is able to seamlessly reject a large number of outliers in every image, thus also handling occlusion in an integrated manner.


    Zugriff

    Download


    Exportieren, teilen und zitieren



    Titel :

    Optimal Multi-frame Correspondence with Assignment Tensors


    Beteiligte:
    Oliveira, R. (Autor:in) / Ferreira, R. (Autor:in) / Costeira, J. P. (Autor:in)


    Erscheinungsdatum :

    2006-01-01


    Format / Umfang :

    12 pages





    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Optimal Multi-frame Correspondence with Assignment Tensors

    Oliveira, R. / Ferreira, R. / Costeira, J. P. | British Library Conference Proceedings | 2006


    Optimal-flow minimum-cost correspondence assignment in particle flow tracking

    Matov, A. / Edvall, M. M. / Yang, G. et al. | British Library Online Contents | 2011


    Multi-Frame Correspondence Estimation Using Subspace Constraints

    Irani, M. | British Library Online Contents | 2002


    Identifying truck correspondence in multi-frame imagery

    O’Kelly, Morton / Matisziw, Timothy / Li, Ron et al. | Elsevier | 2003


    Radial Multi-focal Tensors

    Thirthala, S. / Pollefeys, M. | British Library Online Contents | 2012