Abstract
Hilbert curve is one of space filling curves presented by G. Peano in 1890. We apply this curve to scanning an arbitrary sized image for image compression, image processing, etc. In this paper, we propose a new, simple, non-recursive algorithm for pseudo-Hilbert scanning using lookup tables. The merit of our algorithm is that the computation is fast and the hardware implementation is much easier than previous ones. From our experimental results, we have confirmed that our method is about 50 times faster than other methods.
| Original language | English |
|---|---|
| Pages | 707-710 |
| Number of pages | 4 |
| Publication status | Published - 1997 Dec 1 |
| Event | Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) - Santa Barbara, CA, USA Duration: 1997 Oct 26 → 1997 Oct 29 |
Other
| Other | Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) |
|---|---|
| City | Santa Barbara, CA, USA |
| Period | 97/10/26 → 97/10/29 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
Cite this
Kamata, S. I., & Bandoh, Y. (1997). Address generator of a pseudo-Hilbert scan in a rectangle region. 707-710. Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .