ENGN 2500 Medical Image Analysis Project Progress Presentation Extraction and Visualization of Humerus, Radius and Ulna of Dogs “Subvoxel Polygonization.

Slides:



Advertisements
Similar presentations
NA-MIC National Alliance for Medical Image Computing Slicer Tutorial Module: Segmentation May 26, 2005.
Advertisements

Reconstruction from Voxels (GATE-540)
Segmentation by Morphological Watersheds
Patient specific reconstruction of vascular network for hemodynamic modeling Yury Ivanov (INM RAS), Roman Pryamonosov (MSU), 2014, Moscow.
Image Processing in Matlab An Introductory Approach by Sabih D. Khan
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Course Syllabus 1.Color 2.Camera models, camera calibration 3.Advanced image pre-processing Line detection Corner detection Maximally stable extremal regions.
Provides mathematical tools for shape analysis in both binary and grayscale images Chapter 13 – Mathematical Morphology Usages: (i)Image pre-processing.
Chapter 5 Raster –based algorithms in CAC. 5.1 area filling algorithm 5.2 distance transformation graph and skeleton graph generation algorithm 5.3 convolution.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Segmentation Using Skeletally Coupled Deformable Models Based on "Segmentation of carpal bones from CT images using skeletally coupled deformable models”
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Digital Image Processing: Revision
Segmentation Divide the image into segments. Each segment:
Medical Image Analysis
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Shape Modeling International 2007 – University of Utah, School of Computing Robust Smooth Feature Extraction from Point Clouds Joel Daniels ¹ Linh Ha ¹.
Yujun Guo Kent State University August PRESENTATION A Binarization Approach for CT-MR Registration Using Normalized Mutual Information.
ENGN 2500 Medical Image Analysis Project First Presentation Extraction and Visualization of Humerus, Radius and Ulna of Dogs “Subvoxel Polygonization of.
Application of Digital Signal Processing in Computed tomography (CT)
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2013.
CSE554Binary PicturesSlide 1 CSE 554 Lecture 1: Binary Pictures Fall 2014.
Random signals. Histogram of the random signal Continuous Time Sinusoidal signals.
Volumetric and Blobby Objects Lecture 8 (Modelling)
Chapter 3 Binary Image Analysis. Types of images ► Digital image = I[r][c] is discrete for I, r, and c.  B[r][c] = binary image - range of I is in {0,1}
A fully automated method for segmentation and thickness determination of hip joint cartilage from 3D MR data Authors: Yoshinobu Sato,et al. Source: Proceedings.
Lecture 5. Morphological Image Processing. 10/6/20152 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of animals.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
Under Supervision of Dr. Kamel A. Arram Eng. Lamiaa Said Wed
Image Segmentation and Morphological Processing Digital Image Processing in Life- Science Aviad Baram
Chapter 3 cont’d. Binary Image Analysis. Binary image morphology (nonlinear image processing)
1 Signal Processing Laboratory Swiss Federal Institute of Technology, Lausanne Cédric Dufour ( LTS-IBCM Collaboration ) The ‘microtubules’ project.
1 Regions and Binary Images Hao Jiang Computer Science Department Sept. 25, 2014.
CSED451 Term Project Jaeyong Jeong Minsung Sung D Reconstruction of realistic cardiac geometry from medical images.
An Automated Method for Geometric Reconstruction of Vertebrae from Clinical CT Scans Yifei Dai 10/19/2006.
3D Object Representations
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
FOR FURTHER INFORMATION REFERENCES 1.A.J.H. Mehnert & P.T. Jackway. “On Computing the Exact Euclidean Distance Transform on Rectangular and Hexagonal Grids”,
Low level Computer Vision 1. Thresholding 2. Convolution 3. Morphological Operations 4. Connected Component Extraction 5. Feature Extraction 1.
References Books: Chapter 11, Image Processing, Analysis, and Machine Vision, Sonka et al Chapter 9, Digital Image Processing, Gonzalez & Woods.
Lecture 10: Lines from Edges, Interest Points, Binary Operations CAP 5415: Computer Vision Fall 2006.
Nottingham Image Analysis School, 23 – 25 June NITS Image Segmentation Guoping Qiu School of Computer Science, University of Nottingham
Image Segmentation Image segmentation (segmentace obrazu)
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Machine Vision ENT 273 Hema C.R. Binary Image Processing Lecture 3.
11/01/2010 Segmentation of SES for Protein Structure Analysis Virginio Cantoni, Riccardo Gatti, Luca Lombardi University of Pavia, dept. of Computer Engineering.
Lecture(s) 3-4. Morphological Image Processing. 3/13/20162 Introduction ► ► Morphology: a branch of biology that deals with the form and structure of.
Computer Vision Computer Vision based Hole Filling Chad Hantak COMP December 9, 2003.
Digital Image Processing, Spring ECES 682 Digital Image Processing Week 8 Oleh Tretiak ECE Department Drexel University.
Morphological Image Processing
Reducing Artifacts in Surface Meshes Extracted from Binary Volumes R. Bade, O. Konrad and B. Preim efficient smoothing of iso-surface meshes Plzen - WSCG.
0 Assignment 1 (Due: 10/2) Input/Output an image: (i) Design a program to input and output a color image. (ii) Transform the output color image C(R,G,B)
CSE 554 Lecture 1: Binary Pictures
ATCM 6317 Procedural Animation
Volume Rendering.
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Binary Image processing بهمن 92
A Volumetric Method for Building Complex Models from Range Images
Procedural Animation Lecture 10: Volume simulation
Midterm Exam Closed book, notes, computer Similar to test 1 in format:
Biomedical Image Processing Platform
ECE 692 – Advanced Topics in Computer Vision
Radial Thickness Calculation and Visualization for Volumetric Layers
CS654: Digital Image Analysis
Presentation transcript:

