Level Set Framework, Signed Distance Function, and Various Tools



Similar documents
Level Set Methods and Dynamic Implicit Surfaces

The Math Circle, Spring 2004

A QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS

Math 241, Exam 1 Information.

The Heat Equation. Lectures INF2320 p. 1/88

Electromagnetism - Lecture 2. Electric Fields

Mechanics 1: Conservation of Energy and Momentum

1.3. DOT PRODUCT If θ is the angle (between 0 and π) between two non-zero vectors u and v,

SOLUTIONS. f x = 6x 2 6xy 24x, f y = 3x 2 6y. To find the critical points, we solve

3D Modelling and Volume Rotation of 2D Medical Images

Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh

Lecture 3: Linear methods for classification

Support Vector Machines Explained

88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a

Determine whether the following lines intersect, are parallel, or skew. L 1 : x = 6t y = 1 + 9t z = 3t. x = 1 + 2s y = 4 3s z = s

Pacific Journal of Mathematics

Some Comments on the Derivative of a Vector with applications to angular momentum and curvature. E. L. Lady (October 18, 2000)

Math 265 (Butler) Practice Midterm II B (Solutions)

Solutions for Review Problems

Derivation of the Laplace equation

Method To Solve Linear, Polynomial, or Absolute Value Inequalities:

1 3 4 = 8i + 20j 13k. x + w. y + w

Outline Lagrangian Constraints and Image Quality Models

Review Sheet for Test 1

8.1 Examples, definitions, and basic properties

Chapter 2. Parameterized Curves in R 3

H.Calculating Normal Vectors

Derive 5: The Easiest... Just Got Better!

42 CHAPTER 1. VECTORS AND THE GEOMETRY OF SPACE. Figure 1.18: Parabola y = 2x Brief review of Conic Sections

Chapter 2. Mission Analysis. 2.1 Mission Geometry

Notes on the representational possibilities of projective quadrics in four dimensions

α = u v. In other words, Orthogonal Projection

Curves and Surfaces. Goals. How do we draw surfaces? How do we specify a surface? How do we approximate a surface?

The continuous and discrete Fourier transforms

Linear algebra and the geometry of quadratic equations. Similarity transformations and orthogonal matrices

MATH 425, PRACTICE FINAL EXAM SOLUTIONS.

2. Length and distance in hyperbolic geometry

Math Assignment 6

Scalar Valued Functions of Several Variables; the Gradient Vector

13.4 THE CROSS PRODUCT

2013 MBA Jump Start Program

Astromechanics Two-Body Problem (Cont)

Mathematical Physics, Lecture 9

Review of Vector Analysis in Cartesian Coordinates

Linear Equations and Inequalities

Section 1.1. Introduction to R n

Core Maths C2. Revision Notes

Several Views of Support Vector Machines

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis

Fixed Point Theorems

t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).

Concepts in Calculus III

A neurogeometrical model for image completion and visual illusion

Solutions to old Exam 1 problems

THE EIGENVALUES OF THE LAPLACIAN ON DOMAINS WITH SMALL SLITS

MA 408 Computer Lab Two The Poincaré Disk Model of Hyperbolic Geometry. Figure 1: Lines in the Poincaré Disk Model

ALMOST COMMON PRIORS 1. INTRODUCTION

Use Geometry Expressions to find equations of curves. Use Geometry Expressions to translate and dilate figures.

Path Tracking for a Miniature Robot

Linear Threshold Units

Geometric evolution equations with triple junctions. junctions in higher dimensions

Support Vector Machines with Clustering for Training with Very Large Datasets

We can display an object on a monitor screen in three different computer-model forms: Wireframe model Surface Model Solid model

Section 11.1: Vectors in the Plane. Suggested Problems: 1, 5, 9, 17, 23, 25-37, 40, 42, 44, 45, 47, 50

2 Integrating Both Sides

Definition 8.1 Two inequalities are equivalent if they have the same solution set. Add or Subtract the same value on both sides of the inequality.

FURTHER VECTORS (MEI)

Two vectors are equal if they have the same length and direction. They do not

Computation of crystal growth. using sharp interface methods

Constrained curve and surface fitting

SOLID MECHANICS TUTORIAL MECHANISMS KINEMATICS - VELOCITY AND ACCELERATION DIAGRAMS

RAJALAKSHMI ENGINEERING COLLEGE MA 2161 UNIT I - ORDINARY DIFFERENTIAL EQUATIONS PART A

Differentiation of vectors

Computer Graphics. Geometric Modeling. Page 1. Copyright Gotsman, Elber, Barequet, Karni, Sheffer Computer Science - Technion. An Example.

