Gaze Manipulation for One-to-one Teleconferencing

Size: px
Start display at page:

Download "Gaze Manipulation for One-to-one Teleconferencing"

Transcription

1 Gze Mnipultion for One-to-one Teleconferencing A. Criminisi, J. Shotton, A. Blke, P.H.S. Torr Microsoft Reserch Ltd, Cmridge, UK Astrct A new lgorithm is proposed for novel view genertion in one-toone teleconferencing pplictions. Given the video strems cquired y two s plced on either side of computer monitor, the proposed lgorithm synthesises imges from virtul in ritrry position (typiclly locted within the monitor) to fcilitte eye contct. Our technique is sed on n improved, dynmicprogrmming, stereo lgorithm for efficient novel-view genertion. The two min contriutions of this pper re: i) new type of three-plne grph for dense-stereo dynmic-progrmming, tht encourges correct occlusion leling; ii) compct geometric derivtion for novel-view synthesis y direct projection of the minimum-cost surfce. Furthermore, this pper presents novel lgorithm for the temporl mintennce of ckground model to enhnce the rendering of occlusions nd reduce temporl rtefcts (flicker); nd cost ggregtion lgorithm tht cts directly on our three-dimensionl mtching cost spce. Exmples re given tht demonstrte the roustness of the new lgorithm to sptil nd temporl rtefcts for long stereo video strems. These include demonstrtions of synthesis of cyclopen views of extended converstionl sequences. We further demonstrte synthesis from freely trnslting virtul. 1. Introduction This pper ddresses the prolem of novel-view synthesis from pir of rectified imges with specific emphsis on peer-to-peer teleconferencing. With the rise of instnt messenging technologies, it is envisged tht the PC will incresingly e used for interctive visul communiction. One pressing prolem is tht ny used to cpture imges of one of the prticipnts hs to e positioned offset to his or her gze. This cn led to lck of eye contct nd hence undesirle effects on the interction [4]. Previously proposed solutions to this prolem cn e rodly ctegorized s model-sed or imge-sed. One model-sed pproch is to use detiled hed model nd reproject it into the cyclopen view; whilst this cn e successful [10, 11], it is limited to imging heds, nd would not, for exmple, del with hnd in front of the fce or whiteord scriling. A more generl pproch therefore is to use low level stereo mtching, in some form, nd follow with n imge sed rendering pproch (IBR)[1].The Computer screen Messenging window Input left imge Input right imge Figure 1: Cmer configurtion. The sic setup considers two s plced on the frme of the computer monitor. The gol of this pper is tht of generting high-qulity imges for virtul s plced nywhere ner the computer monitor. It will e demonstrted tht gze correction cn e chieved y this technique in n efficient nd compelling wy. im is to synthesize view from virtul tht is locted roughly where the imge of the hed will e displyed on the screen for ech prticipnt, thus chieving eye contct. The sic setup is illustrted in fig. 1. In IBR depth mp is comined with n imge to produce the new view. However in our pproch we use new min-cost surfce projection lgorithm for novel view genertion tht dels with occlusions nd hole filling in direct mnner; y voiding the explicit construction of the scene 3D model. In order to generte depth mp dense stereo lgorithm is required, sustntil review of which cn e found in [8]. According to the evlution, two of the most powerful pproches use grph cuts [5, 7] nd loopy elief propgtion [9] ut oth of these re currently too computtionlly intensive for rel time pplictions. Furthermore, the evlution in [8] my not e vlid for our purposes s: (i) the rnge of disprities considered in this pper is much smller thn in our ppliction (0-29 pixels there, wheres we typiclly consider 0-80 pixel disprities), (ii) we re primrily interested in new view synthesis, thus it does not mtter if the disprities re reltively inccurte in homogeneous imge regions, ll tht mtters is tht the new view is well synthesized. On the other hnd where occlusions occur it is importnt to estimte them ccurtely since otherwise rtefcts such s hloing ( lens-like distortion round foreground ojects) ecome visile. (iii) we consider long video sequences, thus stility of estimtion lso plys prt: flickery reconstruction is less desirle thn consistent one. One of the most computtionlly efficient lgorithms for stereo is Epipolr line Dynmic Progrmming [6], referred to s DP. We hve implemented DP for dense stereo [3], 1

2 P (X,Y,Z) c f Ol l Y Z X O B r Or Figure 2: Fst cyclopen view synthesis y dynmic progrmming. (,c) Input left nd right views, respectively; () Cyclopen view synthesized y stndrd dynmic progrmming [2]. Note tht gze is correct in the cyclopen view. The lgorithm runs t ner rel-time rte, ut produces rtefcts in the cyclopen imge. In this cse considerle undesired streks corrupt the synthesized fce. Furthermore, reconstructed temporl cyclopen sequence shows considerle flicker nd lso n undesirle hlo effect round the hed. the use of which hs previously een demonstrted for cyclopen view interpoltion [2] in video. To otin computtionl efficiency, oservtions consist of single-pixel intensities, nd the consequent qulity of reconstruction (especilly on cluttered ckgrounds) is not consistently stisfctory, s fig. 2 shows. Reconstruction from stndrd dynmic progrmming is chrcterized y two kinds of error: (i) rtefcts produced y mismtches (horizontl streks), nd (ii) the hlo in the regions where the ckground is visile in only one of the two input views. This pper sets out to ddress nd solve oth kinds of rtefcts. There re two prts to our method: the first is generting ccurte disprity nd occlusion mps. Indeed, s will e seen, ccurte leling of occlusions is necessry to remove the hloing effect. The second is representing nd using the computed disprities nd occlusions to generte new view. Within the pper we present new contriutions in oth res: For the genertion of disprities we propose new type of dynmic progrmming pproch, s pth finding through three-plne grph (s opposed to the trditionl single-plne DP), introducing new lels to help the correct identifiction of occlusions, nd ltering the cost function employed to fvour: (i) correct grouping of occlusions, (ii) formtion of occlusions t the oundries of foreground ojects, nd (iii) inter scnline consistency. Second, we introduce the elegnt geometry of min-cost surfce projection s n efficient technique for generting synthetic views from ritrry virtul s directly from the minimum-cost surfce otined during the DP process. The new lgorithm is demonstrted on long sequences of pirs of synchronized stereo videos tken from sttic s, the methods show compelling novel view genertion results. Section 2 descries trditionl dynmic progrmming. Section 3 introduces our improved dense stereo technique. Our view genertion pproch is descried in section 4, nd finlly, section 5 presents concluding results. scnline Figure 3: Bsic nottion. È is 3D scene point. Ç Ð nd Ç Ö re the opticl centres of left nd right s, respectively. is the focl length of the s nd is the seline etween the two opticl centres. Ç is the origin of the reference coordinte system. r scnline Virtul scnline Minimum cost pth l r l occluded move Mtched move occluded move Figure 4: Trditionl dynmic progrmming. () Bsic digrm for dynmic progrmming. It represents the mtrix of cumultive costs used for computing the minimum cost pth. () A single-step view of () showing the set of the three llowed moves etween pixel pirs in [2]. The circles represent elements of the cost mtrix in (). 2. Trditionl dynmic progrmming In the interests of clrity this section descries riefly the sic dynmic progrmming lgorithm [3]. Figure 3 shows pln view of the setup. The left nd right s provide us with the synchronized nd rectified input videos. is the focl length nd the distnce etween the two opticl centres (seline). A Crtesin coordinte system is chosen with origin t the mid point etween the left nd right opticl centres. In the reminder of the pper we will refer to cyclopen imges s the ones generted y virtul with opticl centre in Ç. Given the configurtion in fig. 3 the digrm in fig. 4 represents the cumultive cost mtrix for pir of corresponding scnlines in the two input imges [3]. The cost Å Ð Öµ of mtching pixel t position Ð long the left scnline nd pixel t position Ö long the right scnline is defined simply s the squre difference of pixel intensities (which in our experiment in fig. 2 is normlized etween ¼ nd ½). Note tht, since Ð Ö È (i.e. disprities re lwys positive), then it is only ever necessry to consider the lower hlf of the digrm (grey in fig. 4). The limiting cse Ð Ö corresponds to point t infinity with consequent zero disprity. It is ssumed from here on tht 2

