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.
15 January 2020 in IEEE Transactions on Signal Processing
We propose a novel approach for hyperspectral super-resolution, that is based on low-rank tensor approximation for a coupled low-rank multilinear (Tucker) model. We show that the correct recovery holds for a wide range of multilinear ranks. For coupled tensor approximation, we propose two SVD-based algorithms that are simple and fast, but with a performance comparable to the state-of-the-art methods. The approach is applicable to the case of unknown spatial degradation and to the pansharpening problem.
28 January 2021 in IEEE Journal of Selected Topics in Signal Processing
Coupled tensor approximation has recently emerged as a promising approach for the fusion of hyperspectral and multispectral images, reconciling state of the art performance with strong theoretical guarantees. However, tensor-based approaches previously proposed assume that the different observed images are acquired under exactly the same conditions. A recent work proposed to accommodate inter-image spectral variability in the image fusion problem using a matrix factorization-based formulation, but did not account for spatially-localized variations. Moreover, it lacks theoretical guarantees and has a high associated computational complexity. In this paper, we consider the image fusion problem while accounting for both spatially and spectrally localized changes in an additive model. We first study how the general identifiability of the model is impacted by the presence of such changes. Then, assuming that the high-resolution image and the variation factors admit a Tucker decomposition, two new algorithms are proposed - one purely algebraic, and another based on an optimization procedure. Theoretical guarantees for the exact recovery of the high-resolution image are provided for both algorithms. Experimental results show that the proposed method outperforms state-of-the-art methods in the presence of spectral and spatial variations between the images, at a smaller computational cost.
11 January 2022 in SIAM Journal on Imaging Sciences
In this paper, we propose to jointly solve the hyperspectral super-resolution problem and the unmixing problem of the underlying super-resolution image using a coupled LL1 block-tensor decompositio...
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.