Dual Dynamic Programming with quantization for disparity map

International Journal of Computer Science and Engineering
© 2017 by SSRG - IJCSE Journal
Volume 4 Issue 3
Year of Publication : 2017
Authors : Monika Gupta, Sapna Malik
: 10.14445/23488387/IJCSE-V4I3P102

pdf
Citation:
MLA Style:

Monika Gupta, Sapna Malik, "Dual Dynamic Programming with quantization for disparity map" SSRG International Journal of Computer Science and Engineering 4.3 (2017): 5-9.

APA Style:

Monika Gupta, Sapna Malik,(2017). Dual Dynamic Programming with quantization for disparity map. SSRG International Journal of Computer Science and Engineering 4(3), 5-9.

Abstract:

Intensive research has been done in the field of stereovision to calculate an accurate disparity map, but all the existing methods have some limitations like high execution time, discontinuities, horizontal streaks etc. In this paper we propose an improved disparity map method, Dual dynamic programming with quantization, based on dynamic programming that provides lower execution time and more accurate disparity map. Our method improves the accuracy of stereo matching

References:

[1] A. Koschan, “What is New in Computational Stereo Since 1989, A Survey of Current Stereo Papers,” Technical Report 93-22, Technical Univ. of Berlin, 1993.
[2]The correspondence problem-T.kanade & M.Okutomi.
[3]C.S.Panchal, A.B. Upadhay “Depth estimation analysis using sum of absolute difference algorithm” in international journal of advanced research in electrical electronics and instrumentation engineering, volume 3, issue1, January 2014.
[4] M.Brown, D. Burschka, G.D. Hager, “Advances in computational stereo," in Pattern Analysis and Machine Intelligence, IEEE Transactions on(2003), Volume.25, no.8.
[5] B.K.P. Horn and B.G. Schunk, “Determining Optical Flow,” in proceedings of Artificial Intelligence, vol. 17, pp. 185-204, 1981.
[6] Andreas kochan, .,“A framework for Area based and feature based Stereo vision”,in proceedings of machine graphics and vision,vol.2,no.4,1993,pp285-308,1993.
[7] Peter Nillius& Jan-OlofEklundh “Fast Block Matching with Normalized Cross-Correlation using Walsh Transforms” Report number: TRITA-NA-P02/11, ISRN KTH/NA/P--02/11--SE, CVAP-268.Publication date: September 2002.
[8] R.A Hamzah, Haidi Ibrahim.” Literature Survey on Stereo Vision Disparity Map Algorithms”, www.hindawi.com,journal of sensors, Volume 2016 (2016), Article ID 8742920.
[9] Roy, S. & Cox, I,”A maximum-flow formulation of the n-camera Stereo correspondence problem”, in Proceedings of the International Conference on Computer Vision (ICCV), pp. 492-499., 1998.
[10] Jin-Hyung Kim, Kwon, J.W., Yun Ho Ko. “Multi-baseline based texture adaptive belief propagation stereo matching technique for dense depth-mapacquisition”. Electronics, Information and Communications (ICEIC), 2014 International Conference, 2014, pp: 1- 2.
[11] T.H. Cormen, C.E. Leiserson, and R.L. Rivest, “Introduction to Algorithms”, book McGraw-Hill, 1990.
[12] Yuichi Ohta and Takeo kanade, “Stereo by intra and inter scanline search using dynamic programming”, IEEE Transactions on pattern analysis and machine intelligence, vol . PAMI-7, no 2, March 1985.
[13] Huahua Chen,”Stereo Matching Using Dynamic Programming Based on Occlusion Detection”, in IEEE proceeding on mechatronics and automation, 2007.

Key Words:

Disparity map, Correspondence problem, Stereo matching