Quaternions are still largely misunderstood and often considered an “exotic” signal representation without much practical utility despite the fact that they have been around the signal and image processing community for more than 30 years now. The main aim of this article is to counter this misconception and to demystify the use of quaternion algebra for solving problems in signal and image processing. To this end, we propose a comprehensive and objective overview of the key aspects of quaternion representations, models, and methods and illustrate our journey through the literature with flagship applications. We conclude this work by an outlook on the remaining challenges and open problems in quaternion signal and image processing.
Over the last two decades, tensor‐based methods have received growing attention in the signal processing community. In this work, the authors proposed a comprehensive overview of tensor‐based models and methods for multisensor signal processing. They presented for instance the Tucker decomposition, the canonical polyadic decomposition, the tensor‐train decomposition (TTD), the structured TTD, including nested Tucker train, as well as the associated optimisation strategies. More precisely, they gave synthetic descriptions of state‐of‐the‐art estimators as the alternating least square (ALS) algorithm, the high‐order singular value decomposition (HOSVD), and of more advanced algorithms as the rectified ALS, the TT‐SVD/TT‐HSVD and the Joint dImensionally Reduction and Factor retrieval Estimator scheme. They illustrated the efficiency of the introduced methodological and algorithmic concepts in the context of three important and timely signal processing‐based applications: the direction‐of‐arrival estimation based on sensor arrays, multidimensional harmonic retrieval and multiple‐input–multiple‐output wireless communication systems.
23 December 2021 in IEEE Transactions on Signal Processing
This paper introduces a general framework for solving constrained convex quaternion optimization problems in the quaternion domain. To soundly derive these new results, the proposed approach leverages the recently developed generalized $\mathbb {H}\mathbb {R}$-calculus together with the equivalence between the original quaternion optimization problem and its augmented real-domain counterpart. This new framework simultaneously provides rigorous theoretical foundations as well as elegant, compact quaternion-domain formulations for optimization problems in quaternion variables. Our contributions are threefold: (i) we introduce the general form for convex constrained optimization problems in quaternion variables, (ii) we extend fundamental notions of convex optimization to the quaternion case, namely Lagrangian duality and optimality conditions, (iii) we develop the quaternion alternating direction method of multipliers (Q-ADMM) as a general purpose quaternion optimization algorithm. The relevance of the proposed methodology is demonstrated by solving two typical examples of constrained convex quaternion optimization problems arising in signal processing. Our results open new avenues in the design, analysis and efficient implementation of quaternion-domain optimization procedures.
18 February 2020 in IEEE Transactions on Signal Processing
This article introduces quaternion non-negative matrix factorization (QNMF), which generalizes the usual non-negative matrix factorization (NMF) to the case of polarized signals. Polarization information is represented by Stokes parameters, a set of 4 energetic parameters widely used in polarimetric imaging. QNMF relies on two key ingredients: (i) the algebraic representation of Stokes parameters thanks to quaternions and (ii) the exploitation of physical constraints on Stokes parameters. These constraints generalize non-negativity to the case of polarized signals, encoding positive semi-definiteness of the covariance matrix associated which each source. Uniqueness conditions for QNMF are presented. Remarkably, they encompass known sufficient uniqueness conditions from NMF. Meanwhile, QNMF further relaxes NMF uniqueness conditions requiring sources to exhibit a certain zero-pattern, by leveraging the complete polarization information. We introduce a simple yet efficient algorithm called quaternion alternating least squares (QALS) to solve the QNMF problem in practice. Closed-form quaternion updates are obtained using the recently introduced generalized HR calculus. Numerical experiments on synthetic data demonstrate the relevance of the approach. QNMF defines a promising generic low-rank approximation tool to handle polarization, notably for blind source separation problems arising in imaging applications.
Approximate analytical expressions of the white noise gain (WNG) for two superdirective acoustic vector sensor arrays are provided, which disclose the strong dependence of the tradeoff between the WNG and the directivity index (DI) on the highest order of the modes for the pattern synthesis. The considered arrays are a uniform linear array and a uniform circular array. A condition on the WNG that ensures a high array gain in the two-dimensional homogeneous and isotropic noise field is deduced. Using this condition, an upper bound on the highest order of the modes for the pattern synthesis can be derived, and hence the maximum DI can be determined. The presented results are not strictly limited to the two array geometries considered herein, and can be extended to other superdirective acoustic array designs.