...
首页> 外文期刊>ACM Transactions on Graphics >Structure-oriented Networks of Shape Collections
【24h】

Structure-oriented Networks of Shape Collections

机译:形状集合的面向结构的网络

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

We introduce a co-analysis technique designed for correspondencerninference within large shape collections. Such collections are naturallyrnrich in variation, adding ambiguity to the notoriously difficultrnproblem of correspondence computation. We leverage the robustnessrnof correspondences between similar shapes to address the difficultiesrnassociated with this problem. In our approach, pairs of similarrnshapes are extracted from the collection, analyzed and matchedrnin an efficient and reliable manner, culminating in the constructionrnof a network of correspondences that connects the entire collection.rnThe correspondence between any pair of shapes then amounts to arnsimple propagation along the minimax path between the two shapesrnin the network. At the heart of our approach is the introduction of arnrobust, structure-oriented shape matching method. Leveraging thernidea of projective analysis, we partition 2D projections of a shapernto obtain a set of 1D ordered regions, which are both simple andrnefficient to match. We lift the matched projections back to the 3Drndomain to obtain a pairwise shape correspondence. The emphasisrngiven to structural compatibility is a central tool in estimating thernreliability and completeness of a computed correspondence, uncoveringrnany non-negligible semantic discrepancies that may exist betweenrnshapes. These detected differences are a deciding factor inrnthe establishment of a network aiming to capture local similarities.rnWe demonstrate that the combination of the presented observationsrninto a co-analysis method allows us to establish reliable correspondencesrnamong shapes within large collections.
机译:我们介绍了一种针对大型形状集合中的对应推理设计的协同分析技术。这样的集合的变化自然很丰富,给对应计算的众所周知的难题增加了歧义。我们利用相似形​​状之间的鲁棒性对应来解决与此问题相关的困难。在我们的方法中,以有效且可靠的方式从集合中提取成对的相似形状,进行分析和匹配,最终在构建过程中形成一个连接整个集合的对应关系网络。网络中两个形状之间的minimax路径。我们方法的核心是引入硬朗的,面向结构的形状匹配方法。利用投影分析的思想,我们对形状的2D投影进行划分以获得一组一维有序区域,这些区域既简单又匹配效率高。我们将匹配的投影提升回3Drndomain,以获得成对的形状对应。强调结构兼容性是评估计算的对应关系的可靠性和完整性的重要工具,它揭示了形状之间可能存在的任何不可忽略的语义差异。这些检测到的差异是建立旨在捕获局部相似性的网络的决定因素。我们证明,将提出的观察结果与共分析方法相结合可以使我们在大型馆藏中建立可靠的对应关系。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号