Wide Baseline Parallax Image Mosaic Algorithm
Biwu Yang · 2007
A parallax image mosaic algorithm is presented.For two wide baseline parallax images whose epipolar lines are parallel with each other,the sparse correspondences can be got by detecting the local feature region by Hessian-Affine region detector,by describing the local feature region by SIFT descriptor,and by computing the Euclidean distance of the feature vectors.The sparse scene points can be got by those sparse correspondences,and the scene can be approximated as piecewise planar by those scene points.Then the scene is re-projected to create a push-broom image.The large image is got by mosaicking the push-broom image with the two original images.Example of constructing successful mosaics from real images is shown.The experiment demonstrates the feasibility of the algorithm for mosaic images with parallax.