Sparse Compression VAE (SC-VAE)

• SC-VAE is a framework that embeds sparsity into variational autoencoders to overcome issues like posterior and codebook collapse while offering a structured latent space.
• It employs learned ISTA for efficient sparse coding in images and sparse-convolutional networks for point cloud attribute compression, optimizing rate-distortion tradeoffs.
• Empirical results show SC-VAE achieves superior reconstruction metrics and competitive compression performance compared to traditional and state-of-the-art methods.

Sparse Compression Variational Autoencoder (SC-VAE) refers to two distinct, state-of-the-art frameworks that integrate sparsity into the variational autoencoder paradigm: one for image modeling via sparse coding with learned ISTA, and one for point cloud attribute compression via sparse convolutions. Both models exploit the representational advantages of sparsity within the VAE framework to overcome limitations of conventional continuous and discrete latent variable approaches, achieving superior or competitive results in data compression, generative modeling, and unsupervised structuring of high-dimensional data (Xiao et al., 2023, Wang et al., 2022).

1. Motivation and Conceptual Foundations

Traditional VAEs leverage either (i) continuous, static Gaussian priors or (ii) discrete latent representations via vector quantization (VQ). Continuous-prior VAEs (e.g., vanilla VAE, β-VAE, InfoVAE) are susceptible to posterior collapse—strong decoders ignore the latent variables, driving the approximate posterior $q(z|x)$ towards the prior $p(z)$ and degrading the information-carrying capacity of $z$. Additionally, simple Gaussian priors poorly fit multi-modal or highly structured data, limiting reconstruction and generative capabilities.

Discrete (VQ-VAE family) sidestep posterior collapse via codebook lookup but suffer from codebook collapse (under-utilized embeddings), quantization artifacts, and the need for surrogate gradient estimators. SC-VAE for images introduces latent variables as sparse linear combinations of atoms from a fixed, orthonormal dictionary, minimizing both forms of collapse while supporting a smooth, interpretable latent space (Xiao et al., 2023).

In point cloud attribute compression, the classical impediment is the representation of large, irregular data with efficient encoding and rate-distortion tradeoffs. Here, SC-VAE exploits sparse-convolutional networks to encode color attributes, using adaptive entropy models and context-aware priors to minimize bitrate and error (Wang et al., 2022).

2. Mathematical Formulation

2.1 SC-VAE for Images (Sparse Coding-based VAE with Learned ISTA)

Let $x\in\mathbb{R}^{H\times W\times C}$ be an image, $z_{ij}\in\mathbb{R}^K$ a sparse latent code at spatial location $(i,j)$, and $D\in\mathbb{R}^{n\times K}$ a fixed orthonormal dictionary ($D^T D = I$).

Decoder and Generation:

• Each patch latent is decoded via $\tilde u_{ij}=D z_{ij}$.
• The reconstructed image is $\hat{x}=G(\{ \tilde u_{ij}\})$, with $p(z)$0 a deterministic deep decoder.

Probabilistic model:

• $p(z)$1
• Prior: $p(z)$2 (Laplace/L1 prior).

Inference via LISTA:

• $p(z)$3
• Solved by learned ISTA (LISTA): for layer $p(z)$4, $p(z)$5, where $p(z)$6.
• $p(z)$7, $p(z)$8, $p(z)$9; in LISTA, these are learnable.

Loss (no KL—explicit sparsity):

• $z$0
• $z$1
• Total: $z$2 (Xiao et al., 2023).

2.2 SC-VAE for Point Cloud Attribute Compression

Let $z$3 points $z$4 with color $z$5 as input, represented as a sparse tensor.

Encoder/decoder: 6 sparse-convolutional layers (stride $z$6 at layers $z$7), outputting quantized latents $z$8. Decoder mirrors the encoder.

Hyperprior and Context:

• Hyper encoder yields hyperlatents $z$9; hyperdecoder reconstructs side-information $x\in\mathbb{R}^{H\times W\times C}$0.
• Autoregressive context interrogates masked causal neighborhoods, with context and hyper-decoded features producing locally adaptive mean/scale for latents.

