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 |
Fingerprint
Keywords
- Fourier analysis
- Frist hypercomplex polar fourier analysis
- Hypercomplex polar fourier analysis
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Software
- Artificial Intelligence
- Hardware and Architecture
- Computer Vision and Pattern Recognition
Cite this
Fast hypercomplex polar fourier analysis. / Yang, Zhuo; Kamata, Seiichiro.
In: IEICE Transactions on Information and Systems, Vol. E95-D, No. 4, 04.2012, p. 1166-1169.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Fast hypercomplex polar fourier analysis
AU - Yang, Zhuo
AU - Kamata, Seiichiro
PY - 2012/4
Y1 - 2012/4
N2 - 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.
AB - 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.
KW - Fourier analysis
KW - Frist hypercomplex polar fourier analysis
KW - Hypercomplex polar fourier analysis
UR - http://www.scopus.com/inward/record.url?scp=84859319655&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84859319655&partnerID=8YFLogxK
U2 - 10.1587/transinf.E95.D.1166
DO - 10.1587/transinf.E95.D.1166
M3 - Article
AN - SCOPUS:84859319655
VL - E95-D
SP - 1166
EP - 1169
JO - IEICE Transactions on Information and Systems
JF - IEICE Transactions on Information and Systems
SN - 0916-8532
IS - 4
ER -