LPA-ICI Applications in Image Processing

Similar documents
Computer Vision & Digital Image Processing

ITK Filters. Thresholding Edge Detection Gradients Second Order Derivatives Neighborhood Filters Smoothing Filters Distance Map Image Transforms

LINEARIZED BREGMAN ITERATIONS FOR FRAME-BASED IMAGE DEBLURRING

Regularization methods for large-scale, ill-posed, linear, discrete, inverse problems

Inverse Problems in Image Processing

Image Degradation Model (Linear/Additive)

An Overview of Sparsity with Applications to Compression, Restoration, and Inverse Problems

EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)

Deconvolution. Parameter Estimation in Linear Inverse Problems

DECONVOLUTION is a recurring theme in a wide variety

Inverse problem and optimization

Spatially adaptive alpha-rooting in BM3D sharpening

Efficient Variational Inference in Large-Scale Bayesian Compressed Sensing

Satellite image deconvolution using complex wavelet packets

Lecture 7: Edge Detection

INVERSE PROBLEMS IN IMAGE PROCESSING

Histogram Processing

SPATIALLY ADAPTIVE NON-GAUSSIAN IMAGING VIA FITTED LOCAL LIKELIHOOD TECHNIQUE

Anisotropic Local Likelihood Approximations: Theory, Algorithms, Applications

Accelerated Dual Gradient-Based Methods for Total Variation Image Denoising/Deblurring Problems (and other Inverse Problems)

MATHEMATICAL MODEL OF IMAGE DEGRADATION. = s

Image Noise: Detection, Measurement and Removal Techniques. Zhifei Zhang

Noise-Blind Image Deblurring Supplementary Material

IMAGE ENHANCEMENT II (CONVOLUTION)

Design of Image Adaptive Wavelets for Denoising Applications

SIGNAL-DEPENDENT NOISE REMOVAL IN POINTWISE SHAPE-ADAPTIVE DCT DOMAIN WITH LOCALLY ADAPTIVE VARIANCE

Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization

Image Restoration with Mixed or Unknown Noises

Inverse problems in statistics

Computational Photography

Statistically-Based Regularization Parameter Estimation for Large Scale Problems

Image Enhancement: Methods. Digital Image Processing. No Explicit definition. Spatial Domain: Frequency Domain:

Image processing and nonparametric regression

An example of Bayesian reasoning Consider the one-dimensional deconvolution problem with various degrees of prior information.

Image Processing in Astrophysics

Optimisation in imaging

Reading. 3. Image processing. Pixel movement. Image processing Y R I G Q

Introduction to Multigrid Methods

Singular Value Decomposition in Image Noise Filtering and Reconstruction

Wavelet Based Image Restoration Using Cross-Band Operators

Image Degradation Model (Linear/Additive)

Blind Deconvolution of Ultrasonic Signals Using High-Order Spectral Analysis and Wavelets

Image Deblurring in the Presence of Impulsive Noise

Sélection adaptative des paramètres pour le débruitage des images

Multichannel Deconvolution of Layered Media Using MCMC methods

Lecture 04 Image Filtering

Super-Resolution. Shai Avidan Tel-Aviv University

Inverse problems in statistics

The Frequency Domain. Many slides borrowed from Steve Seitz

Multiresolution schemes

! # %& () +,,. + / 0 & ( , 3, %0203) , 3, &45 & ( /, 0203 & ( 4 ( 9

Linear Diffusion and Image Processing. Outline

Regularization Parameter Estimation for Least Squares: A Newton method using the χ 2 -distribution

Multiresolution schemes

Interpolating Scaling Vectors: Application to Signal and Image Denoising

Laboratorio di Problemi Inversi Esercitazione 2: filtraggio spettrale

Blind Deconvolution Using Convex Programming. Jiaming Cao

Halftone Image Watermarking by Content Aware Double-sided Embedding Error Diffusion

On the acceleration of the double smoothing technique for unconstrained convex optimization problems

Linear Diffusion. E9 242 STIP- R. Venkatesh Babu IISc

Anisotropic Total Variation Regularized L 1 -Approximation and Denoising/Deblurring of 2D Bar Codes

10. Multi-objective least squares

Understanding and evaluating blind deconvolution algorithms

Super-Resolution. Dr. Yossi Rubner. Many slides from Miki Elad - Technion

PDEs in Image Processing, Tutorials

An Introduction to Sparse Representations and Compressive Sensing. Part I

A Comparison of Multi-Frame Blind Deconvolution and Speckle Imaging Energy Spectrum Signal-to-Noise Ratios-- Journal Article (Preprint)

Computer Vision Lecture 3

TWO-PHASE APPROACH FOR DEBLURRING IMAGES CORRUPTED BY IMPULSE PLUS GAUSSIAN NOISE. Jian-Feng Cai. Raymond H. Chan. Mila Nikolova

An iterative multigrid regularization method for Toeplitz discrete ill-posed problems

Which wavelet bases are the best for image denoising?

IMAGE RESTORATION: TOTAL VARIATION, WAVELET FRAMES, AND BEYOND

