English

Quaternionic Fourier-Mellin Transform

Rings and Algebras 2013-06-10 v1 Computer Vision and Pattern Recognition

Abstract

In this contribution we generalize the classical Fourier Mellin transform [S. Dorrode and F. Ghorbel, Robust and efficient Fourier-Mellin transform approximations for gray-level image reconstruction and complete invariant description, Computer Vision and Image Understanding, 83(1) (2001), 57-78, DOI 10.1006/cviu.2001.0922.], which transforms functions ff representing, e.g., a gray level image defined over a compact set of R2\mathbb{R}^2. The quaternionic Fourier Mellin transform (QFMT) applies to functions f:R2Hf: \mathbb{R}^2 \rightarrow \mathbb{H}, for which f|f| is summable over R+×S1\mathbb{R}_+^* \times \mathbb{S}^1 under the measure dθdrrd\theta \frac{dr}{r}. R+\mathbb{R}_+^* is the multiplicative group of positive and non-zero real numbers. We investigate the properties of the QFMT similar to the investigation of the quaternionic Fourier Transform (QFT) in [E. Hitzer, Quaternion Fourier Transform on Quaternion Fields and Generalizations, Advances in Applied Clifford Algebras, 17(3) (2007), 497-517.; E. Hitzer, Directional Uncertainty Principle for Quaternion Fourier Transforms, Advances in Applied Clifford Algebras, 20(2) (2010), 271-284, online since 08 July 2009.].

Keywords

Cite

@article{arxiv.1306.1669,
  title  = {Quaternionic Fourier-Mellin Transform},
  author = {Eckhard Hitzer},
  journal= {arXiv preprint arXiv:1306.1669},
  year   = {2013}
}

Comments

11 pages, 9 figures

R2 v1 2026-06-22T00:29:46.735Z