Graph Matching by Simplified Convex-Concave Relaxation Procedure
نویسندگان
چکیده
منابع مشابه
A Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm
Based on the convex-concave relaxation procedure (CCRP), the (extended) path following algorithms were recently proposed to approximately solve the equal-sized graph matching problem, and exhibited a state-of-the-art performance (Zaslavskiy et al., 2009; Liu et al., 2012). However, they cannot be used for subgraph matching since either their convex or concave relaxation becomes no longer applic...
متن کاملThe Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/energy functions. It can be applied to (almost) any optimization problem and many existing algorithms can be interpreted in terms of CCCP. In particular, we prove relationships to some applications of Legendre transform te...
متن کاملA graph matching algorithm based on concavely regularized convex relaxation
In this paper we propose a concavely regularized convex relaxation based graph matching algorithm. The graph matching problem is firstly formulated as a constrained convex quadratic program by relaxing the feasible set from the permutation matrices to doubly stochastic matrices. To gradually push the doubly stochastic matrix back to be a permutation one, an objective function is constructed by ...
متن کاملOn Convergence Rate of Concave-Convex Procedure
Concave-Convex Procedure (CCCP) has been widely used to solve nonconvex d.c.(difference of convex function) programs occur in learning problems, such as sparse support vector machine (SVM), transductive SVM, sparse principal componenent analysis (PCA), etc. Although the global convergence behavior of CCCP has been well studied, the convergence rate of CCCP is still an open problem. Most of d.c....
متن کاملGraph matching by relaxation of fuzzy assignments
Graphs are very powerful and widely used representational tools in computer applications. In this paper, we present a relaxation approach to (sub)graph matching based on a fuzzy assignment matrix. The algorithm has a computational complexity of ( 2 ) where and are the number of nodes in the two graphs being matched, and can perform both exact and inexact matching. To illustrate the performance ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Vision
سال: 2014
ISSN: 0920-5691,1573-1405
DOI: 10.1007/s11263-014-0707-7