Chapter 22: Electric Flux and Gauss s Law

+ 4θ 4. We want to minimize this function, and we know that local minima occur when the derivative equals zero. Then consider

2.3 Convex Constrained Optimization Problems

How do you compare numbers? On a number line, larger numbers are to the right and smaller numbers are to the left.

Exam 1 Sample Question SOLUTIONS. y = 2x

Oscillations. Vern Lindberg. June 10, 2010

MATH 21. College Algebra 1 Lecture Notes

HETEROGENEOUS AGENTS AND AGGREGATE UNCERTAINTY. Daniel Harenberg University of Mannheim. Econ 714,

Biggar High School Mathematics Department. National 5 Learning Intentions & Success Criteria: Assessing My Progress

Part II Redundant Dictionaries and Pursuit Algorithms

CHAPTER IV - BROWNIAN MOTION

2.2 Magic with complex exponentials

Equations Involving Lines and Planes Standard equations for lines in space

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

MATH 4552 Cubic equations and Cardano s formulae

11.1. Objectives. Component Form of a Vector. Component Form of a Vector. Component Form of a Vector. Vectors and the Geometry of Space

Fundamental Theorems of Vector Calculus

Vector Spaces; the Space R n

S. Boyd EE102. Lecture 1 Signals. notation and meaning. common signals. size of a signal. qualitative properties of signals.

Core Maths C1. Revision Notes

CSCI567 Machine Learning (Fall 2014)

Algebra Practice Problems for Precalculus and Calculus

Increasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.

Lecture L22-2D Rigid Body Dynamics: Work and Energy

2.1 Three Dimensional Curves and Surfaces

Transcription:

Level Set Framework Geometry and Calculus Tools Level Set Framework,, and Various Tools Spencer Department of Mathematics Brigham Young University Image Processing Seminar (Week 3), 2010

Level Set Framework Geometry and Calculus Tools 1 Level Set Framework 2 3 Geometry and Calculus Tools Calculus Tools

Level Set Framework Geometry and Calculus Tools Given a closed hypersurface, Γ, our goal is to evolve and track this hypersurface over time, Γ(t), as it moves in the normal direction according to a given function, F. We do so by embedding Γ as the zero level set of a one dimension higher surface, φ. To be more specific about how this embedding works, we need some notation. Notation: At any specific time, t, we will denote Ω + = region outside Γ(t). Ω = Γ(t). Ω = region inside Γ(t).

Level Set Framework Geometry and Calculus Tools Define φ We start off by defining φ at time t = 0 as, Initialize φ φ( x, t = 0) = ±d, x R n We will discuss this d and the consequences of using it in then next section.

Level Set Framework Geometry and Calculus Tools Level Set Equation For each x Ω, we want φ( x(t), t) = 0. Thus we have the identity so by chain rule, we get φ( x(t), t) = 0 t φ t + φ x t = 0 which by remembering that for each x Ω, x t n = F ( x). We get that φ x t = F φ so, we have the level set equation which when coupled with the initial location of Γ gives us an initial value pde.

Level Set Framework Geometry and Calculus Tools Level Set Method Initial Value Problem φ t + F φ = 0 Γ = { x φ( x, t = 0) = 0} F can be a function of local, global or independent properties to φ. The real innovation in applications of the level set method is in the specific F used to give different effects to the front Γ.

Level Set Framework Geometry and Calculus Tools Initialize φ We defined our initial surface φ to be the Euclidean distance from x to Γ. Distance Function φ( x, t = 0) = ±d, x R n

Level Set Framework Geometry and Calculus Tools Formally, we define the distance from a point x to a set Ω Distance Function d( x) = min x C Ω ( x x C ) then our φ takes on the distance from the boundary with a sign depending on being inside or outside the region, d( x) x Ω φ( x) = 0 x Ω d( x) x Ω +

Level Set Framework Geometry and Calculus Tools Why a? There are a number of properties of this specific definition of φ which help with the numerics of solving this level set problem. Any function which is negative inside and positive outside the initial front would work, but the signed distance function gives many nice properties. We will enumerate some in the slides to come. The Fast Marching Method is an efficient method for creating the signed distance function for any arbitrary initial closed fronts.

Level Set Framework Geometry and Calculus Tools Properties of Main Property φ = 1 This is true for all points except if it they are equidistant from at least 2 points on the interface. This set of points is often called a skeleton in the literature and is a zero measure set. Luckily the existence of this skeleton does not cause any issues with the numerics as it will be smoothed over time. Thus, the fact that the gradient is not technically defined on this skeleton will not affect our numerical solutions to the level set equation.

