The search functionality is under construction.

Keyword Search Result

[Keyword] polar Fourier analysis(3hit)

1-3hit
  • Novel Algorithm for Polar and Spherical Fourier Analysis on Two and Three Dimensional Images

    Zhuo YANG  Sei-ichiro KAMATA  

     
    PAPER-Image Processing

      Vol:
    E95-D No:5
      Page(s):
    1248-1255

    Polar and Spherical Fourier analysis can be used to extract rotation invariant features for image retrieval and pattern recognition tasks. They are demonstrated to show superiorities comparing with other methods on describing rotation invariant features of two and three dimensional images. Based on mathematical properties of trigonometric functions and associated Legendre polynomials, fast algorithms are proposed for multimedia applications like real time systems and large multimedia databases in order to increase the computation speed. The symmetric points are computed simultaneously. Inspired by relative prime number theory, systematic analysis are given in this paper. Novel algorithm is deduced that provide even faster speed. Proposed method are 9–15% faster than previous work. The experimental results on two and three dimensional images are given to illustrate the effectiveness of the proposed method. Multimedia signal processing applications that need real time polar and spherical Fourier analysis can be benefit from this work.

  • Fast Hypercomplex Polar Fourier Analysis

    Zhuo YANG  Sei-ichiro KAMATA  

     
    LETTER-Image Processing and Video Processing

      Vol:
    E95-D No:4
      Page(s):
    1166-1169

    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.

  • Hypercomplex Polar Fourier Analysis for Image Representation

    Zhuo YANG  Sei-ichiro KAMATA  

     
    PAPER-Image Recognition, Computer Vision

      Vol:
    E94-D No:8
      Page(s):
    1663-1670

    Fourier transform is a significant tool in image processing and pattern recognition. By introducing a hypercomplex number, hypercomplex Fourier transform treats a signal as a vector field and generalizes the conventional Fourier transform. Inspired from that, hypercomplex polar Fourier analysis that extends conventional polar Fourier analysis is proposed in this paper. The proposed method can handle signals represented by hypercomplex numbers as color images. The hypercomplex polar Fourier analysis is reversible that means it can be used to reconstruct image. The hypercomplex polar Fourier descriptor has rotation invariance property that can be used for feature extraction. Due to the noncommutative property of quaternion multiplication, both left-side and right-side hypercomplex polar Fourier analysis are discussed and their relationships are also established in this paper. The experimental results on image reconstruction, rotation invariance, color plate test and image retrieval are given to illustrate the usefulness of the proposed method as an image analysis tool.