Multi-body Segmentation: Revisiting Motion Consistency Λ

Size: px
Start display at page:

Download "Multi-body Segmentation: Revisiting Motion Consistency Λ"

Transcription

1 Mult-body Segmentaton: Revstng Moton Consstency Λ Lh Zelnk-Manor Moshe Machlne Mchal Iran Dept. of Computer Scence and Appled Math The Wezmann Insttute of Scence 76 Rehovot, Israel Abstract Dynamc analyss of vdeo sequences often reles on the segmentaton of the sequence nto regons of consstent motons. Approachng ths problem requres a defnton of whch motons are regarded as consstent. Common approaches to moton segmentaton usually group together ponts or mage regons that have the same moton between successve frames (where the same moton can be 2D, 3D, or non-rgd). In ths paper we defne a new type of moton consstency, whch s based on temporal consstency of behavors across multple frames n the vdeo sequence. Our defnton of consstent temporal behavor s expressed n terms of mult-frame lnear subspace constrants. Ths defnton apples to 2D, 3D, and some non-rgd motons wthout requrng pror model selecton. We further present a mult-frame mult-body segmentaton algorthm whch apples the new moton consstency constrant drectly to mage brghtness measurements, wthout requrng pror correspondence estmaton nor feature trackng. Introducton Common approaches to moton-based segmentaton (e.g., [,, 3, 4, 6, 2, 5, 6, 7]), usually group together ponts whch have the same moton between every par of frames, where the same moton could be ether the same 2D moton, or the same 3D moton, or locally the same mage moton. For example, n [, ] the same moton s modelled by a 2D parametrc transformaton (.e., all ponts grouped together belong to a sngle 2D layer). In other cases (e.g., [3, 4]) the same moton s modelled by a fundamental matrx or a trfocal tensor (.e., all ponts grouped together share the same eppolar geometry and belong to a smple rgd 3D object). The body of work on mult-body factorzaton (e.g., [5, 6, 7, 2]) suggests employng mult-frame lnear subspace constrants to group ponts wth the same 3D rgd moton. In [6, 2], same moton s defned n terms of moton contnuty,.e., neghborng pxels belongng to the same object locally have approxmately the same mage moton. The latter can handle both rgd and non-rgd objects but cannot handle moton dscontnutes (whch occur n the presence of 3D parallax or due to a fragmented object). In all the above mentoned cases, two regons are regarded as movng consstently when they have the same moton between every par of frames. We defne a new type of moton consstency whch s based on temporal constrants: a set of ponts are grouped together as a sngle object when they have a consstent behavor over tme. Our defnton of consstent temporal behavor s expressed n terms of the mult-frame lnear subspace constrants used n [8] for flow estmaton of a sngle object. These subspace constrants allow groupng together ponts movng wth dfferent motons, as long as ther motons change over tme n the same pattern. Our approach provdes a unfed treatment of 2D motons, 3D motons and some non-rgd motons. We further propose an algorthm whch apples these new mult-body subspace constrants drectly to mage brghtness quanttes for segmentng the entre mage (every pxel) nto multple objects. Ths does not requre pror correspondence estmaton or feature trackng (as opposed to [5, 6, 7, 2] whch rely on carefully tracked sparse feature ponts). Ths work was supported by the Israel Scence Foundaton (Grant no. 53/99) and by the European Commsson (IBES Project IST-2-26).

2 . Background and Basc Defntons Let I ;:::;I F denote a sequence of F frames wth N pxels n each frame. Let (u f ;vf ) denote the dsplacement of pxel (x ;y ) n frame I f ( =;:::;N, f =;:::;F). Let and denote two F N matrces constructed from the dsplacements of all the mage ponts across all frames: u u 2 u N v v 2 vn u 2 u 2 2 u 2 N v 2 v 2 2 v 2 N = 6 7 = 6 7 () u F u F 2 u F N v F F N v F 2 vn F F N Each row n these matrces corresponds to a sngle frame, and each column corresponds h to a sngle pont. Stackng the matrces and of Eq. () vertcally results n a 2F N matrx where each column s assocated wth the dsplacements of a sngle pont across all mages/frames. Prevous work on subspace-based mult-body segmentaton/factorzaton (e.g., [5, 6, 7, 2]) decomposed the space spanned by the columns ofh nto lnearly ndependent sub-spaces. Ths was done by permutng and groupng the columns ofh nto sub-matrces of lower ranks, such that the sub-spaces assocated wth h the dfferent sub-matrces are lnearly ndependent. All columns of a sngle such sub-matrx (sub-space) of correspond to all the ponts of a sngle ndependently movng object. Such a decomposton was often obtaned (e.g., [5, 6]) by a factorzaton of the matrxh nto a h product of two matrces: = M 2F (r + +r K )S (r + +r K ) N, where M s the matrx of motons of all objects and S s a block dagonal matrx wth blocks of rank r k. Each block corresponds to the shape of a sngle object and r k s the rank of h that object (.e., the dmensons of ts correspondng sub-space). The permutaton and groupng of columns of to obtan the desred separaton nto ndependently movng objects was obtaned by seekng a block-dagonal structure of S. Whle the mult-body factorzaton approaches assumed rgd motons of objects, Brand [3] and Bregler et al. [4] showed that the moton of some non-rgd objects also resdes n low-dmensonal lnear sub-spaces. In all the above mentoned cases, the sub-space constrants were appled to the matrxh. Boult & Brown [2] and Iran [8] refer to ths matrx as the trajectory matrx because each column contans the dsplacements of a sngle pont across all frames n the sequence,.e., ts trajectory. Iran [8] further nvestgated the meanng of stackng the matrces and horzontally. Ths gves rse to an F 2N matrx [ j ], where each row contans the flow of all ponts between a sngle par of frames (typcally between a reference frame and one of the other frames), and s therefore referred to here as the flow-feld matrx (coned the dsplacement-feld matrx n [8]). Iran showed that sub-space constrants on ths matrx can be used to constran mult-frame correspondence estmaton n a covarance-weghted way [8]. Torresan et al. [5] extended ths approach to non-rgd moton estmaton. Iran and Anandan [9] further showed that the use of [ j ] gves rse to a factorzaton wth drectonal uncertanty. All these assumed that all columns of [ j ] correspond to a sngle (rgd or non-rgd) object/scene. In ths paper we explore the meanng of applyng mult-body factorzaton to the matrx [j ], and show that on one hand ths gves rse to a new nterpretaton of mult-frame moton consstency (Secton 2), and - on the other hand - t supports drect (ntensty based) covarance-weghted mult-body factorzaton wthout a need to resort to pror correspondence estmaton or pont trackng (Secton 3). 2 Revstng Moton Consstency As explaned n Secton. clusterng the columns of the trajectory matrxh (as was done by [5, 6, 7, 2]) captures the dependency between trajectores of dfferent ponts. In ths secton we nvestgate the meanng of clusterng the columns of the flow-feld matrx [ j ], and compare the two approaches. Gven two objects and the matrces ; ; 2 ; 2 of ther mult-pont mult-frame dsplacements, we examne when these objects wll be grouped together as havng consstent motons and when they wll be separated, usng 2