Level Set Framework Geometry and Calculus Tools Properties of More Properties The Unit Normal Vector Mean Curvature κ = n = φ φ = φ 1 = φ ( ) φ = ( φ) = 2 φ = φ φ

Level Set Framework Geometry and Calculus Tools Properties of Closest Point on Interface Given x R n, then the closest point on the boundary Ω is x c = x φ( x) n Differentiability on Ω φ is differentiable on Ω almost everywhere. Convexity If Ω is a convex region, then φ is a convex function.

Level Set Framework Geometry and Calculus Tools Properties of Given φ 1 and φ 2 signed distance functions for regions Γ 1 and Γ 2 respectively Combinations of s φ( x) = min(φ 1 ( x), φ 2 ( x)) represents the distance function for the union Γ 1 Γ 2. φ( x) = max(φ 1 ( x), φ 2 ( x)) represents the distance function for the intersection Γ 1 Γ 2. φ( x) = max(φ 1 ( x), φ 2 ( x)) represents the distance function for the set subtraction Γ 1 \Γ 2.

Level Set Framework Geometry and Calculus Tools Examples of s Circle A circle of radius r centered at (a, b). φ( x) = (x a) 2 + (y b) 2 r Sphere A sphere of radius r centered at a, b, c. φ( x) = (x a) 2 + (y b) 2 + (z c) 2 r

Level Set Framework Geometry and Calculus Tools Examples of s Ellipse An ellipse centered at (a, b). φ( x) = (x a) 2 A + (y b)2 B 1 Square A square of width w centered at (a, b). { max ( x a w, y b w), x Ω + φ( x) = min ( x a w, y b w), x Ω

Level Set Framework Geometry and Calculus Tools Characteristic function χ. A nice function for integrals is the characteristic function, sometimes called the indicator function. Characteristic function of interior regions and exterior regions { χ 1, if φ( x) 0 ( x) = 0, if φ( x) > 0 { χ + 0, if φ( x) 0 ( x) = 1, if φ( x) > 0

Level Set Framework Geometry and Calculus Tools Volume Integrals The volume integral (area, length) of a function f on a region Ω is Volume integral V (Ω ) = f ( x)χ ( x)d x R n

Level Set Framework Geometry and Calculus Tools Heaviside Function We can define the heaviside function to do the same job as the characteristic function as a function of φ. Heaviside Function H(φ) = { 0, if φ 0 1, if φ > 0 which allows us to define the volume integrals V (Ω ) = f ( x)[1 H(φ( x)]d x R n V (Ω + ) = f ( x)h(φ( x)d x R n

Level Set Framework Geometry and Calculus Tools Dirac Delta Function We define the Dirac delta function to be the directional derivative of the heaviside function, H in the normal direction n. ˆδ(x) = H (φ(x)) n = H (φ(x)) φ(x) = H (φ(x)) φ(x) = δ(φ(x)) φ(x) φ(x) φ(x) where δ(φ) = H (φ) is the 1-D version of the Dirac delta function which evaluates to 1 where φ = 0 and 0 everywhere else.

Level Set Framework Geometry and Calculus Tools Surface Integrals The surface integral of a function f over a boundary Ω is defined to be Surface integral R n f ( x)ˆδ( x)d x

Level Set Framework Geometry and Calculus Tools Smeared Heaviside Function When doing these numerically, we use a smeared-out heaviside and delta function to make the calculations. Smeared-out Heaviside and Dirac delta functions 0, ( ) φ < ɛ 1 H(φ) = 2 + φ 2ɛ + 1 2π sin πφ ɛ, ɛ φ ɛ 1, ɛ < φ 0, ( ) φ < ɛ 1 δ(φ) = 2ɛ + 1 2ɛ cos πφ ɛ, ɛ φ ɛ 0, ɛ < φ where ɛ is a tunable parameter for the smearing bandwidth. Osher recommends to use ɛ = 1.5 x.

Level Set Framework Geometry and Calculus Tools Smeared Heaviside Function The smeared-out heaviside and delta function lead to first order accurate, O( x), calculations of the surface and volume integrals. For the signed distance function, φ = 1, so we get the simplified versions Simplified Volume and Surface Integrals for signed distance function R n f ( x)δ(φ( x))d x = Surface integral of f on Ω R n f ( x)h(φ( x))d x = Volume integral of f on Ω Note that if f = 1, then this yields the surface area or volume of Ω or Ω respectively.

Level Set Framework Geometry and Calculus Tools Any Questions?