A stereo matching using variable windows and dynamic programming

Won Pyo Dong, Yun Seok Lee, Chang Sung Jeong

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

In this paper, we present a segment-based stereo matching algorithm using adaptive variable windows and dynamic programming with a robust disparity. We solve the problem of window shape and size using adaptive line masks and adaptive rectangular windows which are constrained by segments and visibility that reduces ambiguity produced by the occlusion in the computation window. In dynamic programming, we also propose the method that selects an efficient occlusion penalty.

Original languageEnglish
Title of host publicationAI 2005
Subtitle of host publicationAdvances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings
Pages1277-1280
Number of pages4
DOIs
Publication statusPublished - 2005
Event18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence - Sydney, Australia
Duration: 2005 Dec 5 → 2005 Dec 9

Publication series

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

Other

Other18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence
CountryAustralia
CitySydney
Period05/12/5 → 05/12/9

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Access to Document

Other files and links

Fingerprint Dive into the research topics of 'A stereo matching using variable windows and dynamic programming'. Together they form a unique fingerprint.

Cite this