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. Hypercomplex polar Fourier analysis is reversible that means it can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. 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 based on symmetric properties and mathematical proper ies of trigonometric functions. Proposed fast hy percomplex polar Fourier analysis computes symmetric points simultane ously, which significantly reduce the computation time.
| Original language | English |
|---|---|
| Pages (from-to) | 1166-1169 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E95-D |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 2012 Apr |
Keywords
- Fourier analysis
- Frist hypercomplex polar fourier analysis
- Hypercomplex polar fourier analysis
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence