arXiv Machine Learning

E3DGS: Unified Geometric-Photometric Equivariance for 3D Gaussian Splatting via Color-as-Geometry Embedding

arXiv:2607. 15536v1 Announce Type: cross Abstract: 3D Gaussian Splatting (3DGS) captures scenes by coupling explicit geometry (position, covariance) with view-dependent photometry (Spherical Harmonics).

arXiv Computer Vision
Sep 25

Only What Was Seen: Observation-Gram Compaction of View-Dependent Appearance in 3D Gaussian Splatting

The paper introduces an observation‑Gram matrix that captures how each Gaussian in a 3D Gaussian Splatting model is viewed from training camera directions. This matrix serves as a distortion metric, enabling closed‑form degree reduction, Lagrangian rate‑distortion degree allocation, and matrix‑weighted vector quantisation. When applied to the Compressed3D framework, the metric improves PSNR by 0.49 dB before fine‑tuning and still yields a 0.32 dB gain at matched bitrate without any training images, while a training‑free stack built on the metric is 15% smaller than the image‑free GSICO at equal quality on Mip‑NeRF 360.

By Krzysztof Pietroszek
Hugging Face Trending Papers
Jun 23

REDI-Match: Rotation-Equivariant Distillation for Efficient and Robust Dense Matching

Vision Foundation Models (VFMs) have significantly advanced dense feature matching, yet severe in-plane rotation remains a critical challenge. Existing solutions face a fundamental dilemma: data-driven methods require inefficient parameter scaling to implicitly learn rotations, whereas strictly equivariant networks lack the semantic capacity of modern VFMs.

arXiv Computer Vision
Sep 4

Stable and Scalable Bundle Adjustment of Holistic 3D Structures

The paper introduces a unified bundle adjustment framework that jointly optimizes camera parameters, sparse 3D points, and richer geometric features such as lines, coplanarity, and parallelism. It classifies features into scalable ones with direct 2D measurements and higher‑order groups that can be treated as camera‑like entities, allowing group constraints and cross‑feature relations to be expressed via 2D reprojection errors. This approach preserves the sparsity of classical point‑based BA, maintains numerical stability, and achieves runtime comparable to point‑only BA while producing richer 3D structures and improved accuracy.

By Shaohui Liu, R\'emi Pautrat, Daniel Barath, Richard Hartley, Viktor Larsson, Marc Pollefeys