Determination of Size and Shape of Nanoparticles Yong Shan and Nicolas Peña Advisors: Dr. Chiwoo Park, Mr. Katheek Allada, Mr. Xin Li Department of Industrial.

Slides:



Advertisements
Similar presentations
Bayesian Belief Propagation
Advertisements

Shapelets Correlated with Surface Normals Produce Surfaces Peter Kovesi School of Computer Science & Software Engineering The University of Western Australia.
By: Mani Baghaei Fard.  During recent years number of moving vehicles in roads and highways has been considerably increased.
Area and perimeter calculation using super resolution algorithms M. P. Cipolletti – C. A. Delrieux – M. C. Piccolo – G. M. E. Perillo IADO – UNS – CONICET.
Principal Component Analysis Based on L1-Norm Maximization Nojun Kwak IEEE Transactions on Pattern Analysis and Machine Intelligence, 2008.
Artificial Intelligence 13. Multi-Layer ANNs Course V231 Department of Computing Imperial College © Simon Colton.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
November 12, 2013Computer Vision Lecture 12: Texture 1Signature Another popular method of representing shape is called the signature. In order to compute.
E.G.M. PetrakisImage Segmentation1 Segmentation is the process of partitioning an image into regions –region: group of connected pixels with similar properties.
Computer Vision Lecture 16: Texture
Face Recognition and Biometric Systems 2005/2006 Filters.
Human-Computer Interaction Human-Computer Interaction Segmentation Hanyang University Jong-Il Park.
1 s-t Graph Cuts for Binary Energy Minimization  Now that we have an energy function, the big question is how do we minimize it? n Exhaustive search is.
Image Segmentation some examples Zhiqiang wang
Snakes - Active Contour Lecturer: Hagit Hel-Or
Deformable Contours Dr. E. Ribeiro.
December 5, 2013Computer Vision Lecture 20: Hidden Markov Models/Depth 1 Stereo Vision Due to the limited resolution of images, increasing the baseline.
Lecture 6 Image Segmentation
EE 7730 Image Segmentation.
Detecting Digital Image Forgeries Using Sensor Pattern Noise presented by: Lior Paz Jan Lukas, jessica Fridrich and Miroslav Goljan.
EE663 Image Processing Edge Detection 5 Dr. Samir H. Abdul-Jauwad Electrical Engineering Department King Fahd University of Petroleum & Minerals.
Face Recognition Based on 3D Shape Estimation
Image Enhancement.
Fitting a Model to Data Reading: 15.1,
Image Segmentation by Clustering using Moments by, Dhiraj Sakumalla.
Ch 8.1 Numerical Methods: The Euler or Tangent Line Method
Computer vision.
Lecture 12 Statistical Inference (Estimation) Point and Interval estimation By Aziza Munir.
Digital Image Processing In The Name Of God Digital Image Processing Lecture8: Image Segmentation M. Ghelich Oghli By: M. Ghelich Oghli
EE 492 ENGINEERING PROJECT LIP TRACKING Yusuf Ziya Işık & Ashat Turlibayev Yusuf Ziya Işık & Ashat Turlibayev Advisor: Prof. Dr. Bülent Sankur Advisor:
December 4, 2014Computer Vision Lecture 22: Depth 1 Stereo Vision Comparing the similar triangles PMC l and p l LC l, we get: Similarly, for PNC r and.
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Boosted Particle Filter: Multitarget Detection and Tracking Fayin Li.
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
October 1, 2013Computer Vision Lecture 9: From Edges to Contours 1 Canny Edge Detector However, usually there will still be noise in the array E[i, j],
Presented by: Idan Aharoni
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Image-Based Rendering Geometry and light interaction may be difficult and expensive to model –Think of how hard radiosity is –Imagine the complexity of.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
IMAGE PROCESSING is the use of computer algorithms to perform image process on digital images   It is used for filtering the image and editing the digital.
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
- photometric aspects of image formation gray level images
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
CS4670 / 5670: Computer Vision Kavita Bala Lec 27: Stereo.
COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.
Image quality and Performance Characteristics
DIGITAL SIGNAL PROCESSING
IMAGE PROCESSING INTENSITY TRANSFORMATION AND SPATIAL FILTERING
Fast Preprocessing for Robust Face Sketch Synthesis
Mean Shift Segmentation
Digital Processing Techniques for Transmission Electron Microscope Images of Combustion-generated Soot Bing Hu and Jiangang Lu Department of Civil and.
Dynamical Statistical Shape Priors for Level Set Based Tracking
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Common Classification Tasks
DICOM 11/21/2018.
Introduction to Instrumentation Engineering
Hidden Markov Models Part 2: Algorithms
Computer Vision Lecture 16: Texture II
Basics of Photometry.
Extract Object Boundaries in Noisy Images
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
EE 492 ENGINEERING PROJECT
CIS 4350 Image ENHANCEMENT SPATIAL DOMAIN
Fourier Transform of Boundaries
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Measurements & Error Analysis
Histogram The histogram of an image is a plot of the gray _levels values versus the number of pixels at that value. A histogram appears as a graph with.
Business Statistics For Contemporary Decision Making 9th Edition
Presentation transcript:

