Dr. Jacob Barhen Computer Science and Mathematics Division.

Slides:



Advertisements
Similar presentations
(t,x) domain, pattern-based ground roll removal Morgan P. Brown* and Robert G. Clapp Stanford Exploration Project Stanford University.
Advertisements

Computer Science Dr. Peng NingCSC 774 Adv. Net. Security1 CSC 774 Advanced Network Security Topic 7.3 Secure and Resilient Location Discovery in Wireless.
Motivation Spectroscopy is most important analysis tool in all natural sciences Astrophysics, chemical/material sciences, biomedicine, geophysics,… Industry.
PACE: An Autofocus Algorithm For SAR
Applied Linear Algebra - in honor of Hans SchneiderMay 25, 2010 A Look-Back Technique of Restart for the GMRES(m) Method Akira IMAKURA † Tomohiro SOGABE.
2008 SIAM Conference on Imaging Science July 7, 2008 Jason A. Palmer
More MR Fingerprinting
1 Applications on Signal Recovering Miguel Argáez Carlos A. Quintero Computational Science Program El Paso, Texas, USA April 16, 2009.
Modern iterative methods For basic iterative methods, converge linearly Modern iterative methods, converge faster –Krylov subspace method Steepest descent.
Jonathan Richard Shewchuk Reading Group Presention By David Cline
BMME 560 & BME 590I Medical Imaging: X-ray, CT, and Nuclear Methods Tomography Part 4.
May 1, 2009AMSC 663/6641 Image Reconstruction from Non-Uniformly Sampled Spectral Data Alfredo Nava-Tudela AMSC 664, Spring 2009 Final Presentation Advisor:
Computer Science Department Andrés Corrada-Emmanuel and Howard Schultz Presented by Lawrence Carin from Duke University Autonomous precision error in low-
Inversion of the divisive normalization: Algorithms and new possibilities Jesús Malo Dpt. Optics at Fac. Physics, Universitat de València (Spain) + NASA.
Monica Garika Chandana Guduru. METHODS TO SOLVE LINEAR SYSTEMS Direct methods Gaussian elimination method LU method for factorization Simplex method of.
1 Time Scales Virtual Clocks and Algorithms Ricardo José de Carvalho National Observatory Time Service Division February 06, 2008.
Overview and Mathematics Bjoern Griesbach
By Mary Hudachek-Buswell. Overview Atmospheric Turbulence Blur.
An approach for solving the Helmholtz Equation on heterogeneous platforms An approach for solving the Helmholtz Equation on heterogeneous platforms G.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
Methods  OpenGL Functionality Visualization Tool Functionality 1)3D Shape/Adding Color1)Atom/element representations 2)Blending/Rotation 2)Rotation 3)Sphere.
1 Secure Cooperative MIMO Communications Under Active Compromised Nodes Liang Hong, McKenzie McNeal III, Wei Chen College of Engineering, Technology, and.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
Phase Retrieval Applied to Asteroid Silhouette Characterization by Stellar Occultation Russell Trahan & David Hyland JPL Foundry Meeting – April 21, 2014.
O AK R IDGE N ATIONAL L ABORATORY U.S. D EPARTMENT OF E NERGY Nanoscale Electronics / Single-Electron Transport in Quantum Dot Arrays Dene Farrell SUNY.
Mining Discriminative Components With Low-Rank and Sparsity Constraints for Face Recognition Qiang Zhang, Baoxin Li Computer Science and Engineering Arizona.
OAK RIDGE NATIONAL LABORATORY U.S. DEPARTMENT OF ENERGY Parallel Solution of 2-D Heat Equation Using Laplace Finite Difference Presented by Valerie Spencer.
Automatic Wave Equation Migration Velocity Analysis Peng Shen, William. W. Symes HGRG, Total E&P CAAM, Rice University This work supervised by Dr. Henri.
Architectures and Applications for Wireless Sensor Networks ( ) Localization Chaiporn Jaikaeo Department of Computer Engineering.
EMIS 8381 – Spring Netflix and Your Next Movie Night Nonlinear Programming Ron Andrews EMIS 8381.
O AK R IDGE N ATIONAL L ABORATORY U.S. D EPARTMENT OF E NERGY 1 Parallel Solution of the 3-D Laplace Equation Using a Symmetric-Galerkin Boundary Integral.
CMPS 1371 Introduction to Computing for Engineers MATRICES.
Statistical Sampling-Based Parametric Analysis of Power Grids Dr. Peng Li Presented by Xueqian Zhao EE5970 Seminar.
On Distinguishing the Multiple Radio Paths in RSS-based Ranging Dian Zhang, Yunhuai Liu, Xiaonan Guo, Min Gao and Lionel M. Ni College of Software, Shenzhen.
Mathematical foundationsModern Seismology – Data processing and inversion 1 Some basic maths for seismic data processing and inverse problems (Refreshement.
1 Incorporating Iterative Refinement with Sparse Cholesky April 2007 Doron Pearl.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
On the Use of Sparse Direct Solver in a Projection Method for Generalized Eigenvalue Problems Using Numerical Integration Takamitsu Watanabe and Yusaku.
Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization Julio Martin Duarte-Carvajalino, and Guillermo Sapiro.
College of Engineering Anchor Nodes Placement for Effective Passive Localization Karthikeyan Pasupathy Major Advisor: Dr. Robert Akl Department of Computer.
Computational Time-reversal Imaging
Parallel Solution of the Poisson Problem Using MPI
ITERATIVE CHANNEL ESTIMATION AND DECODING OF TURBO/CONVOLUTIONALLY CODED STBC-OFDM SYSTEMS Hakan Doğan 1, Hakan Ali Çırpan 1, Erdal Panayırcı 2 1 Istanbul.
Case Study in Computational Science & Engineering - Lecture 5 1 Iterative Solution of Linear Systems Jacobi Method while not converged do { }
MAY 2010 WALES, Ltd. AirBorne EO Sensor for BMD - 1/17 UNCLASSIFIED Approved for Public Release - 10-MDA-5450 (04 MAY 10) AIRBORNE ELECTRO-OPTICAL SENSORS.
Principles of Radar Target Tracking The Kalman Filter: Mathematical Radar Analysis.
Hyperspectral remote sensing
Innovative Emerging Computer Technologies
Outline Introduction Research Project Findings / Results
Mathematical Analysis of MaxEnt for Mixed Pixel Decomposition
Harnessing the Cloud for Securely Outsourcing Large- Scale Systems of Linear Equations.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
Industrial Affiliates March 2 nd, Ranging-Imaging Spectrometer Brian A. Kinder Advisor: Dr. Eustace Dereniak Optical Detection Lab Optical Sciences.
Improving Performance of The Interior Point Method by Preconditioning Project Proposal by: Ken Ryals For: AMSC Fall 2007-Spring 2008.
A Protocol for Tracking Mobile Targets using Sensor Networks H. Yang and B. Sikdar Department of Electrical, Computer and Systems Engineering Rensselaer.
F. Fairag, H Tawfiq and M. Al-Shahrani Department of Math & Stat Department of Mathematics and Statistics, KFUPM. Nov 6, 2013 Preconditioning Technique.
Camera calibration from multiple view of a 2D object, using a global non linear minimization method Computer Engineering YOO GWI HYEON.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Source Localization in a Moving Sensor Field Acknowledgements A special thanks to my mentor Dr. Jacob Barhen for his assistance through the duration of.
MA237: Linear Algebra I Chapters 1 and 2: What have we learned?
RECONSTRUCTION OF MULTI- SPECTRAL IMAGES USING MAP Gaurav.
Fermi National Accelerator Laboratory & Thomas Jefferson National Accelerator Facility SciDAC LQCD Software The Department of Energy (DOE) Office of Science.
Compressive Coded Aperture Video Reconstruction
Matrix Addition and Scalar Multiplication
Matrix Multiplication
Hardware Implementation of CTIS Reconstruction Algorithms
LOCATION AND IDENTIFICATION OF DAMPING PARAMETERS
Taking Math Beyond the Classroom: Some high school math fair ideas
Computed Tomography.
LSMF for Suppressing Multiples
Presentation transcript:

Dr. Jacob Barhen Computer Science and Mathematics Division

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 2 OUTLINE MDA context for flash hyperspectral imaging  Signal processing  Approach CTIS: information processing model and computational challenges Advances in algorithms  Mixed expectation  Asymptotic attractor dynamics  Sparse conjugate gradient  MART Conclusions and Future Work

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 3

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 4 MDA Signal Processing and Computation MDA’s objective is to detect, track and assess the “killing” of targets Target intercept generates spatially-distributed radiation Hyperspectral sensors collect spectrally-contiguous images of the target intercept in 3D ( produces “data cube” x, y, Process collected data in shortest possible time The Approach Recover target information from data collected on FPA Solve very large scale system of noise-perturbed equations Analysis and identification based on spectral response to material content or temperature Missile Defense Applications

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 5 What is CTIS?  Computed Tomography Imaging Spectrometer  Sensor built by the University of Arizona  Measures objects in a manner that requires complex post-processing  Object cube projected on sensor’s focal plane  Diffractive optics causes dispersion  Images are blurred (noise) Requires solution of inverse problem University of Arizona Computer Tomography Imaging Spectrometer FPA Objective Field stop Disperser Reimaging lens Collimator f g H f

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 6 Develop, implement, and test innovative algorithms for CTIS image reconstruction Compare Speed of recovery Accuracy of reconstruction Identify a computer platform that would benefit this MDA application processing speed power required Raw CTIS images on FPA Each blurred images represents a 2D recording of a projection through the object cube at a different angle g gλgλ RESEARCH GOALS

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 7 1. Mixed Expectation Maximization Costs and Challenges 3 matrix-vector multiplications per iteration results in about 2 m per iteration assuming some overlap can be achieved algorithm exhibits oscillatory behavior convergence requires over 100 iterations (typically, 500) UA stops at 10-20!   40 m / run RECONSTRUCTION APPROACH

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 8 2. Attractor Dynamics Benefits and Costs Limitations of conventional image inversion Conventional algorithms are too expensive because FPA is noisy optical system matrix H is non-square, non-symmetric, and singular Benefits of attractor dynamics paradigm no inversion of H required: readily applies to non-square, non-symmetric, even singular matrices sparsity of H is fully exploited, and no transpose of H is used

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 9 3. Conjugate Gradients Benefits and Costs Limitations of Conventional CG matrix A is assumed square, symmetric, and positive definite (SSPD)  not the case for CTIS optical system matrix H For overdetermined systems, conventional CG considers the associated normal equations  an SSPD matrix obtained by defining A = H T H Benefits and costs of Sparse (NS)2 CG Sparsity of H is fully exploited, and no explicit transpose of H is required Readily applies to (NS) 2, i.e., non-square, non-symmetric matrices  One additional (but sparse) matrix-vector multiplication needed per iteration  Preconditioning required for large scale systems

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY MULTIPLICATIVE ALGEBRAIC RECONSTRUCTION TECHNIQUE (MART) Iterative algorithm proposed by UOA Much faster than MEM Assume noise was prefiltered

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 11 Hyperspectral Object Reconstruction

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 12 Hyperspectral Object Reconstruction

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 13 Convergence to True Target Conjugate Gradient

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 14 Convergence to True Target: Conjugate Gradient

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 15 Convergence to True Target Asymptotic Attractor Dynamics

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 16 Convergence to True Target Asymptotic Attractor Dynamics

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 17 Convergence to True Target Mixed Expectation Maximization

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 18 Convergence to True Target Mixed Expectation Maximization

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 19 Convergence to True Target MART

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 20 Convergence to True Target MART

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 21 Convergence to True Target Voxel Recovery Error : MART – MEM

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 22 Convergence to True Target Voxel Recovery Error : AA – CG – MART – MEM

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 23 CONCLUSIONS and FUTURE WORK Algorithms were implemented and tested Considerable speedup compared to previous methods were obtained Excellent accuracy in target acquisition Fastest algorithms will be implemented in IBM cell multi-core processor ORNL will support MDA on algorithms on real flight test missile experience CTIS will take measurements in real time Code will analyze data in real time

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 24 Acknowledgements Department of Energy Office of Science/Advanced Scientific Computing Research (ASCR) Missile Defense Agency/Advanced Concepts Directorate Research Alliance in Math and Science (RAMS) ORNL Mrs. Debbie McCoy Dr. Jacob Barhen

OAK RIDGE NATIONAL LABORATORY U. S. DEPARTMENT OF ENERGY 25 ANY QUESTIONS?