Discrete particle swarm optimization for high-order graph matching

High-order graph matching aims at establishing correspondences between two sets of feature points using high-order constraints. It is usually formulated as an NP-hard problem of maximizing an objective function. This paper introduces a discrete particle swarm optimization algorithm for resolving high-order graph matching problems, which incorporates several re-defined operations, a problem-specific initialization method based on heuristic information, and a problem-specific local search procedure. The proposed algorithm is evaluated on both synthetic and real-world datasets. Its outstanding performance is validated in comparison with three state-of-the-art approaches.

[1]  Siti Mariyam Hj. Shamsuddin,et al.  CAPSO: Centripetal accelerated particle swarm optimization , 2014, Inf. Sci..

[2]  V. Mani,et al.  Multiobjective Discrete Particle Swarm Optimization for Multisensor Image Alignment , 2013, IEEE Geoscience and Remote Sensing Letters.

[3]  Qing-Long Han,et al.  A finite-time particle swarm optimization algorithm for odor source localization , 2014, Inf. Sci..

[4]  Carlos A. Coello Coello,et al.  Handling multiple objectives with particle swarm optimization , 2004, IEEE Transactions on Evolutionary Computation.

[5]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

[6]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  Minsu Cho,et al.  Hyper-graph matching via reweighted random walks , 2011, CVPR 2011.

[8]  Martial Hebert,et al.  A spectral technique for correspondence problems using pairwise constraints , 2005, Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1.

[9]  Minsu Cho,et al.  Reweighted Random Walks for Graph Matching , 2010, ECCV.

[10]  David S. Doermann,et al.  Robust point matching for nonrigid shapes by preserving local neighborhood structures , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[12]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[13]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[14]  Maoguo Gong,et al.  Greedy discrete particle swarm optimization for large-scale social network clustering , 2015, Inf. Sci..

[15]  Norbert Krüger,et al.  Face Recognition by Elastic Bunch Graph Matching , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[16]  Martial Hebert,et al.  Fast and Scalable Approximate Spectral Matching for Higher Order Graph Matching , 2014, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Yosi Keller,et al.  Efficient High Order Matching , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Jean Ponce,et al.  A Tensor-Based Algorithm for High-Order Graph Matching , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[19]  Hwann-Tzong Chen,et al.  Multi-object tracking using dynamical graph matching , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[20]  Ying Lin,et al.  Particle Swarm Optimization With an Aging Leader and Challengers , 2013, IEEE Transactions on Evolutionary Computation.

[21]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[22]  Kusum Deep,et al.  A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..

[23]  Cordelia Schmid,et al.  Beyond Bags of Features: Spatial Pyramid Matching for Recognizing Natural Scene Categories , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[24]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[25]  Jiri Matas,et al.  Robust wide-baseline stereo from maximally stable extremal regions , 2004, Image Vis. Comput..

[26]  Narasimhan Sundararajan,et al.  Self regulating particle swarm optimization algorithm , 2015, Inf. Sci..

[27]  Ponnuthurai N. Suganthan,et al.  Multi-objective robust PID controller tuning using two lbests multi-objective particle swarm optimization , 2011, Inf. Sci..

[28]  Heitor Silvério Lopes,et al.  Particle Swarm Optimization for the Multidimensional Knapsack Problem , 2007, ICANNGA.

[29]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[30]  Chunguang Zhou,et al.  Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[31]  A. S. Chernyavskiy,et al.  A robust scheme of model parameters estimation based on the particle swarm method in the image matching problem , 2008 .

[32]  Amnon Shashua,et al.  Probabilistic graph and hypergraph matching , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[33]  D. Y. Sha,et al.  A hybrid particle swarm optimization for job shop scheduling problem , 2006, Comput. Ind. Eng..

[34]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[35]  Maoguo Gong,et al.  Complex Network Clustering by Multiobjective Discrete Particle Swarm Optimization Based on Decomposition , 2014, IEEE Transactions on Evolutionary Computation.

[36]  Yanchun Liang,et al.  Particle swarm optimization-based algorithms for TSP and generalized TSP , 2007, Inf. Process. Lett..

[37]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[38]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2011, IEEE Trans. Evol. Comput..

[39]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[40]  Martial Hebert,et al.  Fast and scalable approximate spectral graph matching for correspondence problems , 2013, Inf. Sci..

[41]  Xiaodong Li,et al.  Cooperatively Coevolving Particle Swarms for Large Scale Optimization , 2012, IEEE Transactions on Evolutionary Computation.

[42]  Yaochu Jin,et al.  A social learning particle swarm optimization algorithm for scalable optimization , 2015, Inf. Sci..

[43]  David G. Lowe,et al.  Distinctive Image Features from Scale-Invariant Keypoints , 2004, International Journal of Computer Vision.