Combining complementary edge, point and color cues in model-based tracking for highly dynamic scenes

Size: px
Start display at page:

Download "Combining complementary edge, point and color cues in model-based tracking for highly dynamic scenes"

Transcription

1 Combnng complementary edge, pont and color cues n model-based trackng for hghly dynamc scenes Antone Pett, Erc Marchand, Keyvan Kanan Abstract Ths paper focuses on the ssue of estmatng the complete 3D pose of the camera wth respect to a complex object, n a potentally hghly dynamc scene, through modelbased trackng. We propose to robustly combne complementary geometrcal edge and pont features wth color based features n the mnmzaton process. A Kalman flterng and pose predcton process s also suggested to handle potental large nterframe motons. In order to deal wth complex 3D models, our method takes advantage of hardware acceleraton. Promsng results, outperformng classcal state-of-art approaches, have been obtaned on varous real and synthetc mage sequences, wth a focus on space robotcs applcatons. I. INTRODUCTION Determnng the complete 3D pose of the camera wth respect to the object s a key requrement n many robotc applcatons nvolvng 3D objects, for nstance n the case of autonomous, vson-based and uncooperatve space rendezvous wth space targets or debrs [13]. Based on the knowledge of the 3D model of the target, common approaches address ths problem by usng ether texture [1], edge features [6, 5, 13] or color or ntensty features [11, 17]. In order to cope wth advantages and drawbacks of these dfferent types of cues, some researches have focused on combnng them. Dfferent ways of handlng the ntegraton have been consdered. Some studes propose a sequental ntegraton of edge and texture cues [1, 3], where the computed domnant moton [1] provdes a predcton of the projected edges n the mage, mprovng the ntalzaton of an edge-based mnmzaton process. [3] uses optcal flow of pxels lyng on the projected object to ntalze a maxmzaton process of the separaton between object and background along the object contours usng color or lumnance probabltes. Other methods smultaneously merge features of dfferent types wthn probablstc or flterng technques such as Kalman flters w.r.t. the pose parameters [8, 7], by ntegratng nterest ponts matchng n an Extended Kalman Flter for [8], and ntegratng optcal flow estmaton for [7]. [18] elaborated a smlar hybrd soluton wthn a probablstc Expectaton Maxmzaton (EM) framework whch ams at optmzng the posteror probabltes of both edge and FAST pont features. Works of [21, 15, 16, 12] rely on a determnstc teratve mnmzaton of a global error functon combnng the dfferent features. [21] proposes for nstance to ntegrate n a classcal edge-based error functon [6, 5] geometrcal A. Pett s wth INRIA Rennes - Bretagne Atlantque, Lagadc Team, France, Antone.Gullaume.Pett@nra.fr. E. Marchand s wth Unversté de Rennes 1, IRISA, Lagadc Team, France, marchand@rsa.fr. K. Kanan s wth Astrum, Toulouse, France dstances between keypont features detected and matched n two consecutve frames and the projecton of ther 3D postons. [16] nstead reles on optcal flow estmaton of some regularly spread pxels lyng on planar patches on the object, provdng pont correspondences between successve mages and thus pont to pont dstances to be mnmzed w.r.t. the camera dsplacement through a homography. In contrast to [21, 16], [15] proposes a texture-based error functon whch s drectly based on the dfference between ntenstes of some pxels selected on reference planar patches of the object. [12, 14] combne n the objectve functon to be optmzed, w.r.t. the camera pose, a classcal geometrcal nformaton provded by the dstances between model and mage edges wth color nformaton through object/background color separaton along the model edges. Followng deas suggested by [12, 14], and by [21, 2], whch propose hybrd methods ncorporatng edge and keypont features, we propose to ntegrate wthn a determnstc pose estmaton process the dfferent consdered vsual features, n order to take advantage of ther complementarty and to overcome the lmtatons of classcal edge-based approaches. A low-level multple hypotheses edge matchng process s also embedded n our framework. Lke n our prevous works [14], the model projecton and edge generaton phase reles on the graphcs process unts (GPU) n order to handle complex 3D models, and to be reasonably tme-consumng. Snce the applcaton context of ths work manly deals wth space robotcs applcatons (space rendezvous and proxmty operatons) for whch the targeted object generally nvolves constant velocty motons, a Kalman flterng framework on the pose parameters s desgned, enablng a predcton step for the pose, provdng a fner ntalzaton, ntended to cope wth potental large nter-frame motons and to avod local mnma. II. COMBINING KEYPOINT, EDGE AND COLOR FEATURES IN A MODEL-BASED TRACKING FRAMEWORK Our problem s restrcted to model-based trackng, usng a 3D model of the target. The goal s to estmate the camera pose r by mnmzng, wth respect to r, the functon accountng for errors e (r) between a set of vsual features extracted from the mage and the forward projecton of ther 3D homologues n the mage plane: (r) = ρ(e (r)) (1) where ρ s a robust estmator, whch reduces the senstvty to outlers. Ths s a non-lnear mnmzaton problem wth

