Paperlane

no. 16 · Tuesday 17 November 2026

Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging

Christopher Hahne

math.NA · v3

Abstract

Singular Value Decomposition (SVD) underlies matrix factorisation tasks across many fields, with imaging applications demanding cost-efficient processing. Yet SVD algorithms are inherently sequential, constraining GPU throughput and limiting 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 decomposition with an orthogonal left factor, achieves high reconstruction fidelity and substantially accelerates computation relative to the exact SVD, with high throughput exceeding standard video frame rates. Performance is evaluated on multiple imaging tasks spanning complementary computational regimes: (1) an MNIST denoising benchmark at an intermediate scale with known ground truth, (2) Mueller matrix polarimetry for neurosurgical tissue characterisation, requiring massive batch processing of small matrices, and (3) spatio-temporal background subtraction for ultrasound localisation microscopy, requiring high-dimensional matrix separation. Across regimes and instruments, the proposed framework demonstrates robust domain transfer at various matrix scales and 2.6–67$\times$ speed-ups over the exact GPU SVD, and, unlike randomised SVD, accelerates large batches of small full-rank matrices. By prioritising downstream reconstruction fidelity over exact spectral recovery, the proposed SVD framework enables GPU-friendly matrix factorisation.

fields
Numerical Analysis
pdf ↗ page arXiv:2607.25967 ↗