Human Activity Tracking for Wide-Area Surveillance

Size: px
Start display at page:

Download "Human Activity Tracking for Wide-Area Surveillance"

Transcription

1 Huma Activity Trackig for Wide-Area Surveillace Patrick D. O Malley Michael C. Nechyba A. Atoio Arroyo pomalley@mil.ufl.edu echyba@mil.ufl.edu arroyo@mil.ufl.edu Machie Itelligece Laboratory Departmet of Electrical ad Computer Egieerig Uiversity of Florida, Gaiesville, FL Abstract We preset a method for trackig ad idetifyig movig persos from video images take by a fixed field-ofview camera. Specifically, we have developed a system to first track movig persos i a give scee ad geerate color-based models of those persos to accomplish idetificatio. The trackig is o-ivasive meaig that it does ot require persos to wear ay particular electroics or clothig to be able to track them. Trackig is accomplished usig a positio-based data associatio algorithm while the color modelig is accomplished usig a mixture-of- Gaussias statistical model. The expectatio-maximizatio algorithm is used to geerate the color models over a sequece of frames of data i order to make the etire process ear-realtime. Oce a color model is developed for a give perso, that model will be placed i a database where it will be used for future idetificatio. Ay similar idetificatio scheme ca be used i place of color modelig for greater accuracy.. Itroductio Trackig people usig oly the data from a video camera is a difficult computer visio problem. However, research i this area is spurred o by the promise of may ehacemets to curret techology that a robust perso trackig system would provide. Already we are seeig the use of computer geerated overlays to add iformatio to sports broadcasts. These overlays, however, are usually depedet o special sesors ad emitters placed o the tracked object. The RACEf/x(c) [] system, for example, uses a GPS system to accomplish trackig of NASCAR (c) racecars i order to superimpose car statistics such as the ame of the driver, velocity ad positio oto the broadcast. The people trackig problem, o the other had, caot usually be solved by usig similar trasmitters. I surveillace applicatios wherei people are tracked i order to detect uauthorized etry or suspicious behavior for example, there is o possibility of usig trasmitters. A o-ivasive method usig oly the iformatio obtaied by a passive sesor such as a video camera is ecessary. The specific problem which we wish to address is surveillace over a wide-area. A typical coverage zoe would be a airport, the dowtow of a large city or ay large public area. Surveillace over these wide areas would be utilized to search for suspicious behavior - persos loiterig, for example - or uauthorized access - a perso attemptig to eter a restricted zoe, for example. Curretly, surveillace of this type is accomplished by a huma operator who does all of the detectio of uauthorized activity over may cameras. Give the challege of watchig multiple moitors, it is easy to see how some suspicious activity would go uoticed by a huma operator. A computer visio system, however, ca moitor both immediate uauthorized behavior ad log-term suspicious behavior. The system would the alert a huma operator for a closer look. I this way, oe operator could moitor more locatios or moitor the same umber of locatios more closely. The most commo method of trackig ay movig object, icludig persos, is to use some form of image subtractio to fid motio regios. These motio regios are the classified as either oise or a perso. Researchers such as [2] use the differece betwee cosecutive video images to fid the regios of motio. Others such as [3] ad [4] use a backgroud kow to be empty of ay movig objects (a referece image ) which is the subtracted from curret or foregroud images to fid the motio regios. It should be oted that this use of a referece image is limited to fixed field-of-view cameras whereas the cosecutive image subtractio method ca be used with movable cameras. The more difficult step occurs after fidig the motio regios. This step is to determie which motio regios should be tracked ad which are oise. A simple tree swayig i the breeze, for example, could cause severe oise problems leadig to false positives (oise tracked as a perso) or false egatives (a perso ot tracked because of earby oise.) [5] assumes that a ukow object is to be tracked (ad thus a perso) if it ca be tracked over several frames usig a secod-order motio model. Other trackig methods usig color aloe [3] have a difficult time trackig ew objects - oise or a perso - because they do ot have color iformatio available iitially. Idetificatio of a give idividual is difficult uder ay circumstaces. If the video imagery is take from a distace such that the face is obscured, it is questioable whether a good likelihood of positive idetificatio is pos-

