Adaptive Coded Aperture Photography



Similar documents
Computational Optical Imaging - Optique Numerique. -- Deconvolution --

Lecture 14. Point Spread Function (PSF)

Admin stuff. 4 Image Pyramids. Spatial Domain. Projects. Fourier domain 2/26/2008. Fourier as a change of basis

T = 1 f. Phase. Measure of relative position in time within a single period of a signal For a periodic signal f(t), phase is fractional part t p

Image Compression through DCT and Huffman Coding Technique

Sampling Theorem Notes. Recall: That a time sampled signal is like taking a snap shot or picture of signal periodically.

4 Digital Video Signal According to ITU-BT.R.601 (CCIR 601) 43

Sharpening through spatial filtering

High Quality Image Deblurring Panchromatic Pixels

CHAPTER 3: DIGITAL IMAGING IN DIAGNOSTIC RADIOLOGY. 3.1 Basic Concepts of Digital Imaging

Blind Deconvolution of Barcodes via Dictionary Analysis and Wiener Filter of Barcode Subsections

Comparison of different image compression formats. ECE 533 Project Report Paula Aguilera

Introduction to Robotics Analysis, Systems, Applications

Augmented Architectural Environments

The Effect of Network Cabling on Bit Error Rate Performance. By Paul Kish NORDX/CDT

Parametric Comparison of H.264 with Existing Video Standards

Short-time FFT, Multi-taper analysis & Filtering in SPM12

Redundant Wavelet Transform Based Image Super Resolution

Final Year Project Progress Report. Frequency-Domain Adaptive Filtering. Myles Friel. Supervisor: Dr.Edward Jones

Optimizing IP3 and ACPR Measurements

Convolution. 1D Formula: 2D Formula: Example on the web:

The Fundamentals of MTF, Wiener Spectra, and DQE. Motivation

Time Domain and Frequency Domain Techniques For Multi Shaker Time Waveform Replication

The Image Deblurring Problem

Wavelet analysis. Wavelet requirements. Example signals. Stationary signal 2 Hz + 10 Hz + 20Hz. Zero mean, oscillatory (wave) Fast decay (let)

SPEECH SIGNAL CODING FOR VOIP APPLICATIONS USING WAVELET PACKET TRANSFORM A

DIGITAL IMAGE PROCESSING AND ANALYSIS

Advanced Signal Processing and Digital Noise Reduction

Digital Image Fundamentals. Selim Aksoy Department of Computer Engineering Bilkent University

Optical Metrology. Third Edition. Kjell J. Gasvik Spectra Vision AS, Trondheim, Norway JOHN WILEY & SONS, LTD

Web:

Theory and Methods of Lightfield Photography SIGGRAPH 2009

EVIDENCE PHOTOGRAPHY TEST SPECIFICATIONS MODULE 1: CAMERA SYSTEMS & LIGHT THEORY (37)


Quick Guide for Data Collection on the NIU Bruker Smart CCD

Rodenstock Photo Optics

PHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUMBER OF REFERENCE SYMBOLS

Understanding Exposure for Better Photos Now

MetaMorph Software Basic Analysis Guide The use of measurements and journals

Lecture 8: Signal Detection and Noise Assumption

Department of Electrical and Computer Engineering Ben-Gurion University of the Negev. LAB 1 - Introduction to USRP

Forensic Image Processing.

MIMO CHANNEL CAPACITY

How To Filter Spam Image From A Picture By Color Or Color

Beginners Guide to Digital Camera Settings

Digital Image Requirements for New Online US Visa Application

Noise reduction of fast, repetitive GC/MS measurements using principal component analysis (PCA)

Video Camera Image Quality in Physical Electronic Security Systems

Optical Design for Automatic Identification

Chapter 2. Point transformation. Look up Table (LUT) Fundamentals of Image processing

ZEISS Education Program Price Information

RIEGL VZ-400 NEW. Laser Scanners. Latest News March 2009

Enhanced LIC Pencil Filter

MestRe-C User Guide Megan Bragg 04/14/05

Loop Bandwidth and Clock Data Recovery (CDR) in Oscilloscope Measurements. Application Note

Today. next two weeks

Lectures 6&7: Image Enhancement

ADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING

Signal to Noise Instrumental Excel Assignment

The Whys, Hows and Whats of the Noise Power Spectrum. Helge Pettersen, Haukeland University Hospital, NO

High-resolution Imaging System for Omnidirectional Illuminant Estimation

Automatic Detection of Emergency Vehicles for Hearing Impaired Drivers

Deferred Shading & Screen Space Effects

Efficient Attendance Management: A Face Recognition Approach

CONDENSED POWER COMPARISON SHEET

FFT Algorithms. Chapter 6. Contents 6.1

Jeff Thomas Tom Holmes Terri Hightower. Learn RF Spectrum Analysis Basics

UNIVERSITY OF CALICUT

