1 / 41

A Fast Algorithm for Variational Level Set Segmentation

A Fast Algorithm for Variational Level Set Segmentation. Tony F. Chan Department of Mathematics, Univ. Calif. Los Angeles SONAD 2003 McMaster University, Ontario, Canada May 2, 2003 Reprints: www.math.ucla.edu/~imagers

thetis
Download Presentation

A Fast Algorithm for Variational Level Set Segmentation

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. A Fast Algorithm for Variational Level Set Segmentation Tony F. Chan Department of Mathematics, Univ. Calif. Los Angeles SONAD 2003 McMaster University, Ontario, Canada May 2, 2003 Reprints: www.math.ucla.edu/~imagers Supported by ONRand NSF (Joint work with Bing Song)

  2. OUTLINE • Review of Variational Level Set Segmentation • Fast Algorithm

  3. What is an “active contour” ? Initial Curve Evolutions Detected Objects

  4. A fitting term “without edges” where Fit > 0 Fit > 0 Fit > 0 Fit ~ 0 Minimize: (Fitting +Regularization) Fitting not depending on gradient detects “contours without gradient”

  5. An active contour model “without edges” (C. + Vese 98) Fitting + Regularization terms (length, area) C = boundary of an open and bounded domain |C|= the length of the boundary-curveC

  6. Advantages - detects objects without sharp edges - detects cognitive contours - robust to noise; no need for pre-smoothing Examples

  7. Level Set Representation (S. Osher - J. Sethian ‘87) Inside C Outside C Outside C C C= boundary of an open domain • Example: mean curvature motion • * Allows automatic topology changes, cusps, merging and breaking. • Originally developed for tracking fluid interfaces.

  8. Variational Formulations and Level Sets (Following Zhao, Chan, Merriman and Osher ’96) The Heaviside function The level set formulation of the active contour model

  9. The Euler-Lagrange equations Using smooth approximations for the Heaviside and Delta functions

  10. Experimental Results Advantages Automatically detects interior contours! Works very well for concave objects Robust w.r.t. noise Detects blurred contours The initial curve can be placed anywhere! Allows for automatical change of topolgy

  11. A plane in a noisy environment A galaxy

  12. From Active Contours (2D) to Active Surfaces (3D) MRI DATA FROM LONI-UCLA

  13. Extension to Vector-Valued Images Tony F. CHAN & Luminita VESE & B. Yezrielev SANDBERG Applications * Color images (RGB) * Multi-spectral (PET, MRI, CT) Vector-Valued image: (averages of each channel inside and outside the curve) The model * The model can be solved using level sets, similar with the scalar case

  14. Extension to Vector-Valued Images Channel 1 with occlusion Channel 2 with noise Recovered object and averages

  15. Color Images Color (RGB) picture Intensity (gray-level) picture RGB Recovered objects and contours in RGB mode

  16. Active Contour for Texture 45 transforms of image with Gabor function s=.005 s=.0075 q 0 p/6 p/4 p/3 p/2 q 0 p/6 p/4 p/3 p/2 F F 120 120 150 150 180 180 s=.0025 User Picked Gabor transforms yield final contour q 0 p/6 p/4 p/3 p/2 F 120 150 180

  17. Logic Operators on Multi-Channel Active Contour(Chan, Sandberg 2001) • An Example for two channel logical segmentation:

  18. Example of an Application Original image with contour overlapping Contour only Time evolution for finding the “tumor” in the first image that is not in the second.

  19. Multiphase level set representations and partitions allows for triple junctions, with no vacuum and no overlap of phases 4-phase segmentation 2 level set functions 2-phase segmentation 1 level set function

  20. Example: two level set functions and four phases

  21. An MRI brain image Phase 11 Phase 10 Phase 01 Phase 00 mean(11)=45 mean(10)=159 mean(01)=9 mean(00)=103

  22. Three level set functions representing up to eight phases Six phases are detected, together with the triple junctions. Evolution of the 3 level sets Segmented image T Evolution of the 3 individual level sets.

  23. OUTLINE • Review of Variational Level Set Segmentation • Fast Algorithm

  24. A Fast Algorithm for Level Set Based Optimization (Bing Song and Tony Chan, 2003) Available at www.math.ucla.edu/applied/cam/index.html CAM 02-68 (Related work by Gibou & Fedkiw)

  25. Motivation • Minimize level set based functional • Examples: • Image segmentation • Inverse problem • Shape analysis and optimization • Data Clustering • …

  26. How to solve it? • Usually use gradient descent flow • Drawback • Slow (CFL) • F need to be differentiable

  27. An Insight • Segmentation only needs sign of but not its value • Direct search making use of objective function does not require derivatives of functional

  28. New Algorithm • Initialization. Partition the domain into and • Advance. For each point x in the domain, if the energy F lower when we change to , then update this point. • Repeat step 2 until the energy F remains unchanged

  29. An example: Chan-Vese model

  30. Core Step of Algorithm Change in F if is changed to at a pixel:

  31. How to calculate length term? Change in length term can be updated locally. Only possible value for length term locally is 0, 1, sqrt(2) depending the 3 points in the length term belong to the same region or not.

  32. A 2-phase example (a), (b), (c), (d) are four different initial condition. All of them converge in one sweep!

  33. Example with Noise Converged in 4 steps. (Gradient Descent on Euler-Lagrange took > 400 steps.)

  34. Convergence of the algorithm Theorem: For a two phase image, the algorithm will converge in one sweep, independent of sweeping order. Proof considers the following 2 cases: Green part of inside of contour will flip sign. Only one of the 2 black parts can change sign

  35. Why is 1-step convergence possible? • Problem is global: usually cannot have finite step convergence based on local updates only • But, in our case, we can exactly calculate the global energy change via local update (can update global average locally)

  36. Application to piecewise linear CV model(Vese 2002) Original P.W.Constant Converged in 4 steps P.W. Linear Converged in 6 steps

  37. Application to multiphase CV model(C.- Vese 2000) • Using n level set to represent 2n phases.

  38. Multiphase CV model (cont’d) Converged in 1 step.

  39. Gibou and Fedkiw’s method (02) • First, discard the stiff length term in E-L: • Take large time step enough to change sign • If , then • Followed by anisotropic diffusion to handle noise • Difference (Ours wrt GF): • A unified framework to handle length term • F does not need to be differentiable

  40. Conclusion • A fast algorithm to solve the Chan-Vese segmentation models. • 1-step convergence for 2 phase images (no reg.). • Robust wrt noise: 3-4 step convergence. • The gradient of functional is not needed. • We think it can be applied to more general level set based optimization problems. • In general, cannot expect finite step convergence (need global change from local update). Can get stuck in local minima.

  41. That’s all. Thank you for your patience!

More Related