[1] Yang Ankang, Liu Jingnan, Yoshihisa Uchida, Yoshiyuki Uchida, et al. Fast estimation of fundamental matrix based on stripe constraints [J]. Journal of Southeast University (English Edition), 2008, 24 (4): 473-477. [doi:10.3969/j.issn.1003-7985.2008.04.015]

Copy

Fast estimation of fundamental matrix based on stripe constraints()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

24

Issue:

2008 4

Page:

473-477

Research Field:

Computer Science and Engineering

Publishing date:

2008-12-30

Info

Title:

Fast estimation of fundamental matrix based on stripe constraints

Author(s):

Yang Ankang¹;  Liu Jingnan¹;  Yoshihisa Uchida²;  Yoshiyuki Uchida²

¹ School of Automation, Southeast University, Nanjing 210096, China
² Department of Information Network Engineering, Aichi Institute of Technology, Toyoda 470-0392, Japan

Keywords:

fundamental matrix;  structured-light;  stripe code pattern;  stereo vision

PACS:

TP391

DOI:

10.3969/j.issn.1003-7985.2008.04.015

Abstract:

In order to improve the performance of estimating the fundamental matrix, a key problem arising in stereo vision, a novel method based on stripe constraints is presented.In contrast to traditional methods based on algebraic least-square algorithms, the proposed approach aims to minimize a cost function that is derived from the minimum radius of the Hough transform.In a structured-light system with a particular stripe code pattern, there are linear constraints that the points with the same code are on the same surface.Using the Hough transform, the pixels with the same code map to the Hough space, and the radius of the intersections can be defined as the evaluation function in the optimization progress.The global optimum solution of the fundamental matrix can be estimated using a Levenberg-Marquardt optimization iterative process based on the Hough transform radius.Results illustrate the validity of this algorithm, and prove that this method can obtain good performance with high efficiency.

References:

[1] Mittal A, Davis L S.A general method for sensor planning in multi-sensor systems:extension to random occlusion [J].International Journal of Computer Vision, 2008, 76(1):31-52.
[2] Tang C Y, Chou H L, Wu Y L, et al.Robust fundamental matrix estimation using coplanar constraints [J].International Journal of Pattern Recognition and Artificial Intelligence, 2008, 22(4):783-805.
[3] Hua M, McMenemy K, Ferguson S, et al.Epipolar geometry estimation based on evolutionary agents[J].Pattern Recognition, 2008, 41(2):575-591.
[4] Huang J F, Lai S H, Cheng C M.Robust fundamental matrix estimation with accurate outlier detection[J].Journal of Information Science and Engineering, 2007, 23(4):1213-1225.
[5] Chojnacki W, Brooks M J.On the consistency of the normalized eight-point algorithm [J].Journal of Mathematical Imaging and Vision, 2007, 28(1):19-27.
[6] Brandt S.On the probabilistic epipolar geometry [J].Image and Vision Computing, 2008, 26(3):405-414.
[7] Tang C Y, Wu Y L, Lai Y H.Fundamental matrix estimation using evolutionary algorithms with multi-objective functions [J].Journal of Information Science and Engineering, 2008, 24(3):785-800.

Memo

Memo:

Biographies: Yang Ankang(1977—), male, graduate;Liu Jingnan(corresponding author), male, doctor, professor, liujn@seu.edu.cn.
Citation: Yang Ankang, Liu Jingnan, Yoshihisa Uchida, et al.Fast estimation of fundamental matrix based on stripe constraints[J].Journal of Southeast University(English Edition), 2008, 24(4):473-477.

Common functions