Fast Hypercomplex Polar Fourier Analysis
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E95-D No.4 pp.1166-1169
- Publication Date
- 2012/04/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E95.D.1166
- Type of Manuscript
- LETTER
- Category
- Image Processing and Video Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Zhuo YANG, Sei-ichiro KAMATA, "Fast Hypercomplex Polar Fourier Analysis" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 4, pp. 1166-1169, April 2012, doi: 10.1587/transinf.E95.D.1166.
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 properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric points simultaneously, which significantly reduce the computation time.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.1166/_p
Copy
@ARTICLE{e95-d_4_1166,
author={Zhuo YANG, Sei-ichiro KAMATA, },
journal={IEICE TRANSACTIONS on Information},
title={Fast Hypercomplex Polar Fourier Analysis},
year={2012},
volume={E95-D},
number={4},
pages={1166-1169},
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 properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric points simultaneously, which significantly reduce the computation time.},
keywords={},
doi={10.1587/transinf.E95.D.1166},
ISSN={1745-1361},
month={April},}
Copy
TY - JOUR
TI - Fast Hypercomplex Polar Fourier Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 1166
EP - 1169
AU - Zhuo YANG
AU - Sei-ichiro KAMATA
PY - 2012
DO - 10.1587/transinf.E95.D.1166
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 2012
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 properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric points simultaneously, which significantly reduce the computation time.
ER -
English
