Active Contours without Edges

Slides:



Advertisements
Similar presentations
An Active contour Model without Edges
Advertisements

Total Variation and Geometric Regularization for Inverse Problems
Level Set Methods for Shape Recovery Fan Ding and Charles Dyer Computer Sciences Department University of Wisconsin.
An Efficient and Fast Active Contour Model for Salient Object Detection Authors: Farnaz Shariat, Riadh Ksantini, Boubakeur Boufama
L1 sparse reconstruction of sharp point set surfaces
MRI Brain Extraction using a Graph Cut based Active Contour Model Noha Youssry El-Zehiry Noha Youssry El-Zehiry and Adel S. Elmaghraby Computer Engineering.
Level set based Image Segmentation Hang Xiao Jan12, 2013.
Active Contours, Level Sets, and Image Segmentation
McMaster University, Ontario, Canada
1 Lecture #7 Variational Approaches and Image Segmentation Lecture #7 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Medical Image Segmentation: Beyond Level Sets (Ismail’s part) 1.
3D Segmentation Using Level Set Methods. Heriot-Watt University, Edinburgh, Scotland Zsolt Husz Mokhled Al-TarawnehÍzzet Canarslan University of Newcastle.
Snakes, Strings, Balloons and Other Active Contour Models.
Segmentation In The Field Medicine Advanced Image Processing course By: Ibrahim Jubran Presented To: Prof. Hagit Hel-Or.
P. Brigger, J. Hoeg, and M. Unser Presented by Yu-Tseh Chi.
Wangfei Ningbo University A Brief Introduction to Active Appearance Models.
Image Segmentation some examples Zhiqiang wang
Image Segmentation and Active Contour
Active Contours / Planes Sebastian Thrun, Gary Bradski, Daniel Russakoff Stanford CS223B Computer Vision Some slides.
Active Contour Models (Snakes) 건국대학교 전산수학과 김 창 호.
Active Contours (SNAKES) Back to boundary detection –This time using perceptual grouping. This is non-parametric –We’re not looking for a contour of a.
Snakes with Some Math.
Segmentation and Region Detection Defining regions in an image.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
Snakes - Active Contour Lecturer: Hagit Hel-Or
Active Contour Models (Snakes)
Deformable Contours Dr. E. Ribeiro.
Martin Burger Institut für Numerische und Angewandte Mathematik CeNoS Level set methods for imaging and application to MRI segmentation.
Introduction to Calculus of Variations Ron Kimmel Computer Science Department Technion-Israel Institute of Technology Geometric.
Snakes Goes from edges to boundaries. Edge is strong change in intensity. Boundary is boundary of an object. –Smooth (more or less) –Closed. –…
Erin Plasse Advisors: Professor Hanson Professor Rudko.
Background vs. foreground segmentation of video sequences = +
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Active Contour Models (Snakes) Yujun Guo.
Implicit Representations of Surfaces and Polygonalization Algorithms Dr. Scott Schaefer.
Instructor: Dr. Peyman Milanfar
MUSCLE-WP5&7 meeting Priors, Syntax and Semantics in Variational Level-Set Approachs TAU-VISUAL: Nir Sochen & Nahum Kiryati Based on works with.
Finite Difference Methods to Solve the Wave Equation To develop the governing equation, Sum the Forces The Wave Equation Equations of Motion.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
2008/10/02H704 - DYU1 Active Contours and their Utilization at Image Segmentation Author : Marián Bakoš Source : 5th Slovakian-Hungarian Joint Symposium.
1 PDE Methods are Not Necessarily Level Set Methods Allen Tannenbaum Georgia Institute of Technology Emory University.
Image Segmentation and Registration Rachel Jiang Department of Computer Science Ryerson University 2006.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
7.1. Mean Shift Segmentation Idea of mean shift:
Level Set Methods and Fast Marching Methods Wen Hongwei.
Numerical Integration and Rigid Body Dynamics for Potential Field Planners David Johnson.
Lecture 6 : Level Set Method
5. SUMMARY & CONCLUSIONS We have presented a coarse to fine minimization framework using a coupled dual ellipse model to form a subspace constraint that.
Course 13 Curves and Surfaces. Course 13 Curves and Surface Surface Representation Representation Interpolation Approximation Surface Segmentation.
Computer Animation Rick Parent Computer Animation Algorithms and Techniques Optimization & Constraints Add mention of global techiques Add mention of calculus.
1 Lecture #6 Variational Approaches and Image Segmentation Lecture #6 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Introduction to Level Set Methods: Part II
Overview of Propagating Interfaces Donald Tanguay October 30, 2002.
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
A D V A N C E D C O M P U T E R G R A P H I C S CMSC 635 January 15, 2013 Quadric Error Metrics 1/20 Geometric Morphometrics Feb 27, 2013 Geometric Morphologyd.
Implicit Active Shape Models for 3D Segmentation in MR Imaging M. Rousson 1, N. Paragio s 2, R. Deriche 1 1 Odyssée Lab., INRIA Sophia Antipolis, France.
Variational methods in image processing Level Sets and Geodesic Active Contours Variational methods in image processing Level Sets and Geodesic Active.
Instructor: Mircea Nicolescu Lecture 7
Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.
Amir Yavariabdi Introduction to the Calculus of Variations and Optical Flow.
Level set method and image segmentation
Dynamical Statistical Shape Priors for Level Set Based Tracking
Outline Perceptual organization, grouping, and segmentation
PRAKASH CHOCKALINGAM, NALIN PRADEEP, AND STAN BIRCHFIELD
3D Image Segmentation and Multigrid Method
Snakes, Shapes, and Gradient Vector Flow
Active Contours (“Snakes”)
Fast Marching and Level Set for Shape Recovery
Presentation transcript:

