1 June 1991 N-dimensional Hilbert scanning and its application to data compression
Author Affiliations +
Abstract
Hilbert scanning defines a mapping, hn : R yields Un, 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 n2n possible orientations of a canonical form. Beyond two dimensions, it is possible to have nontrivially 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.
© (1991) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Arnulfo Perez, Arnulfo Perez, Sei-ichiro Kamata, Sei-ichiro Kamata, Eiji Kawaguchi, Eiji Kawaguchi, } "N-dimensional Hilbert scanning and its application to data compression", Proc. SPIE 1452, Image Processing Algorithms and Techniques II, (1 June 1991); doi: 10.1117/12.45401; https://doi.org/10.1117/12.45401
PROCEEDINGS
12 PAGES


SHARE
Back to Top