2 respect to the pose parameters r, and we follow a Gauss- Newton mnmzaton framework to handle t, by teratvely updatng the pose r: r k+1 = r k δr (2) δr = λ(dj) + De (3) where (DJ) + s the pseudo nverse of DJ, wth J the Jacoban matrx of the error vector e(r). λ s a proportonal gan and D s a weghtng matrx assocated to the Tukey robust estmator. Wth the homogeneous matrx M k+1, the new pose r k+1 can be updated usng the exponental map [9]: M k+1 = exp([δr]) M k (4) Our challenge s to ntegrate, wthn ths framework, geometrcal edge-based features wth color features along slhouette edges and geometrcal features based on Harrs corner ponts extracted n the mage, tracked through the KLT algorthm [19]. The objectve s to fuse n the crteron to be optmzed a geometrcal nformaton provded by dstances between edges, wth dstances between keyponts and wth a denser color nformaton through object/background color separaton along the slhouette model edges. The goal s to beneft from the complementarty of these features and to overcome the lmtatons of classcal sngle cue approaches. Geometrcal features based on edges or keyponts such as Harrs corners rely on lne-to-pont or pont-to-pont correspondences and on geometrcal dstances accountng for these correspondences. On one hand, edges have the advantage of beng robust to llumnaton condtons but suffer from havng smlar appearances, resultng n ambgutes between dfferent edges and potental local mnma. On the other hand, pont features can be descrbed more specfcally, mposng a better spato-temporal constrant. Though begn locally performed, the KLT algorthm allows a larger convergence radus. However, these keyponts are more senstve to llumnaton condtons, for both extracton and trackng steps. Besdes, pose errors resultng from the trackng phase at the prevous frame are ntegrated n the back-projecton process of the keyponts, leadng to potental drft problems across the sequence. Whereas for edges, the edge matchng process n the mage nstead rely on the absolute reference of the projecton of the 3D model. Wth color or ntensty edge-based feature, the dea s to avod any mage extracton or segmentaton that could lead to outlers and msmatches. By processng a dense nformaton along the slhouette of the projected 3D model by modelng the color (or lumnance) appearance on both sdes of the edges, usng smple statstcs, and optmzng ther separaton, a better accuracy can be acheved. A man advantage s a better robustness to mage or moton blur, background clutter or nose. However, among drawbacks these features need color contrast to perform effcently and are lmted by ther computatonal costs. By combnng these features, can be rewrtten as: = w g g + w c c + w p p (5) refers to the geometrcal edge-based error functon, c stands for the color-based one and p corresponds to the keypont features. w g, w c and w p are the respectve weghtng parameters. Let us note that the nvolved vsual features rely on the projecton of the 3D model. g A. Geometrcal edge features III. VISUAL FEATURES 1) Model projecton and generaton of model edge ponts: As n our prevous works [13, 14], we propose to automatcally manage the projecton of the model and to determne the vsble and promnent edges from the rendered scene, by consderng the drect use of a complete model, whch can be textured or not. By usng the graphcs process unts (GPU) and a 3D renderng engne (OpenSceneGraph here), we avod any manual pre-processng. For each acqured mage I k+1, the model s rendered wth respect to the prevous pose r k. Processng the depth map, we can obtan a set of N g 2D control ponts {x } Ng =1 whch belong to target rms, edges and vsble textures from the rendered scene. The correspondng 3D ponts X can then easly be reconstructed. 2) Error computaton and Jacoban matrx: the edgebased functon g s computed n a smlar way to [14]. From the model edge ponts we perform a 1D search along the normal of the underlyng edge of each x (r k ). A common approach s to choose on the scan lne the pxel wth the maxmum gradent as the matchng edge pont x n the new mage. The consdered approach s based on the ECM algorthm [2]. Once correspondences between the set of control ponts {x } Ng =1 and the set of mage edge ponts {x }Ng =1 are establshed, our approach consders the dstance between the projected 3D lne l (r) underlyng the projected control pont x (r) (projected from the 3D pont X ) and the selected matchng pont x n the mage. The error functon g (r) to be mnmzed wth respect to the pose r can be wrtten as: 1 N g g (r) = ρ g (e g (r)) (6) where e g (r) = σ 1 g d (l (r), x )) and d (l (r), x )) s the dstance between the pont x and the correspondng lne l (r). ρ g s a Tukey robust estmator and σ g s a normalzaton factor, the estmator of the standard devaton of the error e g. σ g 2 = 1 N g ρg (d (l (r f ), x )) wth r f the pose computed at the end of the prevous mnmzaton process. The crteron g mproves other approaches [22, 12, 4] whch consder the dstance between x (r) and x along the 2D normal vector n to the edge underlyng x (r), but neglectng the dependence of n w.r.t. to the pose r, what s takng nto n our computaton of the Jacoban matrx of e g. A key requrement s to compute the 3D equaton n the scene or object frame of the lne L such that l (r) = pr(l, r). Ths s necessary n order to compute the error e g and the correspondng Jacoban matrx J e g and the complete computaton of J e g. For more detals, see [14, 5].

