Fast hypercomplex polar Fourier analysis for image processing

Zhuo Yang, Seiichiro Kamata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. 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 that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that significantly reduce the computation time.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages141-148
Number of pages8
Volume7088 LNCS
EditionPART 2
DOIs
Publication statusPublished - 2011
Event5th Pacific-Rim Symposium on Video and Image Technology, PSIVT 2011 - Gwangju
Duration: 2011 Nov 202011 Nov 23

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume7088 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Pacific-Rim Symposium on Video and Image Technology, PSIVT 2011
CityGwangju
Period11/11/2011/11/23

Fingerprint

Fourier analysis
Fourier Analysis
Image Processing
Image processing
Rotation Invariance
Image Understanding
Image understanding
Real-time Systems
Image Representation
Circular function
Color Image
Invariance
Fast Algorithm
Feature Extraction
Feature extraction
Vector Field
Color
Generalise
Resources
Coefficient

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Yang, Z., & Kamata, S. (2011). Fast hypercomplex polar Fourier analysis for image processing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 7088 LNCS, pp. 141-148). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7088 LNCS, No. PART 2). https://doi.org/10.1007/978-3-642-25346-1_13

Fast hypercomplex polar Fourier analysis for image processing. / Yang, Zhuo; Kamata, Seiichiro.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7088 LNCS PART 2. ed. 2011. p. 141-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7088 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yang, Z & Kamata, S 2011, Fast hypercomplex polar Fourier analysis for image processing. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 7088 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 7088 LNCS, pp. 141-148, 5th Pacific-Rim Symposium on Video and Image Technology, PSIVT 2011, Gwangju, 11/11/20. https://doi.org/10.1007/978-3-642-25346-1_13
Yang Z, Kamata S. Fast hypercomplex polar Fourier analysis for image processing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 7088 LNCS. 2011. p. 141-148. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-642-25346-1_13
Yang, Zhuo ; Kamata, Seiichiro. / Fast hypercomplex polar Fourier analysis for image processing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7088 LNCS PART 2. ed. 2011. pp. 141-148 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{fd60a695af8e4c23a22041c5254469e4,
title = "Fast hypercomplex polar Fourier analysis for image processing",
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. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. 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 that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that significantly reduce the computation time.",
keywords = "fast hypercomplex polar Fourier analysis, Fourier analysis, hypercomplex polar Fourier analysis",
author = "Zhuo Yang and Seiichiro Kamata",
year = "2011",
doi = "10.1007/978-3-642-25346-1_13",
language = "English",
isbn = "9783642253454",
volume = "7088 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
number = "PART 2",
pages = "141--148",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Fast hypercomplex polar Fourier analysis for image processing

AU - Yang, Zhuo

AU - Kamata, Seiichiro

PY - 2011

Y1 - 2011

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. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. 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 that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that 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. It is reversible that can reconstruct image. Its coefficient has rotation invariance property that can be used for feature extraction. With these properties, it can be used for image processing applications like image representation and image understanding. 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 that based on symmetric properties and mathematical properties of trigonometric functions. Proposed fast hypercomplex polar Fourier analysis computes symmetric eight points simultaneously that significantly reduce the computation time.

KW - fast hypercomplex polar Fourier analysis

KW - Fourier analysis

KW - hypercomplex polar Fourier analysis

UR - http://www.scopus.com/inward/record.url?scp=82155166448&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=82155166448&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-25346-1_13

DO - 10.1007/978-3-642-25346-1_13

M3 - Conference contribution

AN - SCOPUS:82155166448

SN - 9783642253454

VL - 7088 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 141

EP - 148

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -