Matching service
This generic name refers to the methods that are related with pattern recognition (PR) problems.
In general, the purpose of PR algorithms is to distribute the existing
measurements into clusters, these into trajectories and these into vertices.
This is a common problem in HEP, but it can be generalized to any other field.
Two types of PR algorithms are provided by RecPack: matching functions, which serve to estimate
the probability of two objects of being
related to each other (Trajectory-Trajectory, Trajectory-Measurement),
and PR logics, which define the
sequence in which such a relations are established.
The first are always general, while
the second may have a strong setup dependence.
PR logics for Trajectory's are introduced via the
ITrajectoryFinder interface class. Currently, the RecPack matching service provides a
CellularAutomatom trajectory finder.
The matching service provides the following matching functions:
An example on how to match several types objects is found here.