Design, Optimization and Implementation of Fresnel Domain Computer Generated Holograms (CGHs) Diffraction optical elements: reconstruct semi-arbitrary.

Slides:



Advertisements
Similar presentations
Chris A. Mack, Fundamental Principles of Optical Lithography, (c) 2007
Advertisements

1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Chris A. Mack, Fundamental Principles of Optical Lithography, (c) 2007
Chris A. Mack, Fundamental Principles of Optical Lithography, (c) 2007
Tutorial on Subwavelength Lithography DAC 99
MASKS © 2004 Invitation to 3D vision Lecture 7 Step-by-Step Model Buidling.
1.  Texturing is a core process for modeling surface details in computer graphics applications › Texture mapping › Surface texture synthesis › Procedural.
More MR Fingerprinting
MATHIEU GAUTHIER PIERRE POULIN LIGUM, DEPT. I.R.O. UNIVERSITÉ DE MONTRÉAL GRAPHICS INTERFACE 2009 Preserving Sharp Edges in Geometry Images.
Special Topic on Image Retrieval Local Feature Matching Verification.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
1 Wendy Williams Metaheuristic Algorithms Genetic Algorithms: A Tutorial “Genetic Algorithms are good at taking large, potentially huge search spaces and.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Optical Alignment with Computer Generated Holograms
Object Recognition Using Genetic Algorithms CS773C Advanced Machine Intelligence Applications Spring 2008: Object Recognition.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Motion Computing in Image Analysis
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
16 November, 2005 Statistics in HEP, Manchester 1.
Interactive Optimization by Genetic Algorithms Cases: Lighting Patterns and Image Enhancement Janne Koljonen Electrical Engineering and Automation, University.
Accurate, Dense and Robust Multi-View Stereopsis Yasutaka Furukawa and Jean Ponce Presented by Rahul Garg and Ryan Kaminsky.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
NANOSCALE LITHOGRAPHY MICHAEL JOHNSTON 4/13/2015.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
Genetic Algorithms: A Tutorial
Development in hardware – Why? Option: array of custom processing nodes Step 1: analyze the application and extract the component tasks Step 2: design.
Machine Learning CUNY Graduate Center Lecture 3: Linear Regression.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
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.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
A Comparison of Nature Inspired Intelligent Optimization Methods in Aerial Spray Deposition Management Lei Wu Master’s Thesis Artificial Intelligence Center.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Genetic Algorithms Genetic algorithms imitate a natural optimization process: natural selection in evolution. Developed by John Holland at the University.
(Particle Swarm Optimisation)
2002 OSA Annual Meeting - Orlando, Florida Technical Session WJJ5 - Thin Films II Characterization of Diamond- Like Carbon Thin Films and Their Application.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
Fuzzy Genetic Algorithm
1 “Genetic Algorithms are good at taking large, potentially huge search spaces and navigating them, looking for optimal combinations of things, solutions.
Neural and Evolutionary Computing - Lecture 9 1 Evolutionary Neural Networks Design  Motivation  Evolutionary training  Evolutionary design of the architecture.
An Efficient Search Strategy for Block Motion Estimation Using Image Features Digital Video Processing 1 Term Project Feng Li Michael Su Xiaofeng Fan.
1 University of Texas at Austin Machine Learning Group 图像与视频处理 计算机学院 Motion Detection and Estimation.
1 Genetic Algorithms K.Ganesh Introduction GAs and Simulated Annealing The Biology of Genetics The Logic of Genetic Programmes Demo Summary.
 Genetic Algorithms  A class of evolutionary algorithms  Efficiently solves optimization tasks  Potential Applications in many fields  Challenges.
