Dense Pixel Matching between Unrectified and Distorted Images using Dynamic Programming

Abstract

In this paper, a novel framework for dense pixel matching based on dynamic programming is introduced. Unlike most techniques proposed in the literature, our approach assumes neither known camera geometry nor the availability of rectified images. Under such conditions, the matching task cannot be reduced to finding correspondences between a pair of scanlines. We propose to extend existing dynamic programming methodologies to a larger dimensional space by using a 3D scoring matrix so that correspondences between a line and a whole image can be calculated. After assessing our framework on a standard evaluation dataset of rectified stereo images, experiments are conducted on unrectified and non-linearly distorted images. Results validate our new approach and reveal the versatility of our algorithm.

Extracted Key Phrases

Cite this paper

@inproceedings{Thvenon2012DensePM, title={Dense Pixel Matching between Unrectified and Distorted Images using Dynamic Programming}, author={J{\'e}r{\^o}me Th{\'e}venon and Jes{\'u}s Mart{\'i}nez del Rinc{\'o}n and Romain Dieny and Jean-Christophe Nebel}, booktitle={VISAPP}, year={2012} }