The Geometry and Matching of Lines and Curves Over Multiple Views
International Journal of Computer Vision
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
International Journal of Computer Vision
Real-Time Correlation-Based Stereo Vision with Reduced Border Errors
International Journal of Computer Vision
A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bilateral Filtering for Gray and Color Images
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
Adaptive Support-Weight Approach for Correspondence Search
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Comparison of Affine Region Detectors
International Journal of Computer Vision
An A Contrario Decision Method for Shape Element Recognition
International Journal of Computer Vision
A Unified Framework for Detecting Groups and Application to Shape Recognition
Journal of Mathematical Imaging and Vision
High-Quality Real-Time Stereo Using Adaptive Cost Aggregation and Dynamic Programming
3DPVT '06 Proceedings of the Third International Symposium on 3D Data Processing, Visualization, and Transmission (3DPVT'06)
Journal of Mathematical Imaging and Vision
A Theory of Shape Identification
A Theory of Shape Identification
ASIFT: A New Framework for Fully Affine Invariant Image Comparison
SIAM Journal on Imaging Sciences
Fast variable window for stereo correspondence using integral images
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Are MSER Features Really Interesting?
IEEE Transactions on Pattern Analysis and Machine Intelligence
A precise real-time stereo algorithm
Proceedings of the 27th Conference on Image and Vision Computing New Zealand
| Hi-index | 0.00 |
Block matching along epipolar lines is the core of most stereovision algorithms in geographic information systems. The usual distances between blocks are the sum of squared distances in the block (SSD) or the correlation. Minimizing these distances causes the fattening effect, by which the center of the block inherits the disparity of the more contrasted pixels in the block. This fattening error occurs everywhere in the image, and not just on strong depth discontinuities. The fattening effect at strong depth edges is a particular case of fattening, called foreground fattening effect. A theorem proved in the present paper shows that a simple and universal adaptive weighting of the SSD resolves the fattening problem at all smooth disparity points (a Spanish patent has been applied for by Universitat de Illes Balears (Reference P25155ES00, UIB, 2009)). The optimal SSD weights are nothing but the inverses of the squares of the image gradients in the epipolar direction. With these adaptive weights, it is shown that the optimal disparity function is the result of the convolution of the real disparity with a prefixed kernel. Experiments on simulated and real pairs prove that the method does what the theorem predicts, eliminating surface bumps caused by fattening. However, the method does not resolve the foreground fattening.