A class of fast algorithms for the Peano-Hilbert space-filling curve

Author

Lam, Warren M. ; Shapiro, Jerome M.

Author_Institution

Res. Lab. of Electron., MIT, Cambridge, MA, USA

Volume

1

fYear

1994

fDate

13-16 Nov 1994

Firstpage

638

Abstract

Time- and space-efficient nonrecursive algorithms, formulated directly in terms of bitwise operations, are developed to address a number of practical image scanning problems involving the Peano-Hilbert space-filling curve. These include a generator for the curve and algorithms for two-way conversion between the coordinates of a pixel and its position in the Peano-Hilbert scan. The conversion algorithms in turn lead to fast algorithms for determining the predecessor and successor of a pixel in the scan. Performance of the algorithms is assessed via analysis of their memory usage and computational requirement

Keywords

data structures; image processing; Peano-Hilbert scan; Peano-Hilbert space-filling curve; algorithms performance; bitwise operations; computational requirement; conversion algorithms; data structure; fast algorithms; generator; image scanning problems; memory usage; pixel coordinates; space-efficient nonrecursive algorithms; time-efficient nonrecursive algorithms; two-way conversion; Algorithm design and analysis; Image analysis; Image coding; Image converters; Image processing; Image texture analysis; Laboratories; Performance analysis; Reflection; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Image Processing, 1994. Proceedings. ICIP-94., IEEE International Conference

Conference_Location

Austin, TX

Print_ISBN

0-8186-6952-7

Type

conf

DOI

10.1109/ICIP.1994.413392

Filename

413392