|Publication number||US7006666 B2|
|Application number||US 09/990,868|
|Publication date||Feb 28, 2006|
|Filing date||Nov 21, 2001|
|Priority date||Nov 21, 2001|
|Also published as||US20030095686|
|Publication number||09990868, 990868, US 7006666 B2, US 7006666B2, US-B2-7006666, US7006666 B2, US7006666B2|
|Inventors||Dennis L. Montgomery|
|Original Assignee||Etreppid Technologies, Llc|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (12), Referenced by (17), Classifications (52), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
The present invention pertains generally to video image collection. More particularly, the present invention relates to methods and apparatus for detecting and reacting to change in a field of view of a video camera.
Casinos are multi-billion dollar industries. Even though legalized gambling is a relatively young industry in this country, it continues to grow.
A necessary element for an effective casino operation is an efficient casino management and security system. Casinos spend substantial amounts of money to observe gamblers, dealers and others in the casino, using both electronic surveillance equipment and live personnel. Electronic surveillance usually takes the form of electronic camera globes or visible cameras (collectively cameras) which blanket the walls and ceilings of the casinos. These cameras generate enormous amounts of data, which has conventionally been stored on videotapes for possible later retrieval.
In most instances, cameras are stationed in areas where at least some part of the image frame being taped does not change often. For example, a camera may be stationed outside a vault or door in a stairwell. It is only when an action occurs, such as someone enters the vault or crosses a door in the stairwell that a portion of the image frames changes, and even then other portions of the image frame do not change.
Since the image frames change infrequently, it is desirable to use image compression to lower the transmission and storage requirements. Once image frames have been compressed, it is still desirable to be able to further process the compressed image frames to determine if an event has occurred.
For example, it is desirable to be able to detect that the image frames have changed due to a change in the field of view (e.g., someone crossing through the field of view) without having to decompress the previously compressed image frames. The present invention provides a mechanism for detecting that a change in the field of view previously occurred in the data associated with sequentially stored frames without having to decompress image frames and also provides several mechanisms for reacting to the detection of the change.
A method of detecting an occurrence of an event that exists within a sequence of stored frames relating to a scene is described, as well as methods that operate upon the data relating to the scene once an event is detected.
The method of detecting occurrence of an event includes comparing a first stored frame to a later stored frame to determine whether a change in size between the frames exists that is greater than a predetermined threshold. In a preferred embodiment, the first and later stored frames are compressed, and operated upon while compressed to determine the occurrence of an event.
Methods of operating upon the data relating to the scene once an event is detected include providing a still image at intervals, typically every 5–10 frames using the data from at least the recording device that detected the event. In a further embodiment, still images from other recording devices that are associated in a predetermined manner with the recording device that detected the event are also obtained at intervals.
The present invention is illustrated by way of example, and not limitation, in the figures of the accompanying drawings in which like references denote similar elements, and in which:
Methods and apparatus for detecting and reacting to a change in the field of view of a video camera whose output is digitized, and typically compressed, are described. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be evident, however, to one skilled in the art that the present invention may be practiced in a variety of compressed data systems in which the occurrence of an event is reflected in the size of the compressed data. In other instances, well-known operations, steps, functions and elements are not shown in order to avoid obscuring the invention.
Parts of the description will be presented using terminology commonly employed by those skilled in the art to convey the substance of their work to others skilled in the art, such as compression, pattern recognition, frames, images, field of view, and so forth. Various operations will be described as multiple discrete steps performed in turn in a manner that is most helpful in understanding the present invention. However, the order of description should not be construed as to imply that these operations are necessarily performed in the order that they are presented, or even order dependent. Lastly, repeated usage of the phrases “in one embodiment,” “an alternative embodiment,” or an “alternate embodiment” does not necessarily refer to the same embodiment, although it may.
While the system as described above illustrates one manner in which the advantages of the present invention described herein can be used, this is exemplary. For example, the computers 120 and 130 could be implemented as a network of computers or as a device other than a computer that contains a processor that is able to implement the inventions described herein. Many other variants are possible. And while a device such as mentioned will typically include a processor of some type, such as an Intel Pentium 4 microprocessor or a DSP in conjunction with program instructions that are written based upon the teachings herein, other hardware that implements the present invention can also be used, such as a field programmable gate array. The program instructions are preferably written in C++ or some other computer programming language. For repetitive routines that are used repeatedly, these can be written in assembler for faster processing. As mentioned above, the present invention operates upon data preferably formatted into a matrix array within a frame, as described further hereinafter. For data that is not temporally related, the blocks can be formatted into frames that may or may not have the ability to store the same amount of data. For data that is temporally related, such as image and audio data, each image and its related audio data will preferably have its own frame, although that is not a necessity, since image and audio data can be stored on separate tracks and analyzed independently.
According to one embodiment, the computer 120 or server 130 is assumed to have received digital image/audio frames that relate to a sequence, which sequence has been digitized into frames and compressed in some manner. These frames may be compressed in essentially real-time and operated upon, or compressed and transmitted for storage to in another location. Further, there are situations when compression is unnecessary, such as if pattern recognition between frames is performed during substantially real time operations on frames.
In some instances, the data obtained corresponds to locations where the scenes being monitored and stored do not change often. For example, a camera may be stationed outside a vault or door in a stairwell and record the scene, which is then received by the computer 100. It is only when, someone enters the vault or crosses a door in the stairwell that the image frame changes substantially (since even between sequential frames that record the same scene, changes in the data representing the frame will exist due to at least noise effects).
For image frames corresponding to the scene that have been compressed, it is desirable to be able to further operate upon the compressed image frames, for example, to determine if an event has occurred in the image frames. For example, it is desirable to be able to detect that the image frames have changed due to a change in the field of view (e.g., someone crossing through the field of view) without having to decompress the images. The present invention provides a mechanism for detecting that a change has occurred in the field of view without having to decompress image frames and also provides several mechanisms for reacting to the detection of the change.
Whether the frames 208 a–n, 210 a–n, 212 a–n, and 214 a–n are operated upon in essentially real-time, stored and operated upon, compressed and then operated upon, compressed, stored and then operated upon, or compressed, transmitted, stored at another location and then operated upon, the inventions described herein are equally applicable. For a still scene having a sequence of frames, the uncompressed frames will have a certain relatively constant size, whether it has been compressed or not, and whether there is action or movement or not, because the same number of bits is used to represent the frame. Once compressed, however, the amount of data needed to represent each frame that is of the same scene will be substantially less than the same scene that also has other objects superimposed thereon, and that compressed scene will compress to roughly the same size, though there will be some non-uniformity due to noise and other factors. Thus, as shown in
If there was an event determined, operation 306 can be instituted, which will cause a sequence of still images, obtained at some interval from each other that follow the initiation of the event to be obtained. These still frames represent a significant reduction from the total number of frames that a particular camera has obtained. By making the interval between every 4th to 10th frame, preferably every 6th frame, one of the still images obtained will contain a “best view” of the object that has caused the increase in size of the compressed frame. With each still frame obtained, operations can be performed, such as transmitting, via email or other transmission mechanism shown in step 308, each still image to a predetermined location. If desired, image recognition can be performed on each still image, as shown by step 309 indicating that the still frame should be processed for external pattern recognition of an object, such as a person or article, as performed in and described by step 310, detailed hereinafter.
The step 310 external pattern recognition is directed to looking for previously obtained external patterns within either compressed or uncompressed data representing frames. This pattern recognition is shown as being initiated by step 305 after a compressed frame has been acted upon, which is preferred for previously compressed data, since external pattern recognition need not be performed on frames that have roughly the same size that indicates no motion is taking place. For frames that have not been compressed, external pattern recognition can occur on the uncompressed data that is being searched for to determine if external patterns of significance exist therein, using techniques such as described in U.S. patent application entitled “Method And Apparatus For Determining Patterns Within Adjacent Blocks of Data” filed on Oct. 31, 2001 and mentioned above, with at least one separate thread preferably being initiated for each different external pattern that is being searched for, and instead of a reference frame being used to obtain search blocks, the external pattern is used to obtain search blocks that are searched for in the target frame. Of course, other conventional pattern recognition techniques can be used.
The external patterns of interest are contained in a table of preferably both uncompressed and compressed files, and which of the files being used will depend upon whether pattern recognition will be made based upon uncompressed data or compressed data, respectively. The compressed objects of interest are stored using the same compression technique that is used to obtain compression of the frames, thus allowing for more efficient pattern recognition.
If as a result of the external pattern matching a match is found to exist, as shown by step 312, a match indication will cause an alert of some type to be generated in step 314. This can occur at either computer 120 or server 130. An alert can be for example, an indication on the monitor of a security guard or other authority indicating the identity of the person identified by the external pattern recognition or the location of the event, or it could be an audible alert over a wireless radio to a security guard to confront someone with a certain description at a certain location. An example of an alert will be described in connection with
Additionally or alternatively, process 300 allows a security guard observing the field of view of the camera on a monitor to tag or mark an object/person that caused the change in the size of the frames so as to permit easy following of the person as the person navigates in front of the camera and appears on the monitor, as shown by step 316. Different shapes and colors of tags can be used to differentiate between different levels of scrutiny that should be applied to each object. For example, one shaped object, such as a triangle, can be used to designate an external pattern that has a high priority, whereas another shaped object, such as a circle, can be used to designate an external pattern that has a low priority. Similarly, or in combination with the shapes being used, one color, such as red, can be used to designate a different high priority, and another color, such as green, can be used to designate a different low priority.
Once an object of interest is located, tagging that object can be used to cause the marker to appear adjacent to the image. Of course, this feature can be turned off if desired.
Displays 402, 404, 406, and 408 also show in a corner of the display an alerts region. As described in connection with
Thus, methods and apparatus for external pattern recognition have been described. Although the present invention has been described with reference to specific exemplary embodiments, it will be evident to one of ordinary skill in the art that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the invention as set forth in the claims. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US4120004 *||Apr 11, 1977||Oct 10, 1978||Coutta John M||Surveillance system|
|US4233631 *||Oct 4, 1978||Nov 11, 1980||Cbs Inc.||Television system for displaying and recording paths of motion|
|US4841366 *||Mar 31, 1987||Jun 20, 1989||Nec Home Electronics Ltd.||Cyclic noise reducing apparatus|
|US5471239 *||Mar 26, 1993||Nov 28, 1995||Solid State Logic Limited||Detecting scene changes|
|US5844482 *||May 20, 1997||Dec 1, 1998||Guthrie; Warren E.||Tagging system using motion detector|
|US5901246 *||Jun 6, 1995||May 4, 1999||Hoffberg; Steven M.||Ergonomic man-machine interface incorporating adaptive pattern recognition based control system|
|US6011901 *||Nov 26, 1997||Jan 4, 2000||Timepres Corporation||Compressed digital video record and playback system|
|US6434320 *||Oct 13, 2000||Aug 13, 2002||Comtrak Technologies, Llc||Method of searching recorded digital video for areas of activity|
|US6462656 *||Dec 29, 2000||Oct 8, 2002||Hill-Rom Services, Inc.||Personnel and asset tracking method and apparatus|
|US6757008 *||Sep 26, 2000||Jun 29, 2004||Spectrum San Diego, Inc.||Video surveillance system|
|US6810134 *||May 7, 2001||Oct 26, 2004||Koninklijke Philips Electronics N.V.||Method, system and apparatus for choosing an optimal candidate value for block matching|
|WO2001020489A1||Sep 18, 2000||Mar 22, 2001||Nicholson Vincent J||Casino table automatic video strategic event annotation and retrieval|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US8402494 *||Mar 23, 2010||Mar 19, 2013||Conviva Inc.||Switching content|
|US8458333||Aug 30, 2007||Jun 4, 2013||Conviva Inc.||Centrally coordinated peer assignment|
|US8489923||May 14, 2010||Jul 16, 2013||Conviva Inc.||Detecting problems in content distribution|
|US8566436||Mar 23, 2010||Oct 22, 2013||Conviva Inc.||Data client|
|US8799711||Jun 13, 2013||Aug 5, 2014||Conviva Inc.||Detecting problems in content distribution|
|US8874725||May 14, 2010||Oct 28, 2014||Conviva Inc.||Monitoring the performance of a content player|
|US8874964||Jun 13, 2013||Oct 28, 2014||Conviva Inc.||Detecting problems in content distribution|
|US9100288||May 14, 2010||Aug 4, 2015||Conviva Inc.||Augmenting the functionality of a content player|
|US9124601||Sep 6, 2013||Sep 1, 2015||Conviva Inc.||Data client|
|US9203913||May 14, 2010||Dec 1, 2015||Conviva Inc.||Monitoring the performance of a content player|
|US9204061 *||Feb 14, 2013||Dec 1, 2015||Conviva Inc.||Switching content|
|US9239750||Mar 5, 2014||Jan 19, 2016||Conviva Inc.||Detecting problems in content distribution|
|US9264780||Jul 12, 2011||Feb 16, 2016||Conviva Inc.||Managing synchronized data requests in a content delivery network|
|US9407494||Aug 30, 2007||Aug 2, 2016||Conviva Inc.||Reassigning source peers|
|US9549043||Jul 12, 2011||Jan 17, 2017||Conviva Inc.||Allocating resources in a content delivery environment|
|US20110157355 *||Dec 28, 2009||Jun 30, 2011||Yuri Ivanov||Method and System for Detecting Events in Environments|
|US20130219442 *||Feb 14, 2013||Aug 22, 2013||Conviva Inc.||Switching content|
|U.S. Classification||382/103, 375/E07.181, 348/E05.067, 375/E07.206, 348/143, 370/395.64, 375/E07.146, 382/118, 348/E07.09, 375/E07.226, 348/E07.086, 375/E07.154, 386/E05.001|
|International Classification||G06T7/20, G08B13/194, H04N7/18, H04N5/14, G06K9/00, H04N5/76, H04N5/77, H04N7/30, H04N7/26|
|Cooperative Classification||G06T7/254, H04N19/60, H04N19/103, H04N19/90, H04N19/172, H04N19/146, H04N7/181, G08B13/19613, G08B13/19602, G08B13/19691, G08B13/19667, H04N5/147, H04N5/76, H04N5/77, G08B13/19686, H04N7/188|
|European Classification||G08B13/196A, G08B13/196U4, G08B13/196A5, G08B13/196S1, G08B13/196U6, H04N7/26A8P, H04N7/26A4C, G06T7/20D, H04N7/18C, H04N7/18E, H04N7/26Z4, H04N7/30, H04N7/26A6E, H04N5/76|
|Feb 22, 2002||AS||Assignment|
Owner name: ETREPPID TECHNOLOGIES, LLC, NEVADA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MONTGOMERY, DENNIS L.;REEL/FRAME:012617/0070
Effective date: 20020124
|Oct 5, 2009||REMI||Maintenance fee reminder mailed|
|Feb 28, 2010||LAPS||Lapse for failure to pay maintenance fees|
|Apr 20, 2010||FP||Expired due to failure to pay maintenance fee|
Effective date: 20100228