Papers for

computational photography developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Kinetic langevin speeds up posterior sampling for image reconstruction

Kinetic Langevin Meets Split Gibbs: Accelerated Posterior Sampling for Imaging Inverse Problems with Diffusion Priors

Abstract: Split Gibbs sampling (SGS) is a popular framework for posterior sampling in Bayesian imaging inverse problems. It decouples a Gaussian data-fidelity term from a complex prior through an auxiliary variable, so the data variable is updated exactly and only the prior-side conditional is hard to sample. Existing samplers treat this conditional in one of two ways. Plug-and-play SGS runs a multi-step diffusion denoiser at every iteration, which is expensive and lacks non-asymptotic guarantees. Langevin-within-SGS takes cheap overdamped Langevin steps but needs many iterations. We propose RED-KLwSGS, which keeps the exact Gaussian update for the data variable and updates the auxiliary variable with underdamped (kinetic) Langevin diffusions driven by a one-shot denoising score, at the same per-iteration cost as Langevin-within-SGS. We prove non-asymptotic Wasserstein-2 convergence in continuous and discrete time for strongly log-concave priors. We also introduce Joint-RED-KLwSGS, which applies kinetic Langevin diffusions to both variables. Experiments with Denoising diffusion probabilistic models as diffusion priors on FFHQ and ImageNet datasets show faster convergence and high-quality image reconstruction.

Wed 7 OctMachine Learning
The gist
Imaging inverse problems involve reconstructing images from incomplete or noisy data, which can be challenging due to complex underlying patterns. The authors focus on improving sampling methods that combine data information with learned image models to produce better reconstructions. They introduce a new approach that uses kinetic Langevin dynamics, a way of exploring image possibilities more efficiently, alongside a splitting technique that simplifies computations. Their method converges faster and produces high-quality images in tests on popular datasets.
Open → 2610.10187v1

Score based method estimates imaging limits in high dimensional spaces

Latent Score-Based Bayesian Cramér-Rao Bound Estimation for High-Dimensional Imaging Systems

Abstract: We propose a data-driven framework for estimating the Bayesian Cramér-Rao bound (CRB) in high-dimensional imaging systems with complex, analytically intractable priors. Direct CRB computation is challenging in this setting due to the need to model the prior score and to form and invert the Bayesian Fisher information matrix in very high dimensions. To address these issues, we first reformulate the inverse problem in the latent space of a pre-trained variational autoencoder, thereby dramatically reducing the dimensionality of the bound estimation problem while preserving the spatial structure of the images. The Bayesian CRB is formed in this latent space and mapped back to the native parameter space using a change-of-variables formula. Second, to learn the latent prior score, we introduce a new sliced score matching objective defined in a Bochner space endowed with an $H^1(Ω)$ Sobolev norm in space. This "Bochner-space sliced score matching" objective is consistent with standard sliced score matching, but penalizes errors in the spatial gradients of the score, suppressing high-frequency artifacts that otherwise contaminate the resulting CRB estimates. We validate the approach on a stylized quantitative photoacoustic computed tomography (qPACT) breast imaging problem with over one million unknown parameters, using a foundation-model autoencoder derived from Stable Diffusion. The proposed method yields stable, artifact-free Bayesian CRB estimates that reflect the highly non-Gaussian structure of the learned prior and reveal the substantial impact of the prior on the relative performance of competing qPACT design schemes.

Fri 2 OctInformation TheoryMachine Learning
The gist
High-quality imaging systems often have many unknowns, making it hard to understand the best possible accuracy for reconstructing images. The authors developed a way to estimate this accuracy limit, called the Bayesian Cramér-Rao bound, by simplifying the problem into a smaller set of components using a neural network called a variational autoencoder. They also improved how to learn complex image properties using a new method that reduces weird artifacts in the results. This approach was tested on a large-scale simulated breast imaging problem, showing it can estimate difficult limits accurately and stably.
Open → 2610.03956v1

Structure-aware adaptation improves light field reconstruction from noisy images

STAR: Structure-aware Test-time Adaptation for diffusion-based light field Reconstruction

Abstract: Light field (LF) reconstruction from limited and noisy focal stack (FS) measurements is a highly ill-posed inverse problem. Although the LF-to-FS imaging geometry is fixed for a given optical setup, LF spatial-angular structure---including within-view spatial details, cross-view angular dependencies, and disparity across views---varies across scenes. Consequently, a fixed pre-trained prior may not optimally capture the spatial-angular structure of each test LF. We propose Structure-aware Test-time Adaptation for diffusion-based light field Reconstruction (STAR), the first test-time adaptation framework for reconstructing an LF from FS. For each test LF, STAR freezes a pre-trained diffusion prior and fits three lightweight adapters to the observed FS to jointly adapt the three components of the LF's spatial-angular structure. STAR outperforms existing state-of-the-art methods in both two- and three-focal-sheet settings, with shorter inference times than those with test-time parameter updates.

Thu 17 SeptComputer Vision and Pattern Recognition
The gist
Rebuilding light field images from a few blurry and noisy pictures is very difficult because the details and angles vary with each scene. The authors propose a method called STAR that adapts a pre-trained model for each new scene by adjusting small parts to better match the scene’s unique structure. This approach improves the reconstruction quality and speeds up processing compared to previous methods. STAR works with different numbers of input images and handles variations in spatial and angular details effectively.
Open → 2609.19747v1