Active Contours without Edges Tony Chan Luminita Vese Peter Horvath – University of Szeged 29/09/2006

Introduction Variational approach The main problem is to minimise an integral functional (e.g.): In the case f:, f’=0 gives the extremum(s) In the case of functionals similary F’=0, where F’=(F/u) is the first variation. Most of the cases the solution is analyticly hard, in these cases we use gradient descent to optimise.

Introduction Active Contour (Snake Model) + Fast evaluation Kass, Witkin and Terzopoulos [Kas88]  - tension  - rigidity Eext – external energy Problem is: infxE + Fast evaluation - But difficult to handle topological changes

Introduction A typical external energy coming from the image: Positive on homogeneous regions Near zero on the sharp edges

Intoduction Level Set methods S.Osher and J. Sethian [Set89] Embed the contour into a higher dimensional space +Automatically handles the topological changes - Slower evaluation (., t) level set function Implicit contour (=0) The contour is evolved implicitly by moving the surface 

Introduction The curve is moving with an F speed: The geometric active contour, based on a mean curvature (length) motion:

Chan and Vese model position Energy functionals for image segmentation Important to distinguish the model and the representation Model: describing problems from the real world with equations Representation: type of the description Optimization: solving the equations Chan and Vese model Representation/optimization Contour based gradient descent Level set based gradient descent

Chan and Vese model The model is based on trying to separate the image into regions based on intensities The minimization problem:

Chan and Vese model c1 and c2 are the average intensity levels inside and outside of the contour Experiments:

Relation with the Mumford-Shah functional The Chan and Vese model is a special case of the Mumford Shah model (minimal partition problem) =0 and 1=2= u=average(u0 in/out) C is the CV active contour “Cartoon” model

Level set formulation Considering the disadvantages of the active contour representation the model is solved using level set formulation level set form -> no explicit contour

Replacing C with Φ Introducing the Heaviside (sign) and Dirac (PSF) functions

Replacing C with Φ The intensity terms

Average intensities We can calculate the average intensities using the step function

Level set formulation of the model Combining the above presented energy terms we can write the Chan and Vese functional as a function of Φ. Minimization F wrt. Φ -> gradient descent The corresponding Euler-Lagrange equation:

Approximation of the Curvature

The algorithm Initialization n=0 repeat Computing c1 and c2 Evolving the level-set function until the solution is stationary, or n>nmax

Initialization We set the values of the level set function outside = -1 inside = 1 Any shape can be the initialization shape init() for all (x, y) in Phi if (x, y) is inside Phi(x, y)=1; else Phi(x, y)=-1; fi; end for

Computing c1 and c2 The mean intensity of the image pixels inside and outside colors() out = find(Phi < 0); in = find(Phi > 0); c1 = sum(Img(in)) / size(in); c2 = sum(Img(out)) / size(out);

Finite differences for all (x, y) fx(x, y) = (Phi(x+1, y)-Phi(x-1, y))/(2*delta_s); fy(x, y) =… fxx(x, y) =… fyy(x, y) =… fxy(x, y) =… delta_s recommended between 0.1 and 1.0

Curvature Be careful! Grad can be 0! grad = (fx.^2.+fy.^2); curvature = (fx.^2.*fyy + fy.^2.*fxx - 2.*fx.*fy.*fxy) ./ (grad.^1.5); Be careful! Grad can be 0!

Force We should normalize the force. abs(force) <= 1! Main step: gradient_m = (fx.^2.+fy.^2).^0.5; force = mu * curvature .* gradient_m - nu – lambda1 * (image - c1).^2 + lambda2 * (image - c2).^2; We should normalize the force. abs(force) <= 1! Main step: Phi=Phi+deltaT*force; deltaT is recommended between 0.01 and 0.9. Be careful deltaT<1!

Narrow band It is useful to compute the level set function not on the whole image domain but in a narrow band near to the contour. Abs()<d Decreasing the computational complexity.

Narrow band Initialization n=0 repeat Determination of the narrow band Computing c1 and c2 Evolving the level-set function on the narrow band Re-initialization until the solution is stationary, or n>nmax

Re-initialization Optional step H is a normalizing term recommended between 0.1 and 2. deltaT time step see above!

Stop criteria Stop the iterations if: The maximum iteration number were reached Stationary solution: The energy is not changing The contour is not moving …

Demonstration of the program Thanks for your attention

MATLAB tutorial Imread, imwrite .*, .^, ./ Find Size, length, max, min, mod, sum, zeros, ones A(x:y, z:v) Visualization: figure, plot, surf, imagesc