Optical Architectures for Compressive Imaging Mark A. Neifeld and Jun Ke Electrical and Computer Engineering Department College of Optical Sciences University.

Slides:



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

Adaptive Hough transform for the search of periodic sources P. Astone, S. Frasca, C. Palomba Universita` di Roma “La Sapienza” and INFN Roma Talk outline.
CS-MUVI Video compressive sensing for spatial multiplexing cameras Aswin Sankaranarayanan, Christoph Studer, Richard G. Baraniuk Rice University.
When Target Motion Matters: Doppler Coverage in Radar Sensor Networks Presenter: Yin Sun Xiaowen Gong, Junshan Zhang, Douglas Cochran School of Electrical,
Capacity of Wireless Channels
Multi-Task Compressive Sensing with Dirichlet Process Priors Yuting Qi 1, Dehong Liu 1, David Dunson 2, and Lawrence Carin 1 1 Department of Electrical.
Image Denoising using Locally Learned Dictionaries Priyam Chatterjee Peyman Milanfar Dept. of Electrical Engineering University of California, Santa Cruz.
1 Inzell, Germany, September 17-21, 2007 Agnieszka Lisowska University of Silesia Institute of Informatics Sosnowiec, POLAND
On Attributes and Limitations of Linear Optics in Computing A personal view Joseph Shamir Department of Electrical Engineering Technion, Israel OSC2009.
1 Wireless Communication Low Complexity Multiuser Detection Rami Abdallah University of Illinois at Urbana Champaign 12/06/2007.
FIO/LS 2006 ece Task-Specific Information Amit Ashok 1, Pawan K Baheti 1 and Mark A. Neifeld 1,2 Optical Computing and Processing Laboratory 1 Dept. of.
Modelling, calibration and correction of nonlinear illumination-dependent fixed pattern noise in logarithmic CMOS image sensors Dileepan Joseph and Steve.
1 Asynchronous Bit-stream Compression (ABC) IEEE 2006 ABC Asynchronous Bit-stream Compression Arkadiy Morgenshtein, Avinoam Kolodny, Ran Ginosar Technion.
Volkan Cevher, Marco F. Duarte, and Richard G. Baraniuk European Signal Processing Conference 2008.
Principal Component Analysis
Richard Baraniuk Rice University dsp.rice.edu/cs Compressive Signal Processing.
Compressed Sensing for Networked Information Processing Reza Malek-Madani, 311/ Computational Analysis Don Wagner, 311/ Resource Optimization Tristan Nguyen,
Reconstruction with Adaptive Feature-Specific Imaging Jun Ke 1 and Mark A. Neifeld 1,2 1 Department of Electrical and Computer Engineering, 2 College of.
Order-Independent Texture Synthesis Li-Yi Wei Marc Levoy Gcafe 1/30/2003.
ELEC Fall 05 1 Very- Long Instruction Word (VLIW) Computer Architecture Fan Wang Department of Electrical and Computer Engineering Auburn.
Page 1 CS Department Parallel Design of JPEG2000 Image Compression Xiuzhen Huang CS Department UC Santa Barbara April 30th, 2003.
Reconstruction with Adaptive Feature-specific Imaging Jun Ke 1 and Mark A. Neifeld 1,2 1 Department of Electrical and Computer Engineering, 2 College of.
Distributed Feature-Specific Imaging Jun Ke 1, Premchandra Shankar 1, and Mark A. Neifeld 1,2 Computational Optical Sensing and Imaging (COSI) Department.
Rice University dsp.rice.edu/cs Distributed Compressive Sensing A Framework for Integrated Sensing and Processing for Signal Ensembles Marco Duarte Shriram.
Low power and cost effective VLSI design for an MP3 audio decoder using an optimized synthesis- subband approach T.-H. Tsai and Y.-C. Yang Department of.
1D or 2D array of photosensors can record optical images projected onto it by lens system. Individual photosensor in an imaging array is called pixel.
Sensing Meets Mobile Social Networks: The Design, Implementation and Evaluation of the CenceMe Application Emiliano Miluzzo†, Nicholas D. Lane†, Kristóf.
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
1 Miodrag Bolic ARCHITECTURES FOR EFFICIENT IMPLEMENTATION OF PARTICLE FILTERS Department of Electrical and Computer Engineering Stony Brook University.
“Low-Power, Real-Time Object- Recognition Processors for Mobile Vision Systems”, IEEE Micro Jinwook Oh ; Gyeonghoon Kim ; Injoon Hong ; Junyoung.
A New Algorithm for Improving the Remote Sensing Data Transmission over the LEO Satellite Channels Ali Payandeh and Mohammad Reza Aref Applied Science.
Introduction Compression Performance Conclusions Large Camera Arrays Capture multi-viewpoint images of a scene/object. Potential applications abound: surveillance,
November 1, 2012 Presented by Marwan M. Alkhweldi Co-authors Natalia A. Schmid and Matthew C. Valenti Distributed Estimation of a Parametric Field Using.
1 ECE-517: Reinforcement Learning in Artificial Intelligence Lecture 6: Optimality Criterion in MDPs Dr. Itamar Arel College of Engineering Department.
Bio-inspired design: nonlinear digital pixels for multiple-tier processes (invited paper) SPIE Nano/Bio/Info-Tech Sensors and Systems March 2013 O. Skorka,
1 RECENT DEVELOPMENTS IN MULTILAYER PERCEPTRON NEURAL NETWORKS Walter H. Delashmit Lockheed Martin Missiles and Fire Control Dallas, TX 75265
Tutorial on Computational Optical Imaging University of Minnesota September David J. Brady Duke University
Compressive Sensing for Multimedia Communications in Wireless Sensor Networks By: Wael BarakatRabih Saliba EE381K-14 MDDSP Literary Survey Presentation.
The Physical Layer Lowest layer in Network Hierarchy. Physical transmission of data. –Various flavors Copper wire, fiber optic, etc... –Physical limits.
Outline Kinds of Coding Need for Compression Basic Types Taxonomy Performance Metrics.
23 November Md. Tanvir Al Amin (Presenter) Anupam Bhattacharjee Department of Computer Science and Engineering,
Capacity Enhancement with Relay Station Placement in Wireless Cooperative Networks Bin Lin1, Mehri Mehrjoo, Pin-Han Ho, Liang-Liang Xie and Xuemin (Sherman)
Efficient Local Statistical Analysis via Integral Histograms with Discrete Wavelet Transform Teng-Yok Lee & Han-Wei Shen IEEE SciVis ’13Uncertainty & Multivariate.
Developing the Demosaicing Algorithm in GPGPU Ping Xiang Electrical engineering and computer science.
Content-Based Image Retrieval Using Block Discrete Cosine Transform Presented by Te-Wei Chiang Department of Information Networking Technology Chihlee.
The Restricted Matched Filter for Distributed Detection Charles Sestok and Alan Oppenheim MIT DARPA SensIT PI Meeting Jan. 16, 2002.
Dr. Jacob Barhen Computer Science and Mathematics Division.
Iterative detection and decoding to approach MIMO capacity Jun Won Choi.
ELE 488 F06 ELE 488 Fall 2006 Image Processing and Transmission ( ) Image Compression Quantization independent samples uniform and optimum correlated.
From Error Control to Error Concealment Dr Farokh Marvasti Multimedia Lab King’s College London.
Learning Photographic Global Tonal Adjustment with a Database of Input / Output Image Pairs.
SR: 599 report Channel Estimation for W-CDMA on DSPs Sridhar Rajagopal ECE Dept., Rice University Elec 599.
PADS Power Aware Distributed Systems Architecture Approaches – Deployable Platforms & Reconfigurable Power-aware Comm. USC Information Sciences Institute.
Performance of Digital Communications System
Medipix3 chip, downscaled feature sizes, noise and timing resolution of the front-end Rafael Ballabriga 17 June 2010.
Image Processing Architecture, © Oleh TretiakPage 1Lecture 5 ECEC 453 Image Processing Architecture Lecture 5, 1/22/2004 Rate-Distortion Theory,
Date of download: 6/26/2016 Copyright © 2016 SPIE. All rights reserved. Simulations and comparison of SOFI reconstructions with different optical pixel.
Date of download: 6/29/2016 Copyright © 2016 SPIE. All rights reserved. Potential imaging modes. (a) Each detector in a focal plane array measures the.
Multimodal Biometric Security 1.
Date of download: 7/10/2016 Copyright © 2016 SPIE. All rights reserved. A graphical overview of the proposed compressed gated range sensing (CGRS) architecture.
Optimizing Interconnection Complexity for Realizing Fixed Permutation in Data and Signal Processing Algorithms Ren Chen, Viktor K. Prasanna Ming Hsieh.
Compressive Coded Aperture Video Reconstruction
COMPUTATIONAL MODELS.
Adnan Quadri & Dr. Naima Kaabouch Optimization Efficiency
Multimodal Biometric Security
Outlier Processing via L1-Principal Subspaces
Chen Zhifeng Electrical and Computer Engineering University of Florida
The Image The pixels in the image The mask The resulting image 255 X
NON-NEGATIVE COMPONENT PARTS OF SOUND FOR CLASSIFICATION Yong-Choon Cho, Seungjin Choi, Sung-Yang Bang Wen-Yi Chu Department of Computer Science &
Presentation transcript:

Optical Architectures for Compressive Imaging Mark A. Neifeld and Jun Ke Electrical and Computer Engineering Department College of Optical Sciences University of Arizona OUTLINE 1. Compressive (a.k.a. Feature-Specific) Imaging 2. Candidate Optical Architectures 3. Results and Conclusions

Compressive Imaging  Conventional imagers measure a large number (N) of pixels  Compressive imagers measure a small number (M<<N) of features  Features are simply projections y i = (x ∙ f i ) for i = 1, …, M  Benefits of projective/compressive measurements include - increased measurement SNR  improved image fidelity - more informative measurements  reduced sensor power and bandwidth - enable task-specific imager deployment  information optimal  Previous feature-specific imaging: Neifeld (2003), Brady (2005), Donoho (2004), Baraniuk (2005) PCA, ICA, Wavelets, Fisher, … DCT, Hadamard, … random projections Object N - Detector Array Direct Image Photons M - Detector Array features Object Conventional Feature-Specific

Noise-free reconstruction: PCA solution : General solution : Result using PCA features:  PCA features provide optimal measurements in the absence of noise  Limit attention to linear reconstruction operators photon count constraint depends on optics Feature-Specific Imaging for Reconstruction

Problem statement with Noise: What Happens in the Presence of Noise ?  PCA features are sub-optimal in the presence of noise.  PCA tradeoff between truncation error and measurement fidelity  Optimal features improve performance by - using optimal basis functions - using optimal energy allocation RMSE = 12.9RMSE = 124 F PCA RMSE = 11.8RMSE = 12 F OPT Stochastic tunneling to find optimal

Optimal Features in Noise  Optimal solution always improves with number of features  FSI results can be superior to conventional imaging  Optical implementation require non-negative projections

 Optimal FSI is always superior to conventional imaging  Non-negative solution is a good experimental system candidate  All these results rely on optimal photon utilization Feature-Specific Imaging Results Summary

Architecture #1: Conventional Imaging  y = x + n Object = x N - Detector Array Imaging Optics Noise = n Noisy Measurements Characteristics  All N measurements made in a single time step (noise BW ~ 1/T)  Photons divided among many detectors (measured signal ~ 1/N) Candidate Architectures Architecture Comparison Assumes - Equal total photon number - Equal total measurement time

Architecture #2: Sequential Compressive Imaging Characteristics  A single feature is measured in each time step (noise BW ~ M/T)  Photons collected on a single detector (measured signal ~ 1/M)  Unnecessary photons discarded in each time step (1/2)  Reconstruction computed via post-processing  Imaging Optics Light Collection Optics Programmable Mask Single Photo- Detector y i = f i x + n nNoisy Measurement Object = x Candidate Architectures

Characteristics  All M features are measured in a single time step (noise BW ~ 1/T)  Photons collected on M << N detectors (measured signal ~ 1/M)  Unnecessary photons discarded in each channel (1/2)  Reconstruction computed via post-processing  Imaging  -Optics Fixed Mask M – Detector Array {y i = f i x + n, i=1, …, M} Noise = n Noisy Measurements Object = x Architecture #3: Parallel Compressive Imaging Candidate Architectures

Imaging Optics Polarization Mask Object = x Single Detector y 1 = f 1 x + n Re-Imaging Optics PBS + n y 2 = f 2 x + n PBS + n Characteristics  All M features are measured in a single time step (noise BW ~ 1/T)  Photons collected on M << N detectors (measured signal ~ 1/M)  No discarded photons  most photon efficient  Most complex hardware  Reconstruction computed via post-processing Architecture #4: Pipeline Compressive Imaging Candidate Architectures

 All results use 80x80 pixel object.  All results use PCA features with optimal energy allocation among time/space channels.  All results use optimal linear post-processor (LMMSE) for reconstruction.  Measurement noise is assumed AWGN iid. Architecture Comparison – Full Image FSI Reconstruction RMSE versus SNR

 RMSE Trend 1: Pipeline < Parallel < Sequential  RMSE Trend 2: Compressive < Conventional for low SNR Architecture Comparison – Full Image FSI

 Evaluate compressive imaging architectures for 16x16 block-wise feature extraction  All other conditions remain unchanged  Block-wise operation shifts crossover to larger SNR  RMSE Trend 1: Pipeline < Parallel < Sequential  RMSE Trend 2: Compressive < Conventional for low SNR Architecture Comparison – Blockwise FSI Reconstruction RMSE versus SNR

Architecture Comparison – Full Image FSI

 Compressive imaging (FSI) exploits projective measurements.  There are many potentially useful measurement bases.  FSI can yield high-quality images with relatively few detectors.  FSI can provide performance superior to conventional imaging for low SNR.  Various optical architectures for FSI are possible.  FSI Reconstruction fidelity is ordered as Sequential, Parallel, Pipeline.  Pipeline offer best performance owing to optimal utilization of photons. Conclusions