4.7 Article

Learning mixtures of point distribution models with the EM algorithm

期刊

PATTERN RECOGNITION
卷 36, 期 12, 页码 2805-2818

出版社

ELSEVIER SCI LTD
DOI: 10.1016/S0031-3203(03)00139-0

关键词

point distribution models; expectation maximization algorithm; unsupervised learning; alignment; shape recognition; Arabic character

向作者/读者索取更多资源

This paper demonstrates how the EM algorithm can be used for learning and matching mixtures of point distribution models. We make two contributions. First, we show how shape-classes can be learned in an unsupervised manner. We present a fast procedure for training point distribution models using the EM algorithm. Rather than estimating the class means and covariance matrices needed to construct the PDM, the method iteratively refines the eigenvectors of the covariance matrix using a gradient ascent technique. Second, we show how recognition by alignment can be realised by fitting a mixture of linear shape deformations. We evaluate the method on the problem of learning the class-structure and recognising Arabic characters. (C) 2003 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据