3 As n [13], multple hypotheses can be consdered n the process. These hypotheses correspond to potental edges, whch are dfferent local extrema x,j of the gradent along the scan lne. And g becomes: g = 1 ρ g (σg 1 mn d (l (r), x N g j,j)) (7) where ponts x,j are the selected canddates for each 2 control pont x. For σ g, we use the estmate: σ g = 1 N g ρg (mn j d (l (r), x,j )). B. Color features The color-based functon c s elaborated to characterze the separaton between both sdes of projected model edges belongng to the slhouette, by relyng on color nformaton. c s computed the same way as n [14], and the prncple steps are brefly recalled hereafter. The goal s to compute local color statstcs (means and covarances) along the normal to the projected slhouette model edges, on both sdes. Then for each pxel along the normal, we determne a resdual representng the consstency of the pxel wth these statstcs, accordng to a fuzzy membershp rule to each sde. More formally, gven the set of N s projected slhouette model edge ponts {x (r)} Ns =1, we compute color statstcs, so to say RGB means I O and I B and covarances R O and R B, on both sde of the edge (object O and background B) usng 2D + 1 pxels along the edge normal n, up to a dstance L. These statstcs are then mxed accordng to a fuzzy membershp rule, gvng means Î,j(r) and covarances ˆR,j (r) for the pxels y,j on the normal n, wether they are on the object or background sde. Î,j(r) can be seen as a desred color value for y,j. An error e c,j (r) can then be defned as: e c,j(r) = (Î,j(r) I(y,j )) T 1 ˆR,j (Î,j(r) I(y,j ))) (8) Usng a M-estmator (Tukey) to cope wth outlers, c can be wrtten as: c = 1 ρ c ( e c N,j(r)) (9) c j wth N c = 2DN s accountng for the number of color features. For more accuracy and temporal smoothness, we propose to ntroduce temporal consstency, by ntegratng the color statstcs computed on the prevous frame P I for the slhouette edge ponts x (r k ) at the frst teraton of the mnmzaton process. Wth α a weghtng factor ( < α < 1), t gves e c,j (r) = αî,j(r) + (1 α)( P Î,j (r)) I(y,j ). For the computaton of the correspondng Jacoban matrx J e c,j, see [14]. C. Geometrcal keypont based features Another class of vsual features whch can be used are keyponts tracked across the mage sequence. As prevously suggested by [3] or by [21, 16] wthn there hybrd approaches, the dea s to desgn a texture-based objectve functon p accountng for geometrcal dstances between keyponts extracted and tracked over successve mages. But n contrast to [16], whch process 2D-2D pont correspondences to estmate the 2D transformaton from I k to I k+1 of planar local regons underlyng the ponts, we use 2D-3D correspondences to drectly mnmze p w.r.t. the pose r. More specfcally, let us denote {x } Np =1 a set of detected nterests ponts n frame I k. Assumng the pose r k has been properly estmated, we can restrct these ponts to be lyng on the projected 3D model wth respect to r k. Snce we rely on a complete 3D model, the depth of the ponts n the scene can be accurately retreved, and usng r k, we can backproject these ponts on the 3D model, gvng a set {X } Np =1 of 3D ponts of the 3D model. Ths s a major dfference wth respect to [21] whch ams at smultaneously optmzng the camera poses and projectons of the matched ponts n two successve frames, relaxng the assumpton of havng accurate prevous pose estmate and 3D model, but ncreasng computatons. Our knowledge of a complete 3D model, along wth the use of convenent renderng technques allows us the keep ths assumpton vald. As keyponts, we employ the Harrs corners detector nsde the slhouette of the projected model n the mage to extract the set {x } Np =1 n I k. Then, the KLT trackng algorthm enables to track ths set of ponts n frame I k+1, resultng n a correspondng set {x }Np =1. From the correspondences between {X } Np =1 and {x }Np =1, p can be computed as follows: p (r) = 1 N p ρ p (e p N ) (1) p wth e p = σ 1 p (x (r) x ) and x (r) = pr(x, r)). ρ p s the Tukey robust estmator assocated to these errors. σ p accounts for the standard devaton of errors e p. Smlarly to σ g, we use the estmate σ 2 p = 1 N p ρp (x (r f ) x ). The Jacoban matrx J e p s computed as follows: J e p = σ p 1 x (11) r = K σ p [ 1/Z x/z xy (1 + x 2 ) y 1/Z y/z (1 + y 2 ) xy x wth (x, y) the meter coordnates of the mage pont x (r) = pr(x, r)), and Z the depth of the correspondng 3D pont. K s the calbraton matrx of the camera. D. Combnaton of the vsual features The combnaton of the three types of features and ther respectve errors e g (r), ec,j (r) and ep (r) n the mnmzaton framework s acheved by stackng the error vectors e g, ec,j and e p nto a global error vector e and ther correspondng Jacoban matrces J e g, J e c and J e p nto a global Jacoban matrx J: e = [ λ g e gt λc e ct λp e ] pt T (12) J = [ λ g J e g T λc J e c T λp J e p T ] T ] (13) where λ g = w g /N g, λ c = w c /N c and λ p = w p /N p, e s a N g + N c + N p vector and J s a (N g + N c + N p ) 6

