The 2D Fourier transform & image filtering
|
|
- Gregory Watts
- 5 years ago
- Views:
Transcription
1 Luleå University of Technology Matthew Thurley and Johan Carlson Last revision: Oct 27, 2011 Industrial Image Analysis E0005E Product Development Phase 6 The 2D Fourier transform & image filtering Contents 1 Background and Introduction 2 2 Assessment 2 3 Test the Fourier Transform 3 4 Image filtering Task Task Task Task Image reconstruction Tasks Reporting Assessment 8 1
2 1 Background and Introduction Read all of the instructions in this document before starting. This week you experiment with image filtering based in the frequency domain and use the 2D fourier transform. This will give you enhanced knowledge of image filtering as well as providing you with the necessary background to help you identify tools in development phase 8 using a technique called fourier descriptors. There are no optional parts to this weeks development phase. Remember that you need to write a clear and reasoned report outlining how and what you have done as outlined in development phase 1. 2 Assessment Each Development Phase will be graded fail (U), pass (3), good (4), or very good (5) based on the following criteria; As this weeks development phase does not contain any optional components a grade of 5 will be determined based on the quality of your explanations and answers to questions. 1. How well does the report answer all the questions outlined in the development plan. Does the student provide a thorough and complete answer? 2. How clearly written is the report and how well reasoned is the explanation? How easy would it be for a technically qualified person to understand what you have done and why, and then follow the development phase instructions and your report and repeat the results? 3. When you are asked to explain or discuss something, explain why your result is this way in relation to the theory from the course material (necessary in order to achieve a grade of 4 or 5) 2
3 3 Test the Fourier Transform Here is an artificial example of decomposing an image into its frequency components using the fourier transform. In this example we make it easier to think about by first constructing the image from sinusoids and then using the fast fourier transform to find the frequencies from which we constructed the image. (Credit to Anders Landström for this example). Optionally you may want to close all existing figures and clear memory with these commands close all force clear clc Next we create two images using a meshgrid() and linear space function, and then display these two images. %% Create two coordinate grids (equivalent to two images) [X Y] = meshgrid(linspace(0,2*pi,512),linspace(0,2*pi,512)); %% Display the grids and wait for the user to press a key imtool(x,[]); imtool(y,[]); Now we fill in these images with intensity values created from simple sinusoids, and then add the images together to create a master image called M that contains sinusoids in the X and Y axes, that we will perform a fourier transform on. %% Create sinusoids with values in the interval [0 5] and display them: % sin(2*x): this will have 2 periods along the X axis Z1 = (sin(2*x)+1)./4; imtool(z1); % sin(4*y): This will have 4 periods along the Y axis Z2 = (sin(4*y)+1)./4; imtool(z2); %% Add the sinusoids together to create our Image M = (Z1 + Z2); imtool(m); Now we perform the fourier transform and show the resultant image. 3
4 %% Fourier transform: m = size(m); F = fft2(m,m(1),m(2)); %% Shift the data and look at the content. Fs = fftshift(f); imtool((abs(fs)),[]); The first thing you will notice is that the resultant image, Fs is almost entirely black with a tiny white spot in the middle. If you zoom in on this spot you discover that it is actually 5 non black pixels. The white pixel is at the origin, and the grey pixels are at (-2,0) (2,0) (0,4) (0,-4) and they indicate that there are sinusoids in the image with period 2 in the x axis direction, and sinusoids with period 4 in the y axis direction. So if we want to remove the sinusoids along the x axis, we can set the grey pixels at (-2,0) and (2,0) to 0. The pixel coordinates for these values are actually (255,257) and (259,257). So lets see what happens when we set them to zero and then do the inverse fourier transform. %% Remove appropriate frequencies in order to bring back the Y-sinusoids only % (Tip: Look at the peaks in abs(fs) and where they are in relation to % the origin (the middle of the shifted image) % Set two values in the image to zero at the same time Fs(257,[ ]) = 0; % Reduce the intensity at the origin because the x sinusoids add to this % value as well Fs(257,257) = Fs(257,257)/2; %% Undo the shifting: F2 = ifftshift(fs); %% and go back to the spatial domain: MF = ifft2(f2,m(1),m(2)); MF = MF(1:size(M,1),1:size(M,2)); %% Display the result: imtool(mf); As we desire, the image MF contains only the y axis sinusoids So what we see is that the fourier transform represents the sinusoidal components of an image, and if we edit the fourier transform, or filter it in someway, and then invert the fft, we can remove parts of the original image. 4
5 4 Image filtering 4.1 Task 1 Load and view the image caesar.tif into variable Im. Take the 2D Fourier transform of the image Im (see help fft2) and store the result in the variable Ti. Study the magnitude of the result with (see MATLAB help for abs and fftshift). Note: when displaying images in this phase you will need to rescale the intensity range. You may need to be aware of what the actual min and max values in the image are in order to understand some of your results. There is also another function imagesc that combines image and a version of rescale. image(rescale(fftshift(abs(ti)))); You probably can not say much by looking at the figure because most of the image is too dark to see the variation. The reason is that most of the figure s energy is confined to the lowest frequencies. To see some of this information, type plot(fftshift(abs(ti(129,:)))); What does Ti(129,:) mean? We re extracting something from the spectrum of the image, but what? A common way of displaying the spectrum is in a logarithmic scale as it lets us more easily view the range of information in the fourier transform. Try this: imagesc(fftshift(log(abs(ti)+1))); The logarithm will compress the dynamic range of intensities, and preserve the zeros (because of the +1 in the expression above). The Fourier transform is complex number valued. Hence, it can be written as: F(k,l) = F(k,l) e j F(k,l), where F(k,l) is the magnitude and F(k,l) is the argument (or the phase) of F(k,l), respectively. Now, let s remove the phase information. Use help ifft2 and help real to see what these function do. NoPhase = real(ifft2(abs(ti))); imagesc(nophase); Study the result! Now, let s keep the phase information while removing the magnitude, i.e. NoMag = real(ifft2(ti./abs(ti))); imagesc(nomag); Reporting Which of phase and magnitude is the most important regarding edge information and why? When designing filters, what is most important: preserving the phase or the magnitude? 5
6 Think about what sort of filters and give some examples. 4.2 Task 2 Load the file h1.mat and study it using load h1; colormap(hsv); mesh(h1); h1 is an isotropic (which means it is rotational symmetric) FIR filter. Now look at the transformed filter with H1 = fft2(h1,256,256); % Zero-padd h1 to size 256x256 mesh(fftshift(abs(h1(1:2:256, 1:2:256)))); What are the frequency characteristics of this filter? It might be clearer if you write the following to plot a part of the filter; f = -pi:(pi/128):(pi-pi/128); plot(f, fftshift(abs(h1(128,:)))); Now, let s perform the filtering in the spatial domain and study the result Ci = conv2(im,h1, same ); colormap(gray(256)); imagesc(ci); Then, perform the filtering in the frequency domain and study the result [x,y] = meshgrid(0:255); Cm = exp(1j*2*pi*7*(x+y)/256); Fi = real(ifft2(ti.*h1.*cm)); imagesc(fi); Note: The Cm variable is a technicality in terms of a translation in the Fourier domain, necessary if we later want to compare the images. Spend a couple of minutes thinking about what it actually means. Hint: F{x(t τ)} = X(f)e j2πfτ. Compare the two resulting images (filtering in the spatial domain and in the frequency domain) and study the difference abs(ci-fi). Ci is the result of a linear convolution in the spatial domain, whilefi is the result of a circular product in the frequency domain. Hence, the boundary conditions differ for the two cases (see DIP, section 4.6.6). Perform a linear convolution in the Fourier domain, by first zero-padding the signals. Use the new padded image size (256+14) (256+14), i.e. we add a frame of size size(h1)-1 to the images. See help fft2 on how to get a padded image when performing a transform, and recalculate the necessary transformed images. Call the result after the inverse transform Pi. You will also need the translation operator Cm as below in the inverse transform 6
7 [x,y] = meshgrid(0:255+14); Cm =exp(1j*2*pi*7*(x+y)/(256+14)); Now, extract the relevant part of the image Pi, everything except the padding, using Li = Pi(1:256,1:256) and study the difference abs(ci-li). Reporting: Supply difference images abs(ci-fi) and abs(ci-li) and explain the results with reference back to the material presented in the course. 4.3 Task 3 Load the.mat-file h2 (which is another FIR filter). Repeat all the operations in from task 2 using h2 instead of h1. Reporting: Supply difference images abs(ci-fi) and abs(ci-li) and explain the results with reference back to the material presented in the course. 4.4 Task 4 Implement a linear convolution of Im with the LoG operator from development phase 3. Reporting: Supply your (well commented) MATLAB code and the resultant image. 5 Image reconstruction 5.1 Tasks I recently visited a sporting event and took some pictures with my camera. Things were going rather fast and unfortunately I used a much too long exposure time. This resulted in a blurred image. Load the image blur and study it (it is of size ). After thinking hard about the situation I came up with a discretized model of the blurring process. The blurred image B is related to the original (ideal) image I as B(i,j) = N a k I(i,j k), k=1 i.e. B is a weighted sum of N translated copies of I. I estimated the number N = 256. The coefficients a k is a model of the declining flash light, given by a k = 256 k N l=1 l. The plan is to reconstruct the original image I from the blurred image B in the Fourier domain by first determining an expression of the 2D discrete Fourier transform Fb of the blurred image. If the transform Fb can be written as Fb = Fi H, where Fi is the 2D Fourier transform of the ideal image I, then it might be possible to reconstruct I by inverse transforming the expression F b/h. Your job is, of course, to test this hypothesis. 7
8 First, find an expression for the blur operator H, then create H as a MATLAB matrix. Then create Fb and finally, reconstruct I with the command I = real(ifft2(fb./h)); Smooth the result by convolving it with h1 from the previous assignment and remove the border ( 10 pixels) from the resulting image. Reporting: Supply your (well commented) MATLAB code and the de-blurred image. Explain the results. 6 Reporting Assessment Write a short evaluation of how well your report satisfies the following criteria. How well does your report answer all the questions outlined in the development plan. Do you provide a thorough and complete answer? How clearly written is your report and how well reasoned the discussion. How easy would it be for a technically qualified person to follow your report to repeat the results? Are there any problems with your solution? The purpose of this assessment question is for you to evaluate your own work like you would have to in a real work situation before handing it over to your technical supervisor. 8
1 Background and Introduction 2. 2 Assessment 2
Luleå University of Technology Matthew Thurley Last revision: October 27, 2011 Industrial Image Analysis E0005E Product Development Phase 4 Binary Morphological Image Processing Contents 1 Background and
More informationDigital Image Processing. Image Enhancement in the Frequency Domain
Digital Image Processing Image Enhancement in the Frequency Domain Topics Frequency Domain Enhancements Fourier Transform Convolution High Pass Filtering in Frequency Domain Low Pass Filtering in Frequency
More informationCS1114 Section 8: The Fourier Transform March 13th, 2013
CS1114 Section 8: The Fourier Transform March 13th, 2013 http://xkcd.com/26 Today you will learn about an extremely useful tool in image processing called the Fourier transform, and along the way get more
More informationLab 1: Basic operations on images in Matlab
Lab 1: Basic operations on images in Matlab Maria Magnusson with contributions by Michael Felsberg, 2017, Computer Vision Laboratory, Department of Electrical Engineering, Linköping University 1 Introduction
More informationFourier transforms and convolution
Fourier transforms and convolution (without the agonizing pain) CS/CME/BioE/Biophys/BMI 279 Oct. 26, 2017 Ron Dror 1 Why do we care? Fourier transforms Outline Writing functions as sums of sinusoids The
More informationComputer Vision I. Announcements. Fourier Tansform. Efficient Implementation. Edge and Corner Detection. CSE252A Lecture 13.
Announcements Edge and Corner Detection HW3 assigned CSE252A Lecture 13 Efficient Implementation Both, the Box filter and the Gaussian filter are separable: First convolve each row of input image I with
More informationTexture. Outline. Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation
Texture Outline Image representations: spatial and frequency Fourier transform Frequency filtering Oriented pyramids Texture representation 1 Image Representation The standard basis for images is the set
More informationEXAM SOLUTIONS. Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006,
School of Computer Science and Communication, KTH Danica Kragic EXAM SOLUTIONS Image Processing and Computer Vision Course 2D1421 Monday, 13 th of March 2006, 14.00 19.00 Grade table 0-25 U 26-35 3 36-45
More informationImage Manipulation in MATLAB Due Monday, July 17 at 5:00 PM
Image Manipulation in MATLAB Due Monday, July 17 at 5:00 PM 1 Instructions Labs may be done in groups of 2 or 3 (i.e., not alone). You may use any programming language you wish but MATLAB is highly suggested.
More informationComputer Vision. Fourier Transform. 20 January Copyright by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved
Van de Loosdrecht Machine Vision Computer Vision Fourier Transform 20 January 2017 Copyright 2001 2017 by NHL Hogeschool and Van de Loosdrecht Machine Vision BV All rights reserved j.van.de.loosdrecht@nhl.nl,
More informationLecture 4 Image Enhancement in Spatial Domain
Digital Image Processing Lecture 4 Image Enhancement in Spatial Domain Fall 2010 2 domains Spatial Domain : (image plane) Techniques are based on direct manipulation of pixels in an image Frequency Domain
More informationAPPM 2360 Project 2 Due Nov. 3 at 5:00 PM in D2L
APPM 2360 Project 2 Due Nov. 3 at 5:00 PM in D2L 1 Introduction Digital images are stored as matrices of pixels. For color images, the matrix contains an ordered triple giving the RGB color values at each
More informationWhat will we learn? Neighborhood processing. Convolution and correlation. Neighborhood processing. Chapter 10 Neighborhood Processing
What will we learn? Lecture Slides ME 4060 Machine Vision and Vision-based Control Chapter 10 Neighborhood Processing By Dr. Debao Zhou 1 What is neighborhood processing and how does it differ from point
More informationAssignment 2. Due Feb 3, 2012
EE225E/BIOE265 Spring 2012 Principles of MRI Miki Lustig Assignment 2 Due Feb 3, 2012 1. Read Nishimura Ch. 3 2. Non-Uniform Sampling. A student has an assignment to monitor the level of Hetch-Hetchi reservoir
More informationImage processing. Reading. What is an image? Brian Curless CSE 457 Spring 2017
Reading Jain, Kasturi, Schunck, Machine Vision. McGraw-Hill, 1995. Sections 4.2-4.4, 4.5(intro), 4.5.5, 4.5.6, 5.1-5.4. [online handout] Image processing Brian Curless CSE 457 Spring 2017 1 2 What is an
More informationComputer Vision 2. SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung. Computer Vision 2 Dr. Benjamin Guthier
Computer Vision 2 SS 18 Dr. Benjamin Guthier Professur für Bildverarbeitung Computer Vision 2 Dr. Benjamin Guthier 1. IMAGE PROCESSING Computer Vision 2 Dr. Benjamin Guthier Content of this Chapter Non-linear
More informationImage Processing. Traitement d images. Yuliya Tarabalka Tel.
Traitement d images Yuliya Tarabalka yuliya.tarabalka@hyperinet.eu yuliya.tarabalka@gipsa-lab.grenoble-inp.fr Tel. 04 76 82 62 68 Noise reduction Image restoration Restoration attempts to reconstruct an
More informationImage Compression Techniques
ME 535 FINAL PROJECT Image Compression Techniques Mohammed Abdul Kareem, UWID: 1771823 Sai Krishna Madhavaram, UWID: 1725952 Palash Roychowdhury, UWID:1725115 Department of Mechanical Engineering University
More informationLab Assignment 3 - CSE 377/594, Fall 2007
Lab Assignment 3 - CSE 377/594, Fall 2007 Due: Thursday, November 15, 2007, 11:59pm Having completed assignments 1 and 2 you are now sufficiently familiar with Matlab. Assignment 3 will build on this knowledge
More informationSampling and Reconstruction
Sampling and Reconstruction Sampling and Reconstruction Sampling and Spatial Resolution Spatial Aliasing Problem: Spatial aliasing is insufficient sampling of data along the space axis, which occurs because
More informationScaled representations
Scaled representations Big bars (resp. spots, hands, etc.) and little bars are both interesting Stripes and hairs, say Inefficient to detect big bars with big filters And there is superfluous detail in
More informationIntroduction to Digital Image Processing
Fall 2005 Image Enhancement in the Spatial Domain: Histograms, Arithmetic/Logic Operators, Basics of Spatial Filtering, Smoothing Spatial Filters Tuesday, February 7 2006, Overview (1): Before We Begin
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS
More informationChapter 3: Intensity Transformations and Spatial Filtering
Chapter 3: Intensity Transformations and Spatial Filtering 3.1 Background 3.2 Some basic intensity transformation functions 3.3 Histogram processing 3.4 Fundamentals of spatial filtering 3.5 Smoothing
More informationLecture 4: Spatial Domain Transformations
# Lecture 4: Spatial Domain Transformations Saad J Bedros sbedros@umn.edu Reminder 2 nd Quiz on the manipulator Part is this Fri, April 7 205, :5 AM to :0 PM Open Book, Open Notes, Focus on the material
More informationExamination in Image Processing
Umeå University, TFE Ulrik Söderström 203-03-27 Examination in Image Processing Time for examination: 4.00 20.00 Please try to extend the answers as much as possible. Do not answer in a single sentence.
More informationAn Intuitive Explanation of Fourier Theory
An Intuitive Explanation of Fourier Theory Steven Lehar slehar@cns.bu.edu Fourier theory is pretty complicated mathematically. But there are some beautifully simple holistic concepts behind Fourier theory
More informationTransportation Informatics Group, ALPEN-ADRIA University of Klagenfurt. Transportation Informatics Group University of Klagenfurt 12/24/2009 1
Machine Vision Transportation Informatics Group University of Klagenfurt Alireza Fasih, 2009 12/24/2009 1 Address: L4.2.02, Lakeside Park, Haus B04, Ebene 2, Klagenfurt-Austria Image Processing & Transforms
More informationFinal Review CMSC 733 Fall 2014
Final Review CMSC 733 Fall 2014 We have covered a lot of material in this course. One way to organize this material is around a set of key equations and algorithms. You should be familiar with all of these,
More informationIMAGING. Images are stored by capturing the binary data using some electronic devices (SENSORS)
IMAGING Film photography Digital photography Images are stored by capturing the binary data using some electronic devices (SENSORS) Sensors: Charge Coupled Device (CCD) Photo multiplier tube (PMT) The
More informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere Sampling sensitive to choice of samples less sensitive to choice of samples
More informationComputer Vision and Graphics (ee2031) Digital Image Processing I
Computer Vision and Graphics (ee203) Digital Image Processing I Dr John Collomosse J.Collomosse@surrey.ac.uk Centre for Vision, Speech and Signal Processing University of Surrey Learning Outcomes After
More informationDigital Image Processing. Prof. P. K. Biswas. Department of Electronic & Electrical Communication Engineering
Digital Image Processing Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture - 21 Image Enhancement Frequency Domain Processing
More informationComputer Vision I - Basics of Image Processing Part 1
Computer Vision I - Basics of Image Processing Part 1 Carsten Rother 28/10/2014 Computer Vision I: Basics of Image Processing Link to lectures Computer Vision I: Basics of Image Processing 28/10/2014 2
More informationImage Enhancement Techniques for Fingerprint Identification
March 2013 1 Image Enhancement Techniques for Fingerprint Identification Pankaj Deshmukh, Siraj Pathan, Riyaz Pathan Abstract The aim of this paper is to propose a new method in fingerprint enhancement
More informationThe Singular Value Decomposition: Let A be any m n matrix. orthogonal matrices U, V and a diagonal matrix Σ such that A = UΣV T.
Section 7.4 Notes (The SVD) The Singular Value Decomposition: Let A be any m n matrix. orthogonal matrices U, V and a diagonal matrix Σ such that Then there are A = UΣV T Specifically: The ordering of
More informationSection 7.6 Graphs of the Sine and Cosine Functions
Section 7.6 Graphs of the Sine and Cosine Functions We are going to learn how to graph the sine and cosine functions on the xy-plane. Just like with any other function, it is easy to do by plotting points.
More informationEE795: Computer Vision and Intelligent Systems
EE795: Computer Vision and Intelligent Systems Spring 2012 TTh 17:30-18:45 WRI C225 Lecture 04 130131 http://www.ee.unlv.edu/~b1morris/ecg795/ 2 Outline Review Histogram Equalization Image Filtering Linear
More informationBiomedical Image Analysis. Spatial Filtering
Biomedical Image Analysis Contents: Spatial Filtering The mechanics of Spatial Filtering Smoothing and sharpening filters BMIA 15 V. Roth & P. Cattin 1 The Mechanics of Spatial Filtering Spatial filter:
More informationSampling, Aliasing, & Mipmaps
Sampling, Aliasing, & Mipmaps Last Time? Monte-Carlo Integration Importance Sampling Ray Tracing vs. Path Tracing source hemisphere What is a Pixel? Sampling & Reconstruction Filters in Computer Graphics
More informationMotivation. Gray Levels
Motivation Image Intensity and Point Operations Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong ong A digital image is a matrix of numbers, each corresponding
More informationLecture 4. Digital Image Enhancement. 1. Principle of image enhancement 2. Spatial domain transformation. Histogram processing
Lecture 4 Digital Image Enhancement 1. Principle of image enhancement 2. Spatial domain transformation Basic intensity it tranfomation ti Histogram processing Principle Objective of Enhancement Image enhancement
More informationLecture 10: Image Descriptors and Representation
I2200: Digital Image processing Lecture 10: Image Descriptors and Representation Prof. YingLi Tian Nov. 15, 2017 Department of Electrical Engineering The City College of New York The City University of
More informationLecture 6: Edge Detection
#1 Lecture 6: Edge Detection Saad J Bedros sbedros@umn.edu Review From Last Lecture Options for Image Representation Introduced the concept of different representation or transformation Fourier Transform
More informationSchedule for Rest of Semester
Schedule for Rest of Semester Date Lecture Topic 11/20 24 Texture 11/27 25 Review of Statistics & Linear Algebra, Eigenvectors 11/29 26 Eigenvector expansions, Pattern Recognition 12/4 27 Cameras & calibration
More informationLecture 2: 2D Fourier transforms and applications
Lecture 2: 2D Fourier transforms and applications B14 Image Analysis Michaelmas 2017 Dr. M. Fallon Fourier transforms and spatial frequencies in 2D Definition and meaning The Convolution Theorem Applications
More informationBiometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong)
Biometrics Technology: Image Processing & Pattern Recognition (by Dr. Dickson Tong) References: [1] http://homepages.inf.ed.ac.uk/rbf/hipr2/index.htm [2] http://www.cs.wisc.edu/~dyer/cs540/notes/vision.html
More informationImage processing in frequency Domain
Image processing in frequency Domain Introduction to Frequency Domain Deal with images in: -Spatial domain -Frequency domain Frequency Domain In the frequency or Fourier domain, the value and location
More informationMotivation. Intensity Levels
Motivation Image Intensity and Point Operations Dr. Edmund Lam Department of Electrical and Electronic Engineering The University of Hong ong A digital image is a matrix of numbers, each corresponding
More informationImage Compression With Haar Discrete Wavelet Transform
Image Compression With Haar Discrete Wavelet Transform Cory Cox ME 535: Computational Techniques in Mech. Eng. Figure 1 : An example of the 2D discrete wavelet transform that is used in JPEG2000. Source:
More informationSpectral modeling of musical sounds
Spectral modeling of musical sounds Xavier Serra Audiovisual Institute, Pompeu Fabra University http://www.iua.upf.es xserra@iua.upf.es 1. Introduction Spectral based analysis/synthesis techniques offer
More informationManual for Microfilament Analyzer
Manual for Microfilament Analyzer Eveline Jacques & Jan Buytaert, Michał Lewandowski, Joris Dirckx, Jean-Pierre Verbelen, Kris Vissenberg University of Antwerp 1 Image data 2 image files are needed: a
More informationReading. 2. Fourier analysis and sampling theory. Required: Watt, Section 14.1 Recommended:
Reading Required: Watt, Section 14.1 Recommended: 2. Fourier analysis and sampling theory Ron Bracewell, The Fourier Transform and Its Applications, McGraw-Hill. Don P. Mitchell and Arun N. Netravali,
More informationEfficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest.
Efficient Image Compression of Medical Images Using the Wavelet Transform and Fuzzy c-means Clustering on Regions of Interest. D.A. Karras, S.A. Karkanis and D. E. Maroulis University of Piraeus, Dept.
More informationComputing Fundamentals Plotting
Computing Fundamentals Plotting Salvatore Filippone salvatore.filippone@uniroma2.it 2014 2015 (salvatore.filippone@uniroma2.it) Plotting 2014 2015 1 / 14 Plot function The basic function to plot something
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationBoundary descriptors. Representation REPRESENTATION & DESCRIPTION. Descriptors. Moore boundary tracking
Representation REPRESENTATION & DESCRIPTION After image segmentation the resulting collection of regions is usually represented and described in a form suitable for higher level processing. Most important
More informationDigital Image Processing Chapter 11: Image Description and Representation
Digital Image Processing Chapter 11: Image Description and Representation Image Representation and Description? Objective: To represent and describe information embedded in an image in other forms that
More informationPoint and Spatial Processing
Filtering 1 Point and Spatial Processing Spatial Domain g(x,y) = T[ f(x,y) ] f(x,y) input image g(x,y) output image T is an operator on f Defined over some neighborhood of (x,y) can operate on a set of
More informationLC-1: Interference and Diffraction
Your TA will use this sheet to score your lab. It is to be turned in at the end of lab. You must use complete sentences and clearly explain your reasoning to receive full credit. The lab setup has been
More information09/11/2017. Morphological image processing. Morphological image processing. Morphological image processing. Morphological image processing (binary)
Towards image analysis Goal: Describe the contents of an image, distinguishing meaningful information from irrelevant one. Perform suitable transformations of images so as to make explicit particular shape
More informationImage Registration for Volume Measurement in 3D Range Data
Image Registration for Volume Measurement in 3D Range Data Fernando Indurain Gaspar Matthew Thurley Lulea May 2011 2 Abstract At this report we will explain how we have designed an application based on
More informationLecture Image Enhancement and Spatial Filtering
Lecture Image Enhancement and Spatial Filtering Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu September 29, 2005 Abstract Applications of
More informationReconstruction of Images Distorted by Water Waves
Reconstruction of Images Distorted by Water Waves Arturo Donate and Eraldo Ribeiro Computer Vision Group Outline of the talk Introduction Analysis Background Method Experiments Conclusions Future Work
More informationEECS 556 Image Processing W 09. Image enhancement. Smoothing and noise removal Sharpening filters
EECS 556 Image Processing W 09 Image enhancement Smoothing and noise removal Sharpening filters What is image processing? Image processing is the application of 2D signal processing methods to images Image
More informationCS 559 Computer Graphics Midterm Exam March 22, :30-3:45 pm
CS 559 Computer Graphics Midterm Exam March 22, 2010 2:30-3:45 pm This exam is closed book and closed notes. Please write your name and CS login on every page! (we may unstaple the exams for grading) Please
More informationPlotting - Practice session
Plotting - Practice session Alessandro Fanfarillo - Salvatore Filippone fanfarillo@ing.uniroma2.it May 28th, 2013 (fanfarillo@ing.uniroma2.it) Plotting May 28th, 2013 1 / 14 Plot function The basic function
More information1. Stereo Correspondence. (100 points)
1. Stereo Correspondence. (100 points) For this problem set you will solve the stereo correspondence problem using dynamic programming. The goal of this algorithm is to find the lowest cost matching between
More informationC E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S. Image Operations II
T H E U N I V E R S I T Y of T E X A S H E A L T H S C I E N C E C E N T E R A T H O U S T O N S C H O O L of H E A L T H I N F O R M A T I O N S C I E N C E S Image Operations II For students of HI 5323
More informationFilters and Fourier Transforms
Filters and Fourier Transforms NOTE: Before reading these notes, see 15-462 Basic Raster notes: http://www.cs.cmu.edu/afs/cs/academic/class/15462/web/notes/notes.html OUTLINE: The Cost of Filtering Fourier
More informationEEM 463 Introduction to Image Processing. Week 3: Intensity Transformations
EEM 463 Introduction to Image Processing Week 3: Intensity Transformations Fall 2013 Instructor: Hatice Çınar Akakın, Ph.D. haticecinarakakin@anadolu.edu.tr Anadolu University Enhancement Domains Spatial
More informationAnnouncements. Edge Detection. An Isotropic Gaussian. Filters are templates. Assignment 2 on tracking due this Friday Midterm: Tuesday, May 3.
Announcements Edge Detection Introduction to Computer Vision CSE 152 Lecture 9 Assignment 2 on tracking due this Friday Midterm: Tuesday, May 3. Reading from textbook An Isotropic Gaussian The picture
More informationTexture. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors. Frequency Descriptors
Texture The most fundamental question is: How can we measure texture, i.e., how can we quantitatively distinguish between different textures? Of course it is not enough to look at the intensity of individual
More informationSegmentation and Grouping
Segmentation and Grouping How and what do we see? Fundamental Problems ' Focus of attention, or grouping ' What subsets of pixels do we consider as possible objects? ' All connected subsets? ' Representation
More informationCS448f: Image Processing For Photography and Vision. Lecture 2
CS448f: Image Processing For Photography and Vision Lecture 2 Today: More about ImageStack Sampling and Reconstruction Assignment 1 ImageStack A collection of image processing routines Each routine bundled
More informationFourier Transforms and Signal Analysis
Fourier Transforms and Signal Analysis The Fourier transform analysis is one of the most useful ever developed in Physical and Analytical chemistry. Everyone knows that FTIR is based on it, but did one
More informationHomework #1. Displays, Image Processing, Affine Transformations, Hierarchical Modeling
Computer Graphics Instructor: Brian Curless CSE 457 Spring 217 Homework #1 Displays, Image Processing, Affine Transformations, Hierarchical Modeling Assigned: Friday, April 7 th Due: Thursday, April 2
More informationAliasing. Can t draw smooth lines on discrete raster device get staircased lines ( jaggies ):
(Anti)Aliasing and Image Manipulation for (y = 0; y < Size; y++) { for (x = 0; x < Size; x++) { Image[x][y] = 7 + 8 * sin((sqr(x Size) + SQR(y Size)) / 3.0); } } // Size = Size / ; Aliasing Can t draw
More informationA/D Converter. Sampling. Figure 1.1: Block Diagram of a DSP System
CHAPTER 1 INTRODUCTION Digital signal processing (DSP) technology has expanded at a rapid rate to include such diverse applications as CDs, DVDs, MP3 players, ipods, digital cameras, digital light processing
More informationHomework #1. Displays, Image Processing, Affine Transformations, Hierarchical Modeling
Computer Graphics Instructor: Brian Curless CSE 457 Spring 215 Homework #1 Displays, Image Processing, Affine Transformations, Hierarchical Modeling Assigned: Thursday, April 9 th Due: Thursday, April
More informationCS143 Introduction to Computer Vision Homework assignment 1.
CS143 Introduction to Computer Vision Homework assignment 1. Due: Problem 1 & 2 September 23 before Class Assignment 1 is worth 15% of your total grade. It is graded out of a total of 100 (plus 15 possible
More information1. Techniques for ill-posed least squares problems. We write throughout this lecture = 2. Consider the following least squares problems:
ILL-POSED LEAST SQUARES PROBLEMS. Techniques for ill-posed least squares problems. We write throughout this lecture = 2. Consider the following least squares problems: where A = min b Ax, min b A ε x,
More informationSobel Edge Detection Algorithm
Sobel Edge Detection Algorithm Samta Gupta 1, Susmita Ghosh Mazumdar 2 1 M. Tech Student, Department of Electronics & Telecom, RCET, CSVTU Bhilai, India 2 Reader, Department of Electronics & Telecom, RCET,
More informationContrast Optimization A new way to optimize performance Kenneth Moore, Technical Fellow
Contrast Optimization A new way to optimize performance Kenneth Moore, Technical Fellow What is Contrast Optimization? Contrast Optimization (CO) is a new technique for improving performance of imaging
More informationImage Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi
Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi 1. Introduction The choice of a particular transform in a given application depends on the amount of
More informationComputer Vision I. Announcement. Corners. Edges. Numerical Derivatives f(x) Edge and Corner Detection. CSE252A Lecture 11
Announcement Edge and Corner Detection Slides are posted HW due Friday CSE5A Lecture 11 Edges Corners Edge is Where Change Occurs: 1-D Change is measured by derivative in 1D Numerical Derivatives f(x)
More informationHomework #1. Displays, Alpha Compositing, Image Processing, Affine Transformations, Hierarchical Modeling
Computer Graphics Instructor: Brian Curless CSE 457 Spring 2014 Homework #1 Displays, Alpha Compositing, Image Processing, Affine Transformations, Hierarchical Modeling Assigned: Saturday, April th Due:
More informationWhy is computer vision difficult?
Why is computer vision difficult? Viewpoint variation Illumination Scale Why is computer vision difficult? Intra-class variation Motion (Source: S. Lazebnik) Background clutter Occlusion Challenges: local
More informationIMAGE DE-NOISING IN WAVELET DOMAIN
IMAGE DE-NOISING IN WAVELET DOMAIN Aaditya Verma a, Shrey Agarwal a a Department of Civil Engineering, Indian Institute of Technology, Kanpur, India - (aaditya, ashrey)@iitk.ac.in KEY WORDS: Wavelets,
More informationSampling, Aliasing, & Mipmaps
Last Time? Sampling, Aliasing, & Mipmaps 2D Texture Mapping Perspective Correct Interpolation Common Texture Coordinate Projections Bump Mapping Displacement Mapping Environment Mapping Texture Maps for
More informationAnno accademico 2006/2007. Davide Migliore
Robotica Anno accademico 6/7 Davide Migliore migliore@elet.polimi.it Today What is a feature? Some useful information The world of features: Detectors Edges detection Corners/Points detection Descriptors?!?!?
More informationComputer Vision for VLFeat and more...
Computer Vision for VLFeat and more... Holistic Methods Francisco Escolano, PhD Associate Professor University of Alicante, Spain Contents PCA/Karhunen-Loeve (slides appart) GIST and Spatial Evelope Image
More informationImage Processing in Matlab
Version: January 17, 2018 Computer Vision Laboratory, Linköping University 1 Introduction Image Processing in Matlab Exercises During this exercise, you will become familiar with image processing in Matlab.
More informationImage and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Representation and Description 2 Representation and
More informationMichael Moody School of Pharmacy University of London 29/39 Brunswick Square London WC1N 1AX, U.K.
This material is provided for educational use only. The information in these slides including all data, images and related materials are the property of : Michael Moody School of Pharmacy University of
More informationECE 484 Digital Image Processing Lec 12 - Mid Term Review
ECE 484 Digital Image Processing Lec 12 - Mid Term Review Zhu Li Dept of CSEE, UMKC Office: FH560E, Email: lizhu@umkc.edu, Ph: x 2346. http://l.web.umkc.edu/lizhu slides created with WPS Office Linux and
More informationSampling: Application to 2D Transformations
Sampling: Application to 2D Transformations University of the Philippines - Diliman August Diane Lingrand lingrand@polytech.unice.fr http://www.essi.fr/~lingrand Sampling Computer images are manipulated
More informationApplications of Image Filters
02/04/0 Applications of Image Filters Computer Vision CS 543 / ECE 549 University of Illinois Derek Hoiem Review: Image filtering g[, ] f [.,.] h[.,.] 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 90
More informationAn Introduc+on to Mathema+cal Image Processing IAS, Park City Mathema2cs Ins2tute, Utah Undergraduate Summer School 2010
An Introduc+on to Mathema+cal Image Processing IAS, Park City Mathema2cs Ins2tute, Utah Undergraduate Summer School 2010 Luminita Vese Todd WiCman Department of Mathema2cs, UCLA lvese@math.ucla.edu wicman@math.ucla.edu
More informationExercise: Simulating spatial processing in the visual pathway with convolution
Exercise: Simulating spatial processing in the visual pathway with convolution This problem uses convolution to simulate the spatial filtering performed by neurons in the early stages of the visual pathway,
More information