Compatibilities between the hyperedges of two hy-pergraphs can be represented as a sparse tensor to avoid expo-nentially increasing computational costs in hypergraph matching. Kd-tree-based approximate nearest neighbor (ANN) methods have been widely adopted to... ...

请注册登录后继续浏览