3 Figure 5: The 3D cost spce for pir of stereo imges. () The sic digrm of fig. 4 ecomes 3D digrm when ll the scnline pirs re considered. The vlue of ech element inside the prllelepiped is the Å Ð Öµ cost of mtching two pixels. See text for detils. The digonl plne is clled the plne of virtul imge for resons tht will ecome pprent in the reminder of the pper. () A 2D Gussin filter prllel to the virtul imge plne is pplied to the 3D cost spce to enforce interscnline consistency. ny computtion is restricted in this fshion. Aprt from simple initiliztion step, the elements of the cumultive cost mtrix re filled, t ech itertion y the following recurrence: Ð Öµ min Ð ½Öµ ÇÓ Ø Ð ½Ö ½µ Å Ð Öµ Ð Ö ½µ ÇÓ Ø where Ð Öµ indictes the cumultive cost of the pth reching the point Ð Öµ in the mtrix. This recurrence defines the forwrd pss of the DP lgorithm. Notice tht three moves (or lels) re permitted: horizontl occluded move, digonl mtched move nd verticl occluded move, respectively. The cost of hving n occluded pixel, OccCost is mnully set prmeter which depends on the imge pir eing exmined vlue of ¼ seems to yield the est results on vriety of imges. At ech itertion the minimum cost etween the three possile moves is chosen nd tle of ckwrds links is stored for use in the second prt of DP. The ckwrd pss of the lgorithm follows the sved links, producing the minimum-cost pth (fig. 4) nd, therey the disprity mp. It is importnt to stress the fct tht only three types of move re possile in [3] thus confounding occluded nd non-occluded moves. As descried lter, one of the min contriutions of this pper is tht of expnding the set of permitted moves for correct detection nd clssifiction of the occlusion events. 3. Our improved DP lgorithm This section descries the proposed mtching lgorithm. Our improved DP technique produces etter occlusion clssifiction nd improved disprity mps which, in turn, yield (1) the removl of rendering rtefcts in the synthesized virtul imges. Computing mtching costs. In order to id inter-scnline consistency the mtching cost Å Ð Öµ is clculted for every pir of pixels long corresponding epipolr lines with windowed normlised cross-correltion: Å Ð Öµ ½ Å ¼ Ð Öµµ¾ where Å ¼ Ð Öµ È ÁÄ Á Ä µ Á Ê Á Ê µ Õ È ÁÄ Á Ä µ È ÁÊ ¾ Á Ê µ ¾ is the correltion coefficient. Notice tht since ½ Å ¼ Ð Öµ ½ Ð Ö,then¼ Å Ð Öµ ½ Ð Ö. Tller neighorhood windows (e.g. ) help incorporte inter-scnline informtion etter thn squre windows. Computing the costs Å Ð Öµ cn e performed efficiently y expnsion of the ove eqution nd keeping trck of sums from one pir of epipolr lines to the next. Filtering the mtching costs. The use of windows for the computtion of the Å Ð Öµ costs helps to reduce rtefcts in the finl disprity nd occlusion mps ut it is not sufficient for the complete removl of the rtefcts. Therefore, in order to otin clener disprity nd occlusion mps we first tke ll the mtrices of Å Ð Öµ costs ssocited to ech pir of scnlines (note: not the cumultive cost mtrices), stck them up together to crete 3D cost spce (fig. 5), nd then pply two-dimensionl Gussin smoothing filter (prllel to the virtul imge plne) to the 3D cost spce. The xis of the Gussin kernel orthogonl to the left nd right scnline xes (denoted in fig. 5) is responsile for enforcing inter-scnline consistency of the costs nd the orthogonl xis (denoted ¼ in fig. 5) produces dditionl smoothing of shrp corners in the occlusion mp. The output of this process is the new set of Å Ð Öµ costs used s input to our improved DP lgorithm, descried elow. The five-move model. A mjor drwck to the stndrd DP pproch is tht slnted surfces (e.g. non frontoprllel wlls nd tle tops) in spce must e pproximted y comintion of digonl (mtched) nd horizontl or verticl (occluded) moves. In such cse the occluded moves do not correspond to rel occlusions nd therefore, in order to dismigute etween pproximting occluded moves nd rel occlusions we ugment the sic 3-move model y dding further pir of horizontl nd verticl mtched moves, thus defining 5-lel (.k.. 5-move) model. The new model is illustrted in the digrm in fig. 6 (to e compred with fig. 4). This improved model produces more consistent clssifiction of occluded nd mtched pixels. In fct, slnted surfces re correctly pproximted y sequences of mtched moves only, nd rel occlusion lels re correctly ssigned to pixels visile only in one of the two input views. 3

