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

This paper presents the methodology and theory for automatic spatial pattern discovery from multiple attributed relational graph samples. The spatial pattern is modelled as a mixture of probabilistic parametric attributed relational graphs. A statistic learning procedure is designed to learn the parameters of the spatial pattern model from the attributed relational graph samples. The learning procedure is formulated as a combinatorial non-deterministic process, which uses the expectation-maximization (EM) algorithm to find the maximum-likelihood estimates for the parameters of the spatial pattern model. The learned model summarizes the samples and captures the statistic characteristics of the appearance and structure of the spatial pattern, which is observed under various conditions. It can be used to detect the spatial pattern in new samples. The proposed approach is applied to unsupervised visual pattern extraction from multiple images in the experiments.

[1]  W. Wong,et al.  The calculation of posterior distributions by data augmentation , 1987 .

[2]  Olivier D. Faugeras,et al.  Shape Matching of Two-Dimensional Objects , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Brendan J. Frey,et al.  Transformed component analysis: joint estimation of spatial transformations and image components , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[4]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Song-Chun Zhu,et al.  Minimax Entropy Principle and Its Application to Texture Modeling , 1997, Neural Computation.

[6]  William J. Christmas,et al.  Structural Matching in Computer Vision Using Probabilistic Relaxation , 1995, IEEE Trans. Pattern Anal. Mach. Intell..

[7]  William M. Wells,et al.  Statistical Approaches to Feature-Based Object Recognition , 2004, International Journal of Computer Vision.

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  W. Eric L. Grimson,et al.  A framework for learning query concepts in image classification , 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149).

[10]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[12]  Ramesh C. Jain,et al.  Three-dimensional object recognition , 1985, CSUR.

[13]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Thomas S. Huang,et al.  Learning patterns from images by combining soft decisions and hard decisions , 2000, Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662).

[15]  Daniel P. Huttenlocher,et al.  Image segmentation using local variation , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[16]  D. Rubin,et al.  Maximum likelihood from incomplete data via the EM - algorithm plus discussions on the paper , 1977 .

[17]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  W. Wolf,et al.  A graph based object description for information retrieval in digital image and video libraries , 1999, Proceedings IEEE Workshop on Content-Based Access of Image and Video Libraries (CBAIVL'99).

[19]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Tomás Lozano-Pérez,et al.  A Framework for Multiple-Instance Learning , 1997, NIPS.

[21]  Salih O. Duffuaa,et al.  A Linear Programming Approach for the Weighted Graph Matching Problem , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Stan Z. Li,et al.  Matching: Invariant to translations, rotations and scale changes , 1992, Pattern Recognit..

[23]  Thomas S. Huang,et al.  Extracting the Recurring Patterns from Image , 2001 .

[24]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[25]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[26]  Josef Kittler,et al.  Contextual classification of multispectral pixel data , 1984, Image Vis. Comput..

[27]  W. W. Bledsoe,et al.  Pattern recognition and reading by machine , 1959, IRE-AIEE-ACM '59 (Eastern).