2 sible. If the video ca be take close-up, a face recogitio algorithm such as that by [6] or [7] could give good idetificatio accuracy. A full-body color modelig scheme as used by [8] would be useful assumig the statistical model chose ca robustly compare two slightly dissimilar persos. It ca be see that a simple color model caot be used over great time periods for idetificatio but should be limited to short spas ad localized regios - a city block, for example. I order to track a perso over a wider area ad to be able to coect tracks foud across multiple cameras, a sigle frame of referece will be eeded to trasform coordiates from idividual cameras ito a global coordiate system. Oe method (for two cameras) is give by [9]. Exteded to may more cameras, we ca see how a huma trackig system ca be used for wide-area surveillace. 2. Overview The method for trackig people preseted here is fudametally based o utilizig two classificatio systems: positio ad color. As with [5], we will use a first-order motio model to track the idividual people as they move throughout the scee. The secod classificatio system is a mixture-of-gaussias model of the color of each perso. Iitially, these two classifiers act separately - that is, they do ot share iformatio betwee them to support more robust classificatio. However, further work i the area (see Sectio 7) will make the trackig more robust by fusig the two systems. By separatig the trackig system from the color modelig system, we ca solve the bootstrappig problem faced by systems such as [3] which use oly color modelig as the trackig system. We ca maitai trackig usig the positio-based tracker while at the same time geeratig a color model of the tracked perso. Oce that color model is developed, we ca use it for idetificatio or to resolve occlusio evets as described i Sectio 7. Before ay trackig work ca be doe, the video frames (images) eed to be reduced to cetroids of motio regios usig image processig techiques. 3. Image Processig I order to determie where a potetial perso is i a give scee, we reduce the scee to the cetroids of motio regios. Those cetroids are what fially gets tracked by the positio-based tracker. The origial frame is retaied, however, to extract color iformatio later. Like [3] we use a backgroud subtractio scheme based o makig a ormal distributio model for each pixel. Each frame is first coverted from RGB (red, gree, blue) colorspace to HSV (hue, saturatio, value.) We chose HSV because it teds to reduce the effects of shadows o the subtractio process. The ormal distributio for each pixel is foud by takig the first frames of the video sequece (which we assume to ot have ay foregroud or movig objects i them.) A three dimesioal vector, xk ij give i () where k is the frame umber ad (i,j) is the pixel coordiate, is the used to model the mea ad variace as give i (2) ad (3). xk ij = h s v µ ij = -- xk ij k = Σ ij = ( xk ij µ ij ) xk ( ij µ ij ) T k = The Mahalaobis distace is used to classify a pixel from a frame as either foregroud or backgroud. However, to speed the calculatio, we oly use the diagoals of the covariace foud i (3). We experimetally choose a distace threshold above which a pixel is classified as foregroud. Oce motio regios are foud, we get masks such as that i Figure. Usig these masks, we apply a stadard coected-regio segmetatio algorithm to determie the followig properties of each regio: cetroid coordiates (x,y), extets (xmax, ymax, xmi, ymi) ad size i pixels. Size thresholds are applied to elimiate ay motio regios too small to be cosidered a perso. The remaiig cetroids are set to the positio trackig system to be classified as a trackable object (a perso) or oise. 4. Positio Trackig System The positio trackig system is based o similar systems used i RADAR trackig situatios where there is a high oise desity. The first stage of trackig is kow here Fig. : Motio regio mask () (2) (3) 2

