Matching distance

Matching distance

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

Example: The matching distance between \ell_1=r+a+b and \ell_2=r'+a' is given by d_\text{match}(\ell_1, \ell_2)=\max\{\delta(r,r'),\delta(b,a'),\delta(a,\Delta)\}=4

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 \ell_1 and \ell_2, let C1 (resp. C2) be the multiset of all cornerpoints and cornerlines for \ell_1 (resp. \ell_2) counted with their multiplicities, augmented by adding a countable infinity of points of the diagonal \{(x,y)\in \R^2: x=y\}.

The matching distance between \ell_1 and \ell_2 is given by d_\text{match}(\ell_1, \ell_2)=\min_\sigma\max_{p\in C_1}\delta (p,\sigma(p)) where σ varies among all the bijections between C1 and C2 and

\delta\left((x,y),(x',y')\right)=\min\left\{\max \{|x-x'|,|y-y'|\}, \max\left\{\frac{y-x}{2},\frac{y'-x'}{2}\right\}\right\}.

Roughly speaking, the matching distance dmatch between two size functions is the minimum, over all the matchings between the cornerpoints of the two size functions, of the maximum of the L_\infty-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.

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.

See also


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Distance De Hausdorff Modifiée — La distance de Hausdorff modifiée (MHD) a été développée par Dubuisson et Jain sur la base de la distance de Hausdorff. Ceux ci considèrent cette distance comme étant l une des plus adaptées pour la reconnaissance de formes. Définition La… …   Wikipédia en Français

  • Distance de Hausdorff modifiee — Distance de Hausdorff modifiée La distance de Hausdorff modifiée (MHD) a été développée par Dubuisson et Jain sur la base de la distance de Hausdorff. Ceux ci considèrent cette distance comme étant l une des plus adaptées pour la reconnaissance… …   Wikipédia en Français

  • Distance de hausdorff modifiée — La distance de Hausdorff modifiée (MHD) a été développée par Dubuisson et Jain sur la base de la distance de Hausdorff. Ceux ci considèrent cette distance comme étant l une des plus adaptées pour la reconnaissance de formes. Définition La… …   Wikipédia en Français

  • Distance de Hausdorff modifiée — La distance de Hausdorff modifiée (MHD) a été développée par Dubuisson et Jain sur la base de la distance de Hausdorff. Ceux ci considèrent cette distance comme étant l une des plus adaptées pour la reconnaissance de formes. Définition La… …   Wikipédia en Français

  • Levenshtein distance — In information theory and computer science, the Levenshtein distance is a string metric for measuring the amount of difference between two sequences. The term edit distance is often used to refer specifically to Levenshtein distance. The… …   Wikipedia

  • Optimal matching — is a sequence analysis method used in social science, to assess the dissimilarity of ordered arrays of tokens that usually represent a time ordered sequence of socio economic states two individuals have experienced. Once such distances have been… …   Wikipedia

  • Approximate string matching — In computing, approximate string matching is the technique of finding approximate matches to a pattern in a string. The closeness of a match is measured in terms of the number of primitive operations necessary to convert the string into an exact… …   Wikipedia

  • Damerau–Levenshtein distance — In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a distance (string metric) between two strings, i.e., finite sequence of symbols, given by counting the …   Wikipedia

  • Impedance matching — In electronics, impedance matching is the practice of designing the input impedance of an electrical load (or the output impedance of its corresponding signal source) to maximize the power transfer and/or minimize reflections from the load.… …   Wikipedia

  • Globales Matching — bezeichnet im Rahmen der Informationsintegration einen Prozess zur automatischen Abbildung verschiedener Schemas aufeinander (Schema Matching). Dabei werden Ergebnisse aus verschiedenen Matching Verfahren verwendet, um Attribute der zu matchenden …   Deutsch Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”