Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,

Size: px
Start display at page:

Download "Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,"

Transcription

1 Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery and 3 reconstructon from a sngle mage. Many methods have been proposed to address the problem however a consstent framework to quanttatvely analyze the stablty and accuracy of vanshng pont estmaton s stll absent. Ths paper proposes a new concept vanshng hull whch solves the problem. Gven an edge error model the range of a true edge can be modeled usng a fan regon. The ntersecton of all these fan regons s a convex hull whch s called vanshng hull. A vanshng hull gves the regon of a true vanshng pont and ts dstrbuton determnes the probablty of the vanshng pont. The expectaton of the vanshng hull s the optmal soluton of the vanshng pont ts varance defnes the accuracy of the estmaton and ts shape determnes the stablty of the vanshng pont. Hence we can quanttatvely analyze the stablty and accuracy of the vanshng pont estmaton usng vanshng hull. Smulaton results show that our method s sgnfcantly better than one state-of-the-art technque and real data results are also promsng.. Introducton A vanshng pont s defned as the ntersecton pont of a group of mage lnes that correspond to the projecton of parallel lnes n 3 wth an deal pn-hole camera model. The poston of a vanshng pont n the mage plane s only determned by the camera center and the orentaton of the 3 lnes n the camera system. Vanshng ponts are valuable n many vson tasks ncludng buldngs detecton n aeral mages[5] camera poses recovery [5] robots navgaton [4] and 3 reconstructon from a sngle mage [9]. Many research have been conducted n accurately dentfyng the poston of vanshng ponts. Ths vares from smple lne groupng [8] to more complcated methods usng a statstcal model [6]. The two key problems n dentfyng vanshng ponts are fndng the group of mage lnes that correspond to a true vanshng pont and computng the poston of the vanshng pont wth the presence of mage noses. Most prevous research work [] [] focus on the frst problem whle the computng of vanshng ponts are accomplshed usng the least square technque or searchng for the maxma vote n the Gaussan sphere [4]. The performances are often evaluated emprcally furthermore few work have been conducted on fndng a theory to quanttatvely analyze the stablty and accuracy of vanshng ponts estmaton wth mage noses. The mage lnes that correspond to a vanshng pont can be grouped usng clusterng methods or votng methods. Clusterng methods frst fnd possble clusters usng the ntersecton of all pars of lnes [] or mage gradent orentatons [] then assgn each lne to dfferent clusters usng a dstance or angle crteron. The drawbacks of clusterng methods are the hgh computatonal complexty and that a hard threshold s needed to group lnes nto clusters. Votng methods nclude mage space methods [3] and Gaussan sphere methods [4]. Hough Transform n Gaussan sphere space s a global feature extracton method hence senstve to spurous maxma. The knowledge of prmtve models can be used to reduce spurous maxma [5]. However the accuracy of Gaussan sphere methods s lmted to the dscretzaton of the accumulator space hence t s hard to acheve the precson that an mage can provde. For computng the vanshng ponts wth mage noses the least square method s generally used []. Several mprovements have been made to the least square method. McLena and Kottur [] ntegrate edge detecton and lne clusterng to the process of vanshng ponts detecton and then use a non-lnear method to compute the poston of vanshng ponts wth a statstcal edge error model. Shufelt [5] uses a fan edge error model to mprove the robustness to mage noses n the Gaussan sphere. However the performances of both methods are evaluated emprcally. Lebowtz and Zsserman [] use a Maxmum-Lkelyhood estmator to compute the poston of the vanshng pont however the performance s only vsually analyzed. In general a consstent framework to quanttatvely analyze the computaton of vanshng ponts wth mage noses s stll absent whch s the man mpetus of ths work. Observng that the regon of an edge error model wth mages noses s a fan regon (Fgure ) we ntersect all the

