Papers › Enhancing the SVD Compression
Enhancing the SVD Compression
Huiwen Wang, Yanwen Zhang, Jichang Zhao
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Orthonormality is the foundation of matrix decomposition. For example, Singular Value Decomposition (SVD) implements the compression by factoring a matrix with orthonormal parts and is pervasively utilized in various fields. Orthonormality, however, inherently includes constraints that would induce redundant degrees of freedom, preventing SVD from deeper compression and even making it frustrated as the data fidelity is strictly required. In this paper, we theoretically prove that these redundancies resulted by orthonormality can be completely eliminated in a lossless manner. An enhanced version of SVD, namely E-SVD, is accordingly established to losslessly and quickly release constraints and recover the orthonormal parts in SVD by avoiding multiple matrix multiplications. According to the theory, advantages of E-SVD over SVD become increasingly evident with the rising requirement of data fidelity. In particular, E-SVD will reduce 25% storage units as SVD reaches its limitation and fails to compress data. Empirical evidences from typical scenarios of remote sensing and Internet of things further justify our theory and consistently demonstrate the superiority of E-SVD in compression. The presented theory sheds insightful lights on the constraint solution in orthonormal matrices and E-SVD, guaranteed by which will profoundly enhance the SVD-based compression in the context of explosive growth in both data acquisition and fidelity levels.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections