An Edit Distance Between Graph Correspondences-Reference-Cited by-同舟云学术

An Edit Distance Between Graph Correspondences

Published:2017 Issue: Volume: Page:232-241
ISSN:0302-9743
Container-title:Graph-Based Representations in Pattern Recognition
language:
Short-container-title:

Author:

Moreno-García Carlos Francisco,Serratosa Francesc,Jiang Xiaoyi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-58961-9_21

Reference34 articles.

1. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching. Int. J. Pattern Recognit. Artif. Intell. 18(3), 265–298 (2004)

2. Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition on the last ten years. Int. J. Pattern Recognit. Artif. Intell. 28(1), 1450001 (2014). (40 pages)

3. Vento, M.: A long trip in the charming world of graphs for pattern recognition. Pattern Recognit. 48(2), 291–301 (2015)

4. Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048–1058 (2009)

5. Zhou, F., De la Torre, F.: Factorized graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 38(9), 1774–1789 (2016)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trends in graph-based representations for Pattern Recognition;Pattern Recognition Letters;2020-06

2. Correspondence edit distance to obtain a set of weighted means of graph correspondences;Pattern Recognition Letters;2020-06

3. A Vectorization Approach for Graph-Structured Data to Pattern Recognition;2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2019-12

4. Generalised median of graph correspondences;Pattern Recognition Letters;2019-07

5. Structural Data Recognition With Graph Model Boosting;IEEE Access;2018