3 (a) (b) (c) (d) Fgure. (a)-(c) The 3 frames of a sequence showng a crcle enlargng. (d) An overlay mage of the three frames and flow vectors for some sample ponts. h subspace constrants on ether or [j ]. Let W, W 2 be ether the trajectory sub-matrces correspondng h h to the two objects fw = and W 2 2 = 2 g or ther flow-feld sub-matrces fw = [ j ] and W 2 = [ 2 j 2 ]g. Let r = rank(w ) and r 2 = rank(w 2 ). In both segmentaton approaches (.e., the exstng subspace- h based segmentaton approaches of or our segmentaton of [j ]) the two objects are grouped together or alternatvely separated nto two objects accordng to the followng (mplct) rank rule : rank([w jw 2 ]) = r + r 2 =) Two separate objects (n all algorthms). max(r ;r 2 ) < rank([w jw 2 ]) <r + r 2 =) Algorthm dependent. rank([w jw 2 ]) = max(r ;r 2 ) =) Sngle object (n all algorthms). (2) We make the followng observatons regardng the rule of Eq. (2): () Although the rank of the flow-feld matrx may be hgher than the rank of the trajectory matrx n some cases and lower n other cases [8], the decson whether two objects wll be grouped together or separated nto two objects depends solely on the relaton between the ranks of the sub-matrces of the sngle objects to the rank of the combned matrx. () It can be shown 2 that f two objects are grouped together n a trajectory based segmentaton ( h ), they wll also be grouped together n a flow-feld based segmentaton [ j ], but not vce versa! Ths has nterestng mplcatons to mult-body segmentaton. () Subspace constrants apply to varous 2D and 3D moton models [8], and some non-rgd motons [3, 4]. The decson whether to group two objects together or separate them s based only on the ranks. Ths does not requre pror selecton of a moton model or a scene geometry. The rank of a matrx s determned by the dmensonalty of the lnear space spanned by ts columns. Ths s also equal to the dmenson of the space spanned by the rows of the matrx (although these spaces are dfferent, ther dmensons are the same). To understand the physcal meanng of each of the segmentaton approaches, we analyze the dependence between columns of the trajectory matrxh, and the dependence between rows of the flow-feld matrx [ j ]. The suggested analyss offers an understandng of the nformaton content of each of these matrces and s ndependent of the specfc segmentaton algorthm used. Fgure explans the notons of lnear dependency of trajectores and lnear dependency of flow-felds of a sngle object. The three frame sequence shows a crcle whch expands from frame to frame (the radus ncreases by a between the frst and the second frames and by another b n the thrd frame). It s clear that the trajectory of the top pont (marked n blue n Fg..d) and the trajectory of the rghtmost pont (marked n red n Fg..d) are lnearly ndependent. The top pont has a trajectory vector [a; b; ; ] T whereas the rghtmost pont has a trajectory vector Ths rank rule bulds upon the observatons prevously made by Boult & Brown [2]. 2 We omt the proof due to lack of space. It wll be added to the fnal (longer) verson of ths paper. 3

