Comparing shapes through multi-scale approximations of the matching distance

被引：7

作者：

Cerri, Andrea ^{[1
]}

Di Fabio, Barbara ^{[2
]}

Jablonski, Grzegorz ^{[3
]}

Medri, Filippo ^{[4
]}

机构：

[1] CNR, IMATI Genova, I-00185 Rome, Italy

[2] Univ Bologna, Dipartimento Matemat, I-40126 Bologna, Italy

[3] Jagiellonian Univ, Inst Comp Sci, PL-31007 Krakow, Poland

[4] Univ Bologna, Dipartimento Sci Informaz, I-40126 Bologna, Italy

来源：

COMPUTER VISION AND IMAGE UNDERSTANDING | 2014年 / 121卷

关键词：

Persistence diagram; Bottleneck distance; Shape analysis; Dissimilarity criterion; SIZE FUNCTIONS; RECOGNITION; RETRIEVAL;

D O I：

10.1016/j.cviu.2013.11.004

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Two of the main ingredients of topological persistence for shape comparison are persistence diagrams and the matching distance. Persistence diagrams are signatures capturing meaningful properties of shapes, while the matching distance can be used to stably compare them. From the application viewpoint, one drawback of these tools is the computational cost for evaluating the matching distance. In this paper we introduce a new framework for the matching distance estimation: It preserves the reliability of the entire approach in comparing shapes, extremely reducing the computational cost. Theoretical results are supported by experiments on 3D-models.(C) 2013 Elsevier Inc. All rights reserved.

引用

页码：43 / 56

页数：14

共 34 条

[1]

[Anonymous], WORKSH STAT COMP THE

[2]

[Anonymous], 3DOR

[3]

[Anonymous], 2010, Computational topology: An introduction

[4] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING [J].