Nonlinear Sampling. 2 Saturation in CCD sensors Dynamic range correction Optical devices High power amplifiers s(-t) Memoryless nonlinear distortion t=n.

Slides:



Advertisements
Similar presentations
Lecture 5 Newton-Raphson Method
Advertisements

L1 sparse reconstruction of sharp point set surfaces
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Bregman Iterative Algorithms for L1 Minimization with
Compressive Sensing IT530, Lecture Notes.
Least squares CS1114
Instructor: Yonina Eldar Teaching Assistant: Tomer Michaeli Spring 2009 Modern Sampling Methods
CSCI 347 / CS 4206: Data Mining Module 07: Implementations Topic 03: Linear Models.
Beyond Nyquist: Compressed Sensing of Analog Signals
Machine Learning Week 2 Lecture 1.
Exact or stable image\signal reconstruction from incomplete information Project guide: Dr. Pradeep Sen UNM (Abq) Submitted by: Nitesh Agarwal IIT Roorkee.
ECE Department Rice University dsp.rice.edu/cs Measurements and Bits: Compressed Sensing meets Information Theory Shriram Sarvotham Dror Baron Richard.
Infinite Horizon Problems
Forecasting JY Le Boudec 1. Contents 1.What is forecasting ? 2.Linear Regression 3.Avoiding Overfitting 4.Differencing 5.ARMA models 6.Sparse ARMA models.
Quantization and compressed sensing Dmitri Minkin.
Modern Sampling Methods Summary of Subspace Priors Spring, 2009.
Chebyshev Estimator Presented by: Orr Srour. References Yonina Eldar, Amir Beck and Marc Teboulle, "A Minimax Chebyshev Estimator for Bounded Error Estimation"
Parametric Inference.
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.
1 EE 616 Computer Aided Analysis of Electronic Networks Lecture 5 Instructor: Dr. J. A. Starzyk, Professor School of EECS Ohio University Athens, OH,
Systems of Non-Linear Equations
Estimation and the Kalman Filter David Johnson. The Mean of a Discrete Distribution “I have more legs than average”
Algorithm Evaluation and Error Analysis class 7 Multiple View Geometry Comp Marc Pollefeys.
Sampling Random Signals. 2 Introduction Types of Priors Subspace priors: Smoothness priors: Stochastic priors:
First semester King Saud University College of Applied studies and Community Service 1301CT.
Compressed Sensing Compressive Sampling
CONTROL of NONLINEAR SYSTEMS with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
Yuan Chen Advisor: Professor Paul Cuff. Introduction Goal: Remove reverberation of far-end input from near –end input by forming an estimation of the.
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.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Cs: compressed sensing
Least-Mean-Square Training of Cluster-Weighted-Modeling National Taiwan University Department of Computer Science and Information Engineering.
EE369C Final Project: Accelerated Flip Angle Sequences Jan 9, 2012 Jason Su.
Phase Retrieval from the Short-Time Fourier Transform
Chapter #5 Pulse Modulation
1 Chapter 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Constrained adaptive sensing Mark A. Davenport Georgia Institute of Technology School of Electrical and Computer Engineering TexPoint fonts used in EMF.
Image Processing Basics. What are images? An image is a 2-d rectilinear array of pixels.
Instructor: Yonina Eldar Teaching Assistant: Tomer Michaeli Spring 2009 Modern Sampling Methods
1 Markov Decision Processes Infinite Horizon Problems Alan Fern * * Based in part on slides by Craig Boutilier and Daniel Weld.
Large Timestep Issues Lecture 12 Alessandra Nardi Thanks to Prof. Sangiovanni, Prof. Newton, Prof. White, Deepak Ramaswamy, Michal Rewienski, and Karen.
EECS 274 Computer Vision Geometric Camera Calibration.
Optical Flow. Distribution of apparent velocities of movement of brightness pattern in an image.
Numerical Analysis. Numerical Analysis or Scientific Computing Concerned with design and analysis of algorithms for solving mathematical problems that.
Sampling and Interpolation
The Unscented Particle Filter 2000/09/29 이 시은. Introduction Filtering –estimate the states(parameters or hidden variable) as a set of observations becomes.
Yonina Eldar Department of Electrical Engineering Technion-Israel Institute of Technology
Searching a Linear Subspace Lecture VI. Deriving Subspaces There are several ways to derive the nullspace matrix (or kernel matrix). ◦ The methodology.
STAR SVT Self Alignment V. Perevoztchikov Brookhaven National Laboratory,USA.
Using Neumann Series to Solve Inverse Problems in Imaging Christopher Kumar Anand.
Jianchao Yang, John Wright, Thomas Huang, Yi Ma CVPR 2008 Image Super-Resolution as Sparse Representation of Raw Image Patches.
Environmental Data Analysis with MatLab 2 nd Edition Lecture 22: Linear Approximations and Non Linear Least Squares.
Geometric Camera Calibration
Computational Optimization
Highly Undersampled 0-norm Reconstruction
Lecture Signals with limited frequency range
Closed-form Algorithms in Hybrid Positioning: Myths and Misconceptions
Basic Algorithms Christina Gallner
Class Notes 18: Numerical Methods (1/2)
Autonomous Cyber-Physical Systems: Dynamical Systems
Towards Understanding the Invertibility of Convolutional Neural Networks Anna C. Gilbert1, Yi Zhang1, Kibok Lee1, Yuting Zhang1, Honglak Lee1,2 1University.
Sampling and Quantization
Rank-Sparsity Incoherence for Matrix Decomposition
CIS 700: “algorithms for Big Data”
MATH 175: Numerical Analysis II
Chapter 11: Stereopsis Stereopsis: Fusing the pictures taken by two cameras and exploiting the difference (or disparity) between them to obtain the depth.
Deblurring Shaken and Partially Saturated Images
Presentation transcript:

