Temporal Texture Synthesis by Patch-Based Sampling and Morphing Interpolation

Size: px
Start display at page:

Download "Temporal Texture Synthesis by Patch-Based Sampling and Morphing Interpolation"

Transcription

1 Temporal Texture Synthess by Patch-Based Samplng and orphng Interpolaton Chao-Hung La and Junn-Ln Wu Department of Computer Scence and Engneerng, Natonal Chung Hsng Unversty Tachung 40, Tawan, ROC {phd9415, ABSTRACT We present a new algorthm for syntheszng temporal textures, whch s smple and requres only a statc texture mage as nput to produce a contnuous varyng stream of realstc mages. We frst ntroduce the bass sequence generaton procedure n whch the chosen patches from the nput texture mage are sttched on the output frame va blended alpha mattes formed by mnmum error cuts. All the frames n the generated bass sequence are torodal. We then employ the probabltes of smlarty and transton lnks to generate an nexhaustble sequence wth quasperodc qualty. To ensure the smoothness of frame-to-frame transton, we nterpolate natural metamorphoss n each transton lnk usng the effcent automatc morphng technque whch solves the problem of morphng between chaotc textures wth obscure features. In addton, the proposed method allows users to smply and promptly control the moton parameters and nteractvely render the landscape anmatons. We combne the proposed approach wth the color transfer technque to augment the vsual gratfcaton. Several examples ncludng scenes for cloud, fre, and water are presented to demonstrate that the proposed algorthm s smple, effcent, and controllable for syntheszng temporal textures. Categores and Subect Descrptors I.3.8 [Computer Graphcs]: Applcatons General Terms Algorthms Keywords mnmum error cut, temporal texture synthess, morphng nterpolaton, color transfer 1. INTRODUCTION Renderng realstc scenes s one of the maor goals n computer graphcs. Texture mages are wdely used to synthesze the scenery for ths purpose. However, many applcatons requre dynamc qualty to augment the vsual realty, such as computer game, computer-aded desgn, and computer anmaton. For example, a number of nature phenomena, such as a wavng lake, a flowng rver, a burnng fre, or flyng clouds, should be descrbed as moton effects. Statc texture mages are ncompetent for portrayng the tme-varyng panoramas. In consequence, the promsng materals used for constructng vvd scenes wth dynamc qualty are temporal textures. Temporal textures are motons wth ndetermnate extent both n space and tme [0]. They can be used to represent dverse dynamc natural phenomena such as fre, smoke, and water. any researches have been devoted to producng temporal textures, and they can be broadly categorzed nto three classes. The frst class ncludes the technques of mathematcal smulaton [15, 19, 1]. These technques are able to produce photorealstc or nonphotorealstc scenes. However, they have to determne partcular formulas for specfc textures, whch are dffcult to develop. Therefore, an algorthm that s able to generate varety of temporal textures would be preferred. The second class ncludes the frame-based methods whch use a raw vdeo clp as nput sample to synthesze a new vdeo sequence [1, 3, 17]. They splt the orgnal vdeo nto components, whch are clps or frames, and reorganze the order of those components wth smooth vsual realsm by some transton probabltes. These technques can produce temporally nfnte output vdeos, but whch are not spatally expansble. The thrd class ncludes the technques based on D texture synthess methods, whch are extended to 3D temporal texture synthess approaches by replacng the D enttes wth ther 3D counterparts [6, 8, 0]. They analyze the sample vdeo and extract ts structure whch s then used to synthesze a new smlar lookng vdeo. However, the user s requred to provde the source vdeo, whch contans not only one but a number of vdeo frames. Furthermore, t takes tme to analyze the sample vdeo and buld the structure. Recently, La and Wu [10] presented a temporal texture synthess algorthm whch requres only a statc texture mage as nput to synthesze temporal textures wth nexhaustble and sem-regular qualtes. They used a chessboard fllng approach to synthesze a bass frame sequence. Then ther system rendered temporal textures va the leads of the weghted probabltes matrx. And the smooth qualty s mproved by usng the cross-fadng technque. Ther user nterface allows users to nteractvely render landscape anmatons usng the syntheszed temporal textures. In ths paper, we ntroduce an effcent and controllable algorthm, whch can entrely replace the method presented n the earler work [10]. The proposed method has followng contrbutons:

2 Frst, n the stage of generatng bass sequence, we use the approach of blended mnmum error cuts to handle the overlappng regons between adacent texture patches. Wth lttle ncreasng the computatonal cost, we mprove the seamless qualty n each syntheszed frame of the bass sequence. Second, we replace the probabltes matrx wth explct transton lnks whch are more effcent and space-savng. Thrd, we replace the cross-fadng wth morphng nterpolaton technque and mprove the transton qualty. In addton, our morphng technque s able to solve the problem of fndng correspondng features between chaotc textures n whch the features are obscure. It s also capable of been used to morph between mages wth smlar or moved around features. Fnally, we nsert the color matchng procedure nto the nteractve renderng method. Ths color matchng step s mportant when the user wants the syntheszed temporal textures to have the color characterstcs of the target scene to augment the vsual harmony. The rest of ths paper s organzed as follows. In secton, we revew the related work brefly. In secton 3, the proposed algorthm s presented. Experments are conducted n secton 4 to verfy the effectveness of the proposed method. Fnally, conclusons and future work are ncluded n secton 5.. RELATED WORK any researches for syntheszng temporal textures have been proposed recently. We and Levoy [0] modeled the nput vdeo as 3D neghborhoods. They drectly copy those pxels whose neghborhoods are matched to the output textures pxel by pxel and slce by slce. Although accelerated by vector quantzaton, ther pxel-wse algorthm s stll tme-consumng. Schödl et al. [17] proposed a termnology called vdeo texture. They decompose the nput vdeo nto frames or clps and recombne them by the asssts of the transton probabltes. They use the cross-fadng or vew morphng technque to varnsh the vsual dscontnutes f there are no graceful transtons n the vdeo. Vdeo texture technque can produce temporally nfnte but not spatally expansble output vdeos. Joseph et al. [6] analyzed the whole nput sgnals and construct herarchcal multresoluton analyss trees, called RA trees. They transform the newly statstcally merged RA trees back nto sgnals, yeldng output textures. They extend the dea from D textures to 3D tmevaryng textures. Ths technque s unable to create nfntely long sequences. Kwatra et al. [8] used graph cut to synthesze D and 3D textures. In syntheszng temporal textures, the nput vdeos are concatenated wth optma seams, whch are rregular 3D cut surfaces. Although accelerated by FFT-based technque, the searchng for the cut surface s stll tme consumng. Bhat et al. [1] captured the motons of textured partcles n the nput vdeo along user-specfed flow lnes. They nteractvely synthesze seamless vdeo of arbtrary length by enforcng temporal contnuty along a second set of user-specfed flow lnes. However, the motons of the syntheszed vdeo are the same as the captured one. Recently, there are other ways to generate a vdeo from a sngle mage. Kwatra et al. [9] extended ther texture optmzaton algorthm to synthesze the texture sequence that moves accordng to a gven flow feld. However, ther flow-guded synthess method requres large number of RA to synthesze each frame, and ts speed s slow. Chuang et al. [] anmated the nput mage usng the spectral method, whch employees a physcally based spectrum flter and nverse Fourer transform to create the stochastc moton texture. Ther method can apply a wave feld to a calm water surface of no rpples, but not reproduce the wavng motons of whch the surface already has. 3. THE PROPOSED ALGORITH Gven only a statc texture mage as nput, our system can create plausble texture moves whch can be further used to produce composte landscape anmatons. The algorthm descrbed n ths paper s a fully mproved verson from the prevous one [10]. Please refer to the orgnal work for more detals. Our algorthm for syntheszng temporal textures and nteractvely renderng landscape anmatons ncludes the followng man steps: 1). Bass sequence generaton, ). Transton lnks buldng, 3). Automatc morphng nterpolaton, 4). oton parameters controllng, and 5). Interactve renderng. The basc concept of our algorthm s that gven a D texture mage as nput, we annex the temporal component to the syntheszng process to produce 3D temporal textures. At frst, a fast and effcent bass sequence generaton procedure s used to synthesze a plausble sequence of mages. Whle syntheszng each frame n the bass sequence, we sttch the chosen patches va the blended mnmum error cuts. At the next stage, we measure the smlarty of n-between frames and buld frame-to-frame transton lnks for reorganzng the order of the frames wth smooth vsual realsm. In order to ensure the smoothness of frame-to-frame transtons, the proposed automatc morphng technque s used to nterpolate smooth metamorphoss between each par of frames connected by the transton lnks. In addton, our user nterface allows users to smply control the moton parameters and nteractvely render composte landscape anmatons. Furthermore, we combne the nteractve renderng method wth color transfer technque [16] to acheve color matchng effects. F -1 temporally matched F canddates search spatally matched nput texture Fgure 1. Spatal and temporal constrants. The canddates n the set of spatally matched patches are then extracted by the smlarty wth the patch at the same poston n the prevous frame. 3.1 Bass Sequence Generaton We use the method upgraded from the bass sequence synthess procedure ntroduced by La and Wu [10] to synthesze an output bass sequence. Fgure 1 llustrates the process of syntheszng each frame n the sequence. When searchng for matched patches n the syntheszng process, we also consder both the spatal and temporal constrants. What s mproved from the earler procedure s how the overlappng regons between adacent texture patches are handled.

