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

被引:23
作者
Hong, PY
Huang, TS
机构
[1] Harvard Univ, Sci Ctr 601, Cambridge, MA 02138 USA
[2] Univ Illinois, Beckman Inst Adv Sci & Technol, Urbana, IL 61801 USA
关键词
spatial pattern discovery; attributed relational graph; parametric attributed relational graph; EM algorithm;
D O I
10.1016/j.dam.2002.11.007
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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. (C) 2003 Elsevier B.V. All rights reserved.
引用
收藏
页码:113 / 135
页数:23
相关论文
共 21 条
[11]  
HONG P, 2000, IEEE COMP SOC C COMP
[12]   MATCHING - INVARIANT TO TRANSLATIONS, ROTATIONS AND SCALE CHANGES [J].
LI, SZ .
PATTERN RECOGNITION, 1992, 25 (06) :583-594
[13]  
Maron O., 1998, NEURAL INFORM PROCES
[14]  
Ratan A. L., 1999, Proceedings. 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No PR00149), P423, DOI 10.1109/CVPR.1999.786973
[15]   SCENE LABELING BY RELAXATION OPERATIONS [J].
ROSENFELD, A ;
HUMMEL, RA ;
ZUCKER, SW .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1976, 6 (06) :420-433
[16]   STRUCTURAL DESCRIPTIONS AND INEXACT MATCHING [J].
SHAPIRO, LG ;
HARALICK, RM .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1981, 3 (05) :504-519
[17]   ERROR-CORRECTING ISOMORPHISMS OF ATTRIBUTED RELATIONAL GRAPHS FOR PATTERN-ANALYSIS [J].
TSAI, WH ;
FU, KS .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1979, 9 (12) :757-768
[18]   AN EIGENDECOMPOSITION APPROACH TO WEIGHTED GRAPH MATCHING PROBLEMS [J].
UMEYAMA, S .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1988, 10 (05) :695-703
[19]   Structural matching by discrete relaxation [J].
Wilson, RC ;
Hancock, ER .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1997, 19 (06) :634-648
[20]   Minimax entropy principle and its application to texture modeling [J].
Zhu, SC ;
Wu, YN ;
Mumford, D .
NEURAL COMPUTATION, 1997, 9 (08) :1627-1660