4 Occluded move (r) Mtched move r l Mtched move Mtched move Occluded move (l) Figure 6: The improved 5-move model for DP. ()Five different moves re llowed: three mtched moves (horizontl, digonl nd verticl), nd two occluded moves (horizontl nd verticl). Thus, verticl nd horizontl moves cquire two possile menings: (i) for the explicit modeling of occlusion events, nd (ii) pproximting slnted surfces. The three-plne grph for DP. Furthermore, in order to is towrds runs of identicl moves we introduce further extension of the sic DP technique y defining the DP lgorithm on three plnes of cumultive cost mtrices (s opposed to the single plne in [2]): left-occluded plne Ä, mtched plne Å, nd right-occluded plne Ê (see fig 7). As illustrted in fig 7 in this new model totl of thirteen moves re permitted. The improved three-plne grph is the sis of our new lgorithm for recovering the disprity mp. The min dvntge of the new model is tht it llows us to lter the individul costs of ech type of move, independently. For exmple, ising the penlty costs ginst inter-plne moves would tend to keep runs of occluded or non-occluded pixels together, thus reducing most of the inccurcies in the reconstructed occlusions nd disprities. Also, physiclly impossile moves such s the direct trnsition etween left nd right occlusions re prohiited simply y removing certin trnsitions from the set of llowed ones in the three-plne grph (in fig 7 the top nd ottom plnes re never directly linked). At present, the cost µ of generic trnsition etween two plnes nd is mnully set, s descried elow, ut further investigtion out possile proilistic frmework is necessry. Moreover, it is resonle to ssume tht µ is symmetric 1, i.e. µ µ nd lso tht ny move involving the left occluded plne hs the sme cost s corresponding move involving the right occluded plne. This reduces the totl numer of penlty prmeters to three, nd then y setting Å Å µ to zero in the mtched plne we end up with only two prmeters: «eing the cost of move within n occluded plne, nd eing the cost of move etween different plnes (fig 7). In this new frmework the mtrices of cumultive costs Ä, Å nd Ê (one for ech plne in the grph) re ini- 1 To void introducing unjustified symmetries in the wy the imge dt is treted. Figure 7: The proposed 13-move, 3-plne model for DP.()Thegrph ssocited to our DP lgorithm now lives in three plnes to impose constrints etween the llowed moves. The llowed moves within plnes nd etween plnes re shown y rrows. () The permitted moves hve een lelled with the ssocited costs. Some of the lels hve een left out for clrity. The entire set of permitted moves nd their ssocited costs is descried in the text. tilised to ½ everywhere except in the right occluded plne, where: Ê ¼µ «(2) nd then the forwrd step of the dynmic progrmming proceeds s follows: Ä Ð Ö ½µ «Ä Ð Öµ min (3) Å Ð Ö ½µ Å Ð Öµ Å Ð Öµ (4) Å Ð ½Öµ Ä Ð ½Öµ Ê Ð ½Öµ Å Ð Ö ½µ min Ä Ð Ö ½µ Ê Ð Ö ½µ Å Ð ½Ö ½µ Ä Ð ½Ö ½µ Ê Ð ½Ö ½µ Ê Ð ½Öµ «Ê Ð Öµ min Å Ð ½Öµ where Å Ð Öµ is the filtered cost (s descried previously) of mtching the Ð Ø pixel in the left scnline with the Ö Ø pixel in the right scnline. The prmeters re chosen s follows: «is set to ½¾, vlue chosen such tht most good mtching costs Å Ð Öµ re less thn this. The prmeter is set to ½¼ vlue too low produces spurious isolted mtched pixels within occluded regions, with consequent rtefcts; while vlue too high results in the minimum-cost pth rrely leving the mtched plne. (5) 4

5 scnline pv Virtul scnline pr pv p c pr Min im um cost pth p Virtul scnline scnline scnline pl scnline d Figure 8: Filtering the cost spce. () One of the two input imges, () Occlusion mp for the cyclopen view otined without cost smoothing, green nd red mrk occluded pixels, cyn nd mgent mrk horizontl nd verticl mtched moves, white is foreground nd lck is ckground. (c) Corresponding disprity mp otined with no cost smoothing. (d) Occlusion mp for the cyclopen view otined with Gussin smoothing ( ¼) of the 3D cost spce. Only the rel occlusions re shown here. (e) Corresponding disprity mp otined with Gussin smoothing ( ¼) of the 3D cost spce. A correltion window ws used in oth exmples. Exmple result from improved DP. Figure 8 demonstrtes two concepts: i) our improved DP lgorithm correctly lels occluded pixels nd distinguishes them from horizontl nd verticl mtched moves; nd ii) solid occluded res re relily detected round the hed. In fig. 8d the lrge left nd right occluded res pper clener nd solid (no spurious mtched pixels within). Furthermore, slnted surfces such s the wlls nd the fce re modeled y sequences of digonl, verticl nd horizontl mtched moves (not shown in the figure, for lck of spce). We hve found tht smoothing of the costs considerly improves the results of the dynmic progrmming, nd enles the window size of the cross-correltion mtching function to e reduced considerly (without reducing the qulity of the results) for potentilly fster execution speeds. A window hs een found to work consistently well. Much poorer results re otined from smoothing the estimted disprity mps. Shiftle windows [8] were lso tried here ut did not pper to hve lrge effect; proly due to the smll window sizes in use ( ). Generting the cyclopen view. The synthesis of the cyclopen (centrl) view cn e done for ech scnline y simply tking point Ô (fig. 9) on the minimum cost pth, tking the colours of the corresponding pixels Ô Ð nd Ô Ö in the left nd right scnlines, verging them nd projecting the newly otined pixel orthogonlly to the virtul imge plne into the virtul imge point Ô Ú. e Figure 9: Generting the cyclopen view. () For mtched points: mtched point Ô (on lue segments) is projected orthogonlly onto its corresponding point Ô Ú on the virtul scnline. The pixel vlue of the virtul pixel Ô Ú is the verge of the corresponding pixels Ô Ð nd Ô Ö on left nd right imges, respectively. () For occluded regions: point Ô on the continution of the ckground (with sme disprity, dshed lue line) is projected orthogonlly onto its corresponding point Ô Ú on the virtul scnline. Since we re deling with left occlusion then the pixel vlue for Ô Ú is the sme s tht of its corresponding point Ô Ö on the right view only. This implements the fronto-prllel occlusion filling directly from the nlysis of the grph. In order to fill the occluded regions, fronto-prllel ssumption is used, i.e. the ckground is continued t the sme depth (dshed lines in fig. 9). Here, for left occlusion, the pixel vlues re tken only from the right imge nd vice-vers. The disprity vlue is set ccordingly. The fronto-prllel pproximtion does not work well if the occlusion regions present isolted mtched pixels nd therefore, otining solid nd relile occlusion regions is of prmount importnce. As shown, the use of the proposed thirteen-move, three-plne lgorithm with the extr cost-smoothing step produce extremely solid occlusion regions (fig. 8d) nd, consequently, visully convincing ckground propgtion into the occlusion regions. Temporl occlusion filling. Despite the progress otined in the synthesis of cyclopen views from stereo pir of still imges, when the sme lgorithm is pplied to sequence of stereo imges then smll temporl rtefcts ecome visile (e.g. flickering). To void this prolem we proceed with temporl construction of model of the ckground tht llows us to fill in the regions of missing informtion t given time with pixel vlues which my hve een ville in previous time instnces. In order to do so the ccurtely estimted disprity surfce is first segmented into foreground nd ckground for ech frme y employing the following lgorithm: long ech scnline in the disprity surfce, for ech run of occlusions, the disprity t the highest disprity end of the run is histogrmmed. The vlley in the resulting i-modl histogrm defines the disprity threshold. This is in line 5

