Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging
Abstract
Singular Value Decomposition (SVD) underlies matrix factorisation tasks across many fields, with imaging applications demanding real-time processing. Yet SVD algorithms are inherently sequential, constraining real-time GPU throughput and limit online deployment in imaging pipelines. This study introduces a fully parallelized matrix factorization framework for GPUs by enforcing matrix orthogonality on left singular vectors via Lie-parametrised algebra and recovering the remaining components through soft constraints. This asymmetric constraint design enables an efficient parallel and provably valid decomposition, achieves high reconstruction fidelity and substantially accelerates computation relative to the exact SVD, with real-time throughput exceeding standard video frame rates. Performance is evaluated on multiple imaging tasks spanning complementary computational regimes: (1) spatio-temporal background subtraction for ultrasound localisation microscopy, requiring high-dimensional matrix separation, (2) Mueller matrix polarimetry for neurosurgical tissue characterisation, requiring massive batch processing of small matrices, and (3) an MNIST denoising benchmark at an intermediate scale with known ground truth. Across regimes and instruments, the proposed framework demonstrates robust domain transfer at various matrix scales, sufficient for live image-guided workflows that classical solvers cannot currently support in these settings. By prioritising downstream reconstruction fidelity over exact spectral recovery, the proposed SVD framework makes structured matrix factorisation practical for real-time processing.
Related
- Factorisation and matrix amplification of real rank zero inclusions
- Bi-Oriented Interlaced Matrix Multiplication and an Operator Factorisation of the Quantum Harmonic Oscillator
- Non-negative Matrix Factorisation with Topological Regularisation
- Normalisation of Wiener--Hopf Factorisation for Matrix Functions
- Area-constrained Willmore surfaces in Lorentzian manifolds: curvature inequalities and the Hawking quasi-local energy
BibTeX
@misc{hahne2026quasisvd,
title = {{Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging}},
author = {Christopher Hahne},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2607.25967},
eprint = {2607.25967},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.25967},
note = {CC BY-SA 4.0},
}
RIS
TY - UNPB
TI - Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging
AU - Christopher Hahne
PY - 2026
DA - 2026/09/22
PB - arXiv
DO - 10.48550/arxiv.2607.25967
UR - https://arxiv.org/abs/2607.25967
AB - Singular Value Decomposition (SVD) underlies matrix factorisation tasks across many fields, with imaging applications demanding real-time processing. Yet SVD algorithms are inherently sequential, constraining real-time GPU throughput and limit online deployment in imaging pipelines. This study introduces a fully parallelized matrix factorization framework for GPUs by enforcing matrix orthogonality on left singular vectors via Lie-parametrised algebra and recovering the remaining components through soft constraints. This asymmetric constraint design enables an efficient parallel and provably valid decomposition, achieves high reconstruction fidelity and substantially accelerates computation relative to the exact SVD, with real-time throughput exceeding standard video frame rates. Performance is evaluated on multiple imaging tasks spanning complementary computational regimes: (1) spatio-temporal background subtraction for ultrasound localisation microscopy, requiring high-dimensional matrix separation, (2) Mueller matrix polarimetry for neurosurgical tissue characterisation, requiring massive batch processing of small matrices, and (3) an MNIST denoising benchmark at an intermediate scale with known ground truth. Across regimes and instruments, the proposed framework demonstrates robust domain transfer at various matrix scales, sufficient for live image-guided workflows that classical solvers cannot currently support in these settings. By prioritising downstream reconstruction fidelity over exact spectral recovery, the proposed SVD framework makes structured matrix factorisation practical for real-time processing.
ER -