3 as the Track Iitiatio Processor (TIP). After the TIP has acquired a target (assumed here to be a perso) it passes that target to the Data Associatio Filter (DAF) which is desiged to keep a lock o the target. The fial stage is the track-drop ruleset which is a heuristic approach to determiig whe a target is o loger trackable such as whe it has goe behid a object or has left the scee. 4. Track Iitiatio Processor The job of the Track Iitiatio Processor (TIP) is to extract from a series of video frames, all of the objects which could potetially be people. At this stage we assume that the image processig has reduced each video frame to a series of cetroids of motio regios that are as yet uclassified as targets. Therefore, the TIP will classify them as either trackable objects (people) or oise. If oise, those regios are t elimiated outright because they could be asyet utracked objects so the TIP algorithm takes them ito cosideratio. The TIP is a faster implemetatio of a commo algorithm used i RADAR kow as retrospective processig [0] wherei three assumptios made about movig objects are evaluated o all potetial targets. By evaluatig all potetial targets - that is, all uclassified motio regios whether oise or people - over may frames, we will evetually fid oly those targets which ca be people. That is cosidered a good track. The three assumptios we wish to follow are very simple: First, that our oise is radomly distributed through the scee. Secod, that a perso movig through the scee moves with liear velocity over short distaces. Thirdly, that a perso movig through the scee moves with a limited maximum velocity. These three assumptios are ot ureasoable give that people do ot ted to move with a quickess that is goig to violate either of the last two assumptios. We fid objects which follow these three assumptios by usig frames of data. Three frames is the miimum. The first frame of cetroid data is assumed to be all potetial targets (potetial people.) We will prue this assumptio over the ext two frames. The situatio whe the first frame of data is preset is show i Figure 4a. I this simulatio (of radomly geerated 2-d data), we see simulated cetroids of objects. The first image (a) shows the objects as blue dots with gree circles idicatig the maximum distace that this object (if it is i fact a perso) could travel from this frame to the ext. The secod image (b) shows the frame #2 objects as red dots. Oly those red objects iside the gree circles ca be people because the others are movig too fast (or are oise.) Isolatig oly those pairs of blue ad red objects (frame # ad #2 objects, respectively) we predict where those objects would be i the third frame if they follow the costat velocity assumptio. The third image (c) shows these predictios as mageta circles. Fially, whe the third frame of data arrives (show i Figure 4d) we ca see that oly oe of those objects satisfies the costat liear velocity assumptio. Therefore, we ca elimiate all the other objects as oise. The three-poit track we have foud ca ow be used to coverge the Kalma filter described i the ext sectio. The algorithm described here ca be exteded from three frames of data to ay umber. The more frames used to fid a valid track, the more likely it is to be a valid track ad ot simply well-placed oise. I this way, our image processig ca be poor i that it leave a lot of oise yet trackig would ot suffer seriously. 4.2 Data Associatio Filter To cotiue the trackig process, a data associatio filter is used. We use a first-order Kalma filter to geerate predictios of the positios of each object i the ext frame. Whe that frame arrives, we associate the predictios with the icomig objects usig a earest-eighbor algorithm. We determie earess based o the Mahalaobis distace from the icomig cetroid to the predictio with its associated ucertaity covariace give by the Kalma filter. This method teds to give more robust results tha usig a simple Euclidea distace measure. 4.3 Track Drop Rules I order to determie whe to drop a track, a heuristic approach is used. Curretly, we allow the DAF to miss - that is, fail to associate with a icomig object - twice before that object is cosidered goe ad the track is dropped. A miss is defied to be whe the DAF caot make a earest-eighbor associatio because there are o objects withi a certai distace to associate with. The distace threshold is determied experimetally. 5. Color Modelig Color modelig is used for local idetificatio. That is, because it is assumed that a perso would chage color because they chage clothig from oe day to the ext or eve from oe hour to the ext, usig color models for idetificatio does ot work over log time spas. Therefore, we use color models i localized temporal ad spatial regios. The dowtow of a city for oe day, for example. After that day, the color models would be expired. But for that day, the idetificatio is assumed to work well eough to allow systems such as this to follow a give perso eve if they disappear from the reappear i the camera s field of view. I this way, the perso s piecemeal path ca be recorded. 5. Mixture-of-Gaussias Modelig We chose to use a mixture-of-gaussias model of the perso s color data i RGB (red-gree-blue) colorspace. Mixture modelig like this is typically a good fit to the data 3

