arXiv Computer Vision

Thread-Efficient Decoding for Neural Texture Compression

Thread‑Efficient Decoding for Neural Texture Compression proposes a shared decoder MLP architecture trained with a gradual decoder freezing schedule and texture clustering to reduce GPU thread divergence by 25‑52%. The method preserves rendering quality while achieving up to 8.48× speedup on a Radeon RX 9070 XT compared to non‑shared baselines. Experiments on over 500 textures and multiple real rendering scenes validate the performance gains and provide comprehensive ablation studies.

Hugging Face Trending Papers
Aug 18

MoE-ViE: Mixture of Experts Vision Encoder for Efficient Image and Video Understanding

MoE-ViE introduces a Mixture-of-Experts vision encoder that scales efficiently for image and video understanding, outperforming dense counterparts across various sizes. The study shows fine‑grained MoE topologies provide significant gains, and proposes an auxiliary‑loss‑free balancing variant and a specialized MoE kernel to reduce inference latency. With frame‑level distillation and a novel freezing mechanism, the largest MoE‑ViE model matches state‑of‑the‑art zero‑shot performance while being 1.7× larger and 76% faster, and it outperforms other encoders when paired with a language model on both image and video benchmarks.

Hugging Face Trending Papers
Jul 27

GenSplatCodec: Feed-Forward Gaussian Splatting Compression via One-Step Diffusion

Feed-forward 3D Gaussian Splatting (3DGS) enables scalable scene reconstruction without per-scene optimization, yet produces dense Gaussians that are costly to store and transmit. Existing feed-forward Gaussian compression methods formulate decoding as deterministic representation recovery, which becomes inadequate at low bitrates when high-frequency textures and view-dependent appearance are discarded.

arXiv Computer Vision
Aug 28

ReSplat: Learning Recurrent Gaussian Splatting

ReSplat introduces a recurrent Gaussian splatting model that iteratively refines 3D Gaussians using the rendering error as a feedback signal, avoiding explicit gradient computation. The method starts from a compact reconstruction in a subsampled space, producing far fewer Gaussians than prior per‑pixel models, which reduces computational cost. Experiments on multiple datasets, view counts, and resolutions show state‑of‑the‑art performance with faster rendering speeds.

By Haofei Xu, Daniel Barath, Andreas Geiger, Marc Pollefeys