Search arXiv⌕ Search

arXiv · 2610.36646

Image Modeling: From Handcrafted Priors to Foundation Image Models

Abstract

This paper unifies six decades of image modeling, evolving from handcrafted mathematical tractable priors to solve inverse problems in imaging to data-driven deep foundation image models for both image generation and solving inverse problems, under a common Bayesian framework that formulates image modeling as an implicit or explicit probabilistic characterization of a data manifold. Every image restoration or generative task fundamentally seeks to answer the same question: What makes an image look like a real image? In the Bayesian framework, this question is encapsulated by the prior probability density p(x), or its more optimization-friendly counterpart, the log-prior log p(x). While early works in solving inverse problems, such as Tikhonov, Total Variation (TV), and Non-local priors relied on explicit handcrafted definitions of log prior to model local smoothness, modern techniques, such as Plug-and-Play (PnP) priors and Denoising Diffusion models, are rooted in algorithmic uncoupling and implicit manifold learning that apply to both inverse problems and conditional image generation. By grounding imaging inverse problems and conditional image generation under a single mathematical engine: the gradient of the log-prior, or the Stein Score Function, we bridge the gap between signal processing and machine learning communities, turning what seems like parallel developments into a single, evolution of image modeling from handcrafted analytical models to models learned from big data, demonstrating that the pursuit of the denoising score is the common thread connecting variational optimization (in MAP estimation) to posterior sampling (in modern foundation image models).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. Murat Tekalp. 2026-10-27. Image Modeling: From Handcrafted Priors to Foundation Image Models. https://arxiv.org/abs/2610.36646

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

FermatSyn: SAM2-Enhanced Bidirectional Mamba with Isotropic Spiral Scanning for Multi-Modal Medical Image Synthesis

Multi-modal medical image synthesis is pivotal for alleviating clinical data scarcity, yet existing methods fail to reconcile global anatomical consistency with high-fidelity local detail. We propose FermatSyn, which addresses three persistent limitations: (1) SAM2-based Prior Encoder that injects domain-aware anatomical knowledge via LoRA$^{+}$ efficient fine-tuning of a frozen SAM2 Vision Transformer; (2) Hierarchical Residual Downsampling Module (HRDM) coupled with a Cross-scale Integration Network (CIN) that preserves high-frequency lesion details and adaptively fuses global--local representations; and (3) continuity constrained Fermat Spiral Scanning strategy within a Bidirectional Fermat Scan Mamba (BFS-Mamba), constructing an approximately isotropic receptive field that substantially reduces the directional bias of raster or spiral serialization. Experiments on SynthRAD2023, BraTS2019, BraTS-MEN, and BraTS-MET show FermatSyn surpasses state-of-the-art methods in PSNR, SSIM, FID, and 3D structural consistency. Downstream segmentation on synthesized images yields no significant difference from real-image training ($p{>}0.05$), confirming clinical utility. Code is available at https://github.com/exsinger-hub/ FermatSyn.

eess.IV↗

Decoding Motion-Blurred QR Codes: Motion-Parameter Error Tolerance and Model-Based Recovery

Quick Response (QR) code deblurring must ultimately recover the encoded payload, yet how accurately the underlying camera motion must be estimated remains an open question. To address this question, we formulate motion-blurred QR recovery within a unified mathematical framework of identifiability and systematically measure the decoding tolerance to perturbations in motion length, direction, rotation or scaling centre, and speed profile. These controlled experiments reveal three structural laws: 1) parameter tolerances shrink rapidly as blur amplitude grows and are tightest under uniform speed, whereas accelerating motion is substantially more forgiving; 2) length tolerance can differ markedly between underestimation and overestimation; 3) errors that are individually benign interact strongly and prevent decoding when combined. Guided by these findings, we propose a grey-box recovery pipeline in which two compact networks predict an initial corner trajectory, followed by tolerance-guided candidate search, alternating image-and-path fitting, and regularised linear inversion. On a new benchmark of 955 handheld motion-blurred photographs captured across four phone models and four motion categories, our method recovers the exact payload on 93.1% of the images, outperforming the strongest fine-tuned deblurring network at 83.6% and reducing the decoding error rate by 58.0%.

eess.IV↗

Accuracy and efficiency of compact foundation models for surface-water mapping during floods

Pretrained Earth observation models may reduce the effort needed to map surface water, but their value depends on the alternative against which they are compared. We evaluated Prithvi-EO-2.0-Tiny using the 446 hand-labeled Sentinel-2 chips from 11 flood events in Sen1Floods11. A fine-tuned model, a frozen-encoder model, and an identical randomly initialized architecture were compared with a similarly sized U-Net, a larger Prithvi model, and spectral-index thresholds. Experiments varied the number of training chips, excluded events from model fitting, and measured computational cost and prediction reliability. With 252 training chips, U-Net achieved a water intersection-over-union (IoU) of 0.856 on the official test set, compared with 0.833 for fine-tuned Prithvi-Tiny. Pretraining improved the tiny transformer over random initialization by a reported 0.046 IoU with 25 training chips and 0.023 with 252 chips, but did not reverse the U-Net ranking. Across 11 event-exclusion evaluations, mean IoU was 0.768 for fine-tuned Prithvi-Tiny and 0.777 for U-Net; the paired interval included zero. Fine-tuned Prithvi-Tiny processed a 512x512-pixel chip in 16.1 ms on a GPU and 258 ms on a laptop CPU, compared with 30.6 and 665 ms for U-Net. Errors were concentrated near water boundaries, and high predictive entropy identified many, but not all, erroneous pixels. These results support a specific role for compact pretrained models: lower measured computational demand with competitive accuracy, rather than consistent superiority. Event-dependent performance, shared hyperparameter selection, and the distinction between observed water and newly inundated land delimit the conclusions.

eess.IV↗