Supervised texture classification using a probabilistic neural network and constraint satisfaction model

In this paper, the texture classification problem is projected as a constraint satisfaction problem. The focus is on the use of a probabilistic neural network (PNN) for representing the distribution of feature vectors of each texture class in order to generate a feature-label interaction constraint. This distribution of features for each class is assumed as a Gaussian mixture model. The feature-label interactions and a set of label-label interactions are represented on a constraint satisfaction neural network. A stochastic relaxation strategy is used to obtain an optimal classification of textures in an image. The advantage of this approach is that all classes in an image are determined simultaneously, similar to human perception of textures in an image.

[1]  E. Parzen On Estimation of a Probability Density Function and Mode , 1962 .

[2]  Bayya Yegnanarayana,et al.  A combined neural network approach for texture classification , 1995, Neural Networks.

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Bayya Yegnanarayana,et al.  Segmentation of Gabor-filtered textures using deterministic relaxation , 1996, IEEE Trans. Image Process..

[5]  Anil K. Jain,et al.  Unsupervised texture segmentation using Gabor filters , 1990, 1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings.

[6]  Bayya Yegnanarayana,et al.  Multispectral Image Classification Using Gabor Filters and Stochastic Relaxation Neural Network , 1997, Neural Networks.

[7]  Geoffrey E. Hinton,et al.  Schemata and Sequential Thought Processes in PDP Models , 1986 .

[8]  Wilson S. Geisler,et al.  Multichannel Texture Analysis Using Localized Spatial Filters , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Jon Sticklen,et al.  Knowledge-based segmentation of Landsat images , 1991, IEEE Trans. Geosci. Remote. Sens..

[10]  Rama Chellappa,et al.  A unified approach to boundary perception: edges, textures, and illusory contours , 1993, IEEE Trans. Neural Networks.

[11]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[12]  Rama Chellappa,et al.  Texture segmentation with neural networks , 1992 .

[13]  Donald B. Rubin,et al.  Max-imum Likelihood from Incomplete Data , 1972 .

[14]  Teuvo Kohonen,et al.  The self-organizing map , 1990, Neurocomputing.

[15]  Michael Spann,et al.  Texture feature performance for image segmentation , 1990, Pattern Recognit..

[16]  Andrew Blake,et al.  The least-disturbance principle and weak constraints , 1983, Pattern Recognit. Lett..

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

[18]  Donald F. Specht,et al.  Generation of Polynomial Discriminant Functions for Pattern Recognition , 1967, IEEE Trans. Electron. Comput..

[19]  Donald F. Specht,et al.  Probabilistic neural networks , 1990, Neural Networks.

[20]  C. Gielen,et al.  Neural computation and self-organizing maps, an introduction , 1993 .