Optimal algorithms in multiview geometry

Richard Hartley*, Fredrik Kahl

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    72 Citations (Scopus)

    Abstract

    This is a survey paper summarizing recent research aimed at finding guaranteed optimal algorithms for solving problems in Multiview Geometry. Many of the traditional problems in Multiview Geometry now have optimal solutions in terms of minimizing residual imageplane error. Success has been achieved in minimizing L2 (least-squares) or L (smallest maximum error) norm. The main methods involve Second Order Cone Programming, or quasi-convex optimization, and Branch-and-bound. The paper gives an overview of the subject while avoiding as far as possible the mathematical details, which can be found in the original papers.

    Original languageEnglish
    Title of host publicationComputer Vision - ACCV 2007 - 8th Asian Conference on Computer Vision, Proceedings
    PublisherSpringer Verlag
    Pages13-34
    Number of pages22
    EditionPART 1
    ISBN (Print)9783540763857
    DOIs
    Publication statusPublished - 2007
    Event8th Asian Conference on Computer Vision, ACCV 2007 - Tokyo, Japan
    Duration: 18 Nov 200722 Nov 2007

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    NumberPART 1
    Volume4843 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Conference

    Conference8th Asian Conference on Computer Vision, ACCV 2007
    Country/TerritoryJapan
    CityTokyo
    Period18/11/0722/11/07

    Fingerprint

    Dive into the research topics of 'Optimal algorithms in multiview geometry'. Together they form a unique fingerprint.

    Cite this