Algorithm For Image Flow Extraction- Using The Frequency Domain

Slides:



Advertisements
Similar presentations
Image Processing IB Paper 8 – Part A Ognjen Arandjelović Ognjen Arandjelović
Advertisements

ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The Linear Prediction Model The Autocorrelation Method Levinson and Durbin.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
Sampling theory Fourier theory made easy
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
嵌入式視覺 Feature Extraction
Medical Image Analysis Image Formation Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Computer Vision Lecture 16: Texture
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
CSCE 641 Computer Graphics: Image Sampling and Reconstruction Jinxiang Chai.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
Texture Reading: Chapter 9 (skip 9.4) Key issue: How do we represent texture? Topics: –Texture segmentation –Texture-based matching –Texture synthesis.
Motion Computing in Image Analysis
Linear View Synthesis Using a Dimensionality Gap Light Field Prior
2D Fourier Theory for Image Analysis Mani Thomas CISC 489/689.
Optical Flow Digital Photography CSE558, Spring 2003 Richard Szeliski (notes cribbed from P. Anandan)
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
02/12/02 (c) 2002 University of Wisconsin, CS 559 Filters A filter is something that attenuates or enhances particular frequencies Easiest to visualize.
Linear Algebra and Image Processing
G52IIP, School of Computer Science, University of Nottingham 1 Image Transforms Fourier Transform Basic idea.
Antialiasing CptS 548 Advanced Computer Graphics John C. Hart.
Introduction to Image Processing Grass Sky Tree ? ? Review.
Chapter 2. Image Analysis. Image Analysis Domains Frequency Domain Spatial Domain.
Characterizing activity in video shots based on salient points Nicolas Moënne-Loccoz Viper group Computer vision & multimedia laboratory University of.
Optical Flow Donald Tanguay June 12, Outline Description of optical flow General techniques Specific methods –Horn and Schunck (regularization)
Transforms. 5*sin (2  4t) Amplitude = 5 Frequency = 4 Hz seconds A sine wave.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
09/19/2002 (C) University of Wisconsin 2002, CS 559 Last Time Color Quantization Dithering.
Lecture 7: Sampling Review of 2D Fourier Theory We view f(x,y) as a linear combination of complex exponentials that represent plane waves. F(u,v) describes.
1 University of Texas at Austin Machine Learning Group 图像与视频处理 计算机学院 Motion Detection and Estimation.
1 Computational Vision CSCI 363, Fall 2012 Lecture 21 Motion II.
Advances in digital image compression techniques Guojun Lu, Computer Communications, Vol. 16, No. 4, Apr, 1993, pp
Joint Tracking of Features and Edges STAN BIRCHFIELD AND SHRINIVAS PUNDLIK CLEMSON UNIVERSITY ABSTRACT LUCAS-KANADE AND HORN-SCHUNCK JOINT TRACKING OF.
1 Computational Vision CSCI 363, Fall 2012 Lecture 24 Computing Motion.
Autonomous Robots Vision © Manfred Huber 2014.
Segmentation of Vehicles in Traffic Video Tun-Yu Chiang Wilson Lau.
1 CMPB 345: IMAGE PROCESSING DISCRETE TRANSFORM 2.
Motion Estimation using Markov Random Fields Hrvoje Bogunović Image Processing Group Faculty of Electrical Engineering and Computing University of Zagreb.
Introduction Performance of metric learning is heavily dependent on features extracted Sensitive to Performance of Filters used Need to be robust to changes.
Fourier Transform.
Chapter 4. Fourier Transformation and data processing:
Computational Vision CSCI 363, Fall 2012 Lecture 22 Motion III
Representing Moving Images with Layers J. Y. Wang and E. H. Adelson MIT Media Lab.
Motion Estimation Multimedia Systems and Standards S2 IF Telkom University.
Performance Issues in Doppler Ultrasound 1. 2 Fundamental Tradeoffs In pulsed modes (PW and color), maximum velocity without aliasing is In pulsed modes,
MOTION Model. Road Map Motion Model Non Parametric Motion Field : Algorithms 1.Optical flow field estimation. 2.Block based motion estimation. 3.Pel –recursive.
Fourier transform.
Convolution.
Jean Baptiste Joseph Fourier
- photometric aspects of image formation gray level images
Paper – Stephen Se, David Lowe, Jim Little
Image Enhancement in the
(C) 2002 University of Wisconsin, CS 559
Convolution.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
All about convolution.
Computer Vision Lecture 16: Texture II
Lecture 35 Wave spectrum Fourier series Fourier analysis
CSCE 643 Computer Vision: Image Sampling and Filtering
Convolution.
Volume 21, Issue 19, Pages (October 2011)
Convolution.
Image and Video Processing
Fourier Transform of Boundaries
Lecture 4 Image Enhancement in Frequency Domain
Convolution.
Convolution.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Algorithm For Image Flow Extraction- Using The Frequency Domain

