Skip to content
Tech News
← Back to articles

Truncated SVD (2023)

read original more articles
Why This Matters

This article explains how truncated SVD is a powerful technique for data reduction and image compression, closely related to PCA. Understanding these methods helps in developing efficient algorithms for processing large datasets and images, benefiting both industry applications and consumer technology. The concept of truncating SVD allows for simplified data representations with minimal loss of information, making it a key tool in machine learning and signal processing.

Key Takeaways

PCA

Principal Component Analysis (PCA) is the subject of a previous post of mine, so I will only summarize it here.

Data reduction via PCA is accomplished by linearly transforming the data into a new coordinate system where (most of) the variation in the data can be described with fewer dimensions than the initial data.

Without getting into the details, this involves an eigen-decomposition of the covariance matrix.

SVD

Singular Value Decomposition (SVD) is a matrix factorization technique that factors a real matrix M into three matrices U , Σ , and V such that M=U*Σ*V^T .

If M is mxn , then U is mxm , Σ is mxn and V is nxn . Both U and V are orthonormal, and Σ is rectangular-diagonal with non-negative coefficients.

This is very similar to PCA, excepting that the factorization for SVD is done on the data matrix, whereas for PCA, the factorization is done on the covariance matrix.

The diagonal coefficients of Σ are known as the singular values of M and it is common practice to rearrange the SVD so the singular values are given in decreasing order. The number of non-zero singular values is equal to the rank of M .

The SVD is tightly related to PCA:

... continue reading