1 / 21

ENGN 2500 Medical Image Analysis Project Progress Presentation

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.

seoras
Download Presentation

ENGN 2500 Medical Image Analysis Project Progress Presentation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 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

  2. 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.

  3. Elbow of A Dog

  4. humerus ulna radius CT Images

  5. 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.

  6. 1st 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

  7. 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!

  8. Thresholding

  9. Fill holes

  10. Median filtering

  11. Erosion

  12. Subtraction

  13. 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.

  14. Isovalue = -3

  15. Isovalue = 4

  16. Isovalue = 0

  17. 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 2nd 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.

  18. 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

More Related