Defocusing and Deblurring by Using with Fourier Transfer

Similar documents
DIGITAL IMAGE PROCESSING UNIT III

Midterm Review. Image Processing CSE 166 Lecture 10

SURVEILLANCE SYSTEMS WITH AUTOMATIC RESTORATION OF LINEAR MOTION AND OUT-OF-FOCUS BLURRED IMAGES. Received August 2008; accepted October 2008

International Journal of Engineering and Emerging Technology, Vol. 2, No. 1, January June 2017

Position-Dependent Defocus Processing for Acoustic Holography Images

Image preprocessing in spatial domain

Today. Defocus. Deconvolution / inverse filters. MIT 2.71/2.710 Optics 12/12/05 wk15-a-1

Frequency Domain Enhancement

Lecture 3: Linear Filters

Deconvolution , , Computational Photography Fall 2018, Lecture 12

Image Enhancement. DD2423 Image Analysis and Computer Vision. Computational Vision and Active Perception School of Computer Science and Communication

Focused Image Recovery from Two Defocused

Deconvolution , , Computational Photography Fall 2017, Lecture 17

CoE4TN4 Image Processing. Chapter 3: Intensity Transformation and Spatial Filtering

EFFECT OF DEGRADATION ON MULTISPECTRAL SATELLITE IMAGE

Digital Imaging Systems for Historical Documents

Vision Review: Image Processing. Course web page:

1.Discuss the frequency domain techniques of image enhancement in detail.

4 STUDY OF DEBLURRING TECHNIQUES FOR RESTORED MOTION BLURRED IMAGES

Fourier transforms, SIM

International Journal of Advancedd Research in Biology, Ecology, Science and Technology (IJARBEST)

e-issn: p-issn: X Page 145

Color Space 1: RGB Color Space. Color Space 2: HSV. RGB Cube Easy for devices But not perceptual Where do the grays live? Where is hue and saturation?

Coded photography , , Computational Photography Fall 2018, Lecture 14

Computer Vision, Lecture 3

Enhanced Method for Image Restoration using Spatial Domain

Digital Image Processing

Restoration of Motion Blurred Document Images

A Comparative Review Paper for Noise Models and Image Restoration Techniques

Stochastic Image Denoising using Minimum Mean Squared Error (Wiener) Filtering

A Comprehensive Review on Image Restoration Techniques

DEFOCUS BLUR PARAMETER ESTIMATION TECHNIQUE

Coded photography , , Computational Photography Fall 2017, Lecture 18

EE482: Digital Signal Processing Applications

Recent Advances in Image Deblurring. Seungyong Lee (Collaboration w/ Sunghyun Cho)

Blurred Image Restoration Using Canny Edge Detection and Blind Deconvolution Algorithm

Coded Computational Photography!

Single-Image Shape from Defocus

ECC419 IMAGE PROCESSING

COMPREHENSIVE EXAMINATION WEIGHTAGE 40%, MAX MARKS 40, TIME 3 HOURS, DATE Note : Answer all the questions

Implementation of Image Restoration Techniques in MATLAB

A Comparative Study and Analysis of Image Restoration Techniques Using Different Images Formats

Deblurring. Basics, Problem definition and variants

Single Digital Image Multi-focusing Using Point to Point Blur Model Based Depth Estimation

Comparison of an Optical-Digital Restoration Technique with Digital Methods for Microscopy Defocused Images

A moment-preserving approach for depth from defocus

Blind Single-Image Super Resolution Reconstruction with Defocus Blur

A Comparative Study and Analysis of Image Restoration Techniques Using Different Images Formats

Computer Vision. Howie Choset Introduction to Robotics

Image Processing for feature extraction

Chapter 2 Fourier Integral Representation of an Optical Image

Improving Signal- to- noise Ratio in Remotely Sensed Imagery Using an Invertible Blur Technique

DIGITAL IMAGE PROCESSING (COM-3371) Week 2 - January 14, 2002

Image Restoration. Lecture 7, March 23 rd, Lexing Xie. EE4830 Digital Image Processing

Coded Aperture for Projector and Camera for Robust 3D measurement

Contrast Enhancement in Digital Images Using an Adaptive Unsharp Masking Method

Enhancement. Degradation model H and noise must be known/predicted first before restoration. Noise model Degradation Model

IMAGE PROCESSING (RRY025) THE CONTINUOUS 2D FOURIER TRANSFORM

Image acquisition. Midterm Review. Digitization, line of image. Digitization, whole image. Geometric transformations. Interpolation 10/26/2016

Transforms and Frequency Filtering

