eess.IVJul 4, 2026

GALOSH: Blind, Training-Free Denoising of Raw Bayer and sRGB Images by Parallel-Friendly Local Shrinkage

Authors: Yoshiro Sato

Abstract

Classical training-free denoisers such as BM3D and non-local means owe much of their strength to search: content-dependent block matching whose memory traffic and data-dependent control flow parallelize poorly and preclude fixed-latency implementations. Learned denoisers reach the highest quality, but they need training data, degrade outside their training domain (which we also observe), and carry per-pixel compute budgets that effectively require a GPU. We present GALOSH (Generalized Anscombe LOcal SHrinkage), a redesign of training-free denoising that removes the search entirely and aims at multi-domain coverage, speed, and quality at once: a blind per-image Poisson-Gaussian noise fit, a generalized Anscombe transform, a two-pass local Walsh-Hadamard shrinkage of luminance, and a luminance-guided local regression of chrominance -- two deliberately different operators for the two perceptually different noise components, each with its own strength control. Every stage is local, data-independent, and regular -- the same computation graph for every pixel of every image. One core serves two domains: raw Bayer mosaics and sRGB/YUV images. On four real-noise benchmarks (SIDD Medium and RawNIND, raw and sRGB) GALOSH is consistently the strongest among the tested blind, training-free methods -- surpassing BM3D- and NLM-family baselines even when those are given an oracle noise level -- and approaches trained networks on raw data while remaining below in-domain trained networks at high ISO in sRGB. Being search-free makes it fast: 7x-650x faster than the DL baselines on the same GPU at full benchmark size, and the only strong method in the comparison that also runs practically on plain CPUs. The fixed, data-independent structure is designed to map naturally onto fixed-point and streaming hardware, supported by an operation-count analysis and a working INT16 fixed-point realization.

Explore similar work

CardsList
Jul 24, 2026eess.IV

Small, Bias-Free, Blind and Convolutional Denoiser: A compact ConvNeXt U-Net for blind Gaussian color-image denoising

We describe and evaluate BF-ConvUNeXt, a compact bias-free ConvNeXt U-Net for blind additive-white-Gaussian-noise color image denoising, combining four existing ingredients so a single property survives end to end: a frozen depthwise Gabor stem (oriented band-pass, zero trainable parameters), a Laplacian-pyramid encoder routing the high-frequency residual into each skip connection, a ConvNeXt-V1 U-Net body, and bias-free construction throughout (no additive bias, linear head, LeakyReLU, variance-only batch norm). Together these make the 0.82M-parameter network exactly degree-1 homogeneous at inference, D(alpha y) = alpha D(y), licensing a Miyasawa/Tweedie score reading of the residual and blind generalization across noise levels from one model. We train a single blind model on a noise-sigma curriculum (sigma approximately 6.4 to 64, 0-255 scale); it extrapolates past that ceiling without a cliff, degrading smoothly to 22.8 dB at sigma=150 and 20.0 dB at sigma=200. Evaluated unchanged on four standard color sets (CBSD68, Kodak24, McMaster, Urban100) at sigma in {15,25,50}, it matches or beats DnCNN and FFDNet on every set and level, averaging about +0.7 dB over DnCNN. Against heavyweight CNN/transformer state of the art it trails by a small margin (roughly 0.3-1.7 dB depending on set) at 1/15 to 1/39 of their parameters. The homogeneity is inference-only and checkpoint-specific, and the learned residual is a local, not global, score (non-conservative Jacobian), so plug-and-play/RED guarantees do not transfer; it still drives stochastic sampling and linear inverse problems (inpainting, super-resolution, deblurring, compressive sensing).
Nikolas Markou
Image DenoisingU-NetConvolutional3D Gaussian Splatting
AskPDF
Apr 19, 2026eess.IV

Learned Nonlocal Feature Matching and Filtering for RAW Image Denoising

Being one of the oldest and most basic problems in image processing, image denoising has seen a resurgence spurred by rapid advances in deep learning. Yet, most modern denoising architectures make limited use of the technical knowledge acquired researching the classical denoisers that came before the mainstream use of neural networks, instead relying on depth and large parameter counts. This poses a challenge not only for understanding the properties of such networks, but also for deploying them on real devices which may present resource constraints and diverse noise profiles. Tackling both issues, we propose an architecture dedicated to RAW-to-RAW denoising that incorporates the interpretable structure of classical self-similarity-based denoisers into a fully learnable neural network. Our design centers on a novel nonlocal block that parallels the established pipeline of neighbor matching, collaborative filtering and aggregation popularized by nonlocal patch-based methods, operating on learned multiscale feature representations. This built-in nonlocality efficiently expands the receptive field, sufficing a single block per scale with a moderate number of neighbors to obtain high-quality results. Training the network on a curated dataset with clean real RAW data and modeled synthetic noise while conditioning it on a noise level map yields a sensor-agnostic denoiser that generalizes effectively to unseen devices. Both quantitative and visual results on benchmarks and in-the-wild photographs position our method as a practical and interpretable solution for real-world RAW denoising, achieving results competitive with state-of-the-art convolutional and transformer-based denoisers while using significantly fewer parameters. The code is available at https://github.com/MIA-UIB/nonlocal-matchfilter .
Marco Sánchez-Beeckman, Antoni Buades
Image DenoisingImage ProcessingFeature MatchingDeep Learning
AskPDF
Jul 25, 2026eess.IV

Trainable Nonexpansive Denoisers for Contractive Image Reconstruction

Trainable denoisers with Lipschitz control have become central to convergent image reconstruction. However, training neural networks that simultaneously offer strong denoising performance and global Lipschitz guarantees is challenging. Existing approaches enforce Lipschitz control only empirically, providing no guarantees beyond the training data. In this work, we show that by exploiting the action of permutations on the image lattice, we can constrain a neural architecture that is globally nonexpansive (Lipschitz bound ⩽1\leqslant 1). We integrate the proposed denoiser with forward imaging operators to develop a reconstruction mechanism that is provably contractive and therefore globally convergent. Experiments on standard inverse problems, such as superresolution and deblurring, demonstrate that our reconstruction performance is competitive with softly constrained baselines while providing Lipschitz guarantees.
Arghya Sinha, Aditya Banerjee, Trishit Mukherjee +1
Image DenoisingImage ReconstructionLipschitz ConstantSuper-Resolution FrameworkDeep Unfolding NetworksNeural Architectures
AskPDF