an improved algorithm for fractured femoral head
play

An Improved Algorithm for Fractured Femoral Head Segmentation from - PowerPoint PPT Presentation

An Improved Algorithm for Fractured Femoral Head Segmentation from CT Jan Horek Charles University in Prague Faculty of Mathematics and Physics Femoral neck fracture Screw treatment Segmentation strategy (1) User-defined control points


  1. An Improved Algorithm for Fractured Femoral Head Segmentation from CT Jan Horáček Charles University in Prague Faculty of Mathematics and Physics

  2. Femoral neck fracture

  3. Screw treatment

  4. Segmentation strategy (1) User-defined control points (2) Preprocessing (3) Segmentation (4) Postprocessing (5) Statistical analysis

  5. Preprocessing Original Gradient size Final cost function Corticallis-enhancement Gauss-filtered original Gauss-filt. cort.-enh.

  6. Segmentation ● Uses spherical coordinates and different data walkthrough than our previous work ● Avoids problems of slice-by-slice methods ● Based on shortest path search, but neighbour points on shortest paths relaxed, so that they do not diverge too much

  7. Spherical transformation = + + 2 2 2 = ⋅ ϕ ⋅ θ r x y z x r cos( ) sin( ) ϕ = = ⋅ ϕ ⋅ θ arctan 2 ( y , x ) y r sin( ) sin( ) = ⋅ θ   z r cos( ) z   θ = arccos   + + 2 2 2 x y z  

  8. Primary polar point ● User selects one primary control point, which is taken as the pole for spherical transformation ● Before the transformation from spatial to spherical coordinates a rotation is performed to move the pole to an axis (for example +Z)

  9. First walkthrough φ θ Starting pole r (user input) Walkthrough direction

  10. Find second pole φ θ r Search for the smallest value

  11. Second pole Starting pole for backtracing Step for each path point along descending values with relaxation

  12. Start finding paths Found path

  13. Curve relaxation ● Curve is divided into discontinuous segments ±1 discontinuity ±2 discontinuity Move shorter segment Move both segments

  14. Optional control points ● Optional control points locally decrease the cost function ● Subtract f(d) from the original cost function, d is the euclidean distance to the control point  −  K d = ⋅   f ( d ) exp λ λ  

  15. Advantages ● Very fast processing through dynamic programming ● Easy to run in parallel ● No “thin holes” in the volume that make problems during morphological operations ● Many datasets segmented with much less control points (thus user interaction is much faster)

  16. Disadvantages ● A little bit weaker control abilities (weaker control points) – Some patients need more control points ● Due to the relaxation method some “spikes” may still appear – For smoother results some optimization method may be used ● Still sensitive to the control points location (like our older slice-by-slice method)

  17. Fractures

  18. Another utilization ● Virtual acetabulum inspection ● Allows to inspect the inner part of hip joint for fractures

  19. Thank you for your attention

Recommend


More recommend