A new algorithm for computing the 2-dimensional matching distance between size functions (Articolo in rivista)

Type
Label
  • A new algorithm for computing the 2-dimensional matching distance between size functions (Articolo in rivista) (literal)
Anno
  • 2011-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1016/j.patrec.2011.07.014 (literal)
Alternative label
  • S. Biasotti; A. Cerri; P. Frosini; D. Giorgi (2011)
    A new algorithm for computing the 2-dimensional matching distance between size functions
    in Pattern recognition letters
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • S. Biasotti; A. Cerri; P. Frosini; D. Giorgi (literal)
Pagina inizio
  • 1735 (literal)
Pagina fine
  • 1746 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://www.sciencedirect.com/science/article/pii/S0167865511002273 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 32 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • Elsevier 2011 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 14 (literal)
Note
  • ISI Web of Science (WOS) (literal)
  • Scopu (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • S. Biasotti, D. Giorgi: Istituto di Matematica Applicata e Tecnologie Informatiche, Consiglio Nazionale delle Ricerche Via De Marini 6, I-16149 Genova, Italy P. Frosini: ARCES, Università di Bologna, via Toffano 2/2, I-40135 Bologna, Italy - Dipartimento di Matematica, Università di Bologna, P.zza di Porta S. Donato 5, I-40126 Bologna, Italy A. Cerri: ARCES, Università di Bologna, via Toffano 2/2, I-40135 Bologna, Italy - Dipartimento di Matematica, Università di Bologna, P.zza di Porta S. Donato 5, I-40126 Bologna, Italy - Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Favoritenstrasse 9/186/3, A-1040 Vienna, Austria (literal)
Titolo
  • A new algorithm for computing the 2-dimensional matching distance between size functions (literal)
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. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Insieme di parole chiave di
data.CNR.it