%0 Journal Article %1 M__2015 %A Lohot, Miss. Priyanka M. %A Sonawane, Mrs. Bhakti M. %D 2015 %I Auricle Technologies, Pvt., Ltd. %J International Journal on Recent and Innovation Trends in Computing and Communication %K Contour Correspondence Disparity Dynamic Image Longest Programming Stereo common space subsequent %N 2 %P 691--696 %R 10.17762/ijritcc2321-8169.150255 %T A New Approach for Stereo Matching Algorithm with Dynamic Programming %U http://dx.doi.org/10.17762/ijritcc2321-8169.150255 %V 3 %X Stereo matching algorithms are one of heavily researched topic in binocular stereo vision. Massive 3D information can be obtained by finding correct correspondence of different points between images captured from different views. Development of stereo matching algorithm is done for obtaining disparity maps i.e. depth information. When disparities computed for scan lines then dense reconstruction becomes time consuming for vision navigation systems. So for pair of stereo images proposed method extracts features points those are at contours in images and then a dynamic program is used to find the corresponding points from each image and calculates disparities. Also to reduce the noise which may lead to incorrect results in stereo correspondence, a new stereo matching algorithm based on the dynamic programming is proposed. Generally dynamic programming finds the global minimum for independent scan lines in polynomial time. While efficient, its performance is far from desired one because vertical consistency between scan lines is not enforced. This method review the use of dynamic programming for stereo correspondence by applying it to a contour instead to individual scan lines. Proposed methodology will obtain the global minimum for contour array in linear time using Longest Common Subsequent (LCS) dynamic programming method with no disparity space image (DSI)

@article{M__2015, abstract = {Stereo matching algorithms are one of heavily researched topic in binocular stereo vision. Massive 3D information can be obtained by finding correct correspondence of different points between images captured from different views. Development of stereo matching algorithm is done for obtaining disparity maps i.e. depth information. When disparities computed for scan lines then dense reconstruction becomes time consuming for vision navigation systems. So for pair of stereo images proposed method extracts features points those are at contours in images and then a dynamic program is used to find the corresponding points from each image and calculates disparities. Also to reduce the noise which may lead to incorrect results in stereo correspondence, a new stereo matching algorithm based on the dynamic programming is proposed. Generally dynamic programming finds the global minimum for independent scan lines in polynomial time. While efficient, its performance is far from desired one because vertical consistency between scan lines is not enforced. This method review the use of dynamic programming for stereo correspondence by applying it to a contour instead to individual scan lines. Proposed methodology will obtain the global minimum for contour array in linear time using Longest Common Subsequent (LCS) dynamic programming method with no disparity space image (DSI)}, added-at = {2015-08-04T08:05:51.000+0200}, author = {Lohot, Miss. Priyanka M. and Sonawane, Mrs. Bhakti M.}, biburl = {https://www.bibsonomy.org/bibtex/2395c5b2e53069ac0cc1a33f554b224d5/ijritcc}, doi = {10.17762/ijritcc2321-8169.150255}, interhash = {6cfc889b4d5dd3fd8d0e28a1c7dfef32}, intrahash = {395c5b2e53069ac0cc1a33f554b224d5}, journal = {International Journal on Recent and Innovation Trends in Computing and Communication}, keywords = {Contour Correspondence Disparity Dynamic Image Longest Programming Stereo common space subsequent}, month = {february}, number = 2, pages = {691--696}, publisher = {Auricle Technologies, Pvt., Ltd.}, timestamp = {2015-08-04T08:05:51.000+0200}, title = {A New Approach for Stereo Matching Algorithm with Dynamic Programming}, url = {http://dx.doi.org/10.17762/ijritcc2321-8169.150255}, volume = 3, year = 2015 }