A new algorithm for computing the 2-dimensional matching distance between size functions

  • Authors:
  • Silvia Biasotti;Andrea Cerri;Patrizio Frosini;Daniela Giorgi

  • Affiliations:
  • Istituto di Matematica Applicata e Tecnologie Informatiche, Consiglio Nazionale delle Ricerche Via De Marini 6, I-16149 Genova, Italy;ARCES, Universití di Bologna, via Toffano 2/2, I-40135 Bologna, Italy and Dipartimento di Matematica, Universití di Bologna, P.zza di Porta S. Donato 5, I-40126 Bologna, Italy and Patter ...;ARCES, Universití di Bologna, via Toffano 2/2, I-40135 Bologna, Italy and Dipartimento di Matematica, Universití di Bologna, P.zza di Porta S. Donato 5, I-40126 Bologna, Italy;Istituto di Matematica Applicata e Tecnologie Informatiche, Consiglio Nazionale delle Ricerche Via De Marini 6, I-16149 Genova, Italy

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2011

Quantified Score

Hi-index 0.10

Visualization

Abstract

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.