Searcharxiv⌕ Search

arXiv subjects

Łukasz Błaszczyk

Publications and source records attributed to Łukasz Błaszczyk.

5 recordsLinked to original sources

A Generalization of the Octonion Fourier Transform to 3-D Octonion-Valued Signals -- Properties and Possible Applications to 3-D LTI Partial Differential Systems

The paper is devoted to the development of the octonion Fourier transform (OFT) theory initiated in 2011 in articles by Hahn and Snopek. It is also a continuation and generalization of earlier work by Blaszczyk and Snopek, where they proved few essential properties of the OFT of real-valued functions, e.g. symmetry properties. The results of this article focus on proving that the OFT is well-defined for octonion-valued functions and almost all well-known properties of classical (complex) Fourier transform (e.g. argument scaling, modulation and shift theorems) have their direct equivalents in octonion setup. Those theorems, illustrated with some examples, lead to the generalization of another result presented in earlier work, i.e. Parseval and Plancherel Theorems, important from the signal and system processing point of view. Moreover, results presented in this paper associate the OFT with 3-D LTI systems of linear PDEs with constant coefficients. Properties of the OFT in context of signal-domain operations such as derivation and convolution of $\mathbb{R}$-valued functions will be stated. There are known results for QFT, but they use the notion of other hypercomplex algebra, i.e. double-complex numbers. Considerations presented here require defining other higher-order hypercomplex structure, i.e. quadruple-complex numbers. This hypercomplex generalization of the Fourier transformation provides an excellent tool for the analysis of 3-D LTI systems.

math.CA↗

Theoretical and numerical considerations on the polar (exponential) form of octonions and elements of higher-order Cayley-Dickson algebras

The article is devoted to the issue of the polar form of octonions. This is a~continuation of the works initiated by Hahn and Snopek in their articles from 2011. The results presented in the article show errors made in previous considerations and suggest the possibility of their improvement. The presented numerical method gives promising results, which as a result of further work can give analytical formulas for angles in the polar representation.

math.GM↗

Compressed sensing in the quaternion algebra

The article concerns compressed sensing methods in the quaternion algebra. We prove that it is possible to uniquely reconstruct - by $\ell_1$-norm minimization - a sparse quaternion signal from a limited number of its linear measurements, provided the quaternion measurement matrix satisfies so-called restricted isometry property with a sufficiently small constant. We also provide error estimates for the reconstruction of a non-sparse quaternion signal in the noisy and noiseless cases.

math.FA↗

Quaternion Gaussian matrices satisfy the RIP

We prove that quaternion Gaussian random matrices satisfy the restricted isometry property (RIP) with overwhelming probability. We also explain why the restricted isometry random variables (RIV) approach is not appropriate for drawing conclusions on restricted isometry constants.

math.PR↗

Compressed sensing for real measurements of quaternion signals

The article concerns compressed sensing methods in the quaternion algebra. We prove that it is possible to uniquely reconstruct - by $\ell_1$ norm minimization - a sparse quaternion signal from a limited number of its real linear measurements, provided the measurement matrix satisfies so-called restricted isometry property with a sufficiently small constant. We also provide error estimates for the reconstruction of a non-sparse quaternion signal in the noisy and noiseless cases.

math.FA↗