Adaptive autocalibration of unknown transducer positions in time reversal imaging Raghuram Rangarajan EE Systems University Of Michigan, Ann Arbor.

Slides:



Advertisements
Similar presentations
Object Specific Compressed Sensing by minimizing a weighted L2-norm A. Mahalanobis.
Advertisements

1 12. Principles of Parameter Estimation The purpose of this lecture is to illustrate the usefulness of the various concepts introduced and studied in.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Newton’s Method Application to LMS Recursive Least Squares Exponentially-Weighted.
Alternatives to Spherical Microphone arrays: Hybrid Geometries Aastha Gupta & Prof. Thushara Abhayapala Applied Signal Processing CECS To be presented.
Estimating Surface Normals in Noisy Point Cloud Data Niloy J. Mitra, An Nguyen Stanford University.
GG 313 Geological Data Analysis # 18 On Kilo Moana at sea October 25, 2005 Orthogonal Regression: Major axis and RMA Regression.
Linear Regression  Using a linear function to interpolate the training set  The most popular criterion: Least squares approach  Given the training set:
Uncalibrated Geometry & Stratification Sastry and Yang
MAE 552 Heuristic Optimization
COMP322/S2000/L23/L24/L251 Camera Calibration The most general case is that we have no knowledge of the camera parameters, i.e., its orientation, position,
Camera Calibration CS485/685 Computer Vision Prof. Bebis.
COMP 290 Computer Vision - Spring Motion II - Estimation of Motion field / 3-D construction from motion Yongjik Kim.
Estimation 8.
Why Function Optimization ?
Lecture 17 Interaction Plots Simple Linear Regression (Chapter ) Homework 4 due Friday. JMP instructions for question are actually for.
QUASI MAXIMUM LIKELIHOOD BLIND DECONVOLUTION QUASI MAXIMUM LIKELIHOOD BLIND DECONVOLUTION Alexander Bronstein.
Despeckle Filtering in Medical Ultrasound Imaging
Adaptive Signal Processing
Normalised Least Mean-Square Adaptive Filtering
Computational Geophysics and Data Analysis
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
Linear Recurrence Relations in Music By Chris Hall.
Introduction to Adaptive Digital Filters Algorithms
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Introduction SNR Gain Patterns Beam Steering Shading Resources: Wiki:
Natural Gradient Works Efficiently in Learning S Amari (Fri) Computational Modeling of Intelligence Summarized by Joon Shik Kim.
CHAPTER 4 S TOCHASTIC A PPROXIMATION FOR R OOT F INDING IN N ONLINEAR M ODELS Organization of chapter in ISSO –Introduction and potpourri of examples Sample.
Outline What Neural Networks are and why they are desirable Historical background Applications Strengths neural networks and advantages Status N.N and.
“A fast method for Underdetermined Sparse Component Analysis (SCA) based on Iterative Detection- Estimation (IDE)” Arash Ali-Amini 1 Massoud BABAIE-ZADEH.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
1 Lecture 3: March 6, 2007 Topic: 1. Frequency-Sampling Methods (Part I)
Review of Ultrasonic Imaging
AGC DSP AGC DSP Professor A G Constantinides©1 Hilbert Spaces Linear Transformations and Least Squares: Hilbert Spaces.
December 9, 2014Computer Vision Lecture 23: Motion Analysis 1 Now we will talk about… Motion Analysis.
Learning Theory Reza Shadmehr LMS with Newton-Raphson, weighted least squares, choice of loss function.
Solution of the Inverse Problem for Gravitational Wave Bursts Massimo Tinto JPL/CIT LIGO Seminar, October 12, 2004 Y. Gursel & M. Tinto, Phys. Rev. D,
Image Denoising Using Wavelets
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
Computational Time-reversal Imaging
LEAST MEAN-SQUARE (LMS) ADAPTIVE FILTERING. Steepest Descent The update rule for SD is where or SD is a deterministic algorithm, in the sense that p and.
CHAPTER 5 SIGNAL SPACE ANALYSIS
1 Value of information – SITEX Data analysis Shubha Kadambe (310) Information Sciences Laboratory HRL Labs 3011 Malibu Canyon.
A Semi-Blind Technique for MIMO Channel Matrix Estimation Aditya Jagannatham and Bhaskar D. Rao The proposed algorithm performs well compared to its training.
1 EEE 431 Computational Methods in Electrodynamics Lecture 18 By Dr. Rasime Uyguroglu
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Classification Course web page: vision.cis.udel.edu/~cv May 14, 2003  Lecture 34.
METHOD OF STEEPEST DESCENT ELE Adaptive Signal Processing1 Week 5.
EE 551/451, Fall, 2006 Communication Systems Zhu Han Department of Electrical and Computer Engineering Class 15 Oct. 10 th, 2006.
Extremum seeking without external dithering and its application to plasma RF heating on FTU University of Rome “Tor Vergata” Luca Zaccarian, Daniele Carnevale,
Performance Issues in Doppler Ultrasound 1. 2 Fundamental Tradeoffs In pulsed modes (PW and color), maximum velocity without aliasing is In pulsed modes,
Performance of Digital Communications System
Camera Calibration Course web page: vision.cis.udel.edu/cv March 24, 2003  Lecture 17.
Polarization of Radio Telescopes Larry D'Addario 2008 Mar 14.
Lecture 16: Image alignment
UPB / ETTI O.DROSU Electrical Engineering 2
ELEC 401 MICROWAVE ELECTRONICS Lecture 2
Channel Equalization Techniques
Inter Class MLLR for Speaker Adaptation
LECTURE 07: TIME-DELAY ESTIMATION AND ADPCM
Dynamical Statistical Shape Priors for Level Set Based Tracking
Fundamentals Data.
ELEC 401 MICROWAVE ELECTRONICS Lecture 2
Solve the differential equation. {image}
Ch2: Adaline and Madaline
Instructor :Dr. Aamer Iqbal Bhatti
Chapter 5. The Duality Theorem
Linear Prediction.
Learning Theory Reza Shadmehr
A Direct Numerical Imaging Method for Point and Extended Targets
CIS 700: “algorithms for Big Data”
Mathematical Foundations of BME
Presentation transcript:

