.png){kind=icon}
返回
A new algorithm for N-dimensional Hilbert scanning
.png){kind=icon}
PRE
AI
DOI：10.1109/83.772242.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
There have been many applications of Hilbert curve, such as image processing, image compression, computer hologram, etc. The Hilbert curve is a one-to-one mapping between N-dimensional space and one-dimensional (1-D) space which preserves point neighborhoods as much as possible, There are several algorithms for N-dimensional Hilbert scanning, such as the Butz algorithm and the Quinqueton algorithm. The Butz algorithm is a mapping function using several bit operations such as shifting, exclusive OR, etc. On the other hand, the Quinqueton algorithm computes all addresses of this curve using recursive functions, but takes time to compute a one-to-one mapping correspondence. Both algorithms are complex to compute and both are difficult to implement in hardware. In this paper, we propose a new, simple, nonrecursive algorithm for N-dimensional Hilbert scanning using look-up tables, The merit of our algorithm is that the computation is fast and the implementation is much easier than previous ones.
Keyword:
Hilbert scan
multidimensional analysis
Peano curve
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.7
论文数:
1.0W
被引数:
8.4W
机构
暂无机构信息
引用论文
分享收藏
Simulation of the thermal denaturation of hen egg white lysozyme: trapping the molten globule state.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏
查看更多内容