.png){kind=icon}
.png){kind=icon}
Return
A new algorithm for computing the 2-dimensional matching distance between size functions
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2011.07.014.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Size Theory has proven to be a useful geometrical/topological approach to shape comparison. Originally introduced by considering 1-dimensional properties of shapes, described by means of real-valued functions, it has recently been generalized to taking into account multi-dimensional properties coded by functions valued in R-k. This has led to the introduction of a shape descriptor called k-dimensional size function, and the k-dimensional matching distance to compare size functions. This paper presents new theoretical results about the 2-dimensional matching distance, leading to the formulation of an algorithm for its approximation up to an arbitrary error threshold. Experiments on 3D object comparison are shown to discuss the efficacy and effectiveness of the algorithm. (C) 2011 Elsevier B.V. All rights reserved.
Keywords:
Multi-dimensional size function
Size Theory
Shape comparison
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.8K
Citations:
1.6W