Degenerate similiary (DEN):为了评估分解中每个分量的效果,通过设置Kq=1生成退化边缘相似性,即每个边缘对产生相同的相似性。 Factorized graph matching (FGM):论文实现的方法,有两个版本,FGM-U用于仅具有对称边特征的无向图,FGM-D用于具有对称或非对称边特征有向图。发布...
内容提示: Factorized Graph MatchingFeng Zhou and Fernando De la TorreAbstract—Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondenceproblems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a ...
In this supplementary material, we provide more details of the four steps of our factorized graph matching (FGM) algorithm: (1) the line search for λ, (2) the modified Frank- Wolfe algorithm, (3) the concave-convex procedure and (4) the local vs. global strategy.where avex = tr LT...
=== Introduction === This page contains software and instructions for factorized graph matching (FGM) [1] [2]. In addition, we include the following well-known methods as baselines: spectral matching (SM) [3], spectral matching with affine constraints (SMAC) [4], graduated assignment (GA)...