6 synthesized cyclopen view ckground model P (X,Y,Z) xv Virtul f Ol xl Ov Y O Z X xr Or Figure 11: Bsic nottion for virtul imge genertion. Ç Ð, Ç Ö nd Ç Ú re the opticl centres of left, right nd virtul s respectively. The opticl centre of the virtul cn e plced nywhere in spce nd the corresponding virtul imge is synthesized y our lgorithm. Figure 10: Temporl ckground genertion. (left column) Synthesized cyclopen views for different frmes (¼, ¼ nd ½¼). More exmples of synthesised cyclopen views re provided in the reminder of the pper. (right column) Corresponding cyclopen ckground models. As new regions of the ckground re discovered the ckground model is updted nd occluded res filled in. with the ssumption tht lmost ll runs of occlusions will occur to either side of the hed nd so the histogrm will hve shrp pek where the foreground strts. This turns out to e the cse for lrge numer of sequences nd so foreground threshold disprity cn e utomticlly set. Figure 8d shows lso the results of the segmenttion (foreground in white nd ckground in lck). Given the segmented foreground nd ckground, new options ecome ville, e.g. to replce the ckground entirely with chosen photogrph or video, or to dynmiclly updte the ckground model for use in filling occluded res in successive frmes. The ltter is especilly useful in the next section which introduces the three-dimensionl motion of the virtul. In fct, for exmple, s the virtul centre moves wy from the seline of the two input s less informtion is ville from individul frmes in the occluded regions nd temporlly cquired informtion ecomes extremely useful. In the second step of the lgorithm ckground model is constructed nd updted t ech time instnce. The ckground model is mde of three elements: its disprity mp in cyclopen coordintes, nd the corresponding left nd right imges Á Ð nd ÁÖ, respectively. At ech time instnce Ø the ckground model is updted y the following rule: Ø ½ Ôµ Ø Ôµ ½ µø Ôµ Á ÐØ Ô Ðµ Á ½ ÐØ Ô Ðµ ½ µá ÐØ Ô Ð µ Á ÖØ Ô Öµ Á ½ ÖØ Ô Öµ ½ µá ÖØ Ô Ö µ (6) where Ô is pixel whose disprity Ôµ flls elow the utomticlly computed foreground threshold (nd thus elongs to the ckground), Ô Ð nd Ô Ö re the corresponding positions on left nd right input imges, respectively. Ø Ôµ is the disprity of the pixel Ô in the current ckground model t time Ø. The sclr fctor represents decy constnt (¼ ½)ndÁ indictes intensities. The updte rule (6) pplies to ll the pixels which elong to the ckground nd re visile, nd does not pply to occluded pixels. The presence of the decy fctor (we use ¼) in the updte rule (6) hs the desired effect of temporl smoothing of the output visul dt, with the consequent reduction of pixel flicker (instility). This leds to n improved temporl consistency in the reconstructed occluded regions. Figure 10 illustrtes the results of the temporl ckground filling lgorithm. 4. Simulting the 3D motion of the virtul This section descries novel, compct technique for rendering virtul views directly from the estimted minimumcost surfce, thus negting the need to construct n explicit 3D model of the scene. Figure 11 shows pln view of the system with the opticl centre of the virtul eing plced in Ç Ú. A 3D scene point È is projected on the left nd right imges into the points Ô Ð Ü Ð Ý Ð µ nd Ô Ö Ü Ö Ý Ö µ respectively. Also, È is projected on the cyclopen (with opticl centre in Ç Ç) in the point Ô Ü Ý µ (not shown in the figure) nd on the virtul (with opticl centre Ç Ú in generic position) in the point Ô Ú Ü Ú Ý Ú µ. The disprity etween the corresponding left nd right imge points is esily computed s Ü Ð Ü Ö (7) In the cyclopen, y tringle similrity we cn compute Ü (8) 6

