An N-Dimensional Pseudo-Hilbert Scan for Arbitrarily-Sized Hypercuboids
スポンサーリンク
概要
- 論文の詳細を見る
The N-dimensional (N-D) Hilbert curve is a one-to-one mapping between N-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 spatial relationship of the N-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, all the sides of the scanned region must have the same size and the length must be a power of two, which limits the application of the Hilbert scan greatly. Thus in order to remove these constraints and improve the Hilbert scan for general application, a nonrecursive N-D Pseudo-Hilbert scan algorithm based on two look-up tables is proposed in this paper. The merit of the proposed algorithm is that implementation is much easier than the original one while preserving the original characteristics. The experimental results indicate that the Pseudo-Hilbert scan can preserve point neighborhoods as much as possible and take advantage of the high correlation between neigh-boring lattice points, and it also shows the competitive performance of the Pseudo-Hilbert scan in comparison with other common scan techniques. We believe that this novel scan technique undoubtedly leads to many new applications in those areas can benefit from reducing the dimensionality of the problem.
- （社）電子情報通信学会の論文
- 2008-03-01
著者
-
Kamata Sei-ichiro
Graduate School Of Information Production And System Waseda University
-
Zhang Jian
Graduate School Of Information Production And Systems Waseda University
-
Zhang Jian
Graduate School Of Education Hiroshima University
関連論文
- 高ダイナミックレンジ画像マッピング
- A Pseudo-Hilbert Scan for Arbitrarily-Sized Arrays(Image)
- Fast Polar Harmonic Transforms
- On-line Signature Matching Based on Hilbert Scanning Patterns
- A New Framework for Constructing Accurate Affine Invariant Regions(Image Recognition, Computer Vision)
- A Fast and Accurate Algorithm for Matching Images Using Hilbert Scanning Distance with Threshold Elimination Function(Pattern Recognition)
- Interscale Stein's Unbiased Risk Estimate and Intrascale Feature Patches Distance Constraint for Image Denoising
- A Gradient Based Predictive Coding for Lossless Image Compression(Image Processing and Video Processing)
- D-11-59 Road Sign Detection Method Based on Color Barycenter Threshold
- An N-Dimensional Pseudo-Hilbert Scan for Arbitrarily-Sized Hypercuboids
- Fast Polar and Spherical Fourier Descriptors for Feature Extraction
- A METHOD OF COMPUTING A SPACE FILLING CURVE FOR ARBITRARILY SHAPED REGION (Image Processing and Coding)(International Workshop On Advanced Image Technology (IWAIT2004))
- A MODEFIED METHOD OF ADAPTIVE SPACE-FILLING CODING (Image Processing and Coding)(International Workshop On Advanced Image Technology (IWAIT2004))
- Automatic Image-Map Alignment Using Edge-Based Code Mutual Information and 3-D Hilbert Scan
- A Two-Stage Point Pattern Matching Algorithm Using Ellipse Fitting and Dual Hilbert Scans
- Image Enhancement by Analysis on Embedded Surfaces of Images and a New Framework for Enhancement Evaluation
- Hilbert Scan Based Bag-of-Features for Image Retrieval
- P1-16 Difference of Saccadic Latency between Skilled and Novice Ball Players in Performing Predictable Tasks(The Proceedings of the 12th Annual Meetings of Japan Society of Exercise and Sports Physiology)
- 18-11 Online signature matching based on Hilbert-Scanning patterns
- 7-8 Shape Image Retrieval Based on Spherical Harmonics
- A Simple and Effective Clustering Algorithm for Multispectral Images Using Space-Filling Curves
- SSM-HPC : Front View Gait Recognition Using Spherical Space Model with Human Point Clouds
- Face Representation and Recognition with Local Curvelet Patterns
- A Novel Color Descriptor for Road-Sign Detection