Search Results for author:
Found 4 papers, 1 papers with code
M3C: A Framework towards Convergent, Flexible, and Unsupervised Learning of Mixture Graph Matching and Clustering
Existing graph matching methods typically assume that there are similar structures between graphs and they are matchable.
Learning Universe Model for Partial Matching Networks over Multiple Graphs
We consider the general setting for partial matching of two or multiple graphs, in the sense that not necessarily all the nodes in one graph can find their correspondences in another graph and vice versa.
Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching
As such, the agent can finish inlier matching timely when the affinity score stops growing, for which otherwise an additional parameter i. e. the number of inliers is needed to avoid matching outliers.
Rethinking Sampling in 3D Point Cloud Generative Adversarial Networks
We further study how different evaluation metrics weigh the sampling pattern against the geometry and propose several perceptual metrics forming a sampling spectrum of metrics.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
