Pyramid two-level dynamic programming stereo matching algorithm

Cai He-gao · Kongzhi yu juece · 2007

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.

Read the paper · More papers on PaperTik