Locally adaptive support-weight approach for visual correspondence search

• Published in: 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) Vol. 2; pp. 924 - 931 vol. 2
• Main Authors: Kuk-Jin Yoon, In-So Kweon
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2005
• Subjects: Area measurement; Computer science; Computer vision; Costs; Laboratories; NP-hard problem; Photometry; Pixel; Robot vision systems; Shape
• ISBN: 0769523722; 9780769523729
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2005.218

In this paper, we present a new area-based method for visual correspondence search that focuses on the dissimilarity computation. Local and area-based matching methods generally measure the similarity (or dissimilarity) between the image pixels using local support windows. In this approach, an appropriate support window should be selected adaptively for each pixel to make the measure reliable and certain. Finding the optimal support window with an arbitrary shape and size is, however, very difficult and generally known as an NP-hard problem. For this reason, unlike the existing methods that try to find an optimal support window, we adjusted the support-weight of each pixel in a given support window. The adaptive support-weight of a pixel is computed based on the photometric and geometric relationship with the pixel under consideration. Dissimilarity is then computed using the raw matching costs and support-weights of both support windows, and the correspondence is finally selected by the WTA (winner-takes-all) method. The experimental results for the rectified real images show that the proposed method successfully produces piecewise smooth disparity maps while preserving sharp depth discontinuities accurately.