A new algorithm for N-dimensional Hilbert scanning
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 8 (7) , 964-973
- https://doi.org/10.1109/83.772242
Abstract
There have been many applications of the Hilbert curve, such as image processing, image compression, computer hologram, etc. The Hilbert curve is a one-to-one mapping between N-dimensional space and one-dimensional (l-D) space which preserves point neighborhoods as much as possible. There are several algorithms for N-dimensional Hilbert scanning, such as the Butz algorithm and the Quinqueton algorithm. The Butz algorithm is a mapping function using several bit operations such as shifting, exclusive OR, etc. On the other hand, the Quinqueton algorithm computes all addresses of this curve using recursive functions, but takes time to compute a one to-one mapping correspondence. Both algorithms are complex to compute and both are difficult to implement in hardware. In this paper, we propose a new, simple, nonrecursive algorithm for N-dimensional Hilbert scanning using look-up tables. The merit of our algorithm is that the computation is fast and the implementation is much easier than previous ones.Keywords
This publication has 19 references indexed in Scilit:
- New efficient representation of photographic images with restricted number of gray levelsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Interactive analysis of multi-spectral images using a Hilbert curvePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the metric properties of discrete space-filling curvesIEEE Transactions on Image Processing, 1996
- Space-filling curves for image compressionPublished by SPIE-Intl Soc Optical Eng ,1991
- High-Speed Manipulation of the Color Chromaticity of Digital ImagesIEEE Computer Graphics and Applications, 1984
- A Locally Adaptive Peano Scanning AlgorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Mathematical GamesScientific American, 1976
- Alternative Algorithm for Hilbert's Space-Filling CurveIEEE Transactions on Computers, 1971
- Mapping Multidimensional Space to One Dimension for Computer Output DisplayIEEE Transactions on Computers, 1968
- Sur une courbe, qui remplit toute une aire planeMathematische Annalen, 1890