Skip to main navigation Skip to search Skip to main content

Local stereo matching using binary weighted normalized cross-correlation

  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Significant achievements have been attained in the field of dense stereo correspondence by local algorithms since the emergence of adaptive support weight by Yoon [1]. However, most algorithms suffer from photometric distortions and low-texture areas. In this paper, we present a novel stereo matching algorithm that can be sensitive to low-texture changes within support windows while keep insensitive to radiometric variations between left and right images. The algorithm performs Normalized Cross-Correlation with Binary Weighted support window (BWNCC) using k-nearest neighbors algorithm to resolve boundary problems. And, the proposed algorithm can be accelerated with transform domain convolution. We also propose to accelerate the BWNCC with transform domain computation. Experiment results confirm that the proposed method is robust, and has the comparable accuracy as the state-of-the-art.

Original languageEnglish
Title of host publicationSixth International Conference on Machine Vision, ICMV 2013
PublisherSPIE
ISBN (Print)9780819499967
DOIs
StatePublished - 2013
Event6th International Conference on Machine Vision, ICMV 2013 - London, United Kingdom
Duration: 16 Nov 201317 Nov 2013

Publication series

NameProceedings of SPIE - The International Society for Optical Engineering
Volume9067
ISSN (Print)0277-786X
ISSN (Electronic)1996-756X

Conference

Conference6th International Conference on Machine Vision, ICMV 2013
Country/TerritoryUnited Kingdom
CityLondon
Period16/11/1317/11/13

Keywords

  • BWNCC
  • Binary weight
  • K-nearest neighbors
  • Low texture areas
  • Normalized Cross-Correlation
  • Stereo matching

Fingerprint

Dive into the research topics of 'Local stereo matching using binary weighted normalized cross-correlation'. Together they form a unique fingerprint.

Cite this