Separable Quaternion Matrix Factorization for Polarization Images
- URL: http://arxiv.org/abs/2207.14039v1
- Date: Thu, 28 Jul 2022 12:27:50 GMT
- Title: Separable Quaternion Matrix Factorization for Polarization Images
- Abstract summary: We propose a separable low-rank quaternion linear mixing model to polarized signals.
We use a block coordinate descent algorithm to compute nonnegative factor activation matrix in real number space.
- Score: 23.740961557338213
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Polarization is a unique characteristic of transverse wave and is represented
by Stokes parameters. Analysis of polarization states can reveal valuable
information about the sources. In this paper, we propose a separable low-rank
quaternion linear mixing model to polarized signals: we assume each column of
the source factor matrix equals a column of polarized data matrix and refer to
the corresponding problem as separable quaternion matrix factorization (SQMF).
We discuss some properties of the matrix that can be decomposed by SQMF. To
determine the source factor matrix in quaternion space, we propose a heuristic
algorithm called quaternion successive projection algorithm (QSPA) inspired by
the successive projection algorithm. To guarantee the effectiveness of QSPA, a
new normalization operator is proposed for the quaternion matrix. We use a
block coordinate descent algorithm to compute nonnegative factor activation
matrix in real number space. We test our method on the applications of
polarization image representation and spectro-polarimetric imaging unmixing to
verify its effectiveness.
Related papers
- Testing for latent structure via the Wilcoxon--Wigner random matrix of normalized rank statistics [0.20052993723676893]
We introduce and systematically study certain symmetric matrices, called Wilcoxon--Wigner random matrices.<n>We establish that the leading eigenvalue and corresponding eigenvector of Wilcoxon--Wigner random matrices admit fluctuations with explicit scaling terms.<n>Results enable rigorous parameter-free and distribution-free spectral methodology for addressing two hypothesis testing problems.
arXiv Detail & Related papers (2025-12-21T23:49:22Z) - Covariance Matrix Construction with Preprocessing-Based Spatial Sampling for Robust Adaptive Beamforming [13.635183363631299]
This work proposes an efficient, robust adaptive beamforming technique to deal with steering vector estimation mismatches.<n>In particular, the direction-of-arrival(DoA) of interfering sources is estimated with available snapshots in which the angular sectors of the interfering signals are computed adaptively.<n>An analysis of the array beampattern in the proposed PPBSS technique is carried out, and a study of the computational cost of competing approaches is conducted.
arXiv Detail & Related papers (2025-09-30T17:46:44Z) - Decoupled Geometric Parameterization and its Application in Deep Homography Estimation [52.96857897366727]
Planar homography, with eight degrees of freedom (DOFs), is fundamental in numerous computer vision tasks.<n>This paper presents a novel geometric parameterization of homographies, leveraging the similarity- kernel-similarity decomposition for projective transformations.<n>Our proposed parameterization allows for direct homography estimation through matrix multiplication, eliminating the need for solving a linear system, and achieves performance comparable to the four-corner positional offsets in deep homography estimation.
arXiv Detail & Related papers (2025-05-22T12:33:29Z) - Efficient Covariance Matrix Reconstruction with Iterative Spatial
Spectrum Sampling [0.0]
We propose a cost-effective technique for designing robust adaptive beamforming algorithms with iterative spatial power spectrum (CMR-ISPS)
The proposed CMR-ISPS approach reconstructs the interference-plus-noise covariance matrix based on a simplified maximum entropy power spectral density function.
The proposed CMR-ISPS beamformer can suppress interferers close to the direction of the signal of interest by producing notches in the directional response of the array with sufficient depths.
arXiv Detail & Related papers (2023-09-02T23:58:01Z) - A hybrid quantum-classical algorithm for multichannel quantum scattering
of atoms and molecules [62.997667081978825]
We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions.
The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix.
We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
arXiv Detail & Related papers (2023-04-12T18:10:47Z) - Semi-Supervised Subspace Clustering via Tensor Low-Rank Representation [64.49871502193477]
We propose a novel semi-supervised subspace clustering method, which is able to simultaneously augment the initial supervisory information and construct a discriminative affinity matrix.
Comprehensive experimental results on six commonly-used benchmark datasets demonstrate the superiority of our method over state-of-the-art methods.
arXiv Detail & Related papers (2022-05-21T01:47:17Z) - NISQ algorithm for the matrix elements of a generic observable [0.0]
We present a noisy intermediate scale quantum algorithm for estimating the diagonal and off-diagonal matrix elements of a generic observable in the energy eigenbasis of a given Hamiltonian.
arXiv Detail & Related papers (2022-05-20T10:07:55Z) - Level compressibility of certain random unitary matrices [0.0]
The value of spectral form factor at the origin, called level compressibility, is an important characteristic of random spectra.
The paper is devoted to analytical calculations of this quantity for different random unitary matrices describing models with intermediate spectral statistics.
arXiv Detail & Related papers (2022-02-22T21:31:24Z) - Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
We propose quantum algorithms for matrix operations using the "Sender-Receiver" model.
These quantum protocols can be used as subroutines in other quantum schemes.
arXiv Detail & Related papers (2022-02-10T08:12:20Z) - Sparse Quadratic Optimisation over the Stiefel Manifold with Application
to Permutation Synchronisation [71.27989298860481]
We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function.
We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
arXiv Detail & Related papers (2021-09-30T19:17:35Z) - Direct solution of multiple excitations in a matrix product state with
block Lanczos [62.997667081978825]
We introduce the multi-targeted density matrix renormalization group method that acts on a bundled matrix product state, holding many excitations.
A large number of excitations can be obtained at a small bond dimension with highly reliable local observables throughout the chain.
arXiv Detail & Related papers (2021-09-16T18:36:36Z) - Sub-Rayleigh characterization of a binary source by spatially
demultiplexed coherent detection [3.9146761527401424]
An algorithm to estimate parameters of a two-dimensional symmetric binary source is devised and verified using Monte Carlo simulations.
The presented algorithm is shown to make a nearly optimal use of the measured data in the sub-Rayleigh region.
arXiv Detail & Related papers (2021-06-15T16:10:19Z) - Optimal Clustering in Anisotropic Gaussian Mixture Models [3.5590836605011047]
We study the clustering task under anisotropic Gaussian Mixture Models.
We characterize the dependence of signal-to-noise ratios on the cluster centers.
arXiv Detail & Related papers (2021-01-14T00:31:52Z) - Understanding Implicit Regularization in Over-Parameterized Single Index
Model [55.41685740015095]
We design regularization-free algorithms for the high-dimensional single index model.
We provide theoretical guarantees for the induced implicit regularization phenomenon.
arXiv Detail & Related papers (2020-07-16T13:27:47Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.