1 / 17

Variational Approaches and Image Segmentation Lecture #7

Variational Approaches and Image Segmentation Lecture #7. Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2 Electerical and Computer Engineering Department, University of Louisville, Louisville, KY, USA ECE 643 – Fall 2010.

daquan-neal
Download Presentation

Variational Approaches and Image Segmentation Lecture #7

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. Variational Approaches and Image SegmentationLecture #7 Hossam Abdelmunim1 & Aly A. Farag2 1Computer & Systems Engineering Department, Ain Shams University, Cairo, Egypt 2Electerical and Computer Engineering Department, University of Louisville, Louisville, KY, USA ECE 643 – Fall 2010

  2. The curvature and The Implicit Function Form • The level set function has the following relation with the embedded curve C: • Us the following derivative equation w.r.t. the arc-length s: • To prove that: (Assignment)

  3. Calculating Additional Quantities • Enclosed Area • Length of Interface • Mainly used to track the Interface/contour:- Example of a Level Set Function iso-contours Applying δ Function Applying H Function H and Delta Functions

  4. Narrow Banding • Points of the interface/front/contour are only the points of interest. • The points (highlighted) are called the narrow band. • The change of the level set function at these points only are considered. • Other points (outside the narrow band) are called far away points and take large positive or large negative values. • This will expedite the processing later on. Boundary Band Points. Red line is the zero level set corresponding to front.

  5. Level Set PDE • Curve Contracts with time • Level Set Function changes with time • Fundamental Level Set Equation • The velocity vector V has a component F in the normal direction. The other tangential component has no effect because the gradient works in the normal direction.

  6. Speed Function • Among several forms, the following speed function is used: Image data (force): +1 for expansion -1 for contraction It will be a function of the image (I). Contour characteristics: Smoothes the evolution and the bending is quantized by ε

  7. Variational Edge-based Segmentation Edge map Where g is an indicator function of the image gradient:

  8. Variational Edge-based Segmentation(Cont…) Energy = Arc-Length + Enclosed Area: By calculus of variation: The amount of bending is controlled by λ>0. The sign of ע depends on the position of the contour w.r.t. the object.

  9. Variational Segmentation without EdgesChan-Vese Model Object Mean Background Mean Maximizes the distance between c1 and c2 Only one level set function is used

  10. Variational Segmentation without EdgesChan-Vese Model (Cont…) The PDE will be: For computational issues: where:

  11. Chan & Vese--Examples

  12. Multi-phase EvolutionChan & Vese C3 In this example 2 functions are used. Then 22=4 regions are considered. The energy will be: Ф1>0 C4 Ф1>0 Ф2>0 Ф2<0 Ф2>0 Ф1<0 Ф2<0 Ф1<0 C2 C1

  13. Multi-phase EvolutionChan & Vese (Cont…) Using calculus of variations will result in:

  14. Multi-phase EvolutionChan & Vese (Example) The given image contains 4 regions. Three different color boxes are represented in the foreground. The background is considered the fourth region.

  15. Multi-phase Evolution8 Regions-3 Level sets 2 5 6 1 4 3 7 8

  16. Chan & Vese (Cont…) The curvature is included with a coefficient μ which helps in segmenting images with noise but when the noise level is high, the weight needs to be increased. This affects the boundaries of the object and also increases the convergence time. Number of regions are always 2n depending on the number of level set functions n. No vacuum pixels appear because if any point does not belong to a certain region, it will go to another one. Unless the region can be described by only its mean, the segmentation will fail.

  17. Thank You&Questions

More Related