Human Tracking by Fast Mean Shift Mode Seeking


 Brett Eaton
 3 years ago
 Views:
Transcription
1 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL Human Trackng by Fast Mean Shft Mode Seekng [10 font sze blank 1] [10 font sze blank 2] C. Belezna Advanced Computer Vson GmbH  ACV, Venna, Austra Emal: [10 font sze blank 1] B. Frühstück Semens AG Österrech, Programm und Systementwcklung, Graz, Austra Emal: H. Bschof Insttute for Computer Graphcs and Vson, Graz Unversty of Technology, Graz, Austra Emal: [10 font sze blank 1] [10 font sze blank 2] [10 font sze blank 3] Abstract Change detecton by background subtracton s a common approach to detect movng foreground. The resultng dfference mage s usually thresholded to obtan objects based on pxel connectedness and resultng blob objects are subsequently tracked. Ths paper proposes a detecton approach not requrng the bnarzaton of the dfference mage. Local densty maxma n the dfference mage  usually representng movng objects  are outlned by a fast nonparametrc mean shft clusterng procedure. Object trackng s carred out by updatng and propagatng cluster parameters over tme usng the mode seekng property of the mean shft procedure. For occludng targets, a fast procedure determnng the object confguraton maxmzng mage lkelhood s presented. Detecton and trackng results are demonstrated for a crowded scene and evaluaton of the proposed trackng framework s presented. [9 font sze blank 1] Index Terms automated vsual survellance, moton detecton, mean shft clusterng, human trackng, occluson handlng [9 font sze blank 1] I. ITRODUCTIO Scenes of practcal nterest usually contan a large number of nteractng targets under dffcult magng condtons. In such crcumstances the task of relable object detecton and trackng becomes nontrval and obtanng a meanngful hghlevel representaton poses a challengng task. Human detecton and trackng systems proposed n recent years attempt to tackle ncreasngly complex scenaros. Moton detecton s an essental part of automated vsual survellance systems; however, relable segmentaton of movng regons nto ndvdual objects of Based on Human Trackng by Mode Seekng, by C. Belezna, B. Frühstück, and H. Bschof whch appeared n the Proceedngs of the 4th Internatonal Symposum on Image and Sgnal Processng and Analyss, Zagreb, Croata, September IEEE. Fgure 1. Blob analyss (a) typcally produces undersegmented results for humans n groups leadng to low detecton rates and poor trackng results (b). Image (c) llustrates the proposed detecton and trackng approach generatng sgnfcantly mproved results. nterest stll represents a great challenge. For nstance, blobbased moton segmentaton n the presence of nteractng targets typcally generates objects whch are under or oversegmented (see Fg.1.a and Fg.1.b). Blobbased moton segmentaton reles on thresholdng, where the threshold s a senstve parameter leadng to an mmedate decson whether a pxel belongs to a movng or nonmovng regon. Thresholdng elmnates relevant nformaton and moton segmentaton errors are dffcult to correct afterwards gven the poor qualty of bnary mages. In ths paper we propose a novel detecton and trackng scheme drectly operatng on the dfference mage obtaned by background subtracton. The method shows good trackng performance n crowded scenaros, even n the presence of a large overlap between objects. A fast varant of mean shft clusterng s appled to delneate objects and mode seekng along the densty gradent of the dfference mage s used to propagate and update object propertes. Upon occludng objects the optmal spatal arrangement,.e. the object confguraton s determned by searchng for the maxmum lkelhood estmate n the space of jontobject confguratons. The search employs a samplng scheme relyng on the mean
2 2 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 shft procedure and on prors wth respect to the number and sze of nvolved humans. The paper s organzed as follows: secton II descrbes related work. Secton III provdes a bref overvew on the appled fast mean shft procedure usng a unform kernel. Secton IV descrbes the mean shft clusterngbased object detecton technque. Secton V gves detals on the trackng algorthm based on mode propagaton and descrbes the occluson handlng scheme usng a smple human model. Secton VI provdes an algorthmc summary of the trackng system. Secton VII presents detecton and trackng results and ther performance evaluaton. Fnally, the paper s concluded n secton VIII. II. RELATED WORK Human detecton by blob analyss s used n many approaches [1]. However, nferrng the poston of ndvdual humans from the bnary segmentaton results by shape analyss [2] or by stochastc segmentaton [3] requres good segmentaton qualty n order to fnd landmark ponts such as heads or shoulders. Blobbased analyss can be complemented by appearance [4] or color nformaton [5], enablng a trackng system to better cope wth occlusons. Colorbased segmentaton [6] n crowded scenes can be also used for trackng f colors are dstnctve for dfferent ndvduals. Pece [7] proposed clusterng n the dfference mage usng mxtures of Gaussans and trackng by propagatng cluster parameters. Due to the Gaussan assumpton on the cluster shapes, nteractng and occludng targets are often clustered together. Our approach also performs dfference mage clusterng; however, wthout relyng on specfc assumptons wth respect to the dstrbuton of the data. Thus nearby densty maxma,.e. cluster centers are kept separate. Color or hstogram based trackng [8] performs mode seekng along the gradent of a hstogram smlarty functon. Our trackng approach adopts a smlar mode seekng strategy, but mode seekng n our case s performed to track densty maxma n the dfference mage. In the context of multple target trackng, partcle flterng recently appeared as a promsng technque [9]. It s capable to ntegrate dfferent mechansms, such as vsual object recognton [10], color trackng and occluson handlng [11]. Our work proposes a smple, computatonally effcent object detecton and multtarget trackng framework, whch can be also combned wth exstng detecton and trackng technques. III. THE FAST MEA SHIFT PROCEDURE Object detecton s performed by delneatng clusters n the dfference mage by the mean shft mode seekng procedure. The mean shft algorthm s a nonparametrc technque to locate densty extrema or modes of a gven dstrbuton by an teratve procedure [12]. Startng from a locaton x the local mean shft vector represents an offset to x', whch s a translaton towards the nearest mode along the drecton of maxmum ncrease n the underlyng densty functon. The local densty s estmated wthn the local neghborhood of a kernel by kernel densty estmaton where at a data pont a kernel weghts K(a) are combned wth weghts I(a) assocated wth the data. Fast computaton of the new locaton vector x' can be performed as n [13]: x' K'' K'' a ( a x) x ( a ( a x) ( a) a =, (1) where K'' represents the second dervatve of the kernel K, dfferentated wth respect to each dmenson of the mage space,.e. the x and ycoordnates. The functons x and are the double ntegrals,.e. twodmensonal ntegral mages [14] n the form of: and ( x) = I( x ) x (2) x x < x x < x ( x) = I( x ). (3) If the kernel K s unform wth bounded support, ts second dervatve becomes sparse contanng only four mpulse functons at ts corners. Thus, evaluatng a convoluton takes only the summaton of four corner values n the gven ntegral mage. To compute the mean shft vector at locaton x, the followng steps are performed: 1. three ntegral mages (defned n (2) and (3)) are precomputed n a sngle pass (see [14] and [15] for detals); 2. the expresson n (1) s evaluated usng only ten arthmetc operatons and twelve array accesses. The number of operatons s ndependent of the kernel sze, gven the sparse structure of K''. IV. MEA SHIFT CLUSTERIG The clusterng step s facltated by the use of a human sze model {H(x), W(x)}, where H and W denote human heght and wdth, respectvely. Ths nformaton s obtaned by a smple calbraton step. The prncpal steps of mean shft clusterng are performed analogously to the steps descrbed n [16]: 1. The dfference mage ntensty maxmum s mapped to unt ntensty and ts entre range s scaled proportonally. 2. A sample set of n ponts X 1 X n s defned by locatng local maxma  above a very low threshold T 1  n the dfference mage. The fnal result does not depend crtcally on T 1. A very low value just ncreases the run tme and generates more outlers whch can be elmnated durng the mode trackng step. )
3 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL sum magntudes { S 1, K, S }. An llustratve example k depctng these constructs s shown n Fg 2. At ths stage the detected clusters can be consdered as object canddates and probable outlers can be elmnated by mposng sze constrants on the sze of the attracton basns. V. CLUSTER TRACKIG Fgure 2. Example for fast mean shft based clusterng n a dfference mage (shown nverted). Obtaned clusters are delneated by rectangular basns of attracton (rectangles wth dashed lne). Cluster centers (black dots) and connected path pont sets (shown as lnes runnng towards cluster centers) are also shown. ote that some clusters are generated by nose and moton clutter. 3. The fast mean shft procedure s appled to the ponts of the sample set wth a wndow sze of (H(X ), W(X )) accordng to the local sze model. The mean shft procedure converges to the nearest mode typcally wthn 34 teratons. The mode seekng process delneates a path between the ntal pont of the sample set and the detected local mode canddate. Each mean shft teraton defnes a pont on the path, what we denote as a pathpont {PX}. Thus, each detected mode canddate locaton has an assocated set of pathponts {PX 1,, PX n }, not ncludng the mode tself. When the mean shft offset vector s computed accordng to (1), the area sum (.e. sum of pxel ntenstes) wthn the kernel (denomnator of the expresson n (1)) s also obtaned. The set of area sum magntudes {S 1,,S n } s useful to have snce t provdes nformaton on the magntude of the local densty and as we wll see later, t can be used n the occluson handlng step evaluatng a gven spatal confguraton of kernels. 4. Gven the fnte sze of the mean shft convergence crteron, detected mode canddate locatons  obtaned for the same peak of underlyng densty  mght slghtly devate. Detected mode canddates are lnked based on spatal proxmty: all detected modes wthn a wndow of the sze (W, H) are grouped together and a cluster center Y s obtaned by takng the mean of lnked canddate coordnates. Pathpont sets belongng to grouped mode canddates are also merged, such as the sets of area sum magntudes. The merged set of path ponts s used to delneate the cluster: a boundng box representaton of the basn of attracton s obtaned by determnng the spatal extrema of path ponts n x and ydrectons. The above clusterng process yelds followng nformaton for a gven cluster : a cluster center Y, a set of pathponts { PX 1, K, PX }, the basn of attracton k boundares n form of a boundng box and a set of area A. Trackng by Mode Seekng Movng objects of a scene usually represent movng local densty maxma n the correspondng sequence of dfference mages. The mode seekng property of the mean shft procedure mples that a mode can be pursued by a repettve mean shft procedure: for each mode dsplacement n the dfference mage  assumng that the nterframe dsplacement s much smaller than the kernel sze  the mode locaton can be repeatedly found. The prncpal advantages of ths trackng strategy are: 1. the data assocaton problem s solved mplctly, snce the mode seekng procedure s guded to the nearby mode along the steepest densty gradent; 2. t represents a smple and computatonally effcent technque, because only a few fast mean shft teratons are suffcent to redetect the object. Furthermore, the mode seekng process can be easly complemented by an underlyng moton model. The dsadvantage of the above strategy s that such a sequental mode seekng assumes the spatal dstnctveness of avalable modes. When several densty maxma are n spatal proxmty  such as n a dfference mage of a crowded scene contanng humans occludng each other , the dstrbuton locally mght become strongly nongaussan and mode canddates tend to exhbt coalescence, leadng to the breakdown of affected trackng processes. If objects n the orgnal mage and correspondng dfference mage densty extrema are spatally wellseparated, the mean shft mode seekng procedure can relably track them. In the ntal frame the entre dfference mage s evaluated by the fast mean shft clusterng algorthm as descrbed n secton IV. The obtaned cluster centers are then used n subsequent frames as the ponts of a new sample set X'. Startng from these ponts the fast mean shft procedure s carred out (usng the locallyscaled unform kernel of heght H(x) and wdth W(x)) locatng the nearby mode canddate whch corresponds to the new locaton of the movng object,.e. the new cluster center. For spatally solated mode canddates we do not compute addtonal cluster parameters, such as basn of attracton or pathponts, snce we assume that the underlyng dstrbuton vares only slghtly wth respect to ts shape. In the followng, the dfferent cases of the trackng framework are descrbed and a possble soluton for coalescng mode canddates s presented. B. Occluson Handlng If several objects meet and form a group, occluson  partal or complete  between the objects mght take
4 4 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 place. Such an event generates overlappng or very close densty extrema n the dfference mage. Typcally one specfc mode attracts all or most of the nearby mode seekng procedures. We denote ths phenomenon as "mode canddate stealng". The occurrence of mode canddate stealng can be easly detected, snce two or more mode canddates appear n close proxmty. Typcally, before movng objects form a group, they can be tracked separately, as descrbed n subsecton A. After each trackng step, t s examned whether at least another cluster center exsts wthn a wndow of (0.5H(x), 0.5W(x)) around a detected cluster center. If ths s the case, mode canddate stealng has occurred mplyng that the local confguraton of humans cannot be obtaned by mode seekng. In such stuatons we employ a Bayesan approach  smlarly to the technque descrbed n [3]  to fnd the local optmum confguraton of humans best explanng the dfference mage data I. Ths task can be stated as a modelbased segmentaton problem. We employ a very smple human shape model, a rectangular regon. Ths regon s equvalent to the kernel used n the mean shft procedure. All parameters (heght, wdth and orentaton) of the rectangular regon are known. The trackng algorthm provdes pror nformaton on the number of objects nvolved n the group formaton. Thus, the number of models needed to explan the data s also avalable. The search for * θ  the most probable confguraton consstng of objects  n the space of possble * confguratons θ becomes a maxmum lkelhood estmaton problem: * θ = arg maxθ P( I θ ). (4) The unknown parameters are the locatons of the humans {x,y } =1.. n the occluded state. When we detect mode canddate stealng, we perform the followng steps to fnd the optmum local confguraton of humans: 1. A new sample set of ponts by locatng local maxma s generated wthn a local mage regon spanned by the spatal extrema of nvolved object wndows. 2. Startng from these ponts fast mean shft teratons are carred out untl convergence (see Fg. 3, center). 3. The mean shft algorthm has the property that t runs along the path of the maxmum ncrease n the underlyng densty. Furthermore, the magntude of the mean shft offset correlates wth the local magntude of the densty gradent. These propertes have followng mplcatons: 1. the mean shft kernel becomes quckly centered on relevant data; 2. local plateaus or rdges on the densty surface are dstngushed by a large number of path ponts, PX (see secton IV). Our samplng procedure s guded by the path of mean shft runs. We use the path ponts as a canddate set of possble object locatons. We also make use of area sum magntudes S, whch are avalable at these locatons, obtaned as a "byproduct" of mean shft computaton. Fgure 3. Example llustratng the approach searchng for the most probable confguraton of humans n the presence of occluson. Left: Occluson between two humans shown n the nverted dfference mage. Center: Mean shft mode seekng s performed startng from a set of sample ponts. Obtaned path ponts (shown as dots) represent possble locatons of a human. Rght: the found optmum confguraton of the two humans for the gven mage regons. Ths strategy sgnfcantly reduces the search space and facltates the fast evaluaton of a gven confguraton. 4. The lkelhoods for ndvdual human hypotheses are not ndependent, snce nteroccluson between humans mght be present. Therefore the jont lkelhood for multple humans has to be formulated. A hypotheszed confguraton θ dvdes the dfference mage nto two mage regons: pxels explaned by the confguraton and pxels outsde of the confguraton. If M s the mage regon occuped by the th model, the unon of mage regons M = U = 1 M defnes a mask contanng all pxels explaned by the confguraton. Accordngly, M denotes the complementary regon outsde of the models (see Fg. 3). The local mage regon R around the occludng objects s gven by R = M U M. A confguraton maxmzng the lkelhood should fulfll followng crtera: 1. maxmzng the sum of ntenstes wthn the model regon M, whle 2. mnmzng the sum of ntenstes n M, outsde of the models. A loglkelhood functon expressng ths balance between the two quanttes can be formulated as: ( I θ ) a1 I( x) a ln P 2 I( x) x M x M x R x M A I( x) I( x), (5) usng the complementarty between M and M and the expermentally determned weght A. 5. The above quantty s evaluated for the confguratonθ. Fast evaluaton of the lkelhood expresson of (5) can be performed as follows: The sum of pxel ntenstes wthn the kernel centered at the th path pont,.e. the area sum S s obtaned durng the mean shft procedure. The frst term of (1) can be computed by: 1. takng the sum of area sums at the sampled locatons and 2. correctng for possble overlaps between hypotheszed models.
5 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL Snce the models are represented by rectangular regons wth sdes parallel to the mage border, the overlap regons can be easly computed. The maxmum number of possble overlaps between objects s ( 1). Then, the sum of pxel ntenstes n the regon 2 covered by models (frst term n (5)) can be computed as: x M = 1 I ( x) = S I( x), x V where V denotes the unon of overlappng regons. The unon of overlappng regons s determned by examnng the ntersectons between all overlap regons. Snce parwse overlaps span rectangular regons, therefore  usng the ntegral mage defned n (3)  the sum of pxel ntenstes wthn an overlap regon can be obtaned by three arthmetc operatons. The second term of (5)  representng the sum of pxel ntenstes n the entre regon R  s needed to be computed only once usng the ntegral mage. 6. Generally, n our scenaros the number of occludng humans s gven by a small number; usually two, rarely three objects form an occluded group. Typcally 512 path ponts are used for hypotheszng object locatons, thus n the worst case, evaluaton of a couple of thousand confguratons s necessary. The models of the best confguraton are assocated  usng a nearest neghbor crteron  wth the predcted cluster centers and trajectores are updated accordngly. When usng a blobbased detecton system, occlusons between objects often generate object mergng, renderng the trackng task dffcult. The presented approach provdes measurements even n the case of complete occluson between objects, due to the use of as pror. If the pror nformaton on s ncorrect  due to detecton or trackng falures  the error s propagated further, over the duraton of occluson events. Ths problematc ssue s not handled n the present approach. C. Appearance of ew Objects ew objects are detected usng a smple scheme. For all prevously detected objects, the dfference mage s reset to zero ntensty wthn the local kernel. The resdual dfference mage s analyzed agan for the exstence of clusters, as descrbed n secton IV. Coalescence of a newlycreated cluster wth a nearby cluster ndcates that the appearng object s dentcal wth an exstng object: n such cases the appearng object s deleted. D. Object Dsappearance If the mean shft offset for a tracked object remans zero over a gven tme perod, three possbltes exst: 1. the object has come to a full stop, 2. the object s generated by nose or clutter, 3. the object has dsappeared. (6) To evaluate such a case, the dfference mage regon wthn the object kernel s examned. A new set of sample ponts s generated by selectng local maxma and a clusterng step accordng secton IV s carred out. The basn of attracton of the cluster s delneated. If the dmensons of the basn of attracton sgnfcantly devate from the local scalng of a human, the object s deleted. VI. ALGORITHMIC SUMMARY The algorthm of cluster center trackng proceeds accordng to the followng man steps: 1. Integral mages (2) and (3) are computed n a sngle pass. 2. Performng clusterng n the ntal frame of the dfference mage. Cluster attrbutes (cluster center, basn of attracton, set of path ponts and area sums) are determned. 3. Interframe cluster center trackng by fast mean shft procedure. A lnear moton model s appled. 4. Testng for coalescence between mode canddates. If mode canddate stealng s detected, the most probable confguraton s searched usng the number of nvolved objects as prors. 5. Testng for appearance of new objects 6. Testng for dsappearance of objects. The cluster center trackng algorthm performs fast cluster center propagaton for spatally solated objects, and  n the case of occlusons  a computatonally effcent scheme proposes the optmum confguraton of occludng objects. VII. RESULTS AD DISCUSSIO Background dfferencng was carred out applyng a moton detecton technque [17] usng an adaptve background model. One sequence (4600 frames, resoluton: pxels) depctng a scene of walkng people was selected for evaluaton. The humans n the scene cast shadows and moton clutter n form of a movng flag and movng vegetaton s present (see Fg. 4). The sequence was processed by the proposed trackng approach (Fg. 4.b) and also by a common blobbased trackng algorthm (Fg. 4.a). Blobbased detecton was based on the method descrbed n [17]. The blob trackng algorthm generated a new trajectory hypothess each tme when a new blob object appeared n the mage. Blob objects and exstng track hypotheses were matched by computng the overlap between ther boundng boxes. A lnear moton model was assumed. Durng occlusons hypotheszed trajectores were solely guded by the moton model. Trackng results obtaned for the proposed tracker show that t copes well wth occlusons and shadows. Trajectores reman stable for all the targets, as t can be seen n Fg. 4.b. Occlusons between two and rarely between three persons are resolved successfully usng the proposed modelbased occluson handlng scheme. Shadows are detected as solated mode canddates. In the subsequent cluster delneaton step (see secton IV) these
6 6 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 TABLE I. HUMA DETECTIO PERFORMACE FOR A BLOBBASED AD FOR THE PROPOSED APPROACH Performance measures Blobbased approach Proposed approach Detecton rate 38% 94% False alarm rate 32% 37% Mean spatal devaton between detected humans and ground truth 31% 14% umber of evaluated frames 3990 Total number of vald humans n the ground truth Fgure 4. Trackng results n the case of a (a) blobbased trackng approach and (b) for the proposed trackng scheme. mode canddates are elmnated based on the extent of the correspondng basns of attracton. ote, that shadows n ths sequence are orented nearly horzontally, thus ther elmnaton based on geometrc constrants works well. In cases where the shape and orentaton of shadows s smlar to those of the humans n the scene, shadows are detected and tracked as vald mode canddates. Blobbased trackng (Fg. 4.a) yelds only trajectory segments and trajectores representng the moton of humans n groups. Blob detecton reles on connected component analyss, whch leads to poor object segmentaton qualty n the case of overlappng humans and/or shadows. Segmented blob boundares are shown n Fg. 4.a as whte boundng boxes. Trackng falures arse from the undersegmented objects and due to the lack of measurement update durng occlusons. In order to quanttatvely assess the detecton performance, detecton results were compared to a ground truth. As ground truth, the boundng boxes of humans were determned manually for a number of frames (see Table I). Humans wth more than 50% vsble parts were consdered as vald objects. Correct detecton was assumed when the centrod of the detected human was nsde of the ground truth boundng box. A onetoone mappng between detectons and ground truth data was enforced. Trackng by mode seekng acheves a hgh detecton rate of 94%, whle generatng a false alarm rate of 37% (see Table I). The hgh detecton rate s due to the modeldrven clusterng and occluson handlng provdng accurate locatons for humans even durng occlusons. The hgh false alarm rate s generated by the permanent moton clutter caused by flag and vegetaton movements. Clusters of these movng regons are not dstngushable from humans by the proposed method. The blobbased detecton approach produces poor results for the test sequence gven the frequent occurrence of undersegmented groups and humans wth shadows. The amount of false alarms s slghtly lower, snce large connected movng regons count as a sngle detected blob, whereas the modelbased approach explans them as a group of objects. The mean spatal devaton (see Table I) of detecton results was evaluated by computng the dstance n the mage space between the ground truth centrods and the centrods of matchng detectons. Ths dstance s normalzed by the local heght model H(x). As t can be seen from the table, blob detecton locatons are hghly naccurate, snce detectons are off by ca. 30% of the human heght. The large amount of spatal errors s agan due to undersegmented objects. Mean shft based detecton produces smaller errors mplyng that detected objects concde well spatally wth ground truth objects. In order to evaluate the trackng performance, a partcular ground truth trajectory undergong several occlusons was selected. Ths ground truth was compared to the trajectores generated by the blobbased and proposed trackng scheme. Trajectores obtaned for the two dfferent trackng algorthms are shown n Fg. 5 together wth the ground truth trajectory. Errors n terms of the spatal dstance measured n pxels wth respect to the ground truth trajectory are shown n Fg. 6 for the blobbased and for the proposed trackng approaches. The target tracked by mean shft mode seekng remans close to the ground truth target poston for the entre track duraton. The trajectory obtaned by the blobbased approach, however, devates sgnfcantly from the ground truth trajectory. In ths case, the tracked target s defned most of the tme by a group
7 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL Fgure 5. Trajectores llustratng the ground truth trajectory and the trajectores obtaned by blobtrackng and by modeseekng for a partcular human (marked by a rectangle). Fgure 7. Example frame showng trackng results for another sequence, where occasonal shortterm occlusons by scene objects occur. correspondng to local densty maxma n the dfference mage. Furthermore we show, how detected mode canddates can be tracked usng the mode seekng property of the mean shft algorthm. A computatonally effcent strategy to locate occludng humans s presented. Stable trackng results n a challengng scene depctng frequent occlusons are acheved showng sgnfcantly mproved results when compared to a blobbased human detector. ACKOWLEDGMET Ths work has been carred out wthn the Kplus Competence Center Advanced Computer Vson. Ths work was funded from the K plus Program. Fgure 6. The spatal trackng error (wth respect to a manuallydetermned ground truth trajectory) for blobbased trackng (gray lne) and for trackng usng mode seekng (dark lne). The trajectores are shown n Fg. 5. of people leadng to a permanent offset n the centrod poston of the target. Trackng results for another mage sequence (resoluton: pxels) are shown n Fg.7. Ths scene contans occasonal occlusons between scene objects and humans. The proposed trackng approach can not cope wth shortterm occlusons. In such cases trajectores termnate upon occluson and rentalze after occluson. The proposed trackng approach runs n realtme (812 fps) on a 2.5 GHz PC for all of the presented sequences. VIII. COCLUSIOS Ths paper presents a novel approach to detect and track humans n realtme n crowded scenes based on a fast varant of the mean shft procedure. We demonstrate how mean shftbased clusterng  relyng on a kernel of predefned sze  can effcently delneate objects REFERECES [1] I. Hartaoglu, D. Harwood and L. S. Davs, W4: Real Tme Survellance of People and Ther Actvtes, IEEE Trans. Pattern Anal. Mach. Intell., 22(8), pp , [2] Y. Kuno, T. Watanabe, Y. Shmosakoda and S. akagawa, Automated Detecton of Human for Vsual Survellance System, Int. Conf. on Pattern Recognton, C92.2, August [3] T. Zhao and R. evata, Bayesan Human Segmentaton n Crowded Stuatons, IEEE Conference on Computer Vson and Pattern Recognton, pp , June [4] A. W. Senor, Trackng wth Probablstc Appearance Models, ECCV Workshop on Performance Evaluaton of Trackng and Survellance Systems, pp , June [5] T. Yang, Q. Pan and J. L, Realtme multple objects trackng wth occluson handlng n dynamc scenes, IEEE Conference on Computer Vson and Pattern Recognton, Vol. 1, pp , June [6] A. Elgammal, R. Duraswam and L. S. Davs, Effcent nonparametrc adaptve color modelng usng fast gauss transform, Proc. IEEE Conf. Computer Vson and Pattern Recognton, pp , December [7] A. E. C. Pece, Trackng by Cluster Analyss of Image Dfferences, Proc. 8th Int. Symposum on Intellgent Robotc Systems, July 2000.
8 8 JOURAL OF MULTIMEDIA, VOL. 1, O. 1, APRIL 2006 [8] D. Comancu, V. Ramesh and P. Meer, KernelBased Object Trackng, IEEE Trans. Pattern Anal. Mach. Intell., 25(5), pp , [9] S. Maskell, M. Rollason,. Gordon and D. Salmond, Effcent Multtarget Trackng usng Partcle Flters, Journal Image and Vson Computng, 21(10), pp , September [10] K. Okuma, A. Taleghan,. de Fretas, J.J. Lttle and D. G. Lowe, A Boosted Partcle Flter: Multtarget Detecton and Trackng, In European Conference on Computer Vson, May [11] Y. Ca,. de Fretas and J.J. Lttle, Robust Vsual Trackng for Multple Targets, In European Conference on Computer Vson, May [12] D. Comancu and P. Meer, Mean Shft Analyss and Applcatons, IEEE Int. Conf. Computer Vson, pp , [13] C. Belezna, B. Frühstück and H. Bschof, Trackng Multple Humans usng Fast Mean Shft Mode Seekng, IEEE Internatonal Workshop on Vsual Survellance and Performance Evaluaton of Trackng and Survellance, pp , January [14] P. Vola and M. Jones, Rapd Object Detecton usng a Boosted Cascade of Smple Features, Proc. IEEE Conf. Computer Vson and Pattern Recognton, vol. 1, pp , [15] C. Belezna, B. Frühstück, H. Bschof and W. Kropatsch, Detectng Humans n Groups usng a Fast Mean Shft Procedure, Proc. of the 28th Workshop of the Austran Assocaton for Pattern Recognton, pp , [16] D. Comancu and P. Meer, Mean Shft: A Robust Approach Toward Feature Space Analyss, IEEE Trans. Pattern Anal. Mach. Intell., 24(5), pp , [17] R. Collns, A. Lpton, T. Kanade, H. Fujyosh, D. Duggns, Y. Tsn, D. Tollver,. Enomoto and O. Hasegawa, A System for Vdeo Survellance and Montorng: VSAM Fnal Report, Techncal Report CMURITR0012, Robotcs Insttute, Carnege Mellon Unversty, [9 font fze blank 1] [9 font fze blank 2] [9 font fze blank 3] [9 font fze blank 4] [9 font fze blank 5] Csaba Belezna graduated from the Techncal Unversty of Ilmenau n He receved hs Ph.D. degree n physcs from the Claude Bernard Unversty, Lyon n C. Belezna joned the K+ Competence Center Advanced Computer Vson n 2000 as a research scentst. Snce 2005 he s Keyresearcher at the competence center responsble for research actvtes n the area of Survellance and trackng. Hs research nterests nclude survellance, vsual object recognton and statstcal methods n computer vson. [9 font fze blank 1] [9 font fze blank 2] [9 font fze blank 3] Bernhard Frühstück receved hs M.S. degree n telematcs from the Graz Unversty of Technology n B. Frühstück joned Semens PSE, Graz n 2000 as a research staff member workng n the feld of bometrcs and mage processng. Hs prmary nterests nclude mage processng related to bometrc and ndustral applcatons. [9 font fze blank 1] [9 font fze blank 2] [9 font fze blank 3] Horst Bschof receved hs M.S. and Ph.D. degree n computer scence from the Venna Unversty of Technology n 1990 and 1993, respectvely. In 1998 he got hs Habltaton (vena docend) for appled computer scence. Currently he s Professor for Computer Vson at the Insttute for Computer Graphcs and Vson at Graz Unversty of Technology, Austra. H. Bschof s Keyresearcher at the K+ Competence Center Advanced Computer Vson where he s responsble for research projects n the area on Statstcal methods and learnng. He s member of the scentfc board of the K+ centers VrVs (Vrtual realty and vsualzaton) and Know (Knowledge management). He s vcepresdent of the Austran Assocaton for Pattern Recognton. The research nterests nclude, learnng and adaptve methods for computer vson, object recognton, survellance, robotcs and medcal vson, where Horst Bschof has publshed more than 260 revewed scentfc papers. Horst Bschof s program cochar of ECCV 2006 to be held n Graz. He was cocharman of nternatonal conferences (ICA 2001, DAGM 1994), and local organzer for ICPR Currently he s Assocate Edtor for the journals Pattern Recognton, and Computer and Informatcs.
Detecting Global Motion Patterns in Complex Videos
Detectng Global Moton Patterns n Complex Vdeos Mn Hu, Saad Al, Mubarak Shah Computer Vson Lab, Unversty of Central Florda {mhu,sal,shah}@eecs.ucf.edu Abstract Learnng domnant moton patterns or actvtes
More informationA machine vision approach for detecting and inspecting circular parts
A machne vson approach for detectng and nspectng crcular parts DuMng Tsa Machne Vson Lab. Department of Industral Engneerng and Management YuanZe Unversty, ChungL, Tawan, R.O.C. Emal: edmtsa@saturn.yzu.edu.tw
More informationFace Verification Problem. Face Recognition Problem. Application: Access Control. Biometric Authentication. Face Verification (1:1 matching)
Face Recognton Problem Face Verfcaton Problem Face Verfcaton (1:1 matchng) Querymage face query Face Recognton (1:N matchng) database Applcaton: Access Control www.vsage.com www.vsoncs.com Bometrc Authentcaton
More informationVehicle Detection and Tracking in Video from Moving Airborne Platform
Journal of Computatonal Informaton Systems 10: 12 (2014) 4965 4972 Avalable at http://www.jofcs.com Vehcle Detecton and Trackng n Vdeo from Movng Arborne Platform Lye ZHANG 1,2,, Hua WANG 3, L LI 2 1 School
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationCS 2750 Machine Learning. Lecture 17a. Clustering. CS 2750 Machine Learning. Clustering
Lecture 7a Clusterng Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square Clusterng Groups together smlar nstances n the data sample Basc clusterng problem: dstrbute data nto k dfferent groups such that
More informationAn Enhanced SuperResolution System with Improved Image Registration, Automatic Image Selection, and Image Enhancement
An Enhanced SuperResoluton System wth Improved Image Regstraton, Automatc Image Selecton, and Image Enhancement YuChuan Kuo ( ), ChenYu Chen ( ), and ChouShann Fuh ( ) Department of Computer Scence
More informationNonlinear data mapping by neural networks
Nonlnear data mappng by neural networks R.P.W. Dun Delft Unversty of Technology, Netherlands Abstract A revew s gven of the use of neural networks for nonlnear mappng of hgh dmensonal data on lower dmensonal
More informationEye Center Localization on a Facial Image Based on MultiBlock Local Binary Patterns
Eye Center Localzaton on a Facal Image Based on MultBloc Local Bnary Patterns Anatoly tn, Vladmr Khryashchev, Olga Stepanova Yaroslavl State Unversty Yaroslavl, Russa anatolyntnyar@gmal.com, vhr@yandex.ru,
More informationCONSISTENT VEHICLES TRACKING BY USING A COOPERATIVE DISTRIBUTED VIDEO SURVEILLANCESYSTEM
Internatonal Research Journal of Appled and Basc Scences 2013 Avalable onlne at www.rjabs.com ISSN 2251838X / Vol, 4 (12):36583663 Scence Explorer Publcatons CONSISTENT VEHICLES TRACKING BY USING A COOPERATIVE
More informationAn interactive system for structurebased ASCII art creation
An nteractve system for structurebased ASCII art creaton Katsunor Myake Henry Johan Tomoyuk Nshta The Unversty of Tokyo Nanyang Technologcal Unversty Abstract NonPhotorealstc Renderng (NPR), whose am
More informationA Multimode Image Tracking System Based on Distributed Fusion
A Multmode Image Tracng System Based on Dstrbuted Fuson Ln zheng Chongzhao Han Dongguang Zuo Hongsen Yan School of Electroncs & nformaton engneerng, X an Jaotong Unversty X an, Shaanx, Chna Lnzheng@malst.xjtu.edu.cn
More informationI. SCOPE, APPLICABILITY AND PARAMETERS Scope
D Executve Board Annex 9 Page A/R ethodologcal Tool alculaton of the number of sample plots for measurements wthn A/R D project actvtes (Verson 0) I. SOPE, PIABIITY AD PARAETERS Scope. Ths tool s applcable
More informationA Suspect Vehicle Tracking System Based on Video
3rd Internatonal Conference on Multmeda Technology ICMT 2013) A Suspect Vehcle Trackng System Based on Vdeo Yad Chen 1, Tuo Wang Abstract. Vdeo survellance systems are wdely used n securty feld. The large
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationMultivariate EWMA Control Chart
Multvarate EWMA Control Chart Summary The Multvarate EWMA Control Chart procedure creates control charts for two or more numerc varables. Examnng the varables n a multvarate sense s extremely mportant
More informationVision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION
Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble
More informationL10: Linear discriminants analysis
L0: Lnear dscrmnants analyss Lnear dscrmnant analyss, two classes Lnear dscrmnant analyss, C classes LDA vs. PCA Lmtatons of LDA Varants of LDA Other dmensonalty reducton methods CSCE 666 Pattern Analyss
More informationVehicle Detection, Classification and Position Estimation based on Monocular Video Data during Nighttime
Vehcle Detecton, Classfcaton and Poston Estmaton based on Monocular Vdeo Data durng Nghttme Jonas Frl, Marko H. Hoerter, Martn Lauer and Chrstoph Stller Keywords: Automotve Lghtng, Lghtbased Drver Assstance,
More informationMultiplePeriod Attribution: Residuals and Compounding
MultplePerod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens
More informationConversion between the vector and raster data structures using Fuzzy Geographical Entities
Converson between the vector and raster data structures usng Fuzzy Geographcal Enttes Cdála Fonte Department of Mathematcs Faculty of Scences and Technology Unversty of Combra, Apartado 38, 3 454 Combra,
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationDistributed MultiTarget Tracking In A SelfConfiguring Camera Network
Dstrbuted MultTarget Trackng In A SelfConfgurng Camera Network Crstan Soto, B Song, Amt K. RoyChowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
More informationHuman behaviour analysis and event recognition at a point of sale
Human behavour analyss and event recognton at a pont of sale R. Scre MIRANE S.A.S. Cenon, France scre@labr.fr H. Ncolas LaBRI, Unversty of Bordeaux Talence, France ncolas@labr.fr Abstract Ths paper presents
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationColocalization of Fluorescent Probes
Colocalzaton of Fluorescent Probes APPLICATION NOTE #1 1. Introducton Fluorescence labelng technques are qute useful to mcroscopsts. Not only can fluorescent probes label subcellular structures wth a
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationMACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION
MACHINE VISION SYSTEM FOR SPECULAR SURFACE INSPECTION: USE OF SIMULATION PROCESS AS A TOOL FOR DESIGN AND OPTIMIZATION R. SEULIN, F. MERIENNE and P. GORRIA Laboratore Le2, CNRS FRE2309, EA 242, Unversté
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationBrigid Mullany, Ph.D University of North Carolina, Charlotte
Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte
More informationGender Classification for RealTime Audience Analysis System
Gender Classfcaton for RealTme Audence Analyss System Vladmr Khryashchev, Lev Shmaglt, Andrey Shemyakov, Anton Lebedev Yaroslavl State Unversty Yaroslavl, Russa vhr@yandex.ru, shmaglt_lev@yahoo.com, andrey.shemakov@gmal.com,
More informationSingle and multiple stage classifiers implementing logistic discrimination
Sngle and multple stage classfers mplementng logstc dscrmnaton Hélo Radke Bttencourt 1 Dens Alter de Olvera Moraes 2 Vctor Haertel 2 1 Pontfíca Unversdade Católca do Ro Grande do Sul  PUCRS Av. Ipranga,
More informationAryabhata s Root Extraction Methods. Abhishek Parakh Louisiana State University Aug 31 st 2006
Aryabhata s Root Extracton Methods Abhshek Parakh Lousana State Unversty Aug 1 st 1 Introducton Ths artcle presents an analyss of the root extracton algorthms of Aryabhata gven n hs book Āryabhatīya [1,
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationA MultiCamera System on PCCluster for Realtime 3D Tracking
The 23 rd Conference of the Mechancal Engneerng Network of Thaland November 4 7, 2009, Chang Ma A MultCamera System on PCCluster for Realtme 3D Trackng Vboon Sangveraphunsr*, Krtsana Uttamang, and
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationA FASTER EXTERNAL SORTING ALGORITHM USING NO ADDITIONAL DISK SPACE
47 A FASTER EXTERAL SORTIG ALGORITHM USIG O ADDITIOAL DISK SPACE Md. Rafqul Islam +, Mohd. oor Md. Sap ++, Md. Sumon Sarker +, Sk. Razbul Islam + + Computer Scence and Engneerng Dscplne, Khulna Unversty,
More informationLogistic Regression. Lecture 4: More classifiers and classes. Logistic regression. Adaboost. Optimization. Multiple class classification
Lecture 4: More classfers and classes C4B Machne Learnng Hlary 20 A. Zsserman Logstc regresson Loss functons revsted Adaboost Loss functons revsted Optmzaton Multple class classfcaton Logstc Regresson
More informationHallucinating Multiple Occluded CCTV Face Images of Different Resolutions
In Proc. IEEE Internatonal Conference on Advanced Vdeo and Sgnal based Survellance (AVSS 05), September 2005 Hallucnatng Multple Occluded CCTV Face Images of Dfferent Resolutons Ku Ja Shaogang Gong Computer
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationDescriptive Models. Cluster Analysis. Example. General Applications of Clustering. Examples of Clustering Applications
CMSC828G Prncples of Data Mnng Lecture #9 Today s Readng: HMS, chapter 9 Today s Lecture: Descrptve Modelng Clusterng Algorthms Descrptve Models model presents the man features of the data, a global summary
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationFREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES
FREQUENCY OF OCCURRENCE OF CERTAIN CHEMICAL CLASSES OF GSR FROM VARIOUS AMMUNITION TYPES Zuzanna BRO EKMUCHA, Grzegorz ZADORA, 2 Insttute of Forensc Research, Cracow, Poland 2 Faculty of Chemstry, Jagellonan
More informationShadow Elimination Method for Video Surveillance
Vol 3, No 7 Modern Appled Scence Shadow Elmnaton Method for Vdeo Survellance Huaqang Lu Department of Physcs Lny Normal Unversty Lny 276005, Chna Emal: huaqang1019@163com Feng Guo College of Engneerng
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (5357) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng BüyükbakkalköyIstanbul
More informationLETTER IMAGE RECOGNITION
LETTER IMAGE RECOGNITION 1. Introducton. 1. Introducton. Objectve: desgn classfers for letter mage recognton. consder accuracy and tme n takng the decson. 20,000 samples: Startng set: mages based on 20
More informationDamage detection in composite laminates using cointap method
Damage detecton n composte lamnates usng contap method S.J. Km Korea Aerospace Research Insttute, 45 EoeunDong, YouseongGu, 35333 Daejeon, Republc of Korea yaeln@kar.re.kr 45 The contap test has the
More informationThe Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets
. The Magnetc Feld Concepts and Prncples Movng Charges All charged partcles create electrc felds, and these felds can be detected by other charged partcles resultng n electrc force. However, a completely
More informationCourse outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy
Fnancal Tme Seres Analyss Patrck McSharry patrck@mcsharry.net www.mcsharry.net Trnty Term 2014 Mathematcal Insttute Unversty of Oxford Course outlne 1. Data analyss, probablty, correlatons, vsualsaton
More informationNONLINEAR MULTIMODAL OBJECT TRACKING BASED ON 2D LIDAR DATA
Metrol. Meas. Syst. Vol. XVI (009), No 3, pp. 359369 METROLOGY AND MEASUREMENT SYSTEMS Index 330930, ISSN 086089 www.metrology.pg.gda.pl NONLINEAR MULTIMODAL OBJECT TRACKING BASED ON D LIDAR DATA Mchael
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationRealistic Image Synthesis
Realstc Image Synthess  Combned Samplng and Path Tracng  Phlpp Slusallek Karol Myszkowsk Vncent Pegoraro Overvew: Today Combned Samplng (Multple Importance Samplng) Renderng and Measurng Equaton Random
More informationIMPACT ANALYSIS OF A CELLULAR PHONE
4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng
More informationAdaptive Fractal Image Coding in the Frequency Domain
PROCEEDINGS OF INTERNATIONAL WORKSHOP ON IMAGE PROCESSING: THEORY, METHODOLOGY, SYSTEMS AND APPLICATIONS 222 JUNE,1994 BUDAPEST,HUNGARY Adaptve Fractal Image Codng n the Frequency Doman K AI UWE BARTHEL
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationCS 2750 Machine Learning. Lecture 3. Density estimation. CS 2750 Machine Learning. Announcements
Lecture 3 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 5329 Sennott Square Next lecture: Matlab tutoral Announcements Rules for attendng the class: Regstered for credt Regstered for audt (only f there
More informationRESEARCH ON DUALSHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9 July, 007 RESEARCH ON DUALSHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationTexture Analysis and Modified Level Set Method for Automatic Detection of Bone Boundaries in Hand Radiographs
Texture Analyss and Modfed Level Set Method for Automatc Detecton of Bone Boundares n Hand Radographs Syaful Anam Graduate School of Scence and Engneerng Yamaguch Unversty Yamaguch, Japan Department of
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationA hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm
Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):18841889 Research Artcle ISSN : 09757384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel
More informationWho are you with and Where are you going?
Who are you wth and Where are you gong? Kota Yamaguch Alexander C. Berg Lus E. Ortz Tamara L. Berg Stony Brook Unversty Stony Brook Unversty, NY 11794, USA {kyamagu, aberg, leortz, tlberg}@cs.stonybrook.edu
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationTracking with NonLinear Dynamic Models
CHAPTER 2 Trackng wth NonLnear Dynamc Models In a lnear dynamc model wth lnear measurements, there s always only one peak n the posteror; very small nonlneartes n dynamc models can lead to a substantal
More informationGRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM
GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM BARRIOT JeanPerre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jeanperre.barrot@cnes.fr 1/Introducton The
More informationSIX WAYS TO SOLVE A SIMPLE PROBLEM: FITTING A STRAIGHT LINE TO MEASUREMENT DATA
SIX WAYS TO SOLVE A SIMPLE PROBLEM: FITTING A STRAIGHT LINE TO MEASUREMENT DATA E. LAGENDIJK Department of Appled Physcs, Delft Unversty of Technology Lorentzweg 1, 68 CJ, The Netherlands Emal: e.lagendjk@tnw.tudelft.nl
More informationMultiRobot Tracking of a Moving Object Using Directional Sensors
MultRobot Trackng of a Movng Object Usng Drectonal Sensors Xaomng Hu, Karl H. Johansson, Manuel Mazo Jr., Alberto Speranzon Dept. of Sgnals, Sensors & Systems Royal Insttute of Technology, SE 44 Stockholm,
More informationAn Algorithm for DataDriven Bandwidth Selection
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 25, NO. 2, FEBRUARY 2003 An Algorthm for DataDrven Bandwdth Selecton Dorn Comancu, Member, IEEE Abstract The analyss of a feature space
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationRisk Model of LongTerm Production Scheduling in Open Pit Gold Mining
Rsk Model of LongTerm Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,
More informationHYPOTHESIS TESTING OF PARAMETERS FOR ORDINARY LINEAR CIRCULAR REGRESSION
HYPOTHESIS TESTING OF PARAMETERS FOR ORDINARY LINEAR CIRCULAR REGRESSION Abdul Ghapor Hussn Centre for Foundaton Studes n Scence Unversty of Malaya 563 KUALA LUMPUR Emal: ghapor@umedumy Abstract Ths paper
More informationProperties of Indoor Received Signal Strength for WLAN Location Fingerprinting
Propertes of Indoor Receved Sgnal Strength for WLAN Locaton Fngerprntng Kamol Kaemarungs and Prashant Krshnamurthy Telecommuncatons Program, School of Informaton Scences, Unversty of Pttsburgh Emal: kakst2,prashk@ptt.edu
More informationVEHICLE DETECTION BY USING REAR PARTS AND TRACKING SYSTEM
IJRET: Internatonal Journal of Research n Engneerng and Technology eissn: 23191163 pissn: 23217308 VEHICLE DETECTION BY USING REAR PARTS AND TRACKING SYSTEM Yogn Ashokrao Kanhegaonkar 1, Jagtap Rupal
More informationAugmented Reality Based Building Design Exhibition on DROID
EECS 598 Advanced Topcs n Moble Computer Vson Course Project Fnal Report Augmented Realty Based Buldng Desgn Exhbton on DROID Chen Feng, PhD Student, Department of Cvl and Envronmental Engneerng, Unversty
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationVehicle Tracking Using Particle Filter for Parking Management System
2014 4th Internatonal Conference on Artfcal Intellgence wth Applcatons n Engneerng and Technology Vehcle Trackng Usng Partcle Flter for Parkng Management System Kenneth Tze Kn Teo, Renee Ka Yn Chn, N.S.V.
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationAutomated Mobile ph Reader on a Camera Phone
Automated Moble ph Reader on a Camera Phone B.Y. Loh, N.K. Vuong, S. Chan and C.. Lau AbstractA robust classfcaton algorthm that apples color scence and mage processng technques s developed to automatcally
More informationAPPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT
APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedocho
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationTechniques for multiresolution image registration in the presence of occlusions 1
Technques for multresoluton mage regstraton n the presence of occlusons organ cgure Harold S. Stone morganm@mt.edu, hstone@research.n.nec.com Abstract Ths paper descrbes and compares technques for regsterng
More informationParallelizing Tracking Algorithms
Parallelzng Tracng Algorthms María Carna Roldan, Marcelo Naouf, Armando De Gust 3 mcroldan@vttal.com.ar, {mnaouf, degust}@ld.nfo.unlp.edu.ar LIDI. Laboratoro de Investgacón y Desarrollo en Informátca 4
More informationEverybody needs somebody: Modeling social and grouping behavior on a linear programming multiple people tracker
Everybody needs somebody: Modelng socal and groupng behavor on a lnear programmng multple people tracker Laura LealTaxe, Gerard PonsMoll and Bodo Rosenhahn Insttute for Informaton Processng (TNT) Lebnz
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
More informationQuestions that we may have about the variables
Antono Olmos, 01 Multple Regresson Problem: we want to determne the effect of Desre for control, Famly support, Number of frends, and Score on the BDI test on Perceved Support of Latno women. Dependent
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σalgebra: a set
More informationThe Analysis of Outliers in Statistical Data
THALES Project No. xxxx The Analyss of Outlers n Statstcal Data Research Team Chrysses Caron, Assocate Professor (P.I.) Vaslk Karot, Doctoral canddate Polychrons Economou, Chrstna Perrakou, Postgraduate
More informationLearning from Multiple Outlooks
Learnng from Multple Outlooks Maayan Harel Department of Electrcal Engneerng, Technon, Hafa, Israel She Mannor Department of Electrcal Engneerng, Technon, Hafa, Israel maayanga@tx.technon.ac.l she@ee.technon.ac.l
More informationComplex Number Representation in RCBNS Form for Arithmetic Operations and Conversion of the Result into Standard Binary Form
Complex Number epresentaton n CBNS Form for Arthmetc Operatons and Converson of the esult nto Standard Bnary Form Hatm Zan and. G. Deshmukh Florda Insttute of Technology rgd@ee.ft.edu ABSTACT Ths paper
More information