Download presentation

Presentation is loading. Please wait.

Published byAmanda Charity Modified about 1 year ago

1
Usage of Sobolev metric to detect an object’s boundaries Supervisor: Arie Nahkmani Students: Yoav Ben-Raphael Itzik Ben-Basat

2
Agenda Introduction Project Definitions & Goals Motivation & Background Theory: –Chan Vese –Sobolev Sobolev Algorithm Stages Suggested Sobolev Improvement Implementation Results Conclusion & Future Development

3
Introduction Active Contour –AKA Snakes –Framework for separating an object outline from a possibly noisy 2D image –Minimize an energy associated with the contour as a sum of an internal and external energy

4
Project Definitions & Goals Implement the Sobolev Algorithm in Matlab using the article “Sobolev Active Contours” by Ganesh Sundaramoorthi. Optimize code through Vectorization Test a suggested optimization for Sobolev

5
Motivation & Background Theory Chan-Vese method –Region Based Active Contour –Minimization of an energy based-segmentation: –Move Contour according to the Energy Gradient

6
Motivation & Background Theory Chan Vese method intuition: I = 1 I = 0

7
Motivation & Background Theory Chan Vese in Action:

8
Motivation & Background Theory Chan Vese Main Problem - Noise: –Contour becomes non-smooth instantly –Gradient depends on local derivatives: non-smooth curve inaccurate derivatives. –Points evolve independently, not collectively Possible Solution: –Add a penalty to the curve’s length in the Energy function –But then the Energy Function is altered…

9
Motivation & Background Theory Chan Vese Main Problem Demonstration:

10
Motivation & Background Theory Sobolev Method –A new way of doing Active Contours –Existing methods can benefit Sobolev main idea: –Represent the set of all smooth curves as an abstract space M. –A path on M looks like a morph between two contours.

11
Motivation & Background Theory

12
Region Based Active Contours -The Energy Gradient is the most efficient curve evolution. -Define Sobolev Inner Products based on the abstract space M. -Develop the Sobolev Gradient from the Sobolev Inner Product. -Non smooth contours unlikely due to derivatives in the Sobolev Gradient.

13
Motivation & Background Theory Minimize the energy defined on contours The gradient is the most efficient perturbation:

14
Motivation & Background Theory Sobolev Inner Product: Sobolev Gradient:

15
Motivation & Background Theory Properties of the Sobolev Gradient –Like Chan-Vese, it does not depend on a particular parameterization of the curve. –less sensitive to noise. –Can be implemented on existing methods!!!

16
Motivation & Background Theory Sobolev implemented on Chan Vese:

17
Sobolev Algorithm Stages

18
Suggested Sobolev Improvement After Matlab code was written and verified an improvement to the Sobolev algorithm was suggested. Hypothesis: Sorting the arc length vector, improves the Sobolev method.

19
Implementation Results Square With Added Noise Original ModelSorted Model

20
Implementation Results Hand Drawing With Added Noise Original ModelSorted Model

21
Implementation Results Church Original ModelSorted Model

22
Implementation Results Boy At The Beach Original ModelSorted Model

23
Implementation Results Flower Original ModelSorted Model

24
Conclusion & Future Development Conclusion: Not much noticeable difference between the two models But… –Original Sobolev Model handles noisy images better –Sorted Sobolev model is better tuned to the edges of real images (pointy edges).

25
Conclusion & Future Development Future Development –Test both models in video tracking –Add level sets to the Chan Vese model

26
THANK YOU!

Similar presentations

© 2016 SlidePlayer.com Inc.

All rights reserved.

Ads by Google