paper-with-me

Papers

Learning Gradually Non-convex Image Priors Using Score Matching

2023-02-21 · Erich Kobler, Thomas Pock

In this paper, we propose a unified framework of denoising score-based models in the context of graduated non-convex energy minimization. We show that for sufficiently large noise variance, the associated negative log density -- the energy -- becomes convex. Consequently, denoising score-based models essentially follow a graduated non-convexity heuristic. We apply this framework to learning generalized Fields of Experts image priors that approximate the joint density of noisy images and their associated variances. These priors can be easily incorporated into existing optimization algorithms for solving inverse problems and naturally implement a fast and robust graduated non-convexity mechanism.

📄 PDF Abstract BibTeX arXiv:2302.10502

Code (0)

등록된 구현이 없습니다.

Tasks

Denoising

Similar Papers 제목 키워드 기반

Feature Sensitive Label Fusion with Random Walker for Atlas-based Image Segmentation

2016-10-24 · Siqi Bao, Albert C. S. Chung

In this paper, a novel label fusion method is proposed for brain magnetic resonance image segmentation. This label fusion method is formulated on a graph, which embraces both label priors from atlases and anatomical prio…

Image SegmentationSemantic Segmentation

Mirror Flow Matching with Heavy-Tailed Priors for Generative Modeling on Convex Domains

2025-10-10 · Yunrui Guan, Krishnakumar Balasubramanian, Shiqian Ma arxiv

We study generative modeling on convex domains using flow matching and mirror maps, and identify two fundamental challenges. First, standard log-barrier mirror maps induce heavy-tailed dual distributions, leading to ill-…

GraphMatch: Efficient Large-Scale Graph Construction for Structure from Motion

2017-10-04 · Qiaodong Cui, Victor Fragoso, Chris Sweeney, Pradeep Sen

We present GraphMatch, an approximate yet efficient method for building the matching graph for large-scale structure-from-motion (SfM) pipelines. Unlike modern SfM pipelines that use vocabulary (Voc.) trees to quickly bu…

graph construction

Roommates with Convex Preferences

2025-03-31 · Sophie Bade

Roommate problems with convex preferences always have stable matchings. Efficiency and individual rationality are, moreover, compatible with strategyproofness in such convex roommate problems. Both of these results fail …

Bridging data-driven priors via the score function for posterior sampling -- Comparative review and experimental study

2026-06-11 · Elhadji Cisse Faye, Mame Diarra Fall, Sylvain Delchini, Nicolas Dobigeon arxiv

This paper reviews how a diverse set of popular data-driven priors commonly used in Bayesian inverse problems can be unified through their respective score functions. By framing these priors under this common perspective…

Image Super-ResolutionImage Inpainting