—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This...
S. M. Nejhum Shahed, Yu-Tseh Chi, Jeffrey Ho, Ming...
Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the m...
While many algorithms for computing stereo correspondence have been proposed, there has been very little work on experimentally evaluating algorithm performance, especially using r...
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
— This paper presents a vision based SLAM method by using stereo SFM technique. The proposed method is based on the stereo SFM presented in our former paper. The method do not ne...
This paper presents a novel approach that performs post-processing for stereo correspondence. We improve the performance of stereo correspondence by performing consistency check a...
Specular reflections present difficulties for many areas of computer vision such as stereo and segmentation. To separate specular and diffuse reflection components, previous approa...
Stephen Lin, Yuanzhen Li, Sing Bing Kang, Xin Tong...
In the last decades several cost aggregation methods aimed at improving the robustness of stereo correspondence within local and global algorithms have been proposed. Given the re...
Federico Tombari, Stefano Mattoccia, Luigi di Stef...
Belief propagation has been shown to be a powerful inference mechanism for stereo correspondence. However the classical formulation of belief propagation implicitly imposes the fr...
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...