SUSAN window based cost calculation for fast stereo matching

Kyu Yeol Chae; Won Pyo Dong; Chang Sung Jeong

doi:10.1007/11596981_140

SUSAN window based cost calculation for fast stereo matching

Kyu Yeol Chae, Won Pyo Dong, Chang Sung Jeong

School of Electrical Engineering

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

3 Citations (Scopus)

Abstract

This paper presents a fast stereo matching algorithm using SUSAN window. The response of SUSAN window is used to calculate the dissimilarity cost. From this dissimilarity cost, an initial match can be found. Then, with this initial match, a dynamic programming algorithm searches for the best path of two scan lines. Since the proposed dissimilarity cost calculation method is very simple, and does not make use of any complicated mathematic formula, its running time is almost as same as SAD in the fixed window. In addition, the proposed matching algorithm only has two control parameters, bright threshold and occlusion penalty, which make it to be easily optimized.

Original language	English
Title of host publication	Computational Intelligence and Security - International Conference, CIS 2005, Proceedings
Pages	947-952
Number of pages	6
DOIs	https://doi.org/10.1007/11596981_140
Publication status	Published - 2005
Event	International Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China Duration: 2005 Dec 15 → 2005 Dec 19

Publication series

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

Other

Other	International Conference on Computational Intelligence and Security, CIS 2005
Country/Territory	China
City	Xi'an
Period	05/12/15 → 05/12/19

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/11596981_140

Cite this

Chae, K. Y., Dong, W. P., & Jeong, C. S. (2005). SUSAN window based cost calculation for fast stereo matching. In Computational Intelligence and Security - International Conference, CIS 2005, Proceedings (pp. 947-952). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3802 LNAI). https://doi.org/10.1007/11596981_140

SUSAN window based cost calculation for fast stereo matching. / Chae, Kyu Yeol; Dong, Won Pyo; Jeong, Chang Sung.
Computational Intelligence and Security - International Conference, CIS 2005, Proceedings. 2005. p. 947-952 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3802 LNAI).

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

Chae, KY, Dong, WP & Jeong, CS 2005, SUSAN window based cost calculation for fast stereo matching. in Computational Intelligence and Security - International Conference, CIS 2005, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3802 LNAI, pp. 947-952, International Conference on Computational Intelligence and Security, CIS 2005, Xi'an, China, 05/12/15. https://doi.org/10.1007/11596981_140

@inproceedings{259d3d19216a4a7d82c7cebd9d8ee552,

title = "SUSAN window based cost calculation for fast stereo matching",

abstract = "This paper presents a fast stereo matching algorithm using SUSAN window. The response of SUSAN window is used to calculate the dissimilarity cost. From this dissimilarity cost, an initial match can be found. Then, with this initial match, a dynamic programming algorithm searches for the best path of two scan lines. Since the proposed dissimilarity cost calculation method is very simple, and does not make use of any complicated mathematic formula, its running time is almost as same as SAD in the fixed window. In addition, the proposed matching algorithm only has two control parameters, bright threshold and occlusion penalty, which make it to be easily optimized.",

author = "Chae, {Kyu Yeol} and Dong, {Won Pyo} and Jeong, {Chang Sung}",

year = "2005",

doi = "10.1007/11596981_140",

language = "English",

isbn = "3540308199",

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

pages = "947--952",

booktitle = "Computational Intelligence and Security - International Conference, CIS 2005, Proceedings",

note = "International Conference on Computational Intelligence and Security, CIS 2005 ; Conference date: 15-12-2005 Through 19-12-2005",

}

TY - GEN

T1 - SUSAN window based cost calculation for fast stereo matching

AU - Chae, Kyu Yeol

AU - Dong, Won Pyo

AU - Jeong, Chang Sung

PY - 2005

Y1 - 2005

N2 - This paper presents a fast stereo matching algorithm using SUSAN window. The response of SUSAN window is used to calculate the dissimilarity cost. From this dissimilarity cost, an initial match can be found. Then, with this initial match, a dynamic programming algorithm searches for the best path of two scan lines. Since the proposed dissimilarity cost calculation method is very simple, and does not make use of any complicated mathematic formula, its running time is almost as same as SAD in the fixed window. In addition, the proposed matching algorithm only has two control parameters, bright threshold and occlusion penalty, which make it to be easily optimized.

AB - This paper presents a fast stereo matching algorithm using SUSAN window. The response of SUSAN window is used to calculate the dissimilarity cost. From this dissimilarity cost, an initial match can be found. Then, with this initial match, a dynamic programming algorithm searches for the best path of two scan lines. Since the proposed dissimilarity cost calculation method is very simple, and does not make use of any complicated mathematic formula, its running time is almost as same as SAD in the fixed window. In addition, the proposed matching algorithm only has two control parameters, bright threshold and occlusion penalty, which make it to be easily optimized.

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

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

U2 - 10.1007/11596981_140

DO - 10.1007/11596981_140

M3 - Conference contribution

AN - SCOPUS:33646853886

SN - 3540308199

SN - 9783540308195

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

SP - 947

EP - 952

BT - Computational Intelligence and Security - International Conference, CIS 2005, Proceedings

T2 - International Conference on Computational Intelligence and Security, CIS 2005

Y2 - 15 December 2005 through 19 December 2005

ER -

SUSAN window based cost calculation for fast stereo matching

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this