Fast stereo matching in compressed video

Michael S. Brown, W. Brent Seales

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In this paper we present new algorithms that exploit compressed image data to achieve coarse stereo reconstructions in a realtime environment. Others have shown large gains from processing image streams in compressed form, and we extend those results to address the stereo correspondence problem. We show that it is possible to obtain stereo matches between two frames of a compressed video stream in approximately the same time it takes to fully decompress just one image.

Original languageEnglish
Title of host publicationComputer Vision - ACCV 1998 - 3rd Asian Conference on Computer Vision, Proceedings
EditorsRoland Chin, Ting-Chuen Pong
Number of pages8
StatePublished - 1997
Event3rd Asian Conference on Computer Vision, ACCV 1998 - Hong Kong, China
Duration: Jan 8 1998Jan 10 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd Asian Conference on Computer Vision, ACCV 1998
CityHong Kong

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.


  • Compresseddomain
  • Compression
  • Depth reconstruction
  • Real-time
  • Stereo

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'Fast stereo matching in compressed video'. Together they form a unique fingerprint.

Cite this