Fast hypercomplex polar fourier analysis

Zhuo Yang, Seiichiro Kamata

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)1166-1169
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE95-D
Issue number4
DOIs
Publication statusPublished - 2012 Apr

Fingerprint

Fourier analysis
Invariance
Feature extraction
Image processing
Color

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 journalArticle

@article{09d25fd50d07485687128ac6d687202e,
title = "Fast hypercomplex polar fourier analysis",
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.",
keywords = "Fourier analysis, Frist hypercomplex polar fourier analysis, Hypercomplex polar fourier analysis",
author = "Zhuo Yang and Seiichiro Kamata",
year = "2012",
month = "4",
doi = "10.1587/transinf.E95.D.1166",
language = "English",
volume = "E95-D",
pages = "1166--1169",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "4",

}

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

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 -