An algorithm for analysis of images in spatial information systems

Authors:
Sergey N. Bereg;Andrei V. Kelarev
Affiliations:
Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX;School of Computing, University of Tasmania, Private Bag 100, Hobart, Tasmania 7001, Australia
Venue:
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the 13th Australasian workshop on combinatorial algorithms
Year:
2003

Citing 8
Cited 0

Text algorithms

Text algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Automata for matching patterns

Handbook of formal languages, vol. 2
Digital images and formal languages

Handbook of formal languages, vol. 3
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Handbook of Theoretical Computer Science

Handbook of Theoretical Computer Science
Theory of Automata

Theory of Automata
Algebraic Theory of Automata & Languages

Algebraic Theory of Automata & Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper begins with a brief overview of formal concepts involved in specification of images in spatial information systems. It is shown how several efficient string processing algorithms can be used for approximation, compression and analysis of images. We discuss main adjustments required for applying string algorithms in order to analyze spatial data. A first basic practical polynomial algorithm for finding all maximal repeated rectangular patterns in an image is included to illustrate our general approach.