Fast Hypercomplex Polar Fourier Analysis

• YANG Zhuo

  Graduate School of Information, Production and Systems, Waseda University

• KAMATA Sei-ichiro

  Graduate School of Information, Production and Systems, Waseda University

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.

Journal

• IEICE Transactions on Information and Systems

  IEICE Transactions on Information and Systems E95.D (4), 1166-1169, 2012

  The Institute of Electronics, Information and Communication Engineers

Keywords

• fast hypercomplex polar Fourier analysis
• hypercomplex polar Fourier analysis
• Fourier analysis

Details

• CRID: 1390282679354119168
• NII Article ID: 10030942353
• NII Book ID: AA10826272
• DOI: 10.1587/transinf.e95.d.1166
• BIBCODE: 2012IEITI..95.1166Y
• ISSN: 17451361
• ISSN: 09168532
• Web Site: https://www.jstage.jst.go.jp/article/transinf/E95.D/4/E95.D_4_1166/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed