Filters








860 Hits in 5.3 sec

An optimal time–space algorithm for dense stereo matching

Gutemberg Guerra-Filho
2010 Journal of Real-Time Image Processing  
In this paper, we survey several classic stereo matching algorithms with regards to time-space complexity.  ...  We present a new dense stereo matching algorithm based on a greedy heuristic path computation in disparity space.  ...  Therefore, the next node in the path may represent a continuous match (c = (n x + 1, n y + 1)) or a potential occlusion (o + = (n x + 1, n y ) and o − = (n x , n y + 1)).  ... 
doi:10.1007/s11554-010-0161-x fatcat:j3wbfiyogzf55ee2kotpp6khrq

AN IMPROVED ENERGY SEGMENTATION BASED STEREO MATCHING ALGORITHM

J. Xiao, L. Yang, J. Zhou, H. Li, B. Li, L. Ding
2022 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
The invalid matching pixels are interpolated with vertical-horizontal nearest neighboring pixels to keep the consistency of stereo image pairs in the initial disparity map.  ...  The stereo matching algorithm is commonly used in dealing with disparity discontinuous areas. However, the algorithm may have higher computational complexity and lack of well-aligned input images.  ...  The numerical calculations in this article have been done on the supercomputing system in the Supercomputing Center of Wuhan University.  ... 
doi:10.5194/isprs-annals-v-1-2022-93-2022 fatcat:tjcdb4uicnfhfbbnwa7hbapozm

Continuous 3D Label Stereo Matching using Local Expansion Moves

Tatsunori Taniai, Yasuyuki Matsushita, Yoichi Sato, Takeshi Naemura
2017 IEEE Transactions on Pattern Analysis and Machine Intelligence  
We present an accurate stereo matching method using local expansion moves based on graph cuts.  ...  Even using a simple pairwise MRF, our method is shown to have best performance in the Middlebury stereo benchmark V2 and V3.  ...  This work was supported by JSPS KAKENHI Grant Number 14J09001.  ... 
doi:10.1109/tpami.2017.2766072 pmid:29989964 fatcat:cwepd6ke3zerbputvud7hm3h6e

Adaptive stereo matching via loop-erased random walk

Xuejiao Bai, Xuan Luo, Shuo Li, Hongtao Lu
2014 2014 IEEE International Conference on Image Processing (ICIP)  
Index Terms-Loop-erased random walk, adaptive support window, tree-based cost aggregation, stereo matching  ...  The previous tree-based algorithms [1, 2] , hindered by the greediness of minimum spanning tree (MST), provide poorly adaptive support windows and have bad performance on curved and slanted surfaces.  ...  LERW-1: LERW-based aggregation + refinement in MST [1] ; LERW-2: LERW-based aggregation + LERW-based refinement. for stereo matching.  ... 
doi:10.1109/icip.2014.7025769 dblp:conf/icip/BaiLLL14 fatcat:cuzn3cydrnb6vmk2fp24o7fsnm

High Quality Structure from Small Motion for Rolling Shutter Cameras

Sunghoon Im, Hyowon Ha, Gyeongmin Choe, Hae-Gon Jeon, Kyungdon Joo, In So Kweon
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Additionally, we present a depth propagation method to fill in the holes associated with the unknown pixels based on our novel geometric guidance model.  ...  Depth estimation from small motion has gained interest as a means of various photographic editing, but important limitations present themselves in the form of depth uncertainty due to a narrow baseline  ...  [ 31] propose a closed-form linear least square approximation to propagate ground control points in stereo matching. Park et al.  ... 
doi:10.1109/iccv.2015.102 dblp:conf/iccv/ImHCJJK15 fatcat:zw6m5s55o5hopngcaredep5wp4

A Roadmap to the Integration of Early Visual Modules

Abhijit S. Ogale, Yiannis Aloimonos
2006 International Journal of Computer Vision  
correspondence (i.e., stereo matching and optical flow).  ...  In this paper, we present compositional algorithms which can match images containing slanted surfaces and images having different contrast, while simultaneously solving other problems as part of the same  ...  Acknowledgements The support of the National Science Foundation is gratefully acknowledged. Figure 1 . 1 A random dot stereo pair.  ... 
doi:10.1007/s11263-006-8890-9 fatcat:7ltr3ru26bfhtnmt5zdgr24wue

:{unav)

Daniel Scharstein, Richard Szeliski
2012 International Journal of Computer Vision  
Stereo matching is one of the most active research areas in computer vision.  ...  In this paper, we present a taxonomy of dense, two-frame stereo methods designed to assess the different components and design decisions made in individual stereo algorithms.  ...  This research was supported in part by NSF CAREER grant 9984485. Anandan, P. (1989). A computational framework and an algorithm for the measurement of visual motion.  ... 
doi:10.1023/a:1014573219977 fatcat:ew3wgiaj4rb7xi43enjyyvpydi

Efficient Dense Stereo with Occlusions for New View-Synthesis by Four-State Dynamic Programming

A. Criminisi, A. Blake, C. Rother, J. Shotton, P. H. S. Torr
2006 International Journal of Computer Vision  
The two main contributions of this paper are: i) a new four state matching graph for dense stereo dynamic programming, that supports accurate occlusion labelling; ii) a compact geometric derivation for  ...  A number of examples demonstrate the robustness of four-state DP to artefacts in stereo video streams.  ...  While the GC framework in [KZ01] supports runs of occlusions, these are not correctly modeled in the sense that occluded moves are used to approximate slanted surfaces.  ... 
doi:10.1007/s11263-006-8525-1 fatcat:yckdlmphd5eszbxdbllpsbzkhm