Image flow extraction what it is good for ? • early-warning systems • tracking & reconstructing • egomotion • visual segmentation • super resolution

Several methods: • differential based • region matching based • phase based • frequency based - spatiotemporal filtering

Motion in the frequency domain • the power spectrum of translating texture at velocity v = ( u,v) occupies a tilted plane in the frequency domain t = ux + vy • motion-sensitive gabor energy filters sample these planes efficiently Wt = UWx + VWy

3D Gabor Energy Filters • a Gausssian multiplied by sine wave or cosine wave (BPF) • (t0 x0 y0) - the center frequency, maximum filter output • maximum filter output for translating texture with spatial frequency (x0 y0) and such velocity v = ( u,v ) that the temporal frequency is t = ux0 + vy0 = t0

• a family of filters : 12 filters with same bandwith, (x02 + y02)0 • a family of filters : 12 filters with same bandwith, (x02 + y02)0.5= const, but different spatial and temporal frequencies • each velocity corresponds to different tilt of the plane thus to different distribution of filters outputs

The algorithm gaussian pyramid HPF Image sequence gabor filtering motion energy convolution measured energy theoretical energy pattern flow Pattern flow

Gaussian Pyramid • level L : sample density reduction by 2L & convolution with gaussian of size (2L+2 -3)x (2L+2 -3) • sample reduction- expands image spectrum • convolution- lower levels higher frequencies enhancement, higher levels lower frequencies enhancement • high level-high velocity, low level-low velocity (t = ux) 0-1.25 level 0 1.25-2.25 level 1 2.25-5 level 2

FFT of image FFT of pyramided image

HPF Filtering • image motion characterized by changes • changes-higher frequencies, enhance changes by HPF FFT

Gabor Filtering • filtering with 12 gabor sine phase filters & 12 gabor cosine phase filters

Motion Energy • the sum of the squared output of sine phase filter plus the squared output of sine phase filter • measure of Gabor energy that is invariant to the phase of the signal

Convolution with Gaussian • gabor filters are localized both in space-time and frequency domains, thus the motion energy is also localized • convolution with gaussian - enhancing center values (most reliable) decreasing far away from center values (least reliable)

Measured Energy • convolution with gaussian (25x25x7) divide the image into 25x25 sized segments, each of one can move in a different velocity • the center value in the convulved motion energy segment is the energy caused by a moving object in that segment

Theoretical Energy • Parseval’s theorem is used to derive equation that predicts the energy of gabor filter in response to moving texture , Ri(u,v)

Pattren Flow • for each moving object : 12 measured energies & 12 predicted energies • least squares estimate for u and v minimizes the difference between the predicted and measured energies • minimizing : Gauss-Newton method ...

Results • accurate for textures in motion containing spatiotemporal frequencies near the center frequencies

pattern flow moving gaussians

Car moving at velocity (2,-0 Car moving at velocity (2,-0.2) pixel per frame, the algorithm result (1.93,-0.16)

The End Future Improvements • adaptive center frequencies choosing • combining pyramid levels • substitute gaussian convolution with different method - e.g relaxation labeling • different numerical methods for minimization • DSP realization The End