Towards Direct Recovery of Shape and Motion Parameters from Image Sequences
|
|
- Amice Richardson
- 5 years ago
- Views:
Transcription
1 Towards Drect Recovery of Shape and Moton arameters from Image Sequences Stephen Benot and Frank. Ferre McGll Unversty, Center for Intellgent Machnes, 4 Unversty St., Montréal, Québec, CANADA HA A7 Tel.: FAX: fbenots, ferreg@cm.mcgll.ca Abstract A novel procedure s presented to construct magedoman ters (receptve felds) that drectly recover local moton and shape parameters. These receptve felds are derved from tranng on mage deformatons that best dscrmnate between dfferent shape and moton parameters. Begnnng wth the constructon of 1-D receptve felds that detect local surface shape and moton parameters wthn cross sectons, we show how the recovered shape and moton model parameters are suffcent to produce local estmates of tme to collson. In general, ter pars (receptve felds) can be syntheszed to perform or detect specfc mage deformatons. At the heart of the method s the use of a matrx to represent mage deformaton correspondence between ndvdual pxels of two vews of a surface. The mage correspondence matrx can be decomposed usng Sngular Value Decomposton to yeld a par of correspondng receptve felds that detect mage changes due to the deformaton of nterest. 1. Introducton Recovery of structure from moton has been examned from a varety of approaches, manly feature pont extracton and correspondence[, 1] or computng dense optcal ow[14, 1]. Typcally, the Fundamental Matrx framework or a global moton model s used to solve for global moton after whch the relatve -D postons of ponts of nterest n the scene can be computed[1, 1]. Drect recovery of parameters by recognsng characterstc motons n a scene has been examned usng pont correspondences[1] and local optcal ow feld deformatons[4,, 1]. However, both methods requre the extracton of moton nformaton from the mage sequence before parameter recovery. Many of these technques requre local regularzaton; nsuffcent nformaton s avalable n each sample to reconstruct the surface shape[]. Appearance-based methods have been mostly dscarded for structure from moton because much of the shape and moton nformaton are so confounded that they cannot be recovered separately or locally[]. Soatto proved that perspectve s non-lnear, therefore no coordnate system wll lnearze perspectve effects[17]. art of the dffculty nvolves how regonal mage changes can be represented n an appearance-based framework. Most approaches nvolve solvng a local ow feld as a weghted sum of bass ow felds wth some perceptual sgnfcance[, ] or trackng specfc mage features[1] wth wavelets[7], typcally tranng on mage sequences of motons of nterest[]. Convertng these representatons nto mage doman operatons[11, 1] could allow drect recovery of sgnfcant model parameters wthout solvng a local optmzaton problem by gradent descent. Two causes prevent the effectve drect recovery of local structure from moton wth appearance-based methods. Frst s representaton: how to encode mage deformaton ndependently of mage texture and wthout the need of feature ponts. Second s how to map the mage deformatons nto some optmal mage operators. Ths paper addresses both ssues by descrbng a representaton and a methodology for desgnng and usng these optmal mage doman operators for appearance-based local recovery of some shape and moton parameters. Ths feedforward system s used to compute a dense map of tme to collson n mage sequences. The optmal operator synthess wll dscover what spatal scales most approprately descrbe the dfferent deformatons for the camera model. Instead of attemptng to recover the shape and moton parameters of a scene over all the possble parameter space, only those shapes and motons that cause dstnctly dfferent
2 mage deformatons are consdered. Even wth alasng of some parameters nto smlar appearances, enough nformaton can be extracted from the mage deformatons to recognse specfc shapes or motons whch are useful for specfc tasks such as computng tme to collson. By understandng the mage formaton process, the mappng from the shape and moton model parameters to mage deformatons (mage correspondences) can be expressed n a matrx form that precsely encodes the mage plane correspondences of a gven model nstance. In ths paper, we wll apply the theory to 1-D cases wthout loss of generalty. A pont-correspondence mappng M from a pont x n a frst space to a second space at pont y s expressed as: x ρ X! M! y ρ Y (1) y ρ Y! M 1! x ρ X () The functon M may be contnuous, dscontnuous, pecewse lnear or non-lnear, mult-valued, and n short, arbtrarly complex. But f the spaces X and Y can be dscretzed, the functon M can be expressed as a correspondence matrx mappng the ndex of a dscrete [x] to the ndex of a dscrete [y] and back. The correspondence matrx H s a representaton of such an mage deformaton or a coordnate remappng. Element H j s a non-negatve real number ndcatng the amount (probablty) of correspondence between coordnate n the frst space, [X] and coordnate j n the second space, [Y] j. H j, H j = [X] M () [Y] j A 1 M([X] ) [Y] j A + A [X] M 1 ([Y] j ) ρ [; 1] (4) A ([X] )+A [Y] j where A (N ) s a measure of area or volume n the neghborhood N, a measure of the sze of the Vorono cell of N. The correspondence matrx thus descrbed s not to be confused wth the fuzzy correspondence matrx of Ben-Ezra et al.[1] whch descrbed the correspondences at each pont p wth a matrx M(p) where each cell (; j) corresponds to a probablty that pont p has a dsplacement (; j). Note that H s a dscretzed representaton of a possbly contnuous mappng M. Both and j can represent sngle-axs (.e. 1-D) postons, but could also represent an arbtrary ndexng nto a mult-dmensonal space. To construct a correspondence matrx H, 1. Dscretze the frst mage space X nto M elements.. Dscretze the second mage space Y nto N elements.. Intalze H M N = Hj M = Hj M 1 =. 4. For each f1;:::;mg: f usng a unform dstrbuton of ponts n [X], f compute the dstrbuton of ponts [Y] j at or near M([X] ), f assgn H j j M = A M([X] ) [Y] j.. For each j f1;:::;ng: f usng a unform dstrbuton of ponts n [Y] j, f compute the dstrbuton of ponts [X] at or near M 1 ([Y] j ), f assgn H j j M 1 = A [X] M 1 ([Y] j ). Assgn H j = A([Y] j)h jjm +A([X] )H jjm 1. A([X] )+A([Y] j ) By choosng a model that may alas the appearance changes due to some parameters together but generates dstnct appearance changes for the most mportant parameters, the model parameter space can be dscretzed over the range of nterestng scene events. Only a fnte number of these correspondence matrces are requred to encode the appearance changes for changes of those most mportant parameters over all varatons for the alased parameters. The scenaro presented n Secton s the recovery of shape and moton usng a smple surface model that captures mage translaton and scale change. By samplng the model space and generatng the correspondence matrces for key shapes and motons, the recoverable parameters are enough to deduce the tme to collson from an mage sequence. The operators are tested wth synthetc and real data n Secton 4 and demonstrate the successful recovery of tme to collson for synthetc and real mage sequences. Wth mage formaton models n mnd, Secton wll derve the unfed soluton of convertng the mage formaton models nto mage doman operators, and how they are used to detect mage events of nterest.. Image Formaton Model for Local Shape and Moton Ths secton detals a model that encodes planar mage translaton, lke optcal ow, as well as depth (or scale) change. By buldng detectors for ths more evolved model, a local operator can detect both translaton and scale change to recover depth cues. Usng these detectors n the earlest vson layer should yeld superor optcal ow. Whle recoverng depth nformaton from an mage sequence can only be found up to a scale factor, the absolute tme to collson can be recovered from the same cues. To ths end, we defne the followng mage formaton model..
3 A sngle orented slt aperture for a perspectve mage formaton model can be parametrzed wth an aperture angle, ff and the number of pxels N that are vsble on the mage plane wthn that aperture. z d (or 1) V γ γ η N δ d (or δ ) Ω V h α V x Q R=1/K=d/k (or 1/k) O β Image plane N 1 N Surface Fgure 1. 1-D local aperture magng model. As shown n Fgure 1, the fxaton pont O s the pont on the surface n the center of the aperture s feld of vew,.e. vew angle =. ranges n value from ff= to ff=, wth postve to the rght (postve x drecton). For any vew angle formed between the V O and V lnes wthn ff= and ff=, there s a correspondng value for the mage plane coordnate x that can be projected nto one of the pxel coordnates between and N 1, = N 1 γ O N tan() + ff : () tan And, conversely, the mage coordnate can be mapped back to the vew angle, = tan 1» N +1 N ff tan : () Ths camera model wll be used to map surface ponts to mage coordnates to buld the correspondence matrx H wth a scene structure model, descrbed next. Two vews of a 1-D cross secton of a surface can be locally modeled usng parameters. The surface shape along one drecton can be characterzed by a curvature K, a normal vector ~ N and dstance from the vewpont, d, shownn Fgure. Dstance d scales all lengths of the dagram, so t s factored out to a canoncal representaton wth unt dstance between frst vewpont V and the fxaton pont on the surface. The surface normal vector ~ N at s encoded by the angle wth respect to the frst vew axs V. The curvature of the canoncal surface becomes k = Kd. The moton model s chosen to mnmze mage deformaton due to translaton, defnng the second vewpont V at a gven dstance ff at an angle f from the frst vew axs V. V s fxated on pont Q on the surface, a vew rotaton Ω away fromthe frst fxatonpont. Fgure. 1-D local aperture secton model. Ths 1-D cross secton shape and moton model can be algned wth multple orentatons at each poston n the mage plane to reconstruct -D surface shape and moton. Some expermental observatons[], beyond the scope of ths paper, revealed that the moton parameters Ω and ff are not separable, but can be found jontly; together they produce dstnct moton felds. These can be consdered frst order structure from moton parameters. In contrast, the vew angle change f and the shape parameters k and were observed to be confounded. Even n apertures of N = pxels, there s very lttle dfference n the moton feld to dstngush dfferent shapes from a sngle aperture. These parameters requre ether neghborhoods of support of curvature consstency between neghbors or a global soluton. Ths extra work would qualfy the parameters f;k; as second order structure from moton parameters, and wll not be recovered for the purposes of ths paper. For mage pars of nterest, the vews wll overlap n the camera aperture of angle ff (shown n Fgure 1), restrctng the useful range of Ω to about ( ff=; +ff=), and typcally, ff < 1 ff. Wth these angles so small, Ω wll be lnearly proportonal to the translaton along the mage slt axs. The parameter ff s the recprocal of mage scale change, ff = kv Ok kv Ok : (7) Recoverng Ω and ff locally n forward tme can be augmented by recoverng Ω and ff by reversng the sequence of the mages. A drect method of computng the tme to collson between two mages separated by a delay of t s: T = t ff 1 ff + 1 ff 1 : () Calculatng the tme to collson requres recoverng the ff and Ω parameters. Fgure llustrates some of the unque H for specfc nstances of model parameters (Ω;ff;k; ;f). The rows are the ndex nto the frst mage I, and the columns are the ndex nto the second mage I. Ω shfts the whte curve horzontally, and ff affects ts slope. Ths paper
4 ams to recover H gven mage par (I; I ). Secton detals the general theory for constructng mage doman operators to detect ther characterstc mage deformatons. Ω = 1: ff ff = :47 Ω = 1: ff ff = 1:1111 Ω = : ff ff = 1: Ω = 1: ff ff = 1:1111 Fgure. Correspondence matrces H Ω;ff.. Theory The mage structure from two mages separated by tme can be encoded by a correspondence matrx H. Ths secton wll show that the Sngular Value Decomposton of H leads to a unque set of mage doman operators that can code for specfc scene events as encoded by H. The correspondence matrx H relates the elements of a frst mage I and a second mage I. The mages are frst normalzed as ~ I; ~ I for a zero mean ntensty and a contrast of 1 by fndng the mage s brghtness μi and contrast I. μi, I, I + I max N ~I = I μ I μi I.1. Image Mappng H (ji μij; ji μij) μi ; ρ (; 1) ; ; ~I = I μi μi I : () Image correspondence between normalzed mages ( ~ I; ~ I ) s determned by H, but not necessarly all nformaton contaned n ~ I s present n ~ I nor vce versa. Ths means, for example, that some elements or pxels of ~ I do not come from ~ I but come nstead from some other source. The mage correspondence constrants are n the form of a weghted sum of elements n the complementary X j ψ X H j 1 A ~I = H j! ~I j = X j X H j ~I j ; f1:::ng ; H j ~I ; j f1:::ng :(1) The mage correspondence equatons can be re-wrtten: S ~ I = H ~ I ; S ~I = H T ~I : (11) S = S = 4 4 j H 1j j H j... j H Nj H 1 H... H N 7 7 (1) Equaton Set 11 deals automatcally wth non-shared nformaton: note that elements n one space that have no correspondent n the other space wll have a zero row sum of H (element of S) or zero column sum of H (element of S )... Operator Synthess Gvenanmagepar( I; ~ I ~ ), the goal s to fnd the H that best descrbes ther deformaton and dentfy that H s model parameters. In order to recognse the mage events for a gven correspondence matrx, there needs to be a transport functon to map between the two vews. The mage par ( I; ~ I ~ ) can be represented as two dfferent transforms of a common texture vector ~w. In order for the elements of texture vector ~w to be ndependent and lnear, the mage synthess functons must be: ~I ß A ~w ; ~I ß B ~w : (1) N 1 N N N 1 N 1 N N N 1 where A s orthonormal and B s also orthonormal. A and B are not expected to be exact solutons, because the mage formaton process does not lend tself to a drect lnear mappng between the mage par. Image doman deformaton caused by perspectve projectons of -D objects, for example, confounds the surface texture sgnal and the geometrc deformaton nto one mage sgnal, and the two components are generally not separable. A and B are, however, the best lnear approxmaton to the geometrc deformaton mage correspondence n the sense of mnmzng some error. The texture nformaton shared by the two mages va H must exst n the space spanned by H, and thus can be expressed compactly n r ndependent coeffcents, where r = rank(h). Thefrstr coeffcents of ~w encode the statonary sgnal shared between ~ I and ~ I that are expressed through H. The remanng N r coeffcents encode the non-shared mage sgnals mapped nto the null space of H. Because A and B are chosen to be orthonormal and square, they are nvertble (by transposton). Ths means that the texture vector ~w can be recovered from mages ( ~ I; ~ I ) knowng the correspondence matrx H. A T A ^w = A T ~I ) ^w = A T ~I (14) B T B ^w = B T ~I ) ^w = B T ~I (1)
5 .. Soluton va Sngular Value Decomposton Substtutng Equaton set 1 nto Equaton set 11, SA ~w ß HB ~w ; ~w S B ~w ß H T A ~w ; ~w : (1) The optmzaton problem to solve for A and B s thus: argmn ksa ~w HB ~wk ; argmnks B ~w H T A ~wk : (17) Because the matrces A and B are expected to work ndependently of the surface texture encoded n ~w, the optmzaton problem can be expressed as argmnksa HBk ; argmn The mnmzaton terms can be recombned as argmn ks B H T Ak : (1) ksab T Hk ; argmnks BA T H T k : (1) Ths can be vsualzed more clearly by substtutng H wth ts Sngular Value Decomposton, H N N = U N N ± N N VT N N : () where U s the matrx whose columns are the left-hand egenvectors of H and the columns of V are the rght-hand egenvectors. That s, the columns of U are the egenvectors of HH T, and the columns of V are the egenvectors of H T H, both sorted n decreasng order of egenvalues. The sngular values of H are the elements of the dagonal matrx ±, whch are the square root of the egenvalues from HH T or H T H. Substtutng the SVD, one must solve for: argmnksab T U±V T k ; argmnkab T S U±V T k : (1) The remander of ths proof bulds A and B one column at a tme, usng successvely better approxmatons of H. The k th order approxmaton, H k uses the frst k columns of U and V and the frst k dagonal elements of ±. To solve for unknown orthogonal matrces A and B, consder the 1 st order approxmaton of H, H 1 = ff 1 ~u 1 ~v T. 1 SA 1 B T 1 ß ff 1 ~u 1 ~v T 1 ; A 1 B T 1 S ß ff 1 ~u 1 ~v T 1 () The only choce for A 1 and B 1 that spans the same space as ~u 1 and ~v 1, satsfyng both constranng equatons s A 1 = h~u 1 ;~ ;:::; ~ ; B 1 = h~v 1 ;~ ;:::; ~ : () An nductve proof ntroduces hgher k th order approxmatons H k to solve for the correspondng A k and B k. Smlarly, SA k B T k SA k 1 B T k 1 ß ß kx =1 k 1 X =1 ff ~u ~v T (4) ff ~u ~v T () S(A k B T k A k 1 B T k 1 ) ß ff k~u k ~v T k : () (A k B T k A k 1 B T k 1 )S ß ff k ~u k ~v T k : (7) Ths mples that A k s A k 1 plus an orthogonal component n the drecton of ~u k and that B k s B k 1 plus an orthogonal component n the drecton of ~v k. Therefore, the k th column of A s the k th column of U and the k th column of B s the k th column of V. Therefore, the least squares error soluton for Equaton Set 1, satsfyng full rank and orthonormalty of A and B s to substtute A = U ; B = V: () Informally, the SVD expresses the correspondence matrx H as a lnear remappng U T from ~ I to the same space as a lnear remappng V T from ~ I. The SVD of H optmzes the spectral representaton of the transform between a par of data sets (mages), maxmzng the ndependence between channels (elements of ~w), ranked accordng to sgnfcance n the sense of mnmzng least squares error..4. Dstance to Data Metrc The maxmum lkelhood hypothess H for an mage par ( ~ I; ~ I ) mnmzes the resdual error ~r between the nput mages and ther reconstructons predcted by H. Determne the feature vector ^w that uses k th order approxmatons U k and V k to represent the mage vectors ~ I and ~ I. ^w = h U k T = p. V k T = p 4 ~ I ::: ~I () The feature vector ^w s now the best parameterzaton for the mage par assumng deformaton H. The resdual error can be computed by projectng the feature vector back nto the mage space. If the assumed deformaton H s suffcently close to the scene geometry, then resdual sgnal error ~r, the dfference between the orgnal mage sgnal and the reconstructed mage sgnal wll be low. ~r 4 ~ I ::: ~I 4 U k ::: V k ^w 1 A. 4 ~ I ::: ~I ()
6 The lkelhood of correspondence H gven evdence ( ~ I; ~ I ) can be expressed as a functon L Hj ~ I; ~ I. L Hj ~ I; ~ I, e k~rk ρ (; 1] (1) The uncertanty of the maxmum lkelhood choce can be expressed as the entropy h of the lkelhoods for all the dfferent hypotheses. n =1 L H j ~ I; ~ I log L H j ~ I; ~ I h = log(n) ρ (; 1] () To summarze the procedure for parametrc recovery, reparaton (off-lne) 1. Dscretze parameter space M nto n representatve parameter vectors ~m, f1;:::;ng.. Synthesze a correspondence matrx H to represent the coordnate mappng M( ~m ).. Synthesze detectors for H, usng SVD. Usage (on-lne) 1. Usng the detectors for H, gven the observatons ~ I and ~ I, compute L H j ~ I; ~ I.. Fnd the maxmum lkelhood H j ~ I; ~ I,andset the maxmum lkelhood ~m Λ = ~m.. Use the dstrbuton of L H j ~ I; ~ I to fnd the entropy h of the maxmum lkelhood choce. 4. Experments on Tme to Collson 4.1. Synthess of Operators The model space of (Ω;ff;k; ;f) was dscretzed nto 1 levels for each of Ω and ff, and levels each for k,, f and ff, bnnng the correspondence matrces nto mean correspondence matrces ndexed by (Ω;ff) for a total of 1 dstnct correspondence matrces. Applyng the procedures of Secton, 1 new receptve feld banks are syntheszed by retanng the frst 1 ter pars of each, llustrated n Fgure 4. Each row of the upper grayscale mages at tme t s a deformed snusod whch corresponds to another deformed snusod at tme t 1 = t + t, n the correspondng row n the lower grayscale mages. The frst detectors are shown. Note that the most sgnfcant optmal detectors for ths moton model are wndowed snusods concentrated n the lower spatal frequences. The SVD t # t + t Ω = 1: ff ff = :47 Ω = 1: ff ff = 1:1111 Ω = : ff ff = 1: Ω = 1: ff ff = 1:1111 Fgure 4. U, V of correspondence matrces. automatcally dscovered the approprate spatal scales for detectng each deformaton. The parameters used are: Number of pxels: N 4 Vew translaton : Ω[] :4 ff Dstance to surface: ff[] 1:4 (, f; ::; 1g ), f; ::; 1g Surface normal : [] f 4 ff ; : ff ;:::;4 ff g Vew change : f[] f 1 ff ; ff ; ff ; ff ; 1 ff g Surface curvature: k[] f 4; ; ; ; 4g Vew aperture : ff[] f ff ; : ff ; ff ; : ff ; 1 ff g These experments were performed usng slts of length N = 4 wth wdths of pxels. The ter banks are appled to a grddng of the mage par at dfferent orentatons ( ff ; ff ; ff ; ff ; 1 ff ; 1 ff ). The same procedure s appled by swappng the two mages to recover the maxmum lkelhood for the tme reversal, (Ω ;ff ; ). Ω and Ω are useful for optcal ow, but the local depth (or tme to collson) cues are only avalable through the ff and ff measures. Ω and ff are found jontly, and the usefulness of ff s senstve to the correct compensaton of Ω. Some neghborhood terng s requred, snce ff s nosy. The maxmum lkelhood values for Ω;ff; Ω ;ff n the grd of elements are medan tered n a neghborhood for Ω; Ω,anda7 7 neghborhood for ff;ff. 4.. Synthetc Images, 4 Boxes To test the Tme to Collson detectors, a random dot texture was combned wth synthetc range data shown n Fgure to generate the synthetc mage par shown n Fgure. The surface conssted of 4 quadrants of varyng dstance (4,, and mm from the camera focal pont), and the camera moves by mm towards the center of the scene. The ground truth tme to collson for the four quadrants are thus,, 1 and 11 unts of tme n the future. The camera geometry s modeled as a pnhole perspectve camera wth 4 square pxels where pxels are mapped onto a vewng angle of 4:1 ff.thsmeansthat the mage samples of 4 pxels wll cover aperture angles ff varyng from 1 ff at the center to ff at the perphery.
7 The recovered Ω; Ω data s almost perfectly planar for each orentaton, as shown n Fgure 7. Ths s expected, as the scene moton generates a radal ow feld. Ω s proportonal to the mage plane velocty, wth lnearly ncreasng magntude as t moves further from the focus of expanson. Note that the Ω parameter s sgned and drectonal. The local structure from moton problem s at ts worst n mage sequences wth a forward-movng camera. Optcal ow methods have no nformaton at or near the focus of expanson, and small errors n the ow feld even toward the perphery render depth recovery mpractcal wthout fttng a global model to the optcal ow feld. Wth ths experment, the tme to collson detectors are desgned specfcally to work best at or near the focus of expanson. Tme to collson, 4 boxes from to 11, Ground Truth Tme to collson, 4 boxes from to 11, Recovered Fgure. Synthetc texture and range. Black s 4mm from focal pont, whte s mm. 7 7 Tme to collson, 4 boxes from to 11, Ground Truth Tme to collson, 4 boxes from to 11, Recovered Ω Fgure. Synthetc mage par. The camera moves mm toward the center of the scene. ff ff ff ff 1 ff 1 ff Ω ff Fgure 7. Recovered Ω and Ω for orentatons at mage locatons (black: :4 ff, gray: ff,whte:+:4 ff ). ff ff ff ff 1 ff 1 ff ff Fgure. Recovered ff and ff for orentatons at mage locatons (black: :1, gray: 1:, whte:1:4. Snce Ω; Ω have been cleanly recovered, t s not surprsng that the more senstve ff;ff have formed blobs roughly n the four quadrants of the scene, shown n Fgure. Fgure. Tme to Collson, ground truth versus recovered. After observng the mages of Fgure separated by mm and one unt of tme, the receptve felds are able to detect the separate, yet tghtly clustered, collson events that are,, 1 and 11 unts of tme n the future. Wth ths n mnd, the resultng tme to collson results are reasonably close to the ground truth, shown sde by sde n Fgure. 4.. Natural mages, Calbraton Grd The experment was repeated usng grayscale mages captured by a camera mounted on a gantry robot lookng at a at planar calbraton grd. The camera feld of vew s the same as the earler synthetc example, but t s not an dealzed pnhole camera. The camera lens starts at mm from the plane, and moves mm closer, for a tme to collson of unts of tme, show n Fgure 1. The camera optcs slghtly bend the grd lnes; the small squares toward the perphery are a bt smaller than the squares near the center. Ths sphercal aberraton makes the grd appear as a textured sphere shown close up, drectly n front of the camera. The camera s focal length s 7mm, placng the focal pont about 1mm behnd the lens from whch camera dstance was measured. The detector response n Fgure 11 s so senstve that the recovered tme to collson captures the sphercal aberraton effect. The tme to collson vares from 11 unts of tme at the center to unts of tme at the perphery. The aberraton
8 Fgure 1. lanar calbraton grd scene. Tme to collson, at grd, Recovered Tme to collson, at grd, Recovered Fgure 11. Tme to collson, planar grd. makes the perphery appear further than t actually s, movng faster than the center, hence a lower tme to collson. In ths case, optcal ow n the perphery s unnformatve; there appears to be no translaton, but there s texture expanson. Ths expermental result confrms that the local feed-forward operators can extract precse estmates of the real tme to collson wthout a global scene moton model.. Concluson The drect recovery of some shape and moton parameters from mage sequences s now possble wth magedoman appearance, wthout a need for a global moton soluton. By populatng a synthetc retna wth specalzed receptve felds, the vson system can estmate tme to collson wth the obstacles n the scene. A new framework for operator synthess was ntroduced that constructed scene shape and moton detectors from scene moton models n a prncpled way, automatcally dscoverng approprate spatal scales. Ths technque can be appled to many domans, automatcally fndng optmal mage-doman transfer functons between two mages or two spaces. Image events characterzed by H lead drectly to synthetc local feed-forward operators, and naturally produce uncertanty measures or confdence ntervals on the recovered model parameters. relmnary results ndcate that these purely local feedforward operators perform reasonably accurate recovery of scene structure wthout the need to regularze. References [1] J. Barron and R. Eagleson. Moton and structure from tmevaryng optcal ow. In Vson Interface, pages , 1 1 May 1. [] S. Benot. Towards Drect Moton and Shape arameter Recovery from Image Sequences. hd thess, McGll Unversty,. [] D. DFranco and S. Kang. Is appearance-based structure from moton vable? In nd Int. Conference on -D Dgtal Imagng and Modelng, Ottawa, Canada, Oct. 1. [4] S. Fejes and L. Davs. Drecton-selectve ters for egomoton estmaton. Techncal Report CS-TR-14,CAR-TR-, Unversty of Maryland at College ark, 17. [] S. Fejes and L. Davs. Explorng vsual moton usng projectons of moton felds. In roceedngs of the ARA Image Understandng Workshop, pages 11 1, May 17. [] S. Fejes and L. Davs. What can projectons of ow felds tell us about the vsual moton. In ICCV, 1. [7] G. D. Hager and. N. Belhumeur. Effcent regon trackng wth parametrc models of geometry and llumnaton. IEEE AMI, (1):1 1, 1. [] J. Heel. Drect estmaton of structure and moton from multple frames. Techncal Report AI Memo 11, MIT AI Lab, March 1. [] B. Krse, N. Vlasss, R. Bunschoten, and Y. Motomura. Feature selecton for appearance-based robot localzaton. In roceedngs RWC Symposum,. [1] M. W. M. Ben-Ezra, S. eleg. Real-tme moton analyss wth lnear-programmng. In roc. ICCV, volume, page 7, Corfu, Greece, September 1. [11] R. Manmatha. Measurng the affne transform usng gaussan ters. In roc. of the ECCV (), pages 1 14, 14. [1] C. Nastar, B. Moghaddam, and A. entland. Generalzed mage matchng: Statstcal learnng of physcally-based deformatons. In roc. of the Fourth European Conference on Computer Vson (ECCV, Cambrdge, UK, Aprl 1. [1] J. Olenss. Drect mult frame structure from moton for hand held cameras. In ICR Vol. I, pages,. [14] S. Roy and I. J. Cox. Moton wthout structure. In 1th Int. Conference on attern Recognton, Vol. I, pages 7 74, Venna, Austra, August 1. IEEE. [1] S. Soatto. Observablty/dentfablty of rgd moton under perspectve projecton. Techncal Report CIT-CDS 4-1, Calforna Insttute of Technology, Jan 14. [1] S. Soatto and. erona. Dynamc vsual moton estmaton from subspace constrants. Techncal Report CIT-CDS 4-, Calforna Inst. of Tech., asadena, CA, Jan. 14. [17] S. Soatto and. erona. On the exact lnearzaton of structure from moton. Techncal Report CIT-CDS 4-11, Calforna Insttute of Technology, asadena, CA, May 14. [1] G.. Sten and A. Shashua. Drect methods for estmaton of structure and moton from three vews. Techncal Report AIM-14, MIT AI Lab, Nov. 1. [1] C. Stller and J. Konrad. Egentransforms for regon-based mage processng. In roc. Int. Conf. on Consumer Electroncs, pages 7, Chcago, IL, USA, June 1. [] C.-K. Tang and G. G. Medon. Robust estmaton of curvature nformaton from nosy d data for shape descrpton. In roceedngs of the ICCV (1), pages 4 4, 1. [1] C. Tomas. Input redundancy and output observablty n the analyss of vsual moton. In roc. Sxth Symposum on Robotcs Research, pages 1. MIT ress, 1. [] Y. Yacoob and L. S. Davs. Learned models for estmaton of rgd and artculated human moton from statonary or movng camera. IJCV, (1):,.
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 informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationImage 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 informationLECTURE : 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 informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationMULTISPECTRAL 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 informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationLearning 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 informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationWhat are the camera parameters? Where are the light sources? What is the mapping from radiance to pixel color? Want to solve for 3D geometry
Today: Calbraton What are the camera parameters? Where are the lght sources? What s the mappng from radance to pel color? Why Calbrate? Want to solve for D geometry Alternatve approach Solve for D shape
More informationProf. Feng Liu. Spring /24/2017
Prof. Feng Lu Sprng 2017 ttp://www.cs.pd.edu/~flu/courses/cs510/ 05/24/2017 Last me Compostng and Mattng 2 oday Vdeo Stablzaton Vdeo stablzaton ppelne 3 Orson Welles, ouc of Evl, 1958 4 Images courtesy
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationA 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 information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationCalibrating a single camera. Odilon Redon, Cyclops, 1914
Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationElectrical 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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationFitting and Alignment
Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)
More informationFitting: 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 informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationA 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 informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationHigh-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 informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationInverse-Polar Ray Projection for Recovering Projective Transformations
nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced
More informationAnalysis 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 informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationLecture 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 informationResolving 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 informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationComputer 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 informationUser 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 informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationA 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 informationHigh resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices
Hgh resoluton 3D Tau-p transform by matchng pursut Wepng Cao* and Warren S. Ross, Shearwater GeoServces Summary The 3D Tau-p transform s of vtal sgnfcance for processng sesmc data acqured wth modern wde
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationCollaboratively 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 informationLine-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 informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationDetection of hand grasping an object from complex background based on machine learning co-occurrence of local image feature
Detecton of hand graspng an object from complex background based on machne learnng co-occurrence of local mage feature Shnya Moroka, Yasuhro Hramoto, Nobutaka Shmada, Tadash Matsuo, Yoshak Shra Rtsumekan
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationModel-Based Bundle Adjustment to Face Modeling
Model-Based Bundle Adjustment to Face Modelng Oscar K. Au Ivor W. sang Shrley Y. Wong oscarau@cs.ust.hk vor@cs.ust.hk shrleyw@cs.ust.hk he Hong Kong Unversty of Scence and echnology Realstc facal synthess
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationLecture 9 Fitting and Matching
In ths lecture, we re gong to talk about a number of problems related to fttng and matchng. We wll formulate these problems formally and our dscusson wll nvolve Least Squares methods, RANSAC and Hough
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationWishing 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 informationCorrespondence-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 informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15
CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc
More informationVanishing 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 informationA Workflow for Spatial Uncertainty Quantification using Distances and Kernels
A Workflow for Spatal Uncertanty Quantfcaton usng Dstances and Kernels Célne Schedt and Jef Caers Stanford Center for Reservor Forecastng Stanford Unversty Abstract Assessng uncertanty n reservor performance
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More information