GLUT: 3D Gaussian Lookup Table for Continuous Color Transformation

• URL: http://arxiv.org/abs/2605.19889v1
• Date: Tue, 19 May 2026 14:17:44 GMT
• Title: GLUT: 3D Gaussian Lookup Table for Continuous Color Transformation
• Abstract summary: Gaussian LUT (GLUT) is a continuous and explicit color representation that models color transformations using a set of learnable 3D Gaussian primitives.<n>Building on this representation, we introduce a compact conditional generator (CGLUT) that predicts GLUT parameters for multiple LUT instances, encoding diverse color styles in a single framework to enable smooth and controllable LUT style blending.<n> Experimental results demonstrate that our approach outperforms prior neural LUT representations in both accuracy and efficiency, while offering improved interpretability and interactive control.
• Score: 17.14390334312844
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 3D Lookup Tables (3D LUTs) are widely used for color mapping, but their grid-based representation requires discretizing the RGB space, leading to a capacity-memory trade-off that becomes prohibitive when storing large numbers of LUTs. Recent approaches adopt implicit neural representations to improve scalability, yet their black-box nature limits interpretability and hinders intuitive, localized editing. In this paper, we propose Gaussian LUT (GLUT), a continuous and explicit color representation that models color transformations using a set of learnable 3D Gaussian primitives. By avoiding fixed-resolution grids, GLUT achieves flexible representational capacity while maintaining a compact memory footprint. Its explicit, spatially localized formulation further enables both accurate modeling and interpretability. Building on this representation, we introduce a compact conditional generator (CGLUT) that predicts GLUT parameters for multiple LUT instances, encoding diverse color styles in a single framework to enable smooth and controllable LUT style blending. Moreover, GLUT supports efficient, user-friendly editing by allowing localized adjustments to specific color regions without global retraining. Experimental results demonstrate that our approach outperforms prior neural LUT representations in both accuracy and efficiency, while offering improved interpretability and interactive control.

Related papers

• Multimodal 3D LUT Generation via StatLUT with Statistical Features for Photorealistic Style Transfer [6.827125120104924]
  Photorealistic Style Transfer (PST) aims to transfer the color and tonal style of a reference to a content image.<n>Existing deep learning-based methods inherently suffer from semantic entanglement caused by pre-trained image encoders.<n>We propose StatLUT, an innovative multimodal framework for 3D LUT generation.
  arXiv  Detail & Related papers  (2026-07-09T08:23:04Z)
• Instant Colorization of Gaussian Splats [42.04362188042913]
  This work focuses on mapping 2D image information efficiently back onto an existing scene of Gaussian splats.<n>This 'opposite' direction enables applications ranging from scene relighting and stylization to 3D semantic segmentation.<n>We demonstrate our approach on scene relighting, feature enrichment and 3D segmentation, achieving up to an order of magnitude speedup compared to descent-based baselines.
  arXiv  Detail & Related papers  (2026-04-18T21:56:52Z)
• Joint Semantic and Rendering Enhancements in 3D Gaussian Modeling with Anisotropic Local Encoding [86.55824709875598]
  We propose a joint enhancement framework for 3D semantic Gaussian modeling that synergizes both semantic and rendering branches.<n>Unlike conventional point cloud shape encoding, we introduce an anisotropic 3D Gaussian Chebyshev descriptor to capture fine-grained 3D shape details.<n>We employ a cross-scene knowledge transfer module to continuously update learned shape patterns, enabling faster convergence and robust representations.
  arXiv  Detail & Related papers  (2026-01-05T18:33:50Z)
• FlowLUT: Efficient Image Enhancement via Differentiable LUTs and Iterative Flow Matching [10.213645938731338]
  FlowLUT is a novel end-to-end model that integrates the efficiency of LUTs, multiple priors, and the parameter-independent characteristic of flow-matched reconstructed images.<n>A lightweight fusion prediction network runs on multiple 3D LUTs, with $mathcalO(1)$ complexity for scene-adaptive color correction.<n>The entire model is jointly optimized under a composite loss function enforcing perceptual and structural fidelity.
  arXiv  Detail & Related papers  (2025-09-28T03:22:01Z)
