Papers
Topics
Authors
Recent
Search
2000 character limit reached

CPVQ-VAE for Class-Consistent Point Clouds

Updated 25 January 2026
  • The paper introduces CPVQ-VAE, which partitions the latent codebook into class-specific bins to ensure geometrically and semantically accurate point cloud generation.
  • It employs class-aware maintenance and a dual-stage encoding-decoding process to counteract codebook collapse and misclassification errors.
  • Empirical results reveal significant reductions in Chamfer Distance and Point2Mesh Error compared to standard VAEs and diffusion-based methods.

The Class-Partitioned Vector Quantized Variational Autoencoder (CPVQ-VAE) is a generative model architecture developed to produce class-consistent point cloud objects from latent features, enabling direct point cloud scene generation without reliance on external object retrieval databases. CPVQ-VAE addresses failure modes observed when conventional autoencoders or diffusion-based latent decoding yield incorrect object geometries with mismatched classes. By explicitly partitioning the latent codebook into class-labeled bins and employing class-aware codebook maintenance, CPVQ-VAE reliably maps generated latents to point cloud shapes matching the intended object category, achieving significant reductions in geometrical and semantic reconstruction errors (Edirimuni et al., 18 Jan 2026).

1. Architecture and Codebook Partitioning

CPVQ-VAE extends the standard VQ-VAE framework through a dual mechanism: partitioning the codebook into class-specific bins and actively maintaining codebook utilization to counteract codebook collapse. The model operates over point cloud inputs PRNP×3P \in \mathbb{R}^{N_P \times 3}, with NP=2025N_P=2025 points. The encoder E\mathfrak{E} utilizes a PointNet++-style architecture consisting of three set-abstraction layers, feature MLPs, and global max-pooling, mapping PP to a 128-dimensional latent vector zez_e. Quantization snaps zez_e to the nearest codevector within the designated class partition, yielding zqR128z_q \in \mathbb{R}^{128}. The decoder D\mathfrak{D} adopts a FoldingNet-inspired strategy: a fixed 45×4545 \times 45 2D grid is concatenated with zqz_q and passed through two “folding” MLP layers to generate the reconstructed point cloud NP=2025N_P=20250.

Let NP=2025N_P=20251 denote the number of object classes and NP=2025N_P=20252 the number of discrete codevectors per class, so the total codebook size is NP=2025N_P=20253. Codevectors NP=2025N_P=20254 are assigned to contiguous class-specific blocks. During quantization, for an object of class NP=2025N_P=20255, only codevectors in block NP=2025N_P=20256 are considered.

2. Training Objectives and Codebook Maintenance

CPVQ-VAE’s optimization minimizes three terms comprising the VQ-VAE loss:

NP=2025N_P=20257

  • Quantization loss: NP=2025N_P=20258
  • Commitment loss: NP=2025N_P=20259, with experimental coefficients E\mathfrak{E}0 and E\mathfrak{E}1.

To resolve codebook collapse (large swathes of codevectors unused), CPVQ-VAE uses a class-aware running-average update. For each codevector E\mathfrak{E}2, a usage statistic E\mathfrak{E}3 is maintained:

E\mathfrak{E}4

where E\mathfrak{E}5 approximates usage in batch of size E\mathfrak{E}6, and E\mathfrak{E}7. If E\mathfrak{E}8 falls below a threshold, E\mathfrak{E}9 is reinitialized towards the nearest encoding in the batch:

PP0

PP1

where PP2 identifies the closest encoding of class PP3 in the current batch. This procedure ensures each class partition remains populated with active codevectors.

3. Training and Inference Procedures

Training Algorithm

For each mini-batch of labeled point clouds PP4:

  • Encode PP5
  • For each PP6, determine PP7
  • Assign PP8, reconstruct PP9
  • Compute zez_e0 over the batch, backpropagate gradients, update codebook entries via the class-aware running average
  • Update zez_e1, reinitialize dead codevectors

Inference Workflow (with LFMM)

Objects generated by the Latent-space Flow Matching Model (LFMM) provide a class label zez_e2 and a 32-dimensional feature vector zez_e3 per object. CPVQ-VAE applies a class-aware inverse lookup:

  • zez_e4 is zero-padded to 128 dimensions.
  • For the class zez_e5, choose zez_e6
  • Quantized latent zez_e7 is decoded to zez_e8

This results in direct generation of class-specific point clouds, bypassing retrieval from external databases.

4. Integration with Latent-space Flow Matching Model (LFMM)

LFMM generates holistic scene layouts by producing object labels and features as inputs for CPVQ-VAE. Each object’s attributes zez_e9 (translation, rotation, size, class, feature) are vectorized. LFMM learns a vector field zez_e0 that transports a Gaussian noise sample zez_e1 along a linear path zez_e2 towards the data sample zez_e3. The velocity field zez_e4 is predicted by a U-Net with cross-attention to floorplan encodings and optimized using

zez_e5

Sampling is performed via Euler integration with zez_e6 steps:

zez_e7

LFMM thus yields box parameters, class probabilities, and latent features that drive the CPVQ-VAE decoding process.

5. Evaluation Metrics and Empirical Results

Quantitative evaluation employs:

  • Chamfer Distance (CD): as defined above, reported as zez_e8.
  • Point2Mesh Error (P2M): the average zez_e9 distance from each generated point to the ground-truth mesh surface (zqR128z_q \in \mathbb{R}^{128}0-wrapped mesh), also reported as zqR128z_q \in \mathbb{R}^{128}1.

On the 3D-FRONT living-room dataset:

  • CPVQ-VAE achieves a 70.4% reduction in Chamfer Distance and a 72.3% reduction in Point2Mesh Error relative to the Diffuscene baseline.
  • Compared to an LFMM+standard VAE, CPVQ-VAE yields a 63.2% reduction in CD and a 64.7% reduction in P2M.

Qualitative observations indicate that standard VAEs often decode latent codes into incorrect class geometries (e.g., chairs as sofas). CPVQ-VAE’s class-aware lookup mechanism consistently produces shapes matching the generated class, mitigating previous semantic inconsistencies.

6. Significance and Implications

CPVQ-VAE’s innovations—a labeled, class-partitioned codebook and class-aware maintenance—enable direct, semantically accurate point cloud generation for multi-object scenes, eliminating the necessity for pre-defined object databases. When paired with LFMM for scene layout generation, the approach constitutes the first system capable of pure point cloud synthesis of multi-class 3D indoor scenes with high geometric fidelity and class consistency, as demonstrated by substantial error reductions in both CD and P2M metrics (Edirimuni et al., 18 Jan 2026).

A plausible implication is that class-partitioned quantization with active code maintenance could generalize to other modalities and tasks suffering from latent-class inconsistency and codebook collapse. The CPVQ-VAE framework provides methodological advances for scene-level generative models in 3D computer vision, particularly where direct correspondence between latent codes and object classes is essential.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Class-Partitioned Vector Quantized Variational Autoencoder (CPVQ-VAE).