Maximum entropy Gibbs density modeling for pattern classification (Q406236)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Maximum entropy Gibbs density modeling for pattern classification |
scientific article |
Statements
Maximum entropy Gibbs density modeling for pattern classification (English)
0 references
8 September 2014
0 references
Summary: Recent studies have shown that the Gibbs density function is a good model for visual patterns and that its parameters can be learned from pattern category training data by a gradient algorithm optimizing a constrained entropy criterion. These studies represented each pattern category by a single density. However, the patterns in a category can be so complex as to require a representation spread over several densities to more accurately account for the shape of their distribution in the feature space. The purpose of the present study is to investigate a representation of visual pattern category by several Gibbs densities using a Kohonen neural structure. In this Gibbs density based Kohonen network, which we call a Gibbsian Kohonen network, each node stores the parameters of a Gibbs density. Collectively, these Gibbs densities represent the pattern category. The parameters are learned by a gradient update rule so that the corresponding Gibbs densities maximize entropy subject to reproducing observed feature statistics of the training patterns. We verified the validity of the method and the efficiency of the ensuing Gibbs density pattern representation on a handwritten character recognition application.
0 references
maximum entropy
0 references
Kohonen neural network
0 references
Gibbs density
0 references
parameter estimation
0 references
pattern classification
0 references
handwritten characters
0 references