4 give that most persos ted to appear as oly a few regios of color. Blue jeas ad a t-shirt, for example, are usually oly a few colors. Ski toes are well modeled as a regio of color. To simplify the mixture model, we fix the umber of Gaussias to three. Three was chose based o the Expectatio-Maximizatio (EM) algorithm we use to fit the Gaussias to the data. Equatios (4), (5) ad (6) give the update equatios for the iterative EM solutio to the mixture-of-gaussias problem for i {, 2,..., k} where k is the umber of Gaussias i the model ad is the umber of poits i the data set. As ca be see, reducig the umber of Gaussias ad the amout of data to be modeled ca sigificatly icrease the computatioal speed of this algorithm. Therefore we used oly three Gaussias ad limited the data to 300 poits i RGB colorspace which were foud by subsamplig all of the perso s color data. Note that each of these equatios eeds to be iterated may times util the Gaussias coverge. P( ω i ) µ i = = -- P ω ( i x j, Θ) j = j = P( ω i x, Θ)x j j j = P( ω i x j, Θ) P( ω i x j, Θ) x j µ i ( )( x j µ i ) T Σ j = i = P( ω i x j, Θ) j = It was foud that further speed ehacemets were required to improve the algorithm. The choice was betwee fidig ways to do the above computatios more efficietly or tryig to hide the computatio time etirely. We chose the latter by istead of modelig the color all i oe frame, we spread the iteratios out over multiple frames. We also allowed the color data which the model is traied o to be chaged with each frame. I this way we were able to assure that we would be modelig more tha oe view of the perso. We use the icomig color data (data that has ot yet bee icluded i the color model) as ukow validatio data by takig the sum log-likelihood of the data give that perso s color model. Oce the log-likelihood coverges (4) (5) (6) (plateaus) we cosider it well-formed ad do ot cotiue to iclude ay more data i the model. 6. Results Figure 3 shows a typical sequece usig the trackig ad idetificatio algorithms together. The images are osequetial from the top-left to the bottom-right. The first frame shows the perso beig tracked iitially as he eters the scee. (A gree box idicates a tracked object. A blue box idicates a ukow object, probably oise.) Two idetifiers are give to the perso: a ame - i this case a - ad a target idetifier - i this case 0. The ame is associated with the color model ad is therefore uique to a give perso. The target idetifier is ot uique to a perso as it is merely the positio-based tracker s idetificatio iformatio. The ame ( a ) is assiged to this perso iitially because it did ot have a pre-recorded color model to be associated with. As this perso is tracked, a color model is developed ad will from the all be associated with the ame a. The secod image shows that the positio-based tracker loses the perso because of a image processig problem. (This problem was later fixed but re-itroduced ito the code to cause the code to lose trackig for demostratio purposes.) The third image shows that the perso is still ot tracked. I the fourth image, the perso is agai tracked. The code compares this perso s color to the color models i the database ad matches it to the ame a. (I this demostratio there was oly oe model i the database from whe this perso was tracked previously - as show i frame oe. However, it could have determied that this perso did t exist i the database at all ad assiged a ew ame. Because it did ot, it idicates that it successfully matched this perso to the previously developed color model.) The last two images show how it cotiues to track the subject. Not show is a failure to track caused whe the subject is occluded by the sig. 7. Future Work Two major areas of work could be doe to improve this trackig system. They are related, however, ad could be accomplished at the same time. The first problem is to improve the robustess of the trackig by fusig the positio- -based trackig system with the color modelig system. I this way, if a situatio happeed as i Figure 3, frame 2 wherei the tracker loses the perso because of a image processig problem, we could istead decide if the two halves of the previously coected perso are really supposed to be oe usig the color iformatio. Similarly, we ca resolve occlusio such as that show i Figure 2 where the motio regio is see as oly oe ob- 4

