A parallel algorithm for graph matching and its MasPar implementation

IEEE Transactions on Parallel and Distributed Systems

Volumn 8, Issue 5, 1997, Pages 490-501

  Allen, Robert ^b   Cinque, Luigi ^a,c   Tanimoto, Steven ^a,d   Shapiro, Linda ^a,d   Yasuda, Dean ^e  

^a IEEE

^b HEWLETT PACKARD COMPANY   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d University of Washington   (United States)

^e UNIVERSITY OF WASHINGTON   (United States)

Author keywords

Branch and bound; Combinatorial explosion; Forward checking; Graph; Load balancing; MasPar; Matching; Parallel algorithm; Search; SIMD

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; STATE SPACE METHODS;

GRAPH MATCHING; MASSIVELY PARALLEL SEARCH STREAM/MULTIPLE DATA STREAM; MASSIVELY PARALLEL SINGLE INSTRUCTION STREAM/MULTIPLE DATA STREAM;

PARALLEL ALGORITHMS;

EID: 0031140857     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.598276     Document Type: Article

References (43)

1. L.G. Shapiro and R.M. Haralick, "Structural Descriptions and Inexact Matching," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 504-519, 1981.
2. L.G. Shapiro and R.M. Haralick, "A Metric for Computing Relational Description," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, pp. 90-94, 1985.
3. D. Yasuda, L. Cinque, L.G. Shapiro, S. Tanimoto, and R. Allen, "An Improved Algorithm for Relational Distance Graph Matching," Pattern Recognition, pp. 349-359, 1996.
4. H.G. Barrow, A.P. Ambler, and R.M. Burstall, "Some Techniques for Recognizing Structures in Pictures," Frontiers of Pattern Recognition, pp. 1-29, Academic Press, 1972.
5. D.L. Waltz, "Understanding Line Drawing of Scenes with Shadows," The Psycology of Computer Vision, Winston, ed., pp. 19-91, 1975.
6. U. Montanari, "Networks of Constraints: Fundamental Properties and Application to Picture Processing," Information Science, vol. 7, pp. 95-132, 1974.
7. E.C. Freuder, " Synthesizing Constraint Expression," Comm. ACM, vol. 21, no. 11, pp. 958-966, 1978.
8. B.A. Nadel, "Constraint Satisfaction Algorithms," Computational Intelligence, vol. 5, pp. 188-224, 1989.
9. E.C. Freuder, "A Sufficient Condition of Backtrack-Free Search," J. ACM, vol. 29, no. 1, pp. 24-32, 1982.
10. R. Dechter and J. Pearl, "Network-Based Heuristics for Constraint-Sotisfaction Problems," Artificial Intelligence, vol. 34, pp. 1-38, 1987.
11. P.V. Hentenryck, Y. Deville, and C.-M. Teng, "A Generic Arc-Consistency Algorithm and Its Specializations," Artificial Intelligence, vol. 57, pp. 291-321, 1992.
12. V. Kumar, "Algorithms for Constraint-Satisfaction Problem: A Survey," AI Magazine, pp. 32-44, Spring 1992.
13. R.C. Bolles and P. Haraud, "3DPO: A Three Dimensional Part Orientation System," Int'l J. Robotics Research, vol. 5, no. 3, pp. 3-26, 1986.
14. S. Umeyama, "An Eigendecomposition Approach to Weighted Graph Matching Problem," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988.
15. N.J. Ayache and O.D. Faugeras, "HYPER: A New Approach for the Recognition and Positioning of Two-Dimensional Objects," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 1, pp. 44-54, Jan. 1986.
16. W. Eric, L. Grimson, and T. Lozano-Perez, "Localizing Overlapping Parts by Searching thr Interpretation Tree," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 9, no. 4, pp. 469-482, Apr. 1987.
17. A.K. Jain and R. Hoffman, "Evidence-Based Recognition of 3D Objects," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 6, pp. 783-802, June 1988.
18. I. Gaudron, "2D Objects Recognition by Graph Matching," Proc. ICPR, vol. II, conf. B, pp. 508-511, 1992.
19. J.G. Harris and A.M. Flynn, "Object Recognition Using the Connection Machine's Router," Proc. Computer Vision and Pattern Recognition, pp. 134-139, 1986.
20. I. Rigoutsos and R. Hummel, "Massively Parallel Model Matching - Geometric Hashing on the Connection Machine," Computer, vol. 25, no. 2, pp. 33-42, Feb. 1992.
21. L.W. Tucker, C.R. Feynman, and D.M. Fritzsche, "Object Recognition Using the Connection Machine," Proc. IEEE-CVPR 88, pp. 871-878, 1988.
22. T.A. Cass, "A Robust Parallel Implementation of 2D Model-Based Recognition," Proc. IEEE-CVPR 88, pp. 879-884, 1988.
23. T.S. Newman, A.K. Jain, and R.J. Enbody, "3D Object Recognition: Interpretation Tree Search on a MIMD Machine," Proc. ICPR 92, vol. I, pp. 337-340, 1992.
24. C.C. Reinhart and R. Nevatia, "Issues in Parallel Tree Search for Object Recognition," Proc. ICPR 92, vol. IV, pp. 225-228, 1992.
25. C. Ebeling, All The Right Moves. MIT Press, 1987.
26. V.N. Rao, V. Kumar, and K. Ramesh, "A Parallel Implementation of Iterative-Deepening-A*," Proc. AAAI 87, pp. 178-182, 1987.
27. V.N. Rao and V. Kumar, "Parallel Depth-First Search, Part I: Implementation," Int'l J. Parallel Programming, vol. 16, no. 6, pp. 479-499, 1987.
28. V. Kumar and V.N. Rao, "Parallel Depth-First Search, Part II: Analysis," Int'l J. Parallel Programming, vol. 16, no. 6, pp. 501-519, 1987.
29. R. Feldmann, B. Monier, P. Mysliwietz, and O. Vornberger, "Distributed Games Tree Search," Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, 1989.
30. G. Baudet, "The Design and Analysis of Algorithms for Asynchronous Multiprocessors," PhD dissertation, Computer Science Dept., Carnegie-Mellon Univ., 1978.
31. V. Kumar, P.S. Gopalakrishnan, and L.N. Kanal, Parallel Algorithms for Machine Intelligence and Vision. Springer-Verlag, 1990.
32. A. Mahanti and C.J. Daniels, "A SIMD Approach to Parallel Heuristic Search," Artificial Intelligence, vol. 60, pp. 243-282, 1993.
33. C. Powley, C. Ferguson, and R.E. Korf, "Depth-First Heuristic Search on a SIMD Machine," Artificial Intelligence, vol. 60, pp. 199-241, 1993.
34. G. Karypis and V. Kumar, "Unstructured Tree Search on SIMD Parallel Computers," IEEE Trans. Parallel and Distributed Systems, vol. 5, pp. 1,057-1,072, 1994.
35. V. Kumar and L.N. Kanal, "Parallel Branch-and-Bound Formulations for AND/OR Tree Search," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 768-778, 1984.
36. B.W. Wah, G.J. Li, and C.F. Yu, "Multiprocessing of Combinatorial Search Problems," Computer, vol. 18, no. 6, pp. 93-108, June 1985.
37. J.K. Cheng and T.S. Huang, "Image Registration by Matching Relational Structures," Pattern Recognition, vol. 17, no. 1, pp. 149-159, 1984.
38. B. Radig, "Image Sequence Analysis Using Relational Structures," Pattern Recognition, vol. 17, no. 1, pp. 161-167, 1984.
39. A. Wong and M. You, "Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 7, no. 5, pp. 599-609, May 1985.
40. K.L. Boyer and A.C. Kak, "Structural Stereopsis for 3D Vision," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 2, pp. 144-166, Feb. 1988.
41. B. Yang, W.E. Snyder, and G.L. Bilbro, "Matching Oversegmented 3D Images to Models Using Associated Graphs," Image and Vision Computing, vol. 7, no. 2, pp. 135-143, 1989.
42. G. Vosselman, Relational Matching. Berlin: Springer-Verlag, 1992.
43. K. Sengupta and K.L. Boyer, "Information Theoretic Clustering of Large Structural Modelbases," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 174-179, 1993.