A B C D E F A ABSTRACT A novel, efficient, robust, feature-based algorithm is presented for intramodality and multimodality medical image registration.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Intelligent controller design based on gain and phase margin specifications Daniel Czarkowski  and Tom O’Mahony* Advanced Control Group, Department of.
Lithography in the Top Down Method New Concepts Lithography In the Top-Down Process New Concepts Learning Objectives –To identify issues in current photolithography.
LITHOGRAPHY IN THE TOP-DOWN PROCESS - BASICS
D Nagesh Kumar, IIScOptimization Methods: M8L5 1 Advanced Topics in Optimization Evolutionary Algorithms for Optimization and Search.
Electromagnetically biased Self-assembly
Section 2: Lithography Jaeger Chapter 2 EE143 – Ali Javey.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
NANOSCALE LITHOGRAPHY, TECHNIQUES AND TECHNOLOGY EE 4611 DEHUA LIU 4/8/2016.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
C.-S. Shieh, EC, KUAS, Taiwan
Maria Okuniewski Nuclear Engineering Dept.
Iterative Optimization
LITHOGRAPHY Lithography is the process of imprinting a geometric pattern from a mask onto a thin layer of material called a resist which is a radiation.
Image and Video Processing
Case Injected Genetic Algorithms
Traveling Salesman Problem by Genetic Algorithm
Presentation transcript:

Design, Optimization and Implementation of Fresnel Domain Computer Generated Holograms (CGHs) Diffraction optical elements: reconstruct semi-arbitrary 2D or 3D optical fields Numerical design: flexible encoding strategy high diffraction efficiency and uniformity Avoid complications from conventional optical recording process History: Detour (Brown, 1966), Kinoform (Lesem, 1969) Applications: beam shaping, optical trapping, communications, 3D television, optical testing 1 - Pure phase: binary*, multi-level - Fabrication method: electron-beam lithography

Motivation Increasing demand for smaller sized features, large working area semiconductor devices (e.g. LCD manufacture) need novel lithographic methods CGHs promising candidates for replacing conventional 2D or 3D lithographic techniques Key advantages: Processing In-line CGH Lithography Final Device - Non-contact - Parallel exposure - High resolution - Large working area - 2D or 3D patterning - Depth of focus control - Robust design - Standard fabrication - Simple optical setup - Cost effective 2

Problem Definition Performance of CGHs depends primarily on optimization algorithm and fabrication method Previous work: X-ray (Jacobsen, 1992), UV (Wyrowski, 2001), EUV (Isoyan, 2006) Local search methods: inefficient, sensitive to initial point, get trapped at local minima Current multi-search schemes: optimize small size CGHs 3 CGH Plane Reconstruction Plane Inverse Problem Encoding Free parameter Reconstruction Plane Back-propagation CGH Plane Desired Pattern

Problem Definition Performance of CGHs depends primarily on optimization algorithm and fabrication method Previous work: X-ray (Jacobsen, 1992), UV (Wyrowski, 2001), EUV (Isoyan, 2006) Local search methods: inefficient, sensitive to initial point, get trapped at local minima Current multi-search schemes: optimize small size CGHs 4 CGH: encoded signal Encoding Process CGH Plane Reconstruction Plane Inverse Problem Decoding CGH Plane Forward-propagation Reconstruction Plane Photoresist Exposure Final Pattern

Reduced Complexity Hybrid Optimization Algorithm (RCHOA) Efficient optimization of Fresnel binary and multi-level phase CGHs Reduce problem complexity by introducing: Local Diffuser Phase Elements (LDPE) and Local Negative Power Elliptical Phase Elements (LNPEPE) masks Optimize reduced subset of variables Key features: - Multi-point parallel search - Robust: insensitive to initial points - Flexible choice of encoding signal - Reduced complexity - Optical efficient results - Computationally efficient: GPU implementation 5

System Geometries In-Line Geometry*Off-Axis Geometry 6 TIR Geometry

Local Diffuser Phase Elements Mask Maximize information transfer: amplitude (reconstruction plane) to phase (CGH plane) Step 1: decompose desired pattern into N bp binary patterns Step 2: assign local diffuser phase element to each pattern Diffusivity of qth element controlled by: and LDPE mask: Mask Decomposition Binary function Random matrix Reduced number of DOF: 7 Phase Amplitude x Binary Phase CGH Multi-level LDPE Mask Desired Amplitude Mask Each element has different diffusivity Fresnel Back-Propagation Reconstruction Plane CGH Plane