7 imge Virtul imge - 8 imge Virtul imge Disprity surfce Disprity surfce imge Inwrds virtul motion, Q imge Q + 8 Outwrds, Upwrds, Downwrds,,. c Figure 13: Exmple of gze correction. (,c) Input left nd right views, respectively; () Our lgorithm does correct the gze while eliminting the rtefcts. To e compred with fig. 2. Figure 12: Virtul motion. () The 3D motion of the virtul is chieved y direct projection of points on the minimum-cost surfce into the virtul imge plne. () Moving the centre of projection É corresponds to trnslting the virtul. The coloured rrows indicte the mpping etween moving the centre of projection É in our digrm nd the corresponding trnsltions of the virtul in the scene. For virtul with opticl center in Ç Ú Ì Ü Ì Ý Ì Þ µ we cn write: Ì Ü µü Ú Ì Þ µ, from which Ü Ú Ì Ü (9) Ì Þ By sustituting (7) nd (8) into (9) we otin: Ü ÌÜ Ü Ú which, together with the nlogous ½ ÌÞ µ eqution for the Ý Ú coordinte, cn e rewritten in homogeneous coordintes s: ¼ ½ ¼ Ü ½ ¾ Ú Ý Ú ½ ¼ Ì Ü Ü ¼ ¼ ½ Ì Ý ¼ Ý (10) Û ¼ ¼ Ì Þ µ ½ Eqution (10) represents projection of 3D points into plne. It cn e proven tht (10) corresponds to projecting points of the disprity surfce into the corresponding points on the plne of the virtul imge (up to scle, digonl mtrix) s illustrted in fig. 12. From (10) the centre of projection É is redily computed s the null vector of the projection mtrix, thus yielding: É ÌÜ ÌÝ ½ ÌÞ. Notice tht for Ì Þ ¼the trnsformtion (10) is prllel projection (É is t infinity). This, in turn mens tht sidewise (in the direction) nd up/down (in the direction) motion of the virtul cn e simulted y simple projection of points of the min-cost surfce onto the virtul imge plne vi prllel rys. The inwrds/outwrds trnsltion of the virtul (Ì Þ ¼), insted, is chieved y mens of centrl projection with finite centre of projection É. The simple mpping etween the motion of the centre of projection É nd the corresponding trnsltion of the virtul is illustrted in 12. For instnce, inwrds trnsltion (not zoom) is chieved y moving the centre É from ½ towrds the plne of the virtul imge. ½ Forwrd Input left view Input right view Bckwrd Figure 14: Forwrd/ckwrd trnsltion of virtul. The ottom row shows the synthesized cyclopen views with (left) forwrd virtul trnsltion, (center) cyclopen view, (right) ckwrd virtul trnsltion. Notice the prllx effect round the hed. Notice tht for É ½¾ ¼ ½ ¼µ (i.e. Ç Ú ¾ ¼ ¼µ ) the virtul imge corresponds to the input left imge, for É ½¾ ¼ ½ ¼µ (i.e. Ç Ú ¾ ¼ ¼µ ) the virtul imge corresponds to the input right imge, nd for É ¼ ¼ ½ ¼µ (i.e. Ç Ú ¼ ¼ ¼µ ) the virtul imge corresponds to the hlf-wy cyclopen imge. In order to produce high qulity output imges inverse mpping nd iliner interpoltion techniques re used. 5. Results Generting cyclopen views from still imge pirs. Figure 13 shows n exmple where the input left nd right imges of fig. 2 hve een used to generte the cyclopen view vi our lgorithm. Notice tht the sptil rtefcts (streks in fig. 2) hve een considerly reduced. In the centrl imge the gze hs een corrected. 3D trnsltion of the virtul. Figure 14 shows n exmple of trnslting the virtul towrds nd wy from the viewed scene. This is different from simple zooming or cropping of the output imge. In fct, prllx effect my e noticed in the oundry etween the hed nd the ckground, thus providing the correct threedimensionl feeling. 7

8 Down Up Figure 15: In-plne trnsltion of virtul. The left nd right input imges re the sme s in fig. 14. This tle shows the synthesized imges corresponding to trnsltion of the virtul long the Ü nd Ý xes. Notice the prllx effect round the hed. Also, the door frme is reconstructed nicely despite its prtil occlusion in the right input view. Figure 15 shows n exmple of in-plne trnsltion (long the nd directions) of the virtul. Notice the reltive displcement of the hed with respect to the ckground. Cyclopen view genertion in long sequences. Finlly fig. 16 demonstrtes the effectiveness of the proposed lgorithm for reconstructing cyclopen views of extended temporl sequences. Notice tht most of the sptil nd temporl rtefcts re removed. 6. Conclusions nd Future Work We hve presented n efficient lgorithm for the synthesis nd geometric mnipultion of high-qulity virtul imges from pir of synchronized stereo sequences with lrge disprities (¼ ¼ pixels). In this pper we hve focused on one-to-one teleconferencing pplictions ut the techniques descried re more generl nd cn e employed in other pplictions requiring novel view genertion nd dense stereo. The newly proposed three-lyer grph for dynmic progrmming, the nisotropic cost filtering nd the temporl ckground model uilding hve een demonstrted effective in the synthesis of novel views with virtul plced in generic loction. With the current unoptimized implementtion these results hve een produced t rte of out frme every ¾ sec (on ¾¼ ¾¼ imges, on ¾Þ Pentium). Finlly, for the future development of the work presented in this pper, thorough experimenttion with different lyouts, code optimiztion for rel-time synthesis, nd Figure 16: Gze correction for long sequences. Frmes extrcted from reconstructed cyclopen sequence (over 10 sec long). the genertion of stndrd test sequences for evlution of the lgorithm will e necessry. Acknowledgements. The uthors would like to thnk C.Rother, I.Cox, P.Anndn nd R.Szeliski for their useful comments nd inspiring discussions. References [1] E. Chen nd L. Willims. View interpoltion for imge synthesis. In SIGGRAPH, pges , [2] I. Cox, M. Ott, nd J.P. Lewis. Videoconference system using virtul imge. US Ptent, 5,359,362, [3] I.J. Cox, S.L. Hingorni, nd S.B. Ro. A mximum likelihood stereo lgorithm. Computer vision nd imge understnding, 63(3): , [4] J. Gemmell, K. Toym, C. Zitnick, T. Kng, nd S. Seitz. Gze wreness for video-conferencing: A softwre pproch. IEEE Multimedi, 7(4), [5] V. Kolmogorov nd R. Zih. Multi- scene reconstruction vi grph cuts. In Proc. Europ. Conf. Computer Vision, Copenhgen, Denmrk, My [6] Y. Oht nd T. Knde. Stereo y intr- nd inter-scn line serch using dynmic progrmming. IEEE Trns. on Pttern Anlysis nd Mchine Intelligence, 7(2): , [7] S. Roy nd I.J. Cox. A mximum-flow formultion of the n- stereo correspondence prolem. In Proc. Int. Conf. Computer Vision, pges , [8] D. Schrstein nd R. Szeliski. A txonomy nd evlution of dense two-frme stereo correspondence lgorithms. Int. J. Computer Vision, 47(1 3):7 42, [9] J. Sun, H. Y. Shum, nd N. N. Zheng. Stereo mtching using elief propgtion. In Proc. Europ. Conf. Computer Vision, Copenhgen, Denmrk, My [10] T. Vetter. Synthesis of novel views from single fce imge. Int. J. Computer Vision, 28(2): , [11] R. Yng nd Z. Zhng. Eye gze correction with stereovision for video tele-conferencing. In Proc. Europ. Conf. Computer Vision, volume 2, pges , Copenhgen, Denmrk, My

Gaze Manipulation for One-to-one Teleconferencing

Gaze Manipulation for One-to-one Teleconferencing Gze Mnipultion for One-to-one Teleconferencing A. Criminisi, J. Shotton, A. Blke, P.H.S. Torr Microsoft Reserch Ltd, Cmridge, UK Astrct A new lgorithm is proposed for novel view genertion in one-toone

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324 A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

More information

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful

Pentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this