Nonlinear Sampling

2 Saturation in CCD sensors Dynamic range correction Optical devices High power amplifiers s(-t) Memoryless nonlinear distortion t=n

3 Easy or Hard? Memoryless nonlinear M, but ideal samples: Easy Standard setup Generalized samples but M=I: Easy Assuming => Oblique projection: Memoryless nonlinear M, generalized samples: Hard but M(A) usually not a subspace …

4 Perfect Reconstruction Setting: m(t) is invertible with bounded derivative y(t) is lies in a subspace A Uniqueness same as in linear case! Proof: Based on extended frame perturbation theory and geometrical ideas If and m(t) is invertible and smooth enough then y(t) can be recovered exactly If and m(t) is invertible and smooth enough then y(t) can be recovered exactly Theorem (uniqueness):

5 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 Optimization Based Approach Under the previous conditions any stationary point of is unique and globally optimal Under the previous conditions any stationary point of is unique and globally optimal Theorem : Only have to trap a stationary point!

6 Transform the problem into a series of linear problems: 1.Initial guess y 0 2.Linearization: Replace m(t) by its derivative around y 0 3.Solve linear problem and update solution y n y n+1 Algorithm: Linearization Algorithm converges to true input error in samples correction solving linear problem

7 Simulation Example Optical sampling system: optical modulator ADC

8 Simulation Initialization with First iteration: Third iteration:

9 Course Summary (So Far …) Crash course on linear algebra Subspace sampling (sampling of nonbandlimited signals, interpolation methods) Minimax recovery techniques Constrained reconstruction: minimax and consistent methods Nonlinear sampling And yet to come … Sampling random signals Sampling sparse signals

10 Summary BandlimitedIdeal point-wiseIdeal interpolation Subspace priors Smoothness priors Sparsity priors General linear sampling Non-linear distortions Minimax approach with simple kernels Signal Model Sampling Reconstruction

11 Our Point-Of-View Sampling can be viewed in a broader sense of projection onto any subspace Can choose the subspaces to yield interesting new possibilities: Below Nyquist sampling of sparse signals Pointwise samples of non bandlimited signals Perfect compensation of nonlinear effects Perfect recovery of non-bandlimited signals after LPF …