2 fan edges to form a convex polygon called the Vanshng Hull. Ths paper shows that the vanshng hull gves the regon of the true vanshng pont and ts dstrbuton gves the probablty of the vanshng pont. The expectaton of the vanshng hull the centrod for a unform dstrbuton gves the optmal soluton of the vanshng pont under statstcal meanngs ts varance defnes the accuracy of the vanshng pont and ts shape determnes the stablty of the vanshng pont. Hence the vanshng hull concept provdes a theoretcal framework to quanttatvely analyze the regon optmal soluton stablty and accuracy of vanshng ponts. Besdes a framework for analyzng vanshng ponts wth mage noses we also present a novel edge groupng method based on heurstc flters wthout any hard thresholds. Snce the dea of vanshng hull s derved from the ntersecton of edge regons we frst present a smple edge error model (Secton.) and the correspondng edge groupng method (Secton.). The vanshng hull concept s frst ntroduced based on the smple edge error model (Secton.3) and then extended to general edge error models (Secton.4). The performance of our method s quanttatvely compared wth one state-of-the-art technque [](Secton 3) and we conclude the paper n Secton 4.. Vanshng hull.. Edge error model fferent edge error models have been presented. McLean and Kottur [] use a statstc model to present both the error of the lne centrod and orentaton. Shufelt [5] presents a smple but effectve edge error model. Inspred by the dea of a fan edge regon [5] we derve the concept of vanshng hull by the ntersecton of all these regons. We frst adapt ths smple edge error model to our vanshng hull framework and then extend the concept to general edge error models. Consder the representaton of a lne segment usng two endponts and assume the two end ponts have one pxel precson then two fan regons wth a rectangular regon n the mddle can be formed by movng the two end ponts freely n the pxel squares (Fgure ). Ths regon s a concave regon so we cannot guarantee that the ntersecton of such regons wll be convex. Fortunately a true vanshng pont cannot le n the mage lne segment (Secton.) so the rectangular regon has no effect on the shape of the ntersecton of edge regons. We smply take the mddle pont of the edge and form two fan regons wth the two end ponts. Furthermore a true vanshng pont Fgure. Edge error model. can only le n one drecton of the edge so we can just take one of the fan regon whch s a convex regon (Fgure )... Lne clusterng Snce we are nterested n fndng the ntersecton regons of all the edges t s necessary to frst dentfy the mage lnes that can form a possble vanshng pont.e. we need to group lnes nto dfferent clusters. We opt to use the clusterng method n mage space rather than Gaussan sphere because of several reasons. Frst Gaussan sphere method s a global feature extracton method whch s senstve to spurous maxma. Second the accuracy s lmted to the dscretzng accuracy hence hard to acheve the precson that an mage can offer. The last and most mportant reason the ntersecton of the fan regons of the edges that belong to the maxmum cell n the Gaussan sphere may be empty whch makes the vanshng hull meanngless. Fndng clusters The Canny edge detector s used to fnd sub-pxel edges then Hough Transform s used to fnd possble lnes and nearby lnes are connected usng some user defned threshold. The lnes are represented usng two end ponts. The ntersectons of all pars of lne segments are computed to fnd all possble clusters. The computatonal complexty s O( n ) where n s the number of lnes. Groupng lnes nto dfferent clusters takes O(n) tme so the overall tme complexty s O( n 3 ) whch s expensve for a large number of lnes. We wll reduce the complexty usng a flterng step and the RANSAC algorthm later. Groupng After fndng the clusters we need a crteron to assgn lnes to dfferent clusters. A dstance crteron gves prorty to close vanshng ponts whle an angle crteron gves prorty to far vanshng ponts. A reasonable threshold s to use a tuple of both dstance and angle or use normalzed angle error. However all these methods need a hard threshold whch may be nconsstent wth the edge error model. We use a method that s consstent wth the edge error model wthout any hard threshold. For each cluster of two lnes we can fnd the ntersecton regon A of the edges and a test edge s assgned to ths cluster when ts edge regon overlaps wth regon A. Furthermore we use a strong constrant for clusterng (Fgure ). An edge s assgned to a cluster only f ts edge regon covers the ntersecton pont of the cluster. Ths guarantees that the ntersecton regon of the edge regons n each Fgure. Groupng wth an edge error model.

