An Efficient Geometric Points-Guided Generalized Exponential Splatting

This paper presents a novel Generalized Exponential Splatting framework for scene reconstruction. Unlike neural radiance fields (NeRF), 3D Gaussian Splatting (3DGS) offers rapid rendering and high fidelity. However, existing 3DGS frameworks integrating RGB-D SLAM face challenges in system efficiency and aliasing artifacts. Inspired by geometric features, we first categorize the space into three regions—edge, planar, and non-planar—based on their information richness. The edge extraction is realized through an energy function, while planar and non-planar regions are segmented via a fast segmentation algorithm proposed in this paper. Secondly, a sparseness function is established to screen key points within the these regions to build a geometric points-guided Generalized Exponential Splatting model (GP-GES), strategically placing primitives to reduce redundancy. Finally, by integrating a 3D low-pass filter, a smooth GP-GES model is further built, ensuring that the frequency of the primitives adheres to the Nyquist-Shannon theorem, to mitigate high-frequency artifacts. Extensive experiments show that our method reduces the map size by 3.7× to 6× without sacrificing rendering quality, thereby accelerating the computational efficiency of the system. In addition, the segmentation algorithm has a fast detection speed, with a frame rate exceeding 90Hz.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automation Science and Engineering
Published
2025-01-01
DOI
https://doi.org/10.1109/tase.2025.3602403
Primary Topic
Advanced Numerical Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Efficient Geometric Points-Guided Generalized Exponential Splatting

Zhongli Wang, Xin Jiang, Donglin Zhu
IEEE Transactions on Automation Science and Engineering
Advanced Numerical Analysis Techniques
article

An Efficient Geometric Points-Guided Generalized Exponential Splatting

Zhongli Wang, Xin Jiang, Donglin Zhu
article en

Abstract

This paper presents a novel Generalized Exponential Splatting framework for scene reconstruction. Unlike neural radiance fields (NeRF), 3D Gaussian Splatting (3DGS) offers rapid rendering and high fidelity. However, existing 3DGS frameworks integrating RGB-D SLAM face challenges in system efficiency and aliasing artifacts. Inspired by geometric features, we first categorize the space into three regions—edge, planar, and non-planar—based on their information richness. The edge extraction is realized through an energy function, while planar and non-planar regions are segmented via a fast segmentation algorithm proposed in this paper. Secondly, a sparseness function is established to screen key points within the these regions to build a geometric points-guided Generalized Exponential Splatting model (GP-GES), strategically placing primitives to reduce redundancy. Finally, by integrating a 3D low-pass filter, a smooth GP-GES model is further built, ensuring that the frequency of the primitives adheres to the Nyquist-Shannon theorem, to mitigate high-frequency artifacts. Extensive experiments show that our method reduces the map size by 3.7× to 6× without sacrificing rendering quality, thereby accelerating the computational efficiency of the system. In addition, the segmentation algorithm has a fast detection speed, with a frame rate exceeding 90Hz.

IEEE Transactions on Automation Science and EngineeringVol. 22
Beijing Jiaotong University (CN)
Openalex Percentile: Top 76%
Advanced Numerical Analysis Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.