FIRE DETECTION ALGORITHM

Abstract: A method and apparatus for the detection of flame by entering (S1) a video signal into an algorithm which processes individual pixels in (S2) a frequency band is determined and used as a filter (S3) applies a threshold to create a map of significant movement (S4) applies an awareness map (S5) a number of parameters are calculated to decide whether flame is present in the video images being processed (S6) applies further filtering before indicating an alarm registering the presence of a flame threat.

Description: Fire Detection Algorithm Field of the Invention The invention relates to the field of video processing and fire detection and specifically an algorithm is described that allows the detection of a flame from a digitised video data stream. A system for video flame detection is described. Background The use of video camera and digital video processing techniques for determining and detecting features from the image are well known in the art. The inventors have previously disclosed in PCT Application GB99/03459 a system for detecting smoke in the image. These systems are used as another sensor input for a fire alarm system Flame is a further component in combustion and it is possible to have a fire event that produces no smoke. An algorithm that detects the presence of flame within a video image provides a further input into the fire detection process. Summary of the Invention According to the present invention there is provided an algorithm that extracts features from a video data stream and is able to detect the presence of flame within the video data stream. According to a further aspect of the invention there is provided a system for providing an alarm indicating the presence of flame within a scene that is observed by a video camera. Brief Description of the Drawings Embodiments of the invention will now be described, by way of example, with reference to the accompanying drawings, in which: Figure 1 shows the block diagram of the flame detection system, Figure 2 shows the steps comprising the algorithm Detailed Description The flame detection system shown in Figure 1 comprises an analogue black and white video camera, 1 , which outputs a standard 625 line analogue video signal at a 25Hz frame rate to a frame grabber card, 2 Cameras are widely available and the inventors are using a standard YHS video camera from Hitachi The frame grabber card digitises the image to a resolution of 640 pixels per line with 480 lines and passes the digitised image into the processor, 3, at the frame rate. The frame grabber card is a standard piece of hardware and a National Instruments PCI 141 1 device plugged into the PCI bus of a standard PC is used The processor 3, comprises a standard IBM™ PC using a 750MHz Intel Pentium 3™ processor with 128Mbytes of RAM. The processor executes the algorithm, which is coded in a mixture of Lab View™ and Microsoft™ Visual C + + The processor outputs an alarm signal, 4,bv means of a standard serial RS232 link This output may be used in a number of obvious ways to indicate a fire alarm event The algorithm comprises a series of steps labelled S I to S 7 in the flow chart shown in Figure 2 These steps are now described In step 1 , the video image is entered into the algorithm is in the form of a monochrome 640 x 480 image where each image pixel has an intensity value of 8 bits resolution The algorithm processes each pixel individually, using linear mathematical operations In step 2, the monochrome 640 x 480 8 bit image is used to generate two separate averaged 640 x 480 8 bit resolution images which filter out rapidly occurring events, one with filter set at 1.25Hz and the other with a filter set at 4.0Hz. The absolute difference between the pixel values of these two images is then taken to obtain a movement band 640 x 480 8 bit image, which displays entities that are moving in the image within the frequency band between 1.25Hz and 4 0Hz. This frequency band corresponds with the range of movement frequencies exhibited by petrol flames observed empirically by the inventors In the first averaged image, a dimensionless time constant kl , is used to generate a 640 x 480 resolution 8 bit image that filters out events that occur more rapidly than 4Hz. kl is calculated using the following relationship kl = l / (4Hz x time in seconds between successive frames) kl is then used to generate an image that filters out events that occur at higher frequencies than 4Hz in the following manner pMl = k l x (live pixel image value) + (1 - kl) x (Value of pMl from previous frame) where pMl is a rolling average with a starting value of zero Each pixel in the 640 x 480 hve image has a corresponding value of pMl which can be used to make up the averaged image In the second averaged image, a dimensionless time constant k2, is used to generate a 640 x 480 resolution 8 bit image that filters out events that occur more rapidly than 1.25Hz. k2 is calculated in the following relationship k2 = 1 / (1 25Hz x time in seconds between successive frames) k2 is then used to generate an image that filters out events that occur at higher frequencies than 1 25Hz in the following manner pM2 = k2 x (hve pixel image value) + (1 - k2) x (value of pM2 from previous frame) where pM2 is a rolling average with a starting value of zero Each pixel in the 640 x 480 image has a corresponding of pM2 which can be used to make up the averaged image Once the two 640 x 480 time filtered images with pixel values equal to pM l and pM2 have been generated a so-called movement band 640 x 480 resolution image is generated by taking each of the pixels of these averaged images and calculating the absolute difference between pMl and ρM2 by finding the magnitude of the difference between each of the individual pixels obtained by subtracting pMl from pM2. In this manner, a 640 x 480 image is obtained which only displays events that occur in the frequency band between 1.25 Hz and 4 Hz. Each pixel of the movement band image has an 8 bit resolution In step 3, once an image has been filtered using the movement band, the filtered image has a threshold applied to create a map of significant movement in the characteristic frequency band defined by kl and k2. The study of the temporal dynamics of these highlighted pixels is used to decide whether or not flames are present m the video image The best value for this threshold, based on the observation of outdoor petrol flames is equal to a value of 5% of the dynamic range of values in the 640 x 480 8 bit movement band image, is tl = 13, rounded up to the nearest whole number In the application written in LabYiew™, the user of the system can set this value to an arbitrary value between 0 and 255 using the graphical user interface provided by LabYiew™ If a pixel value of the movement band image is greater than the threshold value, it is entered as 1 into the threshold map. If a pixel value of the movement band image is lower than the threshold value it is entered as 0 into the threshold map The threshold map is a Boolean image of 640 x 480 pixels where non-thresholded pixels have a value of zero, and thresholded pixels have a value of one. In step 4, the "awareness map" is a subset of the "threshold map". In order to generate the awareness map, each pixel in the threshold map defined in step 3 has an awareness level, which is an indication of the likelihood of a flame existing within that particular pixel If the awareness level, increases above a user-defined threshold defined as the integer t2 (nominal value of 40), then the thresholded pixel is registered with binary value 1 , into the awareness map. The "awareness map" is a 640 x 480 Boolean image An integer defined as the awareness level is generated for each of the pixels in the "awareness map" The value of the awareness level is calculated bv comparing successive frames of the "awareness map" When the program begins, the value of the awareness level for each of the pixels is equal to zero. If a pixel in the awareness map changes from 1 to 0 or changes from 0 to 1 between successive video frames, then 2 is added to the value of the awareness level for that pixel If a pixel in the awareness map does not change (i.e. stays at 0 or stays at 1) between successive frames, then 1 is subtracted from the awareness level. The minimum value of the awareness level is zero i.e. if the awareness level becomes negative it is immediately set to zero. This means that flickering movements within the frequency band defined by kl and k2 will cause a rapid increase in the awareness level for each individual pixel These flickering movements have been observed by the inventors to be characteristic of flame. In step 5, a number of parameters are calculated so that the algorithm can decide whether a flame is present in the video images that are being processed. These parameters may be plotted in a moving graph or used to determine a confidence of a flame detection event. The PlotO parameter is a constant equal to an integer called the Alarm Level, user defined with a default value of 20. A flame is registered in the system when the Plot2 parameter described below exceeds the Alarm Level, which has a nominal value of 20. Low values of Alarm Level mean that the system is fast to react to possible flames in the picture, but is susceptible to false alarm events. High values of Alarm Level mean that the system is insensitive to false alarm events, but is slow to react to possible flames in the picture. The Plotl and Plot2 parameters are calculated in the following manner by scanning horizontally across the "awareness map" As the scan is performed from left to right across each horizontal line of the "awareness map" the value of adjacent pixels are compared and a value is entered into an edge counter that starts at a value of zero. If adjacent pixels are equal to one another then nothing is added to the edge counter If adjacent pixels are not equal to one another then 1 is added to the edge counter At the same time, the total number of pixels with binary value 1 is counted and added into a pixel counter. This operation is performed for each of the 480 hnes of the image (from top to bottom) and the values for the edge counter and the pixel counter are summed. At the end of this procedure two integers have been calculated. These are: Edgesum = Sum of horizontal edge transitions in awareness map as described. Pixelsum = Total number of pixels with binary value 1 in the awareness map as described above In parallel with this the coordinates of the pixels with binary v τ alue 1 are noted. A region of interest is defined bv noting the following quantities 1 x l = Minimum x coordinate x2 = Maximum x coordinate yl = Minimum y coordinate v2 = Maximum y coordinate The area of the region of interest is defined as: ROIarea = (x2 - xl) x (y2 - yl) The Plotl parameter is calculated as follows Plotl = (Pixelsum - Edgesum) /ROIarea This is a measure of the sparseness of the flicker in the image, and can be used to discriminate between treehke objects and more densely packed flame hke objects. If Plotl is less than zero then the image is sparse and if Plotl is greater than zero the image is dense. The Plot2 parameter is calculated as follows Plot2 = Pixelsum/ROIarea In step 6, prior to performing the final flame decision, the "plot" parameters described above are smoothed using a user defined dimensionless time constant k3 with a time constant of 8 0 seconds k3 is calculated in the following manner k3 = 8 0s/ ( time in seconds between successive frames) 10 k3 is applied between successive values of Plotl and Plot2 obtained from successive video images using the same filtering techniques as used b-. kl and k2 described in a previous part of the document This reduces the noise level in the plotted parameters and reduces the false alarm rate The decision w hether a flame is occurring within the video image has ru o operator selectable modes normal mode and tree filter mode \\ hen it has been determined that a flame is occurring in the picture, an alarm is set off to indicate the presence of a flame threat Normal flame decision mode is employed when no treelike objects are in the picture In 20 this mode, Plotl is ignored Here, an alarm is triggered when the Plot2 parameter is greater than the user defined PlotO parameter In tree filter mode, it was found that the flicker movement detected by the algorithm was sparsely distributed for a treehke object and dense distributed for a fire A _?_ ■ positive value of Plot l indicates a denseh packed arrangement of flickering pixels l e a flame, and a negative value of Plotl indicates a sparseh packed arrangement of flickering pixels l e leaves on a tree moving in the wind The alarm for a flame w ith the tree filter on only occurs when Plot 2 is greater than the PlotO AND Plotl is greater than zero 30 The inventors have found that inclusion of the tree filter increases the selectivity of the system, but also increases the amount of time required to reach a decision on whether a flame is present in the picture 35 Additional Embodiments The algorithm described above has been optimised by empirical methods and the constants determining the funcuon of the algoπthm may be chosen to achieve optimum results within the scene environment Further it can be seen that systems comprising colour video images, or with differing pixel resoluαons may be processed bv such algoπthms. Extensions to the algonthms above will be obvious to those expeπenced in the art. The techniques and man-machine interface described in the applicants smoke detecuon system descnbed in PCT application GB99 / 03459 can be applied to the flame detecuon system descπbed above