3 cluster s not empty. The normalzed length of each edge s accumulated n ts assgned cluster and the maxmum clusters are chosen to compute potental vanshng ponts. Flterng spurous vanshng ponts Most of our testng mages are outdoor buldng mages wth heavy occluson by trees (Fgure 5) whch causes many spurous vanshng ponts. Knowledge of the mage and vanshng ponts are used to flter spurous vanshng ponts. Frst we roughly classfy the extracted lnes nto x and y groups accordng to the lne orentaton whch dramatcally reduce the sze of lne number. Then vanshng ponts are fltered usng the followng three flters. ) Iteratve lne length. Accordng to the edge error model longer lnes are more relable however we would lke also to keep shorter lnes. So we frst flter the lnes usng large length threshold then estmate the possble vanshng ponts and these ponts are used to fnd more lne supporters accordng to the groupng method. ) Coverng area. Another observaton of the mage s that edges of trees only cover a small part of the mage regon so the rato of the coverng area aganst the mage area s also used to flter spurous vanshng ponts. 3) Vald vanshng pont. Vanshng ponts are the ntersecton of mage lnes that correspond to parallel lnes n 3. So by defnton a vald vanshng pont wll not le on the mage segment n the mage space whch s very effectve n reducng spurous clusters. RANSAC Even though we classfy lnes nto two drectons to reduce the lne number and use flters to reject spurous clusters the number of clusters may stll be large. Snce we are nterested n fnd vanshng ponts that correspond to domnant drectons the RANSAC algorthm s used to fnd the maxmum cluster of lnes for x-y drecton. The vanshng pont of z drecton s estmated usng the orthogonal property of the three drectons and ts supportng lnes are found usng our groupng method to refne the poston usng vanshng hull..3. Vanshng hull efnton and property A vanshng hull s defned as the ntersecton of the fan-shape edge regons wth a gven edge error model. Fgure 5. (d) shows a vanshng hull of a real mage. A vanshng hull has the followng propertes. Property I. A vanshng hull s not empty. Proof: accordng to the groupng method an edge s assgned to a cluster only f ts edge regon covers the ntersecton pont of the cluster so the vanshng hull contans at least the ntersecton pont. Property II. A vanshng hull s convex. Proof: the ntersecton of convex regons (edge regons are fan shape) s convex. Property III. A true vanshng pont les nsde the regon of ts vanshng hull wth the assumpton of correct edge error model (the true edge les nsde the edge fan). Proof: By defnton the true vanshng pont must les nsde the unon of all the edge regons. Now assumng the vanshng pont VP les outsde of the vanshng hull but nsde the unon of the edge regon. Then there must exst some edge say L whose edge regon does not cover VP. Hence the edge error model of edge L s wrong whch s contradctory wth our assumpton. Hence VP must be nsde the vanshng hull. Ths property s mportant t tells us where to fnd the true vanshng pont. Property IV. The centrod of a vanshng hull s the optmal estmaton of the vanshng pont wth a unform dstrbuton model. Proof: the optmal estmaton of the vanshng pont s the expectaton of the probablty dstrbuton of the vanshng ponts nsde the vanshng hull under statstc meanng. Wth a unform dstrbuton the expectaton of a vanshng hull s ts centrod. Property V. The varance of a vanshng hull determnes the accuracy of the estmated vanshng pont. Proof: ths s drectly from probablty theory. Property VI. The shape of a vanshng hull determnes the stablty of the estmaton of the vanshng pont. A vanshng hull can be open t can also be a closed non-trval convex polygon a lne segment or a pont. When the mage lnes are parallel the vanshng hull s an open convex hull; the centrod s undetermned whch means the estmaton of the vanshng pont s unstable. Ths s reasonable because edges have nose any non-zero nose wll be enlarged to nfnty when the vanshng pont s at nfnty whch makes the estmaton unrelable. An open vanshng hull ndcates a vanshng pont at nfnty whch corresponds to a pont at the great crcle parallel to the mage plane n the Gaussan sphere. We handle ths case by settng the vanshng pont to nfnty. When the vanshng hull s a non-trval convex polygon the vanshng pont can be relably estmated usng the centrod wth the varance of the dstrbuton as the estmaton accuracy. When the vanshng hull shrnks to a lne segment the uncertanty s along just one drecton and the vanshng pont can be precsely computed when the vanshng hull degenerates to a pont whch corresponds to an error-free edge model. etermnng vanshng hull Now let s consder how to fnd the vanshng hull. A fan shape edge regon can be consdered as the ntersecton of two half planes (Fgure ) so the problem of ntersecton of the edge regons can be cast as the problem of half-planes ntersecton. A naïve way to solve the problem s to add one half-plane bound lne a tme and compute the ntersecton regon whch takes O( n ) tme. However a more elegant algorthm wth O( n lg n) tme can be presented by

