A new algorithm for N-dimensional Hilbert scanning

Sei Ichiro Kamata*, Richard O. Eason, Yukihiro Bandou

*この研究の対応する著者

研究成果査読

57 被引用数 (Scopus)

抄録

There have been many applications of 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 (1-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.

本文言語English
ページ(範囲)964-973
ページ数10
ジャーナルIEEE Transactions on Image Processing
8
7
DOI
出版ステータスPublished - 1999
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ グラフィックスおよびコンピュータ支援設計

フィンガープリント

「A new algorithm for N-dimensional Hilbert scanning」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル