Perceptually based approach for planar shape morphing

Ligang Liu, Guopu Wang, Bo Zhang, B. Guo, H. Shum
{"title":"Perceptually based approach for planar shape morphing","authors":"Ligang Liu, Guopu Wang, Bo Zhang, B. Guo, H. Shum","doi":"10.1109/PCCGA.2004.1348341","DOIUrl":null,"url":null,"abstract":"This paper presents an approach for establishing vertex correspondences between two planar shapes. Correspondences are established between the perceptual feature points extracted from both source and target shapes. A similarity metric between two feature points is defined using the intrinsic properties of their local neighborhoods. The optimal correspondence is found by an efficient dynamic programming technique. Our approach treats shape noise by allowing discarding small feature points, which introduces skips in the traversal of the dynamic programming graph. Our method is fast, feature preserving, and invariant to geometric transformations. We demonstrate the superiority of our approach over other approaches by experimental results.","PeriodicalId":264796,"journal":{"name":"12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCGA.2004.1348341","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55

Abstract

This paper presents an approach for establishing vertex correspondences between two planar shapes. Correspondences are established between the perceptual feature points extracted from both source and target shapes. A similarity metric between two feature points is defined using the intrinsic properties of their local neighborhoods. The optimal correspondence is found by an efficient dynamic programming technique. Our approach treats shape noise by allowing discarding small feature points, which introduces skips in the traversal of the dynamic programming graph. Our method is fast, feature preserving, and invariant to geometric transformations. We demonstrate the superiority of our approach over other approaches by experimental results.
基于感知的平面形状变形方法
本文提出了一种建立两个平面形状之间顶点对应关系的方法。从源形状和目标形状中提取的感知特征点之间建立对应关系。利用两个特征点的局部邻域的固有属性定义两个特征点之间的相似度度量。通过一种高效的动态规划技术,找到了最优对应关系。我们的方法通过允许丢弃小特征点来处理形状噪声,这在动态规划图的遍历中引入了跳过。该方法具有快速、特征保持、几何变换不变性等特点。我们用实验结果证明了我们的方法比其他方法的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信