4 study the property of dual space [3]. There exsts an nterestng property called dualty between lnes and ponts [3]. Gven a non-vertcal lne L t can be expressed usng two parameters (k b). We can defne a pont wth k as the x coordnate and b as the y coordnate. Ths pont s called the dual pont (L* ) of lne L. The space of the lnes s called the prme space whle the space of the ponts s called the dual space. The half-plane ntersecton problem n the prme space can be mapped as the problem of fndng the convex hull of the ponts n the dual space. We frst dvde the bound lnes of half-planes nto two sets: an upper set (half-planes le above the bound lnes) and a lower set (half-planes le below the bound lnes). Let s consder the upper set frst. For each lne L n the upper set we can fnd a dual pont L*(k b). The ntersecton of all the half-planes n the upper set can be mapped as fndng the lower convex hull (the edges of the lower boundary of the convex hull) of the dual ponts. The proof s out of the scope of ths paper readers may refer to [3]. Smlarly we can fnd the ntersecton of all the half-planes n the lower set by determnng the upper convex hull of the dual ponts. Notce that accordng to our dual mappng the upper convex hull and the lower convex hull wll not ntersect although the upper and lower half-planes do ntersect and that s the reason we splt the whole half planes nto two sets. Fnally the two regons are merged to fnd the vanshng hull. The algorthm s summarzed as followng:. Splt the half plane nto two sets an upper set and a lower set.. Map each set nto a dual space and fnd the correspondng upper and lower convex hull (notce the two convex hulls are dfferent). 3. Map the two half convex hulls back to prme space and merge them to fnd the vanshng hull. Fndng a convex hull of a pont sets s a well-defned problem [3] whch takes O( n lg n) wth n as the number of ponts. The mappng and mergng takes lnear tme so the overall tme complexty s O( n lg n). Expectaton and varance of vanshng hull Wth a unform probablty dstrbuton the expectaton and varance of the poston of a true vanshng pont can be computed usng Equaton () where s the regon of the vanshng hull and A s ts area. We only show x coordnate due to lack of space y coordnate can be computed n a smlar way. Gven a lst of vertces of the vanshng hull t s easy to show that the mean can be computed usng the coordnates of these vertces (Equaton 3). µ ( x) = xda var( x) = ( x µ ( x)) da () A A = n ( x y+ x+ y ) = A () n ( x) = ( x + x+ )( x y+ x+ y ) 6A = µ (3) The varance of the vanshng hull can also be represented as a smple expresson of the coordnates of the vertces. Accordng to Green s calculus theorem [6] an ntegral n the regon can be converted to an ntegral on the boundary: g f f ( x dx + g( x dy = ( ) dxdy (4) x y 3 Let f = g = ( x µ ( x)) we have 3 g f = ( x µ ( x)) (5) x y So: g f var( x ) = ( x µ ( x)) da = ( ) da A A x y = f ( x dx + g( x dy (6) A Let s consder the ntegral on lne ( x y ) to ( x + y+ ) we can parameterze the pont on the lne usng t such that: x x + t x x y = y + t y + y t [] (7) = ( + ) ( ) Let a = ( x µ ( x)) b = ( x + x ) c = ( y + y ) t s easy to show that the varance of x coordnate can be computed as: n 3 3 b var( x) = c( a + a b + ab + ) 3 = 4 (8) Smlarly we can compute the varance of y coordnate..4. Vanshng hull for general edge error model The vanshng hull concept can be easly extended to general statstcal edge error models. Frst we show an augmented vanshng hull consderng the full edge regon and then we show that a general vanshng hull can be derved n a smlar way. In Secton. we gnored the rectangular regon and use one of the edge fan to derve the vanshng hull concept. We clam that the shape of the vanshng hull wll not change wth ths approxmaton whch s true. However the probablty dstrbuton n the vanshng hull s not a unform dstrbuton. For a full edge span regon an angle (called extreme angleθ ) s formed by the vanshng pont VP and two extreme ponts P and P (Fgure 3). Accordng to the edge error model the two end ponts have equal probablty nsde the one-pxel-sze square. The probablty of a true edge passng through the vanshng pont VP s determned by the overlappng area of the extreme angle and the pxel squares. Let p ( l VP) be the probablty of a true edge l pass- 3

5 ng through VP and e be the two end ponts of l and e S and S be the overlappng regon of the extreme angle wth the two pxel squares then: p l VP) = p( e S & e ) (9) ( S Assumng the two end ponts are ndependent wth probablty densty functon (PF) f ( x and g( x y ) respectvely then the jont PF s f ( x * g( x y ) whch s a 4 unform dstrbuton. Then p ( l VP) s the ntegral of the jont PF over the regon S S. p ( l VP) = f ( x * g( x y ) dsds e S & e S We can use a lne-sweepng method to compute the ntegral n a regon. Now consder a sweep lne L that passes VP and ntersects the two squares wth lne segment and l (Notce L s a lne nsde the extreme angle l whle l s a true edge nsde the whole edge regon). Lne L sweeps the whole overlappng regon when ts angle vares from to θ the ntegral of the jont PF over the two lne segments s: p( e l & e l ) = f ( x * g( x y ) dl dl Vanshng hull Extreme angle θ Full edge regon e l & e l enote the end ponts of lne segment ( x ( x y ) and l as ( x y ) ( x y ) they form a lne segment n a 4 space (because we have three lnear constrants: l l and they have the same slope). The ntegral of a unform dstrbuton over a lne segment n 4 s just the length of the lne segment hence: p( e l & e l ) = [( x + ( x x ) + ( y y ) P L Fgure 3.Compute probablty dstrbuton for a full edge regon. x ] ) + ( y Now we can ntegrate over the angle to get the regon ntegral: P VP e l e l l () () as () p ( l VP) = p( e l( ϑ) & e l ( ϑ)) dϑ (3) ϑ The full expresson of the analytcal PF of the vanshng hull for a full edge regon s complcated and the dstrbuton functon may not be contnuous over the entre regon. Even when the dstrbuton for a sngle edge s contnuous the overall PF s very hgh order due to the large number of edges. An analytcal soluton to the ntegral of such a hgh order non-lnear PF s very complcated and may not exst. We use a dscretzng method to solve ths problem. The dscretzaton process can acheve hgh precson (one pxel) because the vanshng hull regon s bounded. Consder the center pont VP( x of a cell wth one pxel sze we can fnd the extreme angle relatve to edge l and then compute the probablty p ( l VP( x ) accordng to Equaton 3. Then the probablty of the pont VP( x over all the edges s computed and normalzed (Equaton 4). The expectaton and varance can be easly computed n the dscretzed vanshng hull. n = * P( x P ( x p ( l VP( x ) P ( x = (4) = P( x Such a vanshng hull consderng the full edge span regon s called augmented vanshng hull. In practce we found that the vanshng hull often conssts of only a few vertces (less than vertces for lnes) whch means that the probablty of a vanshng pont close to the edge regon s boundary s very low. Snce vanshng ponts close to the mddle of the edge regon has smlar overlappng area wth the pxel squares t s reasonable to assume a unform dstrbuton for the vanshng hull formed of full edge regons. We can extend the vanshng hull concept to general edge error model n a way smlar to augmented vanshng hull. A general edge error model often models the error of the edge centrod and orentaton [] or the two end ponts [5] usng a Gaussan dstrbuton. The edge span regon s stll a fan shape so the ntersecton of the edge regons s a convex hull. Assumng the PF of the lne l passng a vanshng pont (x s f ( x then the PF of the vanshng hull over all the lnes s f ( x. Agan ths functon s a hgh order non-lnear functon we dscretze the vanshng hull and compute the mean and varance of the vanshng hull. 3. Analyss and result 3.. Smulaton data We frst analyze the theory usng synthetc data. The goal of the smulaton s to show that a vanshng hull gves the regon of the true vanshng pont ts expectaton s the

6 optmal soluton ts shape determnes the stablty and ts varance determnes the accuracy of the estmaton. The smulaton s desgned as followng. A group of 3 parallel lnes are projected by an deal pn-hole camera to an mage plane then random noses wth specfed magntude are added to the end ponts. The vanshng pont s estmated usng the centrod of the vanshng hull assumng a unform Table. Parameter settngs. Parameter Range Other parameter settngs.lne orentaton θ [. 4] fov = 4 l = 5 angle (degree) ε =.5 n =.camera feld of fov [ 8] θ = l = 5 vew (degree) ε =.5 n = 3.mage lne l [ ] θ = fov = 4 length (pxel) ε =.5 n = 4.mage nose ε [.5.5] θ = fov = 4 magntude (pxel) l = 5 n = 5.number of mage n [ ] θ = 5 fov = 4 lnes l = 5 ε =. 5 dstrbuton. We extensvely analyze our Vanshng Hull () algorthm wth dfferent parameter settngs (Table ). For each of the fve groups of parameter settngs we sample the space wth evenly dstrbuted ntervals the other four parameters are set as constant when one parameter vares n ts range to test the performance relatve to each parameter. Vanshng hull s the true vanshng pont regon The smulaton shows that all the true vanshng ponts le nsde the vanshng hull. Ths s logcal because the maxmum nose magntude s specfed so the edge error model exactly predcts the regon of the true edge regon hence the true vanshng ponts le nsde the vanshng hull. Expectaton s the optmal soluton The result of method s compared wth other two methods Least Square (LS) method and Maxmum Lkelyhood () method [] to show that the expectaton s the optmal soluton. The comparson crteron s the recovered orentaton angle error relatve to the ground truth. LS method uses least square to fnd the vanshng pont closest to all lnes and method uses a non-lnear method to mnmze the dstance of the lne that passes the vanshng pont and the md-pont to the two end ponts. Accordng to our mplementaton the dfference of the and LS method s often several pxels so the angle dfference s very small. Ths s because method uses a non-lnear optmzaton method whch often gves a local mnmum close to the result of LS method. We just show the result of and method to make the fgure clear (Fgure 4). The parameter θ and fov are related to the perspectve effect of mages. The result (Fgure 4. (a) (b)) shows that the method gves large errors for weak perspectve mages (up to 4 degrees when the orentaton angle s less than. degrees) whle method performs relably wth maxmum angle error less than.5 degrees and average less than. degrees. When the perspectve effect s strong (orentaton angle s larger than degrees) the vanshng hull shrnks to several dozens of pxels both methods perform well. The parameter l and ε are related to the qualty of edges. The smulaton (Fgure 4. (c) (d))shows that the method gves large orentaton errors for poor qualty edges ( l < 3 or ε >. ) and the maxmum angle error s more than 4 degrees. The method performs sgnfcantly better than the method and very relable over the whole range (maxmum angle error.3 degrees and average angle error less than. degrees). The last parameter (Fgure 4. (e)) compares the performance aganst the number of mage lnes. The smulaton shows that the number of lnes has no strong effects on the performance of method however t s a crtcal parameter for the performance of the method. When the number s more than 5 method performs very relably when the number drops to t stll performs sgnfcantly better than the method. However when the number of lnes drops below 5 the result s mxed. There are several reasons for ths. Frst the regon of a vanshng hull shrnks wth the ncreasng number of lnes so t s more relable for more lnes. Second the expectaton of the vanshng hull s the optmal soluton for a vanshng pont under statstcal meanng. However when the sample (number of lnes) s small the true value of the vanshng pont may devate from the statstcal value. The last reason s that we use a unform dstrbuton whch s an approxmaton as we showed n secton.4. In general the method performs sgnfcantly better than the other two methods especally for weak perspectve mages and the performance of the method s very relable wth several hundreds of lnes a reasonable number for hgh-resoluton mages of buldngs and aeral mages. Ths shows that the expectaton of the vanshng hull s the optmal soluton of vanshng ponts estmaton. Stablty and accuracy We can also predct unstable vanshng ponts usng the method. For most of the cases the vanshng hull s closed whch ndcates that the vanshng pont s stable. When the vanshng hull s open t ndcates that the vanshng pont s at nfnty. We vsualze unstable vanshng ponts wth blue color n Fgure 4.(f) whereθ =.. Notce that the method acheves an average error less than.5 degrees even for such an ll-condtoned case. The error of the method s also wthn the magntude of the

7 Error of orentaton (degree) Error of orentaton (degree) Orentaton angle (degree) Error of orentaton (degree) Camera FOV (degree) Error of orentaton (degree) Lne length (pxel) a b c Error of orentaton (degree) Error of orentaton (degree) Nose magntude (pxel) varance for all fve groups of parameters whch mples that the varance determnes the accuracy of the estmaton. We dd not show the graph of the varance due to lmted space Number of lnes 3.. Real data The vanshng hull theory s also tested usng real data. Snce the concept of the vanshng hull s derved from the edge error model ts property (optmal estmaton stablty and accurac depends on the edge error model whch makes t a valuable tool to analyze the performance of dfferent edge error models. We tested the algorthm wth two mages. The camera s calbrated and lens dstorton s corrected. The nose magntude of the end ponts of edges s modeled as: ε = c l where l s the length of the edge and c s set to 3.5 pxels. Ths model shows a better result than settng the nose magntude as a constant value for all lnes. The frst mage s a strong perspectve mage occluded by heavy trees. Fgure 5. (a) (b) compares the result before and after flterng vanshng ponts spurous vanshng ponts caused by trees and small-scale textures are fltered usng our method whch shows the effectveness of our flter. The vanshng hull (Fgure 5. (d)) s found usng dual-space algorthm the vanshng pont s computed as the centrod assumng a unform dstrbuton and the mage s rectfed (Fgure 5. (c)) []. It s hard to verfy the property of the vanshng hull for a real mage due to lack of ground truth so we opt to use a manual verfcaton by Number of lnes d e f Fgure 4. Performance comparson of and method on synthetc data. measurng the horzontal and vertcal lne angle error. Careful manual user verfcaton shows that the horzontal angle error s less than. degrees (the standard devaton of the vanshng hull s σ =. degrees) and vertcal angle less than.5 degrees ( σ =. 7 ) whle method gves. and.3 degrees angle error respectvely. The second mage s a weak perspectve mage (Fgure 5. (e)) whch s a very challengng example for vanshng pont algorthms. The result of method shows that x 6 drecton vanshng pont s and y drecton s 4 4. Careful manual user verfcaton shows that the horzontal angle error of method s less than.3 degrees ( σ =.35 ) and vertcal angle less than. degrees ( σ =. ) whle method gves.94 and.55 degrees angle error respectvely. Both mages show that the method gves better performance (optmal soluton) and the user verfed orentaton error s wthn the range of varance (accurac. Hence the true vanshng ponts are wthn the regon of the vanshng hull. All the vanshng ponts are stable because the vanshng hulls are all closed convex polygons. 4. Concluson Vanshng ponts are valuable n many vson tasks such as orentaton and pose estmaton. Ths paper defnes the concept of vanshng hull whch s the ntersecton of the edge regons. The vanshng hull gves the regon of the true vanshng pont and ts probablty dstrbuton determnes the property of vanshng ponts. The expectaton

8 a b c d e Fgure 5. Real mage results. A strong perspectve mage s tested clusterng result before flterng (a) and after flterng (b) are shown and the mage s rectfed (c). Fgure (d) shows ts vanshng hull (yellow edges) and vanshng ponts estmated usng method (yellow pont) and method (red pont). A challengng example of weak perspectve mage s also tested (e). of the vanshng hull s the optmal soluton of the vanshng pont ts varance defnes the accuracy of the estmaton and ts shape determnes the stablty of the vanshng pont. Future work ncludes usng a more accurate edge error model to reduce the requrement of large number of edges and apply ths method to more real mages. 5. Acknowledgment Ths work made use of Integrated Meda Systems Center Shared Facltes supported by the Natonal Scence Foundaton under Cooperatve Agreement No. EEC References [] A. Almansa A. esolneux and S. Vamech. Vanshng pont detecton wthout any a pror nformaton. PAMI 5(4): [] M. Antone and S. Teller. Automac recovery of relatve camera rotatons for urban scenes. In CVPR pp [3] M. Berg etc. Computatonal geometry algorthms and applcatons. ISBN: publshed by Sprnger. [4] B. Caprle and V. Torre. Usng vanshng ponts for camera calbraton. Internatonal Journal of Computer Vson pp [5] R. Cpolla T. rummond and.p. Robertson. Camera calbraton from vanshng ponts n mages of archtectural scenes. In Proceedngs of Brtsh Machne Vson Conference pp [6] R. T. Collns and R. S. Wess. Vanshng pont calculaton as statstcal nference on the unt sphere. In ICCV pp [7] L. Grammatkopoulos G.Karra and E. Petsa. Camera calbraton combnng mages wth two vanshng ponts. ISPRS 4. [8] F.A. van den Heuvel. Vanshng pont detecton for archtectural photogrammetry. Internatonal archves of photogrammetry and remote sensng. 3(5): [9] E. Gullou. Meneveaux E. Masel. and K. Bouatouch. Usng vanshng ponts for camera Calbraton and coarse 3 reconstructon from a sngle mage. The Vsual Computer pp []. Lebowtz and A. Zsserman. Metrc rectfcaton for perspectve mages of planes. In CVPR pp []. Lebowtz A. Crmns and A. Zsserman. Creatng archtectural models from mages. Computer Graphcs Forum 8(3): [] G. Mclean and. Kottur. Vanshng pont detecton by lne clusterng. PAMI 7(): [3] C. Rother. A new approach for vanshng pont detecton n archtectural envronments. In BMVC. [4] R. Schuster N. Ansar and A. Ban-Hashem. Steerng a robot wth vanshng ponts. IEEE Transactons on Robotcs and Automaton 9(4): [5] J. Shufelt. Performance evaluaton and analyss of vanshng pont detecton technques. PAMI (3): [6] E. Wessten. Green's theorem. From MathWorld em.htm. [7] S. Barnard. Interpretng perspectve mages Artfcal Intellgence vol. pp [8] C. Burchardt and K. Voss. Robust vanshng pont determnaton n nosy mages ICPR.

CS 534: Computer Vision Model Fitting

CS 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 information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & 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 information

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge 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 information

Title: Vanishing Hull: A Geometric Concept for Vanishing Points Detection and Analysis

Title: Vanishing Hull: A Geometric Concept for Vanishing Points Detection and Analysis Pattern Recognition Manuscript Draft Manuscript Number: Title: Vanishing Hull: A Geometric Concept for Vanishing Points Detection and Analysis Article Type: Full Length Article Section/Category: Keywords:

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Support Vector Machines

Support 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 information

S1 Note. Basis functions.

S1 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 information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Image Alignment CSC 767

Image 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 information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION 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 information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R 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 information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Structure from Motion

Structure 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 information

Multi-view 3D Position Estimation of Sports Players

Multi-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 information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler 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 information

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-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 information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction

A Range Image Refinement Technique for Multi-view 3D Model Reconstruction A Range Image Refnement Technque for Mult-vew 3D Model Reconstructon Soon-Yong Park and Mural Subbarao Electrcal and Computer Engneerng State Unversty of New York at Stony Brook, USA E-mal: parksy@ece.sunysb.edu

More information

Reducing Frame Rate for Object Tracking

Reducing 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 information

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video

Line-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video 01 IEEE Internatonal Conference on Robotcs and Automaton RverCentre, Sant Paul, Mnnesota, USA May 14-18, 01 Lne-based Camera Movement Estmaton by Usng Parallel Lnes n Omndrectonal Vdeo Ryosuke kawansh,

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

12. Segmentation. Computer Engineering, i Sejong University. Dongil Han

12. Segmentation. Computer Engineering, i Sejong University. Dongil Han Computer Vson 1. Segmentaton Computer Engneerng, Sejong Unversty Dongl Han Image Segmentaton t Image segmentaton Subdvdes an mage nto ts consttuent regons or objects - After an mage has been segmented,

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range 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 information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer 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 information

Lecture 9 Fitting and Matching

Lecture 9 Fitting and Matching In ths lecture, we re gong to talk about a number of problems related to fttng and matchng. We wll formulate these problems formally and our dscusson wll nvolve Least Squares methods, RANSAC and Hough

More information

TN348: Openlab Module - Colocalization

TN348: 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 information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

Programming in Fortran 90 : 2017/2018

Programming 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 information

LEAST SQUARES. RANSAC. HOUGH TRANSFORM.

LEAST 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 information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

A Comparison and Evaluation of Three Different Pose Estimation Algorithms In Detecting Low Texture Manufactured Objects

A 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

EXTENDED BIC CRITERION FOR MODEL SELECTION

EXTENDED BIC CRITERION FOR MODEL SELECTION IDIAP RESEARCH REPORT EXTEDED BIC CRITERIO FOR ODEL SELECTIO Itshak Lapdot Andrew orrs IDIAP-RR-0-4 Dalle olle Insttute for Perceptual Artfcal Intellgence P.O.Box 59 artgny Valas Swtzerland phone +4 7

More information

An efficient method to build panoramic image mosaics

An 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 information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Machine Learning. Topic 6: Clustering

Machine Learning. Topic 6: Clustering Machne Learnng Topc 6: lusterng lusterng Groupng data nto (hopefully useful) sets. Thngs on the left Thngs on the rght Applcatons of lusterng Hypothess Generaton lusters mght suggest natural groups. Hypothess

More information

Exterior Orientation using Coplanar Parallel Lines

Exterior Orientation using Coplanar Parallel Lines Exteror Orentaton usng Coplanar Parallel Lnes Frank A. van den Heuvel Department of Geodetc Engneerng Delft Unversty of Technology Thsseweg 11, 69 JA Delft, The Netherlands Emal: F.A.vandenHeuvel@geo.tudelft.nl

More information

BUILDING RECONSTRUCTION BASED ON MDL PRINCIPLE FROM 3-D FEATURE POINTS

BUILDING RECONSTRUCTION BASED ON MDL PRINCIPLE FROM 3-D FEATURE POINTS BUILDING RECONSTRUCTION BASED ON MDL PRINCIPLE FROM 3-D FEATURE POINTS Y. Ishkawa a, I. Myagawa a, K. Wakabayash a, T. Arkawa a a NTT Cyber Space Laboratory, NTT Corporaton, - Hkarnooka Yokosuka-Sh Kanagawa,

More information

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System

Optimal Scheduling of Capture Times in a Multiple Capture Imaging System Optmal Schedulng of Capture Tmes n a Multple Capture Imagng System Tng Chen and Abbas El Gamal Informaton Systems Laboratory Department of Electrcal Engneerng Stanford Unversty Stanford, Calforna 9435,

More information

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS

PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS Po-Lun La and Alper Ylmaz Photogrammetrc Computer Vson Lab Oho State Unversty, Columbus, Oho, USA -la.138@osu.edu,

More information

Some 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 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 information

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More information

Detection of an Object by using Principal Component Analysis

Detection 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 information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

Robust Vanishing Point Detection for MobileCam-Based Documents

Robust Vanishing Point Detection for MobileCam-Based Documents 011 Internatonal Conference on Document Analss and Recognton Robust Vanshng Pont Detecton for MobleCam-Based Documents Xu-Cheng Yn, Hong-We Hao Department of Computer Scence School of Computer and Communcaton

More information

Multi-stable Perception. Necker Cube

Multi-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 information

Accuracy of Measuring Camera Position by Marker Observation

Accuracy of Measuring Camera Position by Marker Observation J. Software Engneerng & Applcatons, 2010, 3, 906-913 do:10.4236/jsea.2010.310107 Publshed Onlne October 2010 (http://www.scrp.org/journal/jsea) Accuracy of Measurng Camera Poston by Marker Observaton Vladmr

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Problem Set 3 Solutions

Problem 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 information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg

More information

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features A Probablstc Approach to Detect Urban Regons from Remotely Sensed Images Based on Combnaton of Local Features Berl Sırmaçek German Aerospace Center (DLR) Remote Sensng Technology Insttute Weßlng, 82234,

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b

The Comparison of Calibration Method of Binocular Stereo Vision System Ke Zhang a *, Zhao Gao b 3rd Internatonal Conference on Materal, Mechancal and Manufacturng Engneerng (IC3ME 2015) The Comparson of Calbraton Method of Bnocular Stereo Vson System Ke Zhang a *, Zhao Gao b College of Engneerng,

More information

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

More information

A Gradient Difference based Technique for Video Text Detection

A Gradient Difference based Technique for Video Text Detection 2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.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 information

Collaboratively Regularized Nearest Points for Set Based Recognition

Collaboratively Regularized Nearest Points for Set Based Recognition Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,

More information

Accurate Feature Extraction and Control Point Correction for Camera Calibration with a Mono-Plane Target

Accurate Feature Extraction and Control Point Correction for Camera Calibration with a Mono-Plane Target Accurate Feature Etracton and Control Pont Correcton for Camera Calbraton wth a Mono-Plane Target Y. Xao Unversty of Ednburgh yao@nf.ed.ac.uk R.B. Fsher Unversty of Ednburgh rbf@nf.ed.ac.uk Abstract The

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Prof. Feng Liu. Spring /24/2017

Prof. 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 information

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Calibration of an Articulated Camera System with Scale Factor Estimation

Calibration of an Articulated Camera System with Scale Factor Estimation Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15 CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc

More information

What are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry

What 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 information