A pseudo-hilbert scan for arbitrarily-sized arrays

Jian Zhang, Seiichiro Kamata, Yoshifumi Ueshige

研究成果: Article

15 引用 (Scopus)

抄録

The 2-dimensional (2-D) Hilbert curve is a one-to-one mapping between 2-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spacial relationship of the 2-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, both sides of the scanned rectangle must have same size and each size must be a power of two, which limits the application of the Hilbert scan greatly. In this paper, a Pseudo-Hilbert scan algorithm based on two look-up tables is proposed. The proposed method improves the Hilbert scan to be suitable for real-time processing and general application. The simulation indicates that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points. It also shows competitive performance of the Pseudo-Hilbert scan in comparison with other scan techniques.

元の言語English
ページ(範囲)682-690
ページ数9
ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
E90-A
発行部数3
DOI
出版物ステータスPublished - 2007 3

Fingerprint

Hilbert
Recursive functions
D-space
Image processing
Digital Image Processing
Curve
Recursive Functions
Processing
Look-up Table
Lattice Points
Rectangle
Restriction
Real-time

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Information Systems

これを引用

A pseudo-hilbert scan for arbitrarily-sized arrays. / Zhang, Jian; Kamata, Seiichiro; Ueshige, Yoshifumi.

:: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 巻 E90-A, 番号 3, 03.2007, p. 682-690.

研究成果: Article

@article{3a3ec41cc3f043a98e333fc04182b581,
title = "A pseudo-hilbert scan for arbitrarily-sized arrays",
abstract = "The 2-dimensional (2-D) Hilbert curve is a one-to-one mapping between 2-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spacial relationship of the 2-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, both sides of the scanned rectangle must have same size and each size must be a power of two, which limits the application of the Hilbert scan greatly. In this paper, a Pseudo-Hilbert scan algorithm based on two look-up tables is proposed. The proposed method improves the Hilbert scan to be suitable for real-time processing and general application. The simulation indicates that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points. It also shows competitive performance of the Pseudo-Hilbert scan in comparison with other scan techniques.",
keywords = "Euclidean distance, Hilbert curve, Look-up tables, Pseudo-Hilbert scan, Space-filling curve",
author = "Jian Zhang and Seiichiro Kamata and Yoshifumi Ueshige",
year = "2007",
month = "3",
doi = "10.1093/ietfec/e90-a.3.682",
language = "English",
volume = "E90-A",
pages = "682--690",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "3",

}

TY - JOUR

T1 - A pseudo-hilbert scan for arbitrarily-sized arrays

AU - Zhang, Jian

AU - Kamata, Seiichiro

AU - Ueshige, Yoshifumi

PY - 2007/3

Y1 - 2007/3

N2 - The 2-dimensional (2-D) Hilbert curve is a one-to-one mapping between 2-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spacial relationship of the 2-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, both sides of the scanned rectangle must have same size and each size must be a power of two, which limits the application of the Hilbert scan greatly. In this paper, a Pseudo-Hilbert scan algorithm based on two look-up tables is proposed. The proposed method improves the Hilbert scan to be suitable for real-time processing and general application. The simulation indicates that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points. It also shows competitive performance of the Pseudo-Hilbert scan in comparison with other scan techniques.

AB - The 2-dimensional (2-D) Hilbert curve is a one-to-one mapping between 2-D space and one-dimensional (1-D) space. It is studied actively in the area of digital image processing as a scan technique (Hilbert scan) because of its property of preserving the spacial relationship of the 2-D patterns. Currently there exist several Hilbert scan algorithms. However, these algorithms have two strict restrictions in implementation. First, recursive functions are used to generate a Hilbert curve, which makes the algorithms complex and computationally expensive. Second, both sides of the scanned rectangle must have same size and each size must be a power of two, which limits the application of the Hilbert scan greatly. In this paper, a Pseudo-Hilbert scan algorithm based on two look-up tables is proposed. The proposed method improves the Hilbert scan to be suitable for real-time processing and general application. The simulation indicates that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neighboring lattice points. It also shows competitive performance of the Pseudo-Hilbert scan in comparison with other scan techniques.

KW - Euclidean distance

KW - Hilbert curve

KW - Look-up tables

KW - Pseudo-Hilbert scan

KW - Space-filling curve

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

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

U2 - 10.1093/ietfec/e90-a.3.682

DO - 10.1093/ietfec/e90-a.3.682

M3 - Article

AN - SCOPUS:33947177151

VL - E90-A

SP - 682

EP - 690

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 3

ER -