5 ject (bouded by the blue box) but which is really two persos who were previously ucoected. It ca be see how, oce we detect that occlusio of this sort has occurred (usig a heuristic techique, for example) we ca resolve the occlusio ad separate the people by usig the previously determied color models. We do this by classifyig each pixel of the big motio regio as either belogig to oe or the other color model. By those classificatios, we ca make a fairly good guess as to the relative locatios of the persos. 8. Coclusio We have show how a combiatio of two methods - positio-based trackig ad color modelig - ca be used to robustly track people o-ivasively usig oly stadard statioary cameras. We have also show how this method ca be expaded to recover from difficult problems such as occlusio by allowig the positio-based tracker to essetially bootstrap the trackig util a color model ca be developed which will the make the whole system more robust. We believe this system ca be useful i a wide variety of surveillace situatios. 9. Refereces [] Sportvisio website [olie]. URL: Retrieved o April 9, [2] A. J. Lipto, H. Fujiyoshi, ad R. S. Patil, Movig target classificatio ad trackig from real-time video, Proc. IEEE Image Uderstadig Workshop, pp , 998. [3] S. Kha ad M. Shah, Trackig People i Presece of Occlusio, Asia Coferece o Computer Visio, Taipei, Taiwa, Jauary [4] Q. Cai, A. Mitiche, ad J. K. Aggarwal. Trackig huma motio i a idoor eviromet, 2d Itl. Cof. o Image Processig, pages 25-28, Washigto D.C., October 995. [5] I. Haritaoglu, D.Harwood, ad L.Davis, "Who, whe, where, what: A real time system for detectig ad trackig people", Proceedigs of the Third Face ad Gesture Recogitio Coferece, pp , 998. [6] C. Beumier, M.P. Acheroy, Automatic Face Autheticatio from 3D Surface, British Machie Visio Coferece BMVC 98, Uiversity of Southampto UK, 4-7 Sep, 998, pp [7] R. Bruelli ad D. Falaviga. "Perso idetificatio usig multiple cues", IEEE Trasactios o Patter Aalysis ad Machie Itelligece, Vol. 7, No. 0, pp , October (995). [8] I. Zapata, Detectig Humas i Video Sequeces Usig Statistical Color ad Shape Models, Master s Thesis, Departmet of Electrical ad Computer Egieerig, Uiversity of Florida, 200. [9] S. Nichols, Improvemet of the Camera Calibratio Through the Use of Machie Learig Techiques, Master s Thesis, Departmet of Electrical ad Computer Egieerig, Uiversity of Florida, 200. [0] E. Brooker, Trackig ad Kalma Filterig Made Easy, Wiley, New York, 998, pp. -6. Fig. 2: Example of two-perso occlusio 5

6 Fig. 3: Example of trackig ad idetificatio video sequece 6

7 Fig. 4: Track Iitiatio Processor simulatio 7

Evaluation scheme for Tracking in AMI

Evaluation scheme for Tracking in AMI A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:

More information

Image Segmentation EEE 508

Image Segmentation EEE 508 Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Accuracy Improvement in Camera Calibration

Accuracy Improvement in Camera Calibration Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z

More information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical

More information

3D Model Retrieval Method Based on Sample Prediction

3D Model Retrieval Method Based on Sample Prediction 20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: Superposer Integrated Morphometrics Package Superposition Tool IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New Fuzzy Color Clustering Algorithm Based on hsl Similarity IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper

More information

Our Learning Problem, Again

Our Learning Problem, Again Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig

More information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic Programming and Curve Fitting Based Road Boundary Detection Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk

More information

Ch 9.3 Geometric Sequences and Series Lessons

Ch 9.3 Geometric Sequences and Series Lessons Ch 9.3 Geometric Sequeces ad Series Lessos SKILLS OBJECTIVES Recogize a geometric sequece. Fid the geeral, th term of a geometric sequece. Evaluate a fiite geometric series. Evaluate a ifiite geometric

More information

DATA MINING II - 1DL460

DATA MINING II - 1DL460 DATA MINING II - 1DL460 Sprig 2017 A secod course i data miig http://www.it.uu.se/edu/course/homepage/ifoutv2/vt17/ Kjell Orsbor Uppsala Database Laboratory Departmet of Iformatio Techology, Uppsala Uiversity,

More information

Improving Template Based Spike Detection

Improving Template Based Spike Detection Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality

More information

New HSL Distance Based Colour Clustering Algorithm

New HSL Distance Based Colour Clustering Algorithm The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics

More information

Arithmetic Sequences

Arithmetic Sequences . Arithmetic Sequeces COMMON CORE Learig Stadards HSF-IF.A. HSF-BF.A.1a HSF-BF.A. HSF-LE.A. Essetial Questio How ca you use a arithmetic sequece to describe a patter? A arithmetic sequece is a ordered

More information

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c

Pruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro Fuzzy Model for Human Face Expression Recognition IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1

More information

are two specific neighboring points, F( x, y)

are two specific neighboring points, F( x, y) $33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

Fire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo.

Fire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo. Fire Recogitio i Video Walter Phillips III Mubarak Shah Niels da Vitoria Lobo {wrp65547,shah,iels}@cs.ucf.edu Computer Visio Laboratory Departmet of Computer Sciece Uiversity of Cetral Florida Orlado,

