Three questions regarding the code

[qiaozhijian]

Three questions regarding the code

[zhangxy0517]

Your questions are about the dynamic adjustment of the compatibility graph scale. Let's suppose that the inlier ratio of the input correspondence set is high, then the compatibility graph will be dense, making searching for maximal cliques in the whole graph more time-consuming. Based on this, we introduce the clustering coefficient to measure the density of the compatibility graph. Please refer to our previous work mutual voting for ranking 3D correspondences. If the coefficient is large, we choose to reduce the size of the compatibility graph, that is, only retain the nodes with higher weights and the edges formed by these nodes. Note that the mechanism is not mentioned in our paper, because: 1) it is not our main innovation point; 2) the operation of reducing the graph size will only take effect when the inlier ratio is high.

[qiaozhijian]

Great idea. I think I should take the time to read this article carefully.