4 matrx. Regardng the weghtng matrx D, t s wrtten as D = blockdag(d g, D c, D p ), where D g, D c and D p are the respectve weghtng matrces assocated to the robust estmators ρ g, ρ c and ρ p. A. Pose uncertanty IV. FILTERING AND POSE PREDICTION An mportant tool to set up s the measurement of the qualty and relablty of the trackng process, based on the errors provded by the dfferent cues ntegrated n the objectve functon. For ths purpose, we can compute the covarance matrx Σ δr on the parameters of the pose error δr, whch results from the errors e, based on equaton (4). We can ndeed assume that the pose error δr follows a Gaussan dstrbuton δr N (, Σ δr ). We also assume that error e follows a Gaussan dstrbuton e N (, Σ e ), wth Σ e = blockdag(λ g I Ng N g, λ c I Nc N c, λ p I Np N p ), snce the errors are normalzed. From equaton (3) gvng the value of δr, Σ δr can be wrtten as: [ ] Σ δr = E δrδr T = E [(DJ) ] + De e T D T ((DJ) + ) T Snce the uncertanty les on e we have: Σ δr = (DJ) + DΣ e D T ((DJ) + ) T (14) We can actually determne a covarance matrx for the whole set of the vsual features or one for each type, gvng three covarance matrces, Σ g δr, Σc δr, and Σp δr. B. Kalman flterng and pose predcton Kalman flterng: n order to smooth pose estmates, we propose to ncorporate a flterng process, relyng on the Kalman flterng theory. To acheve ths, we employ an lnear Kalman flter on the parameters of the camera velocty v, whch s ntegrated to determne the pose so that: M k+1 = exp([v k+1 δt]) M k, at each tme step k. We assume a constant velocty dynamc model. Ths model s partcularly sutable n our context of space rendezvous snce constant velocty motons are generally nvolved. As the state of the system ( x k, Σ k ) we smply choose the velocty parameters, so that x k = v k s the actual system state at tme step k, wth x k = v k the a posteror estmate of x k, and Σ k the correspondng covarance matrx: x k = x k + η k and Mk = exp([η k δt])m k (15) wth η k N (, Σ k ), and M k the posteror estmate of the actual pose M k. Wth a constant velocty model, the true state at tme step k+1 s evolved from the state at k accordng to: x k+1 = x k + n k+1 (16) wth n k N (, Q k ) the state nose, and Q k = dagblock(σv, Σω) the state nose covarance matrx, wth Σv = σvi and Σω = σωi 2 3 3, σv and σω beng state nose standard devatons respectvely on the translaton and rotaton parameters of v. As an observaton z k+1, the mnmzaton process descrbed n secton II provdes us wth a pose measure M m k+1, and wth a measure of the velocty vk+1 m : vk+1 m = exp 1 ( M k M m 1 k+1 ) (17) z k+1 = vk+1 m = x k+1 + w k+1 (18) wth w k N (, R k ), wth R k the observaton nose covarance matrx. The nose w k can actually be nterpreted as equal to δr k, whch s the pose error at the end of the pose estmaton process, so that R k = Σ δr (equaton 14). The predcton step can then be acheved, gvng pror estmate of the future state and the pose: x k+1 k = x k, Σ k+1 k = Σ k + Q k+1 (19) and M k+1 k = exp( [ x k+1 k ] ) Mk (2) The update step s classcally performed, resultng n the Kalman gan K k+1 and n posteror state and pose estmates x k+1, Σ k+1 and M k+1 : K k+1 = Σ k+1 k (Σ k+1 k + R k ) 1 (21) x k+1 = x k+1 k + K k+1 (z k+1 x k+1 k ) (22) Σ k+1 = (I K k+1 )Σ k+1 k (23) M k+1 = exp( [ K k+1 (z k+1 x k+1 k ) ] ) M k+1 k (24) Pose predcton: from the estmate pose M k+1, we suggest to use t to provde a predcted pose M p k+1 whch s ntended to ntalze the pose estmaton phase for the next tme step. A natural dea s to choose the pror estmate at pred k + 1 so that M k+1 = exp([ x k+1]) M k+1. Ths predcton step s partcularly useful when large nterframe motons are observed n the mage, snce the model pred projecton wth respect to M k+1 can brng the error functon closer to ts actual mnmum, avodng local ones. V. EXPERIMENTAL RESULTS We valdate the proposed trackng method, both qualtatvely on real mages and quanttatvely on synthetc mages, and ts benefts are verfed. Let us frst classfy the dfferent contrbutons proposed n ths paper: Effcent model projecton and model edge control pont generaton, and pose estmaton based on geometrcal edge features: C. Integraton of a multple-hypothess framework n the edge regstraton process: C1. Integraton of the color-based vsual features: C2. Temporal consstency for the color-based objectve functon: C3. Integraton of the geometrcal keypont features: C4. Kalman flterng and pose predcton step: C5. The soluton combnng (C, C1, C2, C3) s actually very close to the one proposed n [14] except the ncorporaton of a multple-hypotheses scheme takng advantage of lne clusterng. We refer t as N M (for Nomnal Mode). We propose to evaluate the man contrbutons of ths paper ( C4 and C5) and to compare them wth () whch has proven n [14] to have superor performances wth respect to [5, 12, 13].

