Fire Recognition in Video. Walter Phillips III Mubarak Shah Niels da Vitoria Lobo.
|
|
- Spencer Morris
- 6 years ago
- Views:
Transcription
1 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, Fl 3286
2 Fire Recogitio i Video Abstract This paper presets a system for automatic fire detectio i video images. Our system uses color ad motio iformatio gaied from video sequeces to locate fire. Ulike previous methods, this method is early uiversally applicable because of its isesitivity to camera motio. Two specific applicatios ot possible with previous algorithms are the recogitio of fire i the presece of global motio ad the recogitio of fire i etertaimet ad movies for possible use i a automatic ratig system.. Itroductio Existig methods of visual fire detectio rely almost exclusively upo spectral aalysis usig expesive camera equipmet. This approach, however, is still very vulerable to false alarms, especially caused by images of the su. I additio, this limits fire detectio to those who ca afford the high price of the expesive sesors that are ecessary to implemet these methods. There are two methods that seem promisig [][2]. However, both of these rely upo ideal coditios. I the first, camera iitializatio requires the maual creatio of rectagles based upo the distace of portios of a scee from the camera. Because camera iitializatio is so difficult, the camera must also be statioary. The secod method [2] is based upo strictly greyscale images. Though computatioally iexpesive, this method oly works where there is very little that may be mistake for fire (i Aircraft dry bays, where there is o su, for example). Oce agai, the camera must be statioary for this method to work. The method described i this paper, employig oly color video iput, does ot require a fixed camera, ad is desiged to detect fire i early ay eviromet. I this method, first, a color predicate is built usig the method preseted i sectios 2. ad 2.2 of this paper. The small subsets of color video sequeces are examied, ad based upo both the color properties, ad the temporal variatio (sectio 3), a probability is assiged to each pixel locatio idicatig the likelihood that each pixel is a fire pixel (sectio 4). Based upo some coditios also preseted i sectio 4, we ca determie if this test has bee reliable. The reaso this is a effective combiatio is explaied i sectio 5. If the test to fid fire has bee successful, a erode operatio (sectio 6) is performed to remove spurious fire pixels. This is followed by a regio growig algorithm desiged to fid fire ot idetified i the iitial testig (sectio 7). The overall fire fidig algorithm is described i sectio 8. The results preseted i sectio 9 show the effectiveess of this algorithm. Future work ad coclusios follow i sectios 0 ad, respectively. 2.. Color Detectio Rather tha makig use of spectral iformatio obtaied via models of fire (which may igore slight irregularities ot cosidered for the type of fire beig observed), our system is based upo first creatig a color predicate through traiig usig test data from which the fire has bee isolated maually (see figure ). This is accomplished usig the ski detectio algorithm described i [3]. Usig other meas, it is very difficult to isolate the colors that are withi fire. This modificatio allows for icreased accuracy if traiig sequeces are available for specific kids of fires, while allowig for a geeric fire look-up table if traiig sequeces are ot available (assumig the user ca create a geeric, all-purpose fire probability table). This results i a fuctio, which we shall call Colorlookup, which, give a (R,G,B) triple, will retur a boolea. For our tests, we foud that usig about te traiig images from several of our traiig sets to be sufficiet to costruct a effective color predicate. Figure : Some traiig images ad their maually created masks 2.2. Color i Video Fire is gaseous, ad as a result, i additio to becomig traslucet, it may disperse eough to become udetectable, as i figure 2. This ecessitates that we average the fire estimate over small widows of time. A simple way to compute the probability of a pixel havig fire s color over a sequece is by temporally averagig the probability that a pixel is fire over time.
3 Figure 2: Traslucet fire with a book burig behid it. More precisely: Colorlookup( Pi ( ) i where Colorlookup is the boolea color predicate produced by the ski-detectio algorithm, is the umber of images i a sequece subset, P i is the i th frame i a sequece subset. P i ( is the (R,G,B) triple foud at I ( Pi ( ) I ( Pi ( ) i 2 DIFFS ( locatio ( i the i th image. For our calculatios, we have determied that may be a legth greater tha or equal to 3 images. 3. Fidig Temporal Variatio Color aloe is ot eough to idetify fire. There are may thigs that share the same color as fire, but that are ot fire, such as a desert su ad red leaves. The key to distiguishig betwee the fire ad the firecolored objects is the ature of their motio. The motio of fire will cause the positio of flames betwee two cosecutive frames (take at 30 fps) to be i completely differet locatios (see figure 3). Our system makes tests for this by checkig for a high average variatio of Figure 3: Flicker i two cosecutive images Figure 4: The Su i this image is fire colored. This is ot detected as fire by our system because of low temporal variatio. itesity over a umber of images. For a sequece subset cotaiig images this temporal variatio may be defied as: where P i is the i th frame i a sequece of images, ad I is a fuctio that give a (R,G,B) triple, returs the itesity (which is (R+G+B)/3 ). The highest possible temporal variatio occurs i the case of flicker, that is, whe a pixel is chagig rapidly from oe itesity to aother. This geerally occurs oly i the presece of fire. This is i cotrast to global motio or motio of rigid bodies, which produces lower temporal variatio as a result of the relatively smooth itesity gradiet possessed by most objects i the spatial domai which ca cause oly slight variatios as objects chage locatios withi a image, eve i the presece of global motio. By first correctig for the chage of o-fire pixels it is possible to determie if fire-colored pixels actually represet fire. This is most easily doe by: ) Decidig which pixels are fire cadidates by thresholdig the Color matrix. 2) Fidig the average chage i itesity of all ofire pixels 3) Subtractig this average value from the value i DIFFS at each locatio. More precisely: First compute ofirediffs y, 0 DIFFS( y, 0 The lower summatio represets the umber of pixels i the image that are determied to be fire colored.
4 ad the compute σ ( DIFFS( ofirediffs Figure 4 shows the importace of the temporal variatio because ow the algorithm correctly rejects the part of the scee that is fire-colored. 4. Heuristic Aalysis Sice the test to fid fire is directly depedet upo both color ad temporal variatio, it is best expressed by a simple test: if color( ad σ ( > k Fire( 0 otherwise where k is a experimetally determied costat. This is a measure of the temporal variatio of the firecolored pixels. There are several exceptios that give reaso that merely fidig Fire is ot eough. The first of these occurs specifically i sulight. As a result of reflectio, sulight ca cause ew light sources to appear ad disappear. For that reaso, there are ofte a few pixels i a image cotaiig the su that score high eough o the temporal variatio test to be recogized as fire, though most do ot. Therefore, sequeces cotaiig a high umber of fire-colored pixels, but with a low umber of fast movig-fire colored pixels must usually be set ito a fire ulikely/udetectable class. Specifically, this meas coutig the umber of pixels i Fire that are s ad comparig it to the umber of pixels that have color(. If the umber of fire colored pixels is less tha some threshold, the we say that there is o fire i the sequece at all. For our tests, this threshold was 0. If the umber of pixels detected as fire is greater tha this threshold, but the ratio of fire pixels to fire-colored pixels is high, the the sequece must be placed ito the fire ulikely/udetectable class. For our tests, at least oe out of every thousad fire-colored pixels must be foud as fire. There is oe case that cotais fire that this method is uable to detect: if a sequece is recorded is close eough to a fire, the fire may fully saturate the images with light, keepig the camera from observig chages or eve colors other tha white. Therefore, if cotrast is very low ad itesity is very high, as i figure 5, sequeces must be put ito a fire likely/udetectable class. 5. Correlatio Issues It is possible that motio ad color iformatio could result i the same iformatio so that kowig oe is the same as kowig the other. I order to determie the correlatio, we took a radom samplig of 8,000 poits from video data used i our experimets. For each poit, we stored. The value of DIFFS 2. The value of COLOR We the compared them usig this formula to fid ρ, the correlatio coefficiet: ( xi µ x )( yi µ y ) ρ ( σ σ ) x y where x i is the i th sample take from Color, y i is the I th sample take from DIFFS, is the size of the sample, µ ad µ y are the sample meas of Color ad Diffs, ad σ σ y are their sample variaces. The correlatio we measured by this method was.072, idicatig that these two cues are idepedet. 6. Dealig with Reflectio: Figure 5: Fire Likely/Udetectable Before Erosio Fire Detected. Figure 6: Reflectio o groud detected at lower left. I this ad all examples, the detected locatio of fire is outlied i white. Oe of the largest problems i the detectio of fire is the reflectio of fire upo the objects ear the fire. However, barrig surfaces with high reflectivity, such as mirrors, reflectios ted to be icomplete. A erode operatio ca elimiate most of the reflectio i a image. For our study, the followig erode operatio worked the best: examie the eight-eighbors of each pixel. Remove all pixels from Fire that have less tha five eighteighbors. Figure 6 shows the results of this stage.
5 7. Regio Growig These values cotaied i the boolea image created from the erosio stage will cotai oly the most likely fire cadidates; to have avoided false positives thus far, our coservative strategy will ot have detected all of the fire i a sequece subset. But this is ot a accurate measure of the total quatity of fire i the sequece subset. For example, some of the fire i a sequece will ot appear to be movig because it is right i the ceter of the fire. Hece, i order to fid the rest of the flame, it is ecessary to grow regios usig color aloe. To fid the total quatity of fire pixels i the sequece subset, the followig regio growig algorithm is applied:. Create a ew boolea image, Fire ad a variable, dist ad set Fire Fire(, dist 0 2. For all pixels i Fire that are adjacet to pixels such that Fire(, if >(k +dist) set Fire 3. Fire( Fire 4. dist dist+k 3 5. Loop to step 2. Where dist is a threshold that begis at zero ad is icremeted, ad k 3 is a experimetally determied costat; i our experimets we used This method is applied util it there is o chage from oe step to the ext (i.e., whe o steps have ay effect o Fire) 8. Algorithm for Fire Detectio The steps i the algorithm are the followig:. Maually select fire from images ad create a color predicate usig the algorithm i [3]. Ulike [3], do ot threshold. Create a fuctio that, give a (R,G,B) triple, returs a real umber. Call this Colorlookup. 2. For cosecutive images, calculate color ad DIFFS, DIFFS ( i 2 I ( P ( ) I ( P i i ( ) ColorLookup( Pi ( ) i where Colorlookup is the predicate created i step #. 3. Calculate the motio of the part of the image that is ot fire ad subtract it from each value i sigma. First calculate: ofirediffs DIFFS( ad the calculate: σ ( DIFFS( ofirediffs where the summatio is over <k, ad k is a experimetally determied costat. 4. Create a fire boolea image, if color( ad σ ( > k Fire( 0 otherwise where k is a experimetally determied costat. 5. Classify sequece as fire likely/udetectable if average itesity is above some experimetally determied value. 6.a. Calculate the umber of possible fire cadidates by addig together all the values of Fire. Call this umber Numfire. b. Calculate the umber of pixels detected as fire by coutig the umber of pixels i Fire that are above some threshold value. Call this umber Foudfire. c. Calculate Foudfire/Numfire. If this value is less tha some experimetally determied costat, classify the sequece as fire ulikely/udetectable. 7. Examie the eight-eighbors (the eight adjacet pixels) of each pixel. Remove all pixels from Fire that have less tha five eight-eighbors that are. 8.a. Create a ew boolea image, Fire ad a variable, dist ad set Fire Fire(. dist 0 b. For all pixels i Fire that are eight eighbors of pixels such that Fire(, if >(k +dist) Fire c. Fire Fire d. dist dist+k 3 e. Loop to step b. where dist is a costat that begis at zero ad is icremeted, ad k 3 is a experimetally determied costat.
6 Sequece# Legth Frames w/fire False + False - Descriptio A fire i a fireplace A settig su A fire at ight Su i the desert A ma s face Fire burig i the street 20 feet from the camera Figure 7: All measuremet are i umber of frames 9. Experimetal Results: Figure 8: The su is ot recogized, eve with bal This motio. method has bee effective for a large variety of coditios (see figure 7). False alarms, such as video of the su movig (see figure 8) are ot detected by this method because i all realistic sequeces, the rate of global motio is almost always much less tha the expected speed of the fire. Figure 9: Very bright image ad very dark image; detectio occurs i both cases. Lightig coditios also have o effect upo the system; it has bee able to detect fire i a large variety of fire images, as i figure 9. Certai types of fires, such as cadles, blow torches, ad lighters, are completely cotrolled, ad always bur exactly the same way without flickerig (see figure 0). Ufortuately, the algorithm fails for these cases because of the lack of temporal variatio. However, these cases are ot usually importat to recogize because cotrolled fires are ot dagerous. 0. Future Work The ext step i the developmet of this algorithm would be error reductio. There are three equatios stated i this algorithm that have costats that must be determied experimetally. The error i this method ca be reduced by employig traiig to determie these values. Because of the low computatioal demad ecessary for this algorithm, it is also possible to use it as part of a robust, real-time system for fire detectio. Aother directio would be to distiguish betwee differet types of fires. Fially, predictig fire s path i video would be iterestig.. Coclusio This paper has preseted a robust system for detectig fire i color video sequeces. This algorithm employs iformatio gaied through both color ad temporal variatio to detect fire. We have show a variety of coditios i which fire ca be detected, ad a way to determie whe it caot. Through these tests, this method has show promise for detectig fire i real world situatios. Ackowledgemets The author of this paper would like to thak xxxxx ad yyyyy for their replies to questios about their previous work. I additio, much gratitude goes to zzzzz at our Uiversity, without whose previous work much of this would ot have bee able to be accomplished. Refereces []Healey, G., Slater, D., Li, T., Drda, B., Goedeke, A.D. A system for Real-Time Fire Detectio, IEEE Cof Computer Visio ad Patter Recogitio, 994. [2]Foo, S. Y. A rule-based machie visio system for fire detectio i aircraft dry bays ad egie compartmets, Kowledge-Based Systems, vol [3]Kjedlse R, Keder, J. Fidig Ski i Color Images, 996 Face ad Gesture Recogitio P Figure 0: Detectig a match or cadles meas detectig based mostly upo color.
Abstract. 1. Introduction
Flame Recogitio i Video Walter Phillips 111 Mubarak Shah Niels da Vitoria Lobo Computer Visio Laboratory Departmet of Computer Sciece Uiversity of Cetral Florida Orlado, Fl32816 {wrp65547,shah, iels) @
More informationOnes 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 informationCSC 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. 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 informationPerformance 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 informationCS 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 informationPattern 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 information3D 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 informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationBezier 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 informationCh 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 informationNeuro 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 informationHarris 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 informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More information9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence
_9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to
More informationImage 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 informationENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics
ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,
More informationFundamentals 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 informationEvaluation 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 informationBasic 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 informationThe 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 informationCOMP 558 lecture 6 Sept. 27, 2010
Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout
More informationProtected points in ordered trees
Applied Mathematics Letters 008 56 50 www.elsevier.com/locate/aml Protected poits i ordered trees Gi-Sag Cheo a, Louis W. Shapiro b, a Departmet of Mathematics, Sugkyukwa Uiversity, Suwo 440-746, Republic
More informationLecture 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 informationData diverse software fault tolerance techniques
Data diverse software fault tolerace techiques Complemets desig diversity by compesatig for desig diversity s s limitatios Ivolves obtaiig a related set of poits i the program data space, executig the
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationIMP: 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 informationImproving 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 informationDETECTION 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 informationPython 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 informationFloristic Quality Assessment (FQA) Calculator for Colorado User s Guide
Floristic Quality Assessmet (FQA) Calculator for Colorado User s Guide Created by the Colorado atural Heritage Program Last Updated April 2012 The FQA Calculator was created by Michelle Fik ad Joaa Lemly
More informationChapter 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 information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationc-dominating Sets for Families of Graphs
c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the
More informationPython Programming: An Introduction to Computer Science
Pytho Programmig: A Itroductio to Computer Sciece Chapter 1 Computers ad Programs 1 Objectives To uderstad the respective roles of hardware ad software i a computig system. To lear what computer scietists
More informationAccuracy 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 informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationNew 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 informationA 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 informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationA 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 informationChapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationBig-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 informationThe Magma Database file formats
The Magma Database file formats Adrew Gaylard, Bret Pikey, ad Mart-Mari Breedt Johaesburg, South Africa 15th May 2006 1 Summary Magma is a ope-source object database created by Chris Muller, of Kasas City,
More informationWhich movie we can suggest to Anne?
ECOLE CENTRALE SUPELEC MASTER DSBI DECISION MODELING TUTORIAL COLLABORATIVE FILTERING AS A MODEL OF GROUP DECISION-MAKING You kow that the low-tech way to get recommedatios for products, movies, or etertaiig
More informationOne advantage that SONAR has over any other music-sequencing product I ve worked
*gajedra* D:/Thomso_Learig_Projects/Garrigus_163132/z_productio/z_3B2_3D_files/Garrigus_163132_ch17.3d, 14/11/08/16:26:39, 16:26, page: 647 17 CAL 101 Oe advatage that SONAR has over ay other music-sequecig
More informationComputers and Scientific Thinking
Computers ad Scietific Thikig David Reed, Creighto Uiversity Chapter 15 JavaScript Strigs 1 Strigs as Objects so far, your iteractive Web pages have maipulated strigs i simple ways use text box to iput
More informationChapter 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 informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationThe 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 informationUsing VTR Emulation on Avid Systems
Usig VTR Emulatio o Avid Systems VTR emulatio allows you to cotrol a sequece loaded i the Record moitor from a edit cotroller for playback i the edit room alog with other sources. I this sceario the edit
More informationParabolic 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 informationLecture 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 informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationFREQUENCY 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 informationImprovement 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 informationDynamic 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 informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationChapter 4. Procedural Abstraction and Functions That Return a Value. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 4 Procedural Abstractio ad Fuctios That Retur a Value Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 4.1 Top-Dow Desig 4.2 Predefied Fuctios 4.3 Programmer-Defied Fuctios 4.4
More informationA 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 informationChapter 10. Defining Classes. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 10 Defiig Classes Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 10.1 Structures 10.2 Classes 10.3 Abstract Data Types 10.4 Itroductio to Iheritace Copyright 2015 Pearso Educatio,
More informationDATA 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 informationn n B. How many subsets of C are there of cardinality n. We are selecting elements for such a
4. [10] Usig a combiatorial argumet, prove that for 1: = 0 = Let A ad B be disjoit sets of cardiality each ad C = A B. How may subsets of C are there of cardiality. We are selectig elemets for such a subset
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationLecture 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 informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationRecursive 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 informationPosition 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 informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationReliable Transmission. Spring 2018 CS 438 Staff - University of Illinois 1
Reliable Trasmissio Sprig 2018 CS 438 Staff - Uiversity of Illiois 1 Reliable Trasmissio Hello! My computer s ame is Alice. Alice Bob Hello! Alice. Sprig 2018 CS 438 Staff - Uiversity of Illiois 2 Reliable
More informationOn-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 informationEmpirical Validate C&K Suite for Predict Fault-Proneness of Object-Oriented Classes Developed Using Fuzzy Logic.
Empirical Validate C&K Suite for Predict Fault-Proeess of Object-Orieted Classes Developed Usig Fuzzy Logic. Mohammad Amro 1, Moataz Ahmed 1, Kaaa Faisal 2 1 Iformatio ad Computer Sciece Departmet, Kig
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationThe Adjacency Matrix and The nth Eigenvalue
Spectral Graph Theory Lecture 3 The Adjacecy Matrix ad The th Eigevalue Daiel A. Spielma September 5, 2012 3.1 About these otes These otes are ot ecessarily a accurate represetatio of what happeed i class.
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationTask scenarios Outline. Scenarios in Knowledge Extraction. Proposed Framework for Scenario to Design Diagram Transformation
6-0-0 Kowledge Trasformatio from Task Scearios to View-based Desig Diagrams Nima Dezhkam Kamra Sartipi {dezhka, sartipi}@mcmaster.ca Departmet of Computig ad Software McMaster Uiversity CANADA SEKE 08
More informationUsing the Keyboard. Using the Wireless Keyboard. > Using the Keyboard
1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries
More informationCIS 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 informationMorgan 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 informationBayesian 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 informationSpeeding-up dynamic programming in sequence alignment
Departmet of Computer Sciece Aarhus Uiversity Demark Speedig-up dyamic programmig i sequece aligmet Master s Thesis Dug My Hoa - 443 December, Supervisor: Christia Nørgaard Storm Pederse Implemetatio code
More informationNTH, GEOMETRIC, AND TELESCOPING TEST
NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few
More informationOctahedral 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 informationEigenimages. 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 informationChapter 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( 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 informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationDerivation of perspective stereo projection matrices with depth, shape and magnification consideration
Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio
More informationEvaluation of Different Fitness Functions for the Evolutionary Testing of an Autonomous Parking System
Evaluatio of Differet Fitess Fuctios for the Evolutioary Testig of a Autoomous Parkig System Joachim Wegeer 1 ad Oliver Bühler 2 1 DaimlerChrysler AG, Research ad Techology, Alt-Moabit 96 a, D-10559 Berli,
More informationA Trinocular Stereo System for Highway Obstacle Detection
A Triocular Stereo System for Highway Obstacle Detectio Todd Williamso ad Charles Thorpe Robotics Istitute Caregie Mello Uiversity Pittsburgh, PA 15213 {Todd.Williamso,Charles.Thorpe}@ri.cmu.edu Abstract
More informationCOMPUTER ORGANIZATION AND DESIGN The Hardware/Software Interface. Chapter 4. The Processor. Part A Datapath Design
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Chapter The Processor Part A path Desig Itroductio CPU performace factors Istructio cout Determied by ISA ad compiler. CPI ad
More informationl-1 text string ( l characters : 2lbytes) pointer table the i-th word table of coincidence number of prex characters. pointer table the i-th word
A New Method of N-gram Statistics for Large Number of ad Automatic Extractio of Words ad Phrases from Large Text Data of Japaese Makoto Nagao, Shisuke Mori Departmet of Electrical Egieerig Kyoto Uiversity
More informationExact Minimum Lower Bound Algorithm for Traveling Salesman Problem
Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute
More informationBig-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 information6.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 informationNew 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