3 The earler work used feather blendng technque whch s the same as [11]. Another common method s usng mnmum cost cuts [4, 8]. Nealen and Alexa [14] even proposed an approach for re-syntheszng nvald pxels. Although they use the acceleratng technque based on k-coherence search, the re-syntheszng approach s stll tme-consumng. We ponder both the smoothness qualty and computatonal cost and, therefore, use the method of blended mnmum error cuts unfyng the works of [4] and [11]. We fnd the mnmum error cuts n the overlappng boundares around the sttched patch. These four cut paths are naturally connected and form a closed loop whch s used to make an alpha matte, as shown n Fgure (left). We use a 3 3 Gaussan flter to blend the alpha matte, as shown n Fgure (rght). Fgure. Closed mnmum error cuts and blended alpha matte Then, the patch area s rendered as follows: P ( = ( O( + (1 ( ) B(, (1) where B s the chosen patch from the nput texture, O s the current output texture, and s the Gaussan blended alpha matte. ( x, merely ndcates the same pxel poston. The method of blended mnmum error cuts s effcent for the guarantee of seamless qualty and fast wth ncreasng lttle computatonal cost. 3. Transton Lnks Buldng In order to produce a contnuous nfntely varyng stream of vdeo mages from the fnte bass sequence, we have to fnd smooth transtons for replayng the sequence from one part to another. La and Wu [10] ntroduced a loopng rule whch s usng a weghted probabltes matrx. However, after we prune the matrx and keep the good transtons, the matrx becomes sparse. The key pont s what the good transtons are. We want to have the best transtons whch create the mnmal vsble dscontnuty. But, f only the best transtons are chosen, the dsplay sequences are prone to appear monotonc repeats. Consequently, prunng the probabltes matrx and avodng monotonc repeats are both needed. We use a set of explct lnks whch ndcate the transtons from one frame to another, along wth an assocated local probablty. At the same tme, t s mportant to fnd a crteron of smlarty between frames for mantanng the smoothness qualty of the syntheszed sequences. L dstance s smple and commonly used [17]. However, the human vsual system s most senstve to edges, corners, and other hgh-level features n textures []. In vew of ths, frame feature s more mportant for computng the measure of smlarty between the par of frames. However, t s hard to extract the mplct features for chaotc nature textures, lke water, smoke, and fre. Before computng the measure of smlarty between the par of frames, we use the mplementaton of the Laplacan flter [5] to sharpen the obscure features. And then, we compute the summed squared dfferences of colors. So that, the frame features gve more contrbutons to the measure of the L dstance. We call ths dstance sharpened L dstance. We use a set of explct lnks from one frame to another, along wth an assocated probablty. At frst the matrx of dstance, n whch each element D of the matrx descrbes the sharpened L dstance from frame F, we fnd the frames F to F and + r < n and r F, are computed. For each frame F, wth mnmal k D and D, k 0 < k <, and n s the number where of frames n the basc sequence. To avod trval loop, we set the constant r > 1. Each frame has the best forward and backward transtons, except for the frst and last r frames whch only have forward or backward transtons. And then, we turn all forward transtons to backward, and remove all duplcate transton pars. Fnally, we buld a forward lnk for each frame to the next frame n the orgnal order except for the last frame. The reachable complexon s guaranteed that each frame have the way to another frame F, where F may, by walkng through certan of transton lnks. All the probabltes assocated wth each transton lnk are ndependent to each other. We locally set the probablty as: D, + 1 P =, () D + D, + 1 where P s the probablty assocated wth the transton lnk from frame F to F. Each frame may have several backward transton lnks and must have only one forward lnk to the next frame n the orgnal order except for the last frame whch only has backward lnks. Our renderng system walks through the transton lnk each step accordng wth the probablty assocated to the lnk. Ths onte-carlo process makes the syntheszed sequences have quas-perodc qualty. 3.3 Automatc orphng Interpolaton By means of the assocated probabltes, we can fnd smooth transtons from one frame to another when playng the sequence to provde contnuous nfntely varyng stream of vdeo mages. However, as we have mentoned above, the sequence s syntheszed from a sngle texture mage. Sometmes, there stll appear notceable abrupt changes when playng the sequence. We have to ensure the smoothness of frame-to-frame transton to gve the guarantee of the smoothness qualty of the syntheszed temporal texture. La and Wu [10] used cross-fadng technque to reduce the vsble dscontnutes. Cross-fadng s smple and fast, whch s orgnally used to produce morphng effects [17]. By usng ths technque, the notceable dscontnutes are blended away and the smoothness s mantaned. However, cross-fadng brngs a certan

4 level of blur n the dsplay sequences. Another approach to smooth the transtons and, meanwhle, avod the blurrness s morphng whch dstorts and fades one mage nto another through a seamless transton. But, morphng does not work well for chaotc motons because t s hard to fnd correspondng features [8]. Ths s the key pont we have broken through. We present an automatc morphng technque whch s able to solve the problem of fndng correspondng features between chaotc textures n whch the features are obscure. Some varants of ths technque have been presented before. Kang et al. [7] presented an automated mult-resoluton lattce deformaton technque to perform warp trackng. Ths technque practces well at smple warp, but they do not address the warp between stochastc textures. Lu et al. [1] presented a texture metamorphass technque that s able to resolve the warp between textures wth stochastc patterns. Usng ths technque, the user needs to specfy a pattern n the source and target textures to establsh the local feature correspondence. atusk et al. [13] proposed a morphable nterpolaton for textures. They buld a morphable model that facltates the nterpolaton of textures usng a warp deformaton. Ths technque s sutable for textures wth explct features. Our morphng nterpolaton approach s based on [7] and [13]. However, our method s specalzed from the prevous works and s able to acheve the morphng between chaotc textures wth ndstnct features, such as cloud, fre, and water. Furthermore, there s no need for the user to specfy the mappng ponts. In order to guarantee the smoothness qualty of the syntheszed temporal texture, we nterpolate smooth morphng frames nto each lnked transton from one frame to another. Reference to [7] and [13], we compute coarse-to-fne mappng functon based on regularly trangular mesh. And barycentrc formulaton and blnear nterpolaton [18] are used to compute the pxel values n the warped mesh. The basc dea s as follows. Consderng a transton from frame F to another frame F, we downsample both frames to multresoluton pyramds. Startng at the lowest resoluton, we overlap regular trangulaton mesh onto the source frame F. For each vertex of the mesh, we search for the mappng poston whch s the best matched n the target frame F. For each hgher resoluton, we magnfy the mesh by a factor of two and subdvde the mesh by splttng each trangle nto four. The mappng and mesh ncreasng processes contnue untl the orgnal scale s reached. Then frame F and F are warped to each other by computng the affne mappng and both are blended together to produce the ntermedate morphng versons esh appng Functon When computng the mappng functon, there are two constrants to search for the best matched poston of each vertex n the mesh. The frst, the vertces are not allowed to move past ther one-rng range. The second, we only search for the optmal poston at whch the cost s mnmal n the allowed range. Smlar to the prevous works [7, 13], there are two components contrbuted to the matchng cost. One s the pxels dfference, the other s the measurement of deformaton. Kang et al. [7] used the metrc whch contaned the color dfference and the amount of deformaton experenced by each grd edge. atusk et al. [13] used the L -error of the per-pxel scalar feature strength and the measure of warpng each trangle of ts one-rng neghborhood. We consder of both the features and localty of the textures n whch the features are obscure. Before the frames are downsampled, the Laplacan flter s used to sharpen the obscure features. When we search for the mappng poston of each mesh verte ts neghborhood s compared aganst all possble neghborhoods n the allowed range from the target frame. In our examples, ths neghborhood s a 3 3 or 5 5 block centered by the vertex. Whle the deformaton penalty s measured, we smply use the amount of moton of the verte snce we have constraned the movement not to pass ts one-rng range. For elaboraton, we defne the symbols and functons used n our method and summarze the algorthm n Fgure 3. Let F and F denote the source and the target frame, and I and I are ther Laplacan sharpened versons respectvely. G denotes the L- th level pyramd. V ( L)( r, denotes the vertex at the r-th row and c-th column n the trangulaton and the poston s ( x, n G. We want to compute the L-th level mappng functon, makng: I, I Laplacan flter F, F G ( L), G ( L) pyramds for each level of I, I, L > 0 For each level L, startng at the lowest resoluton For each vertex v n V N(v) neghborhood of v Search for mnmum cost at each poston n one-rng range, that : cost weghted average( pxels dfference, deformaton measure ) ( L) V ( L)( r, V ( L)( r, x, y ) For each vertex v n V ( L), L > 0 V ( L 1)(r,x,y ) V ( L)( r, x, y ) Dvde each grd nto four (0) Fgure 3. The approach of computng mesh mappng functon V ( L) ( L)( r, V ( L)( r, x', y' ) 1 ( L), (3) where 1 ( L ) denotes the nverse mappng, that s, 1 ( L) = ( L). So, we map a vertex whose poston s ( x, n the mesh over G to the poston ( x, y ) n G by, and vce versa. Fgure 4 shows a mappng

5 result, where = (0), whch s the mappng functon at the orgnal scale. F F V 1 Fgure 4. The mappng functon of frame V F and 3.3. orphng Interpolaton Barycentrc formulaton and blnear nterpolaton technque [18] are used to produce the nterpolated morphng versons between frame F and F. We defne a functon W ˆ ( Iˆ, ˆ,αˆ ) as returnng an mage whch s the warped verson of the mage Î by usng the mappng functon ˆ and the warpng parameter αˆ. The nterpolated morphng formula s shown n (4). F ( F,, t α ) + ( 1 t α ) Wˆ ( F,, t α ) t α W ˆ 1, (4) 1 where α = 1 /( T + 1), T s the number of ntermedate morphng frames between F and F. For each transton lnk descrbed at secton 3., there are T morphng frames nterpolated. Fgure 5. The morphng nterpolaton of two frames. The mages are lsted row-wsely. The frst mage s the source frame, and the last one s the target frame. Fgure 5 shows the morphng nterpolaton of two frames lnked by a transton. Our morphng technque creates smooth metamorphoss between each lnked couple. And the warpng step s performed wthout user-specfed control ponts. Now, consder a transton from frame F to F or to F, when t occurs, our + 1 system play the ntermedate morphng nterpolaton tll the target frame, and next transton s determned from now. Our system s able to walk through every transton lnks smoothly. RS value frame number Fgure 6. The seres of RS values We use the formula of root mean square (RS) to calculate the measure of the varyng quantty. The less s the RS value, the more smlar are the two frames. The RS value of the source frame and the target one from Fgure 5 s about Fgure 6 depcts the seres of RS values between each par of adacent frames shown n Fgure 5, n whch frame 0 denotes the source frame and frame 10 denotes the target one. As shown n Fgure 6, after nterpolatng the seres of morphng mages, the average RS value of every two adacent frames s reduced to about.19 and the varyng range s about ± The smallness and statonary varyng of RS values verfy that the proposed morphng technque s able to nterpolate natural metamorphoss between the lnked frames.

6 temporal texture to have the color characterstcs of the target scene to augment the vsual harmony. Fgure 11 depcts ths llustraton. The color transfer technque s used to transfer the color mood n the orgnal nput texture mage to the masked area n the landscape photo. The transferred texture mage s used as nput to synthesze the temporal texture whch s then sttched on the landscape photo. Consequently, the rendered landscape anmaton wll have no obtrusve color dstrbutons. Fgure 7. The metamorphoss of a man s face n dfferent phases The automatc morphng technque s also capable of beng used to morph between mages wth smlar or moved around features, lke two vews of the same person at dfferent phases. For clearly, we depct the metamorphoss that a man s face transforms between two photographs, as shown n Fgure 7. The resultng anmaton shows that the portons above neck change naturally. But there below neck appear ghostng n ntermedate frames because the features of the necks of the shrts are very dfferent to each other. The frames syntheszed by the bass sequence generaton technque are so smlar that our automatc morphng technque works exactly. In addton, the problem of morphng between chaotc textures wth ndstnct features s also addressed. 3.4 oton Parameters Controllng The key pont of allowng users to easly control the moton parameters, ncludng movng drecton and ambulatng speed, of the syntheszed temporal textures s that all the frames n the sequence are torodal. La and Wu [10] used ths tleable characterstc to augment the vsual gratfcaton. We also preserve ths faclty, snce all the output textures n the bass sequence and all the morphng nsertons n the transton lnks are torodal as before. The movng drecton can be specfed by ust a mouse clck and the ambulatng dstance per step, even pxels or subpxels, can be specfed va a dalog. In practce, we use barycentrc technque [18] to perform the acton of movng the dsplay frame torodally. 3.5 Interactve Renderng The applcablty of our temporal texture synthess algorthm s easly augmented by allowng users to nteractvely create artfcal landscape anmatons. Some varants of ths practce have been consdered before [1,, 8, 10]. We stll upgrade ths applcaton from the work presented by La and Wu [10]. For comparson, we brefly ntroduce the basc steps lsted n [10]: 1). Image mask desgn, ). Warp grds desgn, 3). Renderng. Frst, mage mask s desgned for separatng the masked area n the landscape photo from the background. Second, the user specfes the warp grds to warp the syntheszed temporal texture to cover the masked area. Fnally, the warped temporal texture s sttched on the landscape photo va the mage mask. In ths nteractvely renderng stage, we upgrade the approach proposed above by annexng the color transfer technque [16]. Ths mprovement s mportant when the user wants the sttched 4. EXPERIENTAL RESULTS AND DISCUSSION We appled our algorthm to several textures, such as cloud, fre, and water. We mplement our algorthm va crosoft Vsual C on a machne wth Intel Celeron G and 56 B RA. Our algorthm requres only a statc texture mage as nput, and the process of bass sequence generaton follows to create a bass sequence, n whch all frames are then connected by transton lnks accordng to the probabltes of smlarty. The algorthm nterpolates smooth metamorphoss n each transton couple usng the proposed automatc morphng technque. The system walks through the transton lnk determned by the probabltes of smlarty. Whle renderng each experenced frame, the system shfts the frame accordng to the user-specfed drecton and ambulatng speed. Fnally, the realstc temporal texture s syntheszed by our algorthm. Fgures 8, 9, and 10 show some of our results, n whch the left column shows the nput textures and the rght column lsts the syntheszed temporal textures. Table 1 summarzes the processng tme for those results. The runnng tme for calculatng transton lnks s around 1 second for all the examples. cloud 1 cloud Fgure 8. Results for cloud

7 The number of frames n the bass sequence s 10 for each result. For cloud 1, the resolutons of the nput texture and the output frame are and respectvely. There are 15 transton lnks bult. For each lnk, we nterpolate 9 morphng frames n t. For cloud, the resolutons of the nput texture and the output frame are and respectvely. There are 17 transton lnks bult. For each lnk, we also nterpolate 9 morphng frames n t. When renderng both examples, we move 0.8 pxels n each step toward 135 o. The rendered sequences for both cloud examples look lke the true cloud formaton. For fre 1, the resolutons of the nput texture and the output frame are and respectvely. There are 15 transton lnks bult. For each lnk, we nterpolate 3 morphng frames n t. Because the moton speed of fre s faster than the speed of cloud, so we use fewer ntermedate morphng frames. When renderng, we move 1 pxel n each step toward 45 o. For fre, the resoluton of the nput texture and the output frame are and respectvely. There are 15 transton lnks bult. For each lnk, we also nterpolate 3 morphng frames n t. When renderng, we move 1.5 pxels n each step toward 90 o. The rendered sequences for both fre examples look lke the burnng fre. water 1 water Fgure 10. Results for water fre 1 fre Fgure 9. Results for fre For water 1, the resolutons of the nput texture and the output frame are and respectvely. There are 15 transton lnks bult. For each lnk, we nterpolate 3 morphng frames n t. For water, the resolutons of the nput texture and the output frame are and respectvely. There are 16 transton lnks bult. For each lnk, we nterpolate 5 morphng frames n t. When renderng, we move 1 pxel n each step toward 0 o. The rendered sequences for both water examples look lke the flowng water. In all of these examples, the proposed temporal texture synthess algorthm s successful to produce the texture sequences whch resemble true vdeos. The output resoluton and the length of the rendered sequence are at the user s wll. In addton, the moton parameters can be specfed by the user at run tme. It s effectve, fast, and convenent that our algorthm requres only a texture mage as nput to synthesze temporal textures wth spatally and temporally expansble qualtes, and the moton parameters are controllable. Fgure 11 shows two results for composte landscape anmatons. In ths fgure, the top row shows the orgnal nput texture (left) and the color-transferred one (rght), the second row shows the orgnal landscape photo, the thrd row shows the rendered landscape anmaton by usng the orgnal texture mage as nput, and the bottom row shows the rendered landscape anmaton by usng the color-transferred texture mage as nput. The scene shown at the thrd row looks dscord, but the one at the bottom row looks harmony and lke a rver flowng n a snow scene.

8 Table 1. The processng tme of the proposed method n seconds Input texture Bass sequence generaton orphng nterpolaton cloud cloud fre fre 3 41 water water CONCLUSIONS AND FUTURE WORK Temporal textures are nterestng and mportant for a wde varety of anmatons n computer graphcs. In ths paper we have presented a fast and effcent algorthm for temporal texture synthess. The proposed method s smple and t requres only a statc texture mage as nput to produce plausble mage sequence wth nexhaustble and quas-perodc qualtes. In addton, the user nterface allows users to smply and promptly control the moton parameters and nteractvely render composte landscape anmatons. Several scenes for cloud, fre and water are presented n ths paper. Expermental results confrm that our temporal texture synthess algorthm s smple, effcent, and controllable. We have successfully syntheszed realstc temporal textures and acheve the extensblty and controllablty. However, for some examples, lke wavng ocean, the shape of the waves would be broken when nterpolatng morphng frames. Ths s due to the mss mappng of the mesh vertces. In future work, we are nterested n the physcal flow felds to help make the mesh mappng functon complete. Fgure 11. Results for nteractve renderng. The red arrow ndcates the movng drecton. The orgnal landscape photo s borrowed from

9 6. REFERENCES [1] Bhat, K. S., Setz, S.., Hodgns, J. K., and Khosla, P. K. Flow-based Vdeo Synthess and Edtng. AC Trans. on Graphcs, 3, 3 (Aug. 004), [] Chuang, Y. Y., Goldman, D. B., Zheng, K. C., Curless, B., Salesn, D. H., and Szelsk, R. Anmatng Pctures wth Stochastc oton Textures. AC Trans. on Graphcs, 4, 3 (Jul. 005), [3] Doretto, G., Chuso, A., Soatto, S., and Wu, Y. Dynamc Textures. Internal Journal of Computer Vson, 51, (Feb. 003), [4] Efros, A. A., and Freeman, W. T. Image Qultng for Texture Synthess and Transfer. In Proceedngs of SIGGRAPH 001. Los Angeles, CA, 001, [5] Gonzalez, R. C., and Woods, R. E. Dgtal Image Processng. Prentce-Hall, Inc., New Jersey, 00. [6] Joseph, Z. B., Yanv, R. E., Lschnsk, D., and Werman,. Texture xng and Texture ove Synthess Usng Statstcal Learnng. IEEE TVCG, 7, (Jun. 001), [7] Kang, T., Gemmell, J., and Toyama, K. A Warp-Based Feature Tracker. crosoft Research Techncal Report, SR-TR-99-80, Redmond, Washngton, [8] Kwatra, V., Schödl, A., Essa, I., Turk, G., and Bobck, A. Graphcut Textures: Image and Vdeo Synthess Usng Graph Cuts. AC Trans. on Graphcs,, 3 (Jul. 003), [9] Kwatra, V., Essa, I., Bobck, A., and Kwatra, N. Texture Optmzaton for Example-Based Synthess. AC Trans. on Graphcs, 4, 3 (Jul. 005), [10] La, C. H., and Wu, J. L. A Novel Algorthm for Syntheszng Drectonal Temporal Texture Anmaton. In Proceedngs of nd IASTED nternatonal conference on Advances n computer scence and technology. Puerto Vallarta, exco, 006, [11] Lang, L., Lu, C., Xu, Y. Q., Guo, B., and Shum, H. Y. Real-Tme Texture Synthess by Patch-Based Samplng. AC Trans on Graphcs, 0, 3 (Jul. 001): [1] Lu, Z., Lu, C., Shum, H. Y., and Yu, Y. Pattern-based Texture etamorphoss. In Proceedngs of the 10 th Pacfc Conference on Computer Graphcs and Applcatons. Beng, 00, [13] atusk, W., Zwcker,., and Durand, F. Texture Desgn Usng A Smplcal Complex of orphable Textures. AC Trans. on Graphcs, 4, 3 (Jul. 005), [14] Nealen, A., and Alexa,. Fast and Hgh Qualty Overlap Repar for Patch-Based Texture Synthess. In Proceedngs of CGI 004. Crete, Greece, 004, [15] Perln, K. Improvng Nose. AC Trans. on Graphcs, 1, 3 (Jul. 00), [16] Renhard, E., Ashkhmn,., Gooch, B., and Shrley, P. Color transfer between mages. IEEE CG&A, 1, 5 (Oct. 001), [17] Schödl, A., Szelsk, R., Salesn, D. H., and Essa, I. Vdeo Textures. In Proceedngs of SIGGRAPH 000. New Orleans, LA, 000, [18] Shrley, P. Realstc Ray Tracng. A. K. Peters, Ltd. Natck, A, USA, 000. [19] Tessendorf, J. Smulatng ocean water. In Smulatng Nature: Realstc and Interactve Technques, AC SIGGRAPH 001 course notes No. 47, 001. [0] We, L. Y., and Levoy,. Fast Texture Synthess Usng Tree-Structured Vector Quantzaton. In Proceedngs of SIGGRAPH 000. New Orleans, LA, 000, [1] We, X., L, W., ueller, K., and Kaufman, A. Smulatng Fre wth Texture Splats. In Proceedngs of IEEE Vsualzaton 00. Boston, A, 00, [] Wu, Q., and Yu, Y. Feature atchng and Deformaton for Texture synthess. AC Trans. on Graphcs, 3, 3 (Aug. 004),

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Cluster Analysis of Electrical Behavior

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

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach

Modeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and

More information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

THE PULL-PUSH ALGORITHM REVISITED

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

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

An Optimal Algorithm for Prufer Codes *

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

Lecture 5: Multilayer Perceptrons

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

More information

An efficient method to build panoramic image mosaics

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

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

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

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Edge Detection in Noisy Images Using the Support Vector Machines

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

Interactive Rendering of Translucent Objects

Interactive Rendering of Translucent Objects Interactve Renderng of Translucent Objects Hendrk Lensch Mchael Goesele Phlppe Bekaert Jan Kautz Marcus Magnor Jochen Lang Hans-Peter Sedel 2003 Presented By: Mark Rubelmann Outlne Motvaton Background

More information

Some Tutorial about the Project. Computer Graphics

Some Tutorial about the Project. Computer Graphics Some Tutoral about the Project Lecture 6 Rastersaton, Antalasng, Texture Mappng, I have already covered all the topcs needed to fnsh the 1 st practcal Today, I wll brefly explan how to start workng on

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

2D Shape Deformation Based on Rigid Square Matching

2D Shape Deformation Based on Rigid Square Matching D Shape Deformaton Based on Rgd Square Matchng A. Author Author s Afflaton Author s E-Mal Author s Webste B. Author Author s Afflaton Author s E-Mal Author s Webste C. Author Author s Afflaton Author s

More information

Lecture #15 Lecture Notes

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

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Analysis of Continuous Beams in General

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

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

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

More information

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

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

More information

An Image Fusion Approach Based on Segmentation Region

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

More information

High resolution 3D Tau-p transform by matching pursuit Weiping Cao* and Warren S. Ross, Shearwater GeoServices

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

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

The Codesign Challenge

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

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

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

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

More information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

Machine Learning: Algorithms and Applications

Machine 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

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

TN348: Openlab Module - Colocalization

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

More information

Refinement to the Chamfer matching for a center-on fit

Refinement to the Chamfer matching for a center-on fit Refnement to the Chamfer matchng for a center-on ft Jngyng Chen Paul Tan Terence Goh Sngapore Technologes Dynamcs 249 Jalan Boon Lay Sngapore 69523 Abstract Matchng s a central problem n mage analyss and

More information

Implementation of a Dynamic Image-Based Rendering System

Implementation of a Dynamic Image-Based Rendering System Implementaton of a Dynamc Image-Based Renderng System Nklas Bakos, Claes Järvman and Mark Ollla 3 Norrköpng Vsualzaton and Interacton Studo Lnköpng Unversty Abstract Work n dynamc mage based renderng has

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More information

APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

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

Research and Application of Fingerprint Recognition Based on MATLAB

Research and Application of Fingerprint Recognition Based on MATLAB Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Monte Carlo Rendering

Monte Carlo Rendering Monte Carlo Renderng Last Tme? Modern Graphcs Hardware Cg Programmng Language Gouraud Shadng vs. Phong Normal Interpolaton Bump, Dsplacement, & Envronment Mappng Cg Examples G P R T F P D Today Does Ray

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

Fitting: Deformable contours April 26 th, 2018

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

More information

Hybrid Non-Blind Color Image Watermarking

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

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

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

Object-Based Techniques for Image Retrieval

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

More information

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

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1 4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

A Novel Texture Synthesis Algorithm Using Patch Matching by Fuzzy Texture Unit

A Novel Texture Synthesis Algorithm Using Patch Matching by Fuzzy Texture Unit G.Venkata Ram Reddy et al. / Internatonal Journal on Computer Scence and Engneerng (IJCSE) A Novel Texture Synthess Algorthm Usng Patch Matchng by Fuzzy Texture Unt G.Venkata Ram Reddy, Assocate professor

More information

Reading. 14. Subdivision curves. Recommended:

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

More information

Efficient Region-Based Pencil Drawing

Efficient Region-Based Pencil Drawing Effcent Regon-Based Pencl Drawng Shuo Sun Tanjn, 300160 Chna, School of Scence Tanjn Polytechnc Unversty Sunshuo_0@163.com Dongwe Huang Tanjn, 300160 Chna, School of Scence Tanjn Polytechnc Unversty tjhuangdw@163.com

More information

Mesh Editing in ROI with Dual Laplacian

Mesh Editing in ROI with Dual Laplacian Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

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

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Fall 2009)

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Calculation. Irradiance Caching. Advanced Computer Graphics (Fall 2009) Advanced Computer Graphcs (Fall 2009 CS 283, Lecture 13: Recent Advances n Monte Carlo Offlne Renderng Rav Ramamoorth http://nst.eecs.berkeley.edu/~cs283/fa10 Dscusson Problems dfferent over years. Intally,

More information

Classifier Selection Based on Data Complexity Measures *

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

Load Balancing for Hex-Cell Interconnection Network

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

More information

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Wavefront Reconstructor

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

Model-Based Bundle Adjustment to Face Modeling

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

Intro. Iterators. 1. Access

Intro. Iterators. 1. Access Intro Ths mornng I d lke to talk a lttle bt about s and s. We wll start out wth smlartes and dfferences, then we wll see how to draw them n envronment dagrams, and we wll fnsh wth some examples. Happy

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps

Visual Thesaurus for Color Image Retrieval using Self-Organizing Maps Vsual Thesaurus for Color Image Retreval usng Self-Organzng Maps Chrstopher C. Yang and Mlo K. Yp Department of System Engneerng and Engneerng Management The Chnese Unversty of Hong Kong, Hong Kong ABSTRACT

More information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

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

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

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

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

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

More information

VIDEO COMPLETION USING HIERARCHICAL MOTION ESTIMATION AND COLOR COMPENSATION

VIDEO COMPLETION USING HIERARCHICAL MOTION ESTIMATION AND COLOR COMPENSATION VIDEO COMPLETION USING HIERARCHICAL MOTION ESTIMATION AND COLOR COMPENSATION Jn-Hong Km 1, Rae-Hong Park 1 and Jno Lee 1 1 Department of Electronc Engneerng, Sogang Unversty, Seoul, Korea sosu02kjh@sogang.ac.kr,

More information

Optimal connection strategies in one- and two-dimensional associative memory models

Optimal connection strategies in one- and two-dimensional associative memory models Optmal connecton strateges n one- and two-dmensonal assocatve memory models Lee Calcraft, Rod Adams, and Nel Davey School of Computer Scence, Unversty of Hertfordshre College lane, Hatfeld, Hertfordshre

More information

Automatic Generation of Caricatures with Multiple Expressions Using Transformative Approach

Automatic Generation of Caricatures with Multiple Expressions Using Transformative Approach Automatc Generaton of Carcatures wth Multple Expressons Usng Transformatve Approach Wen-Hung Lao and Chen-An La Department of Computer Scence, Natonal Chengch Unversty, Tape, Tawan {whlao,g9202}@cs.nccu.edu.tw

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Integrated Expression-Invariant Face Recognition with Constrained Optical Flow

Integrated Expression-Invariant Face Recognition with Constrained Optical Flow Integrated Expresson-Invarant Face Recognton wth Constraned Optcal Flow Chao-Kue Hseh, Shang-Hong La 2, and Yung-Chang Chen Department of Electrcal Engneerng, Natonal Tsng Hua Unversty, Tawan 2 Department

More information

Support Vector Machines

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

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D 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 information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

Resolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm

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

More information

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

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

More information

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract

More information

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Caching. Irradiance Calculation. Advanced Computer Graphics (Fall 2009)

Discussion. History and Outline. Smoothness of Indirect Lighting. Irradiance Caching. Irradiance Calculation. Advanced Computer Graphics (Fall 2009) Advanced Computer Graphcs (Fall 2009 CS 29, Renderng Lecture 6: Recent Advances n Monte Carlo Offlne Renderng Rav Ramamoorth http://nst.eecs.berkeley.edu/~cs29-13/fa09 Dscusson Problems dfferent over years.

More information