Results 271 to 280 of about 16,591 (312)

Stereo matching using Hebbian learning

IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics), 1999
This paper presents an approach to the local stereo matching problem using edge segments as features with several attributes. We have verified that the differences in attributes for the true matches cluster in a cloud around a center. The correspondence is established on the basis of the minimum distance criterion, computing the Mahalanobis distance ...
G, Pajares, J M, Cruz, J A, Lopez-Orozco
openaire   +2 more sources

Visually Imbalanced Stereo Matching

2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2020
Understanding of human vision system (HVS) has inspired many computer vision algorithms. Stereo matching, which borrows the idea from human stereopsis, has been extensively studied in the existing literature. However, scant attention has been drawn on a typical scenario where binocular inputs are qualitatively different (e.g., high-res master camera ...
Yicun Liu, Jimmy Ren, Jiawei Zhang, Jianbo Liu, Mude Lin   +4 more
openaire   +1 more source

Stereo Matching Using Belief Propagation

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002
In this paper, we formulate the stereo matching problem as a Markov network and solve it using Bayesian belief propagation. The stereo Markov network consists of three coupled Markov random fields that model the following: a smooth field for depth/disparity, a line process for depth discontinuity, and a binary process for occlusion.
null Jian Sun, null Nan-Ning Zheng, null Heung-Yeung Shum   +2 more
openaire   +1 more source

SPARSE WINDOW LOCAL STEREO MATCHING

Proceedings of the International Conference on Computer Vision Theory and Applications, 2011
We propose a new local algorithm for dense stereo matching of gray images. This algorithm is a hybrid of the pixel based and the window based matching approach; it uses a subset of pixels from the large window for matching. Our algorithm does not suffer from the common pitfalls of the window based matching.
Damjanovic, Sanja, van der Heijden, Ferdinand, Spreeuwers, Luuk J.   +2 more
openaire   +1 more source

Sub-pixel stereo matching

2010 IEEE International Geoscience and Remote Sensing Symposium, 2010
The obtention of 3D information from two images requires the perfect control of a long chain of algorithms: internal and external calibration, stereo-rectification, correlation, and finally 3D reconstruction. In this paper we focus on the improvement of the correlation step for small baseline stereo.
N. Sabater, J.M. Morel, A. Almansa
openaire   +1 more source

Stereo Matching Using Tree Filtering

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2015
Matching cost aggregation is one of the oldest and still popular methods for stereo correspondence. While effective and efficient, cost aggregation methods typically aggregate the matching cost by summing/averaging over a user-specified, local support region.
openaire   +2 more sources

Doubly-MRF stereo matching

2003 IEEE International Conference on Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP '03)., 2003
We examine a new double-layered Markov random field probabilistic framework for stereo matching and use belief propagation for approximate inference. Our initial experimental results are promising and future developments are discussed.
null Li Cheng, T. Caelli
openaire   +1 more source

Segment-based stereo matching

Computer Vision, Graphics, and Image Processing, 1985
Images are 2-dimensional projections of 3-dimensional scenes, therefore depth recovery is a crucial problem in image understanding, with applications in passive navigation, cartography, surveillance, and industrial robotics. Stereo analysis provides a more direct quantitative depth evaluation than techniques such as shape from shading, and its being ...
Gerard Medioni, Ramakant Nevatia
openaire   +1 more source

Constant Time Stereo Matching

2009 13th International Machine Vision and Image Processing Conference, 2009
Typically, local methods for stereo matching are fast but have relatively low degree of accuracy while global ones, though costly, achieve a higher degree of accuracy in retrieving disparity information. Recently, however, some local methods such as those based on segmentation or adaptive weights are suggested to possibly achieve more accuracy than ...
Myung-Ho Ju, Hang-Bong Kang
openaire   +1 more source

Neural adaptive stereo matching

Pattern Recognition Letters, 2004
The present work investigates the potential of neural adaptive learning to solve the correspondence problem within a two-frame adaptive area matching approach. A novel method is proposed based on the use of the zero mean normalized cross-correlation coefficient integrated within a neural network model which uses a least-mean-square delta rule for ...
Elisabetta Binaghi, Ignazio Gallo, Giuseppe Marino, Mario Raspanti   +3 more
openaire   +1 more source