An Efficient and Fast Active Contour Model for Salient Object Detection Authors: Farnaz Shariat, Riadh Ksantini, Boubakeur Boufama

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

LEUCEMIA MIELOIDE AGUDA TIPO 0
An Active contour Model without Edges
CHAPTER 1: COMPUTATIONAL MODELLING
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Image Segmentation with Level Sets Group reading
ZMQS ZMQS
Active Contours without Edges
Photo Composition Study Guide Label each photo with the category that applies to that image.
Solve Multi-step Equations
ABC Technology Project
Total Variation and Geometric Regularization for Inverse Problems
Johann Radon Institute for Computational and Applied Mathematics: 1/25 Signal- und Bildverarbeitung, Image Analysis and Processing.
© S Haughton more than 3?
Chapter 2 Section 3.
Squares and Square Root WALK. Solve each problem REVIEW:
Energy & Green Urbanism Markku Lappalainen Aalto University.
DTAM: Dense Tracking and Mapping in Real-Time
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
1/22 Worst and Best-Case Coverage in Sensor Networks Seapahn Meguerdichian, Farinaz Koushanfar, Miodrag Potkonjak, and Mani Srivastava IEEE TRANSACTIONS.
Solve an equation by multiplying by a reciprocal
Copyright © Cengage Learning. All rights reserved.
Foundations of Data Structures Practical Session #11 Sort properties, Quicksort algorithm.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
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
Usage of Sobolev metric to detect an object’s boundaries Supervisor: Arie Nahkmani Students: Yoav Ben-Raphael Itzik Ben-Basat.
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.
Image Segmentation some examples Zhiqiang wang
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
1 Lecture #5 Variational Approaches and Image Segmentation Lecture #5 Hossam Abdelmunim 1 & Aly A. Farag 2 1 Computer & Systems Engineering Department,
Active Contour Models (Snakes)
Deformable Contours Dr. E. Ribeiro.
Local or Global Minima: Flexible Dual-Front Active Contours Hua Li Anthony Yezzi.
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.
Evolving Curves/Surfaces for Geometric Reconstruction and Image Segmentation Huaiping Yang (Joint work with Bert Juettler) Johannes Kepler University of.
Dual Evolution for Geometric Reconstruction Huaiping Yang (FSP Project S09202) Johannes Kepler University of Linz 1 st FSP-Meeting in Graz, Nov ,
2008/10/02H704 - DYU1 Active Contours and their Utilization at Image Segmentation Author : Marián Bakoš Source : 5th Slovakian-Hungarian Joint Symposium.
Deformable Models Segmentation methods until now (no knowledge of shape: Thresholding Edge based Region based Deformable models Knowledge of the shape.
Lecture 6 : Level Set Method
Introduction to Level Set Methods: Part II
CS 641 Term project Level-set based segmentation algorithms Presented by- Karthik Alavala (under the guidance of Dr. Jundong Liu)
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.
Muazzam Shehzad Quratulain Muazzam
Paper Review Zhiqiang 9/21/12
Presentation transcript:

An Efficient and Fast Active Contour Model for Salient Object Detection Authors: Farnaz Shariat, Riadh Ksantini, Boubakeur Boufama University of Windsor May 2009

2 Presentation Outline  Introduction  Active contours  Level sets  A variational level set method  Polarity information  The active contour model using polarity information  Experiments An Efficient and Fast Active Contour Model for Salient Object Detection

3 Active Contours  Image Segmentation solution  Based on Deformable models  Find equation  Parametric Represent curves and surfaces explicitly in their parametric forms during deformation; (Kass 1987 )  Geometric Based on curve evolution and the level set method, Represent curves and surfaces implicitly as a level set of a function; (Caselles 1993) An Efficient and Fast Active Contour Model for Salient Object Detection

Active Contours(cont’d)  limitations of parametric AC  Initial contour dependant  Same topology  Geometric ACs provide elegant solution  Based on level set, curve evolution An Efficient and Fast Active Contour Model for Salient Object Detection 4

5 Level sets  Main Idea:  Closed interface Γ, velocity v  Goal: motion of the interface  Osher and Sethian1988 idea:  Represent the interface by implicit smooth function φ  φ = (x, t) =0, Γ  φ = (x, t) <0, Γ in  φ = (x, t) >0, Γ out  An Efficient and Fast Active Contour Model for Salient Object Detection

6 Level sets(cont’d)  Remains a valid function change topology  Computationally simple  Start far from boundaries An Efficient and Fast Active Contour Model for Salient Object Detection

7 Level sets (cont’d)  Classical vs. Variational  Variational methods are suitable for incorporating additional information originated from a certain evolution PDE of a parameterized curve originated from minimizing the energy function

An Efficient and Fast Active Contour Model for Salient Object Detection 8 Level sets (cont’d)  Reshaping (re-initialization)  φ can develop shocks inaccurate computation  To avoid  Initialize φ as a signed distance function  Reshape φ as a signed distance function regularly  Drawbacks  Displacement of the zero level set  Increasing of the number of iteration  Expensive, Complex  Ad hoc manner

9 Variational level set  C. Li, C. Xu, C. Gu, M.D. Fox, “Level set evolution without re-initialization: a new variational formulation”, CVPR, 2005  Energy function : Keeping the function close to sign distance function Moving toward the boundaries An Efficient and Fast Active Contour Model for Salient Object Detection

10 Variational level set (cont‘d)  Advantages Initialization is automatic No need for reinitialize Computationally effective An Efficient and Fast Active Contour Model for Salient Object Detection Active contour result using Li’s algorithm

11 Variational level set (cont‘d)  Problem  Noisy background  Textured background Proposed Solution  Proposed Solution Using “ Polarity information ” instead of gradient with “ Level sets ” An Efficient and Fast Active Contour Model for Salient Object Detection Active contour result using Li’s algorithm

12 Polarity information  Common edge detectors  Polarity [Carson, 1997], discriminates boundaries  A measure of the extent to which the gradient vectors in a certain neighbourhood all point in the dominant orientation. An Efficient and Fast Active Contour Model for Salient Object Detection #gradient vectors in are in + side of dominant orientation #gradient vectors in are in - side of dominant orientation

13 Polarity Values An Efficient and Fast Active Contour Model for Salient Object Detection Edge Noise Texture i.e. E - =0, E + !=0 E + ~ 0 E - ~ 0 E + = E -

14 The Active Contour Model Using Polarity Information  Instead of Gradient in E ext use Polarity  Combine “Polarity based stopping function” with “Variational Level Set” An Efficient and Fast Active Contour Model for Salient Object Detection

15 The Active Contour Model Using Polarity Information  The final energy function is An Efficient and Fast Active Contour Model for Salient Object Detection

16 The Active Contour Model Using Polarity Information  Then by using energy minimization method to minimize the total energy it can reach to:  And by using gradient descent, the approximation of the above formula is: An Efficient and Fast Active Contour Model for Salient Object Detection

17 Results An Efficient and Fast Active Contour Model for Salient Object Detection

18 Results An Efficient and Fast Active Contour Model for Salient Object Detection

19 Results An Efficient and Fast Active Contour Model for Salient Object Detection

20 Results An Efficient and Fast Active Contour Model for Salient Object Detection

21 Results An Efficient and Fast Active Contour Model for Salient Object Detection

Any Questions Thank you for your Attention