4 [; ;a;b] T. The trajectory of any other pont on the crcle can be expressed as a lnear combnaton of these two trajectores. For example take the pont marked n green n Fg..d: ts trajectory vector s: cos(ff)[a; b; ; ] T sn(ff)[; ;a;b] T. Thus we can wrte: 4 5 C 2 2. The trajectory matrx therefore has h 2F N = a b a b rank 2 n ths sequence. We next examne the space spanned by the flow-felds of ths sequence. Observng the flow-felds n the frst par of frames and n the second par of frames, t can be seen that they are lnearly dependent: [u 2 ;:::;u2 N jv2 ;:::;v2 N ]= b a [u ;:::;u N jv ;:::;v N ]. A smlar relaton wll hold for any addtonal par of frames n the expandng crcle (wth dfferent coeffcents dependng on the rate of growth). Therefore, [j ] F 2N = C F [u ;:::;u N jv ;:::;v N ]. Ths mples that the flow-feld matrx [j ] has rank. In other words, for a sngle object thereh exst a set of bass trajectory vectors and a set of bass flow-felds such that the two matrces can be factored nto = B z} z} C and [j ]= z} C z} B. Traj Coeff Flow Coeff Flow bass Traj Bass (columns) In the case of multple objects, as was observed n [2], segmentng accordng to the trajectory matrxh 4 2 h (rows), wll group together all the ponts whose trajectory vectors are spanned by the same bass (.e., B = B 2, or when B and B 2 are lnearly dependent). Thus, for example, two objects movng wth the same 3D moton wll be grouped together as one. nderstandng the meanng of groupng ponts together n the flow-feld matrx s less ntutve: Although the subspace constrants are on the rows of [j ], the groupng of ponts s stll done at the level of columns (every pont has a par of columns n [j ]). When two objects are grouped together ther flow-feld vectors at correspondng frames are concatenated nto longer flow-feld vectors. Two objects wll be grouped together nto a sngle object f they have the same coeffcents n the lnear combnaton of ther ndvdual bass flow-felds (.e., C = C 2, or when C and C 2 are lnearly dependent). Note that the two objects can have completely dfferent bass flow-felds, but they wll be regarded as one as long as the way n whch ther flow-feld change over tme s the same (whch s what the coeffcents capture). Ths s what we refer to n ths paper as consstent temporal behavor. For example, ths allows groupng together ponts wth dfferent motons, as long as the patterns n whch ther motons change over tme s the same. h Examples of Segmentaton s. [ j ] Segmentaton: An llustraton of the dfference between what can be acheved wth a mult-pont trajectory-based segmentaton and a mult-frame flow-feld based segmentaton can be seen n Fgure 2. Fg. 2.a shows a jumpng-jack stck fgure. All the ponts on the left arm move together as a rgd body and have lnearly dependent trajectores (marked n dark-green arrows n Fg. 2.b). The ponts on the rght arm also move rgdly (marked n lght-green arrows n Fg. 2.b), but n a dfferent moton then that of the left arm. Hence, the trajectory matrx of the combned ponts of both arms wll have a hgher rank than any of the trajectory matrces h of each ndvdual arm. Therefore, accordng to the rank rule of Eq. (2), these wll not be grouped together n segmentaton. Smlarly, addng the ponts on the left leg (marked n dark-red arrows n h Fg. 2.b) to the trajectory matrx wll further ncrease the rank, and so wll addng the ponts on the rght leg (marked n lght-red arrows n Fg. 2.b). A segmentaton accordng to the trajectory matrx wll therefore segment the four lmbs nto four separate movng objects. Yet, the flow-feld matrx [ j ], whch contans all the ponts on all the lmbs, wll have the same rank as the flow-feld matrx of any sngle lmb. Even though the flow-felds nduced by the dfferent lmbs are dfferent, they share the same set of coeffcents n the frame-to-frame lnear dependence of flow-felds (.e., C rght arm = C left arm = C rght leg = C left leg ). Therefore, n a segmentaton based on the flow-feld matrx all the lmbs wll be grouped as a sngle object. Fgures 3 and 4 llustrate the dfference between what can be acheved by a trajectory-based segmentaton versus a flow-feld based segmentaton ths tme on real sequences. Each of the tested sequences dsplays a sngle non-rgd object consstng of a group of rgd sub-parts wth dfferent 3D motons. In these examples we tracked 4

5 (a) (b) Fgure 2. (a) Sample frames from a synthetc sequence showng a stck fgure performng jumpng-jacks. (b) Example of the trajectores of sx dfferent ponts on the fgure, one on the left leg, one on the rght leg, two on the left arm and two on the rght arm. ponts on the sub-parts and analyzed the ranks of the trajectory matrces and of the flow-feld matrces both for each separate part as well as for the unon of all parts. Fg. 3.e dsplays the resultng ranks for a vdeo sequence showng a person walkng. Ponts were tracked on three sub-parts: the forearm, the shn (lower-leg) and the head (marked n red n Fgs. 3.a-c). The rank of the trajectory matrx for all the ponts on all parts s hgher than the rank of the trajectory matrx for any of the sngle parts (see Fg. 3.e). On the other hand, the rank of the flow-feld matrx for all the ponts on all parts of ths example equals the rank of the flow-felds matrx for the sngle object wth the hghest rank (see Fg. 3.e). Ths mples that a segmentaton appled to the flow-feld matrx [j ] wll group the forearm, the shn and the head nto a sngle object n ths partcular sequence. The resultng ranks for a sequence showng a hand where ts fve fngers expand and contract smultaneously are dsplayed n Fg. 4. Ponts were tracked on each of the fngertps (marked n red n Fgs. 4.a-b). The rank of the trajectory matrx for all the tracked ponts s hgher than the rank of the trajectory matrx for a sngle fngertp (see Fg. 4.e). Alternatvely, the rank of the flow-feld matrx for all the ponts equals the rank of the flow-feld matrx for a sngle fngertp (see Fg. 4.e). Ths mples that n ths case a segmentaton accordng to the flow-feld matrx wll group all the fngers nto a sngle object. 3 Drect Intensty-Based Mult-Body Segmentaton In ths secton we present an algorthm for mult-body segmentaton of vdeo clps by applyng sub-space constrants of the flow-feld matrx [ j ] drectly to mage brghtness measurements. The segmentaton s embedded n an teratve coarse-to-fne framework and extends the work of Iran [8] nto multple movng objects. Prevous work onh subspace-based segmentaton (e.g., [2, 5, 6, 7]) used low-dmensonalty constrants on the trajectores matrx, and reled on a careful choce of a sparse set of feature ponts whch can be accurately tracked along the mage sequence. These ponts were then segmented nto groups of ponts wth the same rgd 3D moton. The algorthm that s outlned below does not requre pror trackng of ponts nor any pror optcal-flow estmaton, and segments the entre mage (pxel by pxel) nto groups characterzed by consstent behavor over tme. It apples to a wde range of motons, ncludng 2D, 3D and some non rgd motons. We frst algebracally formulate the mult-body constrants on flow-felds, and then show how to translate these constrants from flow-feld to brghtness quanttes. Mult-Body Constrants on the Flow-Feld Matrx: Iran [8, 9] showed that h the flow-feld matrx of a rgd S scene can be factored nto a multplcaton of two matrces: [j ]=[M jm ], where M S ;M contan moton nformaton and S contans shape nformaton. When the scene contans multple movng objects, ther columns are usually not sorted and are mxed n the flow-feld matrx [j ]. Let [ j ~ ~ ] be a matrx obtaned by 5

