Dynamic Programming In Hough Space For Line Matching In Stereopsis

Ze-Nian Li

doi:10.1117/12.969884

1 March 1990 Dynamic Programming In Hough Space For Line Matching In Stereopsis

Ze-Nian Li

Proceedings Volume 1195, Mobile Robots IV; (1990) https://doi.org/10.1117/12.969884
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

Abstract

This paper presents a technique of using the Hough space for solving the correspondence problem in stereo matching. This technique is proposed for depth recovery in our robot vision system which will work for a mobile robot in an office environment. It is shown that the line matching problem in the image space can be readily converted into a point matching problem in the Hough (p-0) space. Dynamic programming can be used for searching the optimal matching, now in the Hough space. The computational cost for dynamic programming in the Hough space is 0 (MN), where M and N are the numbers of the lines in the left and right images for each 0. Our preliminary results show that the proposed methodworkswell on several sets of test images (Rubik cubes and corridor scenes).

Citation Download Citation

Ze-Nian Li "Dynamic Programming In Hough Space For Line Matching In Stereopsis", Proc. SPIE 1195, Mobile Robots IV, (1 March 1990); https://doi.org/10.1117/12.969884

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available