Results 201 to 210 of about 12,972 (261)
Image‐Based Spatio‐Temporal Interpolation for Split Rendering
Computer Graphics Forum, EarlyView.Abstract Low‐powered devices – such as small form factor head‐mounted displays (HMDs) – struggle to deliver a smooth and high‐quality viewing experience, due to their limited power and rendering capabilities. Cloud rendering attempts to solve the quality issue, but leads to prohibitive latency and bandwidth requirements, hindering use with HMDs over ...
M. Steiner +4 more
wiley +1 more source
OT-knn: A neighborhood-aware optimal transport framework for aligning spatial transcriptomics data. [PDF]
PLoS Comput BiolSong J, Li Q.
europepmc +1 more source
Truck Cargo Load Change Detection: Depth Map Normalization and 1D Projection Matching. [PDF]
Sensors (Basel)Park Y, Kim C, Kim Y, Park J, Ju BK.
europepmc +1 more source
Scene-Adaptive Line-Aware Visual Measurement Conditioning for Stereo Visual-Inertial Odometry. [PDF]
Sensors (Basel)Liang Y, Hang B, Li W, Yuan Y, Shen F.
europepmc +1 more source
Outdoor high-precision 3D dense mapping system based on stereo visual SLAM. [PDF]
Sci RepSu Q +5 more
europepmc +1 more source
Evaluation of our new three-dimensional navigation system in robot-assisted partial nephrectomy. [PDF]
Sci RepMagaribuchi T +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 0001
openaire +2 more sources
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 0001
openaire +2 more sources
[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 +2 more sources
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 +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.
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