Inferensys

Glossary

Plenoxels

Plenoxels are an explicit, voxel-based scene representation that models the plenoptic function for fast view synthesis and real-time neural rendering without a deep neural network.
ML engineer managing model training cluster on laptop, GPU utilization visible, technical deep learning setup.
NEURAL RENDERING PRIMITIVE

What is Plenoxels?

Plenoxels are an explicit, voxel-based scene representation that models the plenoptic function for view synthesis, enabling fast optimization and rendering without a deep neural network.

Plenoxels (a portmanteau of 'plenoptic' and 'voxels') are an explicit, sparse 3D grid representation of a scene. Each voxel stores spherical harmonics coefficients modeling view-dependent color and a density value. This structure directly represents the plenoptic function—the complete flow of light at every 3D point in every direction—enabling high-quality novel view synthesis through differentiable volume rendering and gradient-based optimization.

Unlike Neural Radiance Fields (NeRFs) that use a large MLP, Plenoxels employ a purely explicit data structure. This design eliminates the need for a deep network during inference, allowing for extremely fast rendering via trilinear interpolation and raymarching. Optimization uses stochastic gradient descent directly on the voxel grid parameters, achieving competitive visual quality with significantly reduced training times compared to early NeRF models.

EXPLICIT NEURAL REPRESENTATION

Key Features of Plenoxels

Plenoxels are a sparse voxel grid representation that directly models the plenoptic function—the intensity of light rays in every direction at every point in space—enabling fast, high-quality view synthesis without a deep, multi-layer perceptron (MLP).

01

Explicit Sparse Voxel Grid

Unlike an implicit neural representation like a standard NeRF, Plenoxels store scene data in an explicit, sparse 3D grid of voxels. Each voxel contains learnable parameters for spherical harmonics coefficients (modeling view-dependent color) and a density value. This structure eliminates the need for a large MLP to decode spatial coordinates, making optimization and rendering significantly faster.

  • Direct Parameterization: Scene properties are directly attached to grid locations.
  • Sparsity: Only voxels occupied by the scene are stored and optimized, saving memory.
  • Interpolation: Properties for any 3D point are computed via trilinear interpolation of the eight nearest voxels.
02

Differentiable Volumetric Rendering

Plenoxels are optimized via differentiable volumetric rendering using the classic volume rendering equation. A ray is cast through the voxel grid, and color and density values are sampled and composited along its path. Because the rendering process is fully differentiable with respect to the voxel parameters, gradients can flow backward to update the spherical harmonics and density values.

  • Ray Marching: The scene is rendered by accumulating samples along camera rays.
  • Gradient Flow: The mean squared error (MSE) between rendered and ground-truth images provides the loss signal to update all voxel parameters via stochastic gradient descent.
  • No Neural Network: The differentiability is inherent to the rendering math, not a neural network, simplifying the pipeline.
03

Optimization via Gradient Descent

The Plenoxel grid is trained solely through gradient-based optimization (typically using the Adam optimizer) on a set of posed 2D images. There is no traditional "training" of neural network weights; instead, the numerical values in the voxel grid itself are the parameters being optimized.

  • Fast Convergence: The explicit representation often converges in minutes, compared to hours for early NeRFs.
  • Total Variation (TV) Regularization: A regularization loss is applied to encourage spatial smoothness in the voxel grid, reducing noise and artifacts.
  • Progressive Grid Refinement: Training often starts on a coarse grid (e.g., 128³) and is upsampled to finer resolutions (e.g., 512³) for detail.
04

View-Dependent Appearance via Spherical Harmonics

To model complex materials and lighting, each voxel stores coefficients for low-degree spherical harmonics (SH). Spherical harmonics are a set of basis functions defined on a sphere. When a view direction is provided, the SH basis functions are evaluated and combined using the stored coefficients to produce a view-dependent RGB color for that voxel.

  • Compact Representation: A few SH coefficients (e.g., 2nd or 3rd order) can accurately represent non-Lambertian effects like specular highlights.
  • Directional Query: The final color c at a point is a function: c = SH(direction, coefficients).
05

Computational Efficiency & Speed

The primary advantage of Plenoxels is computational efficiency. By replacing a large MLP with a sparse grid and trilinear interpolation, both optimization and rendering are accelerated.

  • Fast Training: Initial optimization can complete in 5-25 minutes on a single GPU.
  • Fast Inference: Rendering a novel view requires a single forward pass of the (fixed) voxel grid through the volumetric renderer, which can be highly optimized.
  • Memory Mapped: The dense grid structure is amenable to efficient GPU memory access patterns and caching.
