COMPUTER VISION CAP 5415
University of Central Florida
Popular in Course
Popular in System Engineering
This 7 page Class Notes was uploaded by Khalil Conroy on Thursday October 22, 2015. The Class Notes belongs to CAP 5415 at University of Central Florida taught by Staff in Fall. Since its upload, it has received 14 views. For similar materials see /class/227216/cap-5415-university-of-central-florida in System Engineering at University of Central Florida.
Reviews for COMPUTER VISION
Report this Material
What is Karma?
Karma is the currency of StudySoup.
You can buy or earn more Karma at anytime and redeem it for class notes, study guides, flashcards, and more!
Date Created: 10/22/15
CAP5415 Computer Vision Spring 2003 Khurram Has sanSha que MidTerm February 20 2003 Imaging Geometry Camera Modeling and Calibration Filtering and Convolution Edge Detection Line amp Curve Fitting Deformable Contours Least Squares Fit Standard linear solution to a classical problem Poor Model for Vision applications yaxbfxab Minimize y 7 fxabZ Line tting can be max likelihood but choice of model is important Maximum Likelihood Maximize the Log likelihood function L ax b c 2 L 7 EX Zy 2039 Given constraint a2 bz l Who came from which line I Assume we know how many lines there are but which lines are they I easy if we know who came from which line Strategies I Incremental line tting I K means Algm i nn 151 Incremenm line mung by walkmg along a unit mng a hne cc Inns of pwxe s 31mg the cm and breaking the am when we reswdua is too Luge I39m 11 lminrx nu mm 134 in an Emm Iv1 39 39 m um rlw mm mz 1 Enum Ih lim 1N Unli rlwn hm 1 nt 1gtl Imim nu rhv Nu39w Tumm hm k39vw pnmn nu llu Iuw m rlu lnw mm m En m n huv mm In 39 LA w guuklw ummh Tmmm 11M 11 x 1mm nu 114 mu u In K x Lu 1 dm Um and Mil hr Linn Trunr x M11 Lin A1 nu h Line m hue lint owl LN jmluhm m1 m mm J Algorithm 152 Kymeans line hmng bv almcatmg pomts to the dosest hue and then refmmg HY mm L 11m in11ml mm gt111le m rzuulnun vaurhpsiwv m 1 rum 11 n lam m punw mnl Hm Fn 1am mine rhia mgnuwm Vnril mmvm All n m Th4 Ihu mvl vnw mvh 1min 1 rlul vluhmt hm a Curve Fitting Transform I Let yfx a be the chosen parameterization of a target curve I Discretize the intervals ofvariation of a1 ak and let S 5k be the number ofthe discretized intervals I LetAs1 59 be an array ofinteger counters and initialize all its elements to zero For each pixel EiJ such that Eij1 increment all counters on the curve de ned by yfxa in A I Find all local maxima above certain threshold Curve Fitting by Hough Transform I Suffer With the same problems as line tting by Hough Transform Computational complexity and storage complexity increase rapidly With number of parameters Not very robust to noise w Egg Deformable Contours I Minimize the Energy Functional E I be s mulch Where the integral is taken along the contour c and each of the energy terms in the functional is a function of c or or the derivatives of c with respect to s The parameters 0L B and 7 control the relative in uence of the corresponding energy term and can vary along 0
Are you sure you want to buy this material for
You're already Subscribed!
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'