Adaptive Pattern Recognition

Journal of Mathematical Imaging and Vision

Volumn 7, Issue 4, 1997, Pages 325-339

  Johansen, Peter ^a,b,c,d,e  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d University of Manoa   (United States)

^e Roy Danish Acad Sci and Letters   (Denmark)

Author keywords

Data complexity; Image processing; Pattern recognition; Prediction; Surveillance

Indexed keywords

ADAPTIVE SYSTEMS; ARTIFICIAL INTELLIGENCE; DATA ACQUISITION; IMAGE ANALYSIS; IMAGE SENSORS;

KOLMOGOROV COMPLEXITY; PSEUDO TEMPORAL SEQUENCES;

COMPUTER VISION;

EID: 0031249355     PISSN: 09249907     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008207228099     Document Type: Article

References (21)

1. T.C. Bell, J.G. Cleary, and I.H. Witten, Text Compression, Prentice Hall, 1990.
2. P. Brodatz, A Texture Book, Dover Publications, 1966.
3. Peter Johansen, "On-line string matching with feedback," Theoretical Computer Science, pp. 53-67, April 1995.
4. Y.C. Leclerc, "Constructing simple stable descriptions for image partitioning," International Journal of Computer Vision, Vol. 3, pp. 73-102, 1989.
5. Abraham Lempel and Jacob Ziv, "On the complexity of finite sequences," IEEE Transactions on Information Theory, Vol. 22, pp. 75-81, 1976.
6. Abraham Lempel and Jacob Ziv. "Compression of two-dimensional data," IEEE Transactions on Information Theory, Vol. 32, No. 1, pp. 2-8, 1986.
7. Li and Vitanýi, An Introduction to Kolmorogov Complexity and its Applications, North Holland, 1993.
8. Tony Lindeberg, Scale-Space Theory in Computer Vision, Kluwer, 1994.
9. Tony Lindeberg and Meng-Xiang Li, "Segmentation and classification of edges using minimum description length approximation and complementary junction cues," in Proceedings of the Ninth Scandinavian Conference on Image Analysis, G. Börjefors (Ed.), 1995.
10. E.M. McCreight, "A space-economical suffix tree construction algorithm," Journal of the ACM, Vol. 23, pp. 262-272, 1976.
11. Mads Nielsen, "From paradigm to algorithms in computer vision," Ph.D. thesis, DIKU, Datalogisk Institut ved Københavns Universitet, Copenhagen, Denmark, DIKU-95-8. April 1995.
12. William B. Pennebaker and J.L. Mitchell, JPEG Still Image Data Compression Standard, Van Nostrand Reinhold, 1993.
13. Jorma Rissanen, "A universal data compression system," IEEE Transactions on Information Theory, Vol. IT-29, pp. 656-664, 1983.
14. Jorma Rissanen, Stochastic Complexity in Statistical Inquiry, World Scientific, 1989.
15. M. Rodeh, V.R. Pratt, and S. Even, "Linear algorithm for data compression via string matching," JACM, Vol. 28, pp. 16-24, 1981.
16. Jon Sporring, "Pruning with minimum description length," in Proceedings of the 5th Scandinavian Conference on Artificial Intelligence (SCAI'95), Trondheim, Norway, May 29-30, 1995, pp. 157-168.
17. E. Ukkonen, "Online construction of suffix trees," Algoritmica, Vol. 14, No. 3, pp. 249-260, Sept. 1995.
18. P. Weiner, "Linear pattern matching algorithms," in 14th Annual Symposium on Switching and Automata Theory, pp. 1-11, 1973.
19. Ross Whitaker and G. Gerig, "Vector-valued diffusion," in Geometry-Driven Diffusion in Computer Vision, Bart M. der Haar Romeny (Ed.), pp. 93-134. Kluwer, 1994.
20. Ross N. Williams. Adaptive Data Compression, Kluwer Academic Publishers, 1991.
21. S. Wolfram, "Cellular automata as models of complexity," Nature, p. 311, 1984.