More information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Performance Plus Software Parameter Definitions

Performance Plus Software Parameter Definitions Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios

More information

Lecture 28: Data Link Layer

Lecture 28: Data Link Layer Automatic Repeat Request (ARQ) 2. Go ack N ARQ Although the Stop ad Wait ARQ is very simple, you ca easily show that it has very the low efficiecy. The low efficiecy comes from the fact that the trasmittig

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

Final Report Pedestrian Control Issues at Busy Intersections and Monitoring Large Crowds

Final Report Pedestrian Control Issues at Busy Intersections and Monitoring Large Crowds Fial Report 22-29 Pedestria Cotrol Issues at Busy Itersectios ad Moitorig Large Crowds PEDESTRIAN CONTROL ISSUES AT BUSY INTERSECTIONS AND MONITORING LARGE CROWDS Prepared by: Bejami Mauri, Osama Masoud,

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Position and Velocity Estimation by Ultrasonic Sensor

Position and Velocity Estimation by Ultrasonic Sensor Positio ad Velocity Estimatio by Ultrasoic Sesor N Ramarao 1, A R Subramayam 2, J Chara Raj 2, Lalith B V 2, Varu K R 2 1 (Faculty of EEE, BMSIT & M, INDIA) 2 (Studets of EEE, BMSIT & M, INDIA) Abstract:

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro

More information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi

More information

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions: CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed

More information

An abandoned object detection system based on dual background segmentation

An abandoned object detection system based on dual background segmentation 2009 Advaced Video ad Sigal Based Surveillace A abadoed object detectio system based o dual backgroud segmetatio A. Sigh, S. Sawa, M. Hamadlu Departmet of Electrical Egieerig I.I.T. Delhi Delhi, Idia abhiavkumar.sigh@mail2.iitd.ac.i

More information

Image based Cats and Possums Identification for Intelligent Trapping Systems

Image based Cats and Possums Identification for Intelligent Trapping Systems Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School

More information

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence?

Recursive Procedures. How can you model the relationship between consecutive terms of a sequence? 6. Recursive Procedures I Sectio 6.1, you used fuctio otatio to write a explicit formula to determie the value of ay term i a Sometimes it is easier to calculate oe term i a sequece usig the previous terms.

More information

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system.

1. The lines intersect. There is one solution, the point where they intersect. The system is called a consistent system. Commo Core Math 3 Notes Uit Day Systems I. Systems of Liear Equatios A system of two liear equatios i two variables is two equatios cosidered together. To solve a system is to fid all the ordered pairs

More information

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager.

Term Project Report. This component works to detect gesture from the patient as a sign of emergency message and send it to the emergency manager. CS2310 Fial Project Loghao Li Term Project Report Itroductio I this project, I worked o expadig exercise 4. What I focused o is makig the real gesture recogizig sesor ad desig proper gestures ad recogizig

More information

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING

HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Y.K. Patil* Iteratioal Joural of Advaced Research i ISSN: 2278-6244 IT ad Egieerig Impact Factor: 4.54 HADOOP: A NEW APPROACH FOR DOCUMENT CLUSTERING Prof. V.S. Nadedkar** Abstract: Documet clusterig is

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

More information

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5

Morgan Kaufmann Publishers 26 February, COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 5 Morga Kaufma Publishers 26 February, 28 COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter 5 Set-Associative Cache Architecture Performace Summary Whe CPU performace icreases:

More information

Algorithms for Disk Covering Problems with the Most Points

Algorithms for Disk Covering Problems with the Most Points Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi

More information

Stone Images Retrieval Based on Color Histogram

Stone Images Retrieval Based on Color Histogram Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose

More information

Homework 1 Solutions MA 522 Fall 2017

Homework 1 Solutions MA 522 Fall 2017 Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig

More information

Object based Pseudo-3D Conversion of 2D Videos

Object based Pseudo-3D Conversion of 2D Videos Object based Pseudo-3D Coversio of 2D Videos J. Jiag 1,2 ad G. Xiao 1 1 Southwest Uiversity; 2 Uiversity of Bradford ABSTRACT: I this paper, we describe a ew algorithm to costruct pseudo-3d videos out

