Adaptive Pattern Recognition

A long term goal of research in artificial intelligence is todetermine and to implement principles which permit a movable machine to direct its actions depending uponsensory feed-back from its environment. This paper concentrates onspatial sensors which input images (2-dimensional arrays). A proposal is put forward in which the machine adaptsto the actual data, and examplesare given of input prediction, of detection of unexpected events, andof recognition of spatial patterns.The image sequence is locally partitioned into temporally contiguous subsequences of afixed spatial extent. The spatial extent is constant over time and the temporal extent of a subsequence is maximizedsubject to the condition that the subsequence has occurred previously. The principle is illustrated on image sequences. It is further demonstrated on images which are structured as pseudo-temporal sequences of their rows. The demonstrations use diverse complex and simple examples to illustrate theversatility of the method. The demonstrations show that to a large degree it is not necessary for the user to supply explicit models for different patternrecognition tasks.

[1]  Ian H. Witten,et al.  Text Compression , 1990, 125 Problems in Text Algorithms.

[2]  Guido Gerig,et al.  Vector-Valued Diffusion , 1994, Geometry-Driven Diffusion in Computer Vision.

[3]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[4]  Stephen Wolfram,et al.  Cellular automata as models of complexity , 1984, Nature.

[5]  Tony Lindeberg,et al.  Scale-Space Theory in Computer Vision , 1993, Lecture Notes in Computer Science.

[6]  Abraham Lempel,et al.  On the Complexity of Finite Sequences , 1976, IEEE Trans. Inf. Theory.

[7]  Yvan G. Leclerc,et al.  Constructing simple stable descriptions for image partitioning , 1989, International Journal of Computer Vision.

[8]  Joan L. Mitchell,et al.  JPEG: Still Image Data Compression Standard , 1992 .

[9]  J. Sporring Pruning with Minimum Description Length , 1995 .

[10]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[11]  Ross N. Williams,et al.  Adaptive Data Compression , 1990 .

[12]  Mads Nielsen From Paradigm to Algorithms in Computer Vision , 1995 .

[13]  Jorma Rissanen,et al.  Stochastic Complexity in Statistical Inquiry , 1989, World Scientific Series in Computer Science.

[14]  Michael Rodeh,et al.  Linear Algorithm for Data Compression via String Matching , 1981, JACM.

[15]  Abraham Lempel,et al.  Compression of two-dimensional data , 1986, IEEE Trans. Inf. Theory.

[16]  Xerox Polo,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976 .

[17]  Tony Lindeberg,et al.  Segmentation and Classification of Edges Using Minimum Description Length Approximation and Complementary Junction Cues , 1996, Comput. Vis. Image Underst..

[18]  Peter Johansen On-line String Matching with Feedback , 1995, Theor. Comput. Sci..

[19]  M. Crochemore,et al.  On-line construction of suffix trees , 2002 .

[20]  JORMA RISSANEN,et al.  A universal data compression system , 1983, IEEE Trans. Inf. Theory.