5 In terms of mplementaton, a standard laptop (2.8GHz Intel Core 7 CPU) has used and for all the followng tests. A. Results on synthetc mages We consder the synthetc sequence, proposed n [14], featurng a Spot satellte and whch s provded wth groundtruth on the pose. The results of the trackng of the target can be seen on Fgures 1 and 2 where the errors on the pose parameters are plotted (translaton and rotaton, represented by Euler angles). For our new solutons (N M, C4) and (, C5), and for our prevous one (), the trackng s properly performed, as depcted on the mage sequence on Fgure 1 for (N M, C4, C5). In terms of pose errors, though the mprovement s qute slght on ths sequence, the ncorporaton of keyponts enables to avod some peaks on the pose parameters errors whch are encountered by (), especally when the panels of satellte tends to flp n the mage (around frames 75, see second mage n Fgure 1) or when the target tends to get far, wth low lumnosty (frames 9-135). Due to the temporal constrant mposed by the trackng of the keyponts, these ponts can prevent from some jtter effect on the pose. By employng the Kalman flter and the pose predcton step, the pose get smoothed. The advantage of the predcton step can be enhanced by temporally down-samplng ths sequence, snce trackng can be correctly handled wth a down-samplng factor f up to f = 7 (see provded vdeo), and enables to deal wth very large nter-frame motons (up to 2 pxels). Error (m) Error (m) Error (m) ,C ,C5 Translaton / z Translaton / y Translaton / x -.5,C Error (rad.) Error (rad.) Error (rad.) ,C ,C5 Rotaton / z (Roll) Rotaton / y (Yaw) Rotaton / x (Ptch) ,C Fg. 2: Errors on the estmated camera pose over the whole sequence, (), (, C4) and (, C4, C5) wth f = 1. (a) frame 4 (b) frame 1 (c) frame 38 Fg. 1: Trackng for the Spot sequence wth the proposed method (, C4, C5) for frames 2, 75 and 144. Tracked Harrs corners wth the KLT algorthm are represented n wth blue dots. Red dots are ther reprojecton at the end of the pose estmaton process. B. Results on real mages A frst sequence shows the Soyuz TMA-3M undockng from the Internatonal Space Staton (ISS) We have also run the Nomnal Mode N M, and the proposed soluton (N M, C4). Dfferent temporal down-samplng factors have been tred out. Wth f = 1, we observe that (, C4) s able to track the target on a longer sequence than () (Fgure 3(e)). Wth f = 5, the advantage of ntroducng keyponts s obvous snce trackng for (, C4) s not affected by the down-samplng (Fgures 3(a)- 3(d)), n contrast to (N M) whch rapdly fals (Fgures 3(f)). The ablty of keyponts of beng properly tracked wth large nter-frame motons (up to 25 pxels) s here stressed out. The uncertanty of the pose for both methods s represented on Fgure 4 by the global covarance matrx Σ δr, showng, for f = 5, larger uncertanty when both solutons tends to fal (around frame 2 for and around frame 42 for (, C4)). (d) frame 42 (e) frame 167 (f) frame 4 Fg. 3: Trackng for the Soyuz sequence usng (, C4) wth f = 5 (a-d), usng wth f = 1 (e) and f = 5 (f). The second sequence features a fgurne of Maro, whch s 35cm hgh, and made of curved and complex shapes. The 3D model was obtaned usng a Knect sensor and the ReconstructMe software. Despte rough modelzaton of some parts, ths model, whch s made of 15 vertces, for a 5.5MB sze, has been drectly used n our trackng algorthm, showng the convenence of the proposed method and the effcency of the model projecton system. Wth (), trackng gets quckly lost (Fgure 5(f)) due to the large nter-frame moton, where (N M, C4) acheves t successfully throughout the sequence, even n the case of very large motons n the mage (up to 4 pxels) and mportant moton blur (see Fgure 5(a) and provded vdeo).

