Results 261 to 270 of about 19,312 (309)
Some of the next articles are maybe not open access.
2011 International Conference on Computer Vision, 2011
Recent local stereo matching algorithms based on an adaptive-weight strategy achieve accuracy similar to global approaches. One of the major problems of these algorithms is that they are computationally expensive and this complexity increases proportionally to the window size.
Leonardo De-Maeztu +3 more
openaire +1 more source
Recent local stereo matching algorithms based on an adaptive-weight strategy achieve accuracy similar to global approaches. One of the major problems of these algorithms is that they are computationally expensive and this complexity increases proportionally to the window size.
Leonardo De-Maeztu +3 more
openaire +1 more source
2007 IEEE 11th International Conference on Computer Vision, 2007
This paper presents two novel approaches for stereo matching. First, a bitwise algorithm for stereo matching is proposed. It represents the disparity of each pixel as a binary number, treats each bit separately and determines them step by step, each step determines one bit of the disparities and involves only a single graph cut computation.
Dengfeng Chai, Qunsheng Peng 0001
openaire +1 more source
This paper presents two novel approaches for stereo matching. First, a bitwise algorithm for stereo matching is proposed. It represents the disparity of each pixel as a binary number, treats each bit separately and determines them step by step, each step determines one bit of the disparities and involves only a single graph cut computation.
Dengfeng Chai, Qunsheng Peng 0001
openaire +1 more source
[1992] Proceedings. 11th IAPR International Conference on Pattern Recognition, 2003
Most work in pyramidal or hierarchical stereo matching has primarily used the direct coarse-to-fine or hill climbing search method. However, there are two significant problems in using the hill climbing method. First, the match at the initial scale level can be wrong. Second, the binary decision at any of the finer scale levels may be wrong.
Michael S. Lew +2 more
openaire +1 more source
Most work in pyramidal or hierarchical stereo matching has primarily used the direct coarse-to-fine or hill climbing search method. However, there are two significant problems in using the hill climbing method. First, the match at the initial scale level can be wrong. Second, the binary decision at any of the finer scale levels may be wrong.
Michael S. Lew +2 more
openaire +1 more source
Attention Stereo Matching Network
2020 25th International Conference on Pattern Recognition (ICPR), 2021Despite great progress, previous stereo matching algorithms still lack the ability to match textureless regions and slender structure areas. To tackle this problem, we propose ASM-Net, an attention stereo matching network. Attention module and disparity refinement module are constructed in the ASMNet.
Doudou Zhang +4 more
openaire +1 more source
Matching of straight line segments from aerial stereo images of urban areas
ISPRS Journal of Photogrammetry and Remote Sensing, 2012 Reliable extraction of corresponding straight lines in overlapping images can be used for different purposes such as 3D object extraction, image registration, automated triangulation, etc.
Ali Özgün Ok +2 more
exaly +2 more sources
Stereo matching with transparency and matting
Sixth International Conference on Computer Vision (IEEE Cat. No.98CH36271), 1999This paper formulates and solves a new variant of the stereo correspondence problem: simultaneously recovering the disparities, true colors, and opacities of visible surface elements. This problem arises in newer applications of stereo reconstruction, such as view interpolation and the layering of real imagery with synthetic graphics for special ...
Richard Szeliski, Polina Golland
openaire +1 more source
Maximum likelihood stereo matching
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002In the research literature, maximum likelihood principles were applied to stereo matching by altering the stereo pair so that the difference would have a Gaussian distribution. In this paper we present a novel method of applying maximum likelihood to stereo matching.
Sebe, Niculae, M. S. Lew
openaire +2 more sources
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.
Li Cheng 0001, Terry Caelli
openaire +1 more source
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.
Li Cheng 0001, Terry Caelli
openaire +1 more source
International Journal of Advanced Pervasive and Ubiquitous Computing, 2013
Determination of the depth of the image feature distinctive automation and other industries of machine vision and computer vision technology in everyday life are becoming increasingly popular. Some techniques have been proposed to extract from the current depth of a 2D image of the feature, which defines a particular object or structure of the ...
openaire +1 more source
Determination of the depth of the image feature distinctive automation and other industries of machine vision and computer vision technology in everyday life are becoming increasingly popular. Some techniques have been proposed to extract from the current depth of a 2D image of the feature, which defines a particular object or structure of the ...
openaire +1 more source
Robustness to noise of stereo matching
12th International Conference on Image Analysis and Processing, 2003.Proceedings., 2004We have measured the performance of several area-based stereo matching algorithms with noise added to synthetic images. Dense disparity maps were computed and compared with the ground truth using three metrics: the fraction of correctly computed disparities, the mean and the standard deviation of the disparity error distribution. For a noise-free image,
Philippe Leclercq, John Morris
openaire +1 more source