Determination of Size and Shape of Nanoparticles Yong Shan and Nicolas Peña Advisors: Dr. Chiwoo Park, Mr. Katheek Allada, Mr. Xin Li Department of Industrial Engineering MOTIVATION CONCLUSION AND FUTURE RESEARCH Nanoparticles are of great interest for a wide variety of applications in the fields of information, energy, environment, and medicine due to their unique and improved properties determined primarily by size, shape, composition, and structure. One of the many applications of nanotechnology in the medical field is treating cancer by selectively killing the cancer cells. These applications do however depend on their properties which in turn are guided by their size and shape. To synthesize the nanoparticles, certain measures have to be taken in order to ensure that the nanoparticles acquire the required dimensions. Determining these dimensions (size and shape) through automation proves a challenging task. ABSTRACT For this project, our aim was to systematically determine the size and shape/contours of an assortment of nanoparticles. This was experimentally accomplished by using techniques including the CONTIN method with dynamic light scattering (DLS) as well as the imaging convergence filter known as the sliding band filter (SBF). Data from both processes revealed that each of them offers great promise for the future of nanotechnology along with size and shape determination of objects on the nano scale in electron microscope images. In this study, the desired physical dimensions are determined in a two-step process where the CONTIN method finds the size, and the SBF technique finds the shape. METHODOLOGY FOR DETERMINING SHAPE Determination of shape is attained through the image analysis using image segmentation and its techniques. Image segmentation has been used to detect and discern between different objects (nanoparticles in this case) in a photograph. Image segmentation is the process of partitioning a digital image into multiple segments. The major techniques used in the image segmentation include:  Active Contours  Graph Cut  Edge Detection  Global and Local Thresholding  Clustering  Watershed  Linear and Non-Linear Filtering All of the methods will produce different results for the same picture. Each technique is fruitful in providing good results only in certain types of images. Active contours have notably gained prominence in the recent time. The results from active contours are illustrated here. Active contours are insensitive to initialization, have a rather high convergence speed, and have minimal computational requirements. However, it does have limitations: As observed in these images, noise and texture of the backgrounds interfere with the performance of active contours. Additionally, objects can prove hard to detect with only slight differences in intensity between the foreground and background. RESULTS FOR ACTIVE CONTOURS (DETERMINING SHAPE/CONTOURS) Size: In determining the size of rod-shaped nanoparticles, the Cumulant algorithm can be used to describe the general characteristics of the solution for monomodal solutions while the CONTIN algorithm can be used to fit the correlation curve to multiple exponential forms for multimodal solutions. However, although CONTIN can be used for a larger variety of solutions, there are several drawbacks of this method. Shape: The sliding band filter offers promising improvement over the limitations of major techniques of image segmentation such as active contours. However, it is dependent on the objects being convex, which represents a minor drawback, but performs admirably even in the presence of heavy noise and rough textured backgrounds. SBF is far from perfect, but offers a creative and important look into the future developments of the analysis of images with similar specifications. Future work in this research is in honing the frontiers of SBF, as its novelty brings with it a wide range of possibilities for future researchers to delve into. Constructing a better-developed method that comprises all the benefits from the current major techniques into one cohesive tool would prove to be a robust method in image analysis. Individual Research Project – Young Scholars Program 2014 OBJECTIVE The objective of this research is to determine the sizes and shapes of the nanoparticles. The objective is achieved in two steps: 1.Determination of the size of rod-shaped nanoparticles with dynamic light scattering (DLS) data with CONTIN. 2.Determination of shape/contours of these nanoparticles from the samples taken from electron microscopic images. METHODOLOGY AND RESULTS (DETERMINING SIZE) Through the determination of the size of rod-shaped nanoparticles with dynamic light scattering (DLS) data, we will be able to analyze and obtain measurements for larger quantities in a shorter amount of time without disturbing the surrounding medium. Dynamic light scattering (DLS) is a technique in which the size of particles can be determined. When light hits particles that are smaller than its wavelength, the light will scatter in all directions. With a monochromatic and coherent light source, like a laser, the intensity of the scattering fluctuates over time as a result of Brownian motion. Brownian motion is the random motion of particles suspended in a fluid and results in an inconstant distance between the scatterers. The intensity trace recorded during the experiment can be used to determine the size of the nanoparticles. As the delay time τ increases, the correlation decreases exponentially due to a larger range of motion of particles. Numerical methods such as CONTIN are used in order to fit this exponential decay of correlation. Figure 2 – with different length inputs, the fitted g 1 curve will take on different shapes. Figure 1 – Methodology of estimating size distribution of nanoparticles with DLS data Figure 4 – Distribution of output lengths corresponding to Figure 3 Figures 5 and 6 show the input and output distribution of lengths corresponding to a small variance. Figures 7 and 8 show the input and output distribution of lengths corresponding to a large variance. To overcome these limitations which prove to be major hurdles in the image analysis of nanoparticles, the ongoing research is taking its course towards non- linear filtering methods such as sliding band filter (SBF).  This technique has been first applied to detect the cells and its constituents from the microscopic images.  Being a convergence filter, the SBF is fundamentally well suited for cell detection as cells have an overall convex shape. Within the field of cell detection it has already been proven to perform well in low contrast and noisy single channel cell detection applications.  SBF creates a morphing looped band of fixed width that attempts to find the points that would help define the boundaries of objects.  The algorithm supposes radial lines outward from each pixel and measures the change in pixel intensity – known as the gradient – along them, finally summing these values together for each point.  Pixels with the highest sum of gradients measured (known as the convergence index) would be considered to be the middle of objects. The boundary of the objects is determined by the shape of the “sliding band” from the points of highest convergence index. DISCUSSION FOR SIZE There are several limitations to using CONTIN when analyzing the data from a DLS experiment: It does not produce a unique solution for each data point. It takes an immense amount of time to analyze the data if there is a large number of data points. There is no certain way of knowing how to choose the correct value of alpha when running the program. DISCUSSION FOR SHAPE