Name
Abstract | ||
|---|---|---|
The large computational complexity makes stereo matching a big challenge in real-time application scenario. The problem of stereo matching in a video sequence is slightly different with that in a still image because there exists temporal correlation among video frames. However, no existing method considered temporal consistency of disparity for algorithm acceleration. In this work, we proposed a scheme called the dynamic disparity range (DDR) to optimize matching cost calculation and cost aggregation steps by narrowing disparity searching range, and a scheme called temporal cost aggregation path to optimize the cost aggregation step. Based on the schemes, we proposed the DDR-SGM and the DDR-MCCNN algorithms for the stereo matching in video sequences. Evaluation results showed that the proposed algorithms significantly reduced the computational complexity with only very slight loss of accuracy. We proved that the proposed optimizations for the stereo matching are effective and the temporal consistency in stereo video is highly useful for either improving accuracy or reducing computational complexity. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1587/transinf.2018EDP7273 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
stereo matching, disparity, computer vision, temporal correlation, convolutional neural network | Stereo matching,Computer vision,Pattern recognition,Computer science,Correlation,Artificial intelligence | Journal |
Volume | Issue | ISSN |
E102D | 6 | 1745-1361 |
Citations | PageRank | References |
1 | 0.38 | 0 |
Authors | ||
5 | ||