Mar 22, 2014 · Based on two convex relaxations, we obtain two graph matching algorithms defined on adjacency matrix and affinity matrix, respectively.
The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem.
[PDF] Graph Matching by Simplified Convex-Concave Relaxation ...
ink.library.smu.edu.sg › viewcontent
Mar 22, 2014 · 2.2 Convex-Concave Relaxation Procedure. The global optimum denoted by PD of the two convex relax- ations given above can be found in ...
Jul 30, 2013 · Graph Matching by Simplified Convex-Concave Relaxation Procedure. (2014). International Journal of Computer Vision. , 109(3) , 169. Research ...
The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem.
A simplified CCRP scheme is proposed, which can be proved to realize exactly C CRP, but with a much simpler formulation without needing the concave ...
Abstract. Based on the convex-concave relaxation procedure (CCRP), the (extended) path following algorithms were recently proposed to approximately solve ...
Jun 25, 2014 · In this paper we propose a concavely regularized convex relaxation based graph matching algorithm. The graph matching problem is firstly ...
The graph matching problem is firstly formulated as a constrained convex quadratic program by relaxing the feasible set from the permutation matrices to doubly ...
Bibliographic details on Graph Matching by Simplified Convex-Concave Relaxation Procedure.