Spatial pattern discovery by learning a probabilistic parametric model from multiple attributed relational graphs

Discrete Applied Mathematics

Volumn 139, Issue 1-3, 2004, Pages 113-135

  Hong, Pengyu ^a   Huang, Thomas S ^b  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

Attributed relational graph; EM algorithm; Parametric attributed relational graph; Spatial pattern discovery

Indexed keywords

ALGORITHMS; ESTIMATION; GRAPH THEORY; IMAGE ANALYSIS; MATHEMATICAL MODELS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

ATTRIBUTED RELATIONAL GRAPH; EM ALGORITHM; PARAMETERIC ATTRIBUTED RELATIONAL GRAPH; SPATIAL PATTERN DISCOVERY;

PATTERN RECOGNITION;

EID: 1842787456     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2002.11.007     Document Type: Conference Paper

References (21)

1. Almohamad H.A., Duffuaa S.O. A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15:1993;522-525.
2. Bertsekas D.P. Nonlinear Programming. 1995;Athena Scientific, Belmonte, MA, USA.
3. Bhanu B., Faugeras O.D. Shape matching of two-dimensional objects. IEEE Trans. Pattern Anal. Mach. Intell. 6:1984;137-156.
4. Christmas W.J., Kittler J., Petrou M. Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17(8):1995;749-764.
5. Dempster A.P., Laird N.M., Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. Ser. B. 39(1):1977;1-38.
6. P.F. Felzenszwalb, D.O. Huttenlocher, Image segmentation using local variation, in: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1998, pp. 98-104.
7. B.J. Frey, N. Jojic, Transformed component analysis: Joint estimation of spatial transformations and image components, International Conference on Comput. Vision, 1999.
8. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W. H. Freeman and Company, New York.
9. P. Hong, T.S. Huang, Extracting the recurring patterns from image, The 4th Asian Conference on Computer Vision, Taipei, Taiwan, 2000.
10. P. Hong, R. Wang, T.S. Huang, Learning patterns from images by combining soft decisions and hard decisions, IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Hilton Head Island, South Carolina, USA, 2000.
11. Li S.Z. Matching. Invariant to translations, rotations and scale changes Pattern Recognition. 25:1992;583-594.
12. O. Maron, T. Lozano-Prez, A framework for multiple-instance learning, Neural Inform. Process. Systems, 1998.
13. A.L. Ratan, O. Maron, et al., A framework for learning query concepts in image classification, In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Ft. Collins, CO, USA, 1999, pp. 423-429.
14. Rosenfeld A., Hummel R., Zucker S. Scene labeling by relaxation operations. IEEE Trans. Systems, Man Cybernet. 6:1976;420-433.
15. Shapiro L.G., Haralick R.M. Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. Mach. Intell. 3:1981;504-519.
16. M.A. Tanner, W.H. Wong, The calculation of posterior distributions by data augmentation (with discussion), J. Amer. Statist. Assoc. 82 805-811.
17. Tsai W.H., Fu K.S. Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Trans. Systems Man Cybernet. 9:1979;757-768.
18. S. Umeyama, An eigen-decomposition approach to weighted graph matching problems, IEEE Trans. Pattern Anal. Mach. Intell. 10 (1988) 695-703.
19. Wilson R.C., Hancock E.R. Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19(6):1997;634-648.
20. S.C. Zhu, C.E. Guo, Conceptualization and modeling of visual patterns, International Workshop on Perceptual Organization in Computer Vision, Vancouver, Canada, 2001.
21. Zhu S.C., Wu Y.N., Mumford D.B. Minimax entropy principle and its applications to texture modeling. Neural Comput. 9:1997;1627-1660.