Depth propagation and surface construction in 3-D vision

Mark A. Georgeson, Tim A. Yates, Andrew J. Schofield
2009 Vision Research  
In stereo vision, regions with ambiguous or unspecified disparity can acquire perceived depth from unambiguous regions. This has been called stereo capture, depth interpolation or surface completion.  ...  When the test image was horizontal 1-D noise, shown to one eye or to both eyes without disparity, it appeared corrugated in much the same way as the disparity-modulated (DM) flanking regions.  ...  Acknowledgment We thank the Engineering and Physical Sciences Research Council (U.K.) for grant support (GR/S07254/01, GR/S07261/01).  ... 
doi:10.1016/j.visres.2008.09.030 pmid:18977239 fatcat:rznexvcudndepcrgmg74xdp5ze

CrossPatch-Based Rolling Label Expansion for Dense Stereo Matching

Huaiyuan Xu, Xiaodong Chen, Haitao Liang, Siyu Ren, Yi Wang, Huaiyu Cai
2020 IEEE Access  
The experimental results show the high matching accuracy of our method, both in pixel level and subpixel level.  ...  We present a novel algorithm called crosspatch-based rolling label expansion for accurate stereo matching.  ...  The guide filter weight has a small computation complexity with a value of O (1), which means it is independent of the size of support window, and it helps to speed up the algorithm. 2) SMOOTHNESS TERM  ... 
doi:10.1109/access.2020.2985106 fatcat:b6g2vwlukjcr5lanhkt7rcbnl4

A New Extension of the Rank Transform for Stereo Matching

Ge Zhao, Ying Kui Du, Yan Dong Tang
2011 Advanced Engineering Forum  
Stereo matching methods often use rank transform to deal with image distortions and brightness differences prior to matching but a pixel in the rank transformed image may look more similar to its neighbor  ...  Secondly, we propose a new Bayesian stereo matching model by not only considering the similarity between left and right image pixels but also considering the ambiguity level of them in their own image  ...  Acknowledgment This work was supported by Natural Science Foundation of China (No. 60805046 and 60835004) .  ... 
doi:10.4028/www.scientific.net/aef.2-3.182 fatcat:f3rubrl4hffyzdrijyr6ctajae

Real-time stereo vision system using adaptive weight cost aggregation approach

Jingting Ding, Jilin Liu, Wenhui Zhou, Haibin Yu, Yanchang Wang, Xiaojin Gong
2011 EURASIP Journal on Image and Video Processing  
Due to the complexity of the matching process, most real-time stereo applications rely on local algorithms in the disparity computation.  ...  These local algorithms generally suffer from matching ambiguities as it is difficult to find appropriate support for each pixel.  ...  The authors would also like to acknowledge the financial support from the National Natural Science Foundation of China via grant 61001171, 60534070, and 90820306, and the Natural Science Foundation of  ... 
doi:10.1186/1687-5281-2011-20 fatcat:7vefm436nrgzzlogn7557nutha

Massively Parallel Multiview Stereopsis by Surface Normal Diffusion

Silvano Galliani, Katrin Lasinger, Konrad Schindler
2015 2015 IEEE International Conference on Computer Vision (ICCV)  
Our method uses a slanted support window and thus has no fronto-parallel bias; it is completely local and parallel, such that computation time scales linearly with image size, and inversely proportional  ...  We present a new, massively parallel method for highquality multiview matching.  ...  Like the original Patchmatch stereo, the method is based on slanted planes, and therefore allows slanted support windows without fronto-parallel bias.  ... 
doi:10.1109/iccv.2015.106 dblp:conf/iccv/GallianiLS15 fatcat:ut5e7jomorervnewnjguuwqoqe

Real-Time Stereo Matching on CUDA Using an Iterative Refinement Method for Adaptive Support-Weight Correspondences

Jędrzej Kowalczuk, Eric T. Psota, Lance C. Perez
2013 IEEE transactions on circuits and systems for video technology (Print)  
A novel real-time stereo matching method is presented that uses a two-pass approximation of adaptive support-weight aggregation, and a low-complexity iterative disparity refinement technique.  ...  Results show that the proposed method is the most accurate among all of the real-time stereo matching methods listed on the Middlebury stereo benchmark.  ...  Adaptive Support-Weight Stereo Matching Adaptive support weights were introduced in 2005 as a new way of aggregating the cost of window-based stereo matching [5] .  ... 
doi:10.1109/tcsvt.2012.2203200 fatcat:wmb5bynbqjfkfc6usyr5dk4w4m

Geometry based three-dimensional image processing method for electronic cluster eye

Sidong Wu, Gexiang Zhang, Ming Zhu, Tao Jiang, Ferrante Neri
2018 Integrated Computer-Aided Engineering  
To obtain a complete image with a full FOV, the images from all the optical channels are required to be fused together.  ...  In G3D, we derive the geometry relationship of optical channels in eCley to obtain the mathematical relation between the parallax and depth among unparallel neighboring optical channels.  ...  g and Σ g are 3 × 1 mean vector and 3 × 3 covariance matrix of colors in a window ϑ g , respectively.  ... 
doi:10.3233/ica-180564 fatcat:r3vljllpj5eitdf2x2zkxbzq6a
« Previous Showing results 1 — 15 out of 860 results