透過您的圖書館登入
IP:18.226.104.177

並列摘要


The aim of this paper is to develop a stereo matching algorithm based on adaptive windows for a stereo vision domain. This method retains the advantageous image processing speed of traditional methods, and proposes a means of decreasing the error rate, making it the best choice for application in real time systems. Depending on the characteristics of different regions, the proposed method provides a suitable window for stereo vision matching. The processing method is differentiated into disparity consistency, the disparity for a smooth region, the vote disparity between the 8-neighbors and the uniqueness of disparity. A different processing method is used in the lab with the sum of absolute difference (SAD), and the result is compared with a fixed window method; the result proves that this method improves on the SAD method, and yields more accurate depth information.

參考文獻


R.C. Gonzalez, and R.E. Woods, Digital Image Processing. 2 ed. United States: Prentice Hall, 2002.
M.Z. Brown, D. Burschka, and G.D. Hager, Advances in computational stereo. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(8), p993-1008, 2003.
J.Y. Bouguet, Camera Calibration Toolbox for Matlab. Retrieved on March 10, 2011, from http://www.vision.caltech.edu/bouguetj/calib_doc/htmls/example5.html.
K.J. Yoon, and I.S. Kweon, Locally adaptive support-weight approach for visual correspondence search. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2, p 924-931, 2005.
V. Kolmogorov, and R. Zabih, Computing visual correspondence with occlusions using graph cuts. Presented at International Conference on Computer Vision, Vancouver, Canada, July 7-14, 2001.

延伸閱讀