Results 261 to 270 of about 16,591 (312)
Generalization Evaluation of Deep Stereo Matching Methods for UAV-Based Forestry Applications
Lin, Yida +4 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Stereo matching of remote sensing images using deep stereo matching
Image and Signal Processing for Remote Sensing XXVII, 2021Very high resolution satellite images can be used to generate stereoscopic digital elevation models (DEMs), efficiently and at scale, as exemplified by the upcoming CO3D mission, which aims to produce worldwide DEMs by the end of 2025. In this paper we present a deep learning stereo-vision algorithm, integrated in the Stereo Pipeline for Pushbroom ...
Mang Chen +3 more
openaire +1 more source
Collaborative semi-global stereo matching
Applied Optics, 2021Efficiency and accuracy of semi-global matching (SGM) make it outperform many stereo matching algorithms and is widely used under challenging occasions. However, SGM only incorporates information along a scanline in each pass and lacks interaction between scanlines, resulting in streak artifacts in the disparity image.
Penghui, Bu +3 more
openaire +2 more sources
Procedings of the Alvey Vision Conference 1989, 1989
Abstract A stereo algorithm which matches connected chains of edgels (curves) between images is described. It is based on representing the curves as elastic strings/snakes, and measuring the amount of deformation the strings have to undergo to transform between corresponding curves, and incorporates the ideas of the disparity gradient, and the fact ...
Andrew T Brint, Michael Brady
openaire +1 more source
Abstract A stereo algorithm which matches connected chains of edgels (curves) between images is described. It is based on representing the curves as elastic strings/snakes, and measuring the amount of deformation the strings have to undergo to transform between corresponding curves, and incorporates the ideas of the disparity gradient, and the fact ...
Andrew T Brint, Michael Brady
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
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.
L. 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.
L. De Maeztu +3 more
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.
M.S. Lew, K.W. Wong, T.S. Huang
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.
M.S. Lew, K.W. Wong, T.S. Huang
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
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
openaire +1 more source
Stereo matching precedes dichoptic masking
Vision Research, 1994Stereo matching can intervene to prevent dichoptic masking. In a dichoptic masking paradigm we measured the contrast threshold for a bar target, presented to one eye, as a function of the contrast of an identical masking bar, presented at retinal correspondence in the other eye. Confirming previous studies of dichoptic masking with sinusoidal gratings,
S P, McKee +3 more
openaire +2 more sources
Parallel epipolar stereo matching
Proceedings 15th International Conference on Pattern Recognition. ICPR-2000, 2002Stereo matching is an important step in 3D reconstruction which is not yet solved satisfactorily. Efforts are necessary to enhance the matching quality and to reduce the processing time. To speed up the processing a parallel algorithm for coarse binocular epipolar image matching is presented.
openaire +2 more sources