• Publication
  • PrePrints
  • Abstract - Graduated NonConvexity and Concavity Procedure for Partial Graph Matching
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Graduated NonConvexity and Concavity Procedure for Partial Graph Matching
PrePrint
ISSN: 0162-8828
Zhi-Yong Liu, Institute of Automation, Chinese Academy of Sciences, Beijing
Hong Qiao, Institute of Automation, Chinese Academy of Sciences, Beijing
In this paper we propose the Graduated NonConvexity and Graduated Concavity Procedure (GNCGCP) as a general optimization framework to approximately solve the combinatorial optimization problems defined on the set of partial permutation matrices. GNCGCP comprises two sub-procedures, graduated nonconvexity (GNC) which realizes a convex relaxation and graduated concavity (GC) which realizes a concave relaxation. It is proved that GNCGCP realizes exactly a type of convex-concave relaxation procedure (CCRP), but with a much simpler formulation without needing convex or concave relaxation in an explicit way. Actually, GNCGCP involves only the gradient of the objective function and is therefore very easy to use in practical applications. Two typical related NP-hard problems, (sub)graph matching and quadratic assignment problem (QAP), are employed to demonstrate its simplicity and state-of-the-art performance.
Index Terms:
Algorithm design and analysis,Linear programming,Pattern matching,NP-hard problem,Simulated annealing,Eigenvalues and eigenfunctions,Quadratic Assignment Problem,Combinatorial algorithms,Graph algorithms,Structural,Subgraph Matching
Citation:
Zhi-Yong Liu, Hong Qiao, "Graduated NonConvexity and Concavity Procedure for Partial Graph Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, 21 Nov. 2013. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TPAMI.2013.223>
Usage of this product signifies your acceptance of the Terms of Use.