Local Negative Power Elliptical Phase Elements Mask Maximize information transfer: amplitude (reconstruction plane) to phase (CGH plane) Step 1: decompose desired pattern into N bp binary patterns Step 2: apply LNPEPE to each pattern Controlled parameters: LNPEPE mask: Binary function Truncation window Reduced number of DOF: Binary pattern center coordinates 8 Phase Amplitude x LNPEPE Mask Desired Amplitude Mask Negative power elliptical phase Fresnel Back-Propagation Reconstruction PlaneCGH Plane

Genetic Algorithms Block Multi-point optimization scheme Inspired in biological evolution: “survival of the fittest” Reduced complexity allow optimizing large populations Individual: or Global minimum The MathWorks TM 9

MER Block Local search, iterative optimization method Refine solution: fast convergence Compare results with: diffracted field (DF) and simulated optically recorded hologram (SORH) encoding strategies 10

Error Metrics Four considered error metrics Choice of error metric is application dependent Photoresist Contrast Curve - Mean square error: bias estimator ( and ) - Additional metrics: L1 (bias) and normalized cross-correlation (similarity), hybrid dose - Diffraction efficiency Input power Signal Power Signal Power Inside H size Amplitude Constraint Effective efficiency inside pattern (G. Zhou, et al., 2000) 11

Optimization Results Optimization example: - binary phase CGH: resolution target - LDPE encoding strategy Wavelength532nmElite Children5 Working Distance150μmCrossover Fraction0.6 Pixel Size200nmGenerations100 CGH Size300μmPopulation Size100 Object Window180μmIterations400 Main Parameters: Desired Pattern Optimized LDPE Mask Phase Map: Optimized Binary CGH 12 Reconstruction from Multi-Level CGH at Photoresist Plane (Before Exposure) Intensity Reconstruction from Binary CGH at Photoresist Plane (Before Exposure) Intensity Convergence GA Block Convergence MER Block

Optimization Results Optimization example: - binary phase CGH: resolution target - LDPE encoding strategy 13 Comparison of Encoding Strategies After GAs Block: Multi-Level CGH Sensitivity Analysis: problem parameters (e.g. cross-over fraction, population size, etc.) Parallel implementation on graphic processing unit: speedup >180X - GPU computational time: 4.47 hours - CPU estimated time: days!

Error Comparison: Binary CGH Extending the Depth of Focus Extend DOF: tolerate potential axial misalignments during exposure process Modify RCHOA to impose constraints at multiple planes Regular DOF: Multiple Plane Constraint Extended DOF CGH Extended: 14

CGH Fabrication Fabrication Process Fabricated using electron-beam lithography Binary phase CGH Resist: Hydrogen Silsesquioxane (HSQ) 15 Scanning Electron Microscope Image of Fabricated Sample 50μm Fused Silica Aluminum HSQ E-beam Patterning Remove Aluminum & Develop HSQ

Characterization of Fabricated CGHs Implemented methods: evaluation algorithm*, optical characterization*, exposure test Evaluation algorithm: analyze fabricated CGH 2D error map (correct over/under dose) Block Diagram of Evaluation Algorithm Stitched Binarized Fabricated CGH2D Error Map 16

Characterization of Fabricated CGHs Implemented methods: evaluation algorithm*, optical characterization*, exposure test Optical characterization: measure reconstructed intensity Optical Setup: Coherent Illumination Measured Reconstructed Intensities Binary CGH: DF Encoding Strategy Binary CGH: Diffuser Encoding Strategy -Fabricated CGHs not fully optimized - Eliminate speckle using partial coherence illumination μm

Sensitivity Analysis Estimate and assist in the correction of potential fabrication errors Considered errors: e-beam over/under dose, proximity effect, uniform/nonuniform phase, stitching and positional errors Dilation Test: Over Dose ErrorStitching Error Analysis 18 MSE Offset Distance