A stereo matching using variable windows and dynamic programming

Won Pyo Dong; Yun Seok Lee; Chang Sung Jeong

doi:10.1007/11589990_186

A stereo matching using variable windows and dynamic programming

Won Pyo Dong, Yun Seok Lee, Chang Sung Jeong

School of Electrical Engineering

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 language	English
Title of host publication	AI 2005
Subtitle of host publication	Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings
Pages	1277-1280
Number of pages	4
DOIs	https://doi.org/10.1007/11589990_186
Publication status	Published - 2005 Dec 1
Event	18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence - Sydney, Australia Duration: 2005 Dec 5 → 2005 Dec 9

Publication series

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

Other

Other	18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence
Country	Australia
City	Sydney
Period	05/12/5 → 05/12/9

Fingerprint

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

Dong, W. P., Lee, Y. S., & Jeong, C. S. (2005). A stereo matching using variable windows and dynamic programming. In AI 2005: Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings (pp. 1277-1280). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3809 LNAI). https://doi.org/10.1007/11589990_186

A stereo matching using variable windows and dynamic programming. / Dong, Won Pyo; Lee, Yun Seok; Jeong, Chang Sung.

AI 2005: Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings. 2005. p. 1277-1280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3809 LNAI).

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

Dong, WP, Lee, YS & Jeong, CS 2005, A stereo matching using variable windows and dynamic programming. in AI 2005: Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3809 LNAI, pp. 1277-1280, 18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence, Sydney, Australia, 05/12/5. https://doi.org/10.1007/11589990_186

Dong WP, Lee YS, Jeong CS. A stereo matching using variable windows and dynamic programming. In AI 2005: Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings. 2005. p. 1277-1280. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11589990_186

Dong, Won Pyo ; Lee, Yun Seok ; Jeong, Chang Sung. / A stereo matching using variable windows and dynamic programming. AI 2005: Advances in Artificial Intelligence - 18th Australian Joint Conference on Artificial Intelligence, Proceedings. 2005. pp. 1277-1280 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{ad021ba0bb2a460b94e9a201150e9d65,

title = "A stereo matching using variable windows and dynamic programming",

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.",

author = "Dong, {Won Pyo} and Lee, {Yun Seok} and Jeong, {Chang Sung}",

year = "2005",

month = dec

day = "1",

doi = "10.1007/11589990_186",

language = "English",

isbn = "3540304622",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "1277--1280",

booktitle = "AI 2005",

note = "18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence ; Conference date: 05-12-2005 Through 09-12-2005",

}

TY - GEN

T1 - A stereo matching using variable windows and dynamic programming

AU - Dong, Won Pyo

AU - Lee, Yun Seok

AU - Jeong, Chang Sung

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33745584664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33745584664&partnerID=8YFLogxK

U2 - 10.1007/11589990_186

DO - 10.1007/11589990_186

M3 - Conference contribution

AN - SCOPUS:33745584664

SN - 3540304622

SN - 9783540304623

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1277

EP - 1280

BT - AI 2005

T2 - 18th Australian Joint Conference on Artificial Intelligence, AI 2005: Advances in Artificial Intelligence

Y2 - 5 December 2005 through 9 December 2005

ER -

Access to Document

10.1007/11589990_186