arXiv Computer Vision

A Mixture Autoregressive Image Generative Model on Quadtree Regions for Gaussian Noise Removal via Variational Bayes and Gradient Methods

arXiv Computer Vision
Sep 1

Mapping-Based Image Diffusion

The paper introduces a tensor‑based functional for targeted image enhancement and denoising, incorporating application‑dependent and contextual information through explicit regularization. It establishes existence of a minimizer and discusses tensor symmetry constraints, convexity, and geometric interpretation. The framework demonstrates strong performance in nonlinear scenarios like gamma correction and targeted value‑range filtering, achieving results comparable to state‑of‑the‑art PDE‑based methods.

By Freddie {\AA}str\"om, Michael Felsberg, George Baravdish
arXiv Machine Learning
Aug 31

Diffusion models as plug-and-play priors

The paper explores using denoising diffusion generative models as plug‑and‑play priors for high‑dimensional inference problems. By combining a pre‑trained diffusion prior with a differentiable auxiliary constraint, the authors enable approximate inference through iterative differentiation across multiple noisy versions of the data. This framework opens possibilities for conditional generation, image segmentation, and novel combinatorial optimization algorithms.

By Alexandros Graikos, Esmeralda S. Whitammer, Nebojsa Jojic, Dimitris Samaras
arXiv AI
Aug 18

Equilibrium Forcing: Adaptive Video Generation Without Noise Conditioning

arXiv:2608. 14706v1 Announce Type: cross Abstract: Standard autoregressive video generation algorithms based on Diffusion and Flow Matching rely on rigid training objectives and static sampling schedules, limiting inference procedures from adapting to the data.

By Hansen Jin Lillemark, Alex Rojas, Zachary Novack, Runqian Wang, Yilun Du, Yian Ma, Taylor Berg-Kirkpatrick, Rose Yu
arXiv Machine Learning
Sep 11

Sublinear Variational Optimization of Gaussian Mixture Models with Millions to Billions of Parameters

The paper introduces a highly efficient variational approximation for Gaussian Mixture Models (GMMs) with arbitrary covariances, integrated with mixtures of factor analyzers. This method reduces the per‑iteration runtime from ≠O(NCD^2) to a complexity that scales linearly with dimensionality D and sublinearly with the product NC. Experiments demonstrate sublinear scaling across the entire optimization, order‑of‑magnitude speed‑ups on large benchmarks, training of GMMs with over 10 billion parameters in under nine hours on a single CPU, and competitive zero‑shot image denoising performance.

By Sebastian Salwig, Till Kahlke, Florian Hirschberger, Dennis Forster, J\"org L\"ucke