A generalized 3-D Hilbert scan using look-up tables

Jian Zhang, Seiichiro Kamata

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The Hilbert curve is a one-to-one mapping between multidimensional space and one-dimensional (1-D) space. Due to the advantage of preserving high correlation of multidimensional points, it receives much attention in many areas. Especially in image processing, Hilbert curve is studied actively as a scan technique (Hilbert scan). Currently there have been several Hilbert scan algorithms, but they usually have strict implementation conditions. For example, they use recursive functions to generate scans, which makes the algorithms complex and difficult to implement in real-time systems. Moreover the length of each side in a scanned region should be same and equal to the power of two, which limits the application of Hilbert scan greatly. In this paper, to remove the constraints and improve the Hilbert scan for a general application, an effective generalized three-dimensional (3-D) Hilbert scan algorithm is proposed. The proposed algorithm uses two simple look-up tables instead of recursive functions to generate a scan, which greatly reduces the computational complexity and saves storage memory. Furthermore, the experimental results show that the proposed generalized Hilbert scan can also take advantage of the high correlation between neighboring lattice points in an arbitrarily-sized cuboid region, and give competitive performance in comparison with some common scan techniques.

Original languageEnglish
Pages (from-to)418-425
Number of pages8
JournalJournal of Visual Communication and Image Representation
Volume23
Issue number3
DOIs
Publication statusPublished - 2012 Apr

Fingerprint

Recursive functions
Real time systems
Computational complexity
Image processing
Data storage equipment

Keywords

  • Euclidean distance
  • Hilbert curve
  • Look-up table
  • One-to-one mapping
  • Point neighborhoods
  • Scanning length
  • Self-similarity
  • Space-filling

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Media Technology
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

A generalized 3-D Hilbert scan using look-up tables. / Zhang, Jian; Kamata, Seiichiro.

In: Journal of Visual Communication and Image Representation, Vol. 23, No. 3, 04.2012, p. 418-425.

Research output: Contribution to journalArticle

@article{8bb3f67af9f8434dbe7d6860fc34ee38,
title = "A generalized 3-D Hilbert scan using look-up tables",
abstract = "The Hilbert curve is a one-to-one mapping between multidimensional space and one-dimensional (1-D) space. Due to the advantage of preserving high correlation of multidimensional points, it receives much attention in many areas. Especially in image processing, Hilbert curve is studied actively as a scan technique (Hilbert scan). Currently there have been several Hilbert scan algorithms, but they usually have strict implementation conditions. For example, they use recursive functions to generate scans, which makes the algorithms complex and difficult to implement in real-time systems. Moreover the length of each side in a scanned region should be same and equal to the power of two, which limits the application of Hilbert scan greatly. In this paper, to remove the constraints and improve the Hilbert scan for a general application, an effective generalized three-dimensional (3-D) Hilbert scan algorithm is proposed. The proposed algorithm uses two simple look-up tables instead of recursive functions to generate a scan, which greatly reduces the computational complexity and saves storage memory. Furthermore, the experimental results show that the proposed generalized Hilbert scan can also take advantage of the high correlation between neighboring lattice points in an arbitrarily-sized cuboid region, and give competitive performance in comparison with some common scan techniques.",
keywords = "Euclidean distance, Hilbert curve, Look-up table, One-to-one mapping, Point neighborhoods, Scanning length, Self-similarity, Space-filling",
author = "Jian Zhang and Seiichiro Kamata",
year = "2012",
month = "4",
doi = "10.1016/j.jvcir.2011.12.005",
language = "English",
volume = "23",
pages = "418--425",
journal = "Journal of Visual Communication and Image Representation",
issn = "1047-3203",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

T1 - A generalized 3-D Hilbert scan using look-up tables

AU - Zhang, Jian

AU - Kamata, Seiichiro

PY - 2012/4

Y1 - 2012/4

N2 - The Hilbert curve is a one-to-one mapping between multidimensional space and one-dimensional (1-D) space. Due to the advantage of preserving high correlation of multidimensional points, it receives much attention in many areas. Especially in image processing, Hilbert curve is studied actively as a scan technique (Hilbert scan). Currently there have been several Hilbert scan algorithms, but they usually have strict implementation conditions. For example, they use recursive functions to generate scans, which makes the algorithms complex and difficult to implement in real-time systems. Moreover the length of each side in a scanned region should be same and equal to the power of two, which limits the application of Hilbert scan greatly. In this paper, to remove the constraints and improve the Hilbert scan for a general application, an effective generalized three-dimensional (3-D) Hilbert scan algorithm is proposed. The proposed algorithm uses two simple look-up tables instead of recursive functions to generate a scan, which greatly reduces the computational complexity and saves storage memory. Furthermore, the experimental results show that the proposed generalized Hilbert scan can also take advantage of the high correlation between neighboring lattice points in an arbitrarily-sized cuboid region, and give competitive performance in comparison with some common scan techniques.

AB - The Hilbert curve is a one-to-one mapping between multidimensional space and one-dimensional (1-D) space. Due to the advantage of preserving high correlation of multidimensional points, it receives much attention in many areas. Especially in image processing, Hilbert curve is studied actively as a scan technique (Hilbert scan). Currently there have been several Hilbert scan algorithms, but they usually have strict implementation conditions. For example, they use recursive functions to generate scans, which makes the algorithms complex and difficult to implement in real-time systems. Moreover the length of each side in a scanned region should be same and equal to the power of two, which limits the application of Hilbert scan greatly. In this paper, to remove the constraints and improve the Hilbert scan for a general application, an effective generalized three-dimensional (3-D) Hilbert scan algorithm is proposed. The proposed algorithm uses two simple look-up tables instead of recursive functions to generate a scan, which greatly reduces the computational complexity and saves storage memory. Furthermore, the experimental results show that the proposed generalized Hilbert scan can also take advantage of the high correlation between neighboring lattice points in an arbitrarily-sized cuboid region, and give competitive performance in comparison with some common scan techniques.

KW - Euclidean distance

KW - Hilbert curve

KW - Look-up table

KW - One-to-one mapping

KW - Point neighborhoods

KW - Scanning length

KW - Self-similarity

KW - Space-filling

UR - http://www.scopus.com/inward/record.url?scp=84862822253&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84862822253&partnerID=8YFLogxK

U2 - 10.1016/j.jvcir.2011.12.005

DO - 10.1016/j.jvcir.2011.12.005

M3 - Article

AN - SCOPUS:84862822253

VL - 23

SP - 418

EP - 425

JO - Journal of Visual Communication and Image Representation

JF - Journal of Visual Communication and Image Representation

SN - 1047-3203

IS - 3

ER -