More information

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

APPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS

APPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS APPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS TABLE OF FIGURES Figure 1: Spectrl Response of CMOS Imge Sensor...3 Figure 2: Byer CFA Ptterns...4

More information

Module 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur

Module 2. Analysis of Statically Indeterminate Structures by the Matrix Force Method. Version 2 CE IIT, Kharagpur Module Anlysis of Stticlly Indeterminte Structures by the Mtrix Force Method Version CE IIT, Khrgpur esson 9 The Force Method of Anlysis: Bems (Continued) Version CE IIT, Khrgpur Instructionl Objectives

More information

Regular Sets and Expressions

Regular Sets and Expressions Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

More information

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one. 5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued

More information

Section 5-4 Trigonometric Functions

Section 5-4 Trigonometric Functions 5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form

More information

Math 314, Homework Assignment 1. 1. Prove that two nonvertical lines are perpendicular if and only if the product of their slopes is 1.

Math 314, Homework Assignment 1. 1. Prove that two nonvertical lines are perpendicular if and only if the product of their slopes is 1. Mth 4, Homework Assignment. Prove tht two nonverticl lines re perpendiculr if nd only if the product of their slopes is. Proof. Let l nd l e nonverticl lines in R of slopes m nd m, respectively. Suppose

More information

Object Removal by Exemplar-Based Inpainting

Object Removal by Exemplar-Based Inpainting Oject Removl y Exemplr-Bsed Inpinting A. Criminisi, P. Pérez K. Toym Microsoft Reserch Ltd., Cmridge, UK Microsoft Corportion, Redmond, WA, USA ntcrim@microsoft.com, pperez@microsoft.com kentoy@microsoft.com

More information

Vectors 2. 1. Recap of vectors

Vectors 2. 1. Recap of vectors Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Factor of an Insulated Two-Wire Transmission Line The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn

P.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn 33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of

More information

Understanding camera trade-offs through a Bayesian analysis of light field projections

Understanding camera trade-offs through a Bayesian analysis of light field projections Understnding cmer trde-offs through Byesin nlysis of light field projections Ant Levin 1 Willim T. Freemn 1,2 Frédo Durnd 1 1 MIT CSAIL 2 Adoe Systems Astrct. Computer vision hs trditionlly focused on

More information

Clipping & Scan Conversion. CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2005

Clipping & Scan Conversion. CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2005 Clipping & Scn Conersion CSE167: Computer Grphics Instructor: Stee Rotenberg UCSD, Fll 2005 Project 2 Render 3D hnd (mde up of indiidul boxes) using hierrchicl trnsformtions (push/pop) The hnd should perform

More information

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 4721 Money and Banking Problem Set 2 Answer Key Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

A Network Management System for Power-Line Communications and its Verification by Simulation

A Network Management System for Power-Line Communications and its Verification by Simulation A Network Mngement System for Power-Line Communictions nd its Verifiction y Simultion Mrkus Seeck, Gerd Bumiller GmH Unterschluerscher-Huptstr. 10, D-90613 Großhersdorf, Germny Phone: +49 9105 9960-51,

More information

4.11 Inner Product Spaces

4.11 Inner Product Spaces 314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces

More information

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001

CS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001 CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic

More information

STUDY ON 3D TEXTURED BUILDING MODEL BASED ON ADS40 IMAGE AND 3D MODEL

STUDY ON 3D TEXTURED BUILDING MODEL BASED ON ADS40 IMAGE AND 3D MODEL STUDY ON 3D TEXTURED BUILDING MODEL BASED ON ADS4 IMAGE AND 3D MODEL Liu Zhen,, *, Gong Peng c, Shi Peijun Ssgw T d College of Resource Science & Technology, Beijing Norml University,1875, liuzhen@nu.edu.cn

More information

Section 7-4 Translation of Axes

Section 7-4 Translation of Axes 62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the

More information

Graphs on Logarithmic and Semilogarithmic Paper

Graphs on Logarithmic and Semilogarithmic Paper 0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

More information

Or more simply put, when adding or subtracting quantities, their uncertainties add.

Or more simply put, when adding or subtracting quantities, their uncertainties add. Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re

More information

Vector differentiation. Chapters 6, 7

Vector differentiation. Chapters 6, 7 Chpter 2 Vectors Courtesy NASA/JPL-Cltech Summry (see exmples in Hw 1, 2, 3) Circ 1900 A.D., J. Willird Gis invented useful comintion of mgnitude nd direction clled vectors nd their higher-dimensionl counterprts

More information

Math 135 Circles and Completing the Square Examples

Math 135 Circles and Completing the Square Examples Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

More information

Basic Analysis of Autarky and Free Trade Models

Basic Analysis of Autarky and Free Trade Models Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently

More information

Modular Generic Verification of LTL Properties for Aspects

Modular Generic Verification of LTL Properties for Aspects Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte

More information

Simulation of operation modes of isochronous cyclotron by a new interative method

Simulation of operation modes of isochronous cyclotron by a new interative method NUKLEONIKA 27;52(1):29 34 ORIGINAL PAPER Simultion of opertion modes of isochronous cyclotron y new intertive method Ryszrd Trszkiewicz, Mrek Tlch, Jcek Sulikowski, Henryk Doruch, Tdeusz Norys, Artur Srok,

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

The Acoustic Design of Soundproofing Doors and Windows

The Acoustic Design of Soundproofing Doors and Windows 3 The Open Acoustics Journl, 1, 3, 3-37 The Acoustic Design of Soundproofing Doors nd Windows Open Access Nishimur Yuy,1, Nguyen Huy Qung, Nishimur Sohei 1, Nishimur Tsuyoshi 3 nd Yno Tkshi 1 Kummoto Ntionl

More information

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand Modelling nd Simultion of hemicl Processes in Multi Pulse TP Experiment P. Phnwdee* S.O. Shekhtmn +. Jrungmnorom** J.T. Gleves ++ * Dpt. hemicl Engineering, Ksetsrt University, Bngkok 10900, Thilnd + Dpt.hemicl

More information

JaERM Software-as-a-Solution Package

JaERM Software-as-a-Solution Package JERM Softwre-s--Solution Pckge Enterprise Risk Mngement ( ERM ) Public listed compnies nd orgnistions providing finncil services re required by Monetry Authority of Singpore ( MAS ) nd/or Singpore Stock

More information

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics Chpter 2 Vectors nd dydics Summry Circ 1900 A.D., J. Willird Gis proposed the ide of vectors nd their higher-dimensionl counterprts dydics, tridics, ndpolydics. Vectors descrie three-dimensionl spce nd

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