6 (a) (b) (c) Sngular values of [ ] Sngular values of [ over ] hand leg body all hand leg body all Normalzd sngular value σ k / σ Normalzd sngular value σ k / σ (d) (e) Index of sngular value (k) Index of sngular value (k) Fgure 3. (a)-(c) Sample frames from a sequence showng a person steppng forward. The tracked ponts are marked n red. (d) The trajectores of the tracked ponts dsplayed on a sample mage. (e) Graphs showng the sngular values of the trajectory matrces and of the flow-feld matrces for each object separately and for all ponts together. sortng the columns of [ j ] nto ndependent objects. Then t has the followng form: z } 2 h S 3 S M h z } ~j ~. =[ j j j K j K ]=[M jm j jm K jm K ] ; (3) h 7 5 SK S K where K s the number of objects. Note that the combned shape matrx S of the sorted matrx [ ~ j ~ ] s block dagonal, where each block corresponds to a sngle object. When only the unsorted flow-feld matrx [j ] s avalable, ts columns can be sorted and grouped nto objects (wth temporally consstent behavors) by seekng a block dagonal structure of the total shape matrx S of Eq. (3). Ths can be done usng smlar methods to those used by Gear [6] or Costera-Kanade [5]. Mult-Body Constrants on Brghtness Measurements: Flow estmaton can be hghly naccurate, especally when the scene contans multple movng objects. We next show how the mult-body segmentaton can be appled drectly to mage brghtness measurements gvng rse to a covarance-weghted segmentaton wthout requrng pror flow estmaton. Ths s acheved by frst translatng the flow-based subspace constrants of Eq. (3) nto drect brghtness-based subspace constrants, n a way smlar to that done by Iran [8] for a sngle rgd object and later by Torresan et al. [5] for a sngle non-rgd object. Lucas and Kanade [] estmated the local flow vector [u f vf ] of a pxel at frame f by solvng the equaton: " # [u f vf ] a b ]; (4) b d 6 =[g f hf S

7 h a b where b d =» P P I 2 P x P IxIy IxIy I 2 and [g f y hf ] = [ P I x I t P I y I t ] are measurable mage quanttes, n whch I x and I y are the spatal mage dervatves and I t s the temporal mage dervatve. The summaton s performed over a local wndow around pxel. When all the flow vectors across the entre mage sequence are estmated relatve to a sngle reference mage (whch under Gaussan nose assumptons can be shown to be the posteror nverse-covarance h a b frame then, b d matrx of the flow-vector [u f vf ]) s the same for pxel across all frames (.e., when [uf vf ] s the flow-vector of pxel between the reference-frame and frame f). The collecton of all ndvdual flow equatons (Eq. (4)) of all pxels across all frames can therefore be wrtten n a sngle combned matrx form (whch was referred to n [8] as the Generalzed Lucas Kanade Equaton ): Q z " } # A B [j ] F 2N =[GjH] F 2N (5) B D 2N 2N where A; B and D are dagonal N N matrces constructed from the ndvdual coeffcents a ;b and d of each pxel, and G and H are two F N matrces constructed from the ndvdual g f ;hf. Note that the matrces A; B; D and [GjH] contan only measurable mage quanttes (.e., spatal and temporal dervatves of mages). Iran [8] assumed a smple (rgd) scene. However, when the scene contans multple objects, ther columns are mxed n [GjH]. Let [ Gj ~ H] ~ be a sorted verson of [GjH] nto objects, then: 2 3 h Ak B k B k D k Q [ Gj ~ H]=[G ~ 6 jh j jg K jh K ]=[ j j j K j K ] Q K 7 5 (6) where Q k = are 2N k 2N k matrces and N k s the number of mage ponts belongng to object k. Combnng Eqs. (3) and (6) gves: ~L 2 z h } S 3 ~M z } S Q [ Gj ~ H]= ~ [M jm j jm K jm K ] h. 7 (7) 5 SK Q S K K Eq. (7) mples that the sorted matrx [ Gj ~ H] ~ can be factored nto a product of two matrces [ Gj ~ H]= ~ M ~ L, ~ where ~L s block dagonal. The number of blocks n ths representaton corresponds to the number of movng objects n the scene, and the rank of each block r k characterzes the rank of each object. Brghtness-based segmentaton: Eq. (7) mples that segmentng the entre mage (all pxels) nto ndependent objects can be done by sortng the columns of the brghtness-measurement matrx [GjH]. We obtan such a sortng by fndng the reduced row-echelon form of [GjH] usng a method smlar to that suggested by Gear 3 [6]. However, snce [GjH] s a large F 2N matrx, whch n practce has a much lower rank r, we can frst factor [GjH] nto two rank-r matrces usng SD: [GjH] = M F r L r 2N, and then fnd the reduced row-echelon form of the smaller matrx L. when M s full ranked then the matrx L has the same reduced row-echelon form as [GjH] (see [6] for more detals). Interestngly, for the purpose of segmentaton, accurate knowledge of the rank r and the block ranks r ;:::;r K s not necessary. In fact, the rank of the matrces M and L can be lower than the true rank of [GjH]. Ths s because clusterng (segmentaton) s a compettve process between the dfferent objects whch s often resolved already by a few domnant bass vectors, and may not requre the use of the entre bass. Ths s unque to the 3 The matrx [GjH ] s of sze F 2N where typcally N (the number of pxels) s very large. The segmentaton method proposed by Costera & Kanade [5] s sutable to matrces wth relatvely small dmensons whle the segmentaton method of Gear [6] s more sutable for larger matrces. 7