Claims: Claims A flame detection algorithm that processes a sequence of video images, to detect sequences of images of flames A system implementing the flame detection algorithm comprising a video source, a frame grabber and a processor and a means to trigger an external alarm when flame is detected An algorithm for filtering live or recorded video images so that changes within a well-defined frequency band, characteristic of flame like behaviour, is registered An algorithm that classifies changes in a sequence of images between flicker hke behaviour and non flicker hke behaviour. An algorithm comprising the filters of claim 3 and claim 4 yielding a binary lmage of areas of flame like behaviour in a sequence of images An algorithm to compute the parameters of sparseness, and edge to volume ratio in the binary image resulting from the algorithm of claim 5 An algorithm that determines, on the basis of the values returned by the algorithm of claim 6, whether to sound an alarm An optimal set of parameters for the algorithms of claims 3, 4, 5 and 6 An algorithm that uses the technique in claim 3, followed bv the technique in claim 4, followed by the technique in claim 5 to generate a binary image which is processed by the technique in claim 6 to generate parameters which can be used to decide whether a flame is occurring in the picture, which can differentiate between trees moving in the wind and flames, bv including an additional decision based on the technique described in claim ~

Inventors: AIRD ROBERT FREDERICK, AIRD, ROBERT, FREDERICK
Applicants: AIRD ROBERT FREDERICK, VSD LTD, AIRD, ROBERT, FREDERICK
Application year: 2000
Main classification: G08B17
IPC codes: G08B17