Fast and scalable approximate spectral graph matching for correspondence problems-Reference-Cited by-同舟云学术

Fast and scalable approximate spectral graph matching for correspondence problems

Published:2013-01 Issue: Volume:220 Page:306-318
ISSN:0020-0255
Container-title:Information Sciences
language:en
Short-container-title:Information Sciences

Author:

Kang U,Hebert Martial,Park Soonyong

Publisher

Elsevier BV

Subject

Artificial Intelligence,Information Systems and Management,Computer Science Applications,Theoretical Computer Science,Control and Systems Engineering,Software

Reference32 articles.

1. Shape matching and object recognition using shape contexts;Belongie;IEEE Trans. Pattern Anal. Mach. Intell.,2002

2. Multidimensional binary search trees used for associative searching;Bentley;Commun. ACM,1975

3. A.C. Berg, T.L. Berg, J. Malik. Shape matching and object recognition using low distortion correspondences, in: IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2005, pp. 26–33.

4. A method for registration of 3-d shapes;Besl;IEEE Trans. Pattern Anal. Mach. Intell.,1992

5. M. Brown, D.G. Lowe, Recognising panoramas, in: Internat. Conf. on Computer Vision (ICCV), 2003, pp. 1218–1227.

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

1. Statistical Limits for Testing Correlation of Random Hypergraphs;Latin American Journal of Probability and Mathematical Statistics;2024

2. An Interpretable Fake News Detection Method Based on Commonsense Knowledge Graph;Applied Sciences;2023-05-30

3. Matching-Graphs for Building Classification Ensembles;Graph-Based Representations in Pattern Recognition;2023

4. Kernel embedding transformation learning for graph matching;Pattern Recognition Letters;2022-11

5. A novel way to formalize stable graph cores by using matching-graphs;Pattern Recognition;2022-11