A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region

Jian Zhang, Seiichiro Kamata, Yoshifumi Ueshige

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

The 2-dimensional Hilbert scan (HS) is a one-to-one mapping between 2-dimensional (2-D) space and one-dimensional (1-D) space along the 2-D Hilbert curve. Because Hilbert curve can preserve the spatial relationships of the patterns effectively, 2-D HS has been studied in digital image processing actively, such as compressing image data, pattern recognition, clustering an image, etc. However, the existing HS algorithms have some strict restrictions when they are implemented. For example, the most algorithms use recursive function to generate the Hilbert curve, which makes the algorithms complex and takes time to compute the one-to-one correspondence. And some even request the sides of the scanned rectangle region must be a power of two, that limits the application scope of HS greatly. Thus, in order to improve HS to be proper to real-time processing and general application, we proposed a Pseudo-Hilbert scan (PHS) based on the look-up table method for arbitrarily-sized arrays in this paper. Experimental results for both HS and PHS indicate that the proposed generalized Hilbert scan algorithm also reserves the good property of HS that the curve preserves point neighborhoods as much as possible, and gives competitive performance in comparison with Raster scan.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages290-299
Number of pages10
Volume4153 LNCS
Publication statusPublished - 2006
EventInternational Workshop on Intelligent Computing in Pattern Analysis/Synthesis, IWICPAS 2006 - Xi'an
Duration: 2006 Aug 262006 Aug 27

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4153 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

OtherInternational Workshop on Intelligent Computing in Pattern Analysis/Synthesis, IWICPAS 2006
CityXi'an
Period06/8/2606/8/27

Fingerprint

Rectangle
Hilbert
Recursive functions
Pattern recognition
Cluster Analysis
Image processing
Curve
D-space
Processing
Digital Image Processing
Recursive Functions
Look-up Table
One to one correspondence
Pattern Recognition
Clustering
Restriction
Real-time

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Zhang, J., Kamata, S., & Ueshige, Y. (2006). A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4153 LNCS, pp. 290-299). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4153 LNCS).

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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4153 LNCS 2006. p. 290-299 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4153 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Zhang, J, Kamata, S & Ueshige, Y 2006, A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 4153 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4153 LNCS, pp. 290-299, International Workshop on Intelligent Computing in Pattern Analysis/Synthesis, IWICPAS 2006, Xi'an, 06/8/26.
Zhang J, Kamata S, Ueshige Y. A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4153 LNCS. 2006. p. 290-299. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Zhang, Jian ; Kamata, Seiichiro ; Ueshige, Yoshifumi. / A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4153 LNCS 2006. pp. 290-299 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{97a8d70bdfd840e7b066a63a9080d70c,
title = "A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region",
abstract = "The 2-dimensional Hilbert scan (HS) is a one-to-one mapping between 2-dimensional (2-D) space and one-dimensional (1-D) space along the 2-D Hilbert curve. Because Hilbert curve can preserve the spatial relationships of the patterns effectively, 2-D HS has been studied in digital image processing actively, such as compressing image data, pattern recognition, clustering an image, etc. However, the existing HS algorithms have some strict restrictions when they are implemented. For example, the most algorithms use recursive function to generate the Hilbert curve, which makes the algorithms complex and takes time to compute the one-to-one correspondence. And some even request the sides of the scanned rectangle region must be a power of two, that limits the application scope of HS greatly. Thus, in order to improve HS to be proper to real-time processing and general application, we proposed a Pseudo-Hilbert scan (PHS) based on the look-up table method for arbitrarily-sized arrays in this paper. Experimental results for both HS and PHS indicate that the proposed generalized Hilbert scan algorithm also reserves the good property of HS that the curve preserves point neighborhoods as much as possible, and gives competitive performance in comparison with Raster scan.",
author = "Jian Zhang and Seiichiro Kamata and Yoshifumi Ueshige",
year = "2006",
language = "English",
isbn = "354037597X",
volume = "4153 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "290--299",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - A pseudo-hilbert scan algorithm for arbitrarily-sized rectangle region

AU - Zhang, Jian

AU - Kamata, Seiichiro

AU - Ueshige, Yoshifumi

PY - 2006

Y1 - 2006

N2 - The 2-dimensional Hilbert scan (HS) is a one-to-one mapping between 2-dimensional (2-D) space and one-dimensional (1-D) space along the 2-D Hilbert curve. Because Hilbert curve can preserve the spatial relationships of the patterns effectively, 2-D HS has been studied in digital image processing actively, such as compressing image data, pattern recognition, clustering an image, etc. However, the existing HS algorithms have some strict restrictions when they are implemented. For example, the most algorithms use recursive function to generate the Hilbert curve, which makes the algorithms complex and takes time to compute the one-to-one correspondence. And some even request the sides of the scanned rectangle region must be a power of two, that limits the application scope of HS greatly. Thus, in order to improve HS to be proper to real-time processing and general application, we proposed a Pseudo-Hilbert scan (PHS) based on the look-up table method for arbitrarily-sized arrays in this paper. Experimental results for both HS and PHS indicate that the proposed generalized Hilbert scan algorithm also reserves the good property of HS that the curve preserves point neighborhoods as much as possible, and gives competitive performance in comparison with Raster scan.

AB - The 2-dimensional Hilbert scan (HS) is a one-to-one mapping between 2-dimensional (2-D) space and one-dimensional (1-D) space along the 2-D Hilbert curve. Because Hilbert curve can preserve the spatial relationships of the patterns effectively, 2-D HS has been studied in digital image processing actively, such as compressing image data, pattern recognition, clustering an image, etc. However, the existing HS algorithms have some strict restrictions when they are implemented. For example, the most algorithms use recursive function to generate the Hilbert curve, which makes the algorithms complex and takes time to compute the one-to-one correspondence. And some even request the sides of the scanned rectangle region must be a power of two, that limits the application scope of HS greatly. Thus, in order to improve HS to be proper to real-time processing and general application, we proposed a Pseudo-Hilbert scan (PHS) based on the look-up table method for arbitrarily-sized arrays in this paper. Experimental results for both HS and PHS indicate that the proposed generalized Hilbert scan algorithm also reserves the good property of HS that the curve preserves point neighborhoods as much as possible, and gives competitive performance in comparison with Raster scan.

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

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

M3 - Conference contribution

AN - SCOPUS:33750058556

SN - 354037597X

SN - 9783540375975

VL - 4153 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 290

EP - 299

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -