arXiv Computer Vision

Dual Flow: Joint Image-Measurement Flow for Inverse Problems

arXiv Machine Learning
Oct 8

Twist Flow for Inverse Problems

arXiv:2610. 09281v1 Announce Type: new Abstract: In Bayesian inverse problems, posterior sampling requires generating samples that are consistent with given observations while capturing the range of plausible solutions.

By Shiqin Zeng, Zijun Deng, Felix J. Herrmann
arXiv Computer Vision
4d ago

Retrieval-Augmented Initialization with Dual-Guided Inversion for Flow-Based Inverse Problem Solvers

The paper introduces Retrieval-Augmented Initialization with Dual-Guided Inversion (RA‑DGI), a method that improves the initial noise used by flow‑based inverse problem solvers by leveraging retrieved proxy clean images and dual‑guided inversion. Experiments across multiple inverse problems show that this improved initialization significantly enhances reconstruction fidelity and perceptual performance compared to standard random noise and inference‑time scaling strategies, while adding less computational overhead.

By Hansam Cho, Seoung Bum Kim
arXiv AI
Oct 5

Consecutive Posterior Fusion for Diffusive Recovery of Unobservable Image Structures

The paper introduces Consecutive Posterior Fusion Denoising Diffusion Null‑Space Models (CPF‑DDNM), an inference‑time method that fuses successive measurement‑aware estimates to better recover unobservable image structures in severely ill‑posed imaging inverse problems. CPF‑DDNM builds on DDNM’s range/null‑space decomposition, preserving measurement‑determined components while refining prior‑driven null‑space estimates. Experiments on sparse‑view CT, low‑dose CT, and medical image super‑resolution demonstrate consistent improvements over DDNM and competitive performance against other diffusion‑based inverse solvers.

By Elena Morotti, Davide Evangelista, Elena Loli Piccolomini
arXiv Machine Learning
Oct 3

Trajectory Stitching for Solving Inverse Problems with Flow-Based Models

The paper introduces MS-Flow, a method that represents a flow-based generative model’s trajectory as a sequence of intermediate latent states instead of a single initial code. By enforcing local flow dynamics and coupling trajectory segments with matching penalties, the approach alternates between updating latent states and ensuring consistency with observed data. This strategy reduces memory usage and improves reconstruction quality on tasks such as image inpainting, super‑resolution, and computed tomography.

By Alexander Denker, Zeljko Kereta, Carola-Bibiane Sch\"onlieb, Moshe Eliasof