How To Set Up A Network For Your Business

How To Set Up A Network For Your Business Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100 hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

More information

SPH simulation of fluid-structure interaction problems

SPH simulation of fluid-structure interaction problems Diprtimento di ingegneri idrulic e mientle SPH simultion of fluid-structure interction prolems C. Antoci, M. Gllti, S. Siill Reserch project Prolem: deformtion of plte due to the ction of fluid (lrge displcement

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike

More information

1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator

1. Find the zeros Find roots. Set function = 0, factor or use quadratic equation if quadratic, graph to find zeros on calculator AP Clculus Finl Review Sheet When you see the words. This is wht you think of doing. Find the zeros Find roots. Set function =, fctor or use qudrtic eqution if qudrtic, grph to find zeros on clcultor.

More information

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors

More information

5 a LAN 6 a gateway 7 a modem

5 a LAN 6 a gateway 7 a modem STARTER With the help of this digrm, try to descrie the function of these components of typicl network system: 1 file server 2 ridge 3 router 4 ckone 5 LAN 6 gtewy 7 modem Another Novell LAN Router Internet

More information

RTL Power Optimization with Gate-level Accuracy

RTL Power Optimization with Gate-level Accuracy RTL Power Optimiztion with Gte-level Accurcy Qi Wng Cdence Design Systems, Inc Sumit Roy Clypto Design Systems, Inc 555 River Oks Prkwy, Sn Jose 95125 2903 Bunker Hill Lne, Suite 208, SntClr 95054 qwng@cdence.com

More information

Basic Ultrasound Views

Basic Ultrasound Views Bsic Ultrsound Views 2 Kenneth D. Horton K.D. Horton Echo/Vsculr Lortory, Intermountin Medicl Center, Murry, UT, USA e-mil: kd.horton@comcst.net T.P. Arhm (ed.), Cse Bsed Echocrdiogrphy, DOI: 10.1007/978-1-84996-151-6_2,

More information

Project 6 Aircraft static stability and control

Project 6 Aircraft static stability and control Project 6 Aircrft sttic stbility nd control The min objective of the project No. 6 is to compute the chrcteristics of the ircrft sttic stbility nd control chrcteristics in the pitch nd roll chnnel. The

More information

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding 1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Manuskript. From E. Kollorz et. al Human Machine Interface for Elderly People, pp. 383-386 1. Deutscher Kongress Ambient Assisted Living

Manuskript. From E. Kollorz et. al Human Machine Interface for Elderly People, pp. 383-386 1. Deutscher Kongress Ambient Assisted Living From E. Kollorz et. l Humn Mchine Interfce for Elderly People, pp. 383-386 1. Deutscher Kongress Ambient Assisted Living Humn Mchine Interfce for Elderly People Dipl.-Inf., Ev Kollorz, Institute of Pttern

More information

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered: Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

More information

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics

Vectors and dyadics. Chapter 2. Summary. 2.1 Examples of scalars, vectors, and dyadics Chpter 2 Vectors nd dydics Summry Circ 1900 A.D., J. Willird Gis proposed the ide of vectors nd their higher-dimensionl counterprts dydics, tridics, ndpolydics. Vectors descrie three-dimensionl spce nd

More information

Morgan Stanley Ad Hoc Reporting Guide

Morgan Stanley Ad Hoc Reporting Guide spphire user guide Ferury 2015 Morgn Stnley Ad Hoc Reporting Guide An Overview For Spphire Users 1 Introduction The Ad Hoc Reporting tool is ville for your reporting needs outside of the Spphire stndrd

More information

Introducing Kashef for Application Monitoring

Introducing Kashef for Application Monitoring WextWise 2010 Introducing Kshef for Appliction The Cse for Rel-time monitoring of dtcenter helth is criticl IT process serving vriety of needs. Avilbility requirements of 6 nd 7 nines of tody SOA oriented

More information

Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management

Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management Journl of Mchine Lerning Reserch 9 (2008) 2079-2 Submitted 8/08; Published 0/08 Vlue Function Approximtion using Multiple Aggregtion for Multittribute Resource Mngement Abrhm George Wrren B. Powell Deprtment

More information

Basic Research in Computer Science BRICS RS-02-13 Brodal et al.: Solving the String Statistics Problem in Time O(n log n)

Basic Research in Computer Science BRICS RS-02-13 Brodal et al.: Solving the String Statistics Problem in Time O(n log n) BRICS Bsic Reserch in Computer Science BRICS RS-02-13 Brodl et l.: Solving the String Sttistics Prolem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl Rune

More information

Scalable Mining of Large Disk-based Graph Databases

Scalable Mining of Large Disk-based Graph Databases Sclle Mining of Lrge Disk-sed Grph Dtses Chen Wng Wei Wng Jin Pei Yongti Zhu Bile Shi Fudn University, Chin, {chenwng, weiwng1, 2465, shi}@fudn.edu.cn Stte University of New York t Bufflo, USA & Simon

More information

Concept Formation Using Graph Grammars

Concept Formation Using Graph Grammars Concept Formtion Using Grph Grmmrs Istvn Jonyer, Lwrence B. Holder nd Dine J. Cook Deprtment of Computer Science nd Engineering University of Texs t Arlington Box 19015 (416 Ytes St.), Arlington, TX 76019-0015

More information

All pay auctions with certain and uncertain prizes a comment

All pay auctions with certain and uncertain prizes a comment CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin

More information

An Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process

An Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process An Undergrdute Curriculum Evlution with the Anlytic Hierrchy Process Les Frir Jessic O. Mtson Jck E. Mtson Deprtment of Industril Engineering P.O. Box 870288 University of Albm Tuscloos, AL. 35487 Abstrct

More information

Lec 2: Gates and Logic

Lec 2: Gates and Logic Lec 2: Gtes nd Logic Kvit Bl CS 34, Fll 28 Computer Science Cornell University Announcements Clss newsgroup creted Posted on we-pge Use it for prtner finding First ssignment is to find prtners Due this

More information

A Conditional Model of Deduplication for Multi-Type Relational Data

A Conditional Model of Deduplication for Multi-Type Relational Data A Conditionl Model of Dedupliction for Multi-Type Reltionl Dt Aron Culott, Andrew McCllum Deprtment of Computer Science University of Msschusetts Amherst, MA 01003 {culott, mccllum}@cs.umss.edu Astrct

More information

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility

More information

Small Businesses Decisions to Offer Health Insurance to Employees

Small Businesses Decisions to Offer Health Insurance to Employees Smll Businesses Decisions to Offer Helth Insurnce to Employees Ctherine McLughlin nd Adm Swinurn, June 2014 Employer-sponsored helth insurnce (ESI) is the dominnt source of coverge for nonelderly dults

More information

How To Network A Smll Business

How To Network A Smll Business Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

MODULE 3. 0, y = 0 for all y

MODULE 3. 0, y = 0 for all y Topics: Inner products MOULE 3 The inner product of two vectors: The inner product of two vectors x, y V, denoted by x, y is (in generl) complex vlued function which hs the following four properties: i)

