An address generator, for an N-dimensional pseudo-Hilbert scan in a hyper-rectangular, parallelepiped region

The Hilbert curve is a one-to-one mapping between N-dimensional (N-D) space and 1-D space. The Hilbert curve has been applied to image processing as a scanning technique (Hilbert scan). Applications to multi-dimensional image processing are also studied. In this application. We use the N-D Hilbert scan which maps N-D data to 1-D data along the N-D Hilbert curve. However, the N-D Hilbert scan is the application limited to data in a hyper-cube region. In this paper, we present a novel algorithm for generating N-D pseudo-Hilbert curves in a hyper-rectangular parallelepiped region. Our algorithm is suitable for real-time processing and is easy to implement in hardware, since it is a simple and non-recursive computation using look-up tables.

[1]  D. Hilbert.  Ueber die stetige Abbildung einer Line auf ein Flächenstück , 1891 .

[2]  Sei-ichiro Kamata,et al.  An address generator of a pseudo-Hilbert scan in a rectangle region , 1997, Proceedings of International Conference on Image Processing.

[3]  Sei-ichiro Kamata,et al.  A new algorithm for N-dimensional Hilbert scanning , 1999, IEEE Trans. Image Process..

[4]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[5]  Joël Quinqueton,et al.  A Locally Adaptive Peano Scanning Algorithm , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Arthur R. Butz,et al.  Convergence with Hilbert's Space Filling Curve , 1969, J. Comput. Syst. Sci..