Non-rigid registration with reliable distance field for dynamic shape completion

Kent Fujiwara, Hiroshi Kawasaki, R. Sagawa, K. Ogawara, K. Ikeuchi
{"title":"Non-rigid registration with reliable distance field for dynamic shape completion","authors":"Kent Fujiwara, Hiroshi Kawasaki, R. Sagawa, K. Ogawara, K. Ikeuchi","doi":"10.1109/3DV.2014.111","DOIUrl":null,"url":null,"abstract":"We propose a non-rigid registration method for completion of dynamic shapes with occlusion. Our method is based on the idea that an occluded region in a certain frame should be visible in another frame and that local regions should be moving rigidly when the motion is small. We achieve this with a novel reliable distance field (DF) for non-rigid registration with missing regions. We first fit a pseudo-surface onto the input shape using a surface reconstruction method. We then calculate the difference between the DF of the input shape and the pseudo-surface. We define the areas with large difference as unreliable, as these areas indicate that the original shape cannot be found nearby. We then conduct non-rigid registration using local rigid transformations to match the source and target data at visible regions and maintain the original shape as much as possible in occluded regions. The experimental results demonstrate that our method is capable of accurately filling in the missing regions using the shape information from prior or posterior frames. By sequentially processing the data, our method is also capable of completing an entire sequence with missing regions.","PeriodicalId":275516,"journal":{"name":"2014 2nd International Conference on 3D Vision","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd International Conference on 3D Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3DV.2014.111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We propose a non-rigid registration method for completion of dynamic shapes with occlusion. Our method is based on the idea that an occluded region in a certain frame should be visible in another frame and that local regions should be moving rigidly when the motion is small. We achieve this with a novel reliable distance field (DF) for non-rigid registration with missing regions. We first fit a pseudo-surface onto the input shape using a surface reconstruction method. We then calculate the difference between the DF of the input shape and the pseudo-surface. We define the areas with large difference as unreliable, as these areas indicate that the original shape cannot be found nearby. We then conduct non-rigid registration using local rigid transformations to match the source and target data at visible regions and maintain the original shape as much as possible in occluded regions. The experimental results demonstrate that our method is capable of accurately filling in the missing regions using the shape information from prior or posterior frames. By sequentially processing the data, our method is also capable of completing an entire sequence with missing regions.
具有可靠距离场的非刚性配准,用于动态形状补全
提出了一种非刚性配准方法,用于遮挡动态形状的补全。我们的方法是基于这样的思想,即某一帧中被遮挡的区域在另一帧中应该是可见的,并且当运动很小时,局部区域应该是刚性运动的。我们用一种新颖的可靠距离场(DF)来实现缺失区域的非刚性配准。我们首先使用曲面重建方法将伪曲面拟合到输入形状上。然后,我们计算输入形状的DF与伪曲面之间的差。我们将差异较大的区域定义为不可靠区域,因为这些区域表明附近找不到原始形状。然后,我们使用局部刚性变换进行非刚性配准,在可见区域匹配源数据和目标数据,在遮挡区域尽可能保持原始形状。实验结果表明,我们的方法能够利用先验或后验帧的形状信息准确地填充缺失区域。通过对数据进行顺序处理,我们的方法还能够完成缺失区域的整个序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信