Fast Hypercomplex Polar Fourier Analysis
スポンサーリンク
概要
- 論文の詳細を見る
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 properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric points simultaneously, which significantly reduce the computation time.
- The Institute of Electronics, Information and Communication Engineersの論文
- 2012-04-01
著者
-
Kamata Sei-ichiro
The Graduate School Of Information Production And Systems Waseda University
-
Yang Zhuo
The Graduate School Of Information Production And Systems Waseda University
関連論文
- Hilbert Scan Based Bag-of-Features for Image Retrieval
- Hypercomplex Polar Fourier Analysis for Image Representation
- A Linear Manifold Color Descriptor for Medicine Package Recognition
- Image Description with Local Patterns : An Application to Face Recognition
- Novel Algorithm for Polar and Spherical Fourier Analysis on Two and Three Dimensional Images
- Efficiently Finding Individuals from Video Dataset
- Fast Hypercomplex Polar Fourier Analysis
- L1-Norm Based Linear Discriminant Analysis : An Application to Face Recognition