Stereo by Two-level Dynamic Programming

Stereo by Two-level Dynamic Programming (1985)

Cached

Download Links

[dli.iiit.ac.in]

Other Repositories/Bibliography

DBLP

by Yuichi Ohta

Venue:	In 9th Int. Joint Conf. Artificial Intelligence
Citations:	8 - 0 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Stereo by Two-level Dynamic Programming	INFERENCE
AUTHOR NAME	Yuichi Ohta	SVM HeaderParse 0.2
AUTHOR AFFIL	; Institute of Information Sciences and Electronics; University of Tsukuba; Department of Computer Science, Carnegie-Mellon University. The	SVM HeaderParse 0.2
AUTHOR ADDR	; IBARAKI, 305, JAPAN	SVM HeaderParse 0.2
ABSTRACT	This paper presents a stereo algorithm using dynamic programming technique. The stereo matching problem, that is, obtaining a correspondence between right and left images, can be cast as a search problem. When a pair of stereo images is rectified, pairs of corresponding points can be searched for within the same scanlines. We call this search intra-scanline search. This intra-scanline search can be treated as the problem of finding a matching path on a two dimensional (2D) search plane whose axes are the right and left scanlines. Vertically connected edges in the images provide consistency constraints across the 2D search planes. Inter-scanline search in a three-dimensional (3D) search space, which is a stack of the 2D search planes, is needed to utilize this constraint. Our stereo matching algorithm uses edge-delimited intervals as elements to be matched, and employs the above mentioned two searches: one is inter-scanline search for possible correspondences of connected edges in right and left images and the other is intra-scanline search for correspondences of edge-delimited intervals on each scanline pair. Dynamic programming is used for both searches which proceed simultaneously in two levels: the former supplies the consistency constraints to the latter while the latter supplies the matching score to the former. An interval-based similarity metric is used to compute the score. 1.	SVM HeaderParse 0.2
YEAR	1985	INFERENCE
VENUE	In 9th Int. Joint Conf. Artificial Intelligence	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	1120--1126	INFERENCE
VOLUME	7	INFERENCE
CITATIONS	10 found	ParsCit 1.0