8 segmentaton task, and s not true for shape and moton recovery tasks, whch requre accurate knowledge of the true ranks r ;:::;r K. The measured mage quanttes a ;b ;d ;g f ;hf of Eq. (4) are obtaned from the lnearzed brghtness constancy equaton. However, ths lnearzaton s a good approxmaton only for small dsplacements (u f ;vf ). To handle larger dsplacements, we apply our segmentaton scheme wthn a mult-frame mult-scale (pyramd) data structure. Large dsplacements at hgh resoluton levels translate to small dsplacements at coarse resoluton levels. Our segmentaton scheme can therefore be appled at coarse resoluton levels, but ths wll only provde coarse segmentaton. To refne t, the process must be propagated to hgher resoluton levels. Ths s acheved by an terate-warp coarse-to-fne framework smlar to the one used n [8] for a sngle rgd scene. Snce warpng requres ntermedate flow estmaton, more accurate knowledge of the ranks r ;:::;r K s requred. These ranks are automatcally detected from the brghtness matrces [G k jh k ] for each of the segmented objects extracted n the prevous teraton. Note that ths does not requre pror model selecton (2D, 3D or non-rgd), as no 3D shape or moton nformaton s recovered (see [8] for more detals). We next summarze the algorthm. Summary of the drect mult-body segmentaton algorthm: () Construct a Gaussan pyramd for all mage frames. (2) For each teraton at each pyramd level (startng at the lowest resoluton level) do: ffl Compute matrces G, H and Q of Eq. (5) from brghtness quanttes. ffl Factorze [GjH] F 2N nto M F r L r 2N thus reducng dmensonalty and nose. ffl Fnd the reduced row echelon form of L. ffl sort the reduced row echelon form of L nto groups of columns whch correspond to the same object. Ths defnes the correct sortng of [GjH]. ffl Project [G k jh k ] (k = ;:::;K) of each object onto a low-dmensonal lnear subspace of dmenson r k to reduce nose and get [ ^G k j ^H k ]. ffl Estmate the dsplacements from the equaton: [ k j k ] Q k =[ ^G k j ^H k ] where k =:::K (see [8]). ffl Warp all frames towards the reference frame accordng to the estmated dsplacements (for all objects). (3) Iterate step 2 several tmes (typcally 4-5) n each resoluton and propagate to the next (hgher) resoluton level n the pyramd. The coarse-to-fne process s often stopped as an ntermedate resoluton level, for computatonal effcency (e.g., at a resoluton n mage wdth and heght,.e., at mage sze). The penalty for that s that the boundares 4 6 of the detected segments (objects) are not recovered accurately. 4 Results We tested our drect mult-body segmentaton algorthm on vdeo sequences wth dfferent types of nduced camera motons (2D planar / 3D), and dfferent types of object motons (rgd / non-rgd). The sequences consst of 4-8 frames each, and wth approxmate mage sze of ο The coarse-to-fne segmentaton process was stopped at a pyramd resoluton correspondng to of the mage sze. 6 The frst sequence conssts of a globe rollng on a track stuated n a 3D scene (Fgs. 5.a-d. See attached sequence globus.mpg). The object s undergong a rotaton and translaton whle the camera s translatng from rght to left, back and forth, nducng 3D parallax effects of the background scene (e.g., note the parallax between the two trpods. They occlude each other n Fg. 5.b and are both vsble n Fg.5.c). Applyng our algorthm to the scene produced a segmentaton nto two separate objects (see Fgs. 5.e-g), one whch corresponds to the globe and the second whch corresponds to the background scene. The background was grouped nto a sngle object even though no explct 3D model was assumed for the background moton. Ths s because although pxels wth dfferent depths have dfferent flows, the pattern of changes over tme n ther flows are the same (.e., they share the same coeffcents over tme n the factorzaton of the [ j ] flow-matrx). 8

