Minimum Spanning Tree Pose Estimation

Abstract

The extrinsic camera parameters from video stream images can be accurately estimated by tracking features through the image sequence and using these features to compute parameter estimates. The poses for long video sequences have been estimated in this manner. However, the poses of large sets of still images cannot be estimated using the same strategy because wide-baseline correspondences are not as robust as narrow-baseline feature tracks. Moreover, video pose estimation requires a linear or hierarchically-linear ordering on the images to be calibrated, reducing the image matches to the neighboring video frames. We propose a novel generalization to the linear ordering requirement of video pose estimation by computing the Minimum Spanning Tree of the camera adjacency graph and using the tree hierarchy to determine the calibration order for a set of input images. We validate the pose accuracy using an error metric that is functionally independent of the estimation process. Because we do not rely on feature tracking for generating feature correspondences, our method can use internally calibrated wide-or narrow-baseline images as input, and can estimate the camera poses from multiple video streams without special pre-processing to concatenate the streams.

What can missing correspondences tell us about 3D structure and motion?

“…The approach presented in [22] shares several features with our proposed one: utilization of camera adjancency graphs and minimum spanning trees (MST), and the explicit validation step for camera poses. The camera adjacency graph is initially created by estimating the image similarities using a histogram measure.…”

“…Recent and very inspiring work addressing structure from motion computation for unordered sets of images includes [12,13,22]. In [12] the authors propose a system to upgrade relative poses computed for image pairs to a full 3D reconstruction.…”

“…, V N naturally induces an undirected camera adjacency graph with the edges being the verified two-view geometries (e.g. [22]). We designate such a graph as consistent, if there is no path from V i to V j for any rejected EG between V i and V j , i.e.…”