A Quick 3D-to-2D Points Matching Based on the Perspective Projection

Authors:
Songxiang Gu;Clifford Lindsay;Michael A. Gennert;Michael A. King
Affiliations:
Worcester Polytechnic Institute, Worcester, MA 01609;Worcester Polytechnic Institute, Worcester, MA 01609;Worcester Polytechnic Institute, Worcester, MA 01609 and University of Massachusetts Medical School, Worcester, 01655;University of Massachusetts Medical School, Worcester, 01655
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
Year:
2008

Citing 10
Cited 0

Computational geometry: an introduction

Computational geometry: an introduction
Pose Determination of a Three-Dimensional Object Using Triangle Pairs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Techniques for Calibration of the Scale Factor and Image Center for High Accuracy 3-D Machine Vision Metrology

IEEE Transactions on Pattern Analysis and Machine Intelligence
A versatile camera calibration technique for high-accuracy 3D machine vision metrology using off-the-shelf TV cameras and lenses

Radiometry
Computational geometry in C

Computational geometry in C
The quickhull algorithm for convex hulls

ACM Transactions on Mathematical Software (TOMS)
A Lower Bound to Finding Convex Hulls

Journal of the ACM (JACM)
Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography

Communications of the ACM
2D-3D Registration Based on Shape Matching

MMBIA '00 Proceedings of the IEEE Workshop on Mathematical Methods in Biomedical Image Analysis
A Quick 3D-2D Registration Method for a Wide-Range of Applications

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a quick 3D-to-2D point matching algorithm. Our major contribution is to substitute a new O (2 n ) algorithm for the traditional N ! method by introducing a convex hull based enumerator. Projecting a 3D point set into a 2D plane yields a corresponding 2D point set. In some cases, matching information is lost. Therefore, we wish to recover the 3D-to-2D correspondence in order to compute projection parameters. Traditionally, an exhaustive enumerator permutes all the potential matching sets, which is N ! for N points, and a projection parameter computation is used to choose the correct one. We define "correct" as the points match whose computed parameters result in the lowest residual error. After computing the convex hull for both 2D and 3D points set, we show that the 2D convex hull must match a circuit of the 3D convex hull having the same length. Additionally a novel validation method is proposed to further reduce the number of potential matching cases. Finally, our matching algorithm is applied recursively to further reduce the search space.