6 Standard devaton (m) Translaton v Standard devaton (rad.) Rotaton ω Standard devaton (m) Translaton v Edge covarance Color covarance Pont covarance Global covarance Standard devaton (rad.) Rotaton ω Edge covarance Color covarance Pont covarance Global covarance Fg. 4: Covarances on the pose dsplacement for () and (, C4). Square root of traces on translaton and rotaton parameters of Σ δr are represented. The uncertanty of the pose for both methods s also represented (Fgure 6), for the dfferent vsual features, wth Σ g δr, Σc δr, and Σp δr, and for the whole set wth Σ δr. We can observe that the effectve fal of the trackng for around frame 5 does not have much effect on the global covarance, however, the covarances generated by the keyponts and the geometrcal edge features take much larger values. Let us fnally note that the proposed algorthm (, C4, C5) runs at around 8 fps n the presented cases. (a) frame 14 (b) frame 25 (c) frame 25 (d) frame 26 (e) frame 495 (f) frame 15 () Fg. 5: Trackng for the Maro sequence wth (, C4) (a-e) and (f). VI. CONCLUSION In ths paper we have presented a robust and hybrd approach of 3D vsual model-based object trackng.our approach has been tested va varous experments, on both synthetc and real mages, n whch the ntegraton of keyponts has proven to be partcularly effcent n the case of hghly dynamc scenes wth large nter-frame motons. Our method has also shown to be promsng n terms of robustness wth respect to llumnaton condtons, moton blur and nose, outperformng state-of-the-art approaches, for nstance n the case of space rendezvous. REFERENCES [1] G. Bleser, Y. Pastarmov, and D. Strcker. Real-tme 3d camera trackng for ndustral augmented realty applcatons. Journal of WSCG, pp , 25. [2] P. Bouthemy. A maxmum lkelhood framework for determnng movng edges. IEEE T. on PAMI, 11(5): , May [3] T. Brox et al. Hgh accuracy optcal flow serves 3-D pose trackng: explotng contour and flow based constrants. In ECCV 6, pp , Graz, May 26. [4] C. Cho and H. I. Chrstensen. Robust 3d vsual trackng usng partcle flterng on the specal eucldean group: A combned approach of keypont and edge features. IJRR, 31(4): , Aprl 212. Standard devaton (m) Translaton v Edge covarance Color covarance Pont covarance Global covarance Standard devaton (rad.) Rotaton ω Edge covarance Color covarance Pont covarance Global covarance Fg. 6: Covarances on the pose dsplacement for ()(top) and (, C4)(bottom). Sqare root of traces on translaton and rotaton parameters of Σ g δr (Edge), Σc δr (Color), Σ p δr (Pont) and Σ δr (Global) are represented. [5] A.I. Comport, E. Marchand, M. Pressgout, and F. Chaumette. Realtme markerless trackng for augmented realty: the vrtual vsual servong framework. IEEE T-VCG, 12(4): , July 26. [6] T. Drummond and R. Cpolla. Real-tme vsual trackng of complex structures. IEEE PAMI, 24(7): , July 22. [7] M. Haag and H.H. Nagel. Combnaton of edge element and optcal flow estmates for 3D-model-based vehcle trackng n traffc mage sequences. IJCV, 35(3): , December [8] V. Kyrk and D. Kragc. Integraton of model-based and model-free cues for vsual object trackng n 3D. In IEEE ICRA 5, pp , Barcelona, 25. [9] Y. Ma, S. Soatto, J. Košecká, and S. Sastry. An nvtaton to 3-D vson. Sprnger, 24. [1] E. Marchand, P. Bouthemy, F. Chaumette, and V. Moreau. Robust real-tme vsual trackng usng a 2D-3D model-based approach. In IEEE ICCV 99, pp , Kerkra, [11] G. Pann, Al. Ladkos, and A. Knoll. An effcent and robust real-tme contour trackng system. In ICVS, pp , 26. [12] G. Pann, E. Roth, and A. Knoll. Robust contour-based object trackng ntegratng color and edge lkelhoods. In Proc. of VMV 28, pp , Konstanz, 28. [13] A. Pett, E. Marchand, and K. Kanan. Trackng complex targets for space rendezvous and debrs removal applcatons. In IEEE/RSJ IROS 12, pp , Vlamoura, 212. [14] A. Pett, E. Marchand, and K. Kanan. A robust model-based tracker for space applcatons: combnng edge and color nformaton. In IEEE/RSJ IROS 213, Tokyo, 213. [15] M. Pressgout and E. Marchand. Real-Tme Hybrd Trackng usng Edge and Texture Informaton IJRR, 26(7): , 27. [16] M. Pressgout, E. Marchand, and E. Mémn. Hybrd trackng approach usng optcal flow and pose estmaton. In IEEE ICIP 8, pp , San Dego 28. [17] V. Prsacaru and I. Red. Pwp3d: Real-tme segmentaton and trackng of 3d objects. In Brtsh Machne Vson Conf., September 29. [18] E. Rosten and T. Drummond. Fusng ponts and lnes for hgh performance trackng. In IEEE ICCV, pp , Bejng, 25. [19] J. Sh and C. Tomas. Good features to track. In IEEE CVPR, pp , Seattle, [2] M. Tamaazoust et al. Nonlnear refnement of structure from moton reconstructon by takng advantage of a partal knowledge of the envronment. In IEEE CVPR, pp , 211. [21] L. Vacchett, V. Lepett, and P. Fua. Combnng edge and texture nformaton for real-tme accurate 3d camera trackng. In ACM/IEEE ISMAR 24, pp , Arlngton, 24. [22] H. Wuest and D. Strcker. Trackng of ndustral objects by usng cad models. Journal of Vrtual Realty and Broadcastng, 4(1), 27.

A robust model-based tracker combining geometrical and color edge information

A robust model-based tracker combining geometrical and color edge information 213 IEEE/RSJ Internatonal Conference on Intellgent Robots and Systems (IROS) November 3-7, 213. Tokyo, Japan A robust model-based tracker combnng geometrcal and color edge nformaton Antone Pett, Erc Marchand,

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

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

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

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

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

METRIC ALIGNMENT OF LASER RANGE SCANS AND CALIBRATED IMAGES USING LINEAR STRUCTURES

METRIC ALIGNMENT OF LASER RANGE SCANS AND CALIBRATED IMAGES USING LINEAR STRUCTURES METRIC ALIGNMENT OF LASER RANGE SCANS AND CALIBRATED IMAGES USING LINEAR STRUCTURES Lorenzo Sorg CIRA the Italan Aerospace Research Centre Computer Vson and Vrtual Realty Lab. Outlne Work goal Work motvaton

More information

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

Ecient 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 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

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

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

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy 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 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

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

Hermite Splines in Lie Groups as Products of Geodesics

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

ViSP: A Software Environment for Eye-in-Hand Visual Servoing

ViSP: A Software Environment for Eye-in-Hand Visual Servoing VSP: A Software Envronment for Eye-n-Hand Vsual Servong Érc Marchand IRISA - INRIA Rennes Campus de Beauleu, F-3542 Rennes Cedex Emal: Erc.Marchand@rsa.fr Abstract In ths paper, we descrbe a modular software

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

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

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

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

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

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

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

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Face Tracking Using Motion-Guided Dynamic Template Matching

Face Tracking Using Motion-Guided Dynamic Template Matching ACCV2002: The 5th Asan Conference on Computer Vson, 23--25 January 2002, Melbourne, Australa. Face Trackng Usng Moton-Guded Dynamc Template Matchng Lang Wang, Tenu Tan, Wemng Hu atonal Laboratory of Pattern

More information

3D model-based tracking for UAV indoor localisation

3D model-based tracking for UAV indoor localisation 3D model-based tracng for UAV ndoor localsaton Célne Teulère, Erc Marchand, Laurent Ec Abstract Ths paper proposes a novel model-based tracng approach for 3D localsaton. One man dffculty of standard model-based

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

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

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution

