Matching the rows of c1 to those of c2 based on their relative positions
graph is a matrix that yields a graph structure on the rows of c1
dmax is measure of the distance decay between points and correspondences
for algorithmic details, see
Thirion et al, MMBIA 2006
New version which makes the differences between ascending
and descending links
- c1 and c2 are arrays of shape (n1,d) and (n2,d) that represent
features or coordinates,
where n1 and n2 are the number of things to be put in correpondence
and d is the common dim
- G1 and G2 are corresponding graphs (forests in fff sense)
- dmax is a typical distance to compare positions
New version which makes the differences between ascending
and descending links
INPUT:
- c1 and c2 are arrays of shape (n1,d) and (n2,d) that represent
features or coordinates,
where n1 and n2 are the number of things to be put in correpondence
and d is the common dim
- G1 and G2 are corresponding graphs (forests in fff sense)
- dmax is a typical distance to compare positions
OUTPUT:
- (i,j,k): sparse model of the probabilistic relationships,
where k is the probability that i is associated with j