More information

CS 683: Advanced Design and Analysis of Algorithms

CS 683: Advanced Design and Analysis of Algorithms CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,

More information

Lecture 13: Validation

Lecture 13: Validation Lecture 3: Validatio Resampli methods Holdout Cross Validatio Radom Subsampli -Fold Cross-Validatio Leave-oe-out The Bootstrap Bias ad variace estimatio Three-way data partitioi Itroductio to Patter Recoitio

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 26 Ehaced Data Models: Itroductio to Active, Temporal, Spatial, Multimedia, ad Deductive Databases Copyright 2016 Ramez Elmasri ad Shamkat B.

More information

Message Integrity and Hash Functions. TELE3119: Week4

Message Integrity and Hash Functions. TELE3119: Week4 Message Itegrity ad Hash Fuctios TELE3119: Week4 Outlie Message Itegrity Hash fuctios ad applicatios Hash Structure Popular Hash fuctios 4-2 Message Itegrity Goal: itegrity (ot secrecy) Allows commuicatig

More information

Tracking individuals in surveillance video of a high-density crowd

Tracking individuals in surveillance video of a high-density crowd Trackig idividuals i surveillace video of a high-desity crowd Nighag Hu a,b, Heri Bouma a,*, Marcel Worrig b a TNO, P.O. Box 96864, 2509 JG The Hague, The Netherlads; b Uiversity of Amsterdam, P.O. Box

More information

ANN WHICH COVERS MLP AND RBF

ANN WHICH COVERS MLP AND RBF ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

27 Refraction, Dispersion, Internal Reflection

27 Refraction, Dispersion, Internal Reflection Chapter 7 Refractio, Dispersio, Iteral Reflectio 7 Refractio, Dispersio, Iteral Reflectio Whe we talked about thi film iterferece, we said that whe light ecouters a smooth iterface betwee two trasparet

More information

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian approach to reliability modelling for a probability of failure on demand parameter Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee

More information

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe

Copyright 2016 Ramez Elmasri and Shamkant B. Navathe Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe CHAPTER 22 Database Recovery Techiques Copyright 2016 Ramez Elmasri ad Shamkat B. Navathe Itroductio Recovery algorithms Recovery cocepts Write-ahead

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV

Lecture 7 7 Refraction and Snell s Law Reading Assignment: Read Kipnis Chapter 4 Refraction of Light, Section III, IV Lecture 7 7 Refractio ad Sell s Law Readig Assigmet: Read Kipis Chapter 4 Refractio of Light, Sectio III, IV 7. History I Eglish-speakig coutries, the law of refractio is kow as Sell s Law, after the Dutch

More information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P.

Identification of the Swiss Z24 Highway Bridge by Frequency Domain Decomposition Brincker, Rune; Andersen, P. Aalborg Uiversitet Idetificatio of the Swiss Z24 Highway Bridge by Frequecy Domai Decompositio Bricker, Rue; Aderse, P. Published i: Proceedigs of IMAC 2 Publicatio date: 22 Documet Versio Publisher's

More information

Investigating methods for improving Bagged k-nn classifiers

Investigating methods for improving Bagged k-nn classifiers Ivestigatig methods for improvig Bagged k-nn classifiers Fuad M. Alkoot Telecommuicatio & Navigatio Istitute, P.A.A.E.T. P.O.Box 4575, Alsalmia, 22046 Kuwait Abstract- We experimet with baggig knn classifiers

More information

Python Programming: An Introduction to Computer Science

Python Programming: An Introduction to Computer Science Pytho Programmig: A Itroductio to Computer Sciece Chapter 6 Defiig Fuctios Pytho Programmig, 2/e 1 Objectives To uderstad why programmers divide programs up ito sets of cooperatig fuctios. To be able to

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers * Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13

CIS 121 Data Structures and Algorithms with Java Spring Stacks and Queues Monday, February 12 / Tuesday, February 13 CIS Data Structures ad Algorithms with Java Sprig 08 Stacks ad Queues Moday, February / Tuesday, February Learig Goals Durig this lab, you will: Review stacks ad queues. Lear amortized ruig time aalysis

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)

CIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8) CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

