×

### Let's log you in.

or

Don't have a StudySoup account? Create one here!

×

or

16

0

2

# Class Note for EECS 841 with Professor Potetz at KU (5)

Marketplace > Kansas > Class Note for EECS 841 with Professor Potetz at KU 5

No professor available

These notes were just uploaded, and will be ready to view shortly.

Either way, we'll remind you when they're ready :)

Get a free preview of these Notes, just enter your email below.

×
Unlock Preview

COURSE
PROF.
No professor available
TYPE
Class Notes
PAGES
2
WORDS
KARMA
25 ?

## Popular in Department

This 2 page Class Notes was uploaded by an elite notetaker on Friday February 6, 2015. The Class Notes belongs to a course at Kansas taught by a professor in Fall. Since its upload, it has received 16 views.

×

## Reviews for Class Note for EECS 841 with Professor Potetz at KU (5)

×

×

### What is Karma?

#### You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!

Date Created: 02/06/15
EECS 841 Computer Vision Brian Potetz Fall 2008 Lecture 10 Active Contours Energy Models Suggested Reading D H Ballard C M Brown quotComputer Vision Sect 45 A Approach I L G Shapiro G C Stockman quotComputer Vision Section 143 Energy Model Kass Witkin Terzopoulos quotSnakes Active Contour Models IJCV 1988 Energy Model From Edges to Weighted Graphs One way to de ne a directed graph Directed graph Original image Gradient magnitude lVIxyl Let the cost of each arc be M V1an where Xy is the point on the image corresponding to the destination node of the arc Finding the LeastCost Path The A algorithm 1 Initialize the queue with the path from the source vertex to itself 2 Until the rst path in the queue reaches the destination vertex i Remove the rst path from the queue For each neighbor of the last node in this path create a new path ii If a new path terminates in a node that has already been explored and no path in the queue terminates in that node delete that new path iii If a new path terminates in a node that has already been explored and there is a path in the queue that terminates in that node delete the path that has the greatest cost iv Sort the queue by the cost of the paths Improving Search Performance When performing A let the cost of each path be the sum of the weights of all arcs traversed plus the some lowerbound estimate of the cost of traversing the remaining distance to the destination node in fact the search algorithm is not called A unless it uses this technique minwj e gt 0 Cost12 acn w12 w23 wgnil gn E 39 ibdestz39natz39on Energy Minimization De ne a continuous curve through the image 718 01 gt R2 718 948 W Minimize some energy function of that curve Typical Snake Energies Elasticity BelasticvO aswsl2ds Stiffness Estiffnessv O 38 lv sl2ds Edge Proximity Esme e lVIzsyltsl2ds 1 User interaction EuservO Userzsysds Numerical Solution Euler Lagrange Equation If Ev JFsvv39vquotds is minimized then 2 Fx ia 6 2F 0 6s 6s a 62 Fy ngr as 2Fyu 0 Facial Tracking Using Snakes

×

×

### BOOM! Enjoy Your Free Notes!

×

Looks like you've already subscribed to StudySoup, you won't need to purchase another subscription to get this material. To access this material simply click 'View Full Document'

## Why people love StudySoup

Steve Martinelli UC Los Angeles

#### "There's no way I would have passed my Organic Chemistry class this semester without the notes and study guides I got from StudySoup."

Jennifer McGill UCSF Med School

#### "Selling my MCAT study guides and notes has been a great source of side revenue while I'm in school. Some months I'm making over \$500! Plus, it makes me happy knowing that I'm helping future med students with their MCAT."

Jim McGreen Ohio University

Forbes

#### "Their 'Elite Notetakers' are making over \$1,200/month in sales by creating high quality content that helps their classmates in a time of need."

Become an Elite Notetaker and start selling your notes online!
×

### Refund Policy

#### STUDYSOUP CANCELLATION POLICY

All subscriptions to StudySoup are paid in full at the time of subscribing. To change your credit card information or to cancel your subscription, go to "Edit Settings". All credit card information will be available there. If you should decide to cancel your subscription, it will continue to be valid until the next payment period, as all payments for the current period were made in advance. For special circumstances, please email support@studysoup.com

#### STUDYSOUP REFUND POLICY

StudySoup has more than 1 million course-specific study resources to help students study smarter. If you’re having trouble finding what you’re looking for, our customer support team can help you find what you need! Feel free to contact them here: support@studysoup.com

Recurring Subscriptions: If you have canceled your recurring subscription on the day of renewal and have not downloaded any documents, you may request a refund by submitting an email to support@studysoup.com