Transfer Efficiency and Depth Invariance in Computational Cameras

EE4830 Digital Image Processing Lecture 7. Image Restoration. March 19 th, 2007 Lexing Xie ee.columbia.edu>

The ultimate camera. Computational Photography. Creating the ultimate camera. The ultimate camera. What does it do?

On the Recovery of Depth from a Single Defocused Image

Frequencies and Color

Restoration of defocused digital images

Image Restoration. Lecture 7, March 23 rd, Lexing Xie. EE4830 Digital Image Processing

8. Lecture. Image restoration: Fourier domain

Image Deblurring and Noise Reduction in Python TJHSST Senior Research Project Computer Systems Lab

Solution for Image & Video Processing

Image Deblurring with Blurred/Noisy Image Pairs

PRACTICAL IMAGE AND VIDEO PROCESSING USING MATLAB

Computational Approaches to Cameras

Improved motion invariant imaging with time varying shutter functions

Defocus Map Estimation from a Single Image

CSE 564: Scientific Visualization

Color Transformations

Image Restoration using Modified Lucy Richardson Algorithm in the Presence of Gaussian and Motion Blur

Deblurring Image and Removing Noise from Medical Images for Cancerous Diseases using a Wiener Filter

DeConvHAADF. User s Guide. (Software Cs-Corrector) DigitalMicrograph Plugin for STEM-HAADFDeconvolution. HREM Research Inc. Version 3.

Performance Evaluation of Different Depth From Defocus (DFD) Techniques

Digital Image Processing Programming Exercise 2012 Part 2

Comparison of Reconstruction Algorithms for Images from Sparse-Aperture Systems

Course Overview. Dr. Edmund Lam. Department of Electrical and Electronic Engineering The University of Hong Kong

Image restoration and color image processing

Image Quality Assessment for Defocused Blur Images

TDI2131 Digital Image Processing

Achim J. Lilienthal Mobile Robotics and Olfaction Lab, AASS, Örebro University

Removing Temporal Stationary Blur in Route Panoramas

Imaging Process (review)

To Do. Advanced Computer Graphics. Outline. Computational Imaging. How do we see the world? Pinhole camera

Multi-Image Deblurring For Real-Time Face Recognition System

Optics of Wavefront. Austin Roorda, Ph.D. University of Houston College of Optometry

Blind Blur Estimation Using Low Rank Approximation of Cepstrum

BLIND IMAGE DECONVOLUTION: MOTION BLUR ESTIMATION

CoE4TN4 Image Processing. Chapter 4 Filtering in the Frequency Domain

CONTENTS. Chapter I Introduction Package Includes Appearance System Requirements... 1

Table of contents. Vision industrielle 2002/2003. Local and semi-local smoothing. Linear noise filtering: example. Convolution: introduction

This content has been downloaded from IOPscience. Please scroll down to see the full text.

What the spider s eyes don t tell the spider s brain

Transcription:

Defocusing and Deblurring by Using with Fourier Transfer AKIRA YANAGAWA and TATSUYA KATO 1. Introduction Image data may be obtained through an image system, such as a video camera or a digital still camera. When we obtain an image, some noise can be added to it. This noise depends on an image system and often interferes with a sampling trait from this image. In the case of defocusing, this is caused by the rays, which are focused on a single point in an ideal system, and are slightly spread out [Hor86]. In this paper, we will try to make a defocused gray-scale image artificially. Making use of this theorem, we will try to debulur a gray-scale picture without its original image. We will also try to expand the experiment to a color image. 2. The Definition of Defocus and Deblur Defocusing can be modeled as Point Spread Function (PSF) [Ros76]. By using PSF, defocusing is defined as the convolution of the data of an image and PSF (Fig. 1 and Fig. 2.1). f(x,y) h(x,y) PSF g(x,y) Fig. 1 ( x, y) = h( x ξ, y η) f ( ξ, η dξdη (2.1) g ) Where h( x, y) is PSF, f(x, y) is an ideal image, and g(x, y) is a blurred image.[sai93] In general, it is based on Gaussian model although there is much PSF. Eqn. (2.2) denotes 2-D Gaussian, and Blur PSF (Gaussian) and Ideal PSF are shown in Fig. 2.[Hor86] h ( x + y 1 2 2σ ( x, y) = e 2 2πσ 2 2 ) (2.2)

