Fast hypercomplex polar fourier analysis for image processing

Authors:
Zhuo Yang;Sei-ichiro Kamata
Affiliations:
Graduate School of Information, Production and Systems, Waseda University, Japan;Graduate School of Information, Production and Systems, Waseda University, Japan
Venue:
PSIVT'11 Proceedings of the 5th Pacific Rim conference on Advances in Image and Video Technology - Volume Part II
Year:
2011

Citing 5
Cited 0

DFT/FFT and Convolution Algorithms: Theory and Implementation

DFT/FFT and Convolution Algorithms: Theory and Implementation
Motion estimation, segmentation and separation, using hypercomplex phase correlation, clustering techniques and graph-based optimization

Computer Vision and Image Understanding
Rotational Invariance Based on Fourier Analysis in Polar and Spherical Coordinates

IEEE Transactions on Pattern Analysis and Machine Intelligence
A Quaternion Framework for Color Image Smoothing and Segmentation

International Journal of Computer Vision
Hypercomplex Fourier Transforms of Color Images

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hypercomplex polar Fourier analysis treats a signal as a vector field and generalizes the conventional polar Fourier analysis. It can handle signals represented by hypercomplex numbers such as color images. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. However in order to increase the computation speed, fast algorithm is needed especially for image processing applications like realtime systems and limited resource platforms. This paper presents fast hypercomplex polar Fourier analysis that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that significantly reduce the computation time.