Real-time temporal stereo matching using iterative adaptive support weights

Jȩdrzej Kowalczuk, Eric T. Psota, Lance C. Pérez

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publication2013 IEEE International Conference on Electro/Information Technology, EIT 2013
DOIs
StatePublished - 2013
Event2013 IEEE International Conference on Electro/Information Technology, EIT 2013 - Rapid City, SD, United States
Duration: May 9 2013May 11 2013

Publication series

NameIEEE International Conference on Electro Information Technology
ISSN (Print)2154-0357
ISSN (Electronic)2154-0373

Other

Other2013 IEEE International Conference on Electro/Information Technology, EIT 2013
Country/TerritoryUnited States
CityRapid City, SD
Period5/9/135/11/13

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Real-time temporal stereo matching using iterative adaptive support weights'. Together they form a unique fingerprint.

Cite this