Adaptive autocalibration of unknown transducer positions in time reversal imaging Raghuram Rangarajan EE Systems University Of Michigan, Ann Arbor

Concept of time reversal Equation invariant under time reversal i.e., if P(r,t) satisfies the above equation, so does P(r,-t) ! P(r, t) wave coming from the source ; P(r,-t) wave focusing on the source Usefulness ?

Focusing at arbitrary location Three step process Transmit time varying signals to illuminate region of interest. Record backscattered field from the medium (say has a point reflector ). Time reverse and retransmit to refocus on desired location. Think of it as a matched filter representation.

Outline of current research work Analyze performance of time reversal method (TRM) for imaging unknown scattering environments. Illuminate specific voxels ( specific locations ) and extract scattering coefficients ( a measure of reflectivity ) – detect targets. Find CRBs to explore advantages of TRM over conventional methods. Study performance in the presence of transducer noise and unknown transducer position

Main focus of this project Auto calibration algorithm to calibrate unknown sensor positions TRM and conventional beam forming methods. Compare estimates with CR lower bound. Simultaneous estimation – A possibility voxel scattering coefficient unknown sensor positions

Solution Let unknown antenna location be r a. Cost function Q(r) argmin Q(r) = r a Basic Idea To focus on voxel v, use projection operator  yv. So to create a null at voxel v, take any operator orthogonal to  yv.

Solution (contd.) To focus on v, find p v to minimize the norm of ( H y T p v * - e v ) e v has 1 in the v th position and zero otherwise. H y is the Green’s function. To get a null on v, find p v to minimize the norm of ( H y T p v * - [s 0 t ] T ) where s and t is our choice.

Solution (contd.) Two reasonably good choices. The choices might not be optimal. [s 0 t ] = (1 – e v ) [s 0 t ] = (e v’ ) for any v’ (see its advantage later.)

Some simple equations Cost function Q(r)=|H T ya  * yv (r)H * y D * H H y  yv (r)z * | 2 Gradient descent algorithm r k+1 = r k -  r r Q(r k ) r Q(r k ) is obtained directly by differentiating the above equation

Plots

Problems  needs to be carefully chosen. Good initial estimate. Reasonable Assumption. Problems of local minima(very likely). Solution ?

Momentum Filter      

More Preliminary Results Comparison with CRB Setting Set of antennas and voxels. Assume one coordinate of an antenna is unknown. SNR=10dB. Run over all initial positions in a region R (in the vicinity of other antennas ) and varying noise. Focus on some voxel v’

Contd. CRB = 4.54 Exact Location = 180 Sample Average = Average Error = 4.2 Increase region R, increase in error

Future work Compare estimators with the CRB. Comparing estimates from TRM with conventional beam forming methods. Interesting idea Use focusing on voxel v’ to calibrate antenna position and estimate scattering coefficient simultaneously. That would be great !

Questions