Matching distance
From Wikipedia, the free encyclopedia
| This article may be too technical for a general audience. Please help improve this article by providing more context and better explanations of technical details to make it more accessible, without removing technical details. |
In mathematics, the matching distance[1] 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 C1 (resp. C2) 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 C1 and C2 and
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
-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.
and
is given by 