VAE objective:

$x\in\mathbb{R}^{H\times W\times C}$1

Rate-distortion implemented as:

$x\in\mathbb{R}^{H\times W\times C}$2

with

$x\in\mathbb{R}^{H\times W\times C}$3

$x\in\mathbb{R}^{H\times W\times C}$4

Entropy model: Each latent $x\in\mathbb{R}^{H\times W\times C}$5 modeled by a Laplacian, convolved with uniform: $x\in\mathbb{R}^{H\times W\times C}$6 (Wang et al., 2022).

3. Model Architecture and Training

3.1 Image SC-VAE

• Encoder: Deep ResNet blocks (VQGAN architecture), downsampling to latent map $x\in\mathbb{R}^{H\times W\times C}$7.
• LISTA module: $x\in\mathbb{R}^{H\times W\times C}$8 unfolded ISTA layers, producing $x\in\mathbb{R}^{H\times W\times C}$9 for each patch. Parameters of unfolding are trained end-to-end.
• Decoder: Symmetric to encoder with upsampling.
• Dictionary $z_{ij}\in\mathbb{R}^K$0: Fixed orthonormal DCT, typically $z_{ij}\in\mathbb{R}^K$1.
• Optimization: Adam, $z_{ij}\in\mathbb{R}^K$2 epochs, batch size $z_{ij}\in\mathbb{R}^K$3, learning rate $z_{ij}\in\mathbb{R}^K$4, $z_{ij}\in\mathbb{R}^K$5 initialized to $z_{ij}\in\mathbb{R}^K$6 and learned.

Table: Key Model Hyperparameters for Image SC-VAE

Component	Choice/Size	Notes
Encoder	VQGAN + ResNet	Downsampling
LISTA depth	$z_{ij}\in\mathbb{R}^K$7	Best at $z_{ij}\in\mathbb{R}^K$8–$z_{ij}\in\mathbb{R}^K$9
Dictionary	DCT, $(i,j)$0	e.g., $(i,j)$1
$(i,j)$2	Learnable, init $(i,j)$3	Promotes sparsity

3.2 Point Cloud Attribute SC-VAE

• Encoder/Decoder: 6 SConv layers, $(i,j)$4 kernels (MinkowskiEngine). Output feature width $(i,j)$5.
• Hyperpath: Additional down/up SConvs for hyperlatents, context modeling via masked $(i,j)$6 SConv.
• Optimization: Learning rate $(i,j)$7, $(i,j)$8 epochs, Adam optimizer typical.
• Batch size: Not specified; small batches common due to data size.

4. Empirical Results and Comparative Evaluation

4.1 Image SC-VAE

Experiments on FFHQ and Imagenet, at $(i,j)$9 resolution, compare SC-VAE to VQGAN, Mo-VQGAN, RQ-VAE, and continuous/sparse-prior VAEs across metrics (PSNR, SSIM, LPIPS, recon-FID). Notably, at $D\in\mathbb{R}^{n\times K}$0 latent grid, SC-VAE achieves (FFHQ):

Metric	VQGAN	RQ-VAE	Mo-VQGAN	SC-VAE
PSNR	22.24	24.53	26.72	29.70
SSIM	0.6641	0.7602	0.8212	0.8347
LPIPS	0.1175	0.0895	0.0585	0.1956

At $D\in\mathbb{R}^{n\times K}$1, SC-VAE yields PSNR=$D\in\mathbb{R}^{n\times K}$2, SSIM=$D\in\mathbb{R}^{n\times K}$3, LPIPS=$D\in\mathbb{R}^{n\times K}$4, rFID=$D\in\mathbb{R}^{n\times K}$5, outperforming all baselines. Analogous gains are observed on ImageNet.

LISTA ablation: $D\in\mathbb{R}^{n\times K}$6–$D\in\mathbb{R}^{n\times K}$7 yields highest PSNR ($D\in\mathbb{R}^{n\times K}$8) and best sparsity ($D\in\mathbb{R}^{n\times K}$9–$D^T D = I$0). Lower or higher $D^T D = I$1 degrades performance.