Development and Evaluation of Point Cloud Compression for the Point Cloud Library

TDS5000B, TDS6000B, TDS/CSA7000B Series Acquisition Modes

KBA Oktatási Kft OKÉV nyilvántartási szám:

Maximizing Receiver Dynamic Range for Spectrum Monitoring

Enhancement of scanned documents in Besov spaces using wavelet domain representations

Jeff Thomas Tom Holmes Terri Hightower. Learn RF Spectrum Analysis Basics

ANALYZER BASICS WHAT IS AN FFT SPECTRUM ANALYZER? 2-1

APPLICATION NOTES: Dimming InGaN LED

Basic Manual Control of a DSLR Camera

Lecture 16: A Camera s Image Processing Pipeline Part 1. Kayvon Fatahalian CMU : Graphics and Imaging Architectures (Fall 2011)

WHITE PAPER. Are More Pixels Better? Resolution Does it Really Matter?

Digital Camera Imaging Evaluation

ADVANCED DIRECT IMAGING. by ALTIX

How To Sharpen A Picture With A Camera Raw Sharpening Effect On A Black And White Camera Raw Image Sensor

How To Fix Out Of Focus And Blur Images With A Dynamic Template Matching Algorithm

SSO Transmission Grating Spectrograph (TGS) User s Guide

Public Switched Telephone System

Correlation and Convolution Class Notes for CMSC 426, Fall 2005 David Jacobs

Introduction to Digital Resolution

Bildverarbeitung und Mustererkennung Image Processing and Pattern Recognition

16 th IOCCG Committee annual meeting. Plymouth, UK February mission: Present status and near future

Figure 1: Relation between codec, data containers and compression algorithms.

Digital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System

Adaptive HSI Data Processing for Near-Real-time Analysis and Spectral Recovery *

Digital Photography. Digital Cameras and Digital Photography. Your camera. Topics Your Camera Exposure Shutter speed and f-stop Image Size Editing

MODULATION TRANSFER FUNCTION MEASUREMENT METHOD AND RESULTS FOR THE ORBVIEW-3 HIGH RESOLUTION IMAGING SATELLITE

DOING PHYSICS WITH MATLAB COMPUTATIONAL OPTICS RAYLEIGH-SOMMERFELD DIFFRACTION INTEGRAL OF THE FIRST KIND

Transcription:

Adaptive Coded Aperture Photography Oliver Bimber, Haroon Qureshi, Daniel Danch Institute of Johannes Kepler University, Linz Anselm Grundhoefer Disney Research Zurich Max Grosse Bauhaus University Weimar

Motivation 2

Motivation 2

Motivation 2

Motivation 2

Motivation original JPEG compressed 2

Motivation Narrow apertures large depth of field (= high frequencies in out-of-focus regions) in low light throughput (= low signal-to-noise ratio) JPEG compression attenuates high frequencies (in focused and out-of-focus regions) Can we optimize apertures with respect to JPEG compression? frequencies attenuated by JPEG compression do not have to be supported optically by the aperture results in higher light throughput (= higher signal-to-noise ratio or shorter shutter times) 4

Related Work Veeraraghava n, et al,, 07 Levin, et al,, 07 Bando, et al,, 08 Zhou, et al,, 09 Liang, et al,, 08 Nagahara, et al,, 10 Grosse, et al,, 08 Grosse, et al,, 10 this paper binary intensity color static dynamic adapted zero crossings Fourier magnitudes noise models Applications: post-exposure refocusing, defocus deblurring, depth reconstruction, matting, light field acquisition, projector-defocus compensation. 5

Related Work Veeraraghava n, et al,, 07 Levin, et al,, 07 Bando, et al,, 08 Zhou, et al,, 09 Liang, et al,, 08 Nagahara, et al,, 10 Grosse, et al,, 08 Grosse, et al,, 10 this paper binary intensity color static dynamic adapted zero crossings Fourier magnitudes noise models Applications: post-exposure refocusing, defocus deblurring, depth reconstruction, matting, light field acquisition, projector-defocus compensation, increasing light throughput 6

Previous Work pre-computed input image F* binarize (optional) dynamic aperture pattern FT threshold frequencies apply pseudo-inverse FT projected image (Adaptive) Coded Aperture Projection, Grosse, Wetzstein, Grundhoefer, and Bimber, ACM Transaction on Graphics, 2010 7

8

set aperture and capture image 8

set aperture and capture image JPEG compression and frequency filtering 8

set aperture and capture image JPEG compression and frequency filtering compute and set coded aperture 8

set aperture and capture image JPEG compression and frequency filtering compute and set code aperture re-capture image 8

set aperture and capture image JPEG compression and frequency filtering compute and set code aperture re-capture image 8 transform bokeh and depth of field

set aperture and capture image JPEG compression and frequency filtering compute and set code aperture re-capture image final image 8 transform bokeh and depth of field

Prototype 9

