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 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 1277-1280 |
| Number of pages | 4 |
| Volume | 3809 LNAI |
| DOIs | |
| 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) | 03029743 |
| ISSN (Electronic) | 16113349 |
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
- Biochemistry, Genetics and Molecular Biology(all)
- Computer Science(all)
- Theoretical Computer Science
Cite this
A stereo matching using variable windows and dynamic programming. / Dong, Won P.; Lee, Yun Seok; Jeong, Chang-Sung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3809 LNAI 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
}
TY - GEN
T1 - A stereo matching using variable windows and dynamic programming
AU - Dong, Won P.
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
VL - 3809 LNAI
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1277
EP - 1280
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -