N-dimensional hilbert scanning and its application to data compression

Arnulfo Perez, Seiichiro Kamata, Eiji Kawaguchi

研究成果: Conference article査読

3 被引用数 (Scopus)


Hubert scanning defines a mapping, h :-U, that maps the unit interval onto the n-dimensional unit hypercube continuously. In the discrete case the mapping can be described in terms of Reflected Binary Gray Codes (RBGC). In order to extend the quantized mapping to arbitrary precision it is necessary to define induction rules. Induction rules are defined in terms of a single canonical sequence and a set of rotations. In general, in an n-dimensional hypercube there are n2" possible orientations of a canonical form. Beyond two dimensions, it is possible to have non-trivially different paths between two possible orientations and it is better to define the induction rule in terms of the end points of the RBGC subsequences. Hilbert coding is used for n-dimensional binary data compression. The effectiveness of this method to data compression is confirmed. Experimental evaluation shows Hilbert-Wyle coding to be consistently better than other standard compression methods.

ジャーナルProceedings of SPIE - The International Society for Optical Engineering
出版ステータスPublished - 1991 6月 1
イベントImage Processing Algorithms and Techniques II 1991 - San Jose, United States
継続期間: 1991 2月 11991 2月 7

ASJC Scopus subject areas

  • 電子材料、光学材料、および磁性材料
  • 凝縮系物理学
  • コンピュータ サイエンスの応用
  • 応用数学
  • 電子工学および電気工学


「N-dimensional hilbert scanning and its application to data compression」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。