SUSAN window based cost calculation for fast stereo matching

Kyu Yeol Chae, Won P. Dong, Chang-Sung Jeong

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages947-952
Number of pages6
Volume3802 LNAI
DOIs
Publication statusPublished - 2005 Dec 1
EventInternational Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China
Duration: 2005 Dec 152005 Dec 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3802 LNAI
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Conference on Computational Intelligence and Security, CIS 2005
CountryChina
CityXi'an
Period05/12/1505/12/19

Fingerprint

Stereo Matching
Dissimilarity
Matching Algorithm
Costs and Cost Analysis
Costs
Mathematics
Dynamic programming
Occlusion
Control Parameter
Search Algorithm
Dynamic Programming
Penalty
Two Parameters
Calculate
Path
Line

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chae, K. Y., Dong, W. P., & Jeong, C-S. (2005). SUSAN window based cost calculation for fast stereo matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3802 LNAI, 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 P.; Jeong, Chang-Sung.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3802 LNAI 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 proceedingConference contribution

Chae, KY, Dong, WP & Jeong, C-S 2005, SUSAN window based cost calculation for fast stereo matching. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3802 LNAI, 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
Chae KY, Dong WP, Jeong C-S. SUSAN window based cost calculation for fast stereo matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3802 LNAI. 2005. p. 947-952. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11596981_140
Chae, Kyu Yeol ; Dong, Won P. ; Jeong, Chang-Sung. / SUSAN window based cost calculation for fast stereo matching. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3802 LNAI 2005. pp. 947-952 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@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 P.} and Chang-Sung Jeong",
year = "2005",
month = "12",
day = "1",
doi = "10.1007/11596981_140",
language = "English",
isbn = "3540308199",
volume = "3802 LNAI",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "947--952",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - SUSAN window based cost calculation for fast stereo matching

AU - Chae, Kyu Yeol

AU - Dong, Won P.

AU - Jeong, Chang-Sung

PY - 2005/12/1

Y1 - 2005/12/1

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

SN - 3540308199

SN - 9783540308195

VL - 3802 LNAI

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

SP - 947

EP - 952

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

ER -