Skip to main content
Erschienen in: Machine Vision and Applications 7/2017

05.06.2017 | Special Issue Paper

Multiple path exploration for graph matching

verfasst von: Ran Chen, Congyan Lang, Tao Wang

Erschienen in: Machine Vision and Applications | Ausgabe 7/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The graph matching problem is a hot topic in machine vision. Although a myriad of matching algorithms have been proposed during decades of investigation, it is still a challenging issue because of the combinatorial nature. As one of the outstanding graph matching algorithms, the graduated nonconvexity and concavity procedure follows the path following algorithm. The main drawback of this approach lies that there may exist singular points which violate the smoothness of the solution path and thus harm the accuracy of matching. Addressing this problem, we develop a novel algorithm to bypass this pitfall to improve the matching accuracy. We design an effective method of singular point discovering by checking the smoothness of the path and subsequently explore multiple smooth curves at detected points for better matching results. For evaluation, we make comparisons between our approach and several outstanding matching algorithms on three popular benchmarks, and the results reveal the advantage of our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Burlington (2014)MATH Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, Burlington (2014)MATH
2.
Zurück zum Zitat Liu, W., Mei, T., Zhang, Y.: Instant mobile video search with layered audio–video indexing and progressive transmission. IEEE Trans. Multimed. 16(8), 2242–2255 (2014)CrossRef Liu, W., Mei, T., Zhang, Y.: Instant mobile video search with layered audio–video indexing and progressive transmission. IEEE Trans. Multimed. 16(8), 2242–2255 (2014)CrossRef
3.
Zurück zum Zitat Pan, Z., Lei, J., Zhang, Y., Sun, X., Kwong, S.: Fast motion estimation based on content property for low-complexity H. 265/HEVC encoder. IEEE Trans. Broadcast. 62(3), 675–684 (2016)CrossRef Pan, Z., Lei, J., Zhang, Y., Sun, X., Kwong, S.: Fast motion estimation based on content property for low-complexity H. 265/HEVC encoder. IEEE Trans. Broadcast. 62(3), 675–684 (2016)CrossRef
4.
Zurück zum Zitat Duchenne, O., Joulin, A., Ponce, J.: A graph-matching kernel for object categorization, In: ICCV, pp. 1792–1799 (2011) Duchenne, O., Joulin, A., Ponce, J.: A graph-matching kernel for object categorization, In: ICCV, pp. 1792–1799 (2011)
5.
Zurück zum Zitat Wu, J., Shen, H., Li, Y.-D., Xiao, Z.-B., Lu, M.-Y., Wang, C.-L.: Learning a hybrid similarity measure for image retrieval. Pattern Recognit. 46(11), 2927–2939 (2013)CrossRefMATH Wu, J., Shen, H., Li, Y.-D., Xiao, Z.-B., Lu, M.-Y., Wang, C.-L.: Learning a hybrid similarity measure for image retrieval. Pattern Recognit. 46(11), 2927–2939 (2013)CrossRefMATH
6.
Zurück zum Zitat Chen, B., Shu, H., Coatrieux, G., Chen, G., Sun, X., Coatrieux, J.L.: Color image analysis by quaternion-type moments. J. Math. Imaging Vis. 51(1), 124–144 (2015)MathSciNetCrossRefMATH Chen, B., Shu, H., Coatrieux, G., Chen, G., Sun, X., Coatrieux, J.L.: Color image analysis by quaternion-type moments. J. Math. Imaging Vis. 51(1), 124–144 (2015)MathSciNetCrossRefMATH
7.
Zurück zum Zitat Xia, Z., Wang, X., Sun, X., Wang, B.: Steganalysis of least significant bit matching using multi-order differences. Secur. Commun. Netw 7(8), 1283–1291 (2014)CrossRef Xia, Z., Wang, X., Sun, X., Wang, B.: Steganalysis of least significant bit matching using multi-order differences. Secur. Commun. Netw 7(8), 1283–1291 (2014)CrossRef
8.
Zurück zum Zitat Liu, W., Mei, T., Zhang, Y., Che, C., Luo, J.: Multi-task deep visual-semantic embedding for video thumbnail selection, In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3707–3715 (2015) Liu, W., Mei, T., Zhang, Y., Che, C., Luo, J.: Multi-task deep visual-semantic embedding for video thumbnail selection, In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 3707–3715 (2015)
9.
Zurück zum Zitat Serradell, E., Pinheiro, M.A., Sznitman, R., Kybic, J., Moreno-Noguer, F., Fua, P.: Non-rigid graph registration using active testing search. IEEE Trans. Pattern Anal. Mach. Intell. 37(3), 625–638 (2015)CrossRef Serradell, E., Pinheiro, M.A., Sznitman, R., Kybic, J., Moreno-Noguer, F., Fua, P.: Non-rigid graph registration using active testing search. IEEE Trans. Pattern Anal. Mach. Intell. 37(3), 625–638 (2015)CrossRef
10.
Zurück zum Zitat Chen, Z., Chen, Y., Gao, X., Wang, S., Hu, L., Yan, C. C., Lane, N. D., Miao, C.: Unobtrusive sensing incremental social contexts using fuzzy class incremental learning, In: 2015 IEEE International Conference on Data Mining (ICDM), pp. 71–80. IEEE (2015) Chen, Z., Chen, Y., Gao, X., Wang, S., Hu, L., Yan, C. C., Lane, N. D., Miao, C.: Unobtrusive sensing incremental social contexts using fuzzy class incremental learning, In: 2015 IEEE International Conference on Data Mining (ICDM), pp. 71–80. IEEE (2015)
11.
Zurück zum Zitat Chen, C.-Y., Grauman, K.: Efficient activity detection with max-subgraph search, In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1274–1281. IEEE (2012) Chen, C.-Y., Grauman, K.: Efficient activity detection with max-subgraph search, In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1274–1281. IEEE (2012)
12.
Zurück zum Zitat Liu, W., Zhang, Y., Tang, S., Tang, J., Hong, R., Li, J.: Accurate estimation of human body orientation from RGB-D sensors. IEEE Trans. Cybern. 43(5), 1442–1452 (2013)CrossRef Liu, W., Zhang, Y., Tang, S., Tang, J., Hong, R., Li, J.: Accurate estimation of human body orientation from RGB-D sensors. IEEE Trans. Cybern. 43(5), 1442–1452 (2013)CrossRef
13.
Zurück zum Zitat Gao, X., Chen, Z., Tang, S., Zhang, Y., Li, J.: Adaptive weighted imbalance learning with application to abnormal activity recognition. Neurocomputing 173, 1927–1935 (2016)CrossRef Gao, X., Chen, Z., Tang, S., Zhang, Y., Li, J.: Adaptive weighted imbalance learning with application to abnormal activity recognition. Neurocomputing 173, 1927–1935 (2016)CrossRef
14.
Zurück zum Zitat Singh, R., Xu, J., Berger, B.: Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology, In: Annual International Conference on Research in Computational Molecular Biology, pp. 16–31. Springer (2007) Singh, R., Xu, J., Berger, B.: Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology, In: Annual International Conference on Research in Computational Molecular Biology, pp. 16–31. Springer (2007)
15.
Zurück zum Zitat Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints, In: ICCV, pp. 1482–1489 (2005) Leordeanu, M., Hebert, M.: A spectral technique for correspondence problems using pairwise constraints, In: ICCV, pp. 1482–1489 (2005)
16.
Zurück zum Zitat Cho, M., Lee, J., Lee, K.: Reweighted random walk for graph matching, In: ECCV, pp. 492–505 (2010) Cho, M., Lee, J., Lee, K.: Reweighted random walk for graph matching, In: ECCV, pp. 492–505 (2010)
17.
Zurück zum Zitat Cho, M., Alahari, K., Ponce, J.: Learning graphs to match, In: Proceedings of the IEEE International Conference on Computer Vision, pp. 25–32 (2013) Cho, M., Alahari, K., Ponce, J.: Learning graphs to match, In: Proceedings of the IEEE International Conference on Computer Vision, pp. 25–32 (2013)
18.
Zurück zum Zitat Domke, J.: Learning graphical model parameters with approximate marginal inference. IEEE Trans. Pattern Anal. Mach. Intell. 35(10), 2454–2467 (2013)CrossRef Domke, J.: Learning graphical model parameters with approximate marginal inference. IEEE Trans. Pattern Anal. Mach. Intell. 35(10), 2454–2467 (2013)CrossRef
19.
Zurück zum Zitat Egozi, A., Keller, Y., Guterman, H.: A probabilistic approach to spectral graph matching. PAMI 35(1), 18–27 (2013)CrossRef Egozi, A., Keller, Y., Guterman, H.: A probabilistic approach to spectral graph matching. PAMI 35(1), 18–27 (2013)CrossRef
20.
Zurück zum Zitat Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching, In: CVPR, pp. 1–8 (2008) Zass, R., Shashua, A.: Probabilistic graph and hypergraph matching, In: CVPR, pp. 1–8 (2008)
21.
Zurück zum Zitat Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI 18(4), 377–388 (1996)CrossRef Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. PAMI 18(4), 377–388 (1996)CrossRef
22.
Zurück zum Zitat Zaslavskiy, M., Bach, F., Vert, J.: A path following algorithm for the graph matching problem. PAMI 31(12), 2227–2242 (2009)CrossRef Zaslavskiy, M., Bach, F., Vert, J.: A path following algorithm for the graph matching problem. PAMI 31(12), 2227–2242 (2009)CrossRef
23.
24.
Zurück zum Zitat Liu, Z.-Y., Qiao, H., Yang, X., Hoi, S.C.: Graph matching by simplified convex-concave relaxation procedure. Int. J. Comput. Vision 109(3), 169–186 (2014)MathSciNetCrossRefMATH Liu, Z.-Y., Qiao, H., Yang, X., Hoi, S.C.: Graph matching by simplified convex-concave relaxation procedure. Int. J. Comput. Vision 109(3), 169–186 (2014)MathSciNetCrossRefMATH
25.
Zurück zum Zitat Zhou, F., Torre, F.: Factorized graph matching, In: CVPR, pp. 127–134 (2012) Zhou, F., Torre, F.: Factorized graph matching, In: CVPR, pp. 127–134 (2012)
26.
Zurück zum Zitat Wang, T., Ling, H.: Path following with adaptive path estimation for graph matching, In: 13th AAAI Conference on Artificial Intelligence, (2016) Wang, T., Ling, H.: Path following with adaptive path estimation for graph matching, In: 13th AAAI Conference on Artificial Intelligence, (2016)
27.
Zurück zum Zitat Adamczewski, K., Suh, Y., Lee, K.: Discrete tabu search for graph matching, In: ICCV, pp. 109–117 (2015) Adamczewski, K., Suh, Y., Lee, K.: Discrete tabu search for graph matching, In: ICCV, pp. 109–117 (2015)
28.
Zurück zum Zitat Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S. M.: Discrete hyper-graph matching, In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1520–1528 (2015) Yan, J., Zhang, C., Zha, H., Liu, W., Yang, X., Chu, S. M.: Discrete hyper-graph matching, In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 1520–1528 (2015)
29.
Zurück zum Zitat Kudryavtsev, L.: Implicit Function, Encyclopedia of Mathematics. Springer, Berlin (2001) Kudryavtsev, L.: Implicit Function, Encyclopedia of Mathematics. Springer, Berlin (2001)
30.
Zurück zum Zitat Leordeanu, M., Hebert, M.: An integer projected fixed point method for graph matching and map inference, In: NIPS, (2009) Leordeanu, M., Hebert, M.: An integer projected fixed point method for graph matching and map inference, In: NIPS, (2009)
31.
Zurück zum Zitat Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265–298 (2004)CrossRef Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265–298 (2004)CrossRef
32.
Zurück zum Zitat Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recognit. Artif. Intell. 28(1), 1–40 (2014)MathSciNetCrossRef Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recognit. Artif. Intell. 28(1), 1–40 (2014)MathSciNetCrossRef
33.
Zurück zum Zitat Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1–2), 95–110 (1956)MathSciNetCrossRef Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3(1–2), 95–110 (1956)MathSciNetCrossRef
34.
Zurück zum Zitat Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)MATH Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)MATH
35.
Zurück zum Zitat Allgower, E.L., Georg, K.: Introduction to numerical continuation methods. SIAM Class. Appl. Math. 45, xxvi–388 (2003) Allgower, E.L., Georg, K.: Introduction to numerical continuation methods. SIAM Class. Appl. Math. 45, xxvi–388 (2003)
36.
Zurück zum Zitat Shacham, M.: Numerical solution of constrained nonlinear algebraic equations. Int. J. Numer. Meth. Eng. 23(8), 1455–1481 (1986) Shacham, M.: Numerical solution of constrained nonlinear algebraic equations. Int. J. Numer. Meth. Eng. 23(8), 1455–1481 (1986)
37.
Zurück zum Zitat De Borst, R., Crisfield, M.A., Remmers, J.J., Verhoosel, C.V.: Nonlinear Finite Element Analysis of Solids and Structures. Wiley, Hoboken (2012)CrossRefMATH De Borst, R., Crisfield, M.A., Remmers, J.J., Verhoosel, C.V.: Nonlinear Finite Element Analysis of Solids and Structures. Wiley, Hoboken (2012)CrossRefMATH
38.
Zurück zum Zitat Gu, B., Sheng, V. S.: A robust regularization path algorithm for \(\nu \)-support vector classification, IEEE Transactions on neural networks and learning systems Gu, B., Sheng, V. S.: A robust regularization path algorithm for \(\nu \)-support vector classification, IEEE Transactions on neural networks and learning systems
39.
Zurück zum Zitat Lee, D.-T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219–242 (1980)MathSciNetCrossRefMATH Lee, D.-T., Schachter, B.J.: Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219–242 (1980)MathSciNetCrossRefMATH
40.
Zurück zum Zitat Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)CrossRef Lowe, D.G.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)CrossRef
41.
Zurück zum Zitat Zhou, Z., Wang, Y., Wu, Q.J., Yang, C.-N., Sun, X.: Effective and efficient global context verification for image copy detection. IEEE Trans. Inf. Forensics Secur. 12(1), 48–63 (2017) Zhou, Z., Wang, Y., Wu, Q.J., Yang, C.-N., Sun, X.: Effective and efficient global context verification for image copy detection. IEEE Trans. Inf. Forensics Secur. 12(1), 48–63 (2017)
42.
Zurück zum Zitat Liu, W., Ma, H., Qi, H., et al.: Deep learning hashing for mobile visual search. EURASIP J. Image. Vide. Process. 2017(1), 17 (2017) Liu, W., Ma, H., Qi, H., et al.: Deep learning hashing for mobile visual search. EURASIP J. Image. Vide. Process. 2017(1), 17 (2017)
43.
Zurück zum Zitat Mikolajczyk, K., Schmid, C.: An Affine Invariant Interest Point Detector, In: European Conference on Computer Vision, pp. 128–142. Springer (2002) Mikolajczyk, K., Schmid, C.: An Affine Invariant Interest Point Detector, In: European Conference on Computer Vision, pp. 128–142. Springer (2002)
44.
Zurück zum Zitat Xia, Z., Wang, X., Sun, X., Liu, Q., Xiong, N.: Steganalysis of lsb matching using differences between nonadjacent pixels. Multimed. Tools Appl. 75(4), 1947–1962 (2016)CrossRef Xia, Z., Wang, X., Sun, X., Liu, Q., Xiong, N.: Steganalysis of lsb matching using differences between nonadjacent pixels. Multimed. Tools Appl. 75(4), 1947–1962 (2016)CrossRef
Metadaten
Titel
Multiple path exploration for graph matching
verfasst von
Ran Chen
Congyan Lang
Tao Wang
Publikationsdatum
05.06.2017
Verlag
Springer Berlin Heidelberg
Erschienen in
Machine Vision and Applications / Ausgabe 7/2017
Print ISSN: 0932-8092
Elektronische ISSN: 1432-1769
DOI
https://doi.org/10.1007/s00138-017-0847-1

Weitere Artikel der Ausgabe 7/2017

Machine Vision and Applications 7/2017 Zur Ausgabe