Hexagonal image processing

Author

Nel, André L.

Author_Institution

Lab. for Cybern., Rand Afrikaans Univ., Johannesburg, South Africa

fYear

1989

fDate

32682

Firstpage

109

Lastpage

113

Abstract

The author describes the development of the underlying theory of processing hexagonally sampled digital images. He shows a direct form of both the FFT (fast Fourier transform) and the FWT (fast Walsh transform) as applied to a hexagonal lattice of data points. Advantages spring from a reduction in the number of data locations and a reduction in computational load per data point. The complete signal flow graph for a minimal hexagonal kernel for both the FFT and the FWT is shown. The derived transforms were implemented in software and compared to the standard 2-D FFT on standard images in the image processing laboratory. It was found that the hexagonal sampling of the image at a lower resolution retained the necessary resolution as required for the rest of the image software

Keywords

Walsh functions; computerised picture processing; fast Fourier transforms; complete signal flow graph; data locations; data point; fast Fourier transform; fast Walsh transform; hexagonally sampled digital images; lower resolution; minimal hexagonal kernel; Digital images; Fast Fourier transforms; Flow graphs; Image processing; Image resolution; Image sampling; Kernel; Laboratories; Lattices; Software standards;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Signal Processing, 1989. COMSIG 1989. Proceedings., Southern African Conference on

Conference_Location

Stellenbosch

Print_ISBN

0-87942-713-2

Type

conf

DOI

10.1109/COMSIG.1989.129027

Filename

129027