Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Sei-ichiro KAMATA, Michiharu NIIMI, Eiji KAWAGUCHI, "A Method of Making Lookup Tables for Hilbert Scans*" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 3, pp. 249-251, March 1996, doi: .
Abstract: Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_3_249/_p
Copy
@ARTICLE{e79-d_3_249,
author={Sei-ichiro KAMATA, Michiharu NIIMI, Eiji KAWAGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={A Method of Making Lookup Tables for Hilbert Scans*},
year={1996},
volume={E79-D},
number={3},
pages={249-251},
abstract={Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - A Method of Making Lookup Tables for Hilbert Scans*
T2 - IEICE TRANSACTIONS on Information
SP - 249
EP - 251
AU - Sei-ichiro KAMATA
AU - Michiharu NIIMI
AU - Eiji KAWAGUCHI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1996
AB - Recently applications of Hilbert curves are studied in the area of image processing, image compression, computer hologram, etc. We have proposed a fast Hilbert scanning algorithm using lookup tables in N dimensional space. However, this scan is different from the one of previously proposed scanning algorithms. Making the lookup tables is a problem for the generation of several Hilbert scans. In this note, we describe a method of making lookup tables from a given Hilbert scan which is obtained by other scanning methods.
ER -