Open Access Open Access  Restricted Access Subscription or Fee Access

Error Reduction by Artificial Intelligence based Search and Bidirectional Scan in Dynamic Programming in Stereo Vision

Arvind Kakria, Ajay Mittal, Prakaram Joshi

Abstract


The determination of three dimensional information about the scene from two or more two dimensional views of the same scene has been a problem widely discussed in study of computer vision. Stereovision uses two cameras which capture a pair of image locations and then a single three dimensional physical location is derived by exploiting a number of constraints. For the purpose of exploiting these constraints local and global methods are used [7] that attempts to match pixels in one image with thei corresponding pixels in the other image. In our paper we use the global method: Dynamic Programming to find the correct match between the two images and also to improve the efficiency we use the bidirectional matching in which dynamic programming is applied from left to right and then from right to left to avoid occlusion and A* search for increasing the quality of the results is to use an optimal searching methodology for the minimal cost path.


Keywords


Stereovision, Constraints, Disparity

Full Text:

PDF

References


Depth Preception in Stereo Computer Vision by Clark Thomson.

A locally Adaptive Window for signal matching: Masatoshi Okutomi and Takeo Kanade.

Tutorial: Overview of Stereo Matching research: R. A Lane and N. A Thacker.

Stereo by Intra-and –inter scanline search using dynamic Programming: Yutchi Ohta.

Computing Visual correspondence using graph cuts: Vladimir Kolmogorov and Ramin Zaib.

Stereo matching using dynamic programming based on occlusion detection.

Advances in Computational Stereo Myron Z. Brown, Member, IEEE, Darius Burschka, Member, IEEE, and Gregory D. Hager, Senior Member, IEEE.

An experimental Comparisn of Min/Max Flow for energy Minimization in Vision. : Yuri Boykov and Vladimir Kolmogorov.

Real Time Stereo by using Dynamic Programming: Sven Fortsmann, Yutaka Kanou, Jun Ohya and Sven Thuering.

T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.

Y. Ohta and T. Kanade, “Stereo by Intra- and Intra-Scanline Search Using Dynamic Programming,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7 pp. 139-154, 1985.

I. J. Cox, S. L. Hingorani, S. B. Rao, and B. M. Maggs, “A Maximum Likelihood Stereo Algorithm,” Computer Vision and Image Understanding, vol. 63, pp. 542-567, 1996.

S. Birchfield and C. Tomasi, “Depth Discontinuities by Pixel-to- Pixel Stereo,” Technical Report STAN-CS-TR-96-1573, Stanford Univ., 1996.

H. H. Baker, “Depth from Edge and Intensity Based Stereo,” Technical Report AIM-347, Artificial Intelligence Laboratory, Stanford Univ., 1982.


Refbacks

  • There are currently no refbacks.