Skip to main navigation Skip to search Skip to main content

Pyramid two-level dynamic programming stereo matching algorithm

  • Jie Zhao*
  • , Shu Chun Yu
  • , He Gao Cai
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Contribution to journalArticlepeer-review

Abstract

To the problems of dynamic programming stereo matching algorithm modified by ground control points (GCPs), a pyramid two-level dynamic programming stereo matching algorithm is proposed. The low-resolution images and high-resolution images are gained by pyramid algorithm. Then, candidate GCPs and ultima GCPs are obtained from low-resolution and high-resolution images. Dynamic programming stereo matching algorithm in high-resolution images is directed by ultima GCPs. Total time of this algorithm is reduced because candidate GCPs are gained in low-resolution images. Experiments show that the algorithm has a high maching-rate and a fast speed.

Original languageEnglish
Pages (from-to)69-72+77
JournalKongzhi yu Juece/Control and Decision
Volume22
Issue number1
StatePublished - Jan 2007

Keywords

  • Dynamic programming
  • Ground control points (GCPs)
  • Stereo matching
  • Vision-navigation

Fingerprint

Dive into the research topics of 'Pyramid two-level dynamic programming stereo matching algorithm'. Together they form a unique fingerprint.

Cite this