Home   >   CSC-OpenAccess Library   >    Manuscript Information
Full Text Available

(519.7KB)
This is an Open Access publication published under CSC-OpenAccess Policy.
Publications from CSC-OpenAccess Library are being accessed from over 74 countries worldwide.
Stereo Correspondence Algorithms for Robotic Applications Under Ideal And Non Ideal Lighting Conditions
Deepambika V A, Abdul Rahiman M
Pages - 89 - 101     |    Revised - 01-05-2015     |    Published - 31-05-2015
Volume - 9   Issue - 3    |    Publication Date - May / June 2015  Table of Contents
MORE INFORMATION
KEYWORDS
Stereo Vision Robotic, Correspondence Algorithm, SAD.
ABSTRACT
The use of visual information in real time applications such as in robotic pick, navigation, obstacle avoidance etc. has been widely used in many sectors for enabling them to interact with its environment. Robotics require computationally simpler and easy to implement stereo vision algorithms that will provide reliable and accurate results under real time constraint. Stereo vision is a less expensive, passive sensing technique, for inferring the three dimensional position of objects from two or more simultaneous views of a scene and there is no interference with other sensing devices if multiple robots are present in the same environment. Stereo correspondence aims at finding matching points in the stereo image pair based on Lambertian criteria to obtain disparity. The correspondence algorithm will provide high resolution disparity maps of the scene by comparing two views of the scene under the study. By using the principle of triangulation and with the help of camera parameters, depth information can be extracted from this disparity .Since the focus is on real-time application, only the local stereo correspondence algorithms are considered. A comparative study based on error and computational costs are done between two area based algorithms. Evaluation of Sum of absolute Difference algorithm, which is less computationally expensive, suitable for ideal lightening condition and a more accurate adaptive binary support window algorithm that can handle of non-ideal lighting conditions are taken for this study. To simplify the correspondence search, rectified stereo image pairs are used as inputs.
1 Google Scholar 
2 CiteSeerX 
3 refSeek 
4 Scribd 
5 SlideShare 
6 PdfSR 
1 Fusiello, A., Trucco, E., & Verri, A. (2000). A compact algorithm for rectification of stereo pairs. Machine Vision and Applications, 12(1), 16-22.
2 Hamzah, R. A., Rahim, R. A., & Noh, Z. M. (2010, July). Sum of Absolute Differences algorithm in stereo correspondence problem for stereo matching in computer vision application. In Computer Science and Information Technology (ICCSIT), 2010 3rd IEEE International Conference on (Vol. 1, pp. 652-657). IEEE.
3 Konolige, K. (1999). Stereo geometry. SRI International.
4 Tsai, R. Y. (1986). An efficient and accurate camera calibration technique for 3D machine vision. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 1986.
5 Kanade, T., & Okutomi, M. (1994). A stereo matching algorithm with an adaptive window: Theory and experiment. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 16(9), 920-932.
6 Fusiello, A., Roberto, V., & Trucco, E. (1997, June). Efficient stereo with multiple windowing. In 2013 IEEE Conference on Computer Vision and Pattern Recognition (pp. 858 858). IEEE Computer Society.
7 Veksler, O. (2002). Stereo correspondence with compact windows via minimum ratio cycle. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 24(12), 1654-1660.
8 Prazdny, K. (1985). Detection of binocular disparities. Biological Cybernetics, 52(2), 93-99.
9 Xu, Y., Wang, D., Feng, T., & Shum, H. Y. (2002). Stereo computation using radial adaptive windows. In Pattern Recognition, 2002. Proceedings. 16th International Conference on (Vol. 3, pp. 595-598). IEEE.
10 Yoon, K. J., & Kweon, I. S. (2006). Adaptive support-weight approach for correspondence search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(4), 650-656.
11 Tombari, F., Mattoccia, S., & Di Stefano, L. (2007). Segmentation-based adaptive support for accurate stereo correspondence. In Advances in Image and Video Technology (pp. 427 438). Springer Berlin Heidelberg.
12 De-Maeztu, L., Villanueva, A., & Cabeza, R. (2011). Stereo matching using gradient similarity and locally adaptive support-weight. Pattern Recognition Letters, 32(13), 1643 1651.
13 Nalpantidis, L., & Gasteratos, A. Biologically and psychophysically inspired adaptive support weights algorithm for stereo correspondence. Robotics and Autonomous Systems, 58(5), 457-464.
14 Nalpantidis, L., & Gasteratos, A. (2010). Stereo vision for robotic applications in the presence of non-ideal lighting conditions. Image and Vision Computing, 28(6), 940-951.
15 Wertheimer, M. (1938). Laws of organization in perceptual forms.
16 http://vision.middlebury.edu/stereo/data/
17 Scharstein, D., & Szeliski, R. (2002). A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. International journal of computer vision, 47(1-3), 7-42.
18 Wang, L., Gong, M., Gong, M., & Yang, R. (2006, June). How far can we go with local optimization in real-time stereo matching. In 3D Data Processing, Visualization, and Transmission, Third International Symposium on (pp. 129-136). IEEE.
Mr. Deepambika V A
LBSITW Trivandrum - India
Dr. Abdul Rahiman M
Kerala technological University - India
pvc@ktu.edu.in