PSF IDEAL 1D PSF BLUR 1D PSF IDEAL 2D PSF BLUR 2D Fig. 2 PSF BLUR μ=0 σ=10 In ideal PSF, the rays are not spread. In 1-D, it is δ-function, and in 2-D, it is a point. On the other hand, in Gaussian 2-D PSF, the rays spread from the center of the lens to outside. This causes blurring. To decrease the amount of the calculation, we have used the Fourier transform. Eqn. (2.3) denotes the Fourier transform of Eqn. (2.2). This shows that the Fourier transform of Gaussian is also Gaussian. [Hor86] We can transform Eqn. (2.2) to Eqn. (2.4) by using Eqn. (2.3). [Sai93] H ( u, 1 ( u 2 2 + v 2 ) σ = e (2.3) 2 G ( u, = H ( u, F( u, (2.4) Where G(u, is the Fourier transform of a blurred image, H(u, is the Fourier

transform of a blurred image, and F(u, is Fourier transform of an ideal image. H (u, is a low-pass filter (see Fig. 3 showing the magnitude of H (u, ). Fig. 3 We can also deblur an image by using the inverse function of Eqn. (2.4). [Ros76] F ( u, = G( u, / H ( u, (2.5) M (u, denotes the inverse function of Eqn. (2.6). M ( u, = 1/ H ( u, (2.6) However, if H (u, is 0 or close to 0, F (u, will be infinity or have a large value. To solve this problem, we applied the Wiener filter, denoted by Eqn. (2.7). M ( u, H ( u, = H ( u, 2 +Γ (2.7) Since to prove Eqn. (2.7) is a long and complex process, I have omitted the proof (it shows in [Ros76]). However, we found out intuitively that M (u, will not diverge at

any H( u, because of Γ. This Γ denotes the S/N ratio of G(u,, and at present, the method of estimating Γ without the information of the image. Therefore, we have to decide Γ reciprocally. The Wiener filter, however, is effective to deblur an image by comparing it with Eqn. (2.6) [Har68]. We have attached Fig. 4 which shows the magnitude of both Weiner filter and an inverse function. From Fig. 4, the Wiener filter is also more stable than an inverse function. Fig. 4 Magnitude of Inverse Function Filter and Weiner Filter (σ=10, Γ=0.04) 3. Composition and separation of a color The method stated in Section 2 is only for gray-scale images. To make it practical, we have considered about the way to apply it to color images. In general, the color picture consists of Red, Green, and Blue (RGB). However, it is possible that the processing causes color shift since each plane has the information of color. Thus, to avoid color shift, we have extracted a gray-scale image by using HSV color space. HSV space has three parameters: hue, saturation, and value. We have

transformed RGB into HSV by using rgb2hsv function of MATLAB. After that, we processed V, which has a gray-scale value, and mixed it with H and S (Fig. 5). H JPG File BMP File rgb2hsv S V Processing hsv2rgb JPG File BMP File Fig. 5 In this report, we use HSV. Yet, if the application is focused on gray-scale images, YIQ or YUV should be selected because V in HSV 1 is (R+G +B)/3. It has been said that people do not feel that red and blue have the same degree of brightness. This shows formulas to change RGB to YIQ or YUV in (3.1). Y denotes brightness. Y = 0.299R I = 0.596R Q = 0.212R + 0.587G + 0.114B - 0.274G - 0.322B - 0.523G + 0.311B Y = 0.299R + 0.587G + 0.114B (3.1) U = -0.147R - 0.289G + 0.437B V = 0.615R - 0.515G - 0.100B 1 There are a lot of formulas to change RGB into HSV. We did to denote the formula because we don t know which formula is used bymatlab.

4. Experiments and Results 4.1 Procedure of the Experiment We experimented according to the following procedure. Experiment of Defocus Procedure σ Making Gaussian Filter FFT H (u, Image File jpg,bmp Extract Brightness FFT H (u, IFFT Composition of color and brightness Fig. 6 Experiment of Deblur Procedure σ Making Gaussian Filter FFT Making Inverse Func M (u, Γ Making Weiner Filter M (u, Image File jpg,bmp Extract Brightness FFT M (u, IFFT Composition of color and brightness Fig. 7

4.2 Program for experiments At this time, we use GUIDE which is GUI function in MATLAB in order to change the parameters. The program we used for this experiment is shown in Fig. 8. Fig. 8 Defocusing 1. Select image from List Box (DOUBLE CLICK) 2. Input parameter, and select check box. Disp Image Check Box The result image is displayed on new window. Disp Mag Check Box The magnitude of the defocus filter is displayed on the new window. Save Check Box The result image is saved in the filed named in the edit box. File type is JPG or BMP. It selects file type automatically by reading the file name extension. 3. Click Defocus Execute button.

Deblurring 1. Select image from List Box (DOUBLE CLICK) 2. Input parameter, and select check box. Disp Image Check Box The result image is displayed on the new window. Disp Mag Check Box The magnitude of the defocus filter is displayed on the new window. Save Check Box The result image is saved in the filed named in the edit box. File type is JPG or BMP. It selects file type automatically by reading the file name extension. 3. Click Sharpness Execute button.

4.3 Defocus We confirmed that the approximation of defocus could be obtained with a Gaussian filter. Magnitude Gaussian Filter Magnitude Original Image Magnitude Filtering Image Fig. 9 Magnitude Fourier Domain (σ=1.5) Fig. 10 Original Image vs. Filtering Image (σ=1.5)

Magnitude Gaussian Filter Magnitude Original Image Magnitude After Filtering Fig. 11 Magnitude Fourier Domain (σ=5.0) Fig. 12 Original Image vs. Filtering Image (σ=5.0)

At this time, the image shown in Fig. 10 and Fig. 12 was passed through the Gaussian filter in the Fourier domain with σ=1.5 andσ=5 respectively. In the 2-D Fourier domain, at the center (u=0, v=0), the frequency is 0. In proportion to the distance from the origin (u=0, v=0), the frequency becomes high. Regarding these facts, the Gaussian filter works as a low-pass filter in Fig. 9 and Fig. 11. As a result, the image was defocused. More frequency will be cut when σ increases. Because of that, the image defocused with σ=5.0 is more blurred than the image defocused with σ=1.5. 4.4 Deblur We tried to deblur images that we have no information of original (focused) images for. Because of that, we decided the suitable parameters of each image by trial and select. Magnitude Inverse Function Filter Magnitude Original Image Magnitude After Filtering- Inverse Function Fig. 13 Magnitude Inverse Function Filter Fourier Domain (σ=1.4)

Magnitude Weiner Filter Magnitude Original Image Magnitude After Filtering- Weiner Filter Fig. 14 Magnitude Weiner Filter Fourier Domain (σ=1.4, Γ=0.04) Fig. 15 Original Image vs. Filtering Image (Gray Scale) (σ=1.4, Γ=0.04)

Fig. 16 Original Image vs. Filtering Image (color) (σ=1.4, Γ=0.04) From the result of the magnitudes, the Inverse Function Filter has diverged at the high frequency area in the Fourier domain space. Because of this, the image passed through the filter was saturated. In contrast, because of Γ, the magnitude of the Wiener filter was restricted so that it may not be 0 or around 0. Also, from Fig. 15 and Fig. 16, after the Weiner Filter passed through, the image became sharper than before.

Magnitude Inverse Function Filter Magnitude Original Image Magnitude After Filtering- Inverse Function Fig. 17 Magnitude Inverse Function Filter Fourier Domain (σ=24.0) Magnitude Weiner Filter Magnitude Original Image Magnitude After Filtering- Weiner Filter Fig. 18 Magnitude Weiner Filter Fourier Domain (σ=24.0, Γ=0.001)

Fig. 19 Original Image vs. Filtering Image (Gray Scale) (σ=24, Γ=0.001) Fig. 20 Original Image vs. Filtering Image (color) (σ=24, Γ=0.001)

In this case, we tried to construct numerical information from the blurred image. If σ is increased, the picture will lose its original texture. However, Fig.19 and Fig.20 show that required information was acquired by emphasizing images' edges (high frequency area) by this method. It is useful to process images, such as the Optical Character Reader (OCR). 5. Conclusion Blurred images can be made by using Gaussian filter, and the degree of the blur depends on its standard deviation (or variance). Even if we don t know the original (focused) image, we can get rid of the blur from the image by using the Weiner filter. The Wiener filters can also enhance the edge image. This is effective in processing images like the OCR. 6. Further Work We tried one method of deblurring. However, we have to repeatedly search for suitable parameters (σ and Γ); moreover, noises of images are not the only blurs but also additive noise and other noise. If the original image is known, some methods of construct image, by using posterior probability, are suggested [Sai93] [Ros76]; yet, the method of deblurring from an unknown original image and noise distribution is still not established. In the future, we will try to establish the decision method of σand Γ and apply this to all unknown images. Hor86 Horn, B. ROBOT VISION, McGraw-Hill, pp. 126-128, 1986 Ros76 Rosenfeld, A. and Hak, A. Digital Picture Processing, pp. 209-228 Sai93 Saitoh, T. Image Processing Algorithm, pp. 68-84 Har68 Harris, J Potential and limitations of techniques for processing linear motion degraded imagery, NASA Publ. SP-192, pp. 131-138, 1968