More information

0.1 Basic Set Theory and Interval Notation

0.1 Basic Set Theory and Interval Notation 0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is well-defined

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

Learner-oriented distance education supporting service system model and applied research

Learner-oriented distance education supporting service system model and applied research SHS Web of Conferences 24, 02001 (2016) DOI: 10.1051/ shsconf/20162402001 C Owned by the uthors, published by EDP Sciences, 2016 Lerner-oriented distnce eduction supporting service system model nd pplied

More information

Pure C4. Revision Notes

Pure C4. Revision Notes Pure C4 Revision Notes Mrch 0 Contents Core 4 Alger Prtil frctions Coordinte Geometry 5 Prmetric equtions 5 Conversion from prmetric to Crtesin form 6 Are under curve given prmetriclly 7 Sequences nd

More information

Solving the String Statistics Problem in Time O(n log n)

Solving the String Statistics Problem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl 1,,, Rune B. Lyngsø 3, Ann Östlin1,, nd Christin N. S. Pedersen 1,2, 1 BRICS, Deprtment of Computer Science, University of Arhus,

More information

Factoring Polynomials

Factoring Polynomials Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

More information

Rotational Equilibrium: A Question of Balance

Rotational Equilibrium: A Question of Balance Prt of the IEEE Techer In-Service Progrm - Lesson Focus Demonstrte the concept of rottionl equilirium. Lesson Synopsis The Rottionl Equilirium ctivity encourges students to explore the sic concepts of

More information

Vectors. The magnitude of a vector is its length, which can be determined by Pythagoras Theorem. The magnitude of a is written as a.

Vectors. The magnitude of a vector is its length, which can be determined by Pythagoras Theorem. The magnitude of a is written as a. Vectors mesurement which onl descries the mgnitude (i.e. size) of the oject is clled sclr quntit, e.g. Glsgow is 11 miles from irdrie. vector is quntit with mgnitude nd direction, e.g. Glsgow is 11 miles

More information

Warm-up for Differential Calculus

Warm-up for Differential Calculus Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:

More information

and thus, they are similar. If k = 3 then the Jordan form of both matrices is

and thus, they are similar. If k = 3 then the Jordan form of both matrices is Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If

More information

addition, there are double entries for the symbols used to signify different parameters. These parameters are explained in this appendix.

addition, there are double entries for the symbols used to signify different parameters. These parameters are explained in this appendix. APPENDIX A: The ellipse August 15, 1997 Becuse of its importnce in both pproximting the erth s shpe nd describing stellite orbits, n informl discussion of the ellipse is presented in this ppendix. The

More information

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

More information

AREA OF A SURFACE OF REVOLUTION

AREA OF A SURFACE OF REVOLUTION AREA OF A SURFACE OF REVOLUTION h cut r πr h A surfce of revolution is formed when curve is rotted bout line. Such surfce is the lterl boundr of solid of revolution of the tpe discussed in Sections 7.

More information

Physics 43 Homework Set 9 Chapter 40 Key

Physics 43 Homework Set 9 Chapter 40 Key Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x

More information

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems

Bypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University

More information

Gene Expression Programming: A New Adaptive Algorithm for Solving Problems

Gene Expression Programming: A New Adaptive Algorithm for Solving Problems Gene Expression Progrmming: A New Adptive Algorithm for Solving Prolems Cândid Ferreir Deprtmento de Ciêncis Agráris Universidde dos Açores 9701-851 Terr-Chã Angr do Heroísmo, Portugl Complex Systems,

More information

Physics 6010, Fall 2010 Symmetries and Conservation Laws: Energy, Momentum and Angular Momentum Relevant Sections in Text: 2.6, 2.

Physics 6010, Fall 2010 Symmetries and Conservation Laws: Energy, Momentum and Angular Momentum Relevant Sections in Text: 2.6, 2. Physics 6010, Fll 2010 Symmetries nd Conservtion Lws: Energy, Momentum nd Angulr Momentum Relevnt Sections in Text: 2.6, 2.7 Symmetries nd Conservtion Lws By conservtion lw we men quntity constructed from

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

AntiSpyware Enterprise Module 8.5

AntiSpyware Enterprise Module 8.5 AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility

More information

Hillsborough Township Public Schools Mathematics Department Computer Programming 1

Hillsborough Township Public Schools Mathematics Department Computer Programming 1 Essentil Unit 1 Introduction to Progrmming Pcing: 15 dys Common Unit Test Wht re the ethicl implictions for ming in tody s world? There re ethicl responsibilities to consider when writing computer s. Citizenship,

More information

Applications to Physics and Engineering

Applications to Physics and Engineering Section 7.5 Applictions to Physics nd Engineering Applictions to Physics nd Engineering Work The term work is used in everydy lnguge to men the totl mount of effort required to perform tsk. In physics

More information

Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999

Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999 Economics Letters 65 (1999) 9 15 Estimting dynmic pnel dt models: guide for q mcroeconomists b, * Ruth A. Judson, Ann L. Owen Federl Reserve Bord of Governors, 0th & C Sts., N.W. Wshington, D.C. 0551,

More information

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam 1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211 - Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

Increasing Q of Waveguide Pulse-Compression Cavities

Increasing Q of Waveguide Pulse-Compression Cavities Circuit nd Electromgnetic System Design Notes Note 61 3 July 009 Incresing Q of Wveguide Pulse-Compression Cvities Crl E. Bum University of New Mexico Deprtment of Electricl nd Computer Engineering Albuquerque

More information

Application-Level Traffic Monitoring and an Analysis on IP Networks

Application-Level Traffic Monitoring and an Analysis on IP Networks Appliction-Level Trffic Monitoring nd n Anlysis on IP Networks Myung-Sup Kim, Young J. Won, nd Jmes Won-Ki Hong Trditionl trffic identifiction methods bsed on wellknown port numbers re not pproprite for

More information

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

Decision Rule Extraction from Trained Neural Networks Using Rough Sets Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT

More information