请输入您要查询的百科知识:

 

词条 Matching distance
释义

  1. See also

  2. References

In mathematics, the matching distance[1][2] is a metric on the space of size functions.

The core of the definition of matching distance is the observation that the

information contained in a size function can be combinatorially stored in a formal series of lines and points of the plane, called respectively cornerlines and cornerpoints.

Given two size functions and , let (resp. ) be the multiset of

all cornerpoints and cornerlines for (resp. ) counted with their

multiplicities, augmented by adding a countable infinity of points of the

diagonal .

The matching distance between and is given by

where varies among all the bijections between and and

Roughly speaking, the matching distance

between two size functions is the minimum, over all the matchings

between the cornerpoints of the two size functions, of the maximum

of the -distances between two matched cornerpoints. Since

two size functions can have a different number of cornerpoints,

these can be also matched to points of the diagonal . Moreover, the definition of implies that matching two points of the diagonal has no cost.

See also

  • Size theory
  • Size function
  • Size functor
  • Size homotopy group
  • Natural pseudodistance

References

1. ^Michele d'Amico, Patrizio Frosini, Claudia Landi, Using matching distance in Size Theory: a survey, International Journal of Imaging Systems and Technology, 16(5):154–161, 2006.
2. ^Michele d'Amico, Patrizio Frosini, Claudia Landi, Natural pseudo-distance and optimal matching between reduced size functions, Acta Applicandae Mathematicae, 109(2):527-554, 2010.
{{DEFAULTSORT:Matching Distance}}

1 : Topology

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/21 1:47:09