4.2 Point Cloud Attribute SC-VAE

Evaluation on 8i Full Bodies (“longdress,” etc.), against TMC13 v6, v14, RAHT, and prior learned methods.

• Bjøntegaard gains vs TMC13 v6: BD-BR reduction $D^T D = I$2, BD-PSNR $D^T D = I$3 dB.
• vs RAHT: $D^T D = I$4 reduction, $D^T D = I$5 dB PSNR.
• vs TMC13 v14: SC-VAE lags by $D^T D = I$6 BD-BR ($D^T D = I$7 dB PSNR).
• Qualitative: Smoother color, reduced artifacts; rivals TMC13 v14 visually.
• Entropy model ablation: Joint hyperprior+AR gives $D^T D = I$8 BD-BR saving over factorized baseline.

5. Downstream Applications

5.1 Image Generation and Disentanglement

Image SC-VAE supports interpretable latent traversals and interpolations:

• Latent traversal: Vary $D^T D = I$9 within $\tilde u_{ij}=D z_{ij}$0 can effect semantic edits (smile, pose, lighting).
• Interpolation: Linear interpolation between two latent codes generates smooth image morphs.

5.2 Patch Clustering and Unsupervised Segmentation

• Each $\tilde u_{ij}=D z_{ij}$1 serves as a patch descriptor; $\tilde u_{ij}=D z_{ij}$2-means clusters ($\tilde u_{ij}=D z_{ij}$3) segregate regions of similar texture and semantics (e.g., sky, foliage).
• Unsupervised segmentation by clustering all $\tilde u_{ij}=D z_{ij}$4 into classes ($\tilde u_{ij}=D z_{ij}$5), upsampling to produce segmentation masks. Achieves IoU=$\tilde u_{ij}=D z_{ij}$6, DICE=$\tilde u_{ij}=D z_{ij}$7 on Flowers dataset, and competitive results on additional datasets without fine-tuning.
• SC-VAE-based segmenters are more robust to Gaussian noise than GAN-driven approaches.

6. Practical Considerations and Limitations

• Orthogonal dictionary (e.g., DCT): Facilitates disentanglement, avoids scale ambiguity.
• Loss balancing by $\tilde u_{ij}=D z_{ij}$8: Ensures latent penalty does not overshadow image reconstruction.
• Optimal LISTA rollout ($\tilde u_{ij}=D z_{ij}$9–$\hat{x}=G(\{ \tilde u_{ij}\})$0): Trade-off between sparsity ($\hat{x}=G(\{ \tilde u_{ij}\})$1–$\hat{x}=G(\{ \tilde u_{ij}\})$2 by Hoyer metric) and reconstruction fidelity.
• Latent Map Size: Finer grids ($\hat{x}=G(\{ \tilde u_{ij}\})$3) yield best fidelity but incur higher computational cost; coarser ($\hat{x}=G(\{ \tilde u_{ij}\})$4) degrade results.
• Current limits: In point cloud compression, SC-VAE is on par with (or slightly lags) the latest TMC13 v14 in rate-distortion, but outperforms earlier learning-based and standardized systems. Enhancements such as cross-scale prediction are anticipated to close this gap in future work.

7. Significance and Future Directions

SC-VAE frameworks establish that sparse priors and sparse coding principles, when combined with deep architectures and modern learning paradigms (e.g., LISTA, sparse convolutions), yield latent representations that are compact, highly informative, and conducive to both high-fidelity reconstruction and structured downstream analysis. This hybridization addresses foundational limitations of both continuous and discrete VAE approaches—specifically, posterior and codebook collapse—while supporting broader generative and unsupervised learning. A plausible implication is that further integration with cross-scale prediction, transform coefficient prediction, and advanced context models will enable even higher compression ratios and richer semantic decompositions for both images and irregular 3D data (Xiao et al., 2023, Wang et al., 2022).