Monocular 3D Tracking of Deformable Surfaces Using Linear Programming

Chenhao Wang, Xiong Li, Yuncai Liu
{"title":"Monocular 3D Tracking of Deformable Surfaces Using Linear Programming","authors":"Chenhao Wang, Xiong Li, Yuncai Liu","doi":"10.1109/ICPR.2010.423","DOIUrl":null,"url":null,"abstract":"We present a method for 3D shape reconstruction of inextensible deformable surfaces from monocular image sequences. The key of our approach is to represent the surface as 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems which can be effectively solved. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which prevent large changes of the edge orientation between consecutive frames. Furthermore, we use a refined bisection algorithm to accelerate the computing speed. The robustness and efficiency of our approach are validated on both synthetic and real data.","PeriodicalId":309591,"journal":{"name":"2010 20th International Conference on Pattern Recognition","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 20th International Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPR.2010.423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We present a method for 3D shape reconstruction of inextensible deformable surfaces from monocular image sequences. The key of our approach is to represent the surface as 3D triangulated mesh and formulate the reconstruction problem as a sequence of Linear Programming (LP) problems which can be effectively solved. The LP problem consists of data constraints which are 3D-to-2D keypoint correspondences and shape constraints which prevent large changes of the edge orientation between consecutive frames. Furthermore, we use a refined bisection algorithm to accelerate the computing speed. The robustness and efficiency of our approach are validated on both synthetic and real data.
基于线性规划的可变形曲面单目三维跟踪
提出了一种基于单眼图像序列的不可扩展变形曲面的三维形状重建方法。该方法的关键是将曲面表示为三维三角网格,并将重构问题表述为一系列可有效求解的线性规划问题。LP问题由三维到二维关键点对应的数据约束和防止连续帧之间边缘方向发生大变化的形状约束组成。此外,我们还使用了一种改进的等分算法来加快计算速度。在合成数据和实际数据上验证了该方法的鲁棒性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信