DCSP-10: Applications
|
|
- Dominic Goodman
- 6 years ago
- Views:
Transcription
1 DCSP-10: Applications Jianfeng Feng Department of Computer Science Warwick Univ., UK
2 Applications Power spectrum estimate Image Sampling theorem
3 Applications Power spectrum estimate Compression Image Sampling theorem
4 Understanding the plot Sampling rate is F s, the largest (fastest) frequency from the data is then F s /2 Remembering that our frequency domain is in [0 2p] which matches to [0 F s ] Divide [0 F s ] into N intervals and plot abs X[k] against kf s /N which gives power against frequency Since it is symmetric, we sometime only plot out [0, F s/ /2] Here F s =1 0 Hz
5 Spectrogram In real life example, all signals change with time (music for example) Using sliding window to sample signals and calculate PSD -- STFT
6 ; A Matlab Example close all clear all load handel; figure(1) plot(y); xlabel('time') T=size(y); for i=1:t(1,1) fre_x(i)=i*fs/t(1,1); end figure(2) plot(fre_x, abs(fft(y))) xlabel('hz') figure(3) spectrogram(y,128,120,[],fs); T1=floor(T(1,1)/2); omega1=1000; for i=1:t(1,1)-t1; z(i,1)=y(i,1)+.3*cos(2*pi*omega1*i/fs); end omega2=2000; for i=t-t1+1:t(1,1); z(i,1)=y(i,1)+.3*cos(2*pi*omega2*i/fs); end figure(5) plot(z); xlabel('time') figure(6) plot(fre_x,abs(fft(z))) xlabel('hz') figure(7) spectrogram(z,128,120,[],fs); for i=1:t(1,1); zn(i,1)=y(i,1)+.3*randn(1,1); end figure(8) plot(zn); xlabel('time') figure(9) plot(fre_x,abs(fft(zn))) xlabel('hz') figure(10) spectrogram(zn,128,120,[],fs); Three signals
7 ; A Matlab Example Original signal close all clear all load handel; figure(1) plot(y); xlabel('time') T=size(y); for i=1:t(1,1) fre_x(i)=i*fs/t(1,1); end figure(2) plot(fre_x, abs(fft(y))) xlabel('hz') figure(3) spectrogram(y,128,120,[],fs); T1=floor(T(1,1)/2); omega1=1000; for i=1:t(1,1)-t1; z(i,1)=y(i,1)+.3*cos(2*pi*omega1*i/fs); end omega2=2000; for i=t-t1+1:t(1,1); z(i,1)=y(i,1)+.3*cos(2*pi*omega2*i/fs); end figure(5) plot(z); xlabel('time') figure(6) plot(fre_x,abs(fft(z))) xlabel('hz') figure(7) spectrogram(z,128,120,[],fs); for i=1:t(1,1); zn(i,1)=y(i,1)+.3*randn(1,1); end figure(8) plot(zn); xlabel('time') figure(9) plot(fre_x,abs(fft(zn))) xlabel('hz') figure(10) spectrogram(zn,128,120,[],fs); + disturbance + noise
8 ; A Matlab Example close all clear all load handel; figure(1) plot(y); xlabel('time') T=size(y); for i=1:t(1,1) fre_x(i)=i*fs/t(1,1); end figure(2) plot(fre_x, abs(fft(y))) xlabel('hz') figure(3) spectrogram(y,128,120,[],fs); T1=floor(T(1,1)/2); omega1=1000; for i=1:t(1,1)-t1; z(i,1)=y(i,1)+.3*cos(2*pi*omega1*i/fs); end omega2=2000; for i=t-t1+1:t(1,1); z(i,1)=y(i,1)+.3*cos(2*pi*omega2*i/fs); end figure(5) plot(z); xlabel('time') figure(6) plot(fre_x,abs(fft(z))) xlabel('hz') figure(7) spectrogram(z,128,120,[],fs); for i=1:t(1,1); zn(i,1)=y(i,1)+.3*randn(1,1); end figure(8) plot(zn); xlabel('time') figure(9) plot(fre_x,abs(fft(zn))) xlabel('hz') figure(10) spectrogram(zn,128,120,[],fs); Abs(fft) vs Frequency
9 ; A Matlab Example close all clear all load handel; figure(1) plot(y); xlabel('time') T=size(y); for i=1:t(1,1) fre_x(i)=i*fs/t(1,1); end figure(2) plot(fre_x, abs(fft(y))) xlabel('hz') figure(3) spectrogram(y,128,120,[],fs); T1=floor(T(1,1)/2); omega1=1000; for i=1:t(1,1)-t1; z(i,1)=y(i,1)+.3*cos(2*pi*omega1*i/fs); end omega2=2000; for i=t-t1+1:t(1,1); z(i,1)=y(i,1)+.3*cos(2*pi*omega2*i/fs); end figure(5) plot(z); xlabel('time') figure(6) plot(fre_x,abs(fft(z))) xlabel('hz') figure(7) spectrogram(z,128,120,[],fs); for i=1:t(1,1); zn(i,1)=y(i,1)+.3*randn(1,1); end figure(8) plot(zn); xlabel('time') figure(9) plot(fre_x,abs(fft(zn))) xlabel('hz') figure(10) spectrogram(zn,128,120,[],fs);
10 ; A Matlab Example close all clear all load handel; figure(1) plot(y); xlabel('time') T=size(y); for i=1:t(1,1) fre_x(i)=i*fs/t(1,1); end figure(2) plot(fre_x, abs(fft(y))) xlabel('hz') figure(3) spectrogram(y,128,120,[],fs); T1=floor(T(1,1)/2); omega1=1000; for i=1:t(1,1)-t1; z(i,1)=y(i,1)+.3*cos(2*pi*omega1*i/fs); end omega2=2000; for i=t-t1+1:t(1,1); z(i,1)=y(i,1)+.3*cos(2*pi*omega2*i/fs); end figure(5) plot(z); xlabel('time') figure(6) plot(fre_x,abs(fft(z))) xlabel('hz') figure(7) spectrogram(z,128,120,[],fs); for i=1:t(1,1); zn(i,1)=y(i,1)+.3*randn(1,1); end figure(8) plot(zn); xlabel('time') figure(9) plot(fre_x,abs(fft(zn))) xlabel('hz') figure(10) spectrogram(zn,128,120,[],fs);
11 A Matlab Example Will come back to it in the next few weeks after we learn how to design filters
12 Image Processing two-dimensional signal x[n 1,n 2 ], n 1,n 2 Z indices locate a point on a grid pixel grid is usually regularly spaced values x[n 1,n 2 ] refer to the pixel s appearance
13 Image Processing Gray scale images: scalar pixel values color images: multidimensional pixel values in a color space (RGB for example) we can consider the single components separately:
14 DFT for image DFT for x N 2-1 N X[k 1,k 2 ] = å 1-1 å x[n 1, n 2 ]exp(- 2p jk 1 n 1 ) exp(- 2p jk 2 n 2 ) n 2 =0 n 1 =0 N 1 N 2 IDFT for X x[n 1, n 2 ] = 1 N 2-1 N å 1-1 å X[k 1, k 2 ]exp( 2p jk 1 n 1 ) exp( 2p jk 2 n 2 ) N 1 N 2 k2 =0 k 1 =0 N 1 N 2
15 Example I clear all close all figure(1) I = imread('peppers.png'); imshow(i); K=rgb2gray(I); figure(2) F = fft2(k); figure; imagesc(100*log(1+abs(fftshift(f)))); colormap(gray); title('magnitude spectrum'); figure; imagesc(angle(f)); colormap(gray) Original picture Gray scale picture
16 Example I
17 Example I FF=(100*log(1+abs(fftshift(F)))); for i=1:384 for j=1:512 ss=sqrt((i-192)*(i-192)+(j-256)*(j-256)); if(ss>100) FF(i,j)=0; end end end All low frequency information is here figure; imagesc(ff); colormap(gray); title('magnitude spectrum'); figure; imagesc(angle(ff)); colormap(gray)
18 Example I FF=(100*log(1+abs(fftshift(F)))); for i=1:384 for j=1:512 ss=sqrt((i-192)*(i-192)+(j-256)*(j-256)); if(ss>100) FF(i,j)=0; end end end All low frequency information is here figure; imagesc(ff); colormap(gray); title('magnitude spectrum'); figure; imagesc(angle(ff)); colormap(gray)
19 Example I? FF=(100*log(1+abs(fftshift(F)))); for i=1:384 for j=1:512 ss=sqrt((i-192)*(i-192)+(j-256)*(j-256)); if(ss>100) FF(i,j)=0; end end end All high frequency information is here figure; imagesc(ff); colormap(gray); title('magnitude spectrum'); figure; imagesc(angle(ff)); colormap(gray)
20 Example II Image processing
21 Example III: mind reading IDFT2
22 Sampling and reconstruction The question we consider here is under what conditions we can completely reconstruct the original signal x(t) from its discretely sampled signal x[n].
23 Sampling and reconstruction Theorem (Nyquist-Shannon sampling thm) Exact reconstruction of a continuous-time signal from its samples is possible if the signal is bandlimited and the sampling frequency is greater than twice the signal bandwidth Proof. The proof is again an application of FT, but we will not go through it here Please read around. It is based upon the sinc function.
24 Summary of FT At the end of the day, FT for signal x is only fft(x) it is deadly easy Hopefully and I am sure it will be useful for your future career
25 Summary of FT At the end of the day, FT for signal x is only fft(x) it is deadly easy Hopefully it will be useful for your future career I am proud of this
26 Filter A filter is a device or process that removes from a signal some unwanted component or feature. Filtering is a class of signal processing, the defining feature of filters being the complete or partial suppression of some aspect of the signal. Most often, this means removing some frequencies and not others in order to suppress interfering signals and reduce background noise.
27 Filter
28 A Filter will look like this Received signal x [n] (lifted it up for 5 units for visualization)
29 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / (N+1) N=9 here
30 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / (N+1) N=9 here
31 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / ( N+1) N=9 here
32 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / (N+1) N=9 here This filter is called moving average MA(10)
33 A Filter will look like this You might be able to guess what is the original signal
34 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / (N+1) + (y[i-1]+ y[i-n])/n This filter is called auto-regressive moving average ARMA(p,q)
35 A Filter will look like this y ([i] = ( x[i] + +x [i-n]) / (N+1) + (y[i-1]+ y[i-n])/n This filter is called auto-regressive moving average ARMA(p,q)
36 N th order filter Filter In general, we can include both the input x [n-k] and the previous outputs y [n-k] to generate y(n) = a 0 x(n)+a 1 x(n-1)+ +a N x(n-n) +b 1 y(n-1)+ +b N y(n-n)
37 Example In this case, when b i =0, it is an MA y(n) = [ x(n)+ x(n-n) ] / N In general it is called ARMA filter. AR for auto-regressive
38 DCSP-11: Filter Jianfeng Feng Department of Computer Science Warwick Univ., UK
39 Aim To find the coefficient a s and b s for certain purposes: for example, filter out noise, stop certain band signals, allow certain band signal to pass etc.
40 A Trick {y(n)} = a 0 {x(n)}+a 1 {x(n-1)}+ +a N {x(n-n)} +b 1 {y(n-1)}+ +b N {y(n-n)} Multiplying z -n on both size of the equation above where z is a complex number and summing over n Y(z) = a 0 X(z)+a 1 z -1 X(z)+ +a N z -N X(z) +b 1 z -1 Y(z)+ +b N z -N Y(z) Y(z)-( b 1 z -1 Y(z) + + b N z -N Y(z)) = a 0 X(z) + a 1 z -1 X(z) + + a N z -N X(z)
41 A Trick [1-b 1 z b N z -N ] Y(z) = [ a 0 + a 1 z a N z -N ] X(z) Y(z) ={ [ a 0 +a 1 z a N z -N ] / [1-b 1 z b N z -N ] } X(z) = H(z) X(z) H(z) is usually called transfer function: it characterizes the input output relationship of a filter
42 A Trick Y(z) ={ [ a 0 +a 1 z a N z -N ] / [1-b 1 z b N z -N ] } X(z) = H(z) X(z) For example, when z = exp(j w ) Y( w ) = H (w) X (w) X and Y are actually the DTFT of x and y In particular, look at a specific frequency w 0, for example Y( w 0 ) = H (w 0 ) X (w 0 ) The magic of FT!!!!!
43 A Trick Y( w 0 ) = H (w 0 ) X (w 0 ) H (w 0 ) = 1 the signal will not be affected at all H (w 0 ) = 0, the signal is stopped your ideas for developing filter?
44 Nonrecursive Filters When a filter is nonrecursive, its difference equation can be written y(n) = a 0 x(n) + a 1 x(n-1) + + a N x(n-n) Such filters are also called finite impulse response filters, for the obvious reason that their IR contain only finitely many nonzero terms. Correspondingly, the TF of a nonrecursive filter can be written as N å m=0 H(z) = a m z -m
45 Block diagram
46 Block diagram a N a N-1 z a 1 a 0
47 Three types of representation Linear difference equation Block diagram Transfer function
48 Zeros Trying to figure out how an MA filter will behave, is not always so simple. Another way of looking at it is through its frequency domain behaviors. We can make a start on this by examining the zeros of its transfer function H(z), i.e. those values of z for which H(z)=0 since H(z) is a polynomial of order N with real coefficients,
49 Zeros Trying to figure out how an FIR filter will behave, is note always so simple. Another way of looking at it is through its frequency domain behaviors. We can make a start on this by examining the zeros of its transfer function H(z), i.e. those values of z for which H(z)=0 H(z) is a polynomial of order N with real coefficients, the complex conjugate root theorem states that if P is a polynomial in one variable with real coefficients, and a + bi is a root of P with a and b real numbers, then its complex conjugate a bi is also a root of P
50 Zeros We can express H(z) in terms of the roots by writing N N z H( z) ( z z ) m 1 where in general z m = z m exp ( j arg [z m ] ) is the mth root, or zero of the transfer function. m The zeros of a transfer function are usually denoted graphically in the complex z-plane by circles, as shown in the following Fig.
51 Zeros
52 Recursive Filters Of the many filter transfer function which are not MA, the most commonly use in DSP are the recursive filters, so called because their current output depends not only on the last N+1 inputs but also on the last N outputs.
Digital Signal Processing Lecture Notes 22 November 2010
Digital Signal Processing Lecture otes 22 ovember 2 Topics: Discrete Cosine Transform FFT Linear and Circular Convolution Rate Conversion Includes review of Fourier transforms, properties of Fourier transforms,
More informationD. Richard Brown III Associate Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department
D. Richard Brown III Associate Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department drb@ece.wpi.edu 3-November-2008 Analog To Digital Conversion analog signal ADC digital
More informationSIGNALS AND SYSTEMS I Computer Assignment 2
SIGNALS AND SYSTES I Computer Assignment 2 Lumped linear time invariant discrete and digital systems are often implemented using linear constant coefficient difference equations. In ATLAB, difference equations
More informationD. Richard Brown III Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department
D. Richard Brown III Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department drb@ece.wpi.edu Lecture 2 Some Challenges of Real-Time DSP Analog to digital conversion Are
More informationEE 341 Spring 2013 Lab 4: Properties of Discrete-Time Fourier Transform (DTFT)
EE 341 Spring 2013 Lab 4: Properties of Discrete-Time Fourier Transform (DTFT) Objective In this lab, we will learn properties of the discrete-time Fourier transform (DTFT), such as conjugate symmetry
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 informationFatima Michael College of Engineering & Technology
DEPARTMENT OF ECE V SEMESTER ECE QUESTION BANK EC6502 PRINCIPLES OF DIGITAL SIGNAL PROCESSING UNIT I DISCRETE FOURIER TRANSFORM PART A 1. Obtain the circular convolution of the following sequences x(n)
More informationAdvanced Computer Graphics. Aliasing. Matthias Teschner. Computer Science Department University of Freiburg
Advanced Computer Graphics Aliasing Matthias Teschner Computer Science Department University of Freiburg Outline motivation Fourier analysis filtering sampling reconstruction / aliasing antialiasing University
More informationCourse Number 432/433 Title Algebra II (A & B) H Grade # of Days 120
Whitman-Hanson Regional High School provides all students with a high- quality education in order to develop reflective, concerned citizens and contributing members of the global community. Course Number
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Dynamic Range and Weber s Law HVS is capable of operating over an enormous dynamic range, However, sensitivity is far from uniform over this range Example:
More informationCompressed Sensing from Several Sets of Downsampled Fourier Values using Only FFTs
Compressed Sensing from Several Sets of Downsampled Fourier Values using Only FFTs Andrew E Yagle Department of EECS, The University of Michigan, Ann Arbor, MI 4809-222 Abstract Reconstruction of signals
More informationEdges, interpolation, templates. Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth)
Edges, interpolation, templates Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth) Edge detection edge detection has many applications in image processing an edge detector implements
More informationImage Compression System on an FPGA
Image Compression System on an FPGA Group 1 Megan Fuller, Ezzeldin Hamed 6.375 Contents 1 Objective 2 2 Background 2 2.1 The DFT........................................ 3 2.2 The DCT........................................
More informationDesign of Low-Delay FIR Half-Band Filters with Arbitrary Flatness and Its Application to Filter Banks
Electronics and Communications in Japan, Part 3, Vol 83, No 10, 2000 Translated from Denshi Joho Tsushin Gakkai Ronbunshi, Vol J82-A, No 10, October 1999, pp 1529 1537 Design of Low-Delay FIR Half-Band
More informationENT 315 Medical Signal Processing CHAPTER 3 FAST FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 3 FAST FOURIER TRANSFORM Dr. Lim Chee Chin Outline Definition and Introduction FFT Properties of FFT Algorithm of FFT Decimate in Time (DIT) FFT Steps for radix
More informationEEE 512 ADVANCED DIGITAL SIGNAL AND IMAGE PROCESSING
UNIVERSITI SAINS MALAYSIA Semester I Examination Academic Session 27/28 October/November 27 EEE 52 ADVANCED DIGITAL SIGNAL AND IMAGE PROCESSING Time : 3 hours INSTRUCTION TO CANDIDATE: Please ensure that
More informationDigital Image Processing. Lecture 6
Digital Image Processing Lecture 6 (Enhancement in the Frequency domain) Bu-Ali Sina University Computer Engineering Dep. Fall 2016 Image Enhancement In The Frequency Domain Outline Jean Baptiste Joseph
More informationDigital Filters in Radiation Detection and Spectroscopy
Digital Filters in Radiation Detection and Spectroscopy Digital Radiation Measurement and Spectroscopy NE/RHP 537 1 Classical and Digital Spectrometers Classical Spectrometer Detector Preamplifier Analog
More informationCalibrating an Overhead Video Camera
Calibrating an Overhead Video Camera Raul Rojas Freie Universität Berlin, Takustraße 9, 495 Berlin, Germany http://www.fu-fighters.de Abstract. In this section we discuss how to calibrate an overhead video
More informationECE4703 B Term Laboratory Assignment 2 Floating Point Filters Using the TMS320C6713 DSK Project Code and Report Due at 3 pm 9-Nov-2017
ECE4703 B Term 2017 -- Laboratory Assignment 2 Floating Point Filters Using the TMS320C6713 DSK Project Code and Report Due at 3 pm 9-Nov-2017 The goals of this laboratory assignment are: to familiarize
More informationImage Sampling and Quantisation
Image Sampling and Quantisation Introduction to Signal and Image Processing Prof. Dr. Philippe Cattin MIAC, University of Basel 1 of 46 22.02.2016 09:17 Contents Contents 1 Motivation 2 Sampling Introduction
More informationImage Sampling & Quantisation
Image Sampling & Quantisation Biomedical Image Analysis Prof. Dr. Philippe Cattin MIAC, University of Basel Contents 1 Motivation 2 Sampling Introduction and Motivation Sampling Example Quantisation Example
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 informationMathematical Operations with Arrays and Matrices
Mathematical Operations with Arrays and Matrices Array Operators (element-by-element) (important) + Addition A+B adds B and A - Subtraction A-B subtracts B from A.* Element-wise multiplication.^ Element-wise
More informationLaboratory 1 Introduction to MATLAB for Signals and Systems
Laboratory 1 Introduction to MATLAB for Signals and Systems INTRODUCTION to MATLAB MATLAB is a powerful computing environment for numeric computation and visualization. MATLAB is designed for ease of use
More informationFilter Bank Design and Sub-Band Coding
Filter Bank Design and Sub-Band Coding Arash Komaee, Afshin Sepehri Department of Electrical and Computer Engineering University of Maryland Email: {akomaee, afshin}@eng.umd.edu. Introduction In this project,
More informationThree-Dimensional Coordinate Systems
Jim Lambers MAT 169 Fall Semester 2009-10 Lecture 17 Notes These notes correspond to Section 10.1 in the text. Three-Dimensional Coordinate Systems Over the course of the next several lectures, we will
More informationAssignment 2. Unsupervised & Probabilistic Learning. Maneesh Sahani Due: Monday Nov 5, 2018
Assignment 2 Unsupervised & Probabilistic Learning Maneesh Sahani Due: Monday Nov 5, 2018 Note: Assignments are due at 11:00 AM (the start of lecture) on the date above. he usual College late assignments
More informationAdvanced Design System 1.5. Digital Filter Designer
Advanced Design System 1.5 Digital Filter Designer December 2000 Notice The information contained in this document is subject to change without notice. Agilent Technologies makes no warranty of any kind
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 informationFilterbanks and transforms
Filterbanks and transforms Sources: Zölzer, Digital audio signal processing, Wiley & Sons. Saramäki, Multirate signal processing, TUT course. Filterbanks! Introduction! Critical sampling, half-band filter!
More information1.12 Optimal Filters (Wiener Filters)
Random Data 75 1.12 Optimal Filters (Wiener Filters) In calculating turbulent spectra we frequently encounter a noise tail just as the spectrum roles down the inertial subrange (-5/3 slope region) toward
More informationIntro to ARMA models. FISH 507 Applied Time Series Analysis. Mark Scheuerell 15 Jan 2019
Intro to ARMA models FISH 507 Applied Time Series Analysis Mark Scheuerell 15 Jan 2019 Topics for today Review White noise Random walks Autoregressive (AR) models Moving average (MA) models Autoregressive
More informationIntroduction to MATLAB for Engineers, Third Edition
PowerPoint to accompany Introduction to MATLAB for Engineers, Third Edition William J. Palm III Chapter 2 Numeric, Cell, and Structure Arrays Copyright 2010. The McGraw-Hill Companies, Inc. This work is
More informationInnite Impulse Response Filters Lecture by Prof Brian L Evans Slides by Niranjan Damera-Venkata Embedded Signal Processing Laboratory Dept of Electrical and Computer Engineering The University of Texas
More informationBasis Functions. Volker Tresp Summer 2017
Basis Functions Volker Tresp Summer 2017 1 Nonlinear Mappings and Nonlinear Classifiers Regression: Linearity is often a good assumption when many inputs influence the output Some natural laws are (approximately)
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 informationAdvanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude
Advanced phase retrieval: maximum likelihood technique with sparse regularization of phase and amplitude A. Migukin *, V. atkovnik and J. Astola Department of Signal Processing, Tampere University of Technology,
More informationSimulation and Analysis of Interpolation Techniques for Image and Video Transcoding
Multimedia Communication CMPE-584 Simulation and Analysis of Interpolation Techniques for Image and Video Transcoding Mid Report Asmar Azar Khan 2005-06-0003 Objective: The objective of the project is
More informationMATH2070: LAB 4: Newton s method
MATH2070: LAB 4: Newton s method 1 Introduction Introduction Exercise 1 Stopping Tests Exercise 2 Failure Exercise 3 Introduction to Newton s Method Exercise 4 Writing Matlab code for functions Exercise
More informationAnnouncements. Image Matching! Source & Destination Images. Image Transformation 2/ 3/ 16. Compare a big image to a small image
2/3/ Announcements PA is due in week Image atching! Leave time to learn OpenCV Think of & implement something creative CS 50 Lecture #5 February 3 rd, 20 2/ 3/ 2 Compare a big image to a small image So
More informationImage Processing and Analysis
Image Processing and Analysis 3 stages: Image Restoration - correcting errors and distortion. Warping and correcting systematic distortion related to viewing geometry Correcting "drop outs", striping and
More informationGEMINI GEneric Multimedia INdexIng
GEMINI GEneric Multimedia INdexIng GEneric Multimedia INdexIng distance measure Sub-pattern Match quick and dirty test Lower bounding lemma 1-D Time Sequences Color histograms Color auto-correlogram Shapes
More informationELEC4042 Signal Processing 2 MATLAB Review (prepared by A/Prof Ambikairajah)
Introduction ELEC4042 Signal Processing 2 MATLAB Review (prepared by A/Prof Ambikairajah) MATLAB is a powerful mathematical language that is used in most engineering companies today. Its strength lies
More informationCompressive Sensing for Multimedia. Communications in Wireless Sensor Networks
Compressive Sensing for Multimedia 1 Communications in Wireless Sensor Networks Wael Barakat & Rabih Saliba MDDSP Project Final Report Prof. Brian L. Evans May 9, 2008 Abstract Compressive Sensing is an
More informationELEC Dr Reji Mathew Electrical Engineering UNSW
ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Review of Motion Modelling and Estimation Introduction to Motion Modelling & Estimation Forward Motion Backward Motion Block Motion Estimation Motion
More informationRefined Measurement of Digital Image Texture Loss Peter D. Burns Burns Digital Imaging Fairport, NY USA
Copyright 3 SPIE Refined Measurement of Digital Image Texture Loss Peter D. Burns Burns Digital Imaging Fairport, NY USA ABSTRACT Image texture is the term given to the information-bearing fluctuations
More informationCHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET
69 CHAPTER 3 WAVELET DECOMPOSITION USING HAAR WAVELET 3.1 WAVELET Wavelet as a subject is highly interdisciplinary and it draws in crucial ways on ideas from the outside world. The working of wavelet in
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 informationLecture note on Senior Laboratory in Phyhsics. Fraunhofer diffraction and double-split experiment
Lecture note on Senior Laboratory in Phyhsics Fraunhofer diffraction and double-split experiment Masatsugu Suzuki and I.S. Suzuki Department of Physics State University of New York at Binghamton, Binghamton,
More informationTeaching Manual Math 2131
Math 2131 Linear Algebra Labs with MATLAB Math 2131 Linear algebra with Matlab Teaching Manual Math 2131 Contents Week 1 3 1 MATLAB Course Introduction 5 1.1 The MATLAB user interface...........................
More informationGeorge Mason University ECE 201: Introduction to Signal Analysis Spring 2017
Assigned: January 27, 2017 Due Date: Week of February 6, 2017 George Mason University ECE 201: Introduction to Signal Analysis Spring 2017 Laboratory Project #1 Due Date Your lab report must be submitted
More informationStructured System Theory
Appendix C Structured System Theory Linear systems are often studied from an algebraic perspective, based on the rank of certain matrices. While such tests are easy to derive from the mathematical model,
More informationFlatness Definition Studies
Computational Mechanics Center Slide 1 Flatness Definition Studies SEMI P-37 and SEMI P-40 M. Nataraju and R. Engelstad Computational Mechanics Center University of Wisconsin Madison C. Van Peski SEMATECH
More informationUNIT 8 STUDY SHEET POLYNOMIAL FUNCTIONS
UNIT 8 STUDY SHEET POLYNOMIAL FUNCTIONS KEY FEATURES OF POLYNOMIALS Intercepts of a function o x-intercepts - a point on the graph where y is zero {Also called the zeros of the function.} o y-intercepts
More informationDigital Signal Processing Introduction to Finite-Precision Numerical Effects
Digital Signal Processing Introduction to Finite-Precision Numerical Effects D. Richard Brown III D. Richard Brown III 1 / 9 Floating-Point vs. Fixed-Point DSP chips are generally divided into fixed-point
More information1-- Pre-Lab The Pre-Lab this first week is short and straightforward. Make sure that you read through the information below prior to coming to lab.
EELE 477 Lab 1: Introduction to MATLAB Pre-Lab and Warm-Up: You should read the Pre-Lab and Warm-up sections of this lab assignment and go over all exercises in the Pre-Lab section before attending your
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationPurpose of the lecture MATLAB MATLAB
Purpose of the lecture MATLAB Harri Saarnisaari, Part of Simulations and Tools for Telecommunication Course This lecture contains a short introduction to the MATLAB For further details see other sources
More informationRedundant Data Elimination for Image Compression and Internet Transmission using MATLAB
Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB R. Challoo, I.P. Thota, and L. Challoo Texas A&M University-Kingsville Kingsville, Texas 78363-8202, U.S.A. ABSTRACT
More informationDesign of Adaptive Filters Using Least P th Norm Algorithm
Design of Adaptive Filters Using Least P th Norm Algorithm Abstract- Adaptive filters play a vital role in digital signal processing applications. In this paper, a new approach for the design and implementation
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 informationWavelet Transform (WT) & JPEG-2000
Chapter 8 Wavelet Transform (WT) & JPEG-2000 8.1 A Review of WT 8.1.1 Wave vs. Wavelet [castleman] 1 0-1 -2-3 -4-5 -6-7 -8 0 100 200 300 400 500 600 Figure 8.1 Sinusoidal waves (top two) and wavelets (bottom
More informationImage Coding and Data Compression
Image Coding and Data Compression Biomedical Images are of high spatial resolution and fine gray-scale quantisiation Digital mammograms: 4,096x4,096 pixels with 12bit/pixel 32MB per image Volume data (CT
More informationDigital Signal Processing. Soma Biswas
Digital Signal Processing Soma Biswas 2017 Partial credit for slides: Dr. Manojit Pramanik Outline What is FFT? Types of FFT covered in this lecture Decimation in Time (DIT) Decimation in Frequency (DIF)
More information2 Second Derivatives. As we have seen, a function f (x, y) of two variables has four different partial derivatives: f xx. f yx. f x y.
2 Second Derivatives As we have seen, a function f (x, y) of two variables has four different partial derivatives: (x, y), (x, y), f yx (x, y), (x, y) It is convenient to gather all four of these into
More informationRectangular Coordinates in Space
Rectangular Coordinates in Space Philippe B. Laval KSU Today Philippe B. Laval (KSU) Rectangular Coordinates in Space Today 1 / 11 Introduction We quickly review one and two-dimensional spaces and then
More informationECE 600, Dr. Farag, Summer 09
ECE 6 Summer29 Course Supplements. Lecture 4 Curves and Surfaces Aly A. Farag University of Louisville Acknowledgements: Help with these slides were provided by Shireen Elhabian A smile is a curve that
More informationImage Processing. Application area chosen because it has very good parallelism and interesting output.
Chapter 11 Slide 517 Image Processing Application area chosen because it has very good parallelism and interesting output. Low-level Image Processing Operates directly on stored image to improve/enhance
More informationToday. Types of graphs. Complete Graphs. Trees. Hypercubes.
Today. Types of graphs. Complete Graphs. Trees. Hypercubes. Complete Graph. K n complete graph on n vertices. All edges are present. Everyone is my neighbor. Each vertex is adjacent to every other vertex.
More informationImplementing Biquad IIR filters with the ASN Filter Designer and the ARM CMSIS DSP software framework
Implementing Biquad IIR filters with the ASN Filter Designer and the ARM CMSIS DSP software framework Application note (ASN-AN05) November 07 (Rev 4) SYNOPSIS Infinite impulse response (IIR) filters are
More informationPerfect Reconstruction FIR Filter Banks and Image Compression
Perfect Reconstruction FIR Filter Banks and Image Compression Description: The main focus of this assignment is to study how two-channel perfect reconstruction FIR filter banks work in image compression
More informationPROGRAM EFFICIENCY & COMPLEXITY ANALYSIS
Lecture 03-04 PROGRAM EFFICIENCY & COMPLEXITY ANALYSIS By: Dr. Zahoor Jan 1 ALGORITHM DEFINITION A finite set of statements that guarantees an optimal solution in finite interval of time 2 GOOD ALGORITHMS?
More informationPC-MATLAB PRIMER. This is intended as a guided tour through PCMATLAB. Type as you go and watch what happens.
PC-MATLAB PRIMER This is intended as a guided tour through PCMATLAB. Type as you go and watch what happens. >> 2*3 ans = 6 PCMATLAB uses several lines for the answer, but I ve edited this to save space.
More informationCHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover
38 CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING Digital image watermarking can be done in both spatial domain and transform domain. In spatial domain the watermark bits directly added to the pixels of the
More informationLab-Report Digital Signal Processing. FIR-Filters. Model of a fixed and floating point convolver
Lab-Report Digital Signal Processing FIR-Filters Model of a fixed and floating point convolver Name: Dirk Becker Course: BEng 2 Group: A Student No.: 9801351 Date: 30/10/1998 1. Contents 1. CONTENTS...
More informationFunctions of Several Variables
Jim Lambers MAT 280 Spring Semester 2009-10 Lecture 2 Notes These notes correspond to Section 11.1 in Stewart and Section 2.1 in Marsden and Tromba. Functions of Several Variables Multi-variable calculus
More informationDUAL TREE COMPLEX WAVELETS Part 1
DUAL TREE COMPLEX WAVELETS Part 1 Signal Processing Group, Dept. of Engineering University of Cambridge, Cambridge CB2 1PZ, UK. ngk@eng.cam.ac.uk www.eng.cam.ac.uk/~ngk February 2005 UNIVERSITY OF CAMBRIDGE
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 informationMATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review.
MATRIX REVIEW PROBLEMS: Our matrix test will be on Friday May 23rd. Here are some problems to help you review. 1. The intersection of two non-parallel planes is a line. Find the equation of the line. Give
More informationOptimum Array Processing
Optimum Array Processing Part IV of Detection, Estimation, and Modulation Theory Harry L. Van Trees WILEY- INTERSCIENCE A JOHN WILEY & SONS, INC., PUBLICATION Preface xix 1 Introduction 1 1.1 Array Processing
More informationChapter 11 Image Processing
Chapter Image Processing Low-level Image Processing Operates directly on a stored image to improve or enhance it. Stored image consists of a two-dimensional array of pixels (picture elements): Origin (0,
More informationLet denote the number of partitions of with at most parts each less than or equal to. By comparing the definitions of and it is clear that ( ) ( )
Calculating exact values of without using recurrence relations This note describes an algorithm for calculating exact values of, the number of partitions of into distinct positive integers each less than
More informationAnswers to Homework 12: Systems of Linear Equations
Math 128A Spring 2002 Handout # 29 Sergey Fomel May 22, 2002 Answers to Homework 12: Systems of Linear Equations 1. (a) A vector norm x has the following properties i. x 0 for all x R n ; x = 0 only if
More informationLecture 12: Algorithmic Strength 2 Reduction in Filters and Transforms Saeid Nooshabadi
Multimedia Systems Lecture 12: Algorithmic Strength 2 Reduction in Filters and Transforms Saeid Nooshabadi Overview Cascading of Fast FIR Filter Algorithms (FFA) Discrete Cosine Transform and Inverse DCT
More informationXI Signal-to-Noise (SNR)
XI Signal-to-Noise (SNR) Lecture notes by Assaf Tal n(t) t. Noise. Characterizing Noise Noise is a random signal that gets added to all of our measurements. In D it looks like this: while in D
More informationAlpha-Rooting Method of Grayscale Image Enhancement in The Quaternion Frequency Domain
Alpha-Rooting Method of Grayscale Image Enhancement in The Quaternion Frequency Domain Artyom M. Grigoryan and Sos S. Agaian February 2017 Department of Electrical and Computer Engineering The University
More informationBinary representation and data
Binary representation and data Loriano Storchi loriano@storchi.org http:://www.storchi.org/ Binary representation of numbers In a positional numbering system given the base this directly defines the number
More informationLecture 3: Convex sets
Lecture 3: Convex sets Rajat Mittal IIT Kanpur We denote the set of real numbers as R. Most of the time we will be working with space R n and its elements will be called vectors. Remember that a subspace
More information3.5 Filtering with the 2D Fourier Transform Basic Low Pass and High Pass Filtering using 2D DFT Other Low Pass Filters
Contents Part I Decomposition and Recovery. Images 1 Filter Banks... 3 1.1 Introduction... 3 1.2 Filter Banks and Multirate Systems... 4 1.2.1 Discrete Fourier Transforms... 5 1.2.2 Modulated Filter Banks...
More informationStatistical Image Compression using Fast Fourier Coefficients
Statistical Image Compression using Fast Fourier Coefficients M. Kanaka Reddy Research Scholar Dept.of Statistics Osmania University Hyderabad-500007 V. V. Haragopal Professor Dept.of Statistics Osmania
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 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 informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationSung-Eui Yoon ( 윤성의 )
CS480: Computer Graphics Curves and Surfaces Sung-Eui Yoon ( 윤성의 ) Course URL: http://jupiter.kaist.ac.kr/~sungeui/cg Today s Topics Surface representations Smooth curves Subdivision 2 Smooth Curves and
More informationA Relationship between the Robust Statistics Theory and Sparse Compressive Sensed Signals Reconstruction
THIS PAPER IS A POSTPRINT OF A PAPER SUBMITTED TO AND ACCEPTED FOR PUBLICATION IN IET SIGNAL PROCESSING AND IS SUBJECT TO INSTITUTION OF ENGINEERING AND TECHNOLOGY COPYRIGHT. THE COPY OF RECORD IS AVAILABLE
More informationCHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT
CHAPTER 9 INPAINTING USING SPARSE REPRESENTATION AND INVERSE DCT 9.1 Introduction In the previous chapters the inpainting was considered as an iterative algorithm. PDE based method uses iterations to converge
More informationEE 301 Lab 1 Introduction to MATLAB
EE 301 Lab 1 Introduction to MATLAB 1 Introduction In this lab you will be introduced to MATLAB and its features and functions that are pertinent to EE 301. This lab is written with the assumption that
More informationFinite Impulse Response (FIR) Filter Design and Analysis
Finite Impulse Response (FIR) Filter Design and Analysis by Orang J Assadi, B. Electronics and Communication Engineering, University of Canberra, Australia, assadij@hotmail.com Abstract: Finite Impulse
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 information