9 (a) (b) Sngular values of [ ] Sngular values of [ over ] all fngers sngle fnger all fngers sngle fnger Normalzd sngular value σ k / σ Normalzd sngular value σ k / σ (c) (d) Index of sngular value (k) Index of sngular value (k) Fgure 4. (a)-(b) Sample frames from a sequence of a hand where the fngertps move smultaneously (the hand s squeezng and expandng). The tracked ponts are marked n red. (c) The trajectores of the tracked ponts marked on a sample mage. (d) Graphs showng the sngular values of the trajectory matrces and of the flow-feld matrces for each object separately and for all ponts together. The second example conssts of an outdoor scene n whch a helum balloon drfts up wth changng wnd drectons (Fgs. 6.a-c. See attached sequence baloon.mpg). The camera s agan translatng from left to rght and back causng parallax effects (e.g., the tree trunk s occluded by the woman on the bench n Fg. 6.a and s vsble n Fg.6.b). The result of applyng our algorthm (Fg. 6.d-f) detects the balloon as one object and groups the 3D background scene nto a second object. The thrd sequence shows a hand wth the fngers expandng and contractng makng a squeezng moton, and a plant wth dense leaves n the background (Fgs. 7.a-c. See attached sequence hand.mpg). Each fnger moves n an artculated moton whle the moton of all fngers s non-rgd. In addton, the camera s rotatng around the Z axs. As predcted by the analyss n Secton 2, the flow-feld based segmentaton algorthm grouped together all the fngers nto a sngle object, and all the parts whch undergo pure camera moton (ncludng the arm and the palm of the hand, whch were statonary relatve to the background) nto a second object (Fgs. 7.d-f). The fnal experment was done on a sequence showng a large pece of cloth beng folded and unfolded n a natural wavng moton, whle a branch of leaves s beng waved up and down n front of t (Fgs. 8.a-c. See attached sequence cloth.mpg). The moton of the cloth s non-rgd. The two sdes of the cloth are wavng from outsde towards the center, whle the center top part of the cloth moves vertcally (.e., the top center of the cloth s rased as the cloth s stretched n Fg. 8.a and s lowered as the cloth s folded n Fg. 8.b). However, all the parts of the cloth have consstent temporal behavor. Indeed applyng the segmentaton process of Secton 3 segmented the scene nto two objects, one whch corresponds to the leaves and the second whch corresponds to the cloth (see Fgs. 8.d-f). The textureless background regon (marked n green n Fg. 8.f) was gnored n ths example. Note that the dfferent regons of the cloth were grouped together, eventhough no non-rgd moton model was specfed. In all cases the segmentaton was based on analyss of subspace constrants of [j ] folded nto the mage brghtness measurements. The boundares of the segmentaton results n some of the examples that we have used can be consderably mproved by proceedng to hgher resoluton levels of the pyramd, and by utlzng more 9

10 sophstcated clusterng methods than the nave clusterng approach whch we mplemented. References [] S. Ayer and H. Sawhney. Layered representaton of moton vdeo usng robust maxmum-lkelhood estmaton of mxture models and mdl encodng. In Internatonal Conference on Computer son, pages , 995. [2] T.E. Boult and L.G. Brown. Factorzaton-based segmentaton of motons. In n Proc. of the IEEE Workshop on Moton nderstandng, pages 79 86, 99. [3] M. Brand. Morphable 3d models from vdeo. In IEEE Conference on Computer son and Pattern Recognton, volume II, pages , 2. [4] C. Bregler, A. Hertzmann, and H. Bermann. Recoverng non-rgd 3d shape from mage streams. In IEEE Conference on Computer son and Pattern Recognton, volume II, pages , 2. [5] J. Costera and T. Kanade. A mult-body factorzaton method for moton analyss. In Internatonal Conference on Computer son, pages 7 76, Cambrdge, MA, June 995. [6] C.W. Gear. Multbody groupng from moton mages. Internatonal Journal of Computer son, 2(29):33 5, 998. [7] N. Ichmura. A robust and effcent moton segmentaton based on orthogonal projecton matrx of shape space. In IEEE Conference on Computer son and Pattern Recognton, pages , South-Carolna, June 2. [8] M. Iran. Mult-frame correspondence estmaton usng subspace constrants. Internatonal Journal of Computer son, 22. To appear. A shorter verson appeared n ICC 99. [9] M. Iran and P. Anandan. Factorzaton wth uncertanty. In European Conference on Computer son, pages , Irland, 2. [] M. Iran, B. Rousso, and S. Peleg. Detectng and trackng multple movng objects usng temporal ntegraton. In European Conference on Computer son, pages , Santa Margarta Lgure, May 992. [] B.D. Lucas and T. Kanade. An teratve mage regstraton technque wth an applcaton to stereo vson. In Image nderstandng Workshop, pages 2 3, 98. [2] J. Sh and J. Malk. Moton segmentaton and trackng usng normalzed cuts. In Internatonal Conference on Computer son, Bombay, Inda, January 998. [3] P.H.S. Torr. Geometrc moton segmentaton and model selecton. In J. Lasenby, A. Zsserman, R. Cpolla, and H. Longuet-Hggns, edtors, Phlosophcal Transactons of the Royal Socety A, pages Roy Soc, 998. [4] P.H.S. Torr and A. Zsserman. Concernng bayesan moton segmentaton, model averagng, matchng and the trfocal tensor. In European Conference on Computer son, pages 5 527, 998. [5] L. Torresan, D.B. Yang, E.J. Alexander, and C. Bregler. Trackng and modelng non-rgd objects wth rank constrants. In IEEE Conference on Computer son and Pattern Recognton, volume I, pages 493 5, 2. [6] Y. Wess and E. H. Adelson. Perceptually organzed em: A framework for moton segmentaton that combnes nformaton about form and moton. Techncal Report TR 35, MIT, 994.

