Multi-scale Approximation of the Matching Distance for Shape Retrieval
This paper deals with the concepts of persistence diagrams and matching distance. They are two of the main ingredients of Topological Persistence, which has proven to be a promising framework for shape comparison. Persistence diagrams are descriptors providing a signature of the shapes under study, while the matching distance is a metric to compare them. One drawback in the application of these tools is the computational costs for the evaluation of the matching distance. The aim of the present paper is to introduce a new framework for the approximation of the matching distance, which does not affect the reliability of the entire approach in comparing shapes, and extremely reduces computational costs. This is shown through experiments on 3D-models.
KeywordsPersistence diagram shape analysis dissimilarity criterion
- 3.Bronstein, A., Bronstein, M., Kimmel, R.: Numerical Geometry of Non-Rigid Shapes, 1st edn. Springer Publishing Company, Incorporated (2008)Google Scholar
- 9.Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Society (2009)Google Scholar
- 10.Frosini, P., Landi, C.: Size theory as a topological tool for computer vision. Pattern Recogn. and Image Anal. 9, 596–603 (1999)Google Scholar
- 11.Smeulders, A.W.M., Worring, M., Santini, S., Gupta, A., Jain, R.: Content-based image retrieval at the end of the early years. IEEE Trans. PAMI 22(12) (2000)Google Scholar