CSCI 1290: Comp Photo
|
|
- Ronald McCoy
- 5 years ago
- Views:
Transcription
1 CSCI 1290: Comp Photo Fall Brown University James Tompkin Many slides thanks to James Hays old CS 129 course, along with all of its acknowledgements.
2
3
4 Capture Frequency - Rolling `Shutter James Hays
5 Image Pyramids Project 1 function: vis_hybrid_image.m Wikipedia Image Pyramids
6 Why does a lower resolution image still make sense to us? What information do we lose? Image: Slide: Hoiem
7 Hays Hybrid Images A. Oliva, A. Torralba, P.G. Schyns, Hybrid Images, SIGGRAPH 2006
8 Why do we get different, distance-dependent interpretations of hybrid images?? Slide: Hoiem
9 I understand frequency as in waves but how does this relate to the complex signals we see in natural images? to image frequency?
10 Fourier Series & Fourier Transforms Another way of thinking about frequency
11 Fourier series A bold idea (1807): Any univariate function can be rewritten as a weighted sum of sines and cosines of different frequencies. Jean Baptiste Joseph Fourier ( ) Hays
12 Fourier series A bold idea (1807): Any univariate function can be rewritten as a weighted sum of sines and cosines of different frequencies. Our building block: Asin( t) + B cos( t) Add enough of them to get any signal g(t) you want! Hays
13 Time and Frequency example : g(t) = sin(2pf t) + (1/3)sin(2p(3f) t)
14 Time and Frequency example : g(t) = sin(2pf t) + (1/3)sin(2p(3f) t) = +
15 Frequency Spectra example : g(t) = sin(2pf t) + (1/3)sin(2p(3f) t) = +
16 Square wave spectra
17 Square wave spectra = + =
18 Square wave spectra = + =
19 Square wave spectra = + =
20 Square wave spectra = + =
21 Square wave spectra = + =
22 Coefficient Square wave spectra = 1 A f sin(2πft) f=1
23 Frequency Spectra
24 Jean Baptiste Joseph Fourier ( ) A bold idea (1807): Any univariate function can be rewritten as a weighted sum of sines and cosines of different frequencies. Don t believe it? Neither did Lagrange, Laplace, Poisson and other big wigs Not translated into English until 1878! But it s (mostly) true! Called Fourier Series There are some subtle restrictions...the manner in which the author arrives at these equations is not exempt of difficulties and...his analysis to integrate them still leaves something to be desired on the score of generality and even rigour. Laplace Lagrange Legendre Hays
25 Wikipedia Fourier transform
26 Sine/cosine and circle sin t cos t Wikipedia Unit Circle
27 Square wave (approx.) Mehmet E. Yavuz
28 Sawtooth wave (approx.) Mehmet E. Yavuz
29 One series in each of x and y Generative Art, じゃがりきん, Video, 2018
30 Example: Music We think of music in terms of frequencies at different magnitudes Slide: Hoiem
31 Coefficient Spatial domain Frequency Frequency domain
32 Fourier analysis in images Spatial domain images Fourier decomposition frequency amplitude images More:
33 Signals can be composed Spatial domain images + = Fourier decomposition frequency amplitude images More:
34 Natural image Natural image Fourier decomposition Frequency coefficients (amplitude) What does it mean to be at pixel x,y? What does it mean to be more or less bright in the Fourier decomposition image?
35 Can change spectrum, then reconstruct
36 Low and High Pass filtering
37 Brian Pauw demo Live Fourier decomposition images Using FFT2 function I hacked it a bit for MATLAB
38 Think-Pair-Share Match the spatial domain image to the Fourier magnitude image B A C D E Hoiem
39 Fourier Bases Teases away fast vs. slow changes in the image. Blue = sine Green = cosine This change of basis is the Fourier Transform Hays
40 Basis reconstruction Danny Alexander
41 Fourier Transform Stores the amplitude and phase at each frequency: For mathematical convenience, this is often notated in terms of real and complex numbers Related by Euler s formula Hays
42 Fourier Transform Stores the amplitude and phase at each frequency: For mathematical convenience, this is often notated in terms of real and complex numbers Related by Euler s formula Hays
43 Fourier Transform Stores the amplitude and phase at each frequency: For mathematical convenience, this is often notated in terms of real and complex numbers Related by Euler s formula Amplitude encodes how much signal there is at a particular frequency: A = Re( 2 ) + Im( ) 2 Phase encodes spatial information (indirectly): = tan 1 Im( ) Re( ) Hays
44 Amplitude / Phase Amplitude tells you how much Phase tells you where Translate the image? Amplitude unchanged Adds a constant to the phase. Morse
45 What about phase? Efros
46 What about phase? Amplitude Phase Efros
47 What about phase? Efros
48 What about phase? Amplitude Phase Efros
49 John Brayer, Uni. New Mexico We generally do not display PHASE images because most people who see them shortly thereafter succumb to hallucinogenics or end up in a Tibetan monastery.
50 Think-Pair-Share In Fourier space, where is more of the information that we see in the visual world? Amplitude Phase
51 Cheebra Zebra phase, cheetah amplitude Cheetah phase, zebra amplitude Efros
52 The frequency amplitude of natural images are quite similar Heavy in low frequencies, falling off in high frequencies Will any image be like that, or is it a property of the world we live in? Most information in the image is carried in the phase, not the amplitude Not quite clear why Efros
53 What is the relationship to phase in audio? In audio perception, frequency is important but phase is not. In visual perception, both are important.??? : (
54 Hays Salvador Dali Gala Contemplating the Mediterranean Sea, which at 30 meters becomes the portrait of Abraham Lincoln, 1976
55 Salvador Dali invented Hybrid Images? Salvador Dali Gala Contemplating the Mediterranean Sea, which at 30 meters becomes the portrait of Abraham Lincoln, 1976
56
57 Properties of Fourier Transforms Linearity F[ ax ( t) + by( t)] = a F[ x( t)] + b F[ y( t)] Fourier transform of a real signal is symmetric about the origin The energy of the signal is the same as the energy of its Fourier transform See Szeliski Book (3.4)
58 The Convolution Theorem The Fourier transform of the convolution of two functions is the product of their Fourier transforms F[ g h] = F[ g]f[ h] Convolution in spatial domain is equivalent to multiplication in frequency domain! g * h = F 1 [F[ g]f[ h]] Hays
59 Filtering in spatial domain * = Hays
60 Filtering in frequency domain FFT FFT = Inverse FFT Slide: Hoiem
61 Now we can edit frequencies!
62 Low and High Pass filtering
63 Removing frequency bands Brayer
64 High pass filtering + orientation
65 Low-pass, Band-pass, High-pass filters low-pass: High-pass / band-pass:
66 Application: Hybrid Images When we see an image from far away, we are effectively subsampling it! A. Oliva, A. Torralba, P.G. Schyns, SIGGRAPH 2006
67 Hybrid Image in FFT Hybrid Image Low-passed Image High-passed Image
68 Why does the Gaussian filter give a nice smooth image, but the square filter give edgy artifacts? Hays Gaussian Box filter
69 coefficient Why do we have those lines in the image? Sharp edges in the image need _all_ frequencies to represent them. = A k = 1 1 sin(2 kt ) k Efros
70 Box filter / sinc filter duality Hays What is the spatial representation of the hard cutoff (box) in the frequency domain?
71 Evan Wallace demo Made for CS123 1D example Forbes 30 under 30 Figma (collaborative design tools) with Dylan Field
72 Box filter / sinc filter duality Hays What is the spatial representation of the hard cutoff (box) in the frequency domain? Box filter Sinc filter sinc(x) = sin(x) / x Spatial Domain Frequency Domain Frequency Domain Spatial Domain
73 Box filter (spatial) Frequency domain magnitude
74 Gaussian filter duality Fourier transform of one Gaussian is another Gaussian (with inverse variance). Why is this useful? Smooth degradation in frequency components No sharp cut-off No negative values Never zero (infinite extent) Box filter (spatial) Frequency domain magnitude Gaussian filter (spatial) Frequency domain magnitude
75 Is convolution invertible? If convolution is just multiplication in the Fourier domain, isn t deconvolution just division? Sometimes, it clearly is invertible (e.g. a convolution with an identity filter) In one case, it clearly isn t invertible (e.g. convolution with an all zero filter) What about for common filters like a Gaussian?
76 Convolution * = FFT FFT ifft.x = Hays
77 Deconvolution? ifft FFT FFT =./ Hays
78 But under more realistic conditions Random noise, magnitude ifft FFT FFT =./ Hays
79 But under more realistic conditions Random noise,.0001 magnitude ifft FFT FFT =./ Hays
80 But under more realistic conditions Random noise,.001 magnitude ifft FFT FFT =./ Hays
81 But you can t invert multiplication by 0! A Gaussian is only zero at infinity Hays
82 Deconvolution is hard. Active research area. Even if you know the filter (non-blind deconvolution), it is still hard and requires strong regularization to counteract noise. If you don t know the filter (blind deconvolution), then it is harder still.
83 How would math have changed if the onesie had been invented?!?! : ( Hays
84 A few questions If we have infinite frequencies, why does the image end? Sampling theory. Frequencies higher than Nyquist frequency end up falling on an existing sample. i.e., they are aliases for existing samples! Nyquist frequency is half the sampling frequency. (Nyquist frequency is not Nyquist-Shannon rate, which is sampling required to reconstruct aliasfree signal. Both are derived from same theory.)
85 A few questions Why is frequency decomposition centered in middle, and duplicated and rotated? From Euler: cos(x) + i sin(x) = e ix cos ωt = 1 2 e iωt + e +iωt Coefficients for negative frequencies (i.e., backwards traveling waves) FFT of a real signal is conjugate symmetric i.e., f(-x) = f*(x)
86 A few questions How is the Fourier decomposition computed? Intuitively, by correlating the signal with a set of waves of increasing signal! Notes in hidden slides. Plus:
87 Applications of Fourier analysis Fast filtering with large kernels Fourier Optics Fraunhofer diffraction is Fourier transform of slit in the far field. Light spectrometry for astronomy Circular aperture = Airy disc diffraction pattern Wikipedia for graphics
88 Thinking in Frequency - Compression How is it that a 4MP image can be compressed to a few hundred KB without a noticeable change?
89 Lossy Image Compression (JPEG) 8x8 blocks 8x8 blocks The first coefficient B(0,0) is the DC component, the average intensity The top-left coeffs represent low frequencies, the bottom right represent high frequencies Block-based Discrete Cosine Transform (DCT) Slides: Efros
90 Image compression using DCT Compute DCT filter responses in each 8x8 block Filter responses Quantize to integer (div. by magic number; round) More coarsely for high frequencies (which also tend to have smaller values) Many quantized high frequency values will be zero Quantization divisers (element-wise) Quantized values
91 JPEG Encoding Entropy coding (Huffman-variant) Quantized values Linearize B like this. Helps compression: - We throw away the high frequencies ( 0 ). - The zig zag pattern increases in frequency space, so long runs of zeros.
92 JPEG compression comparison 89k 12k
93 James Hays Color spaces: YCbCr Fast to compute, good for compression, used by TV Y=0 Y=0.5 Y (Cb=0.5,Cr=0.5) Cr Cb Y=1 Cb (Y=0.5,Cr=0.5) Cr (Y=0.5,Cb=05)
94 Most JPEG images & videos subsample chroma
95 JPEG Compression Summary 1. Convert image to YCrCb 2. Subsample color by factor of 2 People have bad resolution for color 3. Split into blocks (8x8, typically), subtract For each block a. Compute DCT coefficients b. Coarsely quantize Many high frequency components will become zero c. Encode (with run length encoding and then Huffman coding for leftovers)
96 Things to Remember Sometimes it makes sense to think of images and filtering in the frequency domain Fourier analysis Can be faster to filter using FFT for large images (N logn vs. N 2 for autocorrelation) Images are mostly smooth Basis for compression Remember to low-pass before sampling
Intelligent Visual Prosthesis
Orientation sensor (IMU) Intelligent Visual Prosthesis Depth image-based obstacle detection Depth camera Wideangle RGB camera Simultaneous object recognition, localization, and hand tracking New projects:
More informationRecap of Monday. Linear filtering. Be aware of details for filter size, extrapolation, cropping
Recap of Monday Linear filtering h[ m, n] k, l f [ k, l] I[ m Not a matrix multiplication Sum over Hadamard product k, n l] Can smooth, sharpen, translate (among many other uses) 1 1 1 1 1 1 1 1 1 Be aware
More informationSlow mo guys Saccades. https://youtu.be/fmg9zohesgq?t=4s
Slow mo guys Saccades https://youtu.be/fmg9zohesgq?t=4s Thinking in Frequency Computer Vision James Hays Slides: Hoiem, Efros, and others Recap of Wednesday Linear filtering is dot product at each position
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt. Session 8- Linear Filters From Spatial Domain to Frequency Domain Mani Golparvar-Fard Department of Civil and Environmental Engineering 329D,
More informationThinking in Frequency
09/05/17 Thinking in Frequency Computational Photography University of Illinois Derek Hoiem Administrative Matlab/linear algebra tutorial tomorrow, planned for 6:30pm Probably 1214 DCL (will send confirmation
More informationThe Frequency Domain, without tears. Many slides borrowed from Steve Seitz
The Frequency Domain, without tears Many slides borrowed from Steve Seitz Somewhere in Cinque Terre, May 2005 CS194: Image Manipulation & Computational Photography Alexei Efros, UC Berkeley, Fall 2016
More informationThe Frequency Domain : Computational Photography Alexei Efros, CMU, Fall Many slides borrowed from Steve Seitz
The Frequency Domain 15-463: Computational Photography Alexei Efros, CMU, Fall 2008 Somewhere in Cinque Terre, May 2005 Many slides borrowed from Steve Seitz Salvador Dali Gala Contemplating the Mediterranean
More informationThe Frequency Domain. Many slides borrowed from Steve Seitz
The Frequency Domain Many slides borrowed from Steve Seitz Somewhere in Cinque Terre, May 2005 15-463: Computational Photography Alexei Efros, CMU, Spring 2010 Salvador Dali Gala Contemplating the Mediterranean
More informationFiltering, Frequency, and Edges
CS450: Introduction to Computer Vision Filtering, Frequency, and Edges Various slides from previous courses by: D.A. Forsyth (Berkeley / UIUC), I. Kokkinos (Ecole Centrale / UCL). S. Lazebnik (UNC / UIUC),
More informationCS 4495 Computer Vision. Frequency and Fourier Transforms. Aaron Bobick School of Interactive Computing. Frequency and Fourier Transform
CS 4495 Computer Vision Frequency and Fourier Transforms Aaron Bobick School of Interactive Computing Administrivia Project 1 is (still) on line get started now! Readings for this week: FP Chapter 4 (which
More informationImage Processing 2. Hakan Bilen University of Edinburgh. Computer Graphics Fall 2017
Image Processing 2 Hakan Bilen University of Edinburgh Computer Graphics Fall 2017 This week What is an image? What is image processing? Point processing Linear (Spatial) filters Frequency domain Deep
More informationImage Filtering, Edges and Image Representation
Image Filtering, Edges and Image Representation Capturing what s important Req reading: Chapter 7, 9 F&P Adelson, Simoncelli and Freeman (handout online) Opt reading: Horn 7 & 8 FP 8 February 19, 8 A nice
More informationFrequency Filtering CSC 767
Frequency Filtering CSC 767 Outline Fourier transform and frequency domain Frequency view of filtering Hybrid images Sampling Slide: Hoiem Why does the Gaussian give a nice smooth image, but the square
More informationWhy does a lower resolution image still make sense to us? What do we lose? Image:
2D FREQUENCY DOMAIN The slides are from several sources through James Hays (Brown); Srinivasa Narasimhan (CMU); Silvio Savarese (U. of Michigan); Bill Freeman and Antonio Torralba (MIT), including their
More informationECE Digital Image Processing and Introduction to Computer Vision. Outline
ECE592-064 Digital mage Processing and ntroduction to Computer Vision Depart. of ECE, NC State University nstructor: Tianfu (Matt) Wu Spring 2017 1. Recap Outline 2. Thinking in the frequency domain Convolution
More informationFourier Transform and Frequency Domain
Fourier Transform and Frequency Domain http://graphics.cs.cmu.edu/courses/15-463 15-463, 15-663, 15-862 Computational Photography Fall 2017, Lecture 6 Course announcements Last call for responses to Doodle
More informationFourier Transform and Frequency Domain
Fourier Transform and Frequency Domain http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 3 (part 2) Overview of today s lecture Some history. Fourier series. Frequency domain. Fourier
More informationImage pyramids and frequency domain
Image pyramids and frequency domain http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2019, Lecture 3 Course announcements Homework 1 will be posted tonight. - Homework 1 is due on February 6
More informationFrequency2: Sampling and Aliasing
CS 4495 Computer Vision Frequency2: Sampling and Aliasing Aaron Bobick School of Interactive Computing Administrivia Project 1 is due tonight. Submit what you have at the deadline. Next problem set stereo
More informationFourier Transform in Image Processing. CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012)
Fourier Transform in Image Processing CS/BIOEN 6640 U of Utah Guido Gerig (slides modified from Marcel Prastawa 2012) Basis Decomposition Write a function as a weighted sum of basis functions f ( x) wibi(
More informationencoding without prediction) (Server) Quantization: Initial Data 0, 1, 2, Quantized Data 0, 1, 2, 3, 4, 8, 16, 32, 64, 128, 256
General Models for Compression / Decompression -they apply to symbols data, text, and to image but not video 1. Simplest model (Lossless ( encoding without prediction) (server) Signal Encode Transmit (client)
More informationAdditional Pointers. Introduction to Computer Vision. Convolution. Area operations: Linear filtering
Additional Pointers Introduction to Computer Vision CS / ECE 181B andout #4 : Available this afternoon Midterm: May 6, 2004 W #2 due tomorrow Ack: Prof. Matthew Turk for the lecture slides. See my ECE
More informationDr. David A. Clifton Group Leader Computational Health Informatics (CHI) Lab Lecturer in Engineering Science, Balliol College
Dr. David A. Clifton Group Leader Computational Health Informatics (CHI) Lab Lecturer in Engineering Science, Balliol College 1. Introduction to Fourier analysis, the Fourier series 2. Sampling and Aliasing
More information6.003: Signals and Systems. Sampling and Quantization
6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =
More informationImages have structure at various scales
Images have structure at various scales Frequency Frequency of a signal is how fast it changes Reflects scale of structure A combination of frequencies 0.1 X + 0.3 X + 0.5 X = Fourier transform Can we
More informationImage Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington
Image Filtering Slides, adapted from Steve Seitz and Rick Szeliski, U.Washington The power of blur All is Vanity by Charles Allen Gillbert (1873-1929) Harmon LD & JuleszB (1973) The recognition of faces.
More informationSYDE 575: Introduction to Image Processing. Image Compression Part 2: Variable-rate compression
SYDE 575: Introduction to Image Processing Image Compression Part 2: Variable-rate compression Variable-rate Compression: Transform-based compression As mentioned earlier, we wish to transform image data
More informationObjective: Reduction of data redundancy. Coding redundancy Interpixel redundancy Psychovisual redundancy Fall LIST 2
Image Compression Objective: Reduction of data redundancy Coding redundancy Interpixel redundancy Psychovisual redundancy 20-Fall LIST 2 Method: Coding Redundancy Variable-Length Coding Interpixel Redundancy
More informationFast Fourier Transform
Fast Fourier Transform December 8, 2016 FFT JPEG RGB Y C B C R (luma (brightness), chroma 2 (color)) chroma resolution is reduced image is split in blocks 8 8 pixels JPEG RGB Y C B C R (luma (brightness),
More informationOverview. Analog capturing device (camera, microphone) PCM encoded or raw signal ( wav, bmp, ) A/D CONVERTER. Compressed bit stream (mp3, jpg, )
Overview Analog capturing device (camera, microphone) Sampling Fine Quantization A/D CONVERTER PCM encoded or raw signal ( wav, bmp, ) Transform Quantizer VLC encoding Compressed bit stream (mp3, jpg,
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on lectures from B. Lee, B. Girod, and A. Mukherjee 1 Outline Digital Signal Representation
More informationESE 250: Digital Audio Basics. Week 4 February 5, The Frequency Domain. ESE Spring'13 DeHon, Kod, Kadric, Wilson-Shah
ESE 250: Digital Audio Basics Week 4 February 5, 2013 The Frequency Domain 1 Course Map 2 Musical Representation With this compact notation Could communicate a sound to pianist Much more compact than 44KHz
More informationKey Intuition: invertibility
Introduction to Fourier Analysis CS 510 Lecture #6 January 30, 2017 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg 2 Fourier Transform Formally, the Fourier
More informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More informationComputer Vision Lecture 3
Computer Vision Lecture 3 Linear Filters 03.11.2015 Bastian Leibe RWTH Aachen http://www.vision.rwth-aachen.de leibe@vision.rwth-aachen.de Demo Haribo Classification Code available on the class website...
More informationIntroduction to Fourier Analysis Part 2. CS 510 Lecture #7 January 31, 2018
Introduction to Fourier Analysis Part 2 CS 510 Lecture #7 January 31, 2018 OpenCV on CS Dept. Machines 2/4/18 CSU CS 510, Ross Beveridge & Bruce Draper 2 In the extreme, a square wave Graphic from http://www.mechatronics.colostate.edu/figures/4-4.jpg
More informationImage Compression. Fundamentals: Coding redundancy. The gray level histogram of an image can reveal a great deal of information about the image
Fundamentals: Coding redundancy The gray level histogram of an image can reveal a great deal of information about the image That probability (frequency) of occurrence of gray level r k is p(r k ), p n
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yaroslavsky. Fundamentals of Digital Image Processing. Course 0555.330 Lec. 6. Principles of image coding The term image coding or image compression refers to processing image digital data aimed at
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More information6.869 Advances in Computer Vision. Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018
6.869 Advances in Computer Vision Bill Freeman, Antonio Torralba and Phillip Isola MIT Oct. 3, 2018 1 Sampling Sampling Pixels Continuous world 3 Sampling 4 Sampling 5 Continuous image f (x, y) Sampling
More informationToday s lecture. The Fourier transform. Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm
Today s lecture The Fourier transform What is it? What is it useful for? What are its properties? Sampling, aliasing, interpolation The Fast Fourier Transform (FFT) algorithm Jean Baptiste Joseph Fourier
More informationLinear Operators and Fourier Transform
Linear Operators and Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 04 Greyscale Image Analysis Lecture 03 Summary Images as 2-D signals
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Filtering in the Frequency Domain http://www.ee.unlv.edu/~b1morris/ecg782/ 2 Outline Background
More informationMultimedia & Computer Visualization. Exercise #5. JPEG compression
dr inż. Jacek Jarnicki, dr inż. Marek Woda Institute of Computer Engineering, Control and Robotics Wroclaw University of Technology {jacek.jarnicki, marek.woda}@pwr.wroc.pl Exercise #5 JPEG compression
More informationImage Data Compression
Image Data Compression Image data compression is important for - image archiving e.g. satellite data - image transmission e.g. web data - multimedia applications e.g. desk-top editing Image data compression
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationTemplates, Image Pyramids, and Filter Banks
Templates, Image Pyramids, and Filter Banks 09/9/ Computer Vision James Hays, Brown Slides: Hoiem and others Review. Match the spatial domain image to the Fourier magnitude image 2 3 4 5 B A C D E Slide:
More informationLecture 4 Filtering in the Frequency Domain. Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016
Lecture 4 Filtering in the Frequency Domain Lin ZHANG, PhD School of Software Engineering Tongji University Spring 2016 Outline Background From Fourier series to Fourier transform Properties of the Fourier
More informationSpatial Vision: Primary Visual Cortex (Chapter 3, part 1)
Spatial Vision: Primary Visual Cortex (Chapter 3, part 1) Lecture 6 Jonathan Pillow Sensation & Perception (PSY 345 / NEU 325) Princeton University, Spring 2015 1 Chapter 2 remnants 2 Receptive field:
More informationMathematics for Chemists 2 Lecture 14: Fourier analysis. Fourier series, Fourier transform, DFT/FFT
Mathematics for Chemists 2 Lecture 14: Fourier analysis Fourier series, Fourier transform, DFT/FFT Johannes Kepler University Summer semester 2012 Lecturer: David Sevilla Fourier analysis 1/25 Remembering
More informationFourier Transforms For additional information, see the classic book The Fourier Transform and its Applications by Ronald N. Bracewell (which is on the shelves of most radio astronomers) and the Wikipedia
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationSubsampling and image pyramids
Subsampling and image pyramids http://www.cs.cmu.edu/~16385/ 16-385 Computer Vision Spring 2018, Lecture 3 Course announcements Homework 0 and homework 1 will be posted tonight. - Homework 0 is not required
More informationIntroduction to Signal Processing
to Signal Processing Davide Bacciu Dipartimento di Informatica Università di Pisa bacciu@di.unipi.it Intelligent Systems for Pattern Recognition Signals = Time series Definitions Motivations A sequence
More informationImage Processing /6.865 Frédo Durand A bunch of slides by Bill Freeman (MIT) & Alyosha Efros (CMU)
Image Processing 6.815/6.865 Frédo Durand A bunch of slides by Bill Freeman (MIT) & Alyosha Efros (CMU) define cumulative histogram work on hist eq proof rearrange Fourier order discuss complex exponentials
More informationToday s lecture. Local neighbourhood processing. The convolution. Removing uncorrelated noise from an image The Fourier transform
Cris Luengo TD396 fall 4 cris@cbuuse Today s lecture Local neighbourhood processing smoothing an image sharpening an image The convolution What is it? What is it useful for? How can I compute it? Removing
More informationSignal Processing COS 323
Signal Processing COS 323 Digital Signals D: functions of space or time e.g., sound 2D: often functions of 2 spatial dimensions e.g. images 3D: functions of 3 spatial dimensions CAT, MRI scans or 2 space,
More informationLecture 3: Linear Filters
Lecture 3: Linear Filters Professor Fei Fei Li Stanford Vision Lab 1 What we will learn today? Images as functions Linear systems (filters) Convolution and correlation Discrete Fourier Transform (DFT)
More informationEE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6)
EE 367 / CS 448I Computational Imaging and Display Notes: Image Deconvolution (lecture 6) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement to the material discussed in
More informationPHYSICS - CLUTCH CH 01: UNITS & VECTORS.
!! www.clutchprep.com Physics is the study of natural phenomena, including LOTS of measurements and equations. Physics = math + rules. UNITS IN PHYSICS We measure in nature. Measurements must have. - For
More informationComputational Photography
Computational Photography Si Lu Spring 208 http://web.cecs.pdx.edu/~lusi/cs50/cs50_computati onal_photography.htm 04/0/208 Last Time o Digital Camera History of Camera Controlling Camera o Photography
More informationFrequency Response and Continuous-time Fourier Series
Frequency Response and Continuous-time Fourier Series Recall course objectives Main Course Objective: Fundamentals of systems/signals interaction (we d like to understand how systems transform or affect
More informationIMAGE COMPRESSION-II. Week IX. 03/6/2003 Image Compression-II 1
IMAGE COMPRESSION-II Week IX 3/6/23 Image Compression-II 1 IMAGE COMPRESSION Data redundancy Self-information and Entropy Error-free and lossy compression Huffman coding Predictive coding Transform coding
More informationFourier Series and Recent Developments in Analysis
Fourier Series and Recent Developments in Analysis Karlstad, June 2003 Javier Soria (U. Barcelona) 1 Jean Baptiste Joseph Fourier (1768-1830) It was around 1804 that Fourier did his important mathematical
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationFourier Transform. sin(n# x)), where! = 2" / L and
Fourier Transform Henning Stahlberg Introduction The tools provided by the Fourier transform are helpful for the analysis of 1D signals (time and frequency (or Fourier) domains), as well as 2D/3D signals
More informationTransform coding - topics. Principle of block-wise transform coding
Transform coding - topics Principle of block-wise transform coding Properties of orthonormal transforms Discrete cosine transform (DCT) Bit allocation for transform Threshold coding Typical coding artifacts
More informationMath 56 Homework 5 Michael Downs
1. (a) Since f(x) = cos(6x) = ei6x 2 + e i6x 2, due to the orthogonality of each e inx, n Z, the only nonzero (complex) fourier coefficients are ˆf 6 and ˆf 6 and they re both 1 2 (which is also seen from
More informationEA2.3 - Electronics 2 1
In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this
More informationCS168: The Modern Algorithmic Toolbox Lecture #11: The Fourier Transform and Convolution
CS168: The Modern Algorithmic Toolbox Lecture #11: The Fourier Transform and Convolution Tim Roughgarden & Gregory Valiant May 8, 2015 1 Intro Thus far, we have seen a number of different approaches to
More informationSource Coding for Compression
Source Coding for Compression Types of data compression: 1. Lossless -. Lossy removes redundancies (reversible) removes less important information (irreversible) Lec 16b.6-1 M1 Lossless Entropy Coding,
More informationWavelets. Lecture 28
Wavelets. Lecture 28 Just like the FFT, the wavelet transform is an operation that can be performed in a fast way. Operating on an input vector representing a sampled signal, it can be viewed, just like
More information3. Lecture. Fourier Transformation Sampling
3. Lecture Fourier Transformation Sampling Some slides taken from Digital Image Processing: An Algorithmic Introduction using Java, Wilhelm Burger and Mark James Burge Separability ² The 2D DFT can be
More informationrepetition, part ii Ole-Johan Skrede INF Digital Image Processing
repetition, part ii Ole-Johan Skrede 24.05.2017 INF2310 - Digital Image Processing Department of Informatics The Faculty of Mathematics and Natural Sciences University of Oslo today s lecture Coding and
More informationChapter 17: Fourier Series
Section A Introduction to Fourier Series By the end of this section you will be able to recognise periodic functions sketch periodic functions determine the period of the given function Why are Fourier
More informationMITOCW MITRES_6-007S11lec09_300k.mp4
MITOCW MITRES_6-007S11lec09_300k.mp4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for
More informationECG782: Multidimensional Digital Signal Processing
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu ECG782: Multidimensional Digital Signal Processing Spring 2014 TTh 14:30-15:45 CBC C313 Lecture 05 Image Processing Basics 13/02/04 http://www.ee.unlv.edu/~b1morris/ecg782/
More informationGBS765 Electron microscopy
GBS765 Electron microscopy Lecture 1 Waves and Fourier transforms 10/14/14 9:05 AM Some fundamental concepts: Periodicity! If there is some a, for a function f(x), such that f(x) = f(x + na) then function
More informationCompressing a 1D Discrete Signal
Compressing a D Discrete Signal Divide the signal into 8blocks. Subtract the sample mean from each value. Compute the 8 8covariancematrixforthe blocks. Compute the eigenvectors of the covariance matrix.
More informationDiscrete Fourier Transform
Discrete Fourier Transform DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 13, 2013 Mårten Björkman
More informationSequences and Series
Sequences and Series What do you think of when you read the title of our next unit? In case your answers are leading us off track, let's review the following IB problems. 1 November 2013 HL 2 3 November
More informationVisual features: From Fourier to Gabor
Visual features: From Fourier to Gabor Deep Learning Summer School 2015, Montreal Hubel and Wiesel, 1959 from: Natural Image Statistics (Hyvarinen, Hurri, Hoyer; 2009) Alexnet ICA from: Natural Image Statistics
More informationWavelet Analysis of Print Defects
Wavelet Analysis of Print Defects Kevin D. Donohue, Chengwu Cui, and M.Vijay Venkatesh University of Kentucky, Lexington, Kentucky Lexmark International Inc., Lexington, Kentucky Abstract This paper examines
More informationIntroduction to the Mathematics of Medical Imaging
Introduction to the Mathematics of Medical Imaging Second Edition Charles L. Epstein University of Pennsylvania Philadelphia, Pennsylvania EiaJTL Society for Industrial and Applied Mathematics Philadelphia
More information(Refer Slide Time: 01:30)
Networks and Systems Prof V.G K.Murti Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 11 Fourier Series (5) Continuing our discussion of Fourier series today, we will
More informationCS 3710: Visual Recognition Describing Images with Features. Adriana Kovashka Department of Computer Science January 8, 2015
CS 3710: Visual Recognition Describing Images with Features Adriana Kovashka Department of Computer Science January 8, 2015 Plan for Today Presentation assignments + schedule changes Image filtering Feature
More informationObjectives List. Important Students should expect test questions that require a synthesis of these objectives.
MATH 1040 - of One Variable, Part I Textbook 1: : Algebra and Trigonometry for ET. 4 th edition by Brent, Muller Textbook 2:. Early Transcendentals, 3 rd edition by Briggs, Cochran, Gillett, Schulz s List
More informationReview of Linear Systems Theory
Review of Linear Systems Theory The following is a (very) brief review of linear systems theory, convolution, and Fourier analysis. I work primarily with discrete signals, but each result developed in
More informationFourier Matching. CS 510 Lecture #7 February 8 th, 2013
Fourier Matching CS 510 Lecture #7 February 8 th, 2013 Details are on the assignments page you have un4l Monday Programming Assignment #1 Source (Target) Images Templates Le4 Eye Right Eye Le4 Ear Nose
More informationInverse Problems in Image Processing
H D Inverse Problems in Image Processing Ramesh Neelamani (Neelsh) Committee: Profs. R. Baraniuk, R. Nowak, M. Orchard, S. Cox June 2003 Inverse Problems Data estimation from inadequate/noisy observations
More informationGeometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces
Geometric Modeling Summer Semester 2012 Linear Algebra & Function Spaces (Recap) Announcement Room change: On Thursday, April 26th, room 024 is occupied. The lecture will be moved to room 021, E1 4 (the
More informationThe Australia Telescope. The Australia Telescope National Facility. Why is it a National Facility? Who uses the AT? Ray Norris CSIRO ATNF
The Australia Telescope National Facility The Australia Telescope Ray Norris CSIRO ATNF Why is it a National Facility? Funded by the federal government (through CSIRO) Provides radio-astronomical facilities
More informationSignal Processing With Wavelets
Signal Processing With Wavelets JAMES MONK Niels Bohr Institute, University of Copenhagen. Self-Similarity Benoît B.* Mandlebrot: Clouds are not spheres, mountains are not cones, coastlines are not circles,
More informationMath Practice Exam 3 - solutions
Math 181 - Practice Exam 3 - solutions Problem 1 Consider the function h(x) = (9x 2 33x 25)e 3x+1. a) Find h (x). b) Find all values of x where h (x) is zero ( critical values ). c) Using the sign pattern
More informationName: INSERT YOUR NAME HERE. Due to dropbox by 6pm PDT, Wednesday, December 14, 2011
AMath 584 Name: INSERT YOUR NAME HERE Take-home Final UWNetID: INSERT YOUR NETID Due to dropbox by 6pm PDT, Wednesday, December 14, 2011 The main part of the assignment (Problems 1 3) is worth 80 points.
More informationECE Digital Image Processing and Introduction to Computer Vision
ECE592-064 Digital Image Processing and Introduction to Computer Vision Depart. of ECE, NC State University Instructor: Tianfu (Matt) Wu Spring 2017 Outline Recap, image degradation / restoration Template
More informationIntroduction to Fourier Analysis. CS 510 Lecture #5 February 2 nd 2015
Introduction to Fourier Analysis CS 510 Lecture 5 February 2 nd 2015 Why? Get used to changing representa6ons! (and this par6cular transforma6on is ubiquitous and important) 2/9/15 CSU CS 510, Ross Beveridge
More informationFourier Series & The Fourier Transform
Fourier Series & The Fourier Transform What is the Fourier Transform? Anharmonic Waves Fourier Cosine Series for even functions Fourier Sine Series for odd functions The continuous limit: the Fourier transform
More information