Attributed relational graph matching based on the nested assignment structure-Reference-Cited by-同舟云学术

Attributed relational graph matching based on the nested assignment structure

Published:2010-03 Issue:3 Volume:43 Page:914-928
ISSN:0031-3203
Container-title:Pattern Recognition
language:en
Short-container-title:Pattern Recognition

Author:

Kim Duck Hoon,Yun Il Dong,Lee Sang Uk

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Signal Processing,Software

Reference41 articles.

1. LEDA: A Platform for Combinatorial and Geometric Computing;Mehlhorn,1999

2. Recognition of partially occluded objects using probabilistic ARG (attributed relational graph)-based matching;Park;Computer Vision and Image Understanding,2003

3. A graduated assignment algorithm for graph matching;Gold;IEEE Transactions on Pattern Analysis and Machine Intelligence,1996

4. A new algorithm for error-tolerant subgraph isomorphism detection;Messmer;IEEE Transactions on Pattern Analysis and Machine Intelligence,1998

5. M. Pelillo, A unifying framework for relational structure matching, in: Proceedings of International Conference on Pattern Recognition, January 1998, pp. 1316–1319.

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

1. Real-World ISAR Object Recognition Using Deep Multimodal Relation Learning;IEEE Transactions on Cybernetics;2020-10

2. Outlier robust point correspondence based on GNCCP;Pattern Recognition Letters;2015-04

3. Robust Feature Point Matching With Sparse Model;IEEE Transactions on Image Processing;2014-12

4. Near-duplicate document image matching: A graphical perspective;Pattern Recognition;2014-04

5. A sparse nonnegative matrix factorization technique for graph matching problems;Pattern Recognition;2014-02