5-25 min
Typical Training Time
~1 sec
Novel View Render Time
06

Relation to the Plenoptic Function

Plenoxels are a direct, discretized representation of the plenoptic function, a core concept in light field and image-based rendering. The plenoptic function P(x, y, z, θ, φ, λ, t) describes the intensity of light of wavelength λ at every 3D point (x,y,z), in every direction (θ,φ), at every time t.

  • Simplified Model: Plenoxels model a static (t is constant), monochromatic/trichromatic (λ as RGB) slice of this function.
  • 5D Representation: For a static scene, it becomes a 5D function: P(x, y, z, θ, φ).
  • Voxel Storage: The voxel grid stores a local approximation of this 5D function at each grid point via its density and spherical harmonics coefficients.
REAL-TIME NEURAL RENDERING

How Plenoxels Work

Plenoxels are an explicit, voxel-based representation of the plenoptic function, enabling fast 3D scene optimization and novel view synthesis without a deep neural network.

A plenoxel (plenoptic voxel) is an explicit, sparse 3D grid where each voxel stores spherical harmonics coefficients to model view-dependent color and a density value. During differentiable volume rendering, rays are marched through this grid. The density determines transparency, while the spherical harmonics, queried with the viewing direction, produce the final pixel color. This explicit structure replaces the large multilayer perceptron (MLP) of a traditional Neural Radiance Field (NeRF), making optimization and rendering significantly faster.

Optimization uses stochastic gradient descent directly on the voxel grid parameters. The model is trained from posed 2D images by minimizing a photometric loss between rendered and ground truth views. Key innovations include progressive resolution training and pruning of empty space. This results in a compact, efficient representation that achieves quality comparable to early NeRFs but with training times reduced from hours to minutes, making it a foundational explicit-neural hybrid approach for real-time applications.

SCENE REPRESENTATION COMPARISON

Plenoxels vs. Neural Radiance Fields (NeRF)

A technical comparison of two leading methods for novel view synthesis and 3D scene reconstruction, highlighting core architectural differences, performance characteristics, and ideal use cases.

Feature / MetricPlenoxelsNeural Radiance Fields (NeRF)

Core Representation

Explicit, sparse voxel grid with spherical harmonics

Implicit, coordinate-based multilayer perceptron (MLP)

Primary Optimization Method

Differentiable volumetric rendering with closed-form gradients

Differentiable volume rendering via backpropagation through the MLP

Training Speed (Typical)

< 15 minutes

Hours to days

Inference / Rendering Speed

Real-time (60+ FPS) after optimization

Slow (seconds to minutes per frame)

Memory Footprint (Trained Model)

High (explicit grid storage)

Low (neural network weights)

Scene Editing & Manipulation

Direct (voxel-level access)

Indirect (requires network retraining or conditioning)

Handles Unbounded Scenes

View-Dependent Effects

Modeled via low-order spherical harmonics

Modeled inherently by the MLP's view direction input

Primary Use Case

Real-time applications (AR/VR, interactive viewing)

Offline, high-quality synthesis (film VFX, research)

Compression Potential

Moderate (sparsity, quantization)

High (network pruning, quantization, distillation)

PLENOXELS

Frequently Asked Questions

Plenoxels are a foundational technique in real-time neural rendering, offering a fast, explicit alternative to neural network-based scene representations. These FAQs address core technical concepts, comparisons, and practical applications.

A Plenoxel (a portmanteau of plenoptic and voxel) is an explicit, voxel-based scene representation that directly models the plenoptic function—the complete set of light rays seen from any point in space—for the task of view synthesis. Unlike a Neural Radiance Field (NeRF), which uses a large multilayer perceptron (MLP) to encode a scene implicitly, a Plenoxel grid stores spherical harmonics (SH) coefficients and a density value at each voxel vertex. During rendering, a ray is cast into the scene, and the color and density are trilinearly interpolated from the eight nearest voxel vertices. The final pixel color is computed via volumetric rendering, integrating these interpolated values along the ray. The key innovation is that the spherical harmonics coefficients model view-dependent appearance (e.g., specular highlights) without needing a neural network to process the viewing direction, enabling extremely fast optimization via stochastic gradient descent on the explicit voxel grid parameters.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.