Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Eulerian Gaussian Splatting using Hashed Probability Pyramids
by
Polansky, Mia Gaia
, Verbin, Dor
, Garbin, Stephan
, Kopanas, George
, Zickler, Todd
in
Densification
/ Density
/ Optimization
/ Pyramids
/ Statistical analysis
2026
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Eulerian Gaussian Splatting using Hashed Probability Pyramids
by
Polansky, Mia Gaia
, Verbin, Dor
, Garbin, Stephan
, Kopanas, George
, Zickler, Todd
in
Densification
/ Density
/ Optimization
/ Pyramids
/ Statistical analysis
2026
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Eulerian Gaussian Splatting using Hashed Probability Pyramids
Paper
Eulerian Gaussian Splatting using Hashed Probability Pyramids
2026
Request Book From Autostore
and Choose the Collection Method
Overview
We introduce a probabilistic splat-based radiance field framework that retains the fast rasterization and test-time efficiency of 3D Gaussian Splatting (3DGS) while replacing heuristic primitive manipulation with gradient-based optimization of a volumetric probability density. Rather than relocating, splitting, or culling Gaussians via hand-tuned densification (e.g., ADC), we treat primitive locations as samples drawn from a persistent, learnable density. We instantiate this density using a novel, memory-efficient multi-scale hierarchical grid that enables end-to-end gradient-based optimization. To stabilize the optimization, we derive an unbiased gradient estimator with control variates that markedly reduces variance. By allowing probability mass to flow to where the loss demands, our framework eliminates brittle priors and naturally explores the volume, achieving state-of-the-art reconstruction quality on mip-NeRF 360 while preserving 3DGS-level rendering speed.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.