1 paper
Faria Huq, Adrish Dey, Sahra Yusuf +3
We consider the problem of graph-matching on a network of 3D shapes with uncertainty quantification. We assume that the pairwise shape correspondences are efficiently represented a…