11 (a) (b) (c) (d) (e) (f) (g) Fgure 5. (a)-(d) Four sample frames of a sequence showng a globe rollng on a track whle the camera translates (see attached sequence globus.mpg). (e)-(g) Results of the drect mult-body segmentaton algorthm. (e) Shows the frst object, (f) shows the second object and (g) shows an overlay of the segmentaton result on the reference mage. (a) (b) (c) (d) (e) (f) Fgure 6. (a)-(c) Four sample frames of a sequence showng a helum balloon drftng wth the wnd whle the camera translates (see attached sequence baloon.mpg). (d)-(f) Results of the drect mult-body segmentaton algorthm. (d) Shows the frst object, (e) shows the second object and (f) shows an overlay of the segmentaton result on the reference mage.

12 (a) (b) (c) (d) (e) (f) Fgure 7. (a)-(c) Four sample frames of a sequence showng a hand wth the fngers expandng and contractng whle the camera translates and rotates (see attached sequence hand.mpg). (d)-(f) Results of the drect mult-body segmentaton algorthm. (d) Shows the frst object, (e) shows the second object and (f) shows an overlay of the segmentaton result on the reference mage. (a) (b) (c) (d) (e) (f) Fgure 8. (a)-(c) Four sample frames of a sequence showng a cloth movng non-rgdly (folded and stretched) and a branch wavng ndependently, whle the camera remans stll (see attached sequence cloth.mpg). (d)- (f) Results of the drect mult-body segmentaton algorthm. (d) Shows the frst object, (e) shows the second object and (f) shows an overlay of the segmentaton result on the reference mage. 2

An Image Fusion Approach Based on Segmentation Region

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

More information

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

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

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

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

Correspondence-free Synchronization and Reconstruction in a Non-rigid Scene

Correspondence-free Synchronization and Reconstruction in a Non-rigid Scene Correspondence-free Synchronzaton and Reconstructon n a Non-rgd Scene Lor Wolf and Assaf Zomet School of Computer Scence and Engneerng, The Hebrew Unversty, Jerusalem 91904, Israel e-mal: {lwolf,zomet}@cs.huj.ac.l

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

n 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

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

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

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

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

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

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

Alignment of Non-Overlapping Sequences

Alignment of Non-Overlapping Sequences Algnment of Non-Overlappng Sequences Yaron Casp Mchal ran Dept. of Computer Scence and Appled Math The Wezmann nsttute of Scence 76100 Rehovot, srael Ths paper shows how two mage sequences that have no

More information

Aligning Non-Overlapping Sequences,

Aligning Non-Overlapping Sequences, Internatonal Journal of Computer Vson 48(1), 39 51, 2002 c 2002 Kluwer Academc Publshers. Manufactured n The Netherlands. Algnng Non-Overlappng Sequences, YARON CASPI AND MICHAL IRANI Department of Computer

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

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

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

A Factorization Approach to Structure from Motion with Shape Priors

A Factorization Approach to Structure from Motion with Shape Priors A Factorzaton Approach to Structure from Moton wth Shape Prors Alesso Del Bue Insttute for Systems and Robotcs Insttuto Superor Técnco Av. Rovsco Pas 1 1049-001 Lsboa Portugal http://www.sr.st.utl.pt/

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

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

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

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

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

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

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

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

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

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

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

Robust Recovery of Camera Rotation from Three Frames. B. Rousso S. Avidan A. Shashua y S. Peleg z. The Hebrew University of Jerusalem

Robust Recovery of Camera Rotation from Three Frames. B. Rousso S. Avidan A. Shashua y S. Peleg z. The Hebrew University of Jerusalem Robust Recovery of Camera Rotaton from Three Frames B. Rousso S. Avdan A. Shashua y S. Peleg z Insttute of Computer Scence The Hebrew Unversty of Jerusalem 994 Jerusalem, Israel e-mal : roussocs.huj.ac.l

More information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. 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 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

Articulated Tree Structure from Motion A Matrix Factorisation Approach

Articulated Tree Structure from Motion A Matrix Factorisation Approach Artculated Tree Structure from Moton A Matrx Factorsaton Approach arl Scheffler, Konrad H Scheffler, hrstan Omln Department of omputer Scence Unversty of the estern ape 7535 ellvlle, South Afrca cscheffler,

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

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

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

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

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

A SALIENCY BASED OBJECT TRACKING METHOD

A SALIENCY BASED OBJECT TRACKING METHOD A SALIENCY BASED OBJECT TRACKING METHOD Shje Zhang and Fred Stentford Unversty College London, Adastral Park Campus, Ross Buldng Martlesham Heath, Ipswch, IP5 3RE, UK {j.zhang, f.stentford}@adastral.ucl.ac.uk

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

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Computer Vision I. Xbox Kinnect: Rectification. The Fundamental matrix. Stereo III. CSE252A Lecture 16. Example: forward motion

