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
Y1 - 2005
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 -