video thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Patch Complexity, Finite Pixel Correlations and Optimal Denoising

Published on Feb 4, 20254067 Views

Image restoration tasks are ill-posed problems, typically solved with priors. Since the optimal prior is the exact unknown density of natural images, actual priors are only approximate and typically r

Related categories

Presentation

Patch Complexity, Finite Pixel Correlations and Optimal Denoising00:00
Image denoising01:12:17
Denoising Uncertainty (1)16:45:33
Denoising Uncertainty (2)19:38:19
Denoising limits- prior work30:02:18
MMSE denoising bounds38:40:43
MMSE with a finite support55:23:23
Estimating denoising bounds in practice71:06:55
MMSE as a function of patch size (1)82:42:53
MMSE as a function of patch size (2)95:29:20
Patch Complexity (1)104:33:25
Patch Complexity (2)111:25:18
Patch Complexity (3)112:06:57
Patch Complexity (5)117:27:17
Patch complexity v.s. PSNR gain120:08:58
Towards denoising bounds135:23:27
The Dead Leaves model [Matheron ’68]142:28:57
Optimal denoising in the Dead Leaves model150:43:46
Empirical PSNR v.s. window size162:27:41
Extrapolating optimal PSNR178:34:04
Summary: inherent uncertainty of denoising187:49:34