Stabilization of infra-red aerial image sequences using robust estimation
|
|
- Daniella Bradley
- 5 years ago
- Views:
Transcription
1 Stablzaton of nfra-red aeral mage sequences usng robust estmaton Danel McRenolds, Pascal Marchand and Yunlong Sheng COP, aval Unverst, Ste-Fo, Qc, G1K 7P4, Canada éandre Sévgn Defence Research Establshment Valcarter, 459 Boul. Pe XI nord, C.P. 8800, Courcelette, Qc, G0A 1R0, Canada angs Gagnon ockheed Martn Electronc Sstems Canada, 6111 Roalmount Ave., Montreal, Qc, H4P 1K6, Canada Kewords: mage stablzaton, M-estmaton, nfra-red, dfferental nvarants, mage matchng, affne camera Current address: Centre de Recherche Informatque de Montreal 550 Sherbrooke Ouest, Montreal Quebec, CANADA, H3A1B9
2 Stablzaton of nfra-red aeral mage sequences usng robust estmaton Abstract Image stablzaton s the mage regstraton appled to one vdeo mage sequence from a sngle camera, whch has been dentfed as the ke frst step for the task of mult-spectral mage fuson for aeral survellance applcatons. The stablzaton of nfra-red IR aeral mage sequences s challengng owng to the low contrast and sgnal-to-nose rato of the mages, and to potentall large vewpont changes that result n mages wth large rotaton and scale change and perspectve dstorton. Block matchng methods are relable and accurate even for mages of poor contrast but tpcall cannot effcentl handle mage rotaton and scalng. We demonstrate a new feature-based method for IR aeral mage sequence stablzaton. We use the grelevel dfferental nvarant GDI matchng due to Schmd and Mohr whch s nvarant to rotaton and scalng. Etensons to the basc GDI method are ntroduced that mprove the performance of the method. We descrbe the orthographc proecton as a close appromaton to perspectve proecton n the case of aeral mages. Instead of the least mean square soluton, we use M-estmaton for the mage regstraton parameters. The method s robust to outlers returned b the GDI method. We verf the pont correspondence under orthographc proecton usng the eppolar constrant. Epermental results are reported for real-world and sntheszed IR mage sequences. Introducton Imagng sensors of dfferent modaltes, for eample, vsble and nfra-red, provde complementar nformaton whch, f properl fused, can assst the observer n the mage nterpretaton task. Image stablzaton s a ke step n ths process. Image stablzaton s the mage regstraton appled to one vdeo mage sequence from a sngle camera. When the camera s mounted on an unstead or a movng platform and obects are far from the camera, the 3-D space moton of the camera wll affect the mages. Even small movements of the platform can result n large dsplacements of the mages. There s also moton of the target wth respect to the statonar scene background. Ths moton s, however, not to be removed b the stablzaton process. Untl now, the prmar means avalable to stablze mages from a camera on a movng vehcle has been to mount the camera on an electro-mechancal stablzng platform. These stablzers are bulk and epensve. Ther performance degrades wth vbraton n the crtcal 0 0 Hz range. An alternatve stablzaton method uses mage processng technques to frst estmate and then elmnate the scene moton that s due to camera moton b warpng each mage frame nto precse algnment wth a reference frame. A
3 3 temporal flter frame dfference then elmnates the background scene whle hghlghtng targets that are tracked over multple frames. The mage stablzaton task has been specfed n general terms as follows. Gven an mage sequence usuall consstng of at least 10 to 30 seconds of data, a specal frame called the reference frame s chosen at or near the begnnng of the sequence. Frames subsequent to the reference frame shall be regstered to the reference frame n such a wa that the frames are precsel algned wth the reference mage. The conventonal mage regstraton method uses block matchng technques. The mages are frst parttoned nto a matr of blocks. Then, cross-correlaton between the correspondng blocks n two mages are performed, resultng n a matr of dsplacement vectors. The least mean square estmaton can then ft the dsplacement vectors nto a geometrcal dstorton model, resultng n the parameters of mage dstorton wth sub-pel accurac. The block matchng utlzes the full mage nformaton and can be appled to an tpe of mage, rch or poor n teture. The block correlaton s robust aganst random nose and has hgh accurac. However, block matchng can account for onl translatons and onl appromatel for other mage dstortons. It s epensve to compute and becomes prohbtve when the mage dsplacement s large. Also, the crosscorrelaton based on the mage ntenst smlart s senstve to envronment changes and s not applcable for regstraton of mult-spectral mages [16]. On the other hand, feature-based mage matchng can account for an mage deformaton and can be nsenstve to mult-sensor modaltes b selectng structurall salent features. It s quck to compute. However, the feature-based methods wll fal to fnd matches n structure-less areas. Its relablt depends on the feature etracton process. Therefore, robustness of the matchng process s a crtcal ssue. The onl known geometrc constrant between two mages of a sngle scene s the eppolar constrant. The eppolar geometr descrbes relatons between correspondng ponts n two mages, and s, therefore, useful for mage matchng. Zhang et al. [5] proposed a robust technque for mage matchng for uncalbrated cameras based on geometrc verfcaton usng the eppolar constrant. However, for mage stablzaton tasks t s mpossble to know, a pror, the fundamental matr of the eppolar geometr whch depends on the 3-D dsplacement and ntrnsc parameters of the camera. The ntal matchng s then requred for estmatng the fundamental matr of the uncalbrated camera. Zhang et al. use cross-correlaton between local supports of the feature ponts for the ntal matchng, whch s not nvarant to scalng, rotaton and other deformatons, and s the man lmtaton of ther approach. The use east Medan of Squares MedS to dscard outlers, that allows up to 50% false ntal matches n the estmaton of the eppolar geometr. Our eperments show that Zhang s approach can provde a large number of correct matches for outdoor mages from a ground based camera where the perspectve proecton results n local translatons of the correspondng ponts. However, Zhang s approach fals n ts ntal matchng wth aeral mages where there s, for eample, a large global rotaton of the nput scene. In ths paper we propose an approach for the stablzaton of real-world aeral nfra-red mage sequences. In the aeral mage sequences the frame to frame moton can be ver large. The IR mages are
4 4 generall nos wth low contrast. We vew the task of mage stablzaton as a problem n mage regstraton, that can be accomplshed usng mage matchng methods. A classc approach to mage matchng s to hpothesze then verf the correspondence of features between mages [6]. In ths approach, the ntal matchng s crtcal for a successful matchng and regstraton. To mprove the ntal matchng b crosscorrelaton Derche [13] added the drectons of the gradent, curvature, and a dspart measure. Hu [14] suggested to appl the cross-correlaton n several drectons and Ballard [15] used steerable flters. Schmd and Mohr [1] ntroduce grelevel dfferental nvarant GDI as a local measure for pont matchng, whch s nvarant to mage rotaton, scalng and translaton. We etract feature ponts usng the Harrs-Stephens corner detector [1], whch s effcent to compute and has been shown to be one of the best detectors n terms of repeatablt wth vewpont change and other scene varables [11]. It s effcent also to etract corner ponts n the teture of the IR mages. We use the grelevel dfferental nvarant matchng method to fnd an ntal set of matches. Three addtonal enhancements to the basc grelevel dfferental nvarant matchng method are ntroduced and tested: 1 Search over the GDI space wth k-d trees to speed up the matchng process, snce a quer fnshes n logarthmc epected tme, Scale-space verfcaton of matches to mprove the rato of true to false matches, and 3 Determnng the covarance matr for normalzng dfferental nvarants at runtme. The GDI method provdes a set of matches that often contan outlers whch can serousl perturb the estmaton of the mage transformaton. We use M-estmaton whch s robust to outlers and s computatonall effcent, and a varant of least medan of squares, whch s more computatonall epensve, n the case that M- estmaton falure s detected. For aeral mages, the dstance from scene to camera s much larger than the depth of the scene, and the feld of vew ma be small. In ths case, the orthographc proecton provdes a good appromaton to perspectve proecton, as shown b Prtt [4, 10], and then the unque optmal soluton, n a least squares sense, for regsterng a par of mages, s the global affne transformaton wth local dstorton modeled b a dsplacement along parallel eppolar lnes proportonal to the heght of the scene pont. However, Prtt does not address the crtcal ssue of the ntal matchng, estmaton of the transformaton parameters n the presence of outlers, nor are results presented for real world mage data. We ft the GDI matches to the global affne transformaton, that accounts for mage scalng and rotaton n the mportant ntal matchng stage and mplement a robust mage regstraton. It s b ncorporatng robust estmaton nto the mage regstraton process that we perform a match verfcaton process usng the eppolar constrant. Enhanced grelevel dfferental nvarant matchng At each feature pont n the mage found b the Harrs-Stephens corner detector, a grelevel dfferental nvarant GDI vector s computed. The GDI representaton and matchng method are nvarant to mage rotaton, scalng and translaton [1]. A normalzed verson of the representaton s also nvarant to brghtness scalng. The representaton s farl robust wth respect to rotaton n depth that leads to foreshortenng of surface patches,.e., n general, a local affne dstorton of the brghtness surface.
5 5 The grelevel dfferental nvarants are based on the dervatves of the Gaussan fltered mage n a representaton called the local et. The local et represents the truncated Talor seres epanson of the mage functon and s useful for encodng the poston dependent geometr of the brghtness surface. The use of Gaussan smoothng makes the dfferentaton well posed n addton to havng other nce mathematcal propertes. The dfferental nvarant vector V s gven b [1] 1 = V where s the Gaussan fltered mage functon and subscrpts denote partal dfferentaton n a Cartesan coordnate sstem. For eample, s the average brghtness, s the gradent magntude squared, and s the aplacan of the brghtness functon. The components of the vector, V, of nvarants, are the complete and rreducble set of dfferental nvarants up to thrd order. These functons are rotatonall smmetrc. Dfferental nvarants can be also nvarant to an affne transformaton of the brghtness functon gven b b a =,, ~ I I. These nvarants are the last seven components of the dfferental nvarant vector, V, normalzed b an approprate power of the gradent magntude squared. To gve scale nvarance over a fed range we compute a set of scales centered on a reference scale, σ 0, such that σ = σ / where -n -1, 0, 1 n. A value of four for n elds the scale factor range 0.48 to.07, hence there are nne dfferental nvarant vectors for each kepont. Ths s a mult-scale representaton. The 0 percent factor s emprcall derved and reflects the epected dfferental scale range over whch the nvarants do not change apprecabl. Nearest neghbour search b k-d tree The Mahalanobs dstance s used to determne the nearest neghbour. Ponts are declared to be correspondng when the par of ponts from two mages are mutuall selected as closest. The space of dfferental nvarant vectors can be organzed n a hash table [1] or wth a tree representaton such as the k-d tree. Nearest neghbour searchng wth k-d trees reduces the search tme to logarthmc epected tme. The epected number of records eamned to satsf a quer s gven b the epresson k k b k G b b k R } ] / {[, / 1 1, where k s the record dmenson, b s the number of records n a bucket, and 1 k G s a constant that accounts for the geometrc propertes of the norm used for the dstance measure [7]. For our mplementaton of GDI matchng, 1 = k G, k s 7 and b s 1, hence R7,1=18.
6 6 Match verfcaton n scale-space Epermental results suggest that nearest neghbour matchng wth dfferental nvarants s scale senstve over moderate vewpont changes. A local multscale analss s used to flter out scale-space unstable and hence potentall ncorrect matches. The full dfferental nvarant matchng process s carred out at three reference scales that dffer b multples of ten percent of the reference scale σ 0,.e., σ 1 * 0.1 for k=0,..,. The value of ten percent s half the epected scale senstvt of 0 k dfferental nvarants. Ths value was found epermentall to eld good results. Too large a value elmnates most matches and too small a value does not effectvel elmnate scale unstable matches. A match s scalespace verfed f t ests at all three scales. Epermental results demonstrate that ths verfcaton step sgnfcantl ncreases the rato of correct to ncorrect matches. Ths step ncreases the computatonal cost b a factor of three but t s parallelzable. Normalzaton The varant of k-d tree used here requres that the data satsf a Eucldean norm. An approprate transformaton of the GDI vectors b a sutable covarance matr accomplshes ths. The covarance matr descrbes the epected varance of the dfferental vector components wth respect to changes n vewpont, llumnaton, sensor propertes, and nose. For an mage retreval task [8] the covarance matr s determned b averagng together over all keponts the covarance matr generated for each kepont b trackng observatons over an etended mage sequence. It s not clear, however, f ths s sutable for the mage matchng problem. Frst, we assume that trackng s generall not an opton. Secondl, the resultng covarance matr ma not be sutable for all mage pars to be matched, ecept, of course, the mages from the sequence tself. Computng and combnng covarance matrces over several dfferent sequences, thereb enlargng the sample sze, ma be suffcent for a varet of mage retreval tasks. Instead, we adopt a classcal perturbaton approach to estmatng the covarance matr for the dfferental nvarant vectors. Such an approach s frequentl used when an analtc soluton s not feasble. For eample, ths approach s used to determne datum/model compatblt for the RANSAC algorthm [9]. The RANSAC procedure uses data perturbaton to estmate mpled error bounds for a gven model. The covarance matr s estmated b averagng together a large number of covarance matrces generated from dfferental nvarant vectors and ther nose perturbed devates. We compute a covarance matr drectl from the gven mage par b modelng brghtness varaton due to all the factors mentoned above b normall dstrbuted nose added to the mages. The nose varance s some fracton of the varance of the mage brghtness over the entre feld of vew. A value of 5 percent of the brghtness varance has been used n the descrbed eperments. Ths s an emprcal value that has elded good results. Furthermore, the matchng results are not overl senstve to ths value.
7 7 Image regstraton wth M-estmators Image regstraton procedure Gven two mages, the GDI method returns a set of hpotheszed correspondences. Gross outlers are elmnated usng the gradent angle consstenc constrant. The resultng set of matches are then used to estmate the orthographc proecton usng M-estmaton. An ntal estmate of the transformaton uses the so called "Far" functon whch provdes an ntal set of weghts. The fnal estmate s computed usng the "Tuke b-weght" functon whch can elmnate outlers. The mage s then resampled nto the reference coordnate frame usng b-lnear nterpolaton. If the ntal estmate should cause the fnal estmaton process to elmnate 50 percent or more of the matches then a process smlar to least medan of squares s eecuted whch seeks to determne the best ntal estmate usng random subsets of 4 matches from the entre set of matches. The mplct assumpton s that there are fewer than 50 percent outlers, snce the best sub-sample s predcated on the medan resdual. The revsed ntal estmate s used to compute the new fnal estmate. The mage s then resampled and regstered as before. Eppolar Constrant The onl known geometrc constrant that ests between correspondng pont matches from two or more vews s the eppolar constrant, whch can be used for mage matchng. When the feld of vew s small and varaton n depth of the scene s small compared to ts average dstance to the camera, the orthographc and scaled orthographc proecton s a close appromaton to the perspectve proecton model [4][10]. The appromaton s also good for large feld of vew f the separaton angle between two cameras s small [4]. Under ths appromaton, the model locates the optcal center at nfnt, hence, the proecton ras are parallel to one another and perpendcular to the mage plane. The eppoles are stuated at nfnt n the mage plane and the eppolar lnes are parallel. The parallel proecton s lnear wth the regstraton functon epressed b [4] F, = A, h, e, where F =, maps ponts 1, 1 transformaton gven b 3 ˆ ˆ p = p 1 4 p p 5 from the frst mage to the second, A 1, 1 s an affne 1 p3 1 p6 1, and h 1, 1 s the z coordnate of the non-occluded pont n the nput scene. Its value depends on the choce of the scene coordnate sstem. The vector e s the eppolar vector. The parallel eppolar lnes are epressed as A 1, 1 αe whch depends onl on the poston and orentaton of the two mage coordnate sstems relatve to the scene coordnate sstem and α s a real number. The regstraton functon s globall defned b an affne
8 transformaton. Eq. accounts eplctl for the depth varaton va the heght functon h 1, 1 as a local dstorton whch are dsplacements along eppolar lnes and proportonal to the heghts n the scene. The choce of parameters A 1, 1, h 1, 1 and e n Eq. s not unque. The soluton becomes unque wth normalzaton constrants proposed b Prtt, namel that the zero and frst order moments the scene s heght functon h 1, 1 be equal to zero. Under ths constrant, all the terms nvolvng h dsappear n the equatons for the least mean square soluton of Eq.. Ths s equvalent to the least mean square soluton of equaton 4 F 1, 1 = A 1, 1 for the affne transformaton A 1, 1. The affne component of the regstraton functon determnes the least squares estmate of a planar appromaton of the scene structure. After the determnaton of A 1, 1, the eppolar vector e and the scene heght functon can be recovered from the resdual errors: 5 s = - [p 1 1 p 1 p 3 ] and 6 t = - [p 4 1 p 5 1 p 6 ] where, s the observed pont n the second mage that corresponds wth 1, 1. The slope of the eppolar vector e s gven b 1/ 7 m = [ β δ β 4 ] ZKHUH Σt - s / Σs t DQG VJQΣs t. Ths estmate for the slope of the eppolar lne s the least squares soluton for the obectve functon that mnmzes the orthogonal dstances of the ponts s, t to the lne. The robust estmaton of the affne transformaton parameters therefore mplements a verfcaton of the matches usng the eppolar constrant. The eppolar vector e s gven b 8 e = e 1,e T = [1/1m 1/, m/1m 1/ ]. The soluton for h s gven b 9 h = se1 te. 8 M-estmaton appled to mage regstraton et rs,, t be the th resdual,.e., the dfference between the th observaton and the current estmate of the ftted value. The classc least squares problem seeks to mnmze r whch s known to be unstable n the presence of outlers n the data. The M-estmators are desgned to reduce ths nstablt b replacng the squared resduals r b a functon of the resduals whch elds the problem [3] mn ρ r,
9 9 where ρ s a smmetrc, postve defnte functon wth a unque mnmum at zero and s chosen to be less ncreasng than square. The problem s not solved drectl but s mplemented as an terated re-weghted lnear least squares soluton. We seek to estmate p for =1 to 6 from Eq.3 whch s also the desred soluton for Eq.4. We solve for the parameters p 1 to p 3 usng the M-estmaton formulaton r 10 w r r = 0 over =1,,k data ponts and =1,,3. Smlarl for p 4 to p 6 we solve r 11 w r r = 0 over =1,,k data ponts and =4,5,6. Choce of obectve functons Some ρ-functons assure a unque soluton, but snce the onl reduce the effect of outlers, the estmator can be based. Other ρ-functons do not guarantee a unque soluton, but reduce consderabl the effect of outlers or even more, elmnate them. Snce no ρ-functon s perfect, we use both tpes of ρ-functons as proposed b Huber []. We began the estmaton process wth the obectve functon Far and then refne the estmate wth Tuke's b-weght functon. For both functons, the convergence threshold used s 0.1% n the relatve dfference between terated parameter estmates. The Far dstrbuton has contnuous dervatves up to thrd order and elds a unque soluton. Gven these choces for the obectve functon the estmator of the global affne transformaton can be wrtten as follows from Eq. 10 for the resdual n the component 1 w [ = - p1 1 p 1 p3] w = [ - p1 1 p 1 p3 ] 1 0 w = [ - p1 1 p 1 p3] 1 0 r where r = 1, r = 1, and = 1. The th teraton of the weght, w, s one of Far or Tuke's b- weght as descrbed above. Smlarl, for the component from Eq. 11 w [ = - p4 1 p5 1 p6] w = [ - p4 1 p5 1 p6 ] 1 0 w = [ - p4 1 p5 1 p6] 1 0 r r r where = 1, = 1, and = Eqs.1 and 13 gve a lnear sstem of 6 equatons n the 6 unknown parameter varables p 1 to p 6 whch are solved for teratvel n two phases. The frst phase uses the Far weghtng functon to eld an
10 10 ntal estmate. The fnal estmate uses the Tuke b-weght functon ntalzed wth the weghts and parameters from the Far estmate. The regstraton functon for the epermental results reported here s gven b F, = A,,.e., the heght term s gnored. The assumpton s that the heght functon values are not large enough to sgnfcantl perturb the regstraton for the aeral mage sequences. It s straghtforward to generalze the approach b the addton of the term h, e to the global affne transformaton. The drawback s the necesst to estmate h, over the entre feld of vew. Ths requres us to nterpolate the heght functon for known pont correspondences whch wll eld a poor estmate for a sparse set of pont matches or, alternatvel, one can compute a dense matchng usng a method such as optcal flow. Match denst for pont features can be ncreased b searchng for addtonal matchng ponts along the estmated eppolar lnes, a one dmensonal search. Ill-condtoned solutons In some rare cases, convergence gven b the Far functon s not the one we would epect. Ths can happen when the GDI method returns matches where the number of outlers s not relatvel small or ther dstrbuton perturbs the estmator sgnfcantl. In ths case, the mnmum reached depends upon the nfluence of the outlers and the ntal value of the resdual error functon. The Far functon ma converge to a mnmum such that man of the matches have relatvel small weghts, and therefore the estmate s supported b relatvel few matches. After convergence of the Far functon, Tuke s b-weght functon seeks to mprove the estmate of the parameters b elmnatng the effect of large outlers, but contnues to converge n the same drecton that the Far functon dd. If we then look at the ω, we see that most of the matches are zero weghted because the estmate causes them to have a ver large resdual. Random search for least medan of squares resdual To overrde ths stuaton, we added a process whch provdes a new ntal parameter estmate that s then passed to the Tuke s b-weght functon process for computng a fnal estmate. In prncple, Tuke s bweght functon then converges to the global mnmum eldng a better parameter estmate. We defned as a threshold for computng a revsed ntal estmate that at least 50% of all matches must be 0-weghted from the fnal estmate provded b M-estmaton wth Tuke s b-weght functon. The process that fnds a better ntal estmate randoml chooses 4 matches, whch s the mnmum number of matches to do a mnmall overconstraned estmate, from the lst provded b the GDI method less the gross outlers detected b the gradent angle constrant. These four matches then pass through the Far and Tuke s b-weght estmaton processes as before. The process then computes the resdual for all matches found b GDI accordng to the parameter estmate found for ths subset. The process takes note of ths parameter estmate, the weghts ω of the subset and the medan resdual over the entre set of matches. If one or more of the subset ω s 0, the subset result s
11 11 gnored. The process terates untl 71 subsets are selected. Ths number of subsets guarantees wth a probablt of 0.99, assumng no more than 50 percent outlers, that at least one of the subsets s composed of 4 good matches. At the end, the process takes the ω and parameter estmate of the subset wth the lowest medan resdual. All matches are then ncorporated and the 4 matches of the selected subset keep ther recorded weght. All other ω are put to 0.5, where ω can var from 0 to 1, to avod over-weghtng potental outlers. Wth these values for the weghts a fnal estmate s made usng the Tuke s b-weght functon process untl convergence. Ths gves a more robust estmate of the global affne transformaton parameter vector. Note that ths random search process s more computatonall epensve than the M-estmaton process and, therefore, s not used as the man estmaton method. Infra-red aeral mage sequence DIM01 Epermental results Fgure 1 gves the GDI matchng results for frames 01 and 0 from the sequence DIM01, a sequence provded b Defence Research Establshment Valcarter for algorthm development purposes. The sequence s acqured at a 4Hz frame rate b a helcopter mounted nfra-red camera. Note the large scale change due to the camera translaton n the foreground and a rotaton about a pont n the lower left mage quadrant. The scale of Fgure 1: Grelevel dfferental nvarant matches. eft mage s frame 01 and rght mage s frame 0. Matches 7, 8 and 1 are ncorrect. the smoothng kernel for the dfferental nvarants s fve pels wth Gaussan pre-smoothng of the mages at a scale of four pels to reduce the IR scan nose as well as to compensate for the lack of fdelt of the actual mage transformaton wth the assumed transformaton. The GDI model assumes the sgnal s transformed b a smlart transformaton. The actual model s better appromated b a local affne transformaton that n turn s a local appromaton of the effect of the perspectve dstorton due to the translatng camera. Also, because the scale of the sgnal s ncreasng, more detal s present n the nonreference mage that leads to a perturbaton of the nvarants. Addtonal smoothng of the reference and nonreference mages reduces the perturbng effects of the scale change. Of the 1 matches 3 are ncorrect and are elmnated b the gradent angle constrant. The gradent angle constrant deletes matches whose angle change s dfferent b /- 45 from the medan angle change for all matches. These matches are defned as the gross outlers.
12 1 Fgure : eft: Regstered frame 0, compare wth frame 01 n Fg. 1. Note presence of artfacts along bottom from source mage resampled nto regstered frame. Rght: Dfference of reference and regstered frames. The left mage of Fgure shows frame 0 resampled nto the mage coordnate sstem of frame 01 n accordance wth the global affne transformaton robustl estmated from nne matches. Resamplng was b blnear nterpolaton. The rght mage of Fgure s the dfference between the regstered frame 0 and the reference frame 01. The contrast of the mage s stretched to fll the range 0 to 55. The wdths of brghtness dscontnut hghlghts the error n the regstraton. The errors are due to the lack of match ponts n the foreground where perspectve dstorton s greatest. Also, the local dstorton term has not been ncorporated. Nevertheless, the regstraton result s good. Grelevel dfferental nvarant matchng etensons Fgure 3 shows the matches returned b the GDI matchng method for the frst of three scale levels wth the dfferental nvarant flter scale equal to 5 pels. The remanng two reference scale levels are 5.5 and 6.05 pels respectvel. We note the larger number of matches, n all. Of these matches, 11 are correct or 50%. Match 7 and 11 are correct but do not appear at all three scales. For the 5.5-pel scale level the number of matches s 31 of whch 14 are correct 45%, and for the last scale level there are 19 out of 9 matches correct 66%. Wth scale-space trackng there are 9 out of 1 correct matches 75% a large mprovement n terms of the rato of correct to total matches. We also note the hgh senstvt to small perturbatons of scale ehbted b the GDI matchng process. Fnall, the average number of records searched over both k-d trees over the three reference scale levels wth 900 records n each tree was 76 n keepng wth the epected logarthmc tme to complete a quer. Fgure 3: GDI matches for the frst of three scales for nfra-red DIM01 sequence. eft: frame 01. Rght: frame 0.
13 13 Fgure 4. Eppolar lnes for frames 01 and 0. Observatons are marked wth "", reproected scene ponts b " DQGWKHKHJKW corrected reproectons b 7KHODVWWZRIUDPHV are a zoomed vew of pont 8 from frames 01 and 0 respectvel. Eppolar estmaton The eppolar lnes and heght corrected reproectons were estmated accordng to Eqs. 8 and 9 and are plotted n Fgure 4. The slope angles for the eppolar lnes n frames 01 and 0 were.7 and -8.1 respectvel for a fronto-parallel rotaton angle of 5.4. The RMS resdual for frame 01 reproected ponts before heght correcton s 0.85 pels and after heght correcton t s 0.5 pels. The RMS resdual for frame 0 s 0.97 and 0.69 pels before and after heght correcton. The last two frames of Fgure 4 shows pont 8 wth the ftted eppolar lne and the reproected matchng pont from the other mage before and after correcton b the heght local dstorton factor. Snthetc mage sequence ockheed Boats8 Fgure 5: Reference mage 00 wth matches to frame 08 from GDI method. Matches 15, 17, and 0 are ncorrect. Fgure 6: Frame 08 wth matches to reference mage. Image 08 s rotated 40º from the reference mage wth addtve nose and a random affne dstorton. Net s an eample of the regstraton process from a sntheszed moton sequence. These mages are from a sequence composed of 11 frames sntheszed from a real nfra-red mage. The moton conssts of a contnuous rotaton of the sequence reference mage wth addtve Gaussan nose and a random affne dstorton. In ths eample the non-reference mage s frame 08, whch s rotated b a 40º angle from the reference mage. Fgures 5 and 6 show the matches obtaned from the grelevel dfferental nvarant matchng method. The GDI method provdes 0 matches, where 17 are correct. Matches 15, 17, and 0 from Fgures 5 and 6 are ncorrect.
14 14 Fgure 7:Frame 08 regstered to reference mage. Fgure 8: Dfference between regstered mage 08 and the reference mage. See tet. Fve matches, those labeled 3,8,15,16, and 0 from fgures 5 and 6 were elmnated usng the gradent angle constrant. Note that matches 3,8 and 16 were ncorrectl elmnated. Ths ma be due to the added nose and the shear ntroduced b the affne transformaton n addton to the pure rotaton. Fgure 7 shows mage 08 regstered to the reference mage after M-estmaton of the global affne transformaton and resamplng b blnear nterpolaton. Incorrect match 17 from Fgures 5 and 6 was correctl elmnated b the Tuke b-weght robust estmaton functon,.e., ts weght was set to zero. Fgure 9. Eppolar lnes for frames 00 and 08. Observatons are marked wth "", reproected scene ponts b " DQG the heght corrected UHSURMHFWRQVE\ Fgure 8 gves the mage dfference between the regstered frame 08 and the reference mage. The scene obect can stll be dstngushed because the pel value plus addtve nose eceeded the mamum pel value and therefore was clpped. The nose s normall dstrbuted wth a zero mean and a standard devaton of 15 percent of the standard devaton of the reference brghtness mage. The brghtness dstrbuton s therefore not a normal dstrbuton after mage subtracton n that area where the brghtness values were clpped. Fgure 9 shows the estmated eppolar geometr for the two vews. The eppolar lne slope angle for frame 00 s 8.3º and 13º for frame 08 whch gves a fronto-parallel rotaton angle of 41.3º. Concluson We have demonstrated the stablzaton of aeral mage sequences wth scale, rotaton and large translatons usng robust estmaton. The method s computatonall nepensve and theoretcall well founded owng to the approprateness of the orthographc proecton model whch s a close appromaton to the perspectve proecton for the aeral mages. We have shown the grelevel dfferental nvarant GDI method that provdes matches for mage transformatons wth rotaton, scalng and some shear. Three etensons to the basc GDI matchng method were descrbed and epermentall verfed. The etensons allow for runtme computaton of the GDI vector normalzaton, ncreases the rato of true to false matches and reduces the quer tme to an epected logarthmc tme. We have appled the robust M-estmaton to the soluton of the
15 regstraton functon under the parallel proecton model. We have shown the robustness of the method to outlers n the ntal GDI matchng. In comparson, Zhang s method can provde man more matches than the GDI method n man cases, but cannot provde an correct matches when the affne transformaton ncludes a large rotaton or scalng. Therefore, the proposed approach s useful for aeral mage regstraton and Zhang s method can be used for ground-based mage regstraton. The ntal matchng sub-task, before eppolar verfcaton, s clearl seen to be the maor hurdle to a full automatc feature-based regstraton method. New methods for ths sub-task are presentl under nvestgaton. References [1] Schmd, C., Mohr, R., "Matchng b local nvarants", Rapport de recherche, N. 644, INRIA, August [] Huber, P.J., "Robust Statstcs", John Wle & Sons, New York, [3] Zhang, Z., "Parameter estmaton technques: a tutoral wth applcaton to conc fttng," Image and Vson Computng, 15, pp , [4] Prtt, M.D., "Image regstraton wth use of the eppolar constrant for parallel proectons," Journal of the Optcal Socet of Amerca A, Vol. 10, No. 10, pp , October [5] Zhang, Z., Derche, R., Faugeras, O., Quang-Tuan,., "A robust technque for matchng two uncalbrated mages through the recover of the unknown eppolar geometr," Artfcal Intellgence, 781-, , [6] McRenolds, D.P., owe, D.G., "Rgdt checkng of 3D pont correspondences under perspectve proecton," IEEE Transactons PAMI,181, , [7] Sproull, R.F., "Refnements to nearest-neghbour searchng n k-dmensonal trees," Algorthmca, 6, , [8] Schmd, C., Mohr, R., "ocal Gravalue Invarants for Image Retreval," IEEE PAMI19, No. 5, , Ma [9] Fschler, M.A., Bolles, R.C., "Random sample consensus: a paradgm for model fttng wth applcatons to mage analss and automated cartograph," Comm. of the ACM, Vol. 4, No. 6, , June [10] Shapro,.S., Zsserman, A., Brad, M., "3D moton recover va affne eppolar geometr," Internatonal Journal of Computer Vson, 16, , [11] Schmd, C., Mohr, R., and Bauckhage, C., "Comparng and Evaluatng Interest Ponts," Proc. Internatonal Conference on Computer Vson, 30-35, Bomba, Inda, [1] Harrs, C., Stephens, M., "A combned corner and edge detector", Proceedngs 4th Alve Vson Conference, , [13] Derche, R., Zhang, Z., uong, Q.-T., Faugeras, O., "Robust recover of the eppolar geometr for an uncalbrated stereo rg," Proc. European Conference on Computer Vson, , [14] Hu, X., Ahua, N., "Feature etracton and matchng as sgnal detecton," Internatonal Journal of Pattern Recognton and Artfcal Intellgence, 86, , [15] Ballard, D.H., Wson,.E., "Obect recognton usng steerable flters at multple scales," IEEE Workshop on Qualtatve Vson, n conuncton wth the conference on Computer Vson and Pattern Recognton, New York, NY, -10, June [16] Belanger, ous N.; Gagnon, Roger; essard, Perre; Maheu, Jean; Blanchard, Auguste, "Pel and subpel mage stablzaton at vdeo rate for arborne long-range magng sensors," n Proc. SPIE Vol. 69, , Infrared Technolog XX, Born F. Andresen; Ed., October
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 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 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 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 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 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 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 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 informationImage warping and stitching May 5 th, 2015
Image warpng and sttchng Ma 5 th, 2015 Yong Jae Lee UC Davs PS2 due net Frda Announcements 2 Last tme Interactve segmentaton Feature-based algnment 2D transformatons Affne ft RANSAC 3 1 Algnment problem
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 informationFeature 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 information12/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 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 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 informationCS434a/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 informationRELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5
RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA Taeyoon Lee a, *, Taeung Km a, Gunho Sohn b, James Elder a a Department of Geonformatc Engneerng, Inha Unersty, 253 Yonghyun-dong,
More informationRobust 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 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 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 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 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 informationUnsupervised 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
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 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 informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationA 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 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 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 informationy 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 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 informationFitting and Alignment
Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)
More informationGeometric Transformations and Multiple Views
CS 2770: Computer Vson Geometrc Transformatons and Multple Vews Prof. Adrana Kovaska Unverst of Pttsburg Februar 8, 208 W multple vews? Structure and dept are nerentl ambguous from sngle vews. Multple
More informationA Methodology for Document Image Dewarping Techniques Performance Evaluation
2009 0 Internatonal Conference on Document Analss and Recognton A Meodolog for Document Image Dewarpng Technques Performance Evaluaton N. Stamatopoulos, B. Gatos, I. Pratkaks Computatonal Intellgence Laborator,
More informationImproved SIFT-Features Matching for Object Recognition
Improved SIFT-Features Matchng for Obect Recognton Fara Alhwarn, Chao Wang, Danela Rstć-Durrant, Axel Gräser Insttute of Automaton, Unversty of Bremen, FB / NW Otto-Hahn-Allee D-8359 Bremen Emals: {alhwarn,wang,rstc,ag}@at.un-bremen.de
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 informationFEATURE 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 informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Supervsed vs. Unsupervsed Learnng Up to now we consdered supervsed learnng scenaro, where we are gven 1. samples 1,, n 2. class labels for all samples 1,, n Ths s also
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 informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationContent 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
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 informationA method for real-time implementation of HOG feature extraction
Invted Paper A method for real-tme mplementaton of HO feature etracton LUO Ha-bo 134 YU Xn-rong 1345 LIU Hong-me 5 DIN Qng-ha 6 1. Shenang Insttute of Automaton Chnese Academ of Scences Shenang 110016
More informationFeature-based image registration using the shape context
Feature-based mage regstraton usng the shape context LEI HUANG *, ZHEN LI Center for Earth Observaton and Dgtal Earth, Chnese Academy of Scences, Bejng, 100012, Chna Graduate Unversty of Chnese Academy
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 informationKinematics Modeling and Analysis of MOTOMAN-HP20 Robot
nd Workshop on Advanced Research and Technolog n Industr Applcatons (WARTIA ) Knematcs Modelng and Analss of MOTOMAN-HP Robot Jou Fe, Chen Huang School of Mechancal Engneerng, Dalan Jaotong Unverst, Dalan,
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 information3D Modeling Using Multi-View Images. Jinjin Li. A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science
3D Modelng Usng Mult-Vew Images by Jnjn L A Thess Presented n Partal Fulfllment of the Requrements for the Degree Master of Scence Approved August by the Graduate Supervsory Commttee: Lna J. Karam, Char
More informationOutline. 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 informationInverse-Polar Ray Projection for Recovering Projective Transformations
nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced
More informationA NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX
A NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX A. Almhde, C. Léger, M. Derche 2 and R. Lédée Laboratory of Electroncs, Sgnals and Images (LESI),
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationPictures at an Exhibition
1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned
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 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 informationNew dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system
New dynamc oom calbraton technque for a stereo-vson based mult-vew 3D modelng system Tao Xan, Soon-Yong Park, Mural Subbarao Dept. of Electrcal & Computer Engneerng * State Unv. of New York at Stony Brook,
More informationAUTOMATIC IMAGE REGISTRATION OF MULTI-ANGLE IMAGERY FOR CHRIS/PROBA
AUTOMATIC IMAGE REGISTRATION OF MULTI-ANGLE IMAGERY FOR CHRIS/PROBA J. Ma *, J.C.-W. Chan, F. Canters Cartography and GIS Research Group, Department of Geography, Vrje Unverstet Brussel, Plenlaan, 050
More informationLobachevsky 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 informationData Mining: Model Evaluation
Data Mnng: Model Evaluaton Aprl 16, 2013 1 Issues: Evaluatng Classfcaton Methods Accurac classfer accurac: predctng class label predctor accurac: guessng value of predcted attrbutes Speed tme to construct
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
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 informationOptimal Combination of Stereo Camera Calibration from Arbitrary Stereo Images.
Tna Memo No. 1991-002 Image and Vson Computng, 9(1), 27-32, 1990. Optmal Combnaton of Stereo Camera Calbraton from Arbtrary Stereo Images. N.A.Thacker and J.E.W.Mayhew. Last updated 6 / 9 / 2005 Imagng
More informationA 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 informationLecture 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 informationTakahiro ISHIKAWA Takahiro Ishikawa Takahiro Ishikawa Takeo KANADE
Takahro ISHIKAWA Takahro Ishkawa Takahro Ishkawa Takeo KANADE Monocular gaze estmaton s usually performed by locatng the pupls, and the nner and outer eye corners n the mage of the drver s head. Of these
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationNUMERICAL 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 informationIMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH
IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH Jyot Joglekar a, *, Shrsh S. Gedam b a CSRE, IIT Bombay, Doctoral Student, Mumba, Inda jyotj@tb.ac.n b Centre of Studes n Resources Engneerng,
More informationCluster 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 informationAcoustic Camera Image Mosaicing and Super-resolution
Acoustc Camera Image Mosacng and Super-resoluton K. Km Insttute for Bran and Neural Systems Brown Unv. Box 1843 Provdence RI 091, USA ko@brown.edu N. Nerett Insttute for Bran and Neural Systems Brown Unv.
More informationAn 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 informationBiostatistics 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 information3D 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 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 informationX- 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 informationCorner-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 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 informationPHOTOGRAMMETRIC ANALYSIS OF ASYNCHRONOUSLY ACQUIRED IMAGE SEQUENCES
PHOTOGRAMMETRIC ANALYSIS OF ASYNCHRONOUSLY ACQUIRED IMAGE SEQUENCES Karsten Raguse 1, Chrstan Hepke 2 1 Volkswagen AG, Research & Development, Dept. EZTV, Letter Box 1788, 38436 Wolfsburg, Germany Emal:
More informationRobust Computation and Parametrization of Multiple View. Relations. Oxford University, OX1 3PJ. Gaussian).
Robust Computaton and Parametrzaton of Multple Vew Relatons Phl Torr and Andrew Zsserman Robotcs Research Group, Department of Engneerng Scence Oxford Unversty, OX1 3PJ. Abstract A new method s presented
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 informationRange Data Registration Using Photometric Features
Range Data Regstraton Usng Photometrc Features Joon Kyu Seo, Gregory C. Sharp, and Sang Wook Lee Dept. of Meda Technology, Sogang Unversty, Seoul, Korea Dept. of Radaton Oncology, Massachusetts General
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
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 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 informationA 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 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 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 informationAn 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 informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
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 informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationUnsupervised 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 informationHelp for Time-Resolved Analysis TRI2 version 2.4 P Barber,
Help for Tme-Resolved Analyss TRI2 verson 2.4 P Barber, 22.01.10 Introducton Tme-resolved Analyss (TRA) becomes avalable under the processng menu once you have loaded and selected an mage that contans
More informationUSING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES
USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of
More informationOverview. 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 informationCORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES
CORRELATION ICP ALGORITHM FOR POSE ESTIMATION BASED ON LOCAL AND GLOBAL FEATURES Marco A. Chavarra, Gerald Sommer Cogntve Systems Group. Chrstan-Albrechts-Unversty of Kel, D-2498 Kel, Germany {mc,gs}@ks.nformatk.un-kel.de
More informationDetermining 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 informationn others; multple brghtness values n one mage may map to a sngle brghtness value n the other mage, and vce versa. In other words, the two mages are us
Robust Mult-Sensor Image Algnment Mchal Iran Dept. of Appled Math and CS The Wezmann Insttute of Scence 76100 Rehovot, Israel P. Anandan Mcrosoft Corporaton One Mcrosoft Way Redmond, WA 98052, USA Abstract
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 information