arrow
返回

Intrinsic shape matching via tensor-based optimization

delete2019-02-01
delete3
PRE
AI
O
Oussama Remil
谢
谢谦 (Qian Xie)
Q
Qiaoyun Wu
Y
Yanwen Guo
王俊 封面图
王俊 (Jun Wang) *
DOI:10.1016/j.cad.2018.10.001delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper presents a simple yet efficient framework for finding a set of sparse correspondences between two non-rigid shapes using a tensor-based optimization technique. To make the matching consistent, we propose to use third-order potentials to define the similarity tensor measure between triplets of feature points. Given two non-rigid 3D models, we first extract two sets of feature points residing in shape extremities, and then build the similarity tensor as a combination of the geodesic-based and prior based similarities. The hyper-graph matching problem is formulated as the maximization of an objective function over all possible permutations of points, and it is solved by a tensor power iteration technique, which involves row/column normalization. Finally, a consistent set of discrete correspondences is automatically obtained. Various experimental results have demonstrated the superiority of our proposed method, compared with several state-of-the-art methods. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Sparse correspondences
Similarity tensor
Tensor power iteration
Third-order potentials
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computer-Aided Design
IF:
3.1
论文数:
3.1K
被引数:
6.4K

机构

N
nanjing university
学者数:
7.8W
论文数: 5.6W
被引数: 87
引用论文

引用论文

The farthest point strategy for progressive image sampling
err1997-09-01
err404
PREAI
errEldar, Y; Lindenbaum, M; Porat, M; Zeevi, YY
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容