ENGN 2500 Medical Image Analysis Project Progress Presentation Extraction and Visualization of Humerus, Radius and Ulna of Dogs “Subvoxel Polygonization of Discrete Implicit Surfaces Using ENO Interpolation” Firat Kalaycilar

Problem Elbow dysplasia is a condition involving multiple developmental abnormalities of the elbow-joint in the dog, specifically the growth of cartilage or the structures surrounding it (from Wikipedia). The disease can be diagnosed using 3D reconstruction of bones from CT data. Goal: Extract and visualize bones of interest in 3D.

Elbow of A Dog

ulna humerus radius CT Images

Approach “Subvoxel Polygonization of Discrete Implicit Surfaces Using ENO Interpolation” by Rodehorst and Kimia Take 3D distance transform of input CT images → DT Find surface zero-crossings of DT at grid lines using ENO interpolation → ENO anchor points (APs) Connect APs to obtain a 3D polygon mesh. Start from an unambiguous voxel and connect APs → initial mesh Grow the current mesh by considering adjacent voxels. If the voxel being considered is ambiguous, choose the connections which result in smoothest surface. This algorithm works like wave propagation. Visualize the resulting mesh.

1 st Presentation Plan April 12 – April 19 Find or implement an appropriate 3D Distance Transform algorithm. Try to revive the existing code (doesn't compile and run) April 20 – April 27 Finish revival of the code or implement ENO interpolation as described in the paper. Obtain some interpolation results. April 28 MID-PROJECT PRESENTATION April 29 – May 06 Implement the wave propagation algorithm explained in the paper if the existing code doesn't work May 07 – May 15 Experiments. May 16 – May 17 FINAL PROJECT PRESENTATION

3D Signed Distance Transform Requires a 3D binary volume where 1's correspond to boundaries and 0's correspond to elsewhere. But, we have a gray level volume! We can obtain boundaries using segmentation. Luckily, simple thresholding + mathematical morphology are sufficient!

Thresholding

Fill holes

Median filtering

Erosion

Subtraction

3D Signed Distance Transform Apply these operations to every slice → stack of binary boundary images Use matlab's bwdist function to obtain an unsigned distance transform. Multiply the interior regions by -1 to obtain a signed distance transform.

Isovalue = -3

Isovalue = 4

Isovalue = 0

ENO Anchor Points “Subvoxel Polygonization of Discrete Implicit Surfaces Using ENO Interpolation” by Rodehorst and Kimia An old C/C++ implementation exists → not compatible with recent compilers Managed to revive the ENO anchor point extraction algorithm. Procedure: – Export the distance transform in a format that can be read by the ENO interpolation program. – Run ENO anchor point extraction code Input: 3D signed distance transform For each grid line in each direction (x,y,z) Associate a 2 nd order polynomial with each interval between consecutive grid points using ENO interpolation. Output: Roots of the polynomials are the anchor points. – Export the ENO anchor points computed by the program in a format that can be read by matlab. – Visualize the points in matlab.

Plan April 29 – May 06 Revive the wave propagation code Get more data May 07 – May 15 Experiments. May 16 – May 17 FINAL PROJECT PRESENTATION