By Topic

Monocular 3-D Tracking of Inextensible Deformable Surfaces Under L_2 -Norm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shuhan Shen ; Institute of Image Processing and Pattern Recognition, A0603291, Shanghai Jiao Tong University, Shanghai, P.R. China ; Wenhuan Shi ; Yuncai Liu

We present a method for recovering the 3-D shape of an inextensible deformable surface from a monocular image sequence. State-of-the-art methods on this problem, utilize L ??-norm of reprojection residual vectors and formulate the tracking problem as a Second-Order Cone Programming (SOCP) problem. Instead of using L ?? which is sensitive to outliers, we use L 2-norm of reprojection errors. Generally, using L 2 leads a nonconvex optimization problem which is difficult to minimize. Instead of solving the nonconvex problem directly, we design an iterative L 2-norm approximation process to approximate the nonconvex objective function, in which only a linear system needs to be solved at each iteration. Furthermore, we introduce a shape regularization term into this iterative process in order to keep the inextensibility of the recovered mesh. Compared with previous methods, ours performs more robust to image noises, outliers and large interframe motions with high computational efficiency. The robustness and accuracy of our approach are evaluated quantitatively on synthetic data and qualitatively on real data.

Published in:

IEEE Transactions on Image Processing  (Volume:19 ,  Issue: 2 )