# emacs: -- mode: python; py-indent-offset: 4; indent-tabs-mode: nil -- # vi: set ft=python sts=4 ts=4 sw=4 et: Routines for Matching of a graph to a cloud of points/tree structures through Bayesian networks (Belief propagation) algorithms
Author: Bertrand Thirion , 2006-2008.
Matching the rows of c1 to those of c2 based on their relative positions
Parameters : | c1, array of shape (nbitems1, dim), :
c2, array of shape (nbitems2, dim), :
scale, float, scale parameter : eps = 1.e-12, float, : |
---|---|
Returns : | i, j, k: arrays of shape(E) :
|
New version which makes the differences between ascending and descending links
Parameters : | c1, c2 are arrays of shape (n1,d) and (n2,d) that represent :
G1 and G2 are corresponding graphs (forests in fff sense) : scale is a typical distance to compare positions : |
---|---|
Returns : | (i,j,k): sparse model of the probabilistic relationships, :
|
Matching the rows of c1 to those of c2 based on their relative positions
Parameters : | c1, array of shape (nbitems1, dim), :
c2, array of shape (nbitems2, dim), :
scale, float, scale parameter : eps = 1.e-12, float, : |
---|---|
Returns : | i, j, k: arrays of shape(E) :
|