Vision and Image Processing Group University of Waterloo Justin Eichel, Akshaya Mishra, Paul Fieguth, David Clausi, Kostadinka Bizheva.

Slides:



Advertisements
Similar presentations
Applications of one-class classification
Advertisements

Bayesian Belief Propagation
S INGLE -I MAGE R EFOCUSING AND D EFOCUSING Wei Zhang, Nember, IEEE, and Wai-Kuen Cham, Senior Member, IEEE.
Optimizing and Learning for Super-resolution
A Graph based Geometric Approach to Contour Extraction from Noisy Binary Images Amal Dev Parakkat, Jiju Peethambaran, Philumon Joseph and Ramanathan Muthuganapathy.
Kyle Marcolini MRI Scan Classification. Previous Research  For EEN653, project devised based on custom built classifier for demented MRI brain scans.
Emerging biometrics Presenter : Shao-Chieh Lien Adviser : Wei-Yang Lin.
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
1 Removing Camera Shake from a Single Photograph Rob Fergus, Barun Singh, Aaron Hertzmann, Sam T. Roweis and William T. Freeman ACM SIGGRAPH 2006, Boston,
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Edge Detection CSE P 576 Larry Zitnick
3D Video Generation and Service Based on a TOF Depth Sensor in MPEG-4 Multimedia Framework IEEE Consumer Electronics Sung-Yeol Kim Ji-Ho Cho Andres Koschan.
3D Reconstruction of Anatomical Structures from Serial EM images.
Active Contours Technique in Retinal Image Identification of the Optic Disk Boundary Soufyane El-Allali Stephen Brown Department of Computer Science and.
A Study of Approaches for Object Recognition
Median Filter If the objective is to achieve noise reduction rather than blurring, an alternative approach is to use median filters. That is, the gray.
Problem Sets Problem Set 3 –Distributed Tuesday, 3/18. –Due Thursday, 4/3 Problem Set 4 –Distributed Tuesday, 4/1 –Due Tuesday, 4/15. Probably a total.
Snakes Goes from edges to boundaries. Edge is strong change in intensity. Boundary is boundary of an object. –Smooth (more or less) –Closed. –…
Samuel W. Hasinoff Sing Bing Kang Richard Szeliski Interactive Visual Media Group Microsoft Research Dept. of Computer.
Interpolation Snakes Work by Silviu Minut. Ultrasound image has noisy and broken boundaries Left ventricle of dog heart Geodesic contour moves to smoothly.
Iris localization algorithm based on geometrical features of cow eyes Menglu Zhang Institute of Systems Engineering
Lecture 2: Image filtering
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Geometric Approaches to Reconstructing Time Series Data Project Update 29 March 2007 CSC/Math 870 Computational Discrete Geometry Connie Phong.
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
Circular Augmented Rotational Trajectory (CART) Shape Recognition & Curvature Estimation Presentation for 3IA 2007 Russel Ahmed Apu & Dr. Marina Gavrilova.
Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.
Multimodal Interaction Dr. Mike Spann
Live-Wire Segmentation with "shortest path" By Ilan Smoly.
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:
Discrete Images (Chapter 7) Fourier Transform on discrete and bounded domains. Given an image: 1.Zero boundary condition 2.Periodic boundary condition.
Lecture 2: Edge detection CS4670: Computer Vision Noah Snavely From Sandlot ScienceSandlot Science.
Lecture 4: Image Resampling and Reconstruction CS4670: Computer Vision Kavita Bala.
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
An Automated Method for Geometric Reconstruction of Vertebrae from Clinical CT Scans Yifei Dai 10/19/2006.
Mathematical Morphology Mathematical morphology (matematická morfologie) –A special image analysis discipline based on morphological transformations of.
Course 2 Image Filtering. Image filtering is often required prior any other vision processes to remove image noise, overcome image corruption and change.
2D Texture Synthesis Instructor: Yizhou Yu. Texture synthesis Goal: increase texture resolution yet keep local texture variation.
Non-Ideal Iris Segmentation Using Graph Cuts
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],
Feature Selction for SVMs J. Weston et al., NIPS 2000 오장민 (2000/01/04) Second reference : Mark A. Holl, Correlation-based Feature Selection for Machine.
Speaker Min-Koo Kang March 26, 2013 Depth Enhancement Technique by Sensor Fusion: MRF-based approach.
Lecture 04 Edge Detection Lecture 04 Edge Detection Mata kuliah: T Computer Vision Tahun: 2010.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Computer Vision Image Features Instructor: Dr. Sherif Sami Lecture 4.
Image Visualization. Outline 9.1. Image Data Representation 9.2. Image Processing and Visualization 9.3. Basic Imaging Algorithms Contrast Enhancement.
Instructor: Mircea Nicolescu Lecture 5 CS 485 / 685 Computer Vision.
Lecture 8: Edges and Feature Detection
Today Defocus Deconvolution / inverse filters. Defocus.
Detecting Image Features: Corner. Corners Given an image, denote the image gradient. C is symmetric with two positive eigenvalues. The eigenvalues give.
Lecture 1: Images and image filtering CS4670/5670: Intro to Computer Vision Noah Snavely Hybrid Images, Oliva et al.,
Grouping and Segmentation. Sometimes edge detectors find the boundary pretty well.
HOUGH TRANSFORM.
Medical Image Analysis
Miguel Tavares Coimbra
Image Deblurring and noise reduction in python
The Chinese University of Hong Kong
Image gradients and edges
Interpolation Snakes Work by Silviu Minut.
Decoupled Active Surface for Volumetric Image Segmentation
A guide to SR different approaches
a kind of filtering that leads to useful features
Vincent DeVito Computer Systems Lab
a kind of filtering that leads to useful features
Lecture 2: Edge detection
Non-local Means Filtering
EE 492 ENGINEERING PROJECT
Lecture 2: Edge detection
Photometric Processing
Morphological features of the different MN pools.
Presentation transcript:

