arXiv (All)
open access
Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging
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 intro
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Fast Differentiable SVD on GPU via Polar Decomposition#1116836
- CTrex: A Research-Oriented Framework for Kernel- and Projection-Level Algorithm Development in CT Reconstruction#1078237
- Info3R: Information-Adaptive Test-Time Training for 3D Reconstruction#1036326
- 2D GauSS-MI: Efficient Active Scene Reconstruction with Balanced Visual and Geometric Quality#1035915
- A randomized global GMRES method for matrix equations#972415
Record · ID 1061762
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive