Modern Sampling Methods Summary of Subspace Priors Spring, 2009.

Slides:



Advertisements
Similar presentations
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Advertisements

Compressive Sensing IT530, Lecture Notes.
Instructor: Yonina Eldar Teaching Assistant: Tomer Michaeli Spring 2009 Modern Sampling Methods
Compressive Sampling (of Analog Signals) Moshe Mishali Yonina C. Eldar Technion – Israel Institute of Technology
Beyond Nyquist: Compressed Sensing of Analog Signals
Tomographic Approach for Sampling Multidimensional Signals with Finite Rate of Innovation Pancham Shukla and Pier Luigi Dragotti Communications and Signal.
Chapter 5 Orthogonality
Chebyshev Estimator Presented by: Orr Srour. References Yonina Eldar, Amir Beck and Marc Teboulle, "A Minimax Chebyshev Estimator for Bounded Error Estimation"
Immagini e filtri lineari. Image Filtering Modifying the pixels in an image based on some function of a local neighborhood of the pixels
lecture 5, Sampling and the Nyquist Condition Sampling Outline  FT of comb function  Sampling Nyquist Condition  sinc interpolation Truncation.
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Overview of Sampling Theory
Combining Laser Scans Yong Joo Kil 1, Boris Mederos 2, and Nina Amenta 1 1 Department of Computer Science, University of California at Davis 2 Instituto.
Nonlinear Sampling. 2 Saturation in CCD sensors Dynamic range correction Optical devices High power amplifiers s(-t) Memoryless nonlinear distortion t=n.
CPSC 641 Computer Graphics: Fourier Transform Jinxiang Chai.
Fourier Theory and its Application to Vision
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Sampling Random Signals. 2 Introduction Types of Priors Subspace priors: Smoothness priors: Stochastic priors:
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
Application of Digital Signal Processing in Computed tomography (CT)
Systems: Definition Filter
Compressed Sensing Compressive Sampling
Computational Geophysics and Data Analysis
Linear Algebra and Image Processing
Unitary Extension Principle: Ten Years After Zuowei Shen Department of Mathematics National University of Singapore.
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
11 Lecture Slides ME 3222 Kinematics and Control Lab Lab 2 AD DA and Sampling Theory By Dr. Debao Zhou.
Computer Vision Spring ,-685 Instructor: S. Narasimhan Wean 5403 T-R 3:00pm – 4:20pm.
Chapter 4: Sampling of Continuous-Time Signals
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Echivalarea sistemelor analogice cu sisteme digitale Prof.dr.ing. Ioan NAFORNITA.
© Chun-Fa Chang Sampling Theorem & Antialiasing. © Chun-Fa Chang Motivations “ My ray traced images have a lot more pixels than the TV screen. Why do.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Fourier representation for discrete-time signals And Sampling Theorem
Lecture 41 Practical sampling and reconstruction.
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission ( ) Wiener Filtering Derivation Comments Re-sampling and Re-sizing 1D  2D 10/5/06.
DTFT And Fourier Transform
1 Orthonormal Wavelets with Simple Closed-Form Expressions G. G. Walter and J. Zhang IEEE Trans. Signal Processing, vol. 46, No. 8, August 王隆仁.
Cs: compressed sensing
Image Enhancement in the Frequency Domain Spring 2006, Jen-Chang Liu.
111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
lecture 4, Convolution and Fourier Convolution Convolution Fourier Convolution Outline  Review linear imaging model  Instrument response function.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Fourier Analysis of Discrete Time Signals
Instructor: Yonina Eldar Teaching Assistant: Tomer Michaeli Spring 2009 Modern Sampling Methods
Leo Lam © Signals and Systems EE235 Leo Lam.
Lecture 7 Transformations in frequency domain 1.Basic steps in frequency domain transformation 2.Fourier transformation theory in 1-D.
Sampling and Interpolation
2D Sampling Goal: Represent a 2D function by a finite set of points.
Sampling Theorem & Antialiasing
DTFT continue (c.f. Shenoi, 2006)  We have introduced DTFT and showed some of its properties. We will investigate them in more detail by showing the associated.
Continuous-time Signal Sampling
Yonina Eldar Department of Electrical Engineering Technion-Israel Institute of Technology
1.Be able to distinguish linear and non-linear systems. 2.Be able to distinguish space-invariant from space-varying systems. 3.Describe and evaluate convolution.
Advanced Computer Graphics
Echivalarea sistemelor analogice cu sisteme digitale
Sampling and Quantization
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
Lecture Signals with limited frequency range
Zhongguo Liu Biomedical Engineering
Summary.
Outline Linear Shift-invariant system Linear filters
Compressive Sensing Imaging
Sampling and the Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
Digital Signal Processing
Generalized Sampling Methods
Presentation transcript:

Modern Sampling Methods Summary of Subspace Priors Spring, 2009

2 Outline BandlimitedIdeal point-wiseIdeal interpolation Subspace priors Smoothness priors Sparsity priors Linear Sampling Nonlinear distortions Minimax approach with simple kernels Dense grid recovery Signal Model Sampling Reconstruction

3 Back to Shannon Any bandlimited signal is spanned by the sinc function: The functions are orthonormal The dual is again so

4 Shift Invariant Spaces A subspace that can be expressed as shifts of : In general is not equal to samples of Examples: Bandlimited functions Spline spaces central B-spline and

5 Fourier Transforms All manipulations in SI spaces can be carried out in Fourier domain! Continuous time FT: Discrete time FT: - periodic DTFT of sampled sequence : If is used to create : Riesz basis condition for :

6 Correlation Sequences Samples can be written as In the Fourier domain: The set is orthonormal if In the Fourier domain samples

7 Generalized anti- aliasing filter Non-Pointwise Linear Sampling Sampling functions Electrical circuit Local averaging In the sequel: Sampling space:

8 Outline BandlimitedIdeal point-wiseIdeal interpolation Subspace priors Smoothness priors Sparsity priors  Non-linear distortions  Minimax approach with simple kernels Signal Model Sampling Reconstruction

9 Perfect Reconstruction Key observation: Given which signals can be perfectly reconstructed? Same samples Thus, for perfect reconstruction is possible by: Bandlimited sampling (Shannon theory) is a special case ! sampling space Knowing is equivalent to knowing (* if is a Riesz basis or frame) 1

10 Some Math The dual basis is defined by If then where In the Fourier domain

11 What if lies in a subspace where is generated by ? If then PR impossible since If then PR possible Mismatched Sampling Perfect Reconstruction in a Subspace

12 Some Math Sampling: After correlation filter: we get back From we can reconstruct

13 Geometric Interpretation When and is general: In both cases we have projections onto the signal space !

14 Example: Pointwise Sampling corresponding to Input signal not necessarily bandlimited Recovery possible as long as or Nonbandlimited functions can be recovered from pointwise samples!

15 Example: Bandlimited sampling Can be recovered even though it is not bandlimited? YES ! 1. Compute convolutional inverse of 2. Convolve the samples with 3. Reconstruct with

16 Outline BandlimitedIdeal point-wiseIdeal interpolation Subspace priors Smoothness priors Sparsity priors Non-linear distortions  Minimax approach with simple kernels Signal Model Sampling Reconstruction

17 Nonlinear Sampling Saturation in CCD sensors Dynamic range correction Optical devices High power amplifiers Memoryless Nonlinear distortion Not a subspace ! T. G. Dvorkind, Y. C. Eldar and E. Matusiak, "Nonlinear and Non-Ideal Sampling: Theory and Methods", IEEE Trans. on Signal Processing, vol. 56, no. 12, pp , Dec Nonlinear and Non-Ideal Sampling: Theory and Methods

18 Perfect Reconstruction Setting: is invertible with bounded derivative lies in a subspace Uniqueness same as in linear case! Proof: Based on extended frame perturbation theory and geometrical ideas ( Dvorkind, Eldar, Matusiak 07) Theorem (uniqueness):

19 Main idea: 1. Minimize error in samples where 2. From uniqueness if Perfect reconstruction global minimum of Difficulties: 1. Nonlinear, nonconvex problem 2. Defined over an infinite space ( Dvorkind, Eldar, Matusiak 07) Theorem : Only have to trap a stationary point!

20 Algorithm converges to true input ! 1.Initial guess 2.Linearization: Replace by its derivative around 3.Solve linear problem and update solution Algorithm: Linearization

21 Example I

22 Simulation

23 Example II Optical sampling system: optical modulator ADC

24 Simulation First iteration: Third iteration: Initialization with

25 Summary: Subspace Priors Perfect Recovery In A Subspace General input signals (not necessarily BL) General samples (anti-aliasing filters), nonlinear samples Results hold also for nonuniform sampling and more general spaces Being bandlimited is not important for recovery Y. C. Eldar and T. Michaeli, "Beyond Bandlimited Sampling", IEEE Signal Proc. Magazine, vol. 26, no. 3, pp , May 2009.