Motion History Volume for Spatiotemporal Editing of 3D Video in Multi-party Interaction Scenes
|
|
- Janel Palmer
- 5 years ago
- Views:
Transcription
1 IPSJ SIG Techncal Report Moton Hstory Volume for Spatotemporal Edtng of 3D Vdeo n Mult-party Interacton Scenes Qun Sh,a) Shohe Nobuhara,b) Takash Matsuyama,c) Abstract: In ths paper we present a novel method that performs spatotemporal edtng of 3D mult-party nteracton scenes for free-vewpont browsng, from separately captured data. The man dea s to frst propose the augmented Moton Hstory Volume (MHV) for moton representaton. Then by modelng the correlatons between dfferent MHVs we can defne a mult-party nteracton dctonary, descrbng the spatotemporal constrants for dfferent types of multparty nteracton events. Fnally, constrant satsfacton and global optmzaton methods are proposed to synthesze natural and contnuous mult-party nteracton scenes. Experments wth real data llustrate the effectveness of our method.. Introducton Ths paper s amed at presentng a novel method to synthesze spatotemporally synchronzed 3D mult-party nteracton scenes from separately captured data, whle preservng the orgnal moton dynamcs of each object as much as possble. In the lterature of vrtual character moton edtng, most conventonal methods assume to have knematc models of the objects. Such methods are known to work robustly for dverse moton edtng tasks, but the modelng of mult-party nteractons s stll an open problem. In addton, these knematc model-based methods are not drectly applcable for certan knd of 3D data wthout a unfed mesh model. In computer vson and computer graphcs felds, n order to avod occluson problems or to ncrease the reusablty of data, mult-party nteracton scenes could be created by frst capturng each object ndependently and then, syntheszng them together. Snce separate capture wll nevtably result n spatal and temporal msmatches, the synthess of mult-party nteracton scenes becomes a non-trval task and requres large amount of manual work. Our research proposes to ntroduce the dea of augmented Moton Hstory Volume (MHV) to represent both the sngle object moton and mult-party nteracton event. Ths approach allows the edtor to realze natural 3D edtng of multparty nteracton scenes from separately captured data wth spatal and temporal msmatches sem-automatcally, no matter knematc models are avalable or not. The techncal problem we address for ths research s how we can perform spatotemporal algnments on separately captured data, whch s reconstructed nto temporal sequences of 3D meshes. Generally, the word nteracton has dfferent levels of meanngs, so n ths research work we narrow our focus onto the Kyoto Unversty a) sek@vson.kuee.kyoto-u.ac.jp b) nob@vson.kuee.kyoto-u.ac.jp c) tm@vson.kuee.kyoto-u.ac.jp Fg. Mult-party nteracton scenes edtng from separately captured data. explct nteracton event conducted by spatotemporally correlated body motons. The deas behnd our method are as follows. Bascally, an nteracton event can be consdered as a par of spatotemporally synchronzed motons performed by dfferent objects. By representng the motons wth tme recorded volume data, we wll be able to ntroduce varous spatotemporal constrants for multple objects, based on whch a mult-party nteracton dctonary can be defned. Then for each nteracton scene, rather than computng an ndvdual frame, the MHV consders a duraton of moton smultaneously n computaton. Ths makes t possble to consder spatotemporal constrants on the entre moton, and to have objectve crtera that descrbe entre motons. Thus for each nteracton scene we can acqure a soluton group wth multple reasonable relatve locatons of the two nteractng objects by performng MHV-based constrant satsfacton, whle preservng the orgnal moton of each object. The overall processng scheme of the proposed method s as follows. Gven two separately captured moton sequences, we frst perform data segmentaton and temporal algnment. Then we buld up the MHV for each moton segment n a mult-party nteracton scene. Next, we decde the spatotemporal constrants c 03 Informaton Processng Socety of Japan
2 IPSJ SIG Techncal Report Fg. Computatonal processes for mult-party nteracton edtng. for each nteractve moton segment par and compute the soluton group to realze the edtng of each sngle nteracton scene. Fnally all the edted nteracton scenes wll be ntegrated together under a global optmzaton strategy. Fgure llustrates the computatonal processes of our method. It should be noted that step 3, 5, 6, 7 can be computed automatcally usng the proposed method, whle step 4 requres some manual work from the edtor. The two pre-processng steps are out of the scope of ths artcle, and they could be done usng conventonal methods. The man contrbutons of ths paper consst of () we have augmented the orgnal Moton Hstory Volume by encodng more temporal nformaton and assgnng labels onto ts surfaces, () we have desgned a novel method that models mult-party nteracton events nto an nteracton dctonary, based on the MHV. The possble applcatons nclude the makng and edtng of moves, computer anmatons and vdeo games. The rest of ths paper s organzed as follows. Frst, we revew related studes to clarfy the novelty of ths work n Secton. We then ntroduce our MHV-based mult-party nteracton representaton n Secton 3, and the ntra-key segment edtng and nter-key segment optmzaton algorthm n Secton 4. Evaluaton of our method wth real data s gven n Secton 5. Fnally, we summarze the proposed method n Secton 6.. Related Work. Moton edtng work for computer anmaton The prolferaton of varous technques for creatng motons for vsual meda products, coupled wth the needs to best utlze these artstc assets, has made moton edtng a rapdly developng area of research and development. The past few years have wtnessed an exploson of new technques for varous moton edtng tasks, as well as deployment of commercal tools. For edtng a sngle object, moton warpng [], [] has been wdely appled to preserve the orgnal features of nput moton data whle satsfyng a new set of constrants as much as possble. Usng structurally smlar moton database, Muka[3] have proposed a moton nterpolaton approach to obtan contnuous spans of hgh qualty moton. Hlton [4] proposed a shape constraned Laplacan mesh deformaton approach that performs nteractve edtng of mesh sequences whle preservng the natural dynamcs of the captured surfaces. Some other researchers combned an nterpolaton technque wth moton graphs to allow parametrc nterpolaton of moton whle traversng the graph [5], [6]. Whle these works are proved to work robustly for edtng sngle object motons, they dd not provde any constrants for edtng multparty nteracton events. Besdes, Zordan [7] have ntroduced a technque for ncorporatng unexpected mpacts nto a moton capture-drven anmaton system through the combnaton of a physcal smulaton and a specalzed search routne. Ye [8] have proposed a fully automatc method that learns a nonlnear probablstc model of dynamc responses from very few perturbed sequences. Ther model s able to synthesze responses and recovery motons under new perturbatons dfferent from those n the tranng examples. Although these methods can somehow, work for very short nteractve events, they are performng the edtng by changng the orgnal moton dynamcs nstead of keepng t, and they are not applcable for edtng long and contnuous mult-party nteracton scenes ether. In ths paper, we are presentng a novel spatotemporal edtng framework that synthesze well synchronzed mult-party nteracton scenes from separately captured data, n whch objects are performng nteractve motons that should match wth each other, respectvely.. Moton representaton approaches In computer graphcs and computer vson area, researchers have nvented varous approaches for descrbng motons. Postons and veloctes of human body parts have been used by Green [9] for human movement recognton. Optcal flows [0], moton templates [] and space-tme volumes [], [3] are also wdely used for solvng trackng and recognton problems. Such methods are manly used for descrbng the objects moton features for recognton tasks, and they do not offer any controllable factors for moton edtng task. Besdes, knematc models [7], [4] are wdely used n robotcs, moton capture system and computer anmaton edtng. They can represent varety knd of motons, and as well they provde easly controllable factors for the edtors. However, the knematc models are lackng n the ablty of representng mult-party nteracton events. Few spatotemporal constrants can be drectly defned between multple objects based on them. Not to menton that for certan type of c 03 Informaton Processng Socety of Japan
3 IPSJ SIG Techncal Report (a) MHV of the attacker. (b) MHV of the dodger. Fg. 3 Examples of MHV. unstructured data [5] wthout a unfed mesh model, knematc structures are not applcable at all. On the other hand, the dea of Moton Hstory Volume has been proposed by Wenland [6], for solvng free vewpont acton recognton task. It carres out a concept of consderng the entre moton as a whole nstead of descrbng t for each sngle frame, by encodng the hstory of moton occurrences n the volume. Voxels are therefore multple-values encodng how recently moton occurred at a voxel. Mathematcally, consder the bnary-valued functon D(x, y, z, t) ndcatng moton at tme t and locaton (x, y, z), then ther MHV functon s defned as follows: τ f D(x, y, z, t) v τ (x, y, z, t) = max(0, v τ (x, y, z, t ) ) otherwse () where τ s the maxmum duraton a moton s stored. Our work proposed an augmentaton of the orgnal MHV by recordng precsely the full temporal nformaton of moton, makng t more sutable for mult-party nteracton edtng tasks. 3. Defnton of MHV and mult-party nteracton dctonary In ths secton, we frst propose an augmentaton of the orgnal Moton Hstory Volume by addng n full temporal nformaton of the moton. Then an MHV based mult-party nteracton representaton method wll be gven as well. 3. MHV of ndvdual moton As s wrtten n Secton., the dea of moton hstory volume was nvented for acton recognton, and has been proved to be effectve. However, the orgnal defnton of MHV only cares about the occurrence of the moton, whch may not be enough for performng mult-party nteracton edtng. Snce we need to do spatal and temporal algnments of multple separately captured moton sequences, full temporal nformaton ncludng both the startng and endng moments of the moton s necessary for representng the spatotemporal correlatons between multple objects motons. Therefore, we extend the defnton of MHV by addng n more temporal nformaton of the moton as follows: (t start, t end ) f τ =0 D(x, y, z, ) v τ (x, y, z, t) = () Null otherwse where t start and t end are the startng and endng tme of the moton. And we denote the center of gravty of MHV vτ A (x, y, z, t) as C A (x, y, z), whch s consdered as the root node of an MHV. Fgure 3 llustrates the MHVs of the attacker and the dodger Fg. 4 Lables of MHV surfaces. n a fghtng scene, respectvely. Here dfferent colors represent dfferent endng tme of the moton on the voxels. It should be noted that MHV needs not necessarly contan the moton of the entre body. Instead t can be smplfed by only countng n the partal volume of nterest on the objects body. For example, n a sword fghtng scene we may only care about the weapon of the attacker, so that an MHV of the sword would be enough for further edtng work. 3. Mult-party nteracton dctonary usng MHVs Usng the MHV as s descrbed n Secton 3., we can represent the spatotemporal structure of a sngle objects moton. However, n order to perform effectve edtng of mult-party nteracton events, we stll need to fnd a way to model the spatotemporal correlatons of multple objects motons (whch s represented wth MHV). To realze that, we assgn certan labels onto the MHV surfaces accordng to the moton drectons to help descrbe the spatotemporal relatonshp of multple MHVs. As s shown n Fgure 4, we denote the startng surface of MHV wth +, the endng surface wth -, and the lateral surface wth 0. Then, let a par of labels denote the contactng relatonshp of two MHVs. For example, + & + means the two objects MHVs contact wth each other at the endng surfaces. Based on the combnaton of those labels, we can descrbe all the possble spatotemporal correlatons of multple MHVs, as s llustrated n Table. We name the sum up of them a mult-party nteracton dctonary, whch represents all the possble multparty nteracton types that could be modeled usng MHV based representaton. In detals, the spatotemporal constrants for each nteracton type are descrbed as follows: Frst of all, for all nteracton types there s a spatal constrant that the 3D volume of two MHVs should contact wth each other: V A τ (x, y, z) V B τ (x, y, z) φ (3) here V A τ (x, y, z) represents a collecton of voxels n v A τ (x, y, z, t). Note that the two pared MHVs should have the same maxmum duraton τ, we wll explan how we ensure ths n Secton 4. As well, the recorded tmng should be scaled nto the segment orented tmng by subtractng ts real frame numbers from the orgnal moton sequence. Second, each nteracton type has ts own temporal constrant on all the contactng voxels as follows: + & - : t A end = T end, t B start = T start (4) c 03 Informaton Processng Socety of Japan 3
4 IPSJ SIG Techncal Report Table Interacton Dctonary wth examples. Interacton Dctonary + & - 0 & 0 + & + - & - + & 0 - & 0 Hand shakng Shake Hands Rase Arm Arm Down Fghtng Push&Pull Attack&Dodge Attack&Guard After A&G Punch After Punch 0 & 0 : (a) If nterest volumes contact wth each other at every moment wthn τ τ t=0 (V A t (x, y, z) V B t (x, y, z) φ) (5) (b) If nterest volumes contact wth each other at certan moments wthn τ τ (V t A (x, y, z) V t B (x, y, z) φ) (6) t=0 (c) If nterest volumes have no contacts throughout τ + & + : - & - : + & 0 : - & 0 : t A start > t B end (7) t A end = tb end = T end (8) t A start = t B start = T start (9) t A end = T end (0) t A start = T start () here T start = 0 and T end = τ. V t A (x, y, z) represents a subset of Vτ A (x, y, z) at tme t. Ths mult-party nteracton dctonary provdes us varous spatotemporal constrants for performng the edtng work. For example, an attack and guard scene n sword fghtng can be counted as type + & +. Then on the nterested part of the two MHVs, we requre tend A = tb end = T end, meanng that the two swords contact and only contact at the end of the whole moton duraton. 4. Spatotemporal 3D edtng algorthm In ths secton we present the spatotemporal 3D edtng algorthm based on MHV. 4. Overvew and defnton of terms In ths research work, the expected nput data s a seres of 3D mesh surfaces of the objects, be that a unfed mesh model or frame-wse unstructured meshes. And we suppose a moton sequence can be consdered as a collecton of key segments and transtonal segments. For each short acton scene formed up by a par of key segments, there should exst multple reasonable solutons. Whle a unque optmal soluton for the entre nteracton event could fnally be found n the ntegraton throughout the whole sequence. Generally, our mult-party nteracton edtng method conssts of three steps as () data segmentaton and temporal algnment, () ntra-key segment edtng by MHV-based constrant satsfacton and (3) nter-key segment global optmzaton. In order to make t more understandable, we frst gve clear defntons of these edtng-related terms as follows: ( ) Moton sequence: The whole sequence of the orgnal captured objects, n the form of 3D surface meshes. Let M = {V, E} denote the 3D mesh, then a moton sequence can be denoted as S = {M k k =,..., n k }. For our mult-party nteracton edtng, moton sequences of dfferent objects wll serve as the nput. ( ) Key segment: In each moton sequence, frames where nteractve motons happen are consdered to be key segment K = {M k k =,..., n k }. Snce the objects are supposed to perform motons that match wth each other, key segments should appear n pars from dfferent moton sequences. ( 3 ) Transtonal segment: Intermedate frames between key segments n the moton sequence, n whch no nteractve moton s stored. We use T = {M k k =,..., n k } to denote transtonal segments, and t should be noted that there can be no transtonal segment between two key segments. ( 4 ) Acton scene: Spatotemporally synchronzed short multparty nteracton scene syntheszed from a sngle par of key segments. ( 5 ) Interacton sequence: Spatotemporally synchronzed long mult-party nteracton sequence syntheszed by ntegratng all the key segment pars and transtonal segments n the orgnal moton sequences. 4. Data segmentaton and temporal algnment In ths research work, snce our man focus s on edtng multparty nteracton scenes nstead of recognzng them, the data segmentaton s performed manually by the edtor. Below are three crtera for selectng key segments: () Interactve motons should happen n each key segment, so that spatal and temporal constrants as defned n the nteracton dctonary exst wthn each key segment par. () The moton trend of the nterested volume should be undrectonal, whch wll ensure the smplcty of MHV n each key segment. (3) Multple key segments n one moton sequence should have no overlaps, and they need not to be adjacent. On the other hand, snce the potental nteractvely correspondng motons n the orgnal captured data would nevtably have temporal msmatches, the canddates n each selected moton segment par may also have dfferent lengths. Therefore, a temporal normalzaton s needed for buldng up comparable MHVs as follows: For a par of key segment K A and K B, f τ A > τ B, else, M A m = M A n (0 < m < τ B, n = m τa τ B ) () M B m = M B n (0 < m < τ A, n = m τa τ B ) (3) c 03 Informaton Processng Socety of Japan
5 IPSJ SIG Techncal Report τ (nv t A (x, y, z) nv t B (x, y, z)) = φ (5) t =0 Fg. 5 Mutual vsblty constrant. where τ A and τ B represent the duraton of K A and K B, MA n represents the nth frame n K A, and M A m represents the mth frame of the normalzed K A. x s the floor functon that returns the largest nteger not greater than x. Note that the same processng wll be appled to the transtonal segment pars as well. 4.3 Intra-key segment edtng 4.3. Edtor defned constrants After data segmentaton and temporal algnment, the nteractve motons of each object are organzed nto key segment pars, and nsde each par the two motons are scaled nto the same length. Then the MHVs of each object n each segment par can be computed as vτ A (x, y, z, t) and vτ B (x, y, z, t). For each nteracton event nsde a key segment par, the two nteractng objects should follow certan spatotemporal constrants based on () nteracton type, () mutual vsblty and (3) fdelty requrement. Frst for each key segment par the nteracton type should be decded by the user based on hs/her edtng ntenson, producng the spatotemporal constrant as s descrbed n Secton 3.. Second, for mult-party nteracton scenes, naturally the objects should be vsble for each other. We use the method of Sh [7] to compute the objects average gazng drecton durng the edtor-assgned frames. Then a vsual cone s generated for each object as VS A(x, y, z) and VS B (x, y, z), lookng from the average 3D poston of the center of the eyes nto the average gazng drecton. The detaled parameters (e.g. the cone angles) can be adjusted by the edtor as approprate. Then the mutual vsblty constrant can be descrbed as follows: (VS A (x, y, z) V B τ (x, y, z)) (VS B (x, y, z) V A τ (x, y, z)) φ (4) It should be noted that the vsblty constrant s an optonal constrant for the edtor, meanng that t s not always requred for each moment n the key segment par. Thrd, the fdelty requrement avods the unnatural fakeness, lke two object merge nto each other s body, from happenng. Let nv A τ (x, y, z, t) and nv B τ (x, y, z, t) denote the MHVs of the objects that should not contact n the nteracton event, then the fdelty constrant can be defned as follows: 4.3. Acton scene edtng usng constrant satsfacton Wth the edtor defned constrants, we compute the proper relatve poston of the objects by constrant satsfacton. Frst, the two objects are put nto the same world coordnate system. We fx the poston of vτ A (x, y, z, y, t) and then, sample the xy plane nto grd ponts, and each grd pont wll be further sampled by surroundng angles. Next, translate and rotate vτ B (x, y, z, t) onto each sampled poston and drecton, then test wth the edtor defned constrants. If for a sampled poston and drecton all the constrants are fulflled, then the dstance between the two objects L AB = C AC B wth the two reference angles θ A and θ B can be counted as one soluton for ths key segment par. Here C B denotes the relocated poston of C B n one sampled poston, and θ A, θb represents the ncluded angles between the average vewng drecton of each MHV and lne C AC B, respectvely. By testng all the sampled postons and drectons, for each key segment par a soluton group R AB = (L AB j, θ A j, θ B j ) wll be computed. 4.4 Inter-key segment optmzaton Havng computed the soluton groups for each key segment par, we wll combne them together wth the transtonal segments to synthesze a complete mult-party nteracton sequence, by () fndng the optmal soluton n each key segment par and () addng n the transtonal segments and performng path optmzaton Optmal soluton searchng for key segments Before edtng, suppose the postons of the MHVs root node n the world coordnate system are C A, CA,..., CA I, CB, CB,..., CB I, and the facng drectons of the MHVs n the world coordnate system are F A, F A,..., FI A, F B, F B,..., FI B. In order to make natural and smooth edtng, we should mantan the vectors C A CA + and C BCB + as much as possble to mnmze the artfcal offsets. As well, the facng drectons F A, F B should also be preserved. If we denote the edted deal postons of the MHVs root node as C A, C A,..., C I A, C B, C B,...,, the edted facng drectons C B I of the MHVs as F A, F A,..., FI A, F B, F B,..., FI B, and the angles between F A and C A C B as θ A, then we should search for the optmal soluton for each key segment par by fulfllng: and [ C A CA + C + A + C B CB + I mn = C A +λ( F A C B = LĀ B C A θ A F A + F B C B C+ B F B )] (6) = L A j B = C A j C B j (7) = θ A, θ B = θ B (8) here λ s a weghtng factor to balance the translaton and rotaton transformatons. The optmal soluton for all the key segments c 03 Informaton Processng Socety of Japan 5
6 IPSJ SIG Techncal Report can be computed by solvng functon (6), (7) and (8) usng dynamc programmng approach Path optmzaton for transtonal segments Havng found the optmal solutons for all the key segments, we then add n the transtonal segments and perform path optmzaton. Suppose nsde a transtonal segment, the orgnal postons of the object s center of masses for all the frames are C, C,..., Cm and the edted postons are denoted as. Whle orgnal and edted facng drectons are C, C,..., Cm. denoted respectvely as F, F,..., Fm and F, F,..., Fm (a) Image data of object A. Fg. 6 (b) Image data of object B. Separately captured mage data of two objects. Then we defne our objectve functon for performng path optmzaton as follows: f = m X [δ fa (C ) + ( δ)ωc fv (C ) = (a) (b) (c) (d) (e) (f) (g) (h) (9) +λ(δ fa (F ) + ( δ)ωf fv (F )] Specfcally, fa (C ) s defned as follows to preserve the orgnal acceleratons for each frame: C + C+ ) fa (C ) = (C C + C+ ) (C Fg. 7 Moton edtng results for short acton scenes. (0) and fv (C ) s defned as follows to preserve the orgnal speed for each frame: fv (C ) = C+ C C+ C () Besdes, ωc = + exp{α(v vk )} () ωf = + exp{α(r rk )} (3) Fg. 8 C C + C C+ v = (4) F F + F F+ r = (5) here vk and rk are constant parameters to be set by edtors. By mnmzng ths objectve functon we can perform path optmzaton onto all the transtonal segments and fnally, acqure a natural lookng spatotemporally synchronzed mult-party nteracton 3D Vdeo sequence for free-vewpont browsng. 5. Experment and evaluaton In ths secton we present an evaluaton of the proposed multparty nteracton edtng method wth real data. 5. Experment setup and pre-processng To prove the effectveness of our method, we prepared the 3D vdeo data of two professonal actors, separately captured by 5 calbrated XGA cameras runnng at 5 Hz wth msec shutter speed, and reconstructed wth frame-wse 3D shape reconstructon method. In the data, the two separately captured actors are performng a pre-desgned sword fghtng moton sequence, respectvely. Note that the reconstructed 3D shapes do not have a unfed 3D mesh model. Body part segmentaton and knematc models are not avalable ether. As a pre-processng, the data s manually segmented nto 9 c 03 Informaton Processng Socety of Japan (a) Frst-person-vew mage of ob- (b) Frst-person-vew mage of object A. ject B. Frst-person-vew mages rendered from the edtng result. key-segment pars and nsde each par the motons of the two objects are algned nto the same temporal length. After the preprocessng, the lengths of both moton sequences are resampled nto 45 frames. 5. Mult-party nteracton edtng results Wth the separately captured data, f we smply put them together nto the same coordnate system and match up ther begnnng frames manually, n the followng moton sequences varous spatotemporal msmatches wll occur, as s shown n Fgure 7(a)(d). On the other hand, the edtng results usng the proposed method are llustrated n Fgure 7(e)-(h). It can be clarfed that n each syntheszed nteracton scene, the relatve locaton of the two objects looks reasonable and they well qualfy the edtor defned spatotemporal constrants. In addton, Fgure 8 llustrate the frst-person-vew mages rendered from the edtng results, usng Sh s method[7]. It can be seen clearly that the two objects are nsde each other s vew, fulfllng the mutual vsblty constrant. 5.3 Processng cost of the proposed method The experment s conducted usng a PC wth Intel(R) Core(TM) Duo CPU, 3.00GHz. Under the samplng resoluton of 0mm, degree, the average computaton tme for each automatc process s as follows: ( ) MHV computaton for each object n a sngle segment:
7 IPSJ SIG Techncal Report mn ( ) Constrant satsfacton for each short acton scene: 5 mns ( 3 ) Optmal soluton searchng for each key segment par: 98 mns ( 4 ) Path optmzaton for each object n a sngle transtonal segment: 7 mns ( 5 ) Total tme cost: 87 mns Note that the computatons for each segment can be conducted parallelly nsde process,, Concluson In ths paper we presented a novel moton edtng method that syntheszes spatotemporally synchronzed mult-party nteracton 3D Vdeo scenes from separately captured data. By proposng the dea of MHV we can effectvely model the nteracton events of multple objects as well as representng the motons of a sngle object, based on whch the constrant satsfacton method can be appled to perform ntra-key segment edtng. An optmal soluton search and path optmzaton scheme s also desgned to mnmze the artfacts generated n the edtng and mantan the orgnal moton dynamcs as much as possble. Experments wth real data proved the effectveness and robustness of the proposed method. In our work, the data beng used s the unstructured 3D Vdeo data. However, snce our method only requres a sequence of 3D meshes as nput, t wll work for (Moton Capture Drven) CG data, whch has a unfed mesh model, as well. For further studes, we are plannng to perform the same edtng job usng CG data wth unfed mesh models, to examne how we can combne our spatotemporal edtng method wth conventonal knematc structure based methods together to acqure better results. Acknowledgement acton events from multple vewponts. EventVdeo0, pages 647, 00. [3] Ylmaz, A. and Shah, M.. Actons sketch: A novel acton representaton. CVPR05, pages I: , 005. [4] Hlton, A.. A Survey of Advances n Vson-Based Human Moton Capture and Analyss. Internatonal Journal on Computer Vson and Image Understandng, Vol.04, No.-3 :90-7, 006. [5] Nobuhara, S. and Matsuyama, T.. Deformable Mesh Model for Complex Mult-Object 3D Moton Estmaton from Mult-Vewpont Vdeo. The Thrd Internatonal Symposum on 3D Data Processng, Vsualzaton and Transmsson (3DPVT006), [6] Wenland, D., Ronfard, R. and Boyer E.. Free vew-pont acton recognton usng moton hstory volumes. COMPUTER VISION AND IM- AGE UNDERSTANDING (006). [7] Sh, Q., Nobuhara, S. and Matsuyama, T.. 3D Face Reconstructon and Gaze Estmaton from Mult-vew Vdeo usng Symmetry Pror. IPSJ Transactons on Computer Vson and Applcatons, Vol.4, pp.49-60, Ths study s supported by JSPS Ayame project Vsual Gesture Percepton. References [] Glecher, M.. Retargettng moton to new characters. SIGGRAPH 98: Proceedngs of the 5th annual conferenceon Computer graphcs and nteractve technques (998), ACM, pp [] Lee, J., Shn, S.Y.. A herarchcal approach to nteractve moton edtng for human-lke fgures. Proceedngs of SIGGRAPH 99 (999), pp [3] Muka, T., Kuryama, S.. Geostatstcal moton nterpolaton. ACM Transactons on Graphcs 4, 3 (005), [4] Tejera, A. and Hlton, A.. Space-tme edtng of 3D vdeo sequences. CVMP, 0 [5] Heck, R., Glecher, M.. Parametrc moton graphs. Proceedngs of Symposum on Interactve 3D Graphcs and Games (007), pp [6] Safonova, A., Hodgns, J.K.. Constructon and optmal search of nterpolated moton graphs. ACM Transactons on Graphcs 6, 3 (007), 06.. [7] Zordan, V.B.. Dynamc response for moton capture anmaton. ACM Trans. Graph., 4, 3, pp (005). [8] Ye, Y. and Lu, C.K.. Synthess of responsve moton usng a dynamc model. Comput. Graph. Forum, 9,, pp (00). [9] Green, R. and Guan, L.. Quantfyng and recognzng human movement patterns from monocular vdeo mages. IEEE transacton on Crcuts and Systems for Vdeo Technology, 4, February 004. [0] Alexe, A.E., Alexander, B., Greg, M., and Jtendra, M.. Recognzng acton at a dstance. ICCV, 003. [] Aaron, F.B. and James, W.D.. The recognton of human movement usng temporal templates. IEEE Trans. Pattern Anal. Mach. Intell., 3(3):57-67, 00. [] Syeda-Mahmood, T.F., Vaslescu, M.A.O. and Seth, S.. Recognton c 03 Informaton Processng Socety of Japan 7
Augmented Motion History Volume for Spatiotemporal Editing of 3D Video in Multi-party Interaction Scenes
ugmented Moton Hstory Volume for Spatotemporal Edtng of 3D Vdeo n Mult-party Interacton Scenes Qun Sh Shohe Nobuhara Takash Matsuyama Department of Intellgence Scence and Technology Graduate School of
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationReal-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 informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
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 A mathematcal programmng approach to the analyss, desgn and
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More informationCluster 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 informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationActive Contours/Snakes
Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng
More informationMotion-Capture-Based Avatar Control Framework in Third-Person View Virtual Environments
ACM SIGCHI Internatonal Conference on Advances n Computer Entertanment Technology 26 (ACE 26), Hollywood, U.S.A., June 26. Moton-Capture-Based Avatar Control Framework n Thrd-Person Vew Vrtual Envronments
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationProblem 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 informationTsinghua 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 informationLoad 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 informationThe 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 informationVideo Object Tracking Based On Extended Active Shape Models With Color Information
CGIV'2002: he Frst Frst European Conference Colour on Colour n Graphcs, Imagng, and Vson Vdeo Object rackng Based On Extended Actve Shape Models Wth Color Informaton A. Koschan, S.K. Kang, J.K. Pak, B.
More informationA 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 informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationSteps 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 informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationFitting: Deformable contours April 26 th, 2018
4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.
More informationModeling, 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 information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationAn 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 informationA Background Subtraction for a Vision-based User Interface *
A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton
More informationSimplification 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 informationIntegrated 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 informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationQuality 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 informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationSolving 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 informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationVectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationMulti-Touch Interface for Character Motion Control Using Example-Based Posture Synthesis
Mult-Touch Interface for Character Moton Control Usng Example-Based Posture Synthess Masak Oshta Kyushu Insttute of Technology 680-4 Kawazu, Izuka, Fukuoka 820-8502, Japan oshta@ces.kyutech.ac.jp Fgure
More informationFuzzy C-Means Initialized by Fixed Threshold Clustering for Improving Image Retrieval
Fuzzy -Means Intalzed by Fxed Threshold lusterng for Improvng Image Retreval NAWARA HANSIRI, SIRIPORN SUPRATID,HOM KIMPAN 3 Faculty of Informaton Technology Rangst Unversty Muang-Ake, Paholyotn Road, Patumtan,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationTPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints
TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationObject-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 informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationSolving Route Planning Using Euler Path Transform
Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n
More informationMODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAXIMIZE PRODUCT VARIETY AND MINIMIZE FAMILY COST
INTERNATIONAL CONFERENCE ON ENGINEERING DESIGN, ICED 07 28-31 AUGUST 2007, CITE DES SCIENCES ET DE L'INDUSTRIE, PARIS, FRANCE MODULE DESIGN BASED ON INTERFACE INTEGRATION TO MAIMIZE PRODUCT VARIETY AND
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationKIDS Lab at ImageCLEF 2012 Personal Photo Retrieval
KD Lab at mageclef 2012 Personal Photo Retreval Cha-We Ku, Been-Chan Chen, Guan-Bn Chen, L-J Gaou, Rong-ng Huang, and ao-en Wang Knowledge, nformaton, and Database ystem Laboratory Department of Computer
More informationCalibration of an Articulated Camera System with Scale Factor Estimation
Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More informationReport on On-line Graph Coloring
2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm
More informationLine-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video
01 IEEE Internatonal Conference on Robotcs and Automaton RverCentre, Sant Paul, Mnnesota, USA May 14-18, 01 Lne-based Camera Movement Estmaton by Usng Parallel Lnes n Omndrectonal Vdeo Ryosuke kawansh,
More informationF Geometric Mean Graphs
Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationMultiple Frame Motion Inference Using Belief Propagation
Multple Frame Moton Inference Usng Belef Propagaton Jang Gao Janbo Sh The Robotcs Insttute Department of Computer and Informaton Scence Carnege Mellon Unversty Unversty of Pennsylvana Pttsburgh, PA 53
More informationA Facet Generation Procedure. for solving 0/1 integer programs
A Facet Generaton Procedure for solvng 0/ nteger programs by Gyana R. Parja IBM Corporaton, Poughkeepse, NY 260 Radu Gaddov Emery Worldwde Arlnes, Vandala, Oho 45377 and Wlbert E. Wlhelm Teas A&M Unversty,
More informationAdaptive Selection of Rendering Primitives for Point Clouds of Large Scale Environments
Adaptve Selecton of Renderng Prmtves for Pont Clouds of Large Scale Envronments Taash Maeno, Hroa Date and Satosh Kana 3 Graduate School of Informaton Scence and Technology, Hoado Unversty, Japan t_maeno@sdm.ss.st.houda.ac.jp,
More informationDetermining 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 informationAccelerating X-Ray data collection using Pyramid Beam ray casting geometries
Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationTerm 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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationOverview. 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 informationLocal Quaternary Patterns and Feature Local Quaternary Patterns
Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents
More informationConfiguration Management in Multi-Context Reconfigurable Systems for Simultaneous Performance and Power Optimizations*
Confguraton Management n Mult-Context Reconfgurable Systems for Smultaneous Performance and Power Optmzatons* Rafael Maestre, Mlagros Fernandez Departamento de Arqutectura de Computadores y Automátca Unversdad
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationDynamic Camera Assignment and Handoff
12 Dynamc Camera Assgnment and Handoff Br Bhanu and Ymng L 12.1 Introducton...338 12.2 Techncal Approach...339 12.2.1 Motvaton and Problem Formulaton...339 12.2.2 Game Theoretc Framework...339 12.2.2.1
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationA Volumetric Approach for Interactive 3D Modeling
A Volumetrc Approach for Interactve 3D Modelng Dragan Tubć Patrck Hébert Computer Vson and Systems Laboratory Laval Unversty, Ste-Foy, Québec, Canada, G1K 7P4 Dens Laurendeau E-mal: (tdragan, hebert, laurendeau)@gel.ulaval.ca
More information