US 7,657,104 B2Grant
Identifying image type in a capture system
Issue Date:2010-02-02
•22 Claims
•10 Drawing Sheets
Abstract
Visual objects can be classified according to image type. In one embodiment, the present invention includes capturing a visual object, and decompressing the visual object to a colorspace representation exposing each pixel. The contribution of each pixel to a plurality of image types can then be determined. Then, the contributions can be combined, and the image type of the visual object can be determined based on the contributions.
Metadata
Assignee
- McAfee, Inc.
Inventors
- William Deninger
- Erik de la Iglesia
Application Information
Application Number:US 11/284,553
Filing Date:2005-11-21
Priority Date:2005-11-21
Art Unit:2624
Classifications
IPC:
G06K9/62
Patent Drawings (10 sheets)
Description
Field of the Invention
[0001] The present invention relates to computer networks, and in particular, to a capture device.
Background
[0002] Computer networks and systems have become indispensable tools for modern business. Modem enterprises use such networks for communications and for storage. The information and data stored on the network of a business enterprise is often a highly valuable asset. Modem enterprises use numerous tools to keep outsiders, intruders, and unauthorized personnel from accessing valuable information stored on the network. These tools include firewalls, intrusion detection systems, and packet sniffer devices. However, once an intruder has gained access to sensitive content, there is no network device that can prevent the electronic transmission of the content from the network to outside the network. Similarly, there is no network device that can analyse the data leaving the network to monitor for policy violations, and make it possible to track down information leeks. What is needed is a comprehensive system to capture, store, and analyse all data communicated using the enterprises network.
Brief Description of the Drawings
[0003] The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings in which like reference numerals refer to similar elements and in which:
[0004] FIG. 1 is a block diagram illustrating a computer network connected to the Internet;
[0005] FIG. 2 is a block diagram illustrating one configuration of a capture system according to one embodiment of the present invention;
[0006] FIG. 3 is a block diagram illustrating the capture system according to one embodiment of the present invention;
[0007] FIG. 4 is a block diagram illustrating an object assembly module according to one embodiment of the present invention;
[0008] FIG. 5 is a block diagram illustrating an object store module according to one embodiment of the present invention;
[0009] FIG. 6 is a block diagram illustrating an example hardware architecture for a capture system according to one embodiment of the present invention;
[0010] FIG. 7 is a block diagram illustrating an object classification module according to one embodiment of the present invention;
[0011] FIG. 8 is a block diagram illustrating an image classifier according to one embodiment of the present invention;
[0012] FIG. 9 is a block diagram illustrating an pixel mapping table according to one embodiment of the present invention; and
[0013] FIG. 10 is a flow diagram illustrating image classification according to one embodiment of the present invention.
Detailed Description
[0014] Although the present system will be discussed with reference to various illustrated examples, these examples should not be read to limit the broader spirit and scope of the present invention. Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the computer science arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared and otherwise manipulated.
[0015] It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers or the like. It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise, it will be appreciated that throughout the description of the present invention, use of terms such as “processing”, “computing”, “calculating”, “determining”, “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
[0016] As indicated above, one embodiment of the present invention is instantiated in computer software, that is, computer readable instructions, which, when executed by one or more computer processors/systems, instruct the processors/systems to perform the designated actions. Such computer software may be resident in one or more computer readable media, such as hard drives, CD-ROMs, DVD-ROMs, read-only memory, read-write memory and so on. Such software may be distributed on one or more of these media, or may be made available for download across one or more computer networks (e.g., the Internet). Regardless of the format, the computer programming, rendering and processing techniques discussed herein are simply examples of the types of programming, rendering and processing techniques that may be used to implement aspects of the present invention. These examples should in no way limit the present invention, which is best understood with reference to the claims that follow this description.
[0017] Networks
[0018] FIG. 1 illustrates a simple prior art configuration of a local area network (LAN) 10 connected to the Internet 12. Connected to the LAN 102 are various components, such as servers 14, clients 16, and switch 18. There are numerous other known networking components and computing devices that can be connected to the LAN 10. The LAN 10 can be implemented using various wireline or wireless technologies, such as Ethernet and 802.11b. The LAN 10 may be much more complex than the simplified diagram in FIG. 1 , and may be connected to other LANs as well.
[0019] In FIG. 1 , the LAN 10 is connected to the Internet 12 via a router 20. This router 20 can be used to implement a firewall, which are widely used to give users of the LAN 10 secure access to the Internet 12 as well as to separate a company's public Web server (can be one of the servers 14) from its internal network, i.e., LAN 10. In one embodiment, any data leaving the LAN 10 towards the Internet 12 must pass through the router 12. However, there the router 20 merely forwards packets to the Internet 12. The router 20 cannot capture, analyze, and searchably store the content contained in the forwarded packets.
[0020] One embodiment of the present invention is now illustrated with reference to FIG. 2 . FIG. 2 shows the same simplified configuration of connecting the LAN 10 to the Internet 12 via the router 20. However, in FIG. 2 , the router 20 is also connected to a capture system 22. In one embodiment, the router 12 splits the outgoing data stream, and forwards one copy to the Internet 12 and the other copy to the capture system 22.
[0021] There are various other possible configurations. For example, the router 12 can also forward a copy of all incoming data to the capture system 22 as well. Furthermore, the capture system 22 can be configured sequentially in front of, or behind the router 20, however this makes the capture system 22 a critical component in connecting to the Internet 12. In systems where a router 12 is not used at all, the capture system can be interposed directly between the LAN 10 and the Internet 12. In one embodiment, the capture system 22 has a user interface accessible from a LAN-attached device, such as a client 16.
[0022] In one embodiment, the capture system 22 intercepts all data leaving the network. In other embodiments, the capture system can also intercept all data being communicated inside the network 10. In one embodiment, the capture system 22 reconstructs the documents leaving the network 10, and stores them in a searchable fashion. The capture system 22 can then be used to search and sort through all documents that have left the network 10. There are many reasons such documents may be of interest, including network security reasons, intellectual property concerns, corporate governance regulations, and other corporate policy concerns.
[0023] Capture System
[0024] One embodiment of the present invention is now described with reference to FIG. 3 . FIG. 3 shows one embodiment of the capture system 22 in more detail. The capture system 22 includes a network interface module 24 to receive the data from the network 10 or the router 20. In one embodiment, the network interface module 24 is implemented using one or more network interface cards (NIC), e.g., Ethernet cards. In one embodiment, the router 20 delivers all data leaving the network to the network interface module 24.
[0025] The captured raw data is then passed to a packet capture module 26. In one embodiment, the packet capture module 26 extracts data packets from the data stream received from the network interface module 24. In one embodiment, the packet capture module 26 reconstructs Ethernet packets from multiple sources to multiple destinations for the raw data stream.
[0026] In one embodiment, the packets are then provided the object assembly module 28. The object assembly module 28 reconstructs the objects being transmitted by the packets. For example, when a document is transmitted, e.g. as an email attachment, it is broken down into packets according to various data transfer protocols such as Transmission Control Protocol/Internet Protocol (TCP/IP) and Ethernet. The object assembly module 28 can reconstruct the document from the captured packets.
[0027] One embodiment of the object assembly module 28 is now described in more detail with reference to FIG. 4 . When packets first enter the object assembly module, they are first provided to a reassembler 36. In one embodiment, the reassembler 36 groups—assembles—the packets into unique flows. For example, a flow can be defined as packets with identical Source IP and Destination IP addresses as well as identical TCP Source and Destination Ports. That is, the reassembler 36 can organize a packet stream by sender and recipient.
[0028] In one embodiment, the reassembler 36 begins a new flow upon the observation of a starting packet defined by the data transfer protocol. For a TCP/IP embodiment, the starting packet is generally referred to as the “SYN” packet. The flow can terminate upon observation of a finishing packet, e.g., a “Reset” or “FIN” packet in TCP/IP. If now finishing packet is observed by the reassembler 36 within some time constraint, it can terminate the flow via a timeout mechanism. In an embodiment using the TPC protocol, a TCP flow contains an ordered sequence of packets that can be assembled into a contiguous data stream by the ressembler 36. Thus, in one embodiment, a flow is an ordered data stream of a single communication between a source and a destination.
[0029] The flown assembled by the reassembler 36 can then is provided to a protocol demultiplexer (demux) 38. In one embodiment, the protocol demux 38 sorts assembled flows using the TCP Ports. This can include performing a speculative classification of the flow contents based on the association of well-known port numbers with specified protocols. For example, Web Hyper Text Transfer Protocol (HTTP) packets—i.e., Web traffic—are typically associated with port 80, File Transfer Protocol (FTP) packets with port 20, Kerberos authentication packets with port 88, and so on. Thus in one embodiment, the protocol demux 38 separates all the different protocols in one flow.
[0030] In one embodiment, a protocol classifier 40 also sorts the flows in addition to the protocol demux 38. In one embodiment, the protocol classifier 40—operating either in parallel or in sequence with the protocol demux 38—applies signature filters to the flows to attempt to identify the protocol based solely on the transported data. Furthermore, the protocol demux 38 can make a classification decision based on port number, which is subsequently overridden by protocol classifier 40. For example, if an individual or program attempted to masquerade an illicit communication (such as file sharing) using an apparently benign port such as port 80 (commonly used for HTTP Web browsing), the protocol classifier 40 would use protocol signatures, i.e., the characteristic data sequences of defined protocols, to verify the speculative classification performed by protocol demux 38.
[0031] In one embodiment, the object assembly module 28 outputs each flow organized by protocol, which represent the underlying objects. Referring again to FIG. 3 , these objects can then be handed over to the object classification module 30 (sometimes also referred to as the “content classifier”) for classification based on content. A classified flow may still contain multiple content objects depending on the protocol used. For example, protocols such as HTTP (Internet Web Surfing) may contain over 100 objects of any number of content types in a single flow. To deconstruct the flow, each object contained in the flow is individually extracted, and decoded, if necessary, by the object classification module 30.
[0032] The object classification module 30 uses the inherent properties and signatures of various documents to determine the content type of each object. For example, a Word document has a signature that is distinct from a PowerPoint document, or an Email document. The object classification module 30 can extract out each individual object and sort them out by such content types. Such classification renders the present invention immune from cases where a malicious user has altered a file extension or other property in an attempt to avoid detection of illicit activity.
[0033] In one embodiment, the object classification module 30 determines whether each object should be stored or discarded. In one embodiment, this determination is based on a various capture rules. For example, a capture rule can indicate that Web Traffic should be discarded. Another capture rule can indicate that all PowerPoint documents should be stored, except for ones originating from the CEO's IP address. Such capture rules can be implemented as regular expressions, or by other similar means. Several embodiments of the object classification module 30 are described in more detail further below.
[0034] In one embodiment, the capture rules are authored by users of the capture system 22. The capture system 22 is made accessible to any network-connected machine through the network interface module 24 and user interface 34. In one embodiment, the user interface 34 is a graphical user interface providing the user with friendly access to the various features of the capture system 22. For example, the user interface 34 can provide a capture rule authoring tool that allows users to write and implement any capture rule desired, which are then applied by the object classification module 30 when determining whether each object should be stored. The user interface 34 can also provide pre-configured capture rules that the user can select from along with an explanation of the operation of such standard included capture rules. In one embodiment, the default capture rule implemented by the object classification module 30 captures all objects leaving the network 10.
[0035] If the capture of an object is mandated by the capture rules, the object classification module 30 can also determine where in the object store module 32 the captured object should be stored. With reference to FIG. 5 , in one embodiment, the objects are stored in a content store 44 memory block. Within the content store 44 are files 46 divided up by content type. Thus, for example, if the object classification module determines that an object is a Word document that should be stored, it can store it in the file 46 reserved for Word documents. In one embodiment, the object store module 32 is integrally included in the capture system 22. In other embodiments, the object store module can be external—entirely or in part—using, for example, some network storage technique such as network attached storage (NAS) and storage area network (SAN).
[0036] Tag Data Structure
[0037] In one embodiment, the content store is a canonical storage location, simply a place to deposit the captured objects. The indexing of the objects stored in the content store 44 is accomplished using a tag database 42. In one embodiment, the tag database 42 is a database data structure in which each record is a “tag” that indexes an object in the content store 44 and contains relevant information about the stored object. An example of a tag record in the tag database 42 that indexes an object stored in the content store 44 is set forth in Table 1:
[0038]
| TABLE 1 | |
|---|---|
| Field Name | Definition |
| MAC Address | Ethernet controller MAC address unique to each |
| capture system | |
| Source IP | Source Ethernet IP Address of object |
| Destination IP | Destination Ethernet IP Address of object |
| Source Port | Source TCP/IP Port number of object |
| Destination Port | Destination TCP/IP Port number of the object |
| Protocol | IP Protocol that carried the object |
| Instance | Canonical count identifying object within a |
| protocol capable of carrying multiple data | |
| within a single TCP/IP connection | |
| Content | Content type of the object |
| Encoding | Encoding used by the protocol carrying object |
| Size | Size of object |
| Timestamp | Time that the object was captured |
| Owner | User requesting the capture of object (rule author) |
| Configuration | Capture rule directing the capture of object |
| Signature | Hash signature of object |
| Tag Signature | Hash signature of all preceding tag fields |
[0039] There are various other possible tag fields, and some embodiments can omit numerous tag fields listed in Table 1. In other embodiments, the tag database 42 need not be implemented as a database, and a tag need not be a record. Any data structure capable of indexing an object by storing relational data over the object can be used as a tag data structure. Furthermore, the word “tag” is merely descriptive, other names such as “index” or “relational data store,” would be equally descriptive, as would any other designation performing similar functionality.
[0040] The mapping of tags to objects can, in one embodiment, be obtained by using unique combinations of tag fields to construct an object's name. For example, one such possible combination is an ordered list of the Source IP, Destination IP, Source Port, Destination Port, Instance and Timestamp. Many other such combinations including both shorter and longer names are possible. In another embodiment, the tag can contain a pointer to the storage location where the indexed object is stored.
[0041] The tag fields shown in Table 1 can be expressed more generally, to emphasize the underlying information indicated by the tag fields in various embodiments. Some of these possible generic tag fields are set forth in Table 2:
[0042]
| TABLE 2 | |
|---|---|
| Field Name | Definition |
| Device Identity | Identifier of capture device |
| Source Address | Origination Address of object |
| Destination | Destination Address of object |
| Address | |
| Source Port | Origination Port of object |
| Destination Port | Destination Port of the object |
| Protocol | Protocol that carried the object |
| Instance | Canonical count identifying object within a |
| protocol capable of carrying multiple data within | |
| a single connection | |
| Content | Content type of the object |
| Encoding | Encoding used by the protocol carrying object |
| Size | Size of object |
| Timestamp | Time that the object was captured |
| Owner | User requesting the capture of object (rule author) |
| Configuration | Capture rule directing the capture of object |
| Signature | Signature of object |
| Tag Signature | Signature of all preceding tag fields |
[0043] For many of the above tag fields in Tables 1 and 2, the definition adequately describes the relational data contained by each field. For the content field, the types of content that the object can be labeled as are numerous. Some example choices for content types (as determined, in one embodiment, by the object classification module 30) are JPEG, GIF, BMP, TIFF, PNG (for objects containing images in these various formats); Skintone, PDF, MSWord, Excel, PowerPoint, MSOffice (for objects in these popular application formats); HTML, WebMail, SMTP, FTP (for objects captured in these transmission formats); Telnet, Rlogin, Chat (for communication conducted using these methods); GZIP, ZIP, TAR (for archives or collections of other objects); Basic_Source, C++_Source, C_Source, Java_Source, FORTRAN_Source, Verilog_Source, VHDL_Source, Assembly_Source, Pascal_Source, Cobol_Source, Ada_Source, Lisp_Source, Perl_Source, XQuery_Source, Hypertext Markup Language, Cascaded Style Sheets, JavaScript, DXF, Spice, Gerber, Mathematica, Matlab, AllegroPCB, ViewLogic, TangoPCAD, BSDL, C_Shell, K_Shell, Bash_Shell, Bourne_Shell, FTP, Telnet, MSExchange, POP3, RFC822, CVS, CMS, SQL, RTSP, MIME, PDF, PS (for source, markup, query, descriptive, and design code authored in these high-level programming languages); C Shell, K Shell, Bash Shell (for shell program scripts); Plaintext (for otherwise unclassified textual objects); Crypto (for objects that have been encrypted or that contain cryptographic elements); Englishtext, Frenchtext, Germantext, Spanishtext, Japanesetext, Chinesetext, Koreantext, Russiantext (any human language text); Binary Unknown, ASCII Unknown, and Unknown (as catchall categories).
[0044] The signature contained in the Signature and Tag Signature fields can be any digest or hash over the object, or some portion thereof. In one embodiment, a well-known hash, such as MD5 or SHA1 can be used. In one embodiment, the signature is a digital cryptographic signature. In one embodiment, a digital cryptographic signature is a hash signature that is signed with the private key of the capture system 22. Only the capture system 22 knows its own private key, thus, the integrity of the stored object can be verified by comparing a hash of the stored object to the signature decrypted with the public key of the capture system 22, the private and public keys being a public key cryptosystem key pair. Thus, if a stored object is modified from when it was originally captured, the modification will cause the comparison to fail.
[0045] Similarly, the signature over the tag stored in the Tag Signature field can also be a digital cryptographic signature. In such an embodiment, the integrity of the tag can also be verified. In one embodiment, verification of the object using the signature, and the tag using the tag signature is performed whenever an object is presented, e.g., displayed to a user. In one embodiment, if the object or the tag is found to have been compromised, an alarm is generated to alert the user that the object displayed may not be identical to the object originally captured.
[0046] Image Classification
[0047] A user may be interested in the type of image and graphical objects being transmitted over the network. Furthermore, a user may want to query to system for object containing a specific type of image. Also, some policies regarding object transmission may depend on the type of an image. For example, a user may want to set up a policy to intercept all incoming or outgoing pornographic images. Alternatively, a user may want to search all emails sent out last week containing an X-ray image. Thus, in one embodiment, the capture system 22 identifies the image type of visual, image, or graphical objects. This identification can then be inserted into a tag associated with the object to help process user queries.
[0048] One embodiment of the present invention is now described with reference to FIG. 7 . In the embodiment described with reference to FIG. 7 , the image classification functionality is implemented in the object classification module 30 described above. However, the image classification process and modules may be implemented in other parts of the capture system 22 or as a separate module.
[0049] FIG. 7 illustrates a detailed diagram of one embodiment of the object classification module 30. Objects arriving from the object assembly module 28 are forwarded to the content store, and used to generate the tag to be associated with the object. For example, one module called the content classifier 62 can determine the content type of the object. The content type is then forwarded to the tag generator 68 where it is inserted into the content field described above. Various other such processing, such as protocol and size determination, is represented by other processing block 66.
[0050] In one embodiment, the image classifier 64 identifies the image type for a visual object that can be inserted into an field of the tag by the tag generator 68. For example, the tag described with reference to Table 1 and Table 2 can have an additional filed called “Image Type,” or “Color Tone,” or some other similar descriptive name. In one embodiment, the image classifier 64 is only activated if the content classifier 62 identifies the object as a visual object.
[0051] Image types or color tone types (these two descriptive terms are used interchangeably herein) are identifiable because certain kind of visual objects have identifiable patters of colors, color variations, shades or textures. For example, most astrological images contain a lot of black pixels.
[0052] A pixel (or picture element) is a basic unit of programmable color on a computer display or in a computer image. The color of a pixel can be described digitally according to a color space. For example, in the RBG color space, a pixel describes some blend of red, blue, and green components of the color spectrum. A 24-bit color system uses one byte to specify the intensity of each component. There are other color spaces. Pixels and their representations are well understood by those skilled in the art.
[0053] One embodiment of the image classifier 64 is now described with reference to FIG. 8 . The visual object, in one embodiment, if first received by a scaling module 80. The scaling module 80 selects a portion of the image, up to the entire image. For example, for a large image, it may be efficient to base image classification on a portion of the image. For example, whether an image is an astronomical photograph or not can be gleaned from a relatively small portion of a large image. Similarly, whether an image includes skintone can also be gleaned from a portion of the image. A skintone image can be defined as an image containing primarily pixels with an RGB color space similar to that of human skin. Further distinctions regarding the percentage of the image containing such RGB space are also possible, such as skintone divisions by ethnicity. Although a skintone image is likely to be pornographic in nature, it may also be an image of an inanimate object that happens to be a color within the RGB color space defined for skintone.
[0054] In one embodiment, the scaling module 80 performs scaling based on object size and shape. For a very large square object, for example, the scaling module 80 may select the middle ninth in the center of the image. For a long rectangular banner-like object, for example, the entire height would be selected, but only the middle third of the width. For smaller objects or high-priority objects, the entire object may be selected.
[0055] The selected portion of the visual object is then passed to the decompressor 82. The decompressor 82 decompresses the image from its native format—such as Joint Photographic Experts Group (JPEG) or Graphics Interchange Format (GIF)—into raw pixels of a standard color space, such as the 24-bit RBG color space. Thus, the output of the decompressor 82 is a group of pixels. Image decompression is well understood by those skilled in the art.
[0056] In one embodiment, the pixels from the decompressor 82 are passed to a quantizer 84. The quantizer 84 may quantize the pixels to reduce the number of possible pixels. For example, the quantizer 84 may only take the seven most significant bits of each pixel. Both the scaling module 80 and the quantizer 84 are optional and may be omitted from embodiments of the present invention that do not utilize scaling of the visual object or quantizing of the pixels.
[0057] In one embodiment, the pixels are provided to the pixel map module 86. The pixel map module 86, in one embodiment, maps each pixel to a contribution of the pixel to various image types. For example, in one embodiment, the image types can be skintone (human skin color), X-ray, graph images, and astrological. In a real-world embodiment, there can be many more image classifications or types including but not limited to geographic images, circuit design masks, banner advertisements and greyscales. Any type of image or visual object having distinguishing color characteristics can be given its classification using training.
[0058] However, in this simplified embodiment with only four possible image types, the pixel map module 86 maps a pixel to the contribution of the pixel to the likelihood that the image contains human skin, an X-ray image, a graph, or an astrological image. In one embodiment, the pixel map module 86 performs this mapping by accessing a pixel mapping table, an example of which is now discussed with reference to FIG. 9 .
[0059] FIG. 9 shows a table associating each pixel in a color space with a contribution to four possible image types. FIG. 9 actually shows two sets of contributions, Contribution A and Contribution B, to be discussed further below.
[0060] For example, using Contribution A of the table shown in FIG. 9 , pixel (0,0,4)—a very light blue pixel—would map to (0,1,2,1). This means that pixel (0,0,4) contributes 0 to the image possible being skintone, 1 to the image possible being an X-ray, 2 to the image possible being a graph, and 1 to the image possible being an astrological image. (This is just an example, not a real world mapping) The values 0 to 2 may be given names such as zero contribution for 0, weak contribution for 1, and strong contribution to 2.
[0061] As seen in FIG. 9 , in one embodiment, the pixel map module 86 can use different mappings for different pixels or groups of pixels. For example, certain colors may have more significance if found in specific locations in an image. Thus, pixels from the center of an image, for example, may be mapped using a different map than pixels from the edge of the image.
[0062] As an example, the pixel map table in FIG. 9 has two maps, shown as Contribution A and Contribution B. Other embodiments, can implement more maps as well. Thus, the pixel map module 86 can select which mapping to use based on information about each pixel.
[0063] Referring again to FIG. 8 , in one embodiment, the contributions of each pixel to the possible image types—as determined by the pixel map module 86—are provided to the classification module 88. In one embodiment, the classification module calculates the sum of all contributions for all pixels. This can be done in parallel with the pixel map module 86 performing the mapping. In this example, the end sum will be in the form of a four-tuple such as (12453, 354553, 25545, 53463), with each number of the four-tuple representing the contribution of all selected pixels to each possible image type.
[0064] In one embodiment, the classification module 88 next determines the image type (or multiple possible image types), by comparing the contributions against a threshold. For example, X-ray may be defined as anything about 200,000 to X-ray contribution (for an image this particular size) is probably an X-ray. If multiple thresholds are met, then multiple classifications may be assigned. Alternately, how much the threshold is exceeded may be a factor to elimination one of the possible image types.
[0065] In one embodiment, the thresholding performed by the classification module 88 is sensitive to the size of the image, and more specifically, to the number of pixels selected by the scaling module 80. Image types can be defined in terms of percentages, which may need to be translated to thresholds by the classification module 88. For example, an astrological image can be defined as an image having 95 percent black or “near black” pixels. The threshold for this definition can than be calculated as 1.9 times the number of pixels sampled, where 2 is the strong contribution.
[0066] Both the definitions of different image types and the pixel map table shown in FIG. 9 can be populated by training the system using known images. For example, by recording the RGB pixel histograms of several sample images, certain “strong” indicators (RGB values of strong presence in the samples) could be identified. Additionally, “weak” indicators (RGB values missing or present in only small quantities) can be obtained.
[0067] In one embodiment, by creating a contribution mapping with the strong indicators at 2, the weak indicators at zero, and the remaining RGB combinations at 1, a first attempt at “training” to recognize a new image type can be accomplished. This training would include further iterations based on negative samples (images deemed not to belong to the new image class). In one embodiment, for such “negative training” the indicators would be reversed.
[0068] The image classification, or classifications, as determined by the image classifier 64 can be inserted into the tag generated by the tag generator 68, or it can become associated with the visual object in some other manner. In one embodiment, the image type is appended to the content filed in the case of visual objects. For example, the content filed would say “JPEG image:: Skintone.”
[0069] One simplified embodiment of visual object classification processing is now described with reference to FIG. 10 . In block 102 a visual object is captured over a network, the visual object containing some form of visual content such as an image, graphics, or other type of visual content. In block 104, the visual object is decompressed to expose its pixels.
[0070] In block 106, the contribution of each pixel to each possible image type is calculated. This can be done by using one or more mappings as explained with reference to FIG. 9 . Finally, in block 108, the visual object is classified by assigning an image type to the object.
[0071] General Matters
[0072] In several embodiments, the capture system 22 has been described above as a stand-alone device. However, the capture system of the present invention can be implemented on any appliance capable of capturing and analyzing data from a network. For example, the capture system 22 described above could be implemented on one or more of the servers 14 or clients 16 shown in FIG. 1 . The capture system 22 can interface with the network 10 in any number of ways, including wirelessly.
[0073] In one embodiment, the capture system 22 is an appliance constructed using commonly available computing equipment and storage systems capable of supporting the software requirements. In one embodiment, illustrated by FIG. 6 , the hardware consists of a capture entity 46, a processing complex 48 made up of one or more processors, a memory complex 50 made up of one or more memory elements such as RAM and ROM, and storage complex 52, such as a set of one or more hard drives or other digital or analog storage means. In another embodiment, the storage complex 52 is external to the capture system 22, as explained above. In one embodiment, the memory complex stored software consisting of an operating system for the capture system device 22, a capture program, and classification program, a database, a filestore, an analysis engine and a graphical user interface.
[0074] Thus, a capture system and a word indexing scheme for the capture system have been described. In the forgoing description, various specific values were given names, such as “objects,” and various specific modules and tables, such as the “attribute module” and “general expression table” have been described. However, these names are merely to describe and illustrate various aspects of the present invention, and in no way limit the scope of the present invention. Furthermore various modules can be implemented as software or hardware modules, or without dividing their functionalities into modules at all. The present invention is not limited to any modular architecture either in software or in hardware, whether described above or not.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
The invention claimed is:
1. A method to be executed by a processor in an electronic environment, comprising:
capturing a visual object being transmitted over a network;
selecting a subset of the visual object;
decompressing the selected subset of the visual object to a colorspace representation to expose each pixel of the selected subset of the visual object;
determining a contribution of each pixel to a plurality of image types;
determining an image type of the visual object based on the contribution of each pixel to the plurality of image types, the determined image type being one of the plurality of image types.
2. The method of claim 1, wherein selecting the subset of the visual object comprises selecting the entire visual object.
3. The method of claim 1, wherein selecting the subset of the visual object comprises selecting the subset of the visual object based on the size and dimensions of the visual object.
4. The method of claim 1, wherein determining the contribution of each pixel to a plurality of image types comprises mapping a pixel to a plurality of values, each value of the plurality of values quantifying a contribution of the pixel to an image type of the plurality of image types.
5. The method of claim 4, wherein the mapping of the pixel to the plurality of values is based on a position of the pixel within the visual object.
6. The method of claim 4, wherein mapping the pixel to the plurality of values comprises mapping the pixel to a plurality of values between 0 and 2, wherein 0 indicates no contribution, 1 indicates a weak contribution, and 2 indicates a strong contribution.
7. The method of claim 1, wherein determining the image type of the visual object comprises classifying the visual object as belonging to the image type if the sum of the contributions of each pixel to the image type exceeds a threshold.
8. The method of claim 1, wherein the plurality of image types comprise skintone, x-ray, greyscale, graph, astrological, geographic, circuit design mask, banner advertisement.
9. A capture device comprising:
one or more capture modules to capture a visual object being transmitted over a network;
a scaling module to select a subset of the visual object;
a decompressor to decompress the selected subset of the visual object to a colorspace representation thereby exposing each pixel of the selected subset of the visual object;
a pixel map module to determine a contribution of each pixel to a plurality of image types; and
a classification module to determine an image type of the visual object based on the contribution of each pixel to the plurality of image types, the determined image type being one of the plurality of image types.
10. The capture device of claim 9, wherein the scaling module selects the subset of the visual object by selecting the entire visual objects.
11. The capture device of claim 9, wherein the scaling module selects the subset of the visual object by selecting the subset of the visual object based on the size and dimensions of the visual object.
12. The capture device of claim 9, wherein the pixel map module determines the contribution of each pixel to a plurality of image types by mapping a pixel to a plurality of values, each value of the plurality of values quantifying a contribution of the pixel to an image type of the plurality of image types.
13. The capture device of claim 12, wherein mapping the pixel to the plurality of values comprises accessing a pixel mapping table associating the pixel with a plurality of contribution mappings.
14. The capture device of claim 13, wherein the pixel map module selects one of the plurality of contribution mappings based on a position of the pixel within the visual object.
15. The capture device of claim 9, wherein the classification module determines the image type of the visual object by classifying the visual object as belonging to the image type if the sum of the contributions of each pixel to the image type exceeds a threshold.
16. A machine-readable medium having stored thereon data representing instructions that, when executed by a processor, cause the processor to perform operations comprising:
capturing a visual object being transmitted over a network;
selecting a subset of the visual object;
decompressing the selected subset of the visual object to a colorspace representation to expose each pixel of the selected subset of the visual object;
determining a contribution of each pixel to a plurality of image types;
determining an image type of the visual object based on the contribution of each pixel to the plurality of image types, the determined image type being one of the plurality of image types.
17. The machine-readable medium of claim 16, wherein selecting the subset of the visual object comprises selecting the entire visual object.
18. The machine-readable medium of claim 16, wherein selecting the subset of the visual object comprises selecting the subset of the visual object based on the size and dimensions of the visual object.
19. The machine-readable medium of claim 16, wherein determining the contribution of each pixel to a plurality of image types comprises mapping a pixel to a plurality of values, each value of the plurality of values quantifying a contribution of the pixel to an image type of the plurality of image types.
20. The machine-readable medium of claim 19, wherein the mapping of the pixel to the plurality of values is based on a position of the pixel within the visual object.
21. The machine-readable medium of claim 19, wherein mapping the pixel to the plurality of values comprises mapping the pixel to a plurality of values between 0 and 2, wherein 0 indicates no contribution, 1 indicates a weak contribution, and 2 indicates a strong contribution.
22. The machine-readable medium of claim 16, wherein determining the image type of the visual object comprises classifying the visual object as belonging to the image type if the sum of the contributions of each pixel to the image type exceeds a threshold.
Patent Citations (156)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4286255(A) | 1981-08-01 | Siy | Applicant |
| US4710957(A) | 1987-12-01 | Bocci et al. | Applicant |
| US5465299(A) | 1995-11-01 | Matsumoto et al. | Applicant |
| US5557747(A) | 1996-09-01 | Rogers et al. | Applicant |
| US5768578(A) | 1998-06-01 | Kirk | Applicant |
| US5781629(A) | 1998-07-01 | Haber et al. | Applicant |
| US5943670(A) | 1999-08-01 | Prager | Applicant |
| US5995111(A) | 1999-11-01 | Morioka et al. | Applicant |
| US6078953(A) | 2000-06-01 | Vaid et al. | Applicant |
| US6192472(B1) | 2001-02-01 | Garay et al. | Applicant |
| US6243091(B1) | 2001-06-01 | Berstis | Applicant |
| US6292810(B1) | 2001-09-01 | Richards | Applicant |
| US6356885(B2) | 2002-03-01 | Ross et al. | Applicant |
| US6408294(B1) | 2002-06-01 | Getchius et al. | Applicant |
| US6493761(B1) | 2002-12-01 | Baker et al. | Applicant |
| US6499105(B1) | 2002-12-01 | Yoshiura et al. | Applicant |
| US6515681(B1) | 2003-02-01 | Knight | Applicant |
| US6523026(B1) | 2003-02-01 | Gillis | Applicant |
| US6539024(B1) | 2003-03-01 | Janoska et al. | Applicant |
| US6598033(B2) | 2003-07-01 | Ross et al. | Applicant |
| US6662176(B2) | 2003-12-01 | Brunet et al. | Applicant |
| US6691209(B1) | 2004-02-01 | O'Connell | Applicant |
| US6771595(B1) | 2004-08-01 | Gilbert et al. | Applicant |
| US6772214(B1) | 2004-08-01 | McClain et al. | Applicant |
| US6785815(B1) | 2004-08-01 | Serret-Avila et al. | Applicant |
| US6820082(B1) | 2004-11-01 | Cook et al. | Applicant |
| US6937257(B1) | 2005-08-01 | Dunlavey | Applicant |
| US6950864(B1) | 2005-09-01 | Tsuchiya | Applicant |
| US6978297(B1) | 2005-12-01 | Piersol | Applicant |
| US7020654(B1) | 2006-03-01 | Najmi | Applicant |
| US7020661(B1) | 2006-03-01 | Cruanes et al. | Applicant |
| US7072967(B1) | 2006-07-01 | Saulpaugh et al. | Applicant |
| US7093288(B1) | 2006-08-01 | Hydrie et al. | Applicant |
| US7158983(B2) | 2007-01-01 | Willse et al. | Applicant |
| US7185073(B1) | 2007-02-01 | Gai et al. | Applicant |
| US7185192(B1) | 2007-02-01 | Kahn | Applicant |
| US7243120(B2) | 2007-07-01 | Massey | Applicant |
| US7246236(B2) | 2007-07-01 | Stirbu | Applicant |
| US7254562(B2) | 2007-08-01 | Hsu et al. | Applicant |
| US7266845(B2) | 2007-09-01 | Hypponen | Applicant |
| US7277957(B2) | 2007-10-01 | Rowley et al. | Applicant |
| US7290048(B1) | 2007-10-01 | Barnett et al. | Applicant |
| US7296070(B2) | 2007-11-01 | Sweeney et al. | Applicant |
| US7299277(B1) | 2007-11-01 | Moran et al. | Applicant |
| US7373500(B2) | 2008-05-01 | Ramelson et al. | Applicant |
| US7424744(B1) | 2008-09-01 | Wu et al. | Applicant |
| US7426181(B1) | 2008-09-01 | Feroz et al. | Applicant |
| US7434058(B2) | 2008-10-01 | Ahuja etal. | Applicant |
| US7477780(B2) | 2009-01-01 | Boncyk et al. | Examiner |
| US7483916(B2) | 2009-01-01 | Lowe et al. | Applicant |
| US7493659(B1) | 2009-02-01 | Wu et al. | Applicant |
| US7506055(B2) | 2009-03-01 | McClain et al. | Applicant |
| US7509677(B2) | 2009-03-01 | Saurabh et al. | Applicant |
| US7516492(B1) | 2009-04-01 | Nisbet et al. | Applicant |
| US7551629(B2) | 2009-06-01 | Chen et al. | Applicant |
| US2001/0037324(A1) | 2001-11-01 | Agrawal et al. | Applicant |
| US2002/0032677(A1) | 2002-03-01 | Morgenthaler et al. | Applicant |
| US2002/0052896(A1) | 2002-05-01 | Streit et al. | Applicant |
| US2002/0078355(A1) | 2002-06-01 | Samar | Applicant |
| US2002/0091579(A1) | 2002-07-01 | Yehia et al. | Applicant |
| US2002/0107843(A1) | 2002-08-01 | Biebesheimer et al. | Applicant |
| US2002/0116124(A1) | 2002-08-01 | Garin et al. | Applicant |
| US2002/0126673(A1) | 2002-09-01 | Dagli et al. | Applicant |
| US2002/0129140(A1) | 2002-09-01 | Peled et al. | Applicant |
| US2002/0159447(A1) | 2002-10-01 | Carey et al. | Applicant |
| US2003/0009718(A1) | 2003-01-01 | Wolfgang et al. | Applicant |
| US2003/0028493(A1) | 2003-02-01 | Tajima | Applicant |
| US2003/0028774(A1) | 2003-02-01 | Meka | Applicant |
| US2003/0046369(A1) | 2003-03-01 | Sim et al. | Applicant |
| US2003/0053420(A1) | 2003-03-01 | Duckett et al. | Applicant |
| US2003/0084300(A1) | 2003-05-01 | Koike | Applicant |
| US2003/0084326(A1) | 2003-05-01 | Tarquini | Applicant |
| US2003/0093678(A1) | 2003-05-01 | Bowe et al. | Applicant |
| US2003/0099243(A1) | 2003-05-01 | Oh et al. | Applicant |
| US2003/0105739(A1) | 2003-06-01 | Essafi et al. | Applicant |
| US2003/0131116(A1) | 2003-07-01 | Jain et al. | Applicant |
| US2003/0135612(A1) | 2003-07-01 | Huntington et al. | Applicant |
| US2003/0185220(A1) | 2003-10-01 | Valenci | Applicant |
| US2003/0196081(A1) | 2003-10-01 | Savarda et al. | Applicant |
| US2003/0204741(A1) | 2003-10-01 | Schoen et al. | Applicant |
| US2003/0221101(A1) | 2003-11-01 | Micali | Applicant |
| US2003/0225796(A1) | 2003-12-01 | Matsubara | Applicant |
| US2003/0225841(A1) | 2003-12-01 | Song et al. | Applicant |
| US2003/0231632(A1) | 2003-12-01 | Haeberlen | Applicant |
| US2004/0059736(A1) | 2004-03-01 | Willse et al. | Applicant |
| US2004/0071164(A1) | 2004-04-01 | Baum | Applicant |
| US2004/0111678(A1) | 2004-06-01 | Hara | Applicant |
| US2004/0114518(A1) | 2004-06-01 | MacFaden et al. | Applicant |
| US2004/0120325(A1) | 2004-06-01 | Ayres | Applicant |
| US2004/0122863(A1) | 2004-06-01 | Sidman | Applicant |
| US2004/0181513(A1) | 2004-09-01 | Henderson et al. | Applicant |
| US2004/0194141(A1) | 2004-09-01 | Sanders | Applicant |
| US2004/0196970(A1) | 2004-10-01 | Cole | Applicant |
| US2004/0230572(A1) | 2004-11-01 | Omoigui | Applicant |
| US2004/0267753(A1) | 2004-12-01 | Hoche | Applicant |
| US2005/0004911(A1) | 2005-01-01 | Goldberg et al. | Applicant |
| US2005/0021715(A1) | 2005-01-01 | Dugatkin et al. | Applicant |
| US2005/0021743(A1) | 2005-01-01 | Fleig et al. | Applicant |
| US2005/0022114(A1) | 2005-01-01 | Shanahan et al. | Applicant |
| US2005/0027881(A1) | 2005-02-01 | Figueira et al. | Applicant |
| US2005/0033747(A1) | 2005-02-01 | Wittkotter | Applicant |
| US2005/0033803(A1) | 2005-02-01 | Vleet et al. | Applicant |
| US2005/0050205(A1) | 2005-03-01 | Gordy et al. | Applicant |
| US2005/0055327(A1) | 2005-03-01 | Agrawal et al. | Applicant |
| US2005/0055399(A1) | 2005-03-01 | Savchuk | Applicant |
| US2005/0091443(A1) | 2005-04-01 | Hershkovich et al. | Applicant |
| US2005/0091532(A1) | 2005-04-01 | Moghe | Applicant |
| US2005/0108244(A1) | 2005-05-01 | Riise et al. | Applicant |
| US2005/0114452(A1) | 2005-05-01 | Prakash | Applicant |
| US2005/0120006(A1) | 2005-06-01 | Nye | Applicant |
| US2005/0127171(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0131876(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0132034(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132046(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132079(A1) | 2005-06-01 | de la Iglesia et al. | Applicant |
| US2005/0132197(A1) | 2005-06-01 | Medlar | Applicant |
| US2005/0132198(A1) | 2005-06-01 | Ahuja et al. | Applicant |
| US2005/0132297(A1) | 2005-06-01 | Milic-Frayling et al. | Applicant |
| US2005/0138242(A1) | 2005-06-01 | Pope et al. | Applicant |
| US2005/0149504(A1) | 2005-07-01 | Ratnaparkhi | Applicant |
| US2005/0166066(A1) | 2005-07-01 | Ahuja et al. | Applicant |
| US2005/0177725(A1) | 2005-08-01 | Lowe et al. | Applicant |
| US2005/0180341(A1) | 2005-08-01 | Nelson et al. | Applicant |
| US2005/0203940(A1) | 2005-09-01 | Farrar et al. | Applicant |
| US2005/0204129(A1) | 2005-09-01 | Sudia et al. | Applicant |
| US2005/0228864(A1) | 2005-10-01 | Robertson | Applicant |
| US2005/0235153(A1) | 2005-10-01 | Ikeda | Applicant |
| US2005/0289181(A1) | 2005-12-01 | Deninger et al. | Applicant |
| US2006/0005247(A1) | 2006-01-01 | Zhang et al. | Applicant |
| US2006/0021045(A1) | 2006-01-01 | Cook | Applicant |
| US2006/0021050(A1) | 2006-01-01 | Cook et al. | Applicant |
| US2006/0037072(A1) | 2006-02-01 | Rao et al. | Applicant |
| US2006/0041560(A1) | 2006-02-01 | Forman et al. | Applicant |
| US2006/0041570(A1) | 2006-02-01 | Lowe et al. | Applicant |
| US2006/0041760(A1) | 2006-02-01 | Huang | Applicant |
| US2006/0047675(A1) | 2006-03-01 | Lowe et al. | Applicant |
| US2006/0083180(A1) | 2006-04-01 | Baba et al. | Applicant |
| US2006/0167896(A1) | 2006-07-01 | Kapur et al. | Applicant |
| US2006/0242126(A1) | 2006-10-01 | Fitzhugh | Applicant |
| US2006/0242313(A1) | 2006-10-01 | Le et al. | Applicant |
| US2006/0251109(A1) | 2006-11-01 | Muller et al. | Applicant |
| US2006/0288216(A1) | 2006-12-01 | Buhler et al. | Applicant |
| US2007/0006293(A1) | 2007-01-01 | Balakrishnan et al. | Applicant |
| US2007/0036156(A1) | 2007-02-01 | Liu et al. | Applicant |
| US2007/0050334(A1) | 2007-03-01 | Deninger et al. | Applicant |
| US2007/0050381(A1) | 2007-03-01 | Hu et al. | Applicant |
| US2007/0110089(A1) | 2007-05-01 | Essafi et al. | Applicant |
| US2007/0136599(A1) | 2007-06-01 | Suga | Applicant |
| US2007/0162609(A1) | 2007-07-01 | Pope et al. | Applicant |
| US2007/0226504(A1) | 2007-09-01 | de la Iglesia et al. | Applicant |
| US2007/0226510(A1) | 2007-09-01 | de la Iglesia et al. | Applicant |
| US2007/0248029(A1) | 2007-10-01 | Merkey et al. | Applicant |
| US2007/0271254(A1) | 2007-11-01 | de la Iglesia et al. | Applicant |
| US2007/0271371(A1) | 2007-11-01 | Ahuja et al. | Applicant |
| US2007/0271372(A1) | 2007-11-01 | Deninger et al. | Applicant |
| US2007/0280123(A1) | 2007-12-01 | Atkins et al. | Applicant |
Non-Patent Literature (13)
- U.S. Appl. No. 12/190,536, filed Aug. 12, 2008, entitled “Configuration Management for a Capture/Registration System,” Inventor(s) Jitendra B. GTaitonde et al.Applicant
- U.S. Appl. No. 12/352,720, filed Jan. 13, 2009, entitled “System and Method for Concept Building,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- U.S. Appl. No. 12/354,688, filed Jan. 15, 2009, entitled “System and Method for Intelligent Term Grouping,” Inventor(s) Ratinder Paul Ahuja et al.Applicant
- U.S. Appl. No. 12/358,399, filed Jan. 23, 2009, entitled “System and Method for Intelligent Slate Management,” Inventor(s) William Deninger et al.Applicant
- U.S. Appl. No. 12/410,875, filed Mar. 25, 2009, entitled “System and Method for Data Mining and Security Policy Management,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- U.S. Appl. No. 12/410,905, filed Mar. 25, 2009, entitled “System and Method for Managing Data and Policies,” Inventor(s) Ratinder Paul Singh Ahuja et al.Applicant
- Prenell, Bart, “Cryptographic Flash Functions”, Proceedings of the 3rd Symposium on State and Progress of Research in Cryptography, 1993, pp. 161-171.Applicant
- U.S. Appl. No. 12/360,537, filed Jan. 27, 2009, entitled “Database for a Capture System,” Inventor(s) Rick Lowe et al.Applicant
- U.S. Appl. No. 11/254,436, filed Oct. 19, 2005, entitled “Attributes of Captured Objects in a Capture System,” Inventor(s) William Deninger et al.Applicant
- U.S. Appl. No. 12/472,150, filed May 26, 2009, entitled “Identifying Image Type in a Capture System,” Inventor(s) William Deninger et al.Applicant
- U.S. Appl. No. 11/900,964, filed Sep. 14, 2007, entitled “System and Method for Indexing a Capture System,” Inventor(s) Ashok Doddapaneni et al.Applicant
- U.S. Appl. No. 12/171,232, filed Jul. 10, 2008, entitled “System and Method for Data Mining and Security Policy Management,” Inventor(s) Weimin Liu et al.Applicant
- Microsoft Outlook, Out look, copyright 1995-2000, 2 pages.Applicant