A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
An optimal time–space algorithm for dense stereo matching
2010
Journal of Real-Time Image Processing
The increasing demand for higher resolution images and higher frame rate videos will always pose a challenge to computational power when real-time performance is required to solve the stereo matching problem in 3D reconstruction applications. Therefore, the use of asymptotic analysis is necessary to measure the time and space performance of stereo matching algorithms regardless of the size of the input and of the computational power available. In this paper, we survey several classic stereo
doi:10.1007/s11554-010-0161-x
fatcat:j3wbfiyogzf55ee2kotpp6khrq