Real-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,

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

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

Realtime Moving Object Detection from a Freely Moving Monocular Camera

Realtime Moving Object Detection from a Freely Moving Monocular Camera Realtme Movng Object Detecton from a Freely Movng Monocular Camera Abhjt Kundu, C. V. Jawahar and K Madhava Krshna Abstract Detecton of movng objects s a key component n moble robotc percepton and understandng

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

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

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

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

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

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

Simultaneous Object Pose and Velocity Computation Using a Single View from a Rolling Shutter Camera

Simultaneous Object Pose and Velocity Computation Using a Single View from a Rolling Shutter Camera Smultaneous Object Pose and Velocty Computaton Usng a Sngle Vew from a Rollng Shutter Camera Omar At-Ader, Ncolas Andreff, Jean Marc Lavest, and Phlppe Martnet Unversté Blase Pascal Clermont Ferrand, LASMEA

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

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

Active Contours/Snakes

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

Active 3D scene segmentation and detection of unknown objects

Active 3D scene segmentation and detection of unknown objects Actve 3D scene segmentaton and detecton of unknown objects Mårten Björkman and Danca Kragc Abstract We present an actve vson system for segmentaton of vsual scenes based on ntegraton of several cues. The

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

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

Visual Servoing of Presenters in Augmented Virtual Reality TV Studios

Visual Servoing of Presenters in Augmented Virtual Reality TV Studios The 2010 IEEE/RSJ Internatonal Conference on Intellgent Robots and Systems October 18-22, 2010, Tape, Tawan Vsual Servong of Presenters n Augmented Vrtual Realty TV Studos Suraj Nar, Thorsten Röder, Gorgo

More information

Real-time 3D Camera Tracking for Industrial Augmented Reality Applications

Real-time 3D Camera Tracking for Industrial Augmented Reality Applications Real-tme 3D Camera Trackng for Industral Augmented Realty Applcatons Gabrele Bleser Yulan Pastarmov Dder Strcker Koblenz-Landau Unversty Unverstätsstraße 1 56070 Koblenz, Germany Fraunhofer IGD Fraunhoferstraße

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

Feature-Area Optimization: A Novel SAR Image Registration Method

Feature-Area Optimization: A Novel SAR Image Registration Method Feature-Area Optmzaton: A Novel SAR Image Regstraton Method Fuqang Lu, Fukun B, Lang Chen, Hao Sh and We Lu Abstract Ths letter proposes a synthetc aperture radar (SAR) mage regstraton method named Feature-Area

More information

New dynamic zoom calibration technique for a stereo-vision based multi-view 3D modeling system

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

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Video Object Tracking Based On Extended Active Shape Models With Color Information

Video Object Tracking Based On Extended Active Shape Models With Color Information CGIV'2002: he Frst Frst European Conference Colour on Colour n Graphcs, Imagng, and Vson Vdeo Object rackng Based On Extended Actve Shape Models Wth Color Informaton A. Koschan, S.K. Kang, J.K. Pak, B.

More information

Delayed Features Initialization for Inverse Depth Monocular SLAM

Delayed Features Initialization for Inverse Depth Monocular SLAM Delayed Features Intalzaton for Inverse Depth Monocular SLAM Rodrgo Mungua and Anton Grau Department of Automatc Control, Techncal Unversty of Catalona, UPC c/ Pau Gargallo, 5 E-0808 Barcelona, Span, {rodrgo.mungua;anton.grau}@upc.edu

More information

Tracking by Cluster Analysis of Feature Points and Multiple Particle Filters 1

Tracking by Cluster Analysis of Feature Points and Multiple Particle Filters 1 Tracng by Cluster Analyss of Feature Ponts and Multple Partcle Flters 1 We Du, Justus Pater Unversty of Lège, Department of Electrcal Engneerng and Computer Scence, Insttut Montefore, B28, Sart Tlman Campus,

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

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

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

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

Distance Calculation from Single Optical Image

Distance Calculation from Single Optical Image 17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*

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

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

Vanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay, Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery

More information

Fitting and Alignment

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

Smoothing Spline ANOVA for variable screening

Smoothing 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 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

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

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

Robust Inlier Feature Tracking Method for Multiple Pedestrian Tracking

Robust Inlier Feature Tracking Method for Multiple Pedestrian Tracking 2011 Internatonal Conference on Informaton and Intellgent Computng IPCSIT vol.18 (2011) (2011) IACSIT Press, Sngapore Robust Inler Feature Trackng Method for Multple Pedestran Trackng Young-Chul Lm a*

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of

More information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

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

Large Motion Estimation for Omnidirectional Vision

Large Motion Estimation for Omnidirectional Vision Large Moton Estmaton for Omndrectonal Vson Jong Weon Lee, Suya You, and Ulrch Neumann Computer Scence Department Integrated Meda Systems Center Unversty of Southern Calforna Los Angeles, CA 98978, USA

More information

3D Rigid Facial Motion Estimation from Disparity Maps

3D Rigid Facial Motion Estimation from Disparity Maps 3D Rgd Facal Moton Estmaton from Dsparty Maps N. Pérez de la Blanca 1, J.M. Fuertes 2, and M. Lucena 2 1 Department of Computer Scence and Artfcal Intellgence ETSII. Unversty of Granada, 1871 Granada,

More information

A Particle Filter without Dynamics for Robust 3D Face Tracking

