Vincent DeVito Computer Systems Lab 2009-2010. The goal of my project is to take an image input, artificially blur it using a known blur kernel, then.

Slides:



Advertisements
Similar presentations
Inferring the kernel: multiscale method Input image Loop over scales Variational Bayes Upsample estimates Use multi-scale approach to avoid local minima:
Advertisements

Fourier Transform and its Application in Image Processing
Computer Vision Lecture 7: The Fourier Transform
3-D Computational Vision CSc Image Processing II - Fourier Transform.
Creation of a digital image from an analog signal. Analog-Digital Converter (ADC)
Fourier Transform (Chapter 4)
Digital Image Processing Lecture 11: Image Restoration Prof. Charlene Tsai.
Chap 4 Image Enhancement in the Frequency Domain.
Image Processing A brief introduction (by Edgar Alejandro Guerrero Arroyo)
EE4H, M.Sc Computer Vision Dr. Mike Spann
Shaojie Zhuo, Dong Guo, Terence Sim School of Computing, National University of Singapore CVPR2010 Reporter: 周 澄 (A.J.) 01/16/2011 Key words: image deblur,
Applications of Fourier Analysis in Image Recovery Kang Guo TJHSST Computer Systems Lab
Reminder Fourier Basis: t  [0,1] nZnZ Fourier Series: Fourier Coefficient:
Chapter 4 Image Enhancement in the Frequency Domain.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
Digital Image Processing Chapter 4: Image Enhancement in the Frequency Domain.
Image Enhancement.
Image Deblurring with Optimizations Qi Shan Leo Jiaya Jia Aseem Agarwala University of Washington The Chinese University of Hong Kong Adobe Systems, Inc.
Convolution and Edge Detection : Computational Photography Alexei Efros, CMU, Fall 2005 Some slides from Steve Seitz.
Image deblurring Seminar inverse problems April 18th 2007 Willem Dijkstra.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Input image Output image Transform equation All pixels Transform equation.
Topic 7 - Fourier Transforms DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Under Supervision of Dr. Kamel A. Arram Eng. Lamiaa Said Wed
Image Processing Edge detection Filtering: Noise suppresion.
Motion Blur Detection Ben Simandoyev & Keren Damari.
Part I: Image Transforms DIGITAL IMAGE PROCESSING.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Frequancy Domain Filtering (FDF) Lab 5. Using FFT (Fast Fourier Transform ) algorithm DFT (Discrete Fourier Transform) & inverse DFT.
Technion, CS department, SIPC Spring 2014 Tutorials 12,13 discrete signals and systems 1/39.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Image Subtraction Mask mode radiography h(x,y) is the mask.
COMP322/S2000/L171 Robot Vision System Major Phases in Robot Vision Systems: A. Data (image) acquisition –Illumination, i.e. lighting consideration –Lenses,
Templates, Image Pyramids, and Filter Banks
Typical Types of Degradation: Motion Blur.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Practical Image Processing1 Chap7 Image Transformation  Image and Transformed image Spatial  Transformed domain Transformation.
02/05/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Mach Banding –Humans exaggerate sharp boundaries, but not fuzzy ones.
Fourier Transform.
November 5, 2013Computer Vision Lecture 15: Region Detection 1 Basic Steps for Filtering in the Frequency Domain.
CS 376b Introduction to Computer Vision 03 / 17 / 2008 Instructor: Michael Eckmann.
Computer Graphics & Image Processing Chapter # 4 Image Enhancement in Frequency Domain 2/26/20161.
Vincent DeVito Computer Systems Lab The goal of my project is to take an image input, artificially blur it using a known blur kernel, then.
The Frequency Domain Digital Image Processing – Chapter 8.
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Jean Baptiste Joseph Fourier
Image Subtraction Mask mode radiography h(x,y) is the mask.
Section II Digital Signal Processing ES & BM.
Image Deblurring and noise reduction in python
A Neural Approach to Blind Motion Deblurring
Deconvolution , , Computational Photography
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
Fourier Transform.
ENG4BF3 Medical Image Processing
Image Processing, Leture #14
Image Restoration and Denoising
Vincent DeVito Computer Systems Lab
Applications of Fourier Analysis in Image Recovery
Fourier Transforms.
Intensity Transformation
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
Digital Image Processing Lecture 11: Image Restoration
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Presentation transcript:

Vincent DeVito Computer Systems Lab

The goal of my project is to take an image input, artificially blur it using a known blur kernel, then using deconvolution to deblur and restore the image, then run a last step to reduce the noise of the image. The goal is to have the input and output images be identical with a blurry intermediate image. The final step is then to estimate the blur kernel of an image with an unknown blur kernel.

 Running goal for image processors and photo editors  Many methods of deconvolution exist  Many utilize the Fourier Transform  Current progress focused on blur kernel estimation  Better kernel  more accurate, clear output image

 The group of Lu Yuan, et al. designed project with blurry/noisy image pairs  Blurry image intensity + noisy image sharpness + deconvolution = sharp, deblurred output image  The group of Rob Fergus, et al. designed project to estimate blur kernel from naturally blurred image  A few inputs + kernel estimation algorithm + deconvolution = deblurred output image with few artifacts

 Photography  Improve image quality  Restore image From Fergus, et al.

 Machine Vision  Requires input images to be of good clarity  Blur could ruin techniques such as edge detection  Intermediate step

 Extremely useful for convolution and deconvolution  Convert image to frequency domain   Utilize the formula e θ i = cos θ + i sin θ  Usually display the magnitude, since DFT produces complex number (a + b i ). Magnitude = (a 2 + b 2 ) 1/2  Scale to range  O(n 2 )

 Separate sums   1D DFT in one direction (vertical/horizontal), then in the other  O(nlog 2 n)

 Inverse Fourier Transform converts back to spatial domain   Also possible to separate  Need full complex number from DFT or FFT Original Picture Magnitude Only Phase Only

 Successful FFT and IFFT program  Successful convolution program  Takes any image (square image of size 128x128 or smaller for best runtime) and blurs it using any given blur kernel

 Start to image deconvolution using a given kernel  Inconsistent and somewhat noisy

 Fix deconvolution algorithm  Inconsistent and produces large, clustered values  Need a new transform or more research into kernel types  Noise reduction  Research into deconvolution based on kernel type