Vision and Image Processing Group University of Waterloo Justin Eichel, Akshaya Mishra, Paul Fieguth, David Clausi, Kostadinka Bizheva

 UHROCT  ultra high resolution optical coherence tomography  47,000 A-scans/s  3um x 10um (axial x lateral) resolution  Dataset  Corneal hypoxia study  2 healthy subjects  Contact inducted

 Issues  Low contrast  Noise

 Issues  Low contrast  Noise Stroma Bowman’s membrane Epithelium Endothelium Descemet’s membrane

 Artifacts  Eye lashes

 Artifacts  Eye lashes ▪ Different Eyelashes

 Artifacts  Eye lashes ▪ Different Eyelashes ▪ Timing

 Artifacts  Eye lashes ▪ Different Eyelashes ▪ Timing  Lower Contrast

 Active Contours  Designed to engulf an object  Gradient information  Parametric Active Contours  Geometric Active Contours  Edge-free Active Contours

 Active Contours  Designed to engulf an object  Gradient information  Parametric Active Contours  Geometric Active Contours  Edge-free Active Contours

 Failed  Noisy image  Noisy image gradient

 Intelligent Scissors (Mortenson et al, 1995)  User guided boundary identification  Noisy gradient  Discontinuities due to imaging artifacts

 Intelligent Scissors (Mortenson et al, 1995)  User guided boundary identification  Noisy gradient  Discontinuities due to imaging artifacts  Unfair example?

Proposed MethodIntelligent Scissors Few discontinuities

Proposed MethodIntelligent Scissors With artifact

Proposed MethodIntelligent Scissors Low contrast image

Proposed MethodIntelligent Scissors Well conditioned image

 Enhanced Intelligent Scissors (Mishra et al, 2008)  Better than Intelligent Scissors  User guided boundary identification  Noisy gradient  Discontinuities due to imaging artifacts  Better for upper and lower curves  Still not great for inner curves

SourceEnhanced Intelligent Scissors Few discontinuities

With artifact Enhanced Intelligent ScissorsSource

Low contrast image Enhanced Intelligent ScissorsSource

Well conditioned image Enhanced Intelligent ScissorsSource

 Semi-automated boundary identification  Identify high contrast outer boundaries  Develop model of cornea  Parameter estimation  Local optimization

Well conditioned image Close up of source

 Preprocessing  Create a smooth gradient  Morphological operators ▪ Set of structuring elements to enhance the arch ▪ Creates higher contrast upper and lower curves  Blur to reduce noise

SourcePreprocessed image Many discontinuities

SourcePreprocessed image Few discontinuities

With artifact SourcePreprocessed image

Low contrast image SourcePreprocessed image

Well conditioned image SourcePreprocessed image

 User input  Enhanced Intelligent Scissors  2 points on upper curve  2 points on lower curve User input

 User input  Enhanced Intelligent Scissors  2 points on upper curve  2 points on lower curve  Fit data to polynomial  >250 data points  4 th order polynomial  filters “sloppy input” Polynomial fitting

 User input  Enhanced Intelligent Scissors  2 points on upper curve  2 points on lower curve  Fit data to polynomial  >250 data points  4 th order polynomial  filters “sloppy input” Polynomial fitting

 Corneal Model  Shortest distance between curves ▪ medial axis transform  Define alpha, s, theta, and Omega  Let’s have a closer look

Source

 Parameter Estimation  Find inner curves  Modify alpha and theta to generate search path Omega  Look at points in the neighborhood of the path

 Parameter Estimation  False peaks  Use a prior knowledge  Gaussian mixture model  Use statistics from datasets alpha01

 Parameter Estimation  Select path with largest difference in intensity  Keep corresponding values of alpha and theta  Future work  Currently only focusing on alpha

 Fully Automated Method  Local optimization  Use model to provide initial values for local optimization  3D reconstruction