important frequencies masked spectrum original (all frequencies) Institute of Frequency Filtering q=90 =0.2854% q=70 =0.4231% q=50 =0.5024% q=30 =0.6205% 10

Aperture Computation Construct a binary frequency mask (m) and compute intensity aperture pattern (a) by minimizing the variance of its Fourier transform for all important frequencies: 11

Aperture Computation Construct a binary frequency mask (m) and compute intensity aperture pattern (a) by minimizing the variance of its Fourier transform for all important frequencies: M is the diagonal matrix containing the binary frequency mask values of m, F is the discrete Fourier transform matrix (i.e., the set of orthogonal Fourier basis functions in its columns), a is the unknown vector of the coded aperture pattern, and e is the vector of all ones - this can be solved quickly with the pseudo-inverse: The conjugate-transpose pseudo-inverse matrix F is constant and can be pre-computed! 11

Aperture Computation binarize low magnitude high q=70 masked spectrum q=50 masked spectrum MTF of binarized mask MTF of coded intensity mask MTF of binarized mask MTF of coded intensity mask 12

Bokeh Transformation 13

Bokeh Transformation bokeh transformation 13

coded (after bokeh transformation) coded (before bokeh transformation) regular Institute of Bokeh Transformation back-focus close-up front (back-focus) front-focus close-up back (front-focus) 14

Bokeh Transformation Capturing an image through an aperture with given PSF can be considered as convolution (multiplication in frequency domain): 15

Bokeh Transformation Capturing an image through an aperture with given PSF can be considered as convolution (multiplication in frequency domain): Bokeh transformation can be carried out as follows: 15

Bokeh Transformation Capturing an image through an aperture with given PSF can be considered as convolution (multiplication in frequency domain): Bokeh transformation can be carried out as follows: However, the scales (s and s ) are entirely unknown since the scene depth is unknown! 15

17x17 15x15 13x13 11x11 9x9 7x7 5x5 3x3 1x1 convolution scale (s ) Bokeh Transformation simulated measured 1x1 3x3 5x5 7x7 9x9 11x11 13x13 15x15 17x17 deconvolution scale (s ) 1x1 3x3 5x5 7x7 9x9 11x11 13x13 15x15 17x17 16

convolution deconvolution

Bokeh Transformation color and brightness matching 18

Bokeh Transformation S S S S S S S S S S S S S S S S S S S S S S S S color and brightness matching 18

Bokeh Transformation S S S S S S S S S S S S S S S S S S S S S S S S color and brightness matching 18

Bokeh Transformation S S S S S S S S S S S S S S S S S S S S S S S S color and brightness matching 18

Bokeh Transformation S S S S S S S S S S S S S S S S S S S S S S S S color and brightness matching 18

scale difference deconvolution (s ) convolution (s ) Institute of Bokeh Transformation 19

Intensity Masks with PWM 3.2s/6.4s + 1.6s/6.4s + 0.8s/6.4s + 0.4s/6.4s + (1/5)s/6.4s + (1/10)s/6.4s + (1/20)s/6.4s + (1/40)s/6.4s = 20

Intensity Masks with PWM 3.2s/6.4s + 1.6s/6.4s + 0.8s/6.4s + 0.4s/6.4s + (1/5)s/6.4s + (1/10)s/6.4s + (1/20)s/6.4s + (1/40)s/6.4s = 20

Intensity Masks with PWM 3.2s/6.4s + 1.6s/6.4s + 0.8s/6.4s + 0.4s/6.4s + (1/5)s/6.4s + (1/10)s/6.4s + (1/20)s/6.4s + (1/40)s/6.4s = 3.2s 1.6s 0.8s 0.4s 1/5s 1/10s 1/20s 1/40s 20

coded regular Institute of Results uncompressed (original) uncompressed (increased and matched brightness) close-up (regular) close-up (coded) 21

coded regular Institute of Results compressed close-up (regular) close-up (coded) 21

regular aperture opening coded regular coded compression regular Institute of q=90 q=70 q=50 q=30 90 70 50 30 2% 10% 27% 22 regular aperture opening (2%, 10%, 27%)

lighting conditions coded regular coded focus regular Institute of Results front center back focus (front, center, back) high low medium lighting conditions (high, low, medium) 23

Results Note that if we ignored other noise sources, such as dark noise and read noise, and considered shot noise only, then the gain in SNR would be proportional to the square root of the light throughput gain. 24

Limitations and Future Work LCA has low light transmittance (only 30% when completely transparent), low contrast (7:1), and is small (limited DOF difference) use larger reflective DMAs or LCoS panels! Coded aperture pattern is scaled manually to roughly match the depth of field while remaining depth-of-field differences are removed by the bokeh transformation automize this scale estimation Explore alternatives downsampling instead of / together with compression (i.e., trade resolution / compression for light through put or shutter time) simple extension of circular apertures for 1/f distributions 25

Thank You! www.jku.at/cg