Local Enhancement. Local enhancement

Roadmap. Introduction to image analysis (computer vision) Theory of edge detection. Applications

Backpropagation Rules for Sparse Coding (Task-Driven Dictionary Learning)

Taking derivative by convolution

Image Deconvolution. Xiang Hao. Scientific Computing and Imaging Institute, University of Utah, UT,

Lecture Notes 5: Multiresolution Analysis

Laplacian Filters. Sobel Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters. Laplacian Filters

Non-Local Adaptive Structure Tensors. Application to Anisotropic Diffusion and Shock Filtering

MCMC Sampling for Bayesian Inference using L1-type Priors

Announcements. Filtering. Image Filtering. Linear Filters. Example: Smoothing by Averaging. Homework 2 is due Apr 26, 11:59 PM Reading:

Towards Improved Sensitivity in Feature Extraction from Signals: one and two dimensional

Signal Denoising with Wavelets

Markov Random Fields

SENSITIVITY TO POINT-SPREAD FUNCTION PARAMETERS IN MEDICAL ULTRASOUND IMAGE DECONVOLUTION

Pointwise Shape-Adaptive DCT Image Filtering and Signal-Dependent Noise Estimation

8 The SVD Applied to Signal and Image Deblurring

A Method for Blur and Similarity Transform Invariant Object Recognition

Fraunhofer Institute for Computer Graphics Research Interactive Graphics Systems Group, TU Darmstadt Fraunhoferstrasse 5, Darmstadt, Germany

Mathematical Beer Goggles or The Mathematics of Image Processing

Overview. Optimization-Based Data Analysis. Carlos Fernandez-Granda

Gaussian derivatives

10. Linear Models and Maximum Likelihood Estimation

Efficient Inference in Fully Connected CRFs with Gaussian Edge Potentials

Functionals for signal and image reconstruction: properties of their minimizers and applications

Blind Image Deconvolution Using The Sylvester Matrix

UPRE Method for Total Variation Parameter Selection

Wavelet Footprints: Theory, Algorithms, and Applications

Introduction to Sparsity in Signal Processing

Transcription:

LPA-ICI Applications in Image Processing Denoising Deblurring Derivative estimation Edge detection Inverse halftoning

Denoising Consider z (x) =y (x)+η (x), wherey is noise-free image and η is noise. assume i.i.d. noise η ( ) N ³ 0,σ 2 Denoising problem: obtain an estimate of y given z. Why use LPA-ICI for image denoising? adapts to unknown smoothness of the signal allows anisotropic (directional) estimation neighborhoods

The discrete LPA estimation kernels g h are pre-definedforasetofscales h H the shapes of g h are typically simple (e.g., square, disc, line) preserve mean value: P g h (x) =1(For derivative estimation, what should P gh (x) be equal to?) example of simple isotropic averaging kernels for h = {1, 2, 3}, g 2 = h 1 i g 2 = 1 9 1 1 1 1 1 1 1 1 1 g 3 = 1 25 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 TheLPAestimateforeachg h is given by convolution ŷ h (x) =(z ~ g h )(x)

Adaptability: select adaptive scale h + (x) for each pixel x X using the ICI rule ICI rule: Given H = {h 1 < <h J }, choose the greatest j s.t. I j = D i i=1 is non-empty where D i = ŷ hi (x) Γσŷhi (x), ŷ h (x)+γσŷhi i (x). Result adaptive scales h + (x) =h j j T

ICI yields the pointwise adaptive estimate ŷ h + h + (x) is a close approximation of the optimal h (x)

Enable anisotropic (directional) estimation Use directional kernels g h,θ for a set of directions Θ e.g. Θ = {0, π 2,π,3 2π} yields 4-directional kernels g h,θ are no l onger s ymmetric with resp ect to the estimated pixel LP A estimates are given by ŷ h,θ (x) = ³ z ~ g h,θ (x) Apply ICI independently to obtain h + (x, θ) for each θ Θ, x X.

Example of directional kernels for 3 directions. Their Fourier spectra magnitudes are shown below.

How to fuse the directional adaptive-scale estimates ŷ h +,θ (x)? Useweighted averaging ŷ (x) = X λ (x, θ)ŷ h +,θ (x) λ (x, θ) = θ Θ σ 2 ŷ h +,θ (x) P σ 2 θ 0 ŷ Θ h +,θ 0(x) where for readability h + (x, θ) is denoted as h +. Properties of the weights: inversely proportional to the variance noisier estimates have smaller weights for uniform kernels, the fused estimate is the average over the anisotropic neighborhood assuming that ŷ h +,θ are independent and unbiased, the fusing is the ML estimate of y (x) given n o ŷ h +,θ θ Θ,

Example of adaptive scales in the case of 8 directions Θ = {0, π 4, π 2, 3π 4,π,5 4 π, 3 2 π, 7 4π}, H= {1, 2, 3, 5, 6, 8} g h,θ are uniform lines (with length h H and direction θ Θ)

Corresponding ŷ h +,θ (x) in the case of 8 directions (adaptive scales h+ (x, θ) used)and the fused estimate in the center