Computer Vision I. Xbox Kinnect: Rectification. The Fundamental matrix. Stereo III. CSE252A Lecture 16. Example: forward motion Xbox Knnect: Stereo III Depth map http://www.youtube.com/watch?v=7qrnwoo-8a CSE5A Lecture 6 Projected pattern http://www.youtube.com/watch?v=ceep7x-z4wy The Fundamental matrx Rectfcaton The eppolar constrant

More information

Joint Tracking of Features and Edges

Joint Tracking of Features and Edges Jont Trackng of Features and Edges Stanley T. Brchfeld Shrnvas J. Pundlk Electrcal and Computer Engneerng Department Clemson Unversty, Clemson, SC 29634 {stb, spundl}@clemson.edu Abstract Sparse features

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

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

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

Detecting Irregularities in Images and in Video

Detecting Irregularities in Images and in Video Detectng Irregulartes n Images and n Vdeo Oren Boman Mchal Iran Dept. of Computer Scence and Appled Math The Wezmann Insttute of Scence 76100 Rehovot, Israel Abstract We address the problem of detectng

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

Lecture 4: Principal components

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

LECTURE : MANIFOLD LEARNING

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

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

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

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

Reading. 14. Subdivision curves. Recommended:

Reading. 14. Subdivision curves. Recommended: eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton

More 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

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

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

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

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

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

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

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

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

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

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

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

Detection of Human Actions from a Single Example

Detection of Human Actions from a Single Example Detecton of Human Actons from a Sngle Example Hae Jong Seo and Peyman Mlanfar Electrcal Engneerng Department Unversty of Calforna at Santa Cruz 1156 Hgh Street, Santa Cruz, CA, 95064 {rokaf,mlanfar}@soe.ucsc.edu

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

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

A Bilinear Model for Sparse Coding

A Bilinear Model for Sparse Coding A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract

More information

Generalized Video Deblurring for Dynamic Scenes

Generalized Video Deblurring for Dynamic Scenes Generalzed Vdeo Deblurrng for Dynamc Scenes Tae Hyun Km and Kyoung Mu Lee Department of ECE, ASRI, Seoul Natonal Unversty, 151-742, Seoul, Korea {llger9, kyoungmu}@snu.ac.kr, http://cv.snu.ac.kr However,

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

we use mult-frame lnear subspace constrants to constran te D correspondence estmaton process tself, wtout recoverng any D nformaton. Furtermore, wesow

we use mult-frame lnear subspace constrants to constran te D correspondence estmaton process tself, wtout recoverng any D nformaton. Furtermore, wesow Mult-Frame Optcal Flow Estmaton Usng Subspace Constrants Mcal Iran Dept. of Computer Scence and Appled Mat Te Wezmann Insttute of Scence 100 Reovot, Israel Abstract We sow tat te set of all ow-elds n a

More information

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

More information

Parallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Long-Term Moving Object Segmentation and Tracking Using Spatio-Temporal Consistency

Long-Term Moving Object Segmentation and Tracking Using Spatio-Temporal Consistency Long-Term Movng Obect Segmentaton Trackng Usng Spato-Temporal Consstency D Zhong Shh-Fu Chang {dzhong, sfchang}@ee.columba.edu Department of Electrcal Engneerng, Columba Unversty, NY, USA Abstract The

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

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

Introduction to Multiview Rank Conditions and their Applications: A Review.

Introduction to Multiview Rank Conditions and their Applications: A Review. Introducton to Multvew Rank Condtons and ther Applcatons: A Revew Jana Košecká Y Ma Department of Computer Scence, George Mason Unversty Electrcal & Computer Engneerng Department, Unversty of Illnos at

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

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More 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

Takahiro ISHIKAWA Takahiro Ishikawa Takahiro Ishikawa Takeo KANADE

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

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

Object-Based Techniques for Image Retrieval

Object-Based Techniques for Image Retrieval 54 Zhang, Gao, & Luo Chapter VII Object-Based Technques for Image Retreval Y. J. Zhang, Tsnghua Unversty, Chna Y. Y. Gao, Tsnghua Unversty, Chna Y. Luo, Tsnghua Unversty, Chna ABSTRACT To overcome the

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

Cluster Analysis of Electrical Behavior

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

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

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

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Learning physical Models of Robots

Learning physical Models of Robots Learnng physcal Models of Robots Jochen Mück Technsche Unverstät Darmstadt jochen.mueck@googlemal.com Abstract In robotcs good physcal models are needed to provde approprate moton control for dfferent

More information

Exploiting Spatial and Spectral Image Regularities for Color Constancy

Exploiting Spatial and Spectral Image Regularities for Color Constancy Explotng Spatal and Spectral Image Regulartes for Color Constancy Barun Sngh and Wllam T. Freeman MIT Computer Scence and Artfcal Intellgence Laboratory July 2, 23 Abstract We study the problem of color

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

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

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

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

More information

An Attention Based Method For Motion Detection And Estimation

An Attention Based Method For Motion Detection And Estimation An Attenton Based Method For Moton Detecton And Estmaton Shje Zhang and Fred Stentford Department of Electronc and Electrcal Engneerng Unversty College London, Adastral Par Campus, Ross Buldng Martlesham

More information

Classifier Swarms for Human Detection in Infrared Imagery

Classifier Swarms for Human Detection in Infrared Imagery Classfer Swarms for Human Detecton n Infrared Imagery Yur Owechko, Swarup Medasan, and Narayan Srnvasa HRL Laboratores, LLC 3011 Malbu Canyon Road, Malbu, CA 90265 {owechko, smedasan, nsrnvasa}@hrl.com

More information