• BG-Triangle: Bézier Gaussian Triangle for 3D Vectorization and Rendering [60.240908644910874]
  Differentiable rendering enables efficient optimization by allowing gradients to be computed through the rendering process.<n>Existing solutions approximate or re-formulate traditional rendering operations using smooth, probabilistic proxies.<n>We present a novel hybrid representation that combines B'ezier triangle-based vector graphics primitives with Gaussian-based probabilistic models.
  arXiv  Detail & Related papers  (2025-03-18T06:53:52Z)
• Discovering an Image-Adaptive Coordinate System for Photography Processing [51.164345878060956]
  We propose a novel algorithm, IAC, to learn an image-adaptive coordinate system in the RGB color space before performing curve operations.<n>This end-to-end trainable approach enables us to efficiently adjust images with a jointly learned image-adaptive coordinate system and curves.
  arXiv  Detail & Related papers  (2025-01-11T06:20:07Z)
• SuperGaussians: Enhancing Gaussian Splatting Using Primitives with Spatially Varying Colors [51.54964131894217]
  We introduce a new method called SuperGaussians that utilizes spatially varying colors and opacity in a single Gaussian primitive to improve its representation ability.<n>We have implemented bilinear, movable kernels, and even tiny neural networks as spatially varying functions.
  arXiv  Detail & Related papers  (2024-11-28T07:36:22Z)
• SplatMesh: Interactive 3D Segmentation and Editing Using Mesh-Based Gaussian Splatting [86.50200613220674]
  A key challenge in 3D-based interactive editing is the absence of an efficient representation that balances diverse modifications with high-quality view synthesis under a given memory constraint.<n>We introduce SplatMesh, a novel fine-grained interactive 3D segmentation and editing algorithm that integrates 3D Gaussian Splatting with a precomputed mesh.<n>By segmenting and editing the simplified mesh, we can effectively edit the Gaussian splats as well, which will lead to extensive experiments on real and synthetic datasets.
  arXiv  Detail & Related papers  (2023-12-26T02:50:42Z)
• Learning Naturally Aggregated Appearance for Efficient 3D Editing [90.57414218888536]
  We learn the color field as an explicit 2D appearance aggregation, also called canonical image.<n>We complement the canonical image with a projection field that maps 3D points onto 2D pixels for texture query.<n>Our approach demonstrates remarkable efficiency by being at least 20 times faster per edit compared to existing NeRF-based editing methods.
  arXiv  Detail & Related papers  (2023-12-11T18:59:31Z)
• SepLUT: Separable Image-adaptive Lookup Tables for Real-time Image Enhancement [21.963622337032344]
  We present SepLUT (separable image-adaptive lookup table) to tackle the above limitations. Specifically, we separate a single color transform into a cascade of component-independent and component-correlated sub-transforms instantiated as 1D and 3D LUTs. In this way, the capabilities of two sub-transforms can facilitate each other, where the 3D LUT complements the ability to mix up color components.
  arXiv  Detail & Related papers  (2022-07-18T02:27:19Z)
• AdaInt: Learning Adaptive Intervals for 3D Lookup Tables on Real-time Image Enhancement [28.977992864519948]
  We present AdaInt, a novel mechanism to achieve a more flexible sampling point allocation by adaptively learning the non-uniform sampling intervals in the 3D color space. AdaInt could be implemented as a compact and efficient plug-and-play module for a 3D LUT-based method.
  arXiv  Detail & Related papers  (2022-04-29T10:16:57Z)
• Learning Smooth Neural Functions via Lipschitz Regularization [92.42667575719048]
  We introduce a novel regularization designed to encourage smooth latent spaces in neural fields. Compared with prior Lipschitz regularized networks, ours is computationally fast and can be implemented in four lines of code.
  arXiv  Detail & Related papers  (2022-02-16T21:24:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.