IMAGE-BASED MODELING AND RENDERING 1. HISTOGRAM AND GMM. I-Chen Lin, Dept. of CS, National Chiao Tung University

IMAGE-BASED MODELING AND RENDERING 1. HISTOGRAM AND GMM. I-Chen Lin, Dept. of CS, National Chiao Tung University IMAGE-BASED MODELING AND RENDERING. HISTOGRAM AND GMM I-Che Li, Dept. of CS, Natioal Chiao Tug Uiversity Outlie What s the itesity/color histogram? What s the Gaussia Mixture Model (GMM? Their applicatios

More information

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1

CS200: Hash Tables. Prichard Ch CS200 - Hash Tables 1 CS200: Hash Tables Prichard Ch. 13.2 CS200 - Hash Tables 1 Table Implemetatios: average cases Search Add Remove Sorted array-based Usorted array-based Balaced Search Trees O(log ) O() O() O() O(1) O()

More information

Octahedral Graph Scaling

Octahedral Graph Scaling Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of

More information

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000.

Basic allocator mechanisms The course that gives CMU its Zip! Memory Management II: Dynamic Storage Allocation Mar 6, 2000. 5-23 The course that gives CM its Zip Memory Maagemet II: Dyamic Storage Allocatio Mar 6, 2000 Topics Segregated lists Buddy system Garbage collectio Mark ad Sweep Copyig eferece coutig Basic allocator

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

Efficient Eye Location for Biomedical Imaging using Two-level Classifier Scheme

Efficient Eye Location for Biomedical Imaging using Two-level Classifier Scheme 828 Iteratioal Joural of Cotrol, Automatio, ad Systems, vol. 6, o. 6, pp. 828-835, December 2008 Efficiet Eye Locatio for Biomedical Imagig usig Two-level Classifier Scheme Mi Youg Nam, Xi Wag, ad Phill

More information

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka

On-line cursive letter recognition using sequences of local minima/maxima. Robert Powalka O-lie cursive letter recogitio usig sequeces of local miima/maxima Summary Robert Powalka 19 th August 1993 This report presets the desig ad implemetatio of a o-lie cursive letter recogizer usig sequeces

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Design of efficient, virtual non-blocking optical switches

Design of efficient, virtual non-blocking optical switches Desig of efficiet, virtual o-blockig otical switches Larry F. Lid, Michael Sratt Mobile Systems ad Services Laboratory HP Laboratories Bristol HPL-200-239 March 3 th, 2002* otical switchig, switch desig

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Review: The ACID properties

Review: The ACID properties Recovery Review: The ACID properties A tomicity: All actios i the Xactio happe, or oe happe. C osistecy: If each Xactio is cosistet, ad the DB starts cosistet, it eds up cosistet. I solatio: Executio of

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Big-O Analysis. Asymptotics

Big-O Analysis. Asymptotics Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses

More information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An Efficient Algorithm for Graph Bisection of Triangularizations A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu

More information

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING

FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING FEATURE BASED RECOGNITION OF TRAFFIC VIDEO STREAMS FOR ONLINE ROUTE TRACING Christoph Busch, Ralf Dörer, Christia Freytag, Heike Ziegler Frauhofer Istitute for Computer Graphics, Computer Graphics Ceter

More information

Transitioning to BGP

Transitioning to BGP Trasitioig to BGP ISP Workshops These materials are licesed uder the Creative Commos Attributio-NoCommercial 4.0 Iteratioal licese (http://creativecommos.org/liceses/by-c/4.0/) Last updated 24 th April

More information

Fragments based tracking with adaptive multi-cue integration

Fragments based tracking with adaptive multi-cue integration Fragmets based tracig with adaptive multi-cue itegratio Abstract Lichua Gu *, Jiaxiao Liu, Chegi Wag School of Computer ad Iformatio, Ahui Agriculture Uiversity, Hefei Ahui, No.130 West Chagiag Road Chia,

More information

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning

Improving Face Recognition Rate by Combining Eigenface Approach and Case-based Reasoning Improvig Face Recogitio Rate by Combiig Eigeface Approach ad Case-based Reasoig Haris Supic, ember, IAENG Abstract There are may approaches to the face recogitio. This paper presets a approach that combies

More information