Homework 3 - SOLUTIONS
|
|
- Lucy McKinney
- 6 years ago
- Views:
Transcription
1 EGGN 51 Computer Vson Sprng 13 Homeork 3 - SOLUTONS Due Monda, Februar 18, 13 b 8: pm Notes: Please emal me our solutons for these problems n order as a sngle Word or PDF document. f ou do a problem on paper b hand, please scan t n and paste t nto the document although ould prefer t tped! pts On the course ebste are to mages of a street ntersecton taken from a statonar camera, taken 5 seconds apart. Transform these mages to orthophotos ;.e., mages taken from a vepont drectl overhead, such that the scale s unform. Here are some control ponts that have been measured n the scene: mage, Actual, n feet 154, 389, 453, , -1 63, , -54.5, 5 5, , 464, , 436 8, , , Choose a scale of one pel =.5 feet n the output mage. Ho fast mles per hour s the person n the loer left alkng t s ok to measure the locaton of the person n the orthophotos b hand? Soluton: The to mages: The Matlab code: % HW3 p1 clear all close all 1
2 EGGN 51 Computer Vson Sprng 13 1 = mread'mage37.jpg'; msho1, []; % mage ponts, p1 = [ ; % Orgn ; % Stop 63 14; % Stop 5; % Lamp ; % Sdealk ; % Sdealk 7 31]; % Whte mark % Dra marks for =1:szep1,1 = p1,1; = p1,; rectangle'poston', [ ], 'EdgeColor', 'r'; end % Correspondng orld coordnates, n feet p = [ ; ; ; 5-56; 17.7; ; ]; % Scale so that one pel = S feet S =.5; p = p/s; T = cptformp1,p, 'projectve'; 1ortho = mtransform1, T, 'XData', [-1 7]/S, 'YData', [-7 3]/S; fgure, msho1ortho, []; mpelnfo % Poston of person's feet = 43, 37 measured b hand = mread'mage187.jpg'; fgure, msho, []; ortho = mtransform, T, 'XData', [-1 7]/S, 'YData', [-7 3]/S; fgure, mshoortho, []; mpelnfo % Poston of person's feet = 5, 3 measured b hand d = S*sqrt5-43^ ^; fprntf'person traveled %f feet n 5 second or %f mph\n',... d, d/5*.68; The orthophotos:
3 EGGN 51 Computer Vson Sprng 13 3 Person traveled feet n 5 second or mph. 15 pts The auto-correlaton score s AC E u u equaton 4.5 n the tetbook. Sho that ths equals u A u T, here matr A s as gven n equaton 4.8. Soluton: E AC u u
4 EGGN 51 Computer Vson Sprng pts Take the Matlab corner detector program developed n class and make the follong changes: a. nstead of usng a square regon of sze NN to sum the gradent product eght the value usng a Gaussan mask for,. b. nstead of usng the nterest pont measure deta/tracea, use the mnmum egenvalue of A 1. Ths s the Sh-Tomas approach. c. nstead of takng all nterest ponts above a mnmum threshold, take the 1 ponts th the hghest scores. Appl ths program to fnd the top 1 corner ponts n the mage test.jpg. Dra a rectangle around each of these ponts on the orgnal mage and label them. Soluton: The change for part a s straghtforard just use a Gaussan for. The sgma for the Gaussan s up to ou to pck. Our author states that sgma =. gves good results. For part b, e kno that the egenvalues of a smmetrc matr are a c a c b 4 v The smaller egenvalue ll be the one th the negatve sgn. You can compute the smallest egenvalue at each pont n the mage usng the Matlab command v = A11+A-sqrt A11-A.^ + 4*A1.^ /; For part c, the Matlab sort functon s hand. But ou not onl ant to return the sorted value ou ant to kno the ndces of the sorted ponts. You can do ths usng [val ndces] = sortval 'descend'; The Matlab code, and the resultng mage: clear all close all = doublemread'test.jpg'; % Appl Gaussan blur sd = 1.; = mflter, fspecal'gaussan', round6*sd, sd; msho, []; % Compute the gradent components G = mflter, [-1 1]; 1 Do not use for loops to go through the mage and call Matlab s eg functon at ever pont. nstead, use the equaton for the egenvalue that ou calculated n HW1, problem 3. You should be able to do ths thout an for loops. 4
5 EGGN 51 Computer Vson Sprng 13 G = mflter, [-1; 1]; % Compute the products of the gradents at each pel G = G.* G; G = G.* G; G = G.* G; % Sze of neghborhood over hch to compute corner features. N = 13; % = onesn; % The neghborhood s =.; % Sgma for ntegraton step = fspecal'gaussan', N, s; % The neghborhood % Sum the G's over the ndo sze. % Note: these convolutons can be epensve for large ndo szes. % f tme s crtcal, ou can alas do to 1D convolutons ro % frst, then column snce the mask s separable. For reall % large ndo do the convoluton n the Fourer doman. A11 = mflterg, ; A1 = mflterg, ; A = mflterg, ; % At each pel,, e have the matr % [A11, A1,; % A1, A,] % Of course, A1 = A1. % Fnd the egenvalues of A. These satsf the equaton A = v, here v % s an egenvalue and s the correspondng 1 egenvector. % We can solve b takng A - v =, and so e fnd v such that % deta - v =. % The to egenvalues actuall all e need s the v value % v1 = A11+A+sqrt A11-A.^ + 4*A1.^ /; v = A11+A-sqrt A11-A.^ + 4*A1.^ /; s = v; % Choose a suppresson radu for non-mama suppresson r = N; % Fnd local mama thn each neghborhood of radus r Lma = s==mdlate strel'dsk',*r; % Note - e don't ant to detect ponts too close to the border, so just % zero out everthng near the border. Lma1:N,: = false; Lma:,1:N = false; Lmaend-N:end,: = false; Lma:,end-N:end = false; % Get a lst of the ndces of all the potental nterest ponts [ros cols] = fndlma; 5
6 EGGN 51 Computer Vson Sprng 13 % Get the values of those nterest ponts vals = slma; % Sort n descendng order. "vals" are the sorted values; "ndces" are % the correspondng ndces of those values. [val ndces] = sortval 'descend'; % Dra a bo around the nterest pont of sze NN for =1:1 = colsndces; = rosndces; rectangle'poston', [-N/ -N/ N N],... 'EdgeColor', 'r',... 'Lnedth', 1.5; % default s.5 end tet+5,-5, sprntf'%d',,... 'Color', 'r',... % label th d number 'FontSze', 14; % default s pts Run the OpenCV verson of the Sh-Tomas corner detector, hch s mplemented n the functon goodfeaturestotrack. The use of the Sh-Tomas corner detector s llustrated n a tutoral on the ebste. a. Appl the program to the mage test.jpg and fnd the top 1 corners note - ou ma not get eactl the same corners as our Matlab program fnds n the prevous problem. Gve the code ou used and the resultng mage. b. Appl the program to the mage cube1.jpg. See f ou can fnd all the corners on the checkerboard pattern ou ll have change the program to ncrease the mamum alloable number corners to fnd. 6
7 EGGN 51 Computer Vson Sprng 13 Soluton: a just ran the tutoral from the ebste, ecept that used the mage test.jpg. Here s the result: And the code: /** goodfeaturestotrack_demo.cpp Demo code for detectng corners usng Sh Tomas method OpenCV team */ #nclude "opencv/hghgu/hghgu.hpp" #nclude "opencv/mgproc/mgproc.hpp" #nclude <ostream> #nclude <stdo.h> #nclude <stdlb.h> usng namespace cv; usng namespace std; /// Global varables Mat src, src_gra; nt macorners = 3; nt matrackbar = 1; RNG rng1345; const char* source_ndo = "mage"; /// Functon header vod goodfeaturestotrack_demo nt, vod* ; /** man */ nt man nt, char** argv { /// Load source mage and convert t to gra 7
8 EGGN 51 Computer Vson Sprng 13 src = mread "C:/Users/hoff/Documents/Teachng/Eggn51/h/h3/test.jpg", 1 ; cvtcolor src, src_gra, CV_BGRGRAY ; /// Create Wndo namedwndo source_ndo, CV_WNDOW_AUTOSZE ; /// Create Trackbar to set the number of corners createtrackbar "Ma corners:", source_ndo, &macorner matrackbar, goodfeaturestotrack_demo ; } msho source_ndo, src ; goodfeaturestotrack_demo, ; atke; return; /** goodfeaturestotrack_demo.cpp Appl Sh Tomas corner detector */ vod goodfeaturestotrack_demo nt, vod* { f macorners < 1 { macorners = 1; } /// Parameters for Sh Tomas algorthm vector<pontf> corners; double qualtlevel =.1; double mndstance = 1; nt blocksze = 3; bool useharrsdetector = false; double k =.4; /// Cop the source mage Mat cop; cop = src.clone; /// Appl corner detecton goodfeaturestotrack src_gra, corner macorner qualtlevel, mndstance, Mat, blocksze, useharrsdetector, k ; /// Dra corners detected cout<<"** Number of corners detected: "<<corners.sze<<endl; nt r = 4; for sze_t = ; < corners.sze; ++ { crcle cop, corners[], r, Scalarrng.unform,55, rng.unform,55, rng.unform,55, 1, 8, ; } 8
9 EGGN 51 Computer Vson Sprng 13 } /// Sho hat ou got namedwndo source_ndo, CV_WNDOW_AUTOSZE ; msho source_ndo, cop ; b For the cube1.jpg mage, changed the matrackbar parameter to allo up to corners. Here s the result: pts Consder the 33 template as shon
10 EGGN 51 Computer Vson Sprng 13 a. Compute b hand the normalzed cross correlaton score of template th mage f, at the center poston of f. You mght ant to check our anser usng Matlab s normcorr functon. f b. Gve a dfferent mage f such that the normalzed cross correlaton score of template th mage f, at the center poston of f, elds a score of -1. Assume that the mage s the tpe unsgned 8-bt nteger e, ts values le beteen and 55. Soluton: a The normalzed cross correlaton score of a template th mage f s c, t f t f t f t f t t t The mean of s zero. The sum of the squared values of s t t. We onl need to look at the center 33 porton of f. The mean of the 33 regon of f at the center locaton s.. Subtractng off the mean from that 33 regon of f results n The sum of the squared values t f 4 t f. The numerator s t f t f t. So c at the center pont s 18/sqrt4=.816. Ths matches hat normcorr produces. 1
11 EGGN 51 Computer Vson Sprng 13 f b An mage that s dentcal to the template, but has opposte sgns for each value, ll eld a cross correlaton score of -1.. Hoever, snce e are restrcted to the values that can be represented n unsgned 8-bt nteger e can t use negatve numbers. But the crosscorrelaton operator subtracts off the mean ana, so e can add a constant to the mage to make sure the values are non-negatve. So, f add 4 to the negatve of, get Dong a normalzed cross correlaton of th ths mage results n a score of -1. at the center. The other values of f don t matter snce the are outsde the boundares of the template. 6. pts Usng normalzed cross correlaton, match the top 1 ponts from the corner detector program of problem 3, from mage test.jpg to ther best matches n mage test1.jpg. You can use Matlab s normcorr functon. Mark the best matches n the second mage, and label them th ther dentfng nde from the frst mage.e., 1,, etc. Soluton: We append the follong code to the program from problem #3. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % No match these ponts to another mage = doublemread'test1.jpg'; % Appl Gaussan blur = mflter, fspecal'gaussan', round6*sd, sd; fgure, msho, []; % For each corner pont found above, e ll etract a template submage of % sze NN centered on that pont, and tr to match t to the second mage. for =1:1 = colsndces; % Locaton of corner pont n mage 1 11
12 EGGN 51 Computer Vson Sprng 13 = rosndces; % Get the template from the frst mage, surroundng ths pont M = floorn/; T = -M:+M, -M:+M; C = normcorrt,; % Do normalzed cross correlaton % The scores mage C s bgger than, b M ros and M columns along % the sdes and the top and bottom. So hen e fnd the locaton of % the peak score, e should subtract M from the ndces. cma = mac:; [ ] = fndc==cma; = -M; = -M; fprntf'pont %d matches th score=%f\n',, cma; end rectangle'poston', [-N/ -N/ N N],... 'EdgeColor', 'r',... 'Lnedth', 1.5; % default s.5 tet,, sprntf'%d',,... 'Color', 'r',... % label th d number 'FontSze', 14; % default s 1 The output s: Pont 1 matches th score=.9988 Pont matches th score= Pont 3 matches th score= Pont 4 matches th score= Pont 5 matches th score= Pont 6 matches th score= Pont 7 matches th score= Pont 8 matches th score=.9689 Pont 9 matches th score=.9951 Pont 1 matches th score=
13 EGGN 51 Computer Vson Sprng 13 Lookng at the result these ponts matched correctl: 1,3,4,5,6,7,9,1. These ere rong:,8. t s nterestng to dspla the correspondng patches net to each other. n the fgure belo, the top ro are the nterest pont patches from mage one, and the bottom ro are the correspondng patches etracted from mage to. 13
14 EGGN 51 Computer Vson Sprng 13 %%%%%%%%%%%%%%%%%%% % Just out of curost, dspla the correspondng nterest pont patches. % Top ro ll be from mage one, bottom ro from mage to. fgure; for =1:1 = colsndces; % Locaton of corner pont n mage 1 = rosndces; % Get the template from the frst mage, surroundng ths pont M = floorn/; T = -M:+M, -M:+M; subplot,1,, mshot,[]; C = normcorrt,; % Do normalzed cross correlaton % The scores mage C s bgger than, b M ros and M columns along % the sdes and the top and bottom. So hen e fnd the locaton of % the peak score, e should subtract M from the ndces. cma = mac:; [ ] = fndc==cma; = -M; = -M; subplot,1,+1, msho-m:+m, -M:+M, []; end 14
Support Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationCalibrating a single camera. Odilon Redon, Cyclops, 1914
Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures
More informationGraph-based Clustering
Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component
More informationProf. Feng Liu. Spring /24/2017
Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy
More information2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics
2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationGreedy Technique - Definition
Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationLEAST SQUARES. RANSAC. HOUGH TRANSFORM.
LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationCSCI 104 Sorting Algorithms. Mark Redekopp David Kempe
CSCI 104 Sortng Algorthms Mark Redekopp Davd Kempe Algorthm Effcency SORTING 2 Sortng If we have an unordered lst, sequental search becomes our only choce If we wll perform a lot of searches t may be benefcal
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationAn Object Detection Method based on the Separability Measure using an Optimization Approach
An Object Detecton Method based on the Separablt Measure usng an Optmzaton Approach Edward Y. H. Cho *, Wa Tak Hung 2 Hong Kong Poltechnc Unverst, Hung Hom, Kowloon, Hong Kong E-mal: mahcho@net.polu.edu.hk
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationA NOVEL EYE DETECTION ALGORITHM UTILIZING EDGE-RELATED GEOMETRICAL INFORMATION
A NOVE EYE DEECION AGORIHM UIIZING EDGE-REAED GEOMERICA INFORMAION S. Asterads, N. Nkolads, A. Hajdu, I. Ptas Department of Informatcs, Arstotle Unversty of hessalonk, BOX 451, 54124, hessalonk, Greece,
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationAlgebraic Connectivity Optimization of the Air Transportation Network
Algebrac Connectvty Optmzaton of the Ar Transportaton Netork Gregore Spers, Peng We, Dengfeng Sun Abstract In transportaton netorks the robustness of a netork regardng nodes and lnks falures s a key factor
More informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More information15.4 Constrained Maxima and Minima
15.4 Constrained Maxima and Minima Question 1: Ho do ou find the relative extrema of a surface hen the values of the variables are constrained? Question : Ho do ou model an optimization problem ith several
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationSearching & Sorting. Definitions of Search and Sort. Linear Search in C++ Linear Search. Week 11. index to the item, or -1 if not found.
Searchng & Sortng Wee 11 Gadds: 8, 19.6,19.8 CS 5301 Sprng 2014 Jll Seaman 1 Defntons of Search and Sort Search: fnd a gven tem n a lst, return the ndex to the tem, or -1 f not found. Sort: rearrange the
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationINF 4300 Support Vector Machine Classifiers (SVM) Anne Solberg
INF 43 Support Vector Machne Classfers (SVM) Anne Solberg (anne@f.uo.no) 9..7 Lnear classfers th mamum margn for toclass problems The kernel trck from lnear to a hghdmensonal generalzaton Generaton from
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationMachine Learning. K-means Algorithm
Macne Learnng CS 6375 --- Sprng 2015 Gaussan Mture Model GMM pectaton Mamzaton M Acknowledgement: some sldes adopted from Crstoper Bsop Vncent Ng. 1 K-means Algortm Specal case of M Goal: represent a data
More informationINF Repetition Anne Solberg INF
INF 43 7..7 Repetton Anne Solberg anne@f.uo.no INF 43 Classfers covered Gaussan classfer k =I k = k arbtrary Knn-classfer Support Vector Machnes Recommendaton: lnear or Radal Bass Functon kernels INF 43
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationHigh level vs Low Level. What is a Computer Program? What does gcc do for you? Program = Instructions + Data. Basic Computer Organization
What s a Computer Program? Descrpton of algorthms and data structures to acheve a specfc ojectve Could e done n any language, even a natural language lke Englsh Programmng language: A Standard notaton
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationThe Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks
The mpact of Delayed Acknoledgement on E-TCP Performance n Wreless netorks Deddy Chandra and Rchard J. Harrs School of Electrcal and Computer System Engneerng Royal Melbourne nsttute of Technology Melbourne,
More informationJournal of Terrestrial Observation
Journal of Terrestral Observaton Volume ssue 1 nter 010 Artcle 6 Automated Georeferencng of Hstorc Aeral Photograph Jae Sung Km Chrstopher C. Mller and James Bethel Coprght 010 The Purdue Unverst Press.
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationCS 231A Computer Vision Midterm
CS 231A Computer Vson Mdterm Tuesday October 30, 2012 Set 1 Multple Choce (22 ponts) Each queston s worth 2 ponts. To dscourage random guessng, 1 pont wll be deducted for a wrong answer on multple choce
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationCopyright 2003 by the Society of Photo-Optical Instrumentation Engineers.
Copyrght 003 by the Socety of Photo-Optcal Instrumentaton Engneers. Ths paper as publshed n the proceedngs of Metrology, Inspecton, and Process Control for Mcrolthography XVII, SPIE Vol. 5038, pp. 396-405.
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationRectangle Region Based Stereo Matching for Building Reconstruction
1 Rectangle Regon Based Stereo Matchng for Buldng Reconstructon Jng Wang, Toru Myazak, Hrokazu Kozum, Makoto Iata, Jongha Chong, Hroyuk Yagyu, Hdeo Shmazu, Takesh Ikenaga, Member, IEEE, Satosh Goto, Fello,
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationAMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain
AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references
More informationA Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects
Clemson Unversty TgerPrnts All Theses Theses 12-2011 A Comparson and Evaluaton of Three Dfferent Pose Estmaton Algorthms In Detectng Low Texture Manufactured Objects Robert Krener Clemson Unversty, rkrene@clemson.edu
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationImage Processing (Computer Vision) Inverse Photography. Vision in Nature. Image Processing: 2003/2004. See the Big Picture.
Image Processng Computer Vson Inverse Photography World Pctures/Vdeo Photography Image Processng Computer Vson Pctures/Vdeo Somethng Vson n Nature Only smart organsms see! Plants do not have eyes Vsual
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationLecture notes: Histogram, convolution, smoothing
Lecture notes: Hstogram, convoluton, smoothng Hstogram. A plot o the ntensty dstrbuton n an mage. requency (# occurrences) ntensty The ollowng shows an example mage and ts hstogram: I we denote a greyscale
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationWhat are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry
Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape
More informationIntro. Iterators. 1. Access
Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy
More informationFace Detection with Deep Learning
Face Detecton wth Deep Learnng Yu Shen Yus122@ucsd.edu A13227146 Kuan-We Chen kuc010@ucsd.edu A99045121 Yzhou Hao y3hao@ucsd.edu A98017773 Mn Hsuan Wu mhwu@ucsd.edu A92424998 Abstract The project here
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Bran Curless Sprng 2008 Announcements (5/14/08) Homework due at begnnng of class on Frday. Secton tomorrow: Graded homeworks returned More dscusson
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationLecture 3: Computer Arithmetic: Multiplication and Division
8-447 Lecture 3: Computer Arthmetc: Multplcaton and Dvson James C. Hoe Dept of ECE, CMU January 26, 29 S 9 L3- Announcements: Handout survey due Lab partner?? Read P&H Ch 3 Read IEEE 754-985 Handouts:
More informationBackground Functions (1C) Young Won Lim 5/26/18
Background Functions (1C) Copright (c) 2016-2018 Young W. Lim. Permission is granted to cop, distribute and/or modif this document under the terms of the GNU Free Documentation License, Version 1.2 or
More informationCMSC 828D: Fundamentals of Computer Vision Homework 12
CMSC 88D Fundmentls of Computer Vson /8 CMSC 88D: Fundmentls of Computer Vson Homeork Instructors: Lrry Dvs, Rmn Dursm, Dnel DeMenthon, nd Ynns Alomonos Soluton bsed on homeork submtted by Hyng Lu. Fnd
More informationDijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance. Decision Sequence.
All-Pars Shortest Paths Gven an n-vertex drected weghted graph, fnd a shortest path from vertex to vertex for each of the n vertex pars (,). Dstra s Sngle Source Algorthm Use Dstra s algorthm n tmes, once
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationCS221: Algorithms and Data Structures. Priority Queues and Heaps. Alan J. Hu (Borrowing slides from Steve Wolfman)
CS: Algorthms and Data Structures Prorty Queues and Heaps Alan J. Hu (Borrowng sldes from Steve Wolfman) Learnng Goals After ths unt, you should be able to: Provde examples of approprate applcatons for
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationImplementation of a Dynamic Image-Based Rendering System
Implementaton of a Dynamc Image-Based Renderng System Nklas Bakos, Claes Järvman and Mark Ollla 3 Norrköpng Vsualzaton and Interacton Studo Lnköpng Unversty Abstract Work n dynamc mage based renderng has
More informationA NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION
A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION Mhaela Gordan *, Constantne Kotropoulos **, Apostolos Georgaks **, Ioanns Ptas ** * Bass of Electroncs Department,
More informationImage segmentation by using the localized subspace iteration algorithm
Image segmentaton by usng the localzed subspace teraton algorthm Jnlong Wu and Tejun L May 8, 28 Abstract An mage segmentaton algorthm called segmentaton based on the localzed subspace teratons (SLSI)
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS246: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs246.stanford.edu 2/17/2015 Jure Leskovec, Stanford CS246: Mnng Massve Datasets, http://cs246.stanford.edu 2 Hgh dm. data Graph data
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationParallel Inverse Halftoning by Look-Up Table (LUT) Partitioning
Parallel Inverse Halftonng by Look-Up Table (LUT) Parttonng Umar F. Sddq and Sadq M. Sat umar@ccse.kfupm.edu.sa, sadq@kfupm.edu.sa KFUPM Box: Department of Computer Engneerng, Kng Fahd Unversty of Petroleum
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationA Novel Accurate Algorithm to Ellipse Fitting for Iris Boundary Using Most Iris Edges. Mohammad Reza Mohammadi 1, Abolghasem Raie 2
A Novel Accurate Algorthm to Ellpse Fttng for Irs Boundar Usng Most Irs Edges Mohammad Reza Mohammad 1, Abolghasem Rae 2 1. Department of Electrcal Engneerng, Amrabr Unverst of Technolog, Iran. mrmohammad@aut.ac.r
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationFast Feature Value Searching for Face Detection
Vol., No. 2 Computer and Informaton Scence Fast Feature Value Searchng for Face Detecton Yunyang Yan Department of Computer Engneerng Huayn Insttute of Technology Hua an 22300, Chna E-mal: areyyyke@63.com
More informationToday s Outline. Sorting: The Big Picture. Why Sort? Selection Sort: Idea. Insertion Sort: Idea. Sorting Chapter 7 in Weiss.
Today s Outlne Sortng Chapter 7 n Wess CSE 26 Data Structures Ruth Anderson Announcements Wrtten Homework #6 due Frday 2/26 at the begnnng of lecture Proect Code due Mon March 1 by 11pm Today s Topcs:
More information