Image Analysis. Active contour models (snakes)
|
|
- George Willis
- 6 years ago
- Views:
Transcription
1 Image Analyss Actve contour models (snakes) Chrstophoros Nkou Images taken from: Computer Vson course by Krsten Grauman, Unversty of Texas at Austn. Unversty of Ioannna - Department of Computer Scence and Engneerng
2 Deformable contours a.k.a. actve contours, snakes Gven: ntal contour (model) near desred object [Snakes: Actve contour models, Kass, Wtkn, & Terzopoulos, ICCV987] Fgure credt: Yur Boykov
3 3 Deformable contours (cont.) Gven: ntal contour (model) near desred object Goal: evolve the contour to ft exact object boundary Man dea: elastc band s teratvely adjusted so as to be near mage postons wth hgh gradents, and satsfy shape preferences or contour prors [Snakes: Actve contour models, Kass, Wtkn, & Terzopoulos, ICCV987]
4 4 Deformable contours (cont.) Image from
5 5 Deformable contours vs Hough Both are useful for shape fttng but they dffer sgnffcanlty: ntal ntermedate fnal Hough Rgd model shape Sngle votng pass can detect multple nstances Deformable contours Pror on shape types, but shape teratvely adjusted (deforms) Requres ntalzaton nearby One optmzaton pass to ft a sngle contour
6 6 Deformable contours (why?) Some objects have smlar basc form but some varety n the contour shape.
7 7 Deformable contours (why?) Non-rgd, deformable objects can change ther shape over tme, e.g. lps, hands
8 8 Deformable contours (why?) Non-rgd, deformable objects can change ther shape over tme, e.g. lps, hands
9 9 Deformable contours (why?) Non-rgd, deformable objects can change ther shape over tme.
10 0 Aspects to consder Representaton of the contours Defnng the energy functons External Internal Mnmzng the energy functon Extensons: Trackng Interactve segmentaton
11 Aspects to consder Representaton of the contours Defnng the energy functons External Internal Mnmzng the energy functon Extensons: Trackng Interactve segmentaton
12 Representaton We ll consder a dscrete representaton of the contour, consstng of a lst of D pont postons ( vertces ). ( x 0, y0 ) ( x, y 9 9) ( x, y ), for 0,,, n At each teraton, we ll have the opton to move each vertex to another nearby locaton ( state ).
13 3 Fttng deformable contours How should we adjust the current contour to form the new contour at each teraton? Defne a cost functon ( energy functon) that says how good a canddate confguraton s. Seek next confguraton that mnmzes that cost functon. ntal ntermedate fnal
14 4 Aspects to consder Representaton of the contours Defnng the energy functons External Internal Mnmzng the energy functon Extensons: Trackng Interactve segmentaton
15 5 Energy functon The total energy (cost) of the current snake s defned as: E total E nternal E external Internal energy: encourages pror shape preferences: e.g., smoothness, elastcty, partcular known shape. External energy ( mage energy): encourages contour to ft on places where mage structures exst, e.g., edges. A good ft between the current deformable contour and the target shape n the mage wll yeld a low value for ths cost functon.
16 6 External energy It measures how well the curve matches the mage data It Attracts the curve toward dfferent mage features Edges, lnes, texture gradent, etc.
17 7 External energy (cont.) How do edges affect the shape of the rubber band? Thnk of external energy from mage as gravtatonal pull towards areas of hgh contrast Magntude of gradent - (Magntude of gradent) G ( I) G ( I) x y G ( I) G ( I) x y
18 8 External energy (cont.) G x ( x, y) ( x, y) Gradent mages and G y External energy at a pont on the curve s: E external ( ) ( G x ( ) G y ( ) ) External energy for the whole curve: E external n Gx( x, y ) Gy ( x, y 0 )
19 9 Dstance transform External mage can nstead be taken from the dstance transform of the edge mage. orgnal - gradent edges Dstance transform Value at (x,y) ndcates how far that poston s from the nearest edge pont
20 0 Internal energy: ntuton What are the underlyng boundares n ths fragmented edge mage? And n ths one?
21 Internal energy: ntuton (cont.) A pror, we want to favor smooth shapes, contours wth low curvature, contours smlar to a known shape, etc. to balance what s actually observed (.e., n the gradent mage).
22 Internal energy For a contnuous curve, a common nternal energy term s the bendng energy. At some pont v(s) on the curve, ths s: d d E nternal ( ( s)) ds d s Tenson, Elastcty Stffness, Curvature
23 3 For our dscrete representaton, Internal energy for the whole curve: 0 ), ( n y x v ds d ) ( ) ( ds d 0 n nternal E Note these are dervatves relatve to poston---not spatal mage gradents. Why do these reflect tenson and curvature? Internal energy
24 4 Example (curvature) E curvature( v ) (,5) (,) ( x x x ) ( y y y ) (,) (3,) (,) (3,)
25 5 Penalze elastcty Current elastc energy defnton uses a dscrete estmate of the dervatve: Eelastc n 0 n ( x x ) ( y y ) 0 What s the possble problem wth ths defnton?
26 6 Penalze elastcty (cont.) Current elastc energy defnton uses a dscrete estmate of the dervatve: Eelastc n 0 Instead, we may employ: n 0 ( x x ) ( y y d ) where d s the average dstance between pars of ponts updated at each teraton.
27 7 Mssng data The preferences for low-curvature, smoothness help deal wth mssng data: Illusory contours found!
28 8 Extend the nternal energy by a shape pror If the object s a smooth varaton of a known shape, we can use a term that wll penalze devaton from that shape: Enternal n 0 ( ˆ ) ˆ } { where are the ponts of the known shape.
29 9 external nternal total E E E 0 n nternal d E 0 ), ( ), ( y n x external y x G y x G E Total energy
30 30 Total energy (cont.) e.g., weght controls the penalty for nternal elastcty large medum small Fg from Y. Boykov
31 3 Recap A smple elastc snake s defned by: A set of n ponts, An nternal energy term (tenson, bendng, plus optonal shape pror) An external energy term (gradentbased) To segment an object: Intalze n the vcnty of the object Modfy the ponts to mnmze the total energy
32 3 Aspects to consder Representaton of the contours Defnng the energy functons External Internal Mnmzng the energy functon Extensons: Trackng Interactve segmentaton
33 33 Energy mnmzaton Several algorthms have been proposed to ft deformable contours. We ll look at: Greedy search Dynamc programmng (for D snakes) Calculus of varatons
34 34 Energy mnmzaton (greedy) For each pont, defne a search wndow around t and move to where energy functon s mnmal Typcal wndow sze, e.g., 5 x 5 pxels Stop when a predefned number of ponts have not changed n last teraton, or after a maxmum number of teratons Note: Convergence not guaranteed Need decent ntalzaton
35 35 Energy mnmzaton (dynamc programmng) v 3 v v v 4 v 5 v 6 The Vterb algorthm. Iterate untl optmal poston for each pont s the center of the box,.e., the snake s optmal n the local search space constraned by boxes. [Amn, Weymouth, Jan, 990]
36 36 Dynamc programmng Possble because snake energy can be rewrtten as a sum of par-wse nteracton potentals: E total n,, n) E (, ) ( Or sum of trple-nteracton potentals. E total n,, n) E (,, ) (
37 37 ), ( ), ( ),,,,, ( y n x n n total y x G y x G y y x x E ) ( ) ( n y y x x ) ( ),, ( n n total G E n ), (... ), ( ), ( ),, ( 3 n n n n total v v E v v E v v E E ) ( ), ( G E where Re-wrtng the above wth : y x v, Snake energy: par-wse nteractons
38 38 Vterb algorthm Man dea: determne the optmal poston (state) of predecessor, for each possble poston of self. Then backtrack from best state for last vertex. E total E ( v, v) E( v, v3)... En ( vn, v n ) E( v, v) E( v, v3) E3( v3, v4) v v v3 4 E4( v4, v5 ) v v5
39 vertces 39 Vterb algorthm (cont.) E total E ( v, v) E( v, v3)... En ( vn, v n ) states m E () E () E (3) E( v, v) E( v, v3) E3( v3, v4) v v v3 v E ( m) 0 Complexty: E () E () E (3) E ( m) O( nm ) E 3 () E 3 () E 3 (3) E ( ) E 4 ( m) 3 m E 4 () E 4 () E 4 (3) E ( v 4, v 4 n vs. brute force search? ) v n E n () E n () E n (3) E n (m)
40 40 Vterb algorthm (cont.) DP can be appled to optmze an open ended snake E ( v, v) E( v, v3)... En ( vn, v n ) n For a closed snake, a loop s ntroduced nto the total energy. E ( v, v) E( v, v3)... En ( vn, vn) En( vn, ) v n n 4 3 Work around: ) Fx v and solve for rest. ) Fx an ntermedate node at ts poston found n (), solve for rest.
41 4 Calculus of varatons Gven a D functon ux ( ) :[0,], the basc problem s to mnmze a gven energy (functonal) w.r.t u(x): E( u) F( x, u, u) dx 0 wth boundary condtons: (0), () u a u b and F : gven by the problem.
42 4 Calculus of varatons (cont.) Frst varaton: E E 0 0 E( u v) E( u) 0, u v :[0,], v(0) a, v() b v beng a small ncrement satsfyng the boundary condtons. E( u v) E( u) F( x, u v, u v) dx F( x, u, u) dx 0 0 [ F( x, u v, u v ) F( x, u, u )] dx 0
43 43 Calculus of varatons (cont.) E 0 [ F( x, u v, u v) F( x, u, u)] dx 0 0 Usng Taylor seres approxmaton: F F F( x, u v, u v) F( x, u, u) v v... u u the energy functon becomes: F F E 0 v v dx 0 0 u u
44 44 Calculus of varatons (cont.) F F E 0 v dx v dx 0 0 u 0 u Integratng the second ntegral by parts: F F d F F d F v dx v v dx 0 v dx 0 u u dx u u dx u Snce ths holds for all v, the Euler equaton s: F d F u dx u 0
45 45 Calculus of varatons (cont.) In a smlar form, for the energy: we obtan the Euler equaton: E( u) F( x, u, u, u ) dx 0 u dx u dx u F d F d F 0
46 46 Calculus of varatons (cont.) Analogous s the D problem: u u u u E( u) F( x, y,,,, ) dxdy 0 0 x y x y whose Euler equaton s F d F d F d F d F 0 u dx ux dy u y dx uxx dy u yy
47 47 Back to the snake energy dv d v E( v) Enternal ( ) Emage ( ) a b cg( s) ds ds ds 0 The mage force s of the form: gs () and the Euler equaton s: 4 d v d v a b c g ds ds 4 0 Is ( )
48 48 Iteratve scheme There s no closed form soluton. We consder that we have an ntal soluton. An teratve Newton-type scheme s appled untl stablty s acheved: 4 dv d v d v a b cg 4 dt ds ds
49 49 Iteratve scheme (cont.) Temporal dscretzaton: t t t t t t dv v v x x y y, dt dv v v ds x y Spatal dscretzaton:, x x x v 4 x, v, v x x x x x 4 4x 6x 4x 6x y y y v 4 y, v, v y y y y y 4 4y 6y 4y 6y T T
50 50 Iteratve scheme (cont.) Pluggng the prevous results nto the man equaton, the problem s solved ndependently n each spatal drecton: t t T I A c x x x g t t T I A c y y y g T T T T t t t t t t t t t t t t t t x x,... x, y y,... y, g g ( x, y )..., g g ( x, y )... x y 0 N 0 N x 0 0 y 0 0 A crculant 6b a (4b a) b b (4b a) N N
51 5 Aspects to consder Representaton of the contours Defnng the energy functons External Internal Mnmzng the energy functon Extensons: Trackng Interactve segmentaton
52 5 Trackng by deformable contours. Use fnal contour/model extracted at frame t as an ntal soluton for frame t+. Evolve ntal contour to ft exact object boundary at frame t+ 3. Repeat, ntalzng wth most recent frame. Trackng Heart Ventrcles (multple frames)
53 53 Trackng by deformable contours (cont.) Vsual Dynamcs Group, Dept. Engneerng Scence, Unversty of Oxford. Applcatons: Traffc montorng Human-computer nteracton Anmaton Survellance Computer asssted dagnoss n medcal magng
54 54 3D actve contours
55 55 Lmtatons May over-smooth the boundary It cannot follow topologcal changes of objects
56 56 Lmtatons (cont.) External energy: snake does not really see object boundares n the mage unless t gets very close to t. mage gradents I are large only drectly on the boundary Soluton: Balloon force or gradent vector flow snake
57 57 Gradent vector flow Dffuson of the edge force. Compute a new force feld u(x,y), v(x,y) mnmzng the energy: E( u, v) ( ux uy vx vy ) ( gx g y ) ( u gx) ( u gx) dxdy Euler equatons: u ( g g )( u g ) 0 x y x v ( g g )( v g ) 0 x y y
58 58 Tradtonal external force feld v/s GVF feld Tradtonal force GVF force (Dagrams courtesy Snakes, shapes, gradent vector flow, Xu, Prnce)
59 59 Dffusng Image Gradents mage gradents dffused va Gradent Vector Flow (GVF) Chenyang Xu and Jerry Prnce, 98 f/ 5-59
60 60 More examples
61 6 3D surfaces
62 6 Pros and cons Pros: Useful to track and ft non-rgd shapes Contour remans connected Possble to fll n subjectve contours Flexblty n how energy functon s defned, weghted. Cons: Must have decent ntalzaton near true boundary, may get stuck n local mnmum Parameters of energy functon must be set well based on pror nformaton
Problem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationGeneralized Linear Methods
Generalzed Lnear Methods 1 Introducton In the Ensemble Methods the general dea s that usng a combnaton of several weak learner one could make a better learner. More formally, assume that we have a set
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationPHYS 705: Classical Mechanics. Calculus of Variations II
1 PHYS 705: Classcal Mechancs Calculus of Varatons II 2 Calculus of Varatons: Generalzaton (no constrant yet) Suppose now that F depends on several dependent varables : We need to fnd such that has a statonary
More informationKernel Methods and SVMs Extension
Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationTracking with Kalman Filter
Trackng wth Kalman Flter Scott T. Acton Vrgna Image and Vdeo Analyss (VIVA), Charles L. Brown Department of Electrcal and Computer Engneerng Department of Bomedcal Engneerng Unversty of Vrgna, Charlottesvlle,
More informationIV. Performance Optimization
IV. Performance Optmzaton A. Steepest descent algorthm defnton how to set up bounds on learnng rate mnmzaton n a lne (varyng learnng rate) momentum learnng examples B. Newton s method defnton Gauss-Newton
More informationFinite Element Modelling of truss/cable structures
Pet Schreurs Endhoven Unversty of echnology Department of Mechancal Engneerng Materals echnology November 3, 214 Fnte Element Modellng of truss/cable structures 1 Fnte Element Analyss of prestressed structures
More informationPHYS 705: Classical Mechanics. Newtonian Mechanics
1 PHYS 705: Classcal Mechancs Newtonan Mechancs Quck Revew of Newtonan Mechancs Basc Descrpton: -An dealzed pont partcle or a system of pont partcles n an nertal reference frame [Rgd bodes (ch. 5 later)]
More informationLecture 12: Discrete Laplacian
Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly
More informationAppendix B. The Finite Difference Scheme
140 APPENDIXES Appendx B. The Fnte Dfference Scheme In ths appendx we present numercal technques whch are used to approxmate solutons of system 3.1 3.3. A comprehensve treatment of theoretcal and mplementaton
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More information4DVAR, according to the name, is a four-dimensional variational method.
4D-Varatonal Data Assmlaton (4D-Var) 4DVAR, accordng to the name, s a four-dmensonal varatonal method. 4D-Var s actually a drect generalzaton of 3D-Var to handle observatons that are dstrbuted n tme. The
More informationWeek3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity
Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle
More informationVQ widely used in coding speech, image, and video
at Scalar quantzers are specal cases of vector quantzers (VQ): they are constraned to look at one sample at a tme (memoryless) VQ does not have such constrant better RD perfomance expected Source codng
More information6.3.4 Modified Euler s method of integration
6.3.4 Modfed Euler s method of ntegraton Before dscussng the applcaton of Euler s method for solvng the swng equatons, let us frst revew the basc Euler s method of numercal ntegraton. Let the general from
More informationSingular Value Decomposition: Theory and Applications
Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationCSci 6974 and ECSE 6966 Math. Tech. for Vision, Graphics and Robotics Lecture 21, April 17, 2006 Estimating A Plane Homography
CSc 6974 and ECSE 6966 Math. Tech. for Vson, Graphcs and Robotcs Lecture 21, Aprl 17, 2006 Estmatng A Plane Homography Overvew We contnue wth a dscusson of the major ssues, usng estmaton of plane projectve
More informationPhysics 5153 Classical Mechanics. Principle of Virtual Work-1
P. Guterrez 1 Introducton Physcs 5153 Classcal Mechancs Prncple of Vrtual Work The frst varatonal prncple we encounter n mechancs s the prncple of vrtual work. It establshes the equlbrum condton of a mechancal
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationIndeterminate pin-jointed frames (trusses)
Indetermnate pn-jonted frames (trusses) Calculaton of member forces usng force method I. Statcal determnacy. The degree of freedom of any truss can be derved as: w= k d a =, where k s the number of all
More informationMean Field / Variational Approximations
Mean Feld / Varatonal Appromatons resented by Jose Nuñez 0/24/05 Outlne Introducton Mean Feld Appromaton Structured Mean Feld Weghted Mean Feld Varatonal Methods Introducton roblem: We have dstrbuton but
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationLogistic Regression. CAP 5610: Machine Learning Instructor: Guo-Jun QI
Logstc Regresson CAP 561: achne Learnng Instructor: Guo-Jun QI Bayes Classfer: A Generatve model odel the posteror dstrbuton P(Y X) Estmate class-condtonal dstrbuton P(X Y) for each Y Estmate pror dstrbuton
More informationExpectation Maximization Mixture Models HMMs
-755 Machne Learnng for Sgnal Processng Mture Models HMMs Class 9. 2 Sep 200 Learnng Dstrbutons for Data Problem: Gven a collecton of eamples from some data, estmate ts dstrbuton Basc deas of Mamum Lelhood
More informationMultilayer Perceptrons and Backpropagation. Perceptrons. Recap: Perceptrons. Informatics 1 CG: Lecture 6. Mirella Lapata
Multlayer Perceptrons and Informatcs CG: Lecture 6 Mrella Lapata School of Informatcs Unversty of Ednburgh mlap@nf.ed.ac.uk Readng: Kevn Gurney s Introducton to Neural Networks, Chapters 5 6.5 January,
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationCS 468 Lecture 16: Isometry Invariance and Spectral Techniques
CS 468 Lecture 16: Isometry Invarance and Spectral Technques Justn Solomon Scrbe: Evan Gawlk Introducton. In geometry processng, t s often desrable to characterze the shape of an object n a manner that
More informationChapter - 2. Distribution System Power Flow Analysis
Chapter - 2 Dstrbuton System Power Flow Analyss CHAPTER - 2 Radal Dstrbuton System Load Flow 2.1 Introducton Load flow s an mportant tool [66] for analyzng electrcal power system network performance. Load
More informationOn the Multicriteria Integer Network Flow Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 5, No 2 Sofa 2005 On the Multcrtera Integer Network Flow Problem Vassl Vasslev, Marana Nkolova, Maryana Vassleva Insttute of
More informationCSC 411 / CSC D11 / CSC C11
18 Boostng s a general strategy for learnng classfers by combnng smpler ones. The dea of boostng s to take a weak classfer that s, any classfer that wll do at least slghtly better than chance and use t
More informationFeature Selection: Part 1
CSE 546: Machne Learnng Lecture 5 Feature Selecton: Part 1 Instructor: Sham Kakade 1 Regresson n the hgh dmensonal settng How do we learn when the number of features d s greater than the sample sze n?
More informationPhysics 207: Lecture 20. Today s Agenda Homework for Monday
Physcs 207: Lecture 20 Today s Agenda Homework for Monday Recap: Systems of Partcles Center of mass Velocty and acceleraton of the center of mass Dynamcs of the center of mass Lnear Momentum Example problems
More informationChapter 11: Simple Linear Regression and Correlation
Chapter 11: Smple Lnear Regresson and Correlaton 11-1 Emprcal Models 11-2 Smple Lnear Regresson 11-3 Propertes of the Least Squares Estmators 11-4 Hypothess Test n Smple Lnear Regresson 11-4.1 Use of t-tests
More informationAdvanced Mechanical Elements
May 3, 08 Advanced Mechancal Elements (Lecture 7) Knematc analyss and moton control of underactuated mechansms wth elastc elements - Moton control of underactuated mechansms constraned by elastc elements
More information10. Canonical Transformations Michael Fowler
10. Canoncal Transformatons Mchael Fowler Pont Transformatons It s clear that Lagrange s equatons are correct for any reasonable choce of parameters labelng the system confguraton. Let s call our frst
More informationPhysics 181. Particle Systems
Physcs 181 Partcle Systems Overvew In these notes we dscuss the varables approprate to the descrpton of systems of partcles, ther defntons, ther relatons, and ther conservatons laws. We consder a system
More informationModule 1 : The equation of continuity. Lecture 1: Equation of Continuity
1 Module 1 : The equaton of contnuty Lecture 1: Equaton of Contnuty 2 Advanced Heat and Mass Transfer: Modules 1. THE EQUATION OF CONTINUITY : Lectures 1-6 () () () (v) (v) Overall Mass Balance Momentum
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationWhy BP Works STAT 232B
Why BP Works STAT 232B Free Energes Helmholz & Gbbs Free Energes 1 Dstance between Probablstc Models - K-L dvergence b{ KL b{ p{ = b{ ln { } p{ Here, p{ s the eact ont prob. b{ s the appromaton, called
More informationFitting: Deformable contours
//0 Recap so far: Groupg ad Fttg Fttg: Deformable cotours Moday, Feb Prof. UT-Aust Goal: move from array of pxel values (or flter outputs to a collecto of regos, objects, ad shapes. Groupg: Pxels vs. regos
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationLecture 20: November 7
0-725/36-725: Convex Optmzaton Fall 205 Lecturer: Ryan Tbshran Lecture 20: November 7 Scrbes: Varsha Chnnaobreddy, Joon Sk Km, Lngyao Zhang Note: LaTeX template courtesy of UC Berkeley EECS dept. Dsclamer:
More informationCanonical transformations
Canoncal transformatons November 23, 2014 Recall that we have defned a symplectc transformaton to be any lnear transformaton M A B leavng the symplectc form nvarant, Ω AB M A CM B DΩ CD Coordnate transformatons,
More information2 Finite difference basics
Numersche Methoden 1, WS 11/12 B.J.P. Kaus 2 Fnte dfference bascs Consder the one- The bascs of the fnte dfference method are best understood wth an example. dmensonal transent heat conducton equaton T
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationCIS526: Machine Learning Lecture 3 (Sept 16, 2003) Linear Regression. Preparation help: Xiaoying Huang. x 1 θ 1 output... θ M x M
CIS56: achne Learnng Lecture 3 (Sept 6, 003) Preparaton help: Xaoyng Huang Lnear Regresson Lnear regresson can be represented by a functonal form: f(; θ) = θ 0 0 +θ + + θ = θ = 0 ote: 0 s a dummy attrbute
More informationSome Comments on Accelerating Convergence of Iterative Sequences Using Direct Inversion of the Iterative Subspace (DIIS)
Some Comments on Acceleratng Convergence of Iteratve Sequences Usng Drect Inverson of the Iteratve Subspace (DIIS) C. Davd Sherrll School of Chemstry and Bochemstry Georga Insttute of Technology May 1998
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationArmy Ants Tunneling for Classical Simulations
Electronc Supplementary Materal (ESI) for Chemcal Scence. Ths journal s The Royal Socety of Chemstry 2014 electronc supplementary nformaton (ESI) for Chemcal Scence Army Ants Tunnelng for Classcal Smulatons
More information1 Derivation of Point-to-Plane Minimization
1 Dervaton of Pont-to-Plane Mnmzaton Consder the Chen-Medon (pont-to-plane) framework for ICP. Assume we have a collecton of ponts (p, q ) wth normals n. We want to determne the optmal rotaton and translaton
More informationMLE and Bayesian Estimation. Jie Tang Department of Computer Science & Technology Tsinghua University 2012
MLE and Bayesan Estmaton Je Tang Department of Computer Scence & Technology Tsnghua Unversty 01 1 Lnear Regresson? As the frst step, we need to decde how we re gong to represent the functon f. One example:
More informationBoostrapaggregating (Bagging)
Boostrapaggregatng (Baggng) An ensemble meta-algorthm desgned to mprove the stablty and accuracy of machne learnng algorthms Can be used n both regresson and classfcaton Reduces varance and helps to avod
More informationCOMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD
COMPOSITE BEAM WITH WEAK SHEAR CONNECTION SUBJECTED TO THERMAL LOAD Ákos Jósef Lengyel, István Ecsed Assstant Lecturer, Professor of Mechancs, Insttute of Appled Mechancs, Unversty of Mskolc, Mskolc-Egyetemváros,
More informationCS4495/6495 Introduction to Computer Vision. 3C-L3 Calibrating cameras
CS4495/6495 Introducton to Computer Vson 3C-L3 Calbratng cameras Fnally (last tme): Camera parameters Projecton equaton the cumulatve effect of all parameters: M (3x4) f s x ' 1 0 0 0 c R 0 I T 3 3 3 x1
More informationGlobal Sensitivity. Tuesday 20 th February, 2018
Global Senstvty Tuesday 2 th February, 28 ) Local Senstvty Most senstvty analyses [] are based on local estmates of senstvty, typcally by expandng the response n a Taylor seres about some specfc values
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationBALANCING OF U-SHAPED ASSEMBLY LINE
BALANCING OF U-SHAPED ASSEMBLY LINE Nuchsara Krengkorakot, Naln Panthong and Rapeepan Ptakaso Industral Engneerng Department, Faculty of Engneerng, Ubon Rajathanee Unversty, Thaland Emal: ennuchkr@ubu.ac.th
More information2.29 Numerical Fluid Mechanics Fall 2011 Lecture 12
REVIEW Lecture 11: 2.29 Numercal Flud Mechancs Fall 2011 Lecture 12 End of (Lnear) Algebrac Systems Gradent Methods Krylov Subspace Methods Precondtonng of Ax=b FINITE DIFFERENCES Classfcaton of Partal
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationT E C O L O T E R E S E A R C H, I N C.
T E C O L O T E R E S E A R C H, I N C. B rdg n g En g neern g a nd Econo mcs S nce 1973 THE MINIMUM-UNBIASED-PERCENTAGE ERROR (MUPE) METHOD IN CER DEVELOPMENT Thrd Jont Annual ISPA/SCEA Internatonal Conference
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More information10.34 Numerical Methods Applied to Chemical Engineering Fall Homework #3: Systems of Nonlinear Equations and Optimization
10.34 Numercal Methods Appled to Chemcal Engneerng Fall 2015 Homework #3: Systems of Nonlnear Equatons and Optmzaton Problem 1 (30 ponts). A (homogeneous) azeotrope s a composton of a multcomponent mxture
More informationCurve Fitting with the Least Square Method
WIKI Document Number 5 Interpolaton wth Least Squares Curve Fttng wth the Least Square Method Mattheu Bultelle Department of Bo-Engneerng Imperal College, London Context We wsh to model the postve feedback
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationCS 3710: Visual Recognition Classification and Detection. Adriana Kovashka Department of Computer Science January 13, 2015
CS 3710: Vsual Recognton Classfcaton and Detecton Adrana Kovashka Department of Computer Scence January 13, 2015 Plan for Today Vsual recognton bascs part 2: Classfcaton and detecton Adrana s research
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationThe Feynman path integral
The Feynman path ntegral Aprl 3, 205 Hesenberg and Schrödnger pctures The Schrödnger wave functon places the tme dependence of a physcal system n the state, ψ, t, where the state s a vector n Hlbert space
More informationADVANCED MACHINE LEARNING ADVANCED MACHINE LEARNING
1 ADVANCED ACHINE LEARNING ADVANCED ACHINE LEARNING Non-lnear regresson technques 2 ADVANCED ACHINE LEARNING Regresson: Prncple N ap N-dm. nput x to a contnuous output y. Learn a functon of the type: N
More informationDO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED.
EE 539 Homeworks Sprng 08 Updated: Tuesday, Aprl 7, 08 DO NOT DO HOMEWORK UNTIL IT IS ASSIGNED. THE ASSIGNMENTS MAY CHANGE UNTIL ANNOUNCED. For full credt, show all work. Some problems requre hand calculatons.
More informationHomework Assignment 3 Due in class, Thursday October 15
Homework Assgnment 3 Due n class, Thursday October 15 SDS 383C Statstcal Modelng I 1 Rdge regresson and Lasso 1. Get the Prostrate cancer data from http://statweb.stanford.edu/~tbs/elemstatlearn/ datasets/prostate.data.
More informationPlease initial the statement below to show that you have read it
EN0: Structural nalyss Exam I Wednesday, March 2, 2005 Dvson of Engneerng rown Unversty NME: General Instructons No collaboraton of any nd s permtted on ths examnaton. You may consult your own wrtten lecture
More informationNumerical Solution of Ordinary Differential Equations
Numercal Methods (CENG 00) CHAPTER-VI Numercal Soluton of Ordnar Dfferental Equatons 6 Introducton Dfferental equatons are equatons composed of an unknown functon and ts dervatves The followng are examples
More informationOpen Systems: Chemical Potential and Partial Molar Quantities Chemical Potential
Open Systems: Chemcal Potental and Partal Molar Quanttes Chemcal Potental For closed systems, we have derved the followng relatonshps: du = TdS pdv dh = TdS + Vdp da = SdT pdv dg = VdP SdT For open systems,
More informationRelaxation Methods for Iterative Solution to Linear Systems of Equations
Relaxaton Methods for Iteratve Soluton to Lnear Systems of Equatons Gerald Recktenwald Portland State Unversty Mechancal Engneerng Department gerry@pdx.edu Overvew Techncal topcs Basc Concepts Statonary
More informationProblem Points Score Total 100
Physcs 450 Solutons of Sample Exam I Problem Ponts Score 1 8 15 3 17 4 0 5 0 Total 100 All wor must be shown n order to receve full credt. Wor must be legble and comprehensble wth answers clearly ndcated.
More informationWeek 8: Chapter 9. Linear Momentum. Newton Law and Momentum. Linear Momentum, cont. Conservation of Linear Momentum. Conservation of Momentum, 2
Lnear omentum Week 8: Chapter 9 Lnear omentum and Collsons The lnear momentum of a partcle, or an object that can be modeled as a partcle, of mass m movng wth a velocty v s defned to be the product of
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationFTCS Solution to the Heat Equation
FTCS Soluton to the Heat Equaton ME 448/548 Notes Gerald Recktenwald Portland State Unversty Department of Mechancal Engneerng gerry@pdx.edu ME 448/548: FTCS Soluton to the Heat Equaton Overvew 1. Use
More informationFirst Law: A body at rest remains at rest, a body in motion continues to move at constant velocity, unless acted upon by an external force.
Secton 1. Dynamcs (Newton s Laws of Moton) Two approaches: 1) Gven all the forces actng on a body, predct the subsequent (changes n) moton. 2) Gven the (changes n) moton of a body, nfer what forces act
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationChapter 12. Ordinary Differential Equation Boundary Value (BV) Problems
Chapter. Ordnar Dfferental Equaton Boundar Value (BV) Problems In ths chapter we wll learn how to solve ODE boundar value problem. BV ODE s usuall gven wth x beng the ndependent space varable. p( x) q(
More informationIntegrals and Invariants of Euler-Lagrange Equations
Lecture 16 Integrals and Invarants of Euler-Lagrange Equatons ME 256 at the Indan Insttute of Scence, Bengaluru Varatonal Methods and Structural Optmzaton G. K. Ananthasuresh Professor, Mechancal Engneerng,
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More informationGeneral theory of fuzzy connectedness segmentations: reconciliation of two tracks of FC theory
General theory of fuzzy connectedness segmentatons: reconclaton of two tracks of FC theory Krzysztof Chrs Ceselsk Department of Mathematcs, West Vrgna Unversty and MIPG, Department of Radology, Unversty
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationLecture 10 Support Vector Machines. Oct
Lecture 10 Support Vector Machnes Oct - 20-2008 Lnear Separators Whch of the lnear separators s optmal? Concept of Margn Recall that n Perceptron, we learned that the convergence rate of the Perceptron
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationDesign and Optimization of Fuzzy Controller for Inverse Pendulum System Using Genetic Algorithm
Desgn and Optmzaton of Fuzzy Controller for Inverse Pendulum System Usng Genetc Algorthm H. Mehraban A. Ashoor Unversty of Tehran Unversty of Tehran h.mehraban@ece.ut.ac.r a.ashoor@ece.ut.ac.r Abstract:
More information