Effective Rank Analysis and Regularization for Enhanced 3D Gaussian Splatting
3D reconstruction from multi-view images is one of the fundamental challenges in computer vision and graphics. Recently, 3D Gaussian Splatting (3DGS) has emerged as a promising technique capable of real-time rendering with high-quality 3D reconstruction. This method utilizes 3D Gaussian representation and tile-based splatting techniques, bypassing the expensive neural field querying. Despite its potential, 3DGS encounters challenges such as needle-like artifacts, suboptimal geometries, and inaccurate normals caused by the Gaussians converging into anisotropic shapes with one dominant variance. We propose using the effective rank analysis to examine the shape statistics of 3D Gaussian primitives, and identify the Gaussians indeed converge into needle-like shapes with the effective rank 1. To address this, we introduce the effective rank as a regularization, which constrains the structure of the Gaussians. Our new regularization method enhances normal and geometry reconstruction while reducing needle-like artifacts. The approach can be integrated as an add-on module to other 3DGS variants, improving their quality without compromising visual fidelity. The project page is available at https://junhahyung.github.io/erankgs.github.io.
Code (0)
등록된 구현이 없습니다.
Tasks
3DGS3D ReconstructionSimilar Papers 제목 키워드 기반
ARGS: Advanced Regularization on Aligning Gaussians over the Surface
Reconstructing high-quality 3D meshes and visuals from 3D Gaussian Splatting(3DGS) still remains a central challenge in computer graphics. Although existing models such as SuGaR offer effective solutions for rendering, t…
Deep Diversity-Enhanced Feature Representation of Hyperspectral Images
In this paper, we study the problem of efficiently and effectively embedding the high-dimensional spatio-spectral information of hyperspectral (HS) images, guided by feature diversity. Specifically, based on the theoreti…
DenoisingDiversitySuper-ResolutionRobust Principal Component Analysis on Graphs
Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering. Still it is highly sensitive to outliers and does not scale well with respect to the number of data samp…
ClusteringDimensionality ReductionMissing ValuesLow-Rank and Sparse Enhanced Tucker Decomposition for Tensor Completion
Tensor completion refers to the task of estimating the missing data from an incomplete measurement or observation, which is a core problem frequently arising from the areas of big data analysis, computer vision, and netw…
Data CompressionFace RecognitionAnchor Structure Regularization Induced Multi-view Subspace Clustering via Enhanced Tensor Rank Minimization
The tensor-based multi-view subspace clustering algorithms have received widespread attention due to the powerful ability to capture high-order correlation across views. Although such algorithms have achieved remarka…
ClusteringMulti-view Subspace Clustering