Abstract
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A good arrangement should enable the one-dimensional sequences to be modeled as Markov chains or shifts of finite type. Since this is not possible in general, two-dimensional data is most commonly scanned by rows, columns, or diagonals. We look into three unusual ways to write a sequence in the plane: by Penrose tilings, by space-filling curves, and by cylindrical and spiral lattices. We show how Penrose tilings can be used to record information and how some spiral lattices can be used for quantization of color spaces.
Original language | English (US) |
---|---|
Pages (from-to) | 1344-1354 |
Number of pages | 11 |
Journal | IEEE Transactions on Information Theory |
Volume | 48 |
Issue number | 6 |
DOIs | |
State | Published - Jun 2002 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Color quantization
- Cylindrical and spiral lattices
- Image processing
- Information recording
- Penrose tilings
- Space-filling curves