Trajectory triangulation: 3D motion reconstruction with ℓ1 optimization
Lists
Only you see this
Abstract
In this paper, we first explain the formulation of the trajectory triangulation: 3D reconstruction of a moving point from a series of 2D projections. The system has to be overconstrained to be solved by least squares techniques. We take advantage of the sparseness of real-world motions in the transformed domain, and borrow the concept of compressive sampling to reformulate the problem with ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> optimization so that it is possible to reconstruct the trajectory even in an underconstrained system. Thus, fewer measurements are needed to reconstruct a 3D trajectory of even larger bandwidth coverage. We conduct experiments on both synthetic and real-world motion data to verify our proposed method, and compare the reconstruction results based on ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</inf> and ℓ <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> optimization.
BibTeX
@inproceedings{chen2011trajectory,
author = {Mingyu Chen and Ghassan Al-Regib and Biing-Hwang Juang},
title = {{Trajectory triangulation: 3D motion reconstruction with ℓ1 optimization}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2011},
doi = {10.1109/icassp.2011.5947234},
}Loading related content...