Opto-Electronic Engineering, Volume. 37, Issue 8, 46(2010)

Two Removal Tactics of Pseudo Solutions for Essential Matrix Five-point Algorithm

WANG Wen-bin1,*... LIU Gui-hua1, LIU Xian-yong1,2 and QIU Zhi-qiang2 |Show fewer author(s)
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less

    The five-point algorithm of essential matrix is a common way to achieve relative orientation of the two-view images in 3D measuring. Polynomial solving techniques, which lead to polysemia while computing, are always adopted during the computing process. In order to determine the right solution, two improved methods for five-point algorithm are proposed to avoid multi-solutions. First of all, the inconsistent solutions of physical model were excluded with cheirality constraint. Secondly, the rest error solutions can be solved by computing sums of Sampson distance of all the common points or re-projection residual. In the two-view images, the minimum value among sums is just the correct orientation parameter values. Both simulation and real images experiments have proved the feasibility and correctness of the two tactics. In most cases, methods based on Sampson are much quicker than that based on re-projection.

    Tools

    Get Citation

    Copy Citation Text

    WANG Wen-bin, LIU Gui-hua, LIU Xian-yong, QIU Zhi-qiang. Two Removal Tactics of Pseudo Solutions for Essential Matrix Five-point Algorithm[J]. Opto-Electronic Engineering, 2010, 37(8): 46

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category:

    Received: Jan. 12, 2010

    Accepted: --

    Published Online: Sep. 7, 2010

    The Author Email: Wen-bin WANG (wwb-624@163.com)

    DOI:

    CSTR:32186.14.

    Topics