Denoising results

Original Cameraman Noisy observation (σ =0.1)

Anisotropic (8-directional) LPA-ICI ISNR 8.2 db Wavelet shrinkage ISNR 7.8 db

Non-blind deblurring Consider the observation model z (x) =(y ~ v)(x)+η (x) v is a priori known Point-Spread Function (PSF), η is additive i.i.d. Gaussian noise with variance σ 2 The model can be represented in discrete Fourier domain as Z = YV + η, where capital letters denote the DFT of the corresponding signals and η is i.i.d. Gaussian with variance σ 2 (just as η)

The inverse problem is badly conditioned the naive inverse Z/V =(YV + η) /V resultsinverystrongnoiseamplification (or is not possible at all if V has exact zeros). regularization required! Solve the deblurring (inverse) problem by: performing regularized inversion (RI) use the LPA-ICI denoising to improve the regularization by smoothing the solution. Why LPA-ICI denoising? relatively mild regularization parameters used (leaving both more noise and more details) improved detail preservation.

Algorithm (RI part) Step 1. Tikhonov regularized inversion Ŷ RI ³ = argmin kψv Zk 2 + ε 2 1 kψk 2 = = = Ψ V V 2 + ε 2 Z 1 V V 2 + ε 2 (YV + η) 1 V 2 V V 2 + ε 2 Y + 1 V 2 + ε 2 η 1 Step 2. Further LPA-ICI regularization: ŷ RI h,θ = F 1 n Ŷ RI G h,θ o Step 3. ICI selects the adaptive scales to obtain ŷ RI h +,θ for all θ Θ. Step 4. Fuse ŷ RI h +,θ Θ to obtain the estimate is ŷri.

Algorithm (RWI part) Step 1. Regularized Wiener inversion (using the ŷ RI as reference estimate) Ŷ RW I = V Ŷ RI 2 V Ŷ RI 2 + α 2 RW I σ 2 Z Step 2. Further LPA-ICI regularization: ŷ RW I h,θ = F 1 n Ŷ RW I G h,θ o Step 3. ICI selects the adaptive scales to obtain ŷ RW I h +,θ for all θ Θ. Step 4. Fuse the directional estimates ŷ h RW I + by weighted averaging,θ Θ where the weights are inversely proportional to their corresponding variances. The resultant and final estimate is ŷ RW I

Anisotropic LPA-ICI RI-RWI deconvolution algorithm flowchart

Blur: 9x9 uniform "box-car" BSNR 40dB Anisotropic LPA-ICI RI-RWI estimate ISNR 8.29dB

Detailed view of a fragment of the image original image y blurred and noisy observation z Point-Spread Function (PSF) v Regularized Inverse z RI Adaptive scales h + (, 7π/4) (RI) Filtered Regularized Inverse estimate ŷ RI Regularized Wiener Inverse z RWI Adaptive scales h + (,π) (RWI) Filtered Regularized Wiener Inverse estimate ŷ RW I

Derivative estimation from noisy blurred images Use the RI-RWI deblurring algorithm but replace the estimation (smoothing kernels) g h,θ with derivative estimation kernels. Then, ŷ RW I h +,θ is an estimate of θy (derivative of y in direction θ). For example, for θ = π/4, µ when using the 8-directional LPA-ICI, we compute the derivative as ˆ π/4 = ŷ h RW I +,π/4 ŷrw h I +,5π/4

For edge detection, one can use the sum of the absolute values of the directional derivatives Example for the 8-directional LPA-ICI, P 4 k=1 ˆ θk

Inverse halftoning by LPA-ICI RI-RWI deconvolution The Inverse halftoning problem is to recover a grayscale image from a binary halftone Error-diffusion using Floyd-Steinberg or Jarvis masks are common halftoning methods

We can do a coarse linear modeling of the halftoning as convolution with additive colored noise: Z = PY + Q η P and Q canbecomputedfromtheerror-diffusion masks. The difference with the LPA-ICI RI-RWI s modeling is the colored noise component Q η The Fourier spectra P and Q in the case of Floyd-Steinberg halftoning. Most of their energy in the high frequencies unlike the case of blurring.

We extend the RI-RWI deconvolution as follows. In the RI step, Ŷ RI h,θ = PG h,θ P 2 + Q 2 ε 2 Z 1 In the RWI step, Ŷ RW I h,θ = Ŷ RI 2 Gh,θ P P Ŷ RI 2 + α 2 RW I Q 2 σ 2Z

Anisotropic RI-RWI inverse halftoning results Lena, Floyd-Steinberg halftone LPA-ICI RI-RWI inverse halftoning

original image y Error-Diffusion Halftone z P Q 4 2 0 4 2 0 Regularized Inverse z RI Adaptive scales h + (, 7π/4) (RI) Filtered Regularized Inverse estimate ŷ RI Regularized Wiener Inverse z RWI Adaptive scales h + (,π) (RWI) Filtered Regularized Wiener Inverse estimate ŷ RW I

Matlab code and publications can be found at: h ttp://www.cs.tut.fi/~lasip