A Pseudo-Hilbert scan for arbitrarily-sized cuboid region

Jian Zhang, Seiichiro Kamata

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

Abstract

The 3-dimensional (3-D) Hilbert scan is a one-to-one mapping between 3-D data and 1-D data along the 3-D Hilbert curve. It has been applied widely in image processing, such as image compression, object recognition, and image clustering, etc. Now, although there exist some 3-D Hilbert scanning algorithms, they usually have strict limitation on the scanned region. This makes Hilbert scan difficult to be applied in practice. So an effective scanning algorithm for arbitrarily-sized cuboid region is significant to improve the correlative digital image processing technology. In this paper, we proposed a novel Pseudo-Hilbert scanning algorithm based on the look-up tables method for arbitrarily-sized cuboid region. Although the proposed algorithm is designed for 3-D space scanning, it can be also applied in an arbitrary-sized rectangle. The algorithm does not only remove the strict constrains but also reserve the good property of the Hilbert curve preserving point neighborhoods as much as possible. The good performance of the algorithm is demonstrated by the simulation results.

Original languageEnglish
Title of host publicationSixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT
Pages764-769
Number of pages6
DOIs
Publication statusPublished - 2007

Fingerprint

Scanning
Image processing
Object recognition
Image compression

Keywords

  • Euclidean distance
  • Hilbert scan
  • Look-up tables

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing
  • Software

Cite this

Zhang, J., & Kamata, S. (2007). A Pseudo-Hilbert scan for arbitrarily-sized cuboid region. In Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT (pp. 764-769). [4042343] https://doi.org/10.1109/ISSPIT.2006.270901

A Pseudo-Hilbert scan for arbitrarily-sized cuboid region. / Zhang, Jian; Kamata, Seiichiro.

Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT. 2007. p. 764-769 4042343.

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

Zhang, J & Kamata, S 2007, A Pseudo-Hilbert scan for arbitrarily-sized cuboid region. in Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT., 4042343, pp. 764-769. https://doi.org/10.1109/ISSPIT.2006.270901
Zhang J, Kamata S. A Pseudo-Hilbert scan for arbitrarily-sized cuboid region. In Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT. 2007. p. 764-769. 4042343 https://doi.org/10.1109/ISSPIT.2006.270901
Zhang, Jian ; Kamata, Seiichiro. / A Pseudo-Hilbert scan for arbitrarily-sized cuboid region. Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT. 2007. pp. 764-769
@inproceedings{933b2b4a18e84be9a37d9656c993fe5d,
title = "A Pseudo-Hilbert scan for arbitrarily-sized cuboid region",
abstract = "The 3-dimensional (3-D) Hilbert scan is a one-to-one mapping between 3-D data and 1-D data along the 3-D Hilbert curve. It has been applied widely in image processing, such as image compression, object recognition, and image clustering, etc. Now, although there exist some 3-D Hilbert scanning algorithms, they usually have strict limitation on the scanned region. This makes Hilbert scan difficult to be applied in practice. So an effective scanning algorithm for arbitrarily-sized cuboid region is significant to improve the correlative digital image processing technology. In this paper, we proposed a novel Pseudo-Hilbert scanning algorithm based on the look-up tables method for arbitrarily-sized cuboid region. Although the proposed algorithm is designed for 3-D space scanning, it can be also applied in an arbitrary-sized rectangle. The algorithm does not only remove the strict constrains but also reserve the good property of the Hilbert curve preserving point neighborhoods as much as possible. The good performance of the algorithm is demonstrated by the simulation results.",
keywords = "Euclidean distance, Hilbert scan, Look-up tables",
author = "Jian Zhang and Seiichiro Kamata",
year = "2007",
doi = "10.1109/ISSPIT.2006.270901",
language = "English",
isbn = "0780397541",
pages = "764--769",
booktitle = "Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT",

}

TY - GEN

T1 - A Pseudo-Hilbert scan for arbitrarily-sized cuboid region

AU - Zhang, Jian

AU - Kamata, Seiichiro

PY - 2007

Y1 - 2007

N2 - The 3-dimensional (3-D) Hilbert scan is a one-to-one mapping between 3-D data and 1-D data along the 3-D Hilbert curve. It has been applied widely in image processing, such as image compression, object recognition, and image clustering, etc. Now, although there exist some 3-D Hilbert scanning algorithms, they usually have strict limitation on the scanned region. This makes Hilbert scan difficult to be applied in practice. So an effective scanning algorithm for arbitrarily-sized cuboid region is significant to improve the correlative digital image processing technology. In this paper, we proposed a novel Pseudo-Hilbert scanning algorithm based on the look-up tables method for arbitrarily-sized cuboid region. Although the proposed algorithm is designed for 3-D space scanning, it can be also applied in an arbitrary-sized rectangle. The algorithm does not only remove the strict constrains but also reserve the good property of the Hilbert curve preserving point neighborhoods as much as possible. The good performance of the algorithm is demonstrated by the simulation results.

AB - The 3-dimensional (3-D) Hilbert scan is a one-to-one mapping between 3-D data and 1-D data along the 3-D Hilbert curve. It has been applied widely in image processing, such as image compression, object recognition, and image clustering, etc. Now, although there exist some 3-D Hilbert scanning algorithms, they usually have strict limitation on the scanned region. This makes Hilbert scan difficult to be applied in practice. So an effective scanning algorithm for arbitrarily-sized cuboid region is significant to improve the correlative digital image processing technology. In this paper, we proposed a novel Pseudo-Hilbert scanning algorithm based on the look-up tables method for arbitrarily-sized cuboid region. Although the proposed algorithm is designed for 3-D space scanning, it can be also applied in an arbitrary-sized rectangle. The algorithm does not only remove the strict constrains but also reserve the good property of the Hilbert curve preserving point neighborhoods as much as possible. The good performance of the algorithm is demonstrated by the simulation results.

KW - Euclidean distance

KW - Hilbert scan

KW - Look-up tables

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

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

U2 - 10.1109/ISSPIT.2006.270901

DO - 10.1109/ISSPIT.2006.270901

M3 - Conference contribution

SN - 0780397541

SN - 9780780397545

SP - 764

EP - 769

BT - Sixth IEEE International Symposium on Signal Processing and Information Technology, ISSPIT

ER -