Real-time temporal stereo matching using iterative adaptive support weights
Real-time temporal stereo matching using iterative adaptive support weights
复制标题
DOI：
10.1109/eit.2013.6632688
复制
发表时间：
2013-05
期刊：
影响因子：
--
通讯作者：
J. Kowalczuk;E. Psota;L. C. Pérez
中科院分区：
文献类型：
--
作者：
J. Kowalczuk;E. Psota;L. C. Pérez
立体匹配算法几乎总是设计为在单个图像对之间找到匹配。提出了一种专门设计用于对图像序列进行操作的方法。该方法同时考虑了图像点在空间和时间域的匹配代价。为了保持实时操作，使用时间成本聚合方法来评估匹配的可能性，该方法相对于所考虑的先前图像的数量是不变的。该方法已在大规模并行GPU硬件上实现，并在Middlebury立体性能基准测试中被评为最快、最准确的实时立体匹配方法之一。
Stereo matching algorithms are nearly always designed to find matches between a single pair of images. A method is presented that was specifically designed to operate on sequences of images. This method considers the cost of matching image points in both the spatial and temporal domain. To maintain real-time operation, a temporal cost aggregation method is used to evaluate the likelihood of matches that is invariant with respect to the number of prior images being considered. This method has been implemented on massively parallel GPU hardware, and the implementation ranks as one of the fastest and most accurate real-time stereo matching methods as measured by the Middlebury stereo performance benchmark.