A Particle Filter without Dynamics for Robust 3D Face Tracking A Partcle Flter wthout Dynamcs for Robust 3D Face Trackng Le Lu ang-tan Da Gregory Hager Computatonal Interacton and Robotcs Lab, Computer Scence Department the Johns Hopkns Unversty, Baltmore, MD 21218,

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Elsevier Editorial(tm) for Image and Vision Computing Manuscript Draft

Elsevier Editorial(tm) for Image and Vision Computing Manuscript Draft Elsever Edtoral(tm) for Image and Vson Computng Manuscrpt Draft Manuscrpt Number: Ttle: FPIV'4:Effcent Partcle Flterng Usng RANSAC wth Applcaton to 3D Face Trackng Artcle Type: Specal Issue Paper Keywords:

More information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

GIVEN measurements in 2D images, the goal of geometric

GIVEN measurements in 2D images, the goal of geometric 1834 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 29, NO. 10, OCTOBER 2007 Quasconvex Optmzaton for Robust Geometrc Reconstructon Qfa Ke, Member, IEEE, and Takeo Kanade, Fellow,

More information

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval

Fuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,

More information

Online codebook modeling based background subtraction with a moving camera

Online codebook modeling based background subtraction with a moving camera Onlne codebook modelng based background subtracton wth a movng camera Lyun Gong School of Computer Scence Unversty of Lncoln, UK Emal: lgong@lncoln.ac.uk Mao Yu School of Computer Scence Unversty of Lncoln,

More information

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION

A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION A NEW FUZZY C-MEANS BASED SEGMENTATION STRATEGY. APPLICATIONS TO LIP REGION IDENTIFICATION Mhaela Gordan *, Constantne Kotropoulos **, Apostolos Georgaks **, Ioanns Ptas ** * Bass of Electroncs Department,

More information

SVO: Semi-Direct Visual Odometry for Monocular and Multi-Camera Systems

SVO: Semi-Direct Visual Odometry for Monocular and Multi-Camera Systems 1 : Sem-Drect Vsual Odometry for Monocular and Mult-Camera Systems Chrstan Forster, Zchao Zhang, Mchael Gassner, Manuel Werlberger, Davde Scaramuzza Abstract Drect methods for Vsual Odometry (VO) have

More information

IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH

IMAGE 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 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

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

Tuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques

Tuning of Fuzzy Inference Systems Through Unconstrained Optimization Techniques Tunng of Fuzzy Inference Systems Through Unconstraned Optmzaton Technques ROGERIO ANDRADE FLAUZINO, IVAN NUNES DA SILVA Department of Electrcal Engneerng State Unversty of São Paulo UNESP CP 473, CEP 733-36,

More information

An Efficient Background Updating Scheme for Real-time Traffic Monitoring

An Efficient Background Updating Scheme for Real-time Traffic Monitoring 2004 IEEE Intellgent Transportaton Systems Conference Washngton, D.C., USA, October 3-6, 2004 WeA1.3 An Effcent Background Updatng Scheme for Real-tme Traffc Montorng Suchendra M. Bhandarkar and Xngzh

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

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

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

Semi-Direct Visual Odometry for Monocular, Wide-angle, and Multi-Camera Systems

Semi-Direct Visual Odometry for Monocular, Wide-angle, and Multi-Camera Systems 1 Sem-Drect Vsual Odometry for Monocular, Wde-angle, and Mult-Camera Systems Chrstan Forster, Zchao Zhang, Mchael Gassner, Manuel Werlberger, Davde Scaramuzza Abstract Drect methods for Vsual Odometry

More information

Multiple Frame Motion Inference Using Belief Propagation

Multiple Frame Motion Inference Using Belief Propagation Multple Frame Moton Inference Usng Belef Propagaton Jang Gao Janbo Sh The Robotcs Insttute Department of Computer and Informaton Scence Carnege Mellon Unversty Unversty of Pennsylvana Pttsburgh, PA 53

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 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 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Nonlocal Mumford-Shah Model for Image Segmentation

Nonlocal Mumford-Shah Model for Image Segmentation for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:

More information

AIMS Computer vision. AIMS Computer Vision. Outline. Outline.

AIMS Computer vision. AIMS Computer Vision. Outline. Outline. AIMS Computer Vson 1 Matchng, ndexng, and search 2 Object category detecton 3 Vsual geometry 1/2: Camera models and trangulaton 4 Vsual geometry 2/2: Reconstructon from multple vews AIMS Computer vson

More information

A Scalable Projective Bundle Adjustment Algorithm using the L Norm

A Scalable Projective Bundle Adjustment Algorithm using the L Norm Sxth Indan Conference on Computer Vson, Graphcs & Image Processng A Scalable Projectve Bundle Adjustment Algorthm usng the Norm Kaushk Mtra and Rama Chellappa Dept. of Electrcal and Computer Engneerng

More information

Robust Computation and Parametrization of Multiple View. Relations. Oxford University, OX1 3PJ. Gaussian).

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

An inverse problem solution for post-processing of PIV data

An inverse problem solution for post-processing of PIV data An nverse problem soluton for post-processng of PIV data Wt Strycznewcz 1,* 1 Appled Aerodynamcs Laboratory, Insttute of Avaton, Warsaw, Poland *correspondng author: wt.strycznewcz@lot.edu.pl Abstract

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

Improved SIFT-Features Matching for Object Recognition

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