Author:
Serratosa Francesc,Sanfeliu Alberto
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. J.T.LWANG, KZHANG, G-W. CHIRN, “The approximate Graph Matching Problem”, IEEE pp. 284–288, 1994.
2. A.K.CWONG, J.CONSTANT and M.L.YOU, “Random graphs”, (H. BUNKE and A. SANFELIU eds.). “Syntactic and structural pattern recognition: Theory and applications”, World Scientific Publishing Co. Pte. Ltd pp 179–195, 1990.
3. A.SANFELIU and K.FU,“ A Distance Measure Between Attributed Relational Graphs for Pattern Recognition”, IEEE Trans. on Sys. man and cybern. Vol. smc 13 No 3 May/June, 1983.
4. R.C.WILSON, A.N.EVANS and E.R.HANCOCK, “Relational matching by discrete relaxation”, Image and vision computing, Vol. 13, pp 411–421, 1995.
5. W.Y.KIM and A.C.KAK, “3D object recognition using bipartite matching embedded in discrete relaxation”, IEEE Trans. Pattern anal. mach. intell. 13 pp 224–251, 1991.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献