System for intercepting multimedia documents

[0001] The present invention relates to a system for intercepting multimedia documents disseminated from a network.

[0002] The invention thus relates in general manner to a method and a system for providing traceability for the content of digital documents that may equally well comprise images, text, audio signals, video signals, or a mixture of these various types of content within multimedia documents.

[0003] The invention applies equally well to active interception systems capable of leading to the transmission of certain information being blocked, and to passive interception systems enabling certain transmitted information to be identified without blocking retransmission of said information, or even to mere listening systems that do not affect the transmission of signals.

[0004] The invention seeks to make it possible to monitor effectively the dissemination of information by ensuring effective interception of information disseminated from a network and by ensuring reliable and fast identification of predetermined information.

[0005] The invention also seeks to enable documents to be identified even when the quantity of information disseminated from a network is very large.

[0006] These objects are achieved by a system of intercepting multimedia documents disseminated from a first network, the system being characterized in that it comprises a module for intercepting and processing packets of information each including an identification header and a data body, the packet interception and processing module comprising first means for intercepting packets disseminated from the first network, means for analyzing the headers of packets in order to determine whether a packet under analysis forms part of a connection that has already been set up, means for processing packets recognized as forming part of a connection that has already been set up to determine the identifier of each received packet and to access a storage container where the data present in each received packet is saved, and means for creating an automaton for processing the received packet belonging to a new connection if the packet header analyzer means show that a packet under analysis constitutes a request for a new connection, the means for creating an automaton comprise in particular means for creating a new storage container for containing the resources needed for storing and managing the data produced by the means for processing packets associated with the new connection, a triplet comprising <identifier, connection state flag, storage container> being created and being associated with each connection by said means for creating an automaton, and in that it further comprises means for analyzing the content of data stored in the containers, for recognizing the protocol used from a set of standard protocols such as in particular http, SMTP, FTP, POP, IMAP, TELNET, P2P, for analyzing the content transported by the protocol, and for reconstituting the intercepted documents.

[0007] More particularly, the analyzer means and the processor means comprise a first table for setting up a connection and containing for each connection being set up an identifier “connectionId” and a flag “connectionState”, and a second table for identifying containers and containing, for each connection that has already been set up, an identifier “connectionId” and a reference “containerRef” identifying the container dedicated to storing the data extracted from the frames of the connection having the identifier “connectionId”.

[0008] The flag “connectionState” of the first table for setting up connections may take three possible values (P10, P11, P12) depending on whether the detected packet corresponds to a connection request made by a client, to a response made by a server, or to a confirmation made by the client.

[0009] According to an important characteristic of the present invention, the first packet interception means, the packet header analyzer means, the automaton creator means, the packet processor means, and the means for analyzing the content of data stored in the containers operate in independent and asynchronous manner.

[0010] The interception system of the invention further comprises a first module for storing the content of documents intercepted by the module for intercepting and processing packets, and a second module for storing information relating to at least the sender and the destination of intercepted documents.

[0011] Advantageously, the interception system further comprises a module for storing information relating to the components that result from detecting the content of intercepted documents.

[0012] According to another aspect of the invention, the interception system further comprises a centralized system comprising means for producing fingerprints of sensitive documents under surveillance, means for producing fingerprints of intercepted documents, means for storing fingerprints produced from sensitive documents under surveillance, means for storing fingerprints produced from intercepted documents, means for comparing fingerprints coming from the means for storing fingerprints produced from intercepted documents with fingerprints coming from the means for storing fingerprints produced from sensitive documents under surveillance, and means for processing alerts, containing the references of intercepted documents that correspond to sensitive documents.

[0013] Under such circumstances, the interception system may include selector means responding to the means for processing alerts to block intercepted documents or to forward them towards a second network B, depending on the results delivered by the means for processing alerts.

[0014] In an advantageous application, the centralized system further comprises means for associating rights with each sensitive document under surveillance, and means for storing information relating to said rights, which rights define the conditions under which the document can be used.

[0015] The interception system of the invention may also be interposed between a first network of the local area network (LAN) type and a second network of the LAN type, or between a first network of the Internet type and a second network of the Internet type.

[0016] The interception system of the invention may be interposed between a first network of the LAN type and a second network of the Internet type, or between a first network of the Internet type and a second network of the LAN type.

[0017] The system of the invention may include a request generator for generating requests on the basis of sensitive documents that are to be protected, in order to inject requests into the first network.

[0018] In a particular embodiment, the request generator comprises:

• • [0019] means for producing requests from sensitive documents under surveillance;
  • [0020] means for storing the requests produced;
  • [0021] means for mining the first network A with the help of at least one search engine using the previously stored requests;
  • [0022] means for storing the references of suspect files coming from the first network A; and
  • [0023] means for sweeping up suspect files referenced in the means for storing references and for sweeping up files from the neighborhood, if any, of the suspect files.

[0024] In a particular application, said means for comparing fingerprints deliver a list of retained suspect documents having a degree of pertinence relative to sensitive documents, and the alert processor means deliver the references of an intercepted document when the degree of pertinence of said document is greater than a predetermined threshold.

[0025] The interception system may further comprise, between said means for comparing fingerprints and said means for processing alerts, a module for calculating the similarity between documents, which module comprises:

[0026] a) means for producing an interference wave representing the result of pairing between a concept vector taken in a given order defining the fingerprint of a sensitive document and a concept vector taken in a given order defining the fingerprint of a suspect intercepted document; and

[0027] b) means for producing an interference vector from said interference wave enabling a resemblance score to be determined between the sensitive document and the suspect intercepted document under consideration, the means for processing alerts delivering the references of a suspect intercepted document when the value of the resemblance score for said document is greater than a predetermined threshold.

[0028] Alternatively, the interception system further comprises, between said means for comparing fingerprints and said means for processing alerts, a module for calculating similarity between documents, which module comprises means for producing a correlation vector representative of the degree of correlation between a concept vector taken in a given order defining the fingerprint of a sensitive document and a concept vector taken in a given order defining the fingerprint of a suspect intercepted document, the correlation vector enabling a resemblance score to be determined between the sensitive document and the suspect intercepted document under consideration, the means for processing alerts delivering the references of a suspect intercepted document when the value of the resemblance score for said document is greater than a predetermined threshold.

[0029] Other characteristics and advantages of the invention appear from the following description of particular embodiments, made with reference to the accompanying drawings, in which:

[0030] FIG. 1 is a block diagram showing the general principle on which a multimedia document interception system of the invention is constituted;

[0031] FIGS. 2 and 3 are diagrammatic views showing the process implemented by the invention to intercept and process packets while intercepting multimedia documents;

[0032] FIG. 4 is a block diagram showing various modules of an example of a global system for intercepting multimedia documents in accordance with the invention;

[0033] FIG. 5 shows the various steps in a process of confining sensitive documents that can be implemented by the invention;

[0034] FIG. 6 is a block diagram of an example of an interception system of the invention showing how alerts are treated and how reports are generated in the event of requests being generated to interrogate suspect sites and to detect suspect documents;

[0035] FIG. 7 is a diagram showing the various steps of an interception process as implemented by the system of FIG. 6;

[0036] FIG. 8 is a block diagram showing the process of producing a concept dictionary from a document base;

[0037] FIG. 9 is a flow chart showing the various steps of processing and partitioning an image with vectors being established that characterize the spatial distribution of iconic components of an image;

[0038] FIG. 10 shows an example of image partitioning and of a characteristic vector for said image being created;

[0039] FIG. 11 shows the partitioned image of FIG. 10 turned through 90°, and shows the creation of a characteristic vector for said image;

[0040] FIG. 12 shows the principle on which a concept base is built up from terms;

[0041] FIG. 13 is a block diagram showing the process whereby a concept dictionary is structured;

[0042] FIG. 14 shows the structuring of a fingerprint base;

[0043] FIG. 15 is a flow chart showing the various steps in the building of a fingerprint base;

[0044] FIG. 16 is a flow chart showing the various steps in identifying documents;

[0045] FIG. 17 is a flow chart showing the selection of a first list of responses;

[0046] FIGS. 18 and 19 show two examples of interference waves; and

[0047] FIGS. 20 and 21 show two examples of interference vectors corresponding respectively to the interference wave examples of FIGS. 18 and 19.

[0048] The system for intercepting multimedia documents disseminated from a first network A comprises a main module 100 itself comprising a module 110 for intercepting and processing information packets each including an identification header and a data body. The module 110 for intercepting and processing information is thus a low level module, and it is itself associated with means 111 for analyzing data content, for recognizing protocols, and for reconstituting intercepted documents (see FIGS. 1, 4, and 6).

[0049] The means 111 supply information relating to the intercepted documents firstly to a module 120 for storing the content of intercepted documents, and secondly to a module 121 for storing information containing at least the sender and the destination of intercepted documents (see FIGS. 4 and 6).

[0050] The main module 100 co-operates with a centralized system 200 for producing alerts containing the references of intercepted documents that correspond to previously identified sensitive documents.

[0051] Following intervention by the centralized system 200, the main module 100 can, where appropriate and by using means 130, selectively block the transmission towards a second network B of intercepted documents that are identified as corresponding to sensitive documents (FIG. 4).

[0052] A request generator 300 serves, where appropriate, to mine the first network A on the basis of requests produced from sensitive documents to be monitored, in order to identify suspect files coming from the first network A (FIGS. 1 and 6).

[0053] Thus, in an interception system of the invention, there are to be found in a main module 100 activities of intercepting and blocking network protocols both at a low level and then at a high level with a function of interpreting content. The main module 100 is situated in a position between the networks A and B that enables it to perform active or passive interception with an optional blocking function, depending on configurations and on co-operation with networks of the LAN type or of the Internet type.

[0054] The centralized system 200 groups together various functions that are described in detail below, concerning rights management, calculating document fingerprints, comparison, and decision making.

[0055] The request generator 300 is optional in certain applications and may in particular include generating peer-to-peer (P2P) requests.

[0056] Various examples of applications of the interception system of the invention are mentioned below:

[0057] The network A may be constituted by an Internet type network on which mining is being performed, e.g. of the active P2P or HTML type, while the documents are received on a LAN network B.

[0058] The network A may also be constituted by an Internet type network on which passive P2P listening is being performed by the interception system, the information being forwarded over a network B of the same Internet type.

[0059] The network A may also be constituted by a LAN type business network on which the interception system can act, where appropriate, to provide total blocking of certain documents identified as corresponding to sensitive documents, with these documents then not being forwarded to an external network B of the Internet type.

[0060] The first and second networks A and B may also both be constituted by LAN type networks that might belong to the same business, with the interception system serving to provide selective blocking of documents between portion A of the business network and portion B of said network.

[0061] The invention can be implemented with an entire set of standard protocols, such as in particular: HTTP; SMPT, FTP, POP, IMPA; TELNET; P2P.

[0062] The operation of P2P protocols is recalled below by way of example.

[0063] P2P exchanges are performed by means of computers known as “nodes” that share content and content descriptions with their neighbors.

[0064] A P2P exchange is often performed as follows:

• • [0065] a request is issued by a node U;
  • [0066] this request is forwarded from neighbor to neighbor within the structure, while applying the rules of each specific P2P protocol;
  • [0067] when a node D is capable of responding to the request r, it sends a response message R to the issuing node U. This message contains information relating to loading content C. The message R frequently follows a path similar to that over which the request came;
  • [0068] when various responses R have reached the node U, it (or the user in general) decides which response R to accept and it thus requests direct loading (peer-to-peer) of the content C described in the response R from the node D to the node U where it is located.

[0069] Requests and responses R are provided with identification that makes it possible to determine which responses R correspond to a given request r.

[0070] The main module 100 of the interception system of the invention, which contains the elements for intercepting and blocking various protocols is situated on the network either in the place of a P2P network node, or else between two nodes.

[0071] The basic operation of the P2P mechanism for passive and active interception and blocking is described below.

[0072] Passive P2P interception consists in observing the requests and the responses passing through the module 100, and using said identification to restore proper pairing.

[0073] Passive P2P blocking consists in observing the requests that pass through the module 100 and then in blocking the responses in a buffer memory 120, 121 in order to sort them. The sorting consists in using the responses to start file downloading towards the common system 200 and to request it to compare the file (or a portion of the file) by fingerprint extraction with the database of documents to be protected. If the comparison is positive and indicates that the downloaded file corresponds to a protected document, the dissemination authorizations for the protected document are consulted and a decision is taken instructing the module 100 to retransmit the response from its buffer memory 120, 121, or to delete it, or indeed to replace it with a “corrected” response: a response message carrying the identification of the request is issued containing downloading information pointing towards a “friendly” P2P server (e.g. a commercial server).

[0074] Active P2P interception consists in injecting requests from one side of the network A and then in observing them selectively by means of passive listening.

[0075] Active P2P blocking consists in injecting requests from one side of the network A and then in processing the responses to said request suing the above-described method used in passive interception.

[0076] To improve the performance of the passive listening mechanism, and starting from the interception position as constituted by the module 100, it is possible to act in various ways:

• • [0077] to modify the requests that are observed in transit, e.g. by increasing the scope of their searching, the networks concerned, correcting spelling mistakes, etc.; and/or
  • [0078] generating copy requests for duplicating the effectiveness of the search, either by reissuing full copies that are offset in time in order to prolong the search, or by issuing modified copies of said requests in order to increase the diversity of responses (variant spellings, domains, networks).

[0079] The system of the invention enables businesses in particular to control the dissemination of their own documents and to stop confidential information leaking to the outside. It also makes it possible to identify pertinent data that is present equally well inside and outside the business. The data may be documents for internal use or even data that is going to be disseminated but which is to be broadcast in compliance with user rights (author's rights, copyright, moral rights, . . . ). The pertinent information may also relate to the external environment: information about competition, clients, rumors about a product, or an event.

[0080] The invention combines several approaches going from characterizing atoms of content to characterizing the disseminated media and support. Several modules act together in order to carry out this process of content traceability. Within the centralized system 200, a module serves to create a unique digital fingerprint characterizing the content of the work and enabling it to be identified and to keep track of it: it is a kind of DNA test that makes it possible, starting from anonymous content, to find the indexed original work and thus verify the associated legal information (authors, successors in title, conditions of use, . . . ) and the conditions of use that are authorized. The main module 100 serves to automate and specialize the scanning and identification of content on a variety of dissemination media (web, invisible web, forums, news groups, peer-to-peer, chat) when searching for sensitive information.

[0081] It also makes it possible to intercept, analyze, and extract contents disseminated between two entities of a business or between the business and the outside world. The centralized system 200 includes a module making use of content mining techniques and it extracts pertinent information from large volumes of raw data, and then stores the information in order to make effective use of it.

[0082] Before returning in greater detail to the general architecture of the interception system of the invention, there follows a description with reference to FIGS. 2 and 3 of the module 100 for intercepting and processing information packets, each including an identification header and a data body.

[0083] It is recalled that in the world of the Internet, all exchanges take place by sending and receiving packets. These packets are made up of two portions: a header and a body (data). The header contains information describing the content transported by the packet such as the type, the number and the length of the packet, the address of the sender and the destination address. The body of the packet contains the data proper. The body of a packet may be empty.

[0084] Packets can be classified in two classes: those that serve to ensure proper operation of the network (knowing the state of a unit in the network, knowing the address of a machine, setting up a connection between two machines, . . . ), and those that serve to transfer data between applications (sending and receiving email, files, pages, . . . ).

[0085] Sending a document can require a plurality of packets to be sent over the network. These packets can be interlaced with packets coming from other senders. A packet can transit through a plurality of machines before reaching its destination. Packets can follow different paths and arrive in the wrong order (a packet sent at instant t+1 can arrive sooner than the packet that was sent at instant t).

[0086] Data transfer can be performed either in connected mode or in non-connected mode. In connected mode (http, smtp, telenet, ftp, . . . ) which relies on the TCP protocol, data transfer is preceded by a synchronization mechanism (setting up the connection). A TCP connection is set up in three stages (three packets):

[0087] 1) the caller (referred to as the “client”) sends SYN (a packet in which the flag SYN is set in the header of the packet);

[0088] 2) the receiver (referred to as the “server”) responds with SYN and ACK (a packet in which both the SYN and the ACK flags are set); and

[0089] 3) the caller sends ACK (a packet in which the ACK flag is set).

[0090] The client and the server are both identified by their respective MAC, IP addresses and by the port number of the service in question. It is assumed that the client (sender of the first packet in which the bit SYN is set) knows the pair (IP address of receiver, port number of desired service). Otherwise, the client begins by requesting the IP address of the receiver.

[0091] The role of the document interception module 110 is to identify and group together packets transporting data within a given application (http, SMTP, telnet, ftp, . . . ).

[0092] In order to perform this task, the interception module analyzes the packets of the IP layers, of the TCP/UDP transport layers, and of the application layers (http, SMPT, telnet, ftp, . . . ). This analysis is performed in several steps:

• • [0093] identifying, intercepting, and concatenating packets containing portions of one or more documents exchanged during a call, also referred to as a “connection” when the call is one based on the TCP protocol. A connection is defined by the IP addresses and the port numbers of the client and of the server, and possibly also by the Mac address of the client and of the server; and
  • [0094] extracting data encapsulated in the packets that have just been concatenated.

[0095] As shown in FIG. 2, intercepting and fusing packets can be modeled by a 4-state automaton:

[0096] P0: state for intercepting packets disseminated from a first network A (module 101).

[0097] P1: state for identifying the intercepted packet from its header (module 102). Depending on the nature of the packet, it activates state P2 (module 103) if the packet is sent by the client for a connection request. It invokes P3 (module 104) if the packet forms part of a call that has already been set up.

[0098] P2: state P2 (module 103) serves to create a unique identifier for characterizing the connection, and it also creates a storage container 115 containing the resources needed for storing and managing the data produced by the state P3. It associates each connection with a triplet <identifier, connection state flag, storage container>.

[0099] P3: state P3 (module 104) serves to process the packets associated with each call. To do this, it determines the identifier of the received packet in order to access the storage container 115 where it saves the data present in the packet.

[0100] As shown in FIG. 3, the procedure for identifying and fusing packets makes use of two tables 116 and 117: a connection setup table 116 contains the connections that are being set up, and a container identification table 117 contains the references of the containers of connections that have already been set up.

[0101] The identification procedure examines the header of the frame and on each detection of a new connection (the SYN bit set on its own) it creates an entry in the connection setup table 116 where it stores the pair comprising the connection identifier and the connectionState flag giving the state of the connection <connectionId, connectionState>. The connectionState flag can take three possible values (P10, P11, and P12):

[0102] connectionState is set at P10 on detecting a connection request;

[0103] connectionState is set at P11 if connectionState is equal to P10 and the header of the frame corresponds to a response from the server. The two bits ACK and SYN are set simultaneously;

[0104] connectionState is set at P12 if connectionState is equal to P11 and the header of the frame corresponds to confirmation from the client. Only ACK is set.

[0105] When the connectionState flag of a connectionId is set to P12, that implies deletion of the entry corresponding to this connectionId from the connection setup table 116 and the creation in the container identification table 117 of an entry containing the pair <connectionId, containerRef> in which containerRef designates the reference of the container 115 dedicated to storing the data extracted from the frames of the connection connectionId.

[0106] The purpose of the treatment step is to recover and store in the containers 115 the data that is exchanged between the senders and the receivers.

[0107] While receiving a frame, the identifier of the connection connectionId is determined, thus making it possible using containerRef to locate the container 115 for storing the data of the frame.

[0108] At the end of a connection, the content of its container is analyzed, the various documents that make it up are stored in the module 120 for storing the content of intercepted documents, and the information concerning destinations is stored in the module 121 for storing information concerning at least the sender and the destination of the intercepted documents.

[0109] The module 111 for analyzing the content of the data stored in the containers 125 serves to recognize the protocol in use from a set of standard protocols such as, in particular: http, SMTP, ftp, POP, IMAP, TELNET, P2P, and to reconstitute the intercepted documents.

[0110] It should be observed that the packet interception module 101, the packet header analysis module 102, the module 103 for creating an automaton, the packet processing module 104, and the module 111 for analyzing the content of data stored in the containers 115 all operate in independent and asynchronous manner.

[0111] Thus, the document interception module 110 is an application of the network layer that intercepts the frames of the transport layer (transmission control protocol (TCP) and user datagram protocol (UDP)) and Internet protocol packets (IP) and, as a function of the application being monitored, that processes them and fuses them to reconstitute content that has transmitted over the network.

[0112] With its centralized system 200, the interception system of the invention can lead to a plurality of applications all relating to the traceability of the digital content of multimedia documents.

[0113] Thus, the invention can be used for identifying illicit dissemination on Internet media (Net, P2P, news group, . . . ) or on LAN media (sites and publications within a business), or to identify and stop any attempt at illicit dissemination (not complying with the confinement perimeter of a document) from one machine to another, or indeed to ensure that the operations (publication, modification, editing, printing, etc.) performed on documents in a collaborative system (a data processor system for a group of users) are authorized, i.e. comply with rules set up by the business. For example it can prevent a document being published under a heading where one of the members does not have document consultation rights.

[0114] The system of the invention has a common technological core based on producing and comparing fingerprints and on generating alerts. The applications differ firstly in the origins of the documents received as input, and secondly in the way in which alerts generated on identifying an illicit document are handled. While processing alerts, reports may be produced that describe the illicit uses of the documents that have given rise to the alerts, or the illicit dissemination of the documents can be blocked. The publication of a document in a work group can also be prevented if any of the members of that group are not authorized to use (read, write, print, . . . ) the document.

[0115] With reference to FIG. 6, it can be seen that the centralized system 200 comprises a module 221 for producing fingerprints of sensitive documents under surveillance 201, a module 222 for producing fingerprints of intercepted documents, a module 220 for storing the fingerprints produced from the sensitive documents under surveillance 201, a module 250 for storing the fingerprints produced from the intercepted documents, a module 260 for comparing the fingerprints coming from the storage modules 250 and 220, and a module 213 for processing alerts containing the references of intercepted documents 211 that correspond to sensitive documents.

[0116] A module 230 enables each sensitive document under surveillance 201 to be associated with rights defining the conditions under which the document can be used and a module 240 for storing information relating to said rights.

[0117] Furthermore, a request generator 300 may comprise a module 301 for producing requests from sensitive documents under surveillance 201, a module 302 for storing the requests produced, a module 303 for mining the network A using one or more search engines making use of previously stored requests, a module 304 for storing references of suspect files coming from the network A, and a module 305 for sweeping up suspect files referenced in the reference storage module 304. It is also possible in the module 305 to sweep up files from the neighborhood of files that are suspect or to sweep up a series of predetermined sites whose references are stored in a reference storage module 306.

[0118] In the invention, it is thus possible to proceed with automated mining of a network in order to detect works that are protected by copyright, by providing a regular summary of works found on Internet and LAN sites, P2P networks, news groups, and forums. The traceability of works is ensured on the basis of their originals, without any prior marking.

[0119] Reports 214 sent at a selected frequency provide pertinent information and documents useful for accumulating data on the (licit or illicit) ways in which referenced works are used. A targeted search and reliable automatic recognition of works on the basis of their content ensure that the results are of high quality.

[0120] FIG. 7 summarizes, for web sites, the process of protecting and identifying a document. The process is made up of two stages:

Protection Stage

[0121] This stage is performed in two steps:

[0122] Step 31: generating the fingerprint of each document to be protected 30, associating the fingerprint with user rights (description of the document, proprietor, read, write, period, . . . ) and storing said information in a database 42.

[0123] Step 32: generating requests 41 that are used to identify suspect sites and that are stored in a database 43.

Identification Stage

[0124] Step 33: sweeping up and breaking down pages from sites:

• • [0125] Making use of the requests generated in step 32 to recover from the network 44 the addresses of sites that might contain data that is protected by the system. The information relating to the identified sites is stored in a suspect-site base.
  • [0126] Sweeping up and breaking down the pages of the sites referenced in the suspect-site base and in a base that is fed by users and that contains the references of sites having content that is it is desired to monitor (step 34). The results are stored in the suspect-content base 45 which is made up of a plurality of sub-databases, each having some particular type of content.

[0127] Step 35: generating the fingerprints of the content of the database 45.

[0128] Step 36: comparing these fingerprints with the fingerprints in the database 42 and generating alerts that are stored in a database 47.

[0129] Step 37: processing the alerts and producing reports 48. The processing of alerts makes use of the content-association base to generate the report. It contains relationships between the various components of the system (queries, content, content addresses (site, page address, local address, . . . ), the search engine that identified the page, . . . ).

[0130] The interception system of the invention can also be integrated in an application that makes it possible to implement an embargo process mimicking the use of a “restricted” stamp that validates the authorization to distribute documents within a restricted group of specific users from a larger set of users that exchange information, where this restriction can be removed as from a certain event, where necessary.

[0131] Under such circumstances, the embargo is automatic and applies to all of the documents handled within the larger ensemble that constitutes a collaborative system. The system discovers for any document Y waiting to be published whether it is, or contains a portion of, a document Z that has already been published, and whether the rights associated with that publication of Z are compatible with the rights that are to be associated with Y.

[0132] Such an embargo process is described below.

[0133] When a user desires to publish a document, the system must initially determine whether the document contains or all part of a document that has already been published, and if so, it must determine the corresponding rights.

[0134] The process thus implements the following steps:

[0135] Step 1: generating a fingerprint E for the document C, associating said fingerprint with the date D of the request and the user U that made the request, and also the precise nature N of the request (email, general publication, memo, etc. . . . ).

[0136] Step 2: comparing said fingerprint E with those already present in a database AINBase which contains the fingerprint of each document that has already been registered, together with the following information:

• • [0137] the publishing user: U2;
  • [0138] the rights associated with said publication (e.g. the work group to which the document belongs, the work groups that have read rights, the work groups that have modification rights, etc.): G; and
  • [0139] the limiting validity date of the stamp: DV.

[0140] Step 3: IF the fingerprint E is similar to a fingerprint F already present in the database AINBase, the rights associated with F are compared with the information collected in step 1. Two situations can then arise:

[0141] IF (D<=DV) AND (U does not belong to G) THEN the rights and the user status are not compatible, and if the publication date is earlier than the limiting validity date, the system will reject the request:

[0142] the fingerprint E is not inserted in AINBase;

[0143] the document C is not inserted in the document base of the collaborative system; and

[0144] an exception X is triggered.

[0145] ELSE:

[0146] the rights and the user status are compatible, so the document is accepted. If no rights have already been associated with the content, then the publishing user becomes the reference user of the document. That user can set up a specific embargo system:

[0147] 1) the fingerprint E is inserted in AINBase;

[0148] 2) the document C is inserted in the document base of the collaborative system;

[0149] date comparison can enable the embargo to be ended automatically as soon as the date exceeds the limiting date of the initially-defined embargo, thus having the effect of eliminating the corresponding constraints on publishing, modifying, etc. the document.

[0150] FIG. 4 summarizes an interception system of the invention that enables any attempt at disseminating documents to be stopped if it does not comply with the usage rights of the documents.

[0151] In this example, dissemination that is not in compliance may correspond either to sending out a document that is not authorized to leave its confinement unit, or to sending a document to a person who is not authorized to receive it, or to receiving a document that presents a special characteristic, e.g. it is protected by copyright.

[0152] The interception system of the invention comprises a main module 100 serving to monitor the content interchanged between two pieces of network A and B (Internet or LAN). To do this, incoming and outgoing packets are intercepted and put into correspondence in order to determine the nature of the call, and in order to reconstitute the content of documents exchanged during a call. Putting frames into correspondence makes it possible to determine the machine that initiated the call, to determine the protocol that is in use, and to associate each intercepted content with its purpose (its sender, its addressees, the nature of the operation: “get”, “post”, “put”, “send”, . . . ). The sender and the addressees may be people, machines, or any type of reference enabling content to be located. The purposes that are processed include:

[0153] 1) sending email from a sender to one or more addressees;

[0154] 2) requesting downloading of a web page or a file;

[0155] 3) sending a file or a web page using protocols of the http, ftp, or p2p type, for example.

[0156] When intercepting an intention to send or download a web page or a file, the intention in question is stored pending interception of the page or file in question and is then processed. If the intercepted content contains sensitive documents, then an alert is produced containing all of the useful information (the parties, the references of the protected documents), thus enabling the alert processor system to take various different actions:

[0157] 1) trace content and supervise procedures for accessing the content;

[0158] 2) produce reports on the exchanges (statistics, etc.); and/or

[0159] 3) where necessary block transmission associated with intentions that are not in compliance.

[0160] The interception system for monitoring the content of documents disseminated by the network A and for preventing dissemination or transmission to destinations or groups of destinations that are not authorized to receive the sensitive document essentially comprises a main module 100 with an interception module 110 serving to recover and break down the content transiting therethrough or present on the disseminating network A. The content is analyzed in order to extract therefrom documents constituting the intercepted content. The results are stored in:

• • [0161] the storage module 120 that stores the documents extracted from the intercepted content;
  • [0162] the storage module 121 containing the associations between the extracted documents, the intercepted contents, and intentions: the destinations of the intercepted contents; and where appropriate
  • [0163] the storage module 122 containing information relating to the components obtained by breaking down the intercepted documents.

[0164] A module 210 serves to produce alarms indicating that intercepted content contains a portion of one or more sensitive documents. This module 210 is essentially composed of two modules:

• • [0165] the module 221, 222 for producing fingerprints of sensitive documents and of intercepted documents (see FIG. 6); and
  • [0166] the module 260 for comparing the fingerprints of intercepted documents with the fingerprints in the sensitive document base and for producing alerts containing the references of sensitive documents to be found amongst the intercepted documents. The results output from the module 250 are stored in a database 261.

[0167] A module 230 enables each document to be associated with rights defining the conditions under which the document can be used. The results from the module 230 are stored in the database 240.

[0168] The module 213 serves to process alerts and to produce reports 214. Depending on the policy adopted, the module 213 can block movement of the document containing sensitive elements by means of the blocking module 130, or it can forward the module to a network B.

[0169] An alert is made up of the reference, in the storage module 120, of the content of the intercepted document that has given rise to the alert, together with the references of the sensitive documents that are the source of the alert. From these references and from the information registered in the databases 240 and 121, the module 213 decides whether or not to follow up the alert. The alert is taken into account if the destination of the content is not declared in the database 240 as being amongst the users of the sensitive document that is the source of the alert.

[0170] When an alert is taken into account, the content is not transmitted and a report 214 is produced that explains why it was blocked. The report is archived, an account is delivered in real time to the people in charge, and depending on the policy that has been adopted, the sender might be warned by an email, for example. The content of the storage module 120 that did not give rise to an alert or whose alarms have been ignored is put back into circulation by the module 130.

[0171] FIG. 5 summarizes the operation of the process for intercepting and blocking sensitive documents within operating perimeters defined by the business. This process comprises a first portion 10 corresponding to registration for confinement purposes and a second portion 20 corresponding to interception and to blocking.

[0172] The process of registration for confinement comprises a step 1 of creating fingerprints and associated rights, and identifying the confinement perimeter (proprietors, user groups). In the station 11 where the document is created, a step 2 consists in sending fingerprints to an agent server 14, and then a step 3 lies in storing the fingerprints and the rights in a fingerprint base 15. A step 4 consists in the agent server 14 sending an acknowledgment of receipt to the workstation 11.

[0173] The interception and blocking process optionally comprises the following steps:

[0174] Step 21: sending a document from a document-sending station 12. An interception step in the interception module 16 where a document leaving a region of network under surveillance is intercepted.

[0175] Step 22: creating a fingerprint for the recovered document.

[0176] Step 23: comparing fingerprints in association with the database 15 and the interception module 16 to generate alerts indicating the presence of a sensitive document in the intercepted content.

[0177] Step 24: saving transactions in a database 17.

[0178] Step 25: verifying rights.

[0179] Step 26: blocking or transmitting to a document-receiver station 13 depending on whether the intercepted document is or is not allowed to leave the confinement perimeter.

[0180] With reference to FIGS. 8 and 12 to 15, there follows a description of the general principle of a method of the invention for indexing multimedia documents that leads to a fingerprint base being built, each indexed document being associated with a fingerprint that is specific thereto.

[0181] Starting from a multimedia document base 501, a first step 502 consists in identifying and extracting, for each document, terms t_i constituted by vectors characterizing the properties of the document that is to be indexed.

[0182] By way of example, it is possible to identify and extract terms t_i from a sound document.

[0183] An audio document is initially decomposed into frames which are subsequently grouped together into clips, each of which is characterized by a term constituted by a parameter vector. An audio document is thus characterized by a set of terms t_i stored in a term base 503 (FIG. 8).

[0184] Audio documents from which the characteristic vectors have been extracted can be sampled at 22,050 hertz (Hz) for example in order to avoid the aliasing effect. The document is then subdivided into a set of frames with the number of samples per frame being set as a function of the type of file to be analyzed.

[0185] For an audio document that is rich in frequencies and that contains many variations, as for films, variety shows, or indeed sports broadcasts, for example, the number of samples in a frame should be small, e.g. of the order 512 samples. In contrast, for an audio document that is homogeneous, containing only speech or only music, for example, this number can be large, e.g. about 2,048 samples.

[0186] An audio document clip may be characterized by various parameters serving to constitute the terms and characterizing time information (such as energy or oscillation rate, for example) or frequency information (such as bandwidth, for example).

[0187] Consideration is given above to multimedia documents having audio components.

[0188] When indexing multimedia documents that include video signals, it is possible to select terms t_i constituted by key-images representing groups of consecutive homogeneous images.

[0189] The terms t_i can in turn represent, for example: dominant colors, textural properties, or the structures of dominant zones in the key-images of the video document.

[0190] In general, for images as described in greater detail below, the terms may represent dominant colors, textural properties, and/or the structures of dominant zones of the image. Several methods can be implemented in alternation or cumulatively, both over an entire image or over portions of the image, in order to determine the terms t_i that are to characterize the image.

[0191] For a document containing text, the terms t_i can be constituted by words in spoken or written language, by numbers, or by other identifiers constituted by combinations of characters (e.g. combinations of letters and digits).

[0192] With reference again to FIG. 8; starting from a term base 503 having P terms, the terms t_i are processed in a step 504 and grouped together into concepts c_i (FIG. 12) for storing in a concept dictionary 505. The idea at this point is to generate a step of signatures characterizing a class of documents. The signatures are descriptors which, e.g. for an image, represent color, shape, and texture. A document can then be characterized and represented by the concepts of the dictionary.

[0193] A fingerprint of a document can then be formed by the signature vectors of each concept of the dictionary 505. The signature vector is constituted by the documents where the concept c_i is present and by the positions and the weight of said concept in the document.

[0194] The terms t_i extracted from a document base 501 are stored in a term base 503 and processed in a module 504 for extracting concepts c_i which are themselves grouped together in a concept dictionary 505. FIG. 12 shows the process of constructing a concept base c_i (1≦i≦m) from terms t_j (1≦j≦n) presenting similarly scores wi_j.

[0195] The module for producing the concept dictionary receives as input the set P of terms from the base 503 and the maximum desired number N concepts is set by the user. Each concept c_i is intended to group together terms that are neighbors from the point of view of their characteristics.

[0196] In order to produce the concept dictionary, the first step is to calculate the distance matrix T between the terms of the base 503, with this matrix being used to create a partition of cardinal number equal to the desired number N of concepts.

[0197] The concept dictionary is set up in two stages:

• • [0198] decomposing P into N portions P=P₁ ∪ P₂ . . . ∪ P_N;
  • [0199] optimizing the partition that decomposes P into M classes P=C₁ ∪ C₂ . . . ∪ C_M with M less than or equal to P.

[0200] The purpose of the optimization process is to reduce the error in the decomposition of P into N portions {P₁, P₂ . . . , P_N} where each portion P_i is represented by the term t_i which is taken as being a concept, with the error that is then committed being equal to the following expression: $\begin{array}{ccc}\varepsilon =\sum _{i=1}^N{\varepsilon }_{t_i},& & {\varepsilon }_{t_i}=\sum _{t_j\in P_i}{d}^2\left(t_i,t_j\right)\end{array}$
is the error committed when replacing the terms t_j of P_i by t_i.

[0201] It is possible to decompose P into N portions in such a manner as to distribute the terms so that the terms that are furthest apart lie in distinct portions while terms that are closer together lie in the same portions.

[0202] Step 1 of decomposing the set of terms P into two portions P₁ and P₂ is described initially:

[0203] a) the two terms t_i and t_j in P that are farthest apart are determined, this corresponding to the greatest distance D_ij of the matrix T;

[0204] b) for each t_k of P, t_k is allocated to P₁ if the distance D_ki is smaller than the distance D_kj, otherwise it is allocated to P₂.

[0205] Step 1 is iterated until the desired number of portions has been obtained. On each iteration, steps a) and b) are applied to the terms of set P₁ and set P₂.

[0206] The optimization stage is as follows.

[0207] The starting point of the optimization process is the N disjoint portions of P {P₁, P₂, . . . , P_N} and the N terms {t₁, t₂, . . . , t_N} representing them, and it is used for the purpose of reducing the error in decomposing P into {(P₁, P₂, . . . , P_N} portions.

[0208] The process begins by calculating the centers of gravity c_i of the P_i. Thereafter the error $\varepsilon c_i=\sum _{t_j\in P_i}{d}^2\left(t_i,t_j\right)$
is
calculated that is compared with εc_i, and t_i is replaced by c_i if εc_i is less than εt_i. Then after calculating the new matrix T and if convergence is not reached, decomposition is performed. The stop condition is defined by: $\frac{\left(\varepsilon c_t-\varepsilon c_{t+1}\right)}{\varepsilon c_t}<\mathrm{threshold}$
threshold
which is about 10⁻³, ec_t being the error committed at the instant t that represents the iteration.

[0209] There follows a matrix T of distances between the terms, where D_ij designates the distance between term t_i and term t_j.

	t0	ti	tk	tj	tn
	t0	D00	D0i	D0k	D0j	D0n
	ti	Di0	Dii	Dik	Dij	Din
	tk	Dk0	Dki	Dkk	Dkj	Dkn
	tj	Dj0	Dji	Djk	Djj	Djn
	tn	Dn0	Dni	Dnk	Dnj	Dnn

[0210] For multimedia documents having a variety of contents, FIG. 13 shows an example of how the concept dictionary 505 is structured.

[0211] In order to facilitate navigation inside the dictionary 505 and determine quickly during an identification stage the concept that is closest to a given term, the dictionary 505 is analyzed and a navigation chart 509 inside the dictionary is established.

[0212] The navigation chart 509 is produced iteratively. On each iteration, the set of concepts is initially split into two subsets, and then on each iteration, one of the subsets is selected until the desired number of groups is obtained or until the stop criterion is satisfied. The stop criterion may be, for example, that the resulting subsets are all homogeneous with a small standard deviation, for example. The final result is a binary tree in which the leaves contain the concepts of the dictionary and the nodes of the tree contain the information necessary for traversing the tree during the stage of identifying a document.

[0213] There follows a description of an example of the module 506 for distributing a set of concepts.

[0214] The set of concepts C is represented in the form of a matrix M=[c₁, c₂, . . . , c_N]∈^p·N, where c_i ∈^p, where c_i represents a concept having p values. Various methods can be used for obtaining an axial distribution. The first step is to calculate the center of gravity C and the axis used for decomposing the set into two subsets.

[0215] The processing steps are as follows:

[0216] Step 1: calculating a representative of the matrix M such as the centroid w of matrix M: $\begin{array}{cc}w=\frac{1}{N}\sum _{i=1}^N{c}_i& \left(13\right)\end{array}$

[0217] Step 2: calculating the covariance matrix {tilde over (M)} between the elements of the matrix M and the representative of the matrix M, giving in the above special case
{tilde over (M)}=M−we, where e=[1,1,1, . . . ,1]  (14)

[0218] Step 3: calculate an axis for projecting the elements of the matrix M, e.g. the eigenvector U associated with the greatest eigenvalue of the covariance matrix.

[0219] Step 4: calculate the value pi=U^T(c_i−w) and decompose the set of concepts C into two substeps C1 and C2 as follows: $\begin{array}{cc}\{\begin{array}{cc}{c}_i\in C1& \mathrm{if}\mathrm{pi}\le 0\\ c_i\in C2& \mathrm{if}\mathrm{pi}>0\end{array}& \left(15\right)\end{array}$

[0220] The data set stored in the node associated with C is {u, w, |p1|, p2 } where p1 is the maximum of all pi≦0 and p2 is the minimum of all pi>0.

[0221] The data set {u, w, |p1|, p2 } constitutes the navigation indicators in the concept dictionary. Thus, during the identification stage for example, in order to determine the concept that is closest to a term t_i, the value pti=u^T(t_i−w) is calculated and then the node associated with C1 is selected if |(|pti|−|p1|)|<|(|pti|−p2)|, else the node C2 is selected. The process is iterated until one of the leaves of the tree has been reached.

[0222] A singularity detector module 508 may be associated with the concept distribution module 506.

[0223] The singularity detector serves to select the set Ci that is to be decomposed. One of the possible methods consists in selecting the less compact set.

[0224] FIGS. 14 and 15 show the indexing of a document or a document base and the construction of a fingerprint base 510.

[0225] The fingerprint base 510 is constituted by the set of concepts representing the terms of the documents to be protected. Each concept Ci of the fingerprint base 510 is associated with a fingerprint 511, 512, 513 constituted by a data set such as the number of terms in the documents where the concept is present, and for each of these documents, a fingerprint 511a, 511b, 511c is registered comprising the address of the document DocIndex, the number of terms, the number of occurrences of the concept (frequency), the score, and the concepts that are adjacent thereto in the document. The score is a mean value of similarity measurements between the concept and the terms of the document which are closest to the concept. The address DocIndex of a given document is stored in a database 514 containing the addresses of protected documents.

[0226] The process 520 for generating fingerprints or signatures of the documents to be indexed is shown in FIG. 15.

[0227] When a document DocIndex is registered, the pertinent terms are extracted from the document (step 521), and the concept dictionary is taken into account (step 522). Each of the terms t_i of the document DocIndex is projected into the space of the concepts dictionary in order to determine the concept c_i that represents the term t_i (step 523).

[0228] Thereafter the fingerprint of concept c_i is updated (step 524). This updating is performed depending on whether or not the concept has already been encountered, i.e. whether it is present in the documents that have already been registered.

[0229] If the concept c_i is not yet present in the database, then a new entry is created in the database (an entry in the database corresponds to an object made up of elements which are themselves objects containing the signature of the concept in those documents where the concept is present). The newly created event is initialized with the signature of the concept. The signature of a concept in a document DocIndex is made up mainly of the following data items: DocIndex, number of terms, frequency, adjacent concepts, and score.

[0230] If the concept c_i exists in the database, then the entry associated with the concept has added thereto its signature in the query document, which signature is made up of (DocIndex, number of terms, frequency, adjacent concepts, and score).

[0231] Once the fingerprint base has been constructed (step 525), the fingerprint base is registered (step 526).

[0232] FIG. 16 shows a process of identifying a document that is implemented on an on-line search platform 530.

[0233] The purpose of identifying a document is to determine whether a document presented as a query constitutes reutilization of a document in the database. It is based on measuring the similarity between documents. The purpose is to identify documents containing protected elements. Copying can be total or partial. When partial, the copied element will have been subjected to modifications such as: eliminating sentences from a text, eliminating a pattern from an image, eliminating a shot or a sequence from a video document, . . . , changing the order of terms, or substituting terms with other terms in a text.

[0234] After presenting a document to be identified (step 531), the terms are extracted from that document (step 532).

[0235] In association with the fingerprint base (step 525), the concepts calculated from the terms extracted from the query are put into correspondence with the concepts of the database (step 533) in order to draw up a list of documents having contents similar to the content of the query document.

[0236] The process of establishing the list is as follows:

[0237] P_dj designates the degree of resemblance between document dj and the query document, with 1≦j≦N, where N is the number of documents in the reference database.

[0238] All P_dj are initialized to zero.

[0239] For each term t_i in the query provided in step 731 (FIG. 17), the concept Ci that represents it is determined (step 732).

[0240] For each document dj where the concept is present, its P_dj is updated as follows:
P_dj=P_dj+f(frequency, score)
where several functions f can be used, e.g.:
f(frequency, score)=frequency×score
where frequency designates the number of occurrences of concept Ci in document dj and where score designates the mean of the resemblance scores of the terms of document dj with concept Cj.

[0241] The P_dj are ordered, and those that are greater than a given threshold (step 733) are retained. Then the responses are confirmed and validated (step 534).

[0242] Response confirmation: the list of responses is filtered in order to retain only the responses that are the most pertinent. The filtering used is based on the correlation between the terms of the query and each of the responses.

[0243] Validation: this serves to retain only those responses where it is very certain that content has been reproduced. During this step, responses are filtered, taking account of algebraic and topological properties of the concepts within a document: it is required that neighborhood in the query document is matched in the response documents, i.e. two concepts that are neighbors in the query document must also be neighbors in the response document.

[0244] The list of response documents is delivered (step 535).

[0245] Consideration is given below in greater detail to multimedia documents that contain images.

[0246] The description bears in particular on building up the fingerprint base that is to be used as a tool for identifying a document, based on using methods that are fast and effective for identifying images and that take account of all of the pertinent information contained in the images going from characterizing the structures of objects that make them up, to characterizing textured zones and background color. The objects of the image are identified by producing a table summarizing various statistics made on information about object boundary zones and information on the neighborhoods of said boundary zones. Textured zones can be characterized using a description of the texture that is very fine, both spatially and spectrally, based on three fundamental characteristics, namely its periodicity, its overall orientation, and the random appearance of its pattern. Texture is handled herein as a two-dimensional random process. Color characterization is an important feature of the method. It can be used as a first sort to find responses that are similar based on color, or as a final decision made to refine the search.

[0247] In the initial stage of building up fingerprints, account is taken of information classified in the form of components belonging to two major categories:

• • [0248] so-called “structural” components that describe how the eye perceives an object that may be isolated or a set of objects placed in an arrangement in three dimensions; and
  • [0249] so-called “textural” components that complement structural components and represent the regularity or uniformity of texture patterns.

[0250] As mentioned above, during the stage of building fingerprints, each document in the document base is analyzed so as to extract pertinent information therefrom. This information is then indexed and analyzed. The analysis is performed by a string of procedures that can be summarized as three steps:

• • [0251] for each document, extracting predefined characteristics and storing this information in a “term” vector;
  • [0252] grouping together in a concept all of the terms that are “neighboring” from the point of view of their characteristics, thus enabling searching to be made more concise; and
  • [0253] building a fingerprint that characterizes the document using a small number of entities. Each document is thus associated with a fingerprint that is specific thereto.

[0254] In a subsequent search stage, following a request made by a user, e.g. to identify a query image, a search is made for all multimedia documents that are similar or that comply with the request. To do this, as mentioned above, the terms of the query document are calculated and they are compared with the concepts of the databases in order to deduce which document(s) of the database is/are similar to the query document.

[0255] The stage of constructing the terms of an image is described in greater detail below.

[0256] The stage of constructing the terms of an image usefully implements characterization of the structural supports of the image. Structural supports are elements making up a scene of the image. The most significant are those that define the objects of the scene since they characterize the various shapes that are perceived when any image is observed.

[0257] This step concerns extracting structural supports. It consists in dismantling boundary zones of image objects, where boundaries are characterized by locations in which high levels of intensity variation are observed between two zones. This dismantling operates by a method that consists in distributing the boundary zones amongst a plurality of “classes” depending on the local orientation of the image gradient (the orientation of the variation in local intensity). This produces a multitude of small elements referred to as structural support elements (SSE). Each SSE belongs to an outline of a scene and is characterized by similarity in terms of the local orientation of its gradient. This is a first step that seeks to index all of the structural support elements of the image.

[0258] The following process is then performed on the basis of these SSEs, i.e. terms are constructed that describe the local and global properties of the SSEs.

[0259] The information extracted from each support is considered as constituting a local property. Two types of support can be distinguished: straight rectilinear elements (SRE), and curved arcuate elements (CAE).

[0260] The straight rectilinear elements SRE are characterized by the following local properties:

• • [0261] dimension (length, width);
  • [0262] main direction (slope);
  • [0263] statistical properties of the pixels constituting the support (mean energy value, moments); and
  • [0264] neighborhood information (local Fourier transform).

[0265] The curved arcuate elements CAE are characterized in the same manner as above, together with the curvature of the arcs.

[0266] Global properties cover statistics such as the numbers of supports of each type and their dispositions in space (geometrical associations between supports: connexities, left, right, middle, . . . ).

[0267] To sum up, for a given image, the pertinent information extracted from the objects making up the image is summarized in Table 1.

TABLE 1
Structural supports of		Type
objects of an image		SSE	SRE	CAE
Global	Total number	n	n1	n2
properties	Number long	nl	n1l	n2l
	(>threshold)
	Number short	nc	n1c	n2c
	(<threshold)
	Number of long	—	n1lgdx	n2lgdx
	supports at a
	left or right
	connection
	Number of middle	—	n1lgdx	n2lgdx
	connection
	Number of	—	n1pll	n2pll
	parallel long
	supports
Local	Luminance	—
properties	(>threshold)
	Luminance	—
	(<threshold)
	Slope	—
	Curvature	—
	Characterization	—
	of the neighborhood
	of the supports

[0268] The stage of constructing the terms of an image also implements characterizing pertinent textual information of the image. The information coming from the texture of the image is subdivided by three visual appearances of the image:

• • [0269] random appearance (such as an image of fine sand or grass) where no particular arrangement can be determined;
  • [0270] periodic appearance (such as a patterned knit) or a repetition of dominant patterns (pixels or groups of pixels) is observed; and finally
  • [0271] a directional appearance where the patterns tend overall to be oriented in one or more privileged directions.

[0272] This information is obtained by approximating the image using parametric representations or models. Each appearance is taken into account by means of the spatial and spectral representations making up the pertinent information for this portion of the image. Periodicity and orientation are characterized by spectral supports while the random appearance is represented by estimating parameters for a two-dimensional autoregressive model.

[0273] Once all of the pertinent information has been extracted, it is possible to proceed with structuring texture terms.

TABLE 2
Spectral supports and autoregressive
parameters of the texture of an image
Periodic component	Total number of	np
	periodic elements
	Frequencies	Pair (ωp, vp),
		0 < p ≦ np
	Amplitudes	Pair (Cp, Dp),
		0 < p ≦ np
Directional component	Total number of	nd
	directional
	elements
	Orientations	Pair (αi, βi),
		0 < p ≦ np
	Frequencies	vi, 0 < i ≦ nd
Random components	Noise standard	σ
	deviation
	Autoregressive	{ai, j}, (i, j) ∈ SN, M
	parameters

[0274] Finally, the stage of constructing the terms of an image can also implement characterizing the color of the image.

[0275] Color is often represented by color histograms, which are invariant in rotation and robust against occlusion and changes in camera viewpoint.

[0276] Color quantification can be performed in the red, green, blue (RGB) space, the hue, saturation, value (HSV) space, or the LUV space, but the method of indexing by color histograms has shown its limitations since it gives global information about an image, so that during indexing it is possible to find images that have the same color histogram but that are completely different.

[0277] Numerous authors propose color histograms that integrate spatial information. For example this can consist in distinguishing between pixels that are coherent and pixels that are incoherent, where a pixel is coherent if it belongs to a relatively large region of identical pixels, and is incoherent if it forms part of a region of small size.

[0278] A method of characterizing the spatial distribution of the constituents of an image (e.g. its color) is described below that is less expensive in terms of computation time than the above-mentioned methods, and that is robust faced with rotations and/or shifts.

[0279] The various characteristics extracted from the structural support elements, the parameters of the periodic, directional, and random components of the texture field, and also the parameters of the spatial distribution of the constituents of the image, constitute the “terms” that can be used for describing the content of a document. These terms are grouped together to constitute “concepts” in order to reduce the amount of “useful information” of a document.

[0280] The occurrences of these concepts and their positions and frequencies constitute the “fingerprint” of a document. These fingerprints then act as links between a query document and documents in a database while searching for a document.

[0281] An image does not necessarily contain all of the characteristic elements described above. Consequently, identifying an image begins with detecting the presence of its constituent elements.

[0282] In an example of a process of extracting terms from an image, a first step consists in characterizing image objects in terms of structural supports, and, where appropriate, it may be preceded by a test for detecting structural elements, which test serves to omit the first step if there are no structural elements.

[0283] A following step is a test for determining whether there exists a textured background. If so, the process moves on to a step of characterizing the textured background in terms of spectral supports and autoregressive parameters, followed by a step of characterizing the background color.

[0284] If there is no structured background, then the process moves directly to the step of characterizing background color.

[0285] Finally, the terms are stored and fingerprints are built up.

[0286] The description returns in greater detail to characterizing the structural support elements of an image.

[0287] The principle on which this characterization is based consists in dismantling boundary zones of image objects into multitudes of small base elements referred to as significant support elements (SSEs) conveying useful information about boundary zones that are made up of linear strips of varying size, or of bends having different curvatures. Statistics about these objects are then analyzed and used for building up the terms of these structural supports.

[0288] In order to describe more rigorously the main methods involved in this approach, a digitized image is written as being the set {y(i, j), (i, j) ∈ I×J}, where I and J are respectively the number of rows and the number of columns in the image.

[0289] On the basis of previously calculated vertical gradient images {g_v(i, j), (i, j) ∈ I×J} and horizontal gradient images {g_h(i, j), (i, j) ∈ I×J}, this approach consists in partitioning the image depending on the local orientation of its gradient into a finite number of equidistant classes. The image containing the orientation of the gradient is defined by the following formula: $\begin{array}{cc}O\left(i,j\right)=\arctan \left(\frac{g_h\left(i,j\right)}{g_v\left(i,j\right)}\right)& \left(1\right)\end{array}$

[0290] A partition is no more than an angular decomposition in the two-dimensional (2D) plane (from 0° to 360°) using a well-defined quantization pitch. By using the local orientation of the gradient as a criterion for decomposing boundary zones, it is possible to obtain a better grouping of pixels that form parts of the same boundary zone. In order to solve the problem of boundary points that are shared between two juxtaposed classes, a second partitioning is used, using the same number of classes as before, but offset by half a class. On the basis of these classes coming from the two partitionings, a simple procedure consists in selecting those that have the greatest number of pixels. Each pixel belongs to two classes, each coming from a respective one of the two partitionings. Given that each pixel is potentially an element of an SSE, if any, the procedure opts for the class that contains the greater number of pixels amongst those two classes. This constitutes a region where the probability of finding an SSE of larger size is the greatest possible. At the end of this procedure, only those classes that contain more than 50% of the candidates are retained. These are regions of the support that are liable to contain SSEs.

[0291] From these support regions, SSEs are determined and indexed using certain criteria such as the following:

• • [0292] length (for this purpose a threshold length l₀ is determined and SSEs that are shorter and longer than the threshold are counted);
  • [0293] intensity, defined as the mean of the modulus of the gradient of the pixels making up each SSE (a threshold written I₀ is then defined, and SSEs that are below or above the threshold are indexed); and
  • [0294] contrast, defined as the difference between the pixel maximum and the pixel minimum.

[0295] At this step in the method, all of the so-called structural elements are known and indexed in compliance with pre-identified types of structural support. They can be extracted from the original image in order to leave room for characterizing the texture field.

[0296] In the absence of structural elements, it is assumed that the image is textured with patterns that are regular to a greater or lesser extent, and the texture field is then characterized. For this purpose, it is possible to decompose the image into three components as follows:

• • [0297] a textural component containing anarchic or random information (such as an image of fine sand or grass) in which no particular arrangement can be determined;
  • [0298] a periodic component (such as a patterned knit) in which repeating dominant patterns are observed; and finally
  • [0299] a directional component in which the patterns tend overall towards one or more privileged directions.

[0300] Since the idea is to characterize accurately the texture of the image on the basis of a set of parameters, these three components are represented by parametric models.

[0301] Thus, the texture of the regular and homogeneous image 15 written {y(i, j), (i, j) ∈ I×J} is decomposed into three components 16, 17, and 18 as shown in FIG. 10, using the following relationship:
{{tilde over (y)}(i,j)}={w(i,j)}+{h(i,j)}+{e(i,j)}.  (16)

[0302] Where {w(i, j)} is the purely random component 16, {h-(i, j)} is the harmonic component 17, and {e(i, j)} is the directional component 18. This step of extracting information from a document is terminated by estimating parameters for these three components 16, 17, and 18. Methods of making such estimates are described in the following paragraphs.

[0303] The description begins with an example of a method for detecting and characterizing the directional component of the image.

[0304] Initially it consists in applying a parametric model to the directional component {e(i, j)}. It is constituted by a denumerable sum of directional elements in which each is associated with a pair of integers (α, β) defining an orientation of angle θ such that θ=tan⁻¹β/α. In other words, e(i, j) is defined by: $e\left(i,j\right)=\sum _{\left(\alpha ,\beta \right)\in O}{e}_{\left(\alpha ,\beta \right)}\left(i,j\right)$
in which each e_{(α, β)} (i, j) is defined by: $\begin{array}{cc}{e}_{\left(\alpha ,\beta \right)}=\left(i,j\right)=\sum _{k=1}^{\mathrm{Ne}}\left[s_k^{\alpha ,\beta }\left(i\alpha -j\beta \right)\times \cos \left(2\pi \frac{v_k}{{\alpha }^2+{\beta }^2}\left(i\beta +j\alpha \right)\right)+t_k^{\alpha ,\beta }\left(i\alpha -j\beta \right)\times \sin \left(2\pi \frac{v_k}{{\alpha }^2+{\beta }^2}\left(i\beta +j\alpha \right)\right)\right]& \left(17\right)\end{array}$
where:

• • [0305] Ne is the number of directional elements associated with (α, β);
  • [0306] v_k is the frequency of the k^th element; and
  • [0307] {s_k(iα−jβ)} and {t_k(iα−jβ)} are the amplitudes.

[0308] The directional component {e(i, j)} is thus completely defined by knowing the parameters contained in the following vector E:
E={α_l,β_l,{_vlk,_slk(c),t_lk(c)}_1k=1^Ne}_(αj,_{62 j})∈O  (18)

[0309] In order to estimate these parameters, use is made of the fact that the directional component of an image is represented in the spectral domain by a set of straight lines of slopes orthogonal to those defined by the pairs of integers (α₁, β₁) of the model which are written (α₁, β₁)^⊥. These straight lines can be decomposed into subsets of same-slope lines each associated with a directional element.

[0310] In order to calculate the elements of the vector E, it is possible to adopt an approach based on projecting the image in different directions. The method consists initially in making sure that a directional component is present before estimating its parameters.

[0311] The directional component of the image is detected on the basis of knowledge about its spectral properties. If the spectrum of the image is considered as being a three-dimensional image (X, Y, Z) in which (X, Y) represent the coordinates of the pixels and Z represents amplitude, then the lines that are to be detected are represented by a set of peaks concentrated along lines of slopes that are defined by the looked-for pairs (α_l, β_l). In order to determine the presence of such lines, it suffices to count the predominant peaks. The number of these peaks provides information about the presence or absence of harmonics or directional supports.

[0312] There follows a description of an example of the method of characterizing the directional component. To do this, direction pairs (α_l, β_l) are calculated and the number of directional elements is determined.

[0313] The method begins with calculating the discrete Fourier transform (DFT) of the image followed by an estimate of the rational slope lines observed in the transformed image ψ(i, j).

[0314] To do this, a discrete set of projections is defined subdividing the frequency domain into different projection angles θ_k, where k is finite. This projection set can be obtained in various ways. For example it is possible to search for all pairs of mutually prime integers (α_k, β_k) defining an angle θ_k such that ${\theta }_k={\tan }^{-1}\frac{{\alpha }_k}{{\beta }_k}$
where $0\le {\theta }_k\le \frac{\pi }{2}.$
An order r such that 0≦α_k, β_k≦r serves to control the number of projections. Symmetry properties can then be used for obtaining all pairs up to 2π.

[0315] The projections of the modulus of the DFT of the image are performed along the angle θ_k. Each projection generates a vector of dimension 1, V_{(αk, βk)}, written V_k to simplify the notation, which contains the looked-for directional information.

[0316] Each projection V_k is given by the formula: $\begin{array}{cc}{V}_k\left(i,j\right)=\sum _{\tau }\Psi \left(i+\tau {\beta }_k,j+\tau {\alpha }_k\right),0<i+\tau {\beta }_k<I-1,0<j+\tau {\alpha }_k<J-1& \left(19\right)\end{array}$
with n=−i*β_k+j*α_k and 0≦|n|<N_k and N_k=|α_k|(T−1)+|β_k|(L−1)+1, page 40 where T*L is the size of the image. ψ(i, j) is the modulus of the Fourier transform of the image to be characterized.

[0317] For each V_k, the high energy elements and their positions in space are selected. These high energy elements are those that present a maximum value relative to a threshold that is calculated depending on the size of the image.

[0318] At this stage of the calculation, the number of lines is known. The number of directional components Ne is deduced therefrom by using the simple spectral properties of the directional component of a textured image. These properties are as follows:

[0319] 1) The lines observed in the spectral domain of a directional component are symmetrical relative to the origin. Consequently, it is possible to reduce the investigation domain to cover only half of the domain under consideration.

[0320] 2) The maximums retained in the vector are candidates for representing lines belonging to directional elements. On the basis of knowledge of the respective positions of the lines on the modulus of the discrete Fourier transform DFT, it is possible to deduce the exact number of directional elements. The position of the line maximum corresponds to the argument of the maximum of the vector V_k, the other lines of the same element being situated every min{L, T}.

[0321] After processing the vectors V_k and producing the direction pairs ({circumflex over (α)}_k, {circumflex over (β)}_k), the numbers of lines obtained with each pair are obtained.

[0322] It is thus possible to count the total number of directional elements by using the two above-mentioned properties, and the pairs of integers ({circumflex over (α)}_k, {circumflex over (β)}_k) associated with these components are identified, i.e. the directions that are orthogonal to those that have been retained.

[0323] For all of these pairs ({circumflex over (α)}_k, {circumflex over (β)}_k), estimating the frequencies of each detected element can be done immediately. If consideration is given solely to the points of the original image along the straight line of equation i{circumflex over (α)}_k−j{circumflex over (β)}_k=c, then c is the position of the maximum in Vk, and these points constitute a harmonic one-dimensional signal (1D) of constant amplitude at a frequency {circumflex over (v)}_{(α, β)}ⁱ. It then suffices to estimate the frequency of this 1D signal by a conventional method (locating the maximum value on the 1D DFT of this new signal).

[0324] To summarize, it is possible to implement the method comprising the following steps:

[0325] Determining the maximum of each projection.

[0326] The maximums are filtered so as to retain only those that are greater than a threshold.

• • [0327] For each maximum mi corresponding to a pair ({circumflex over (α)}_k, {circumflex over (β)}_k).
  • [0328] The number of lines associated with said pair is determined from the above-described properties.
  • [0329] The frequency associated with ({circumflex over (α)}_k, {circumflex over (β)}_k) is calculated, corresponding to the intersection of the horizontal axis and the maximum line (corresponding to the maximum of the retained projection).

[0330] There follows a description of how the amplitudes {ŝ_k^{(α, β)}(t)} and {{circumflex over (t)}_k^{(α, β)}(t)} are calculated, which are the other parameters contained in the above-mentioned vector E.

[0331] Given the direction ({circumflex over (α)}_k, {circumflex over (β)}_k) and the frequency V_k, it is possible to determine the amplitudes Ŝ_k^{(α, β)}(C) and {circumflex over (t)}_k^{(α, β)}(C), for c satisfying the formula i{circumflex over (α)}_k−j{circumflex over (β)}_k=c, using a demodulation method. Ŝ_k^{(α, β)}(c) is equal to the mean of the pixels along the straight line of equation i{circumflex over (α)}_k−j{circumflex over (β)}_k=c of the new image that is obtained by multiplying {tilde over (y)}(i, j) by: $\cos \left(\frac{{\hat{v}}_k^{\left(\alpha ,\beta \right)}}{{\hat{\alpha }}_k^2+{\hat{\beta }}_k^2}\left(i{\hat{\beta }}_k+j{\hat{\alpha }}_k\right)\right)$
This can be written as follows: $\begin{array}{cc}{\hat{s}}_k^{\left(\alpha ,\beta \right)}\left(c\right)\cong \frac{1}{N_s}\sum _{i\hat{\alpha }-j\hat{\beta }=c}\tilde{y}\left(i,j\right)\cos \left(\frac{{\hat{v}}_k^{\left(\alpha ,\beta \right)}}{{\hat{\alpha }}_k^2+{\hat{\beta }}_k^2}\left(i{\hat{\beta }}_k+j{\hat{\alpha }}_k\right)\right)& \left(20\right)\end{array}$
where N_s is the number of elements in this new signal. Similarly, {circumflex over (t)}_k^{(α, β)}(c) can be obtained by applying the equation: $\begin{array}{cc}{\hat{t}}_k^{\left(\alpha ,\beta \right)}\left(c\right)\cong \frac{1}{N_s}\sum _{i\hat{\alpha }-j\hat{\beta }=c}\tilde{y}\left(i,j\right)\sin \left(\frac{{\hat{v}}_k^{\left(\alpha ,\beta \right)}}{{\hat{\alpha }}_k^2+{\hat{\beta }}_k^2}\left(i{\hat{\beta }}_k+j{\hat{\alpha }}_k\right)\right)& \left(21\right)\end{array}$

[0332] The above-described method can be summarized by the following steps:

[0333] For every directional element ({circumflex over (α)}_k, {circumflex over (β)}_k), do

• • [0334] For every line (d), calculate
    • [0335] 1) The mean of the points (i, j) weighted by: $\cos \left(\frac{{\hat{v}}_k^{\left(\alpha ,\beta \right)}}{{\hat{\alpha }}_k^2+{\hat{\beta }}_k^2}\left(i{\hat{\beta }}_k+j{\hat{\alpha }}_k\right)\right)$
      This mean corresponds to the estimated amplitude ŝ_k^{(α, β)}(d).
    • [0336] 2) The mean of the points (i, j) weighted by: $\sin \left(\frac{{\hat{v}}_k^{\left(\alpha ,\beta \right)}}{{\hat{\alpha }}_k^2+{\hat{\beta }}_k^2}\left(i{\hat{\beta }}_k+j{\hat{\alpha }}_k\right)\right)$
      This mean corresponds to the estimated amplitude {circumflex over (t)}_k^{(α, β)}(d).

[0337] Table 3 below summarizes the main steps in the projection method.

	TABLE 3
	Step 1. Calculate the set of projection pairs (αk, βk) ∈ Pr.
	Step 2. Calculate the modulus of the DFT of the image
	{tilde over (y)}(i,j): Ψ(ω,ν)=|DFT(y(i,j))|
	Step 3. For every (αk, βk) ∈ Pr calculate the vector Vk:
	the projection of ψ (w,v) along (αk, βk) using equation (19).
	Step 4: Detecting lines:
	For every (αk, βk) ∈ Pr
	determine ⁢ : ⁢   ⁢ M k = max j ⁢ { V k ⁡ ( j ) } ;
	calculate nk, the number of pixels of significant
value encountered along the projection
	save nk and jmax the index of the maximum in Vk
	select ⁢   ⁢ the ⁢   ⁢ directions ⁢   ⁢ that ⁢   ⁢ satisfy ⁢   ⁢ the ⁢   ⁢ criterion ⁢ : ⁢   ⁢ M k n k > s e
where se is a threshold to be defined, depending on the size of the image.
The directions that are retained are considered as being
the directions of the looked-for lines.
Step 5. Save the looked-for pairs ({circumflex over (α)}k, {circumflex over (β)}kwhich are the
orthogonals of the pairs (αk, βk) retained in step 4.

[0338] There follows a description of detecting and characterizing periodic textural information in an image, as contained in the harmonic component {h(i, j)}. This component can be represented as a finite sum of 2D sinewaves: $\begin{array}{cc}h\left(i,j\right)=\sum _{p=1}^P{C}_p\cos 2\pi \left(i{\omega }_p+j{v}_p\right)+D_p\sin 2\pi \left(i{\omega }_p+j{v}_p\right),& \left(22\right)\end{array}$
where:

• • [0339] c_P and D_p are amplitudes;
  • [0340] (ω_p, v_p) is the p^th spatial frequency.

[0341] The information that is to be determined is constituted by the elements of the vector:
H={P,{C_p,D_p,ω_p,ν_p}_p=1^p}  (23)

[0342] For this purpose, the procedure begins by detecting the presence of said periodic component in the image of the modulus of the Fourier transform, after which its parameters are estimated.

[0343] Detecting the periodic component consists in determining the presence of isolated peaks in the image of the modulus of the DFT. The procedure is the same as when determining the directional components. From the method described in Table 1, if the value n_k obtained during stage 4 of the method described in Table 1 is less than a threshold, then isolated peaks are present that characterize the presence of a harmonic component, rather than peaks that form a continuous line.

[0344] Characterizing the periodic component amounts to locating the isolated peaks in the image of the modulus of the DFT.

[0345] These spatial frequencies ({circumflex over (ω)}_p, {circumflex over (ν)}_p) correspond to the positions of said peaks: $\begin{array}{cc}\left({\hat{\omega }}_p,{\hat{v}}_p\right)=\underset{\left(\omega ,v\right)}{\arg \max }\Psi \left(\omega ,v\right)& \left(24\right)\end{array}$

[0346] In order to calculate the amplitudes (Ĉ_p, {circumflex over (D)}_p) a demodulation method is used as for estimating the amplitudes of the directional component.

[0347] For each periodic element of frequency ({circumflex over (ω)}_p, {circumflex over (ν)}_p), the corresponding amplitude is identical to the mean of the pixels of the new image obtained by multiplying the image {{tilde over (y)}(i, j)} by cos(i{circumflex over (ω)}_p+j{circumflex over (ν)}_p) . This is represented by the following equations: $\begin{array}{cc}{\hat{C}}_p=\frac{1}{L\times T}\sum _{n=0}^{L-1}\sum _{m=0}^{T-1}y\left(n,m\right)\cos \left(n{\hat{\omega }}_p+m{\hat{v}}_p\right)& \left(25\right)\\ {\hat{D}}_p=\frac{1}{L\times T}\sum _{n=0}^{L-1}\sum _{m=0}^{T-1}y\left(n,m\right)\cos \left(n{\hat{\omega }}_p+m{\hat{v}}_p\right)& \left(26\right)\end{array}$

[0348] To sum up, a method of estimating the periodic component comprises the following steps:

	Step 1.	Locate the isolated peaks in the second half of
		the image of the modulus of the Fourier transform and
		count the number of peaks.
	Step 2.	For each detected peak:
		calculate its frequency using equation (24);
		calculate its amplitude using equations (25-26).

[0349] The last information to be extracted is contained in the purely random component {w(i, j)}. This component may be represented by a 2D autoregressive model of the non-symmetrical half-plane support (NSHP) defined by the following difference equation: $\begin{array}{cc}w\left(i,j\right)=-\sum _{\left(k,l\right)\in S_{N,M}}{a}_{k,l}w\left(i-k,j-l\right)+u\left(i,j\right)& \left(27\right)\end{array}$
where {a_{(k, l)}}_{(k, l)εSN,M} are the parameters to be determined for every (k, l) belong to:
S_N,M={(k,l)/k=0,1≦l≦M}∪{(k,l)/1≦k≦N, −M≦l≦M}
The pair (N,M) is known as the order of the model

• • [0350] {u(i, j)} is Gaussian white noise of finite variance σ_u².
    The parameters of the model are given by:
    W={(N,M),σ_u²,{a_k,l}_(k,l)εSN,M}  (28)

[0351] The methods of estimating the elements of W are numerous, such as for example the 2D Levinson algorithm for adaptive methods of the least squares type (LS).

[0352] There follows a description of a method of characterizing the color of an image from which it is desired to extract terms t_i representing characteristics of the image, where color is a particular example of characteristics that can comprise other characteristics such as algebraic or geometrical moments, statistical properties, or the spectral properties of pseudo-Zernicke moments.

[0353] The method is based on perceptual characterization of color, firstly, the color components of the image are transformed from red, green, blue (RGB) space to hue, saturation, value (HSV) space. This produces three components: hue, saturation, value. On the basis of these three components, N colors or iconic components of the image are determined. Each iconic component Ci is represented by a vector of M values. These values represent the angular and annular distribution of points representing each component, and also the number of points of the component in question.

[0354] The method developed is shown in FIG. 9 using, by way of example, N=16 and M=17.

[0355] In a first main step 610, starting from an image 611 in RGB space, the image 611 is transformed from RGB space into HSV space (step 612) in order to obtain an image in HSV space.

[0356] The HSV model can be defined as follows.

[0357] Hue (H): varies over the range [0 360], where each angle represents a hue.

[0358] Saturation (S); varies over the range [0 1], measuring the purity of colors, thus serving to distinguish between colors that are “vivid” , “pastel” , or “faded” .

[0359] Value (V): takes values in the range [0 1], indicates the lightness or darkness of a color and the extent to which it is close to white or black.

[0360] The HSV model is a non-linear transformation of the RGB model. The human eye can distinguish 128 hues, 130 saturations, and 23 shades.

[0361] For white, V=1 and S=0, black has a value V=0, and hue and saturation H and S are undetermined. When V=1 and S=1, then the color is pure.

[0362] Each color is obtained by adding black or white to the pure color.

[0363] In order to have colors that are lighter, S is reduced while maintaining H and V, and in contrast in order to have colors that are darker, black is added by reducing V while leaving H and S unchanged.

[0364] Going from the color image expressed in RGB coordinates to an image expressed in HSV space, is performed as follows:

[0365] For every point of coordinates (i, j) and of value (R_k, G_k, B_k) produce a point of coordinates (i, j) and of value (H_k, S_k, V_k), with:
V_k=max(R_k,B_k,G_k)
$S_k=\frac{V_k-\min \left(R_k,G_k,B_k\right)}{V_k}$
if V_k is equal to R_k $\{\begin{array}{cc}\frac{G_k-B_k}{V_k-\min \left(R_k,G_k,B_k\right)}& \mathrm{if}{V}_k\mathrm{is}\mathrm{equal}\mathrm{to}{R}_k\end{array}$ $\begin{array}{ccc}{H}_k=& 2+\frac{B_k-R_k}{V_k-\min \left(R_k,G_k,B_k\right)}& \mathrm{if}{V}_k\mathrm{is}\mathrm{equal}\mathrm{to}{G}_k\\ & 4+\frac{R_k-G_k}{V_k-\min \left(R_k,G_k,B_k\right)}& \mathrm{if}{V}_k\mathrm{is}\mathrm{equal}\mathrm{to}{B}_k\end{array}$
if V_k is equal to G_k
if V_k is equal to B_k

[0366] Thereafter, the HSV space is partitioned (step 613).

[0367] N colors are defined from the values given to hue, saturation, and value. When N equals 16, then the colors are as follows: black, white, pale gray, dark gray, medium gray, red, pink, orange, brown, olive, yellow, green, sky blue, blue green, blue, purple, magenta.

[0368] For each pixel, the color to which it belongs is determined. Thereafter, the number of points having each color is calculated.

[0369] In a second main step 620, the partitions obtained during the first main step 610 are characterized.

[0370] In this step 620, an attempt is made to characterize each previously obtained partition Ci. A partition is defined by its iconic component and by the coordinates of the pixels that make it up. The description of a partition is based on characterizing the spatial distribution of its pixels (cloud of points). The method begins by calculating the center of gravity, the major axis of the cloud of points, and the axis perpendicular thereto. This new index is used as a reference in decomposing the partition Ci into a plurality of sub-partitions that are represented by the percentage of points making up each of the sub-partitions. The process of characterizing a partition Ci is as follows:

• • [0371] calculating the center of gravity and the orientation angle of the components Ci defining the partitioning index;
  • [0372] calculating the angular distribution of the points of the partition Ci in the N directions operating counterclockwise, in N sub-partitions defined as follows: $\left(0°,\frac{360}{N},\frac{2\times 360}{N},\dots ,\frac{i\times 360}{N},\dots ,\frac{\left(N-1\right)\times 360}{N}\right)$
  • [0373] partitioning the image space into squares of concentric radii, and calculating on each radius the number of points corresponding to each iconic component.

[0374] The characteristic vector is obtained from the number of points of each distribution of color Ci, the number of points in the 8 angular sub-distributions, and the number of image points.

[0375] Thus, the characteristic vector is represented by 17 values in this example.

[0376] FIG. 9 shows the second step 620 of processing on the basis of iconic components C0 to C15 showing for the components C0 (module 621) and C15 (module 631), the various steps undertaken, i.e. angular partitioning 622, 632 leading to a number of points in the eight orientations under consideration (step 623, 633), and annular partitioning 624, 634 leading to a number of points on the eight radii under consideration (step 625, 635), and also taking account of the number of pixels of the component (C0 or C15 as appropriate) in the image (step 626 or step 636).

[0377] Steps 623, 625, and 626 produce 17 values for the component C0 (step 627) and steps 633, 635, and 636 produce 17 values for the component C15 (step 637).

[0378] Naturally, the process is analogous for the other components C1 to C14.

[0379] FIGS. 10 and 11 show the fact that the above-described process is invariant in rotation.

[0380] Thus, in the example of FIG. 10, the image is partitioned in two subsets, one containing crosses x and the other circles ◯. After calculating the center of gravity and the orientation angle θ, an orientation index is obtained that enables four angular sub-divisions (0°, 90°, 180°, 270°) to be obtained.

[0381] Thereafter, an annular distribution is performed, with the numbers of points on a radius equal to 1 and then on a radius equal to 2 being calculated. This produces the vector V0 characteristic of the image of FIG. 10: 19; 6; 5; 4; 4; 8; 11.

[0382] The image of FIG. 11 is obtained by turning the image of FIG. 10 through 90°. By applying the above method to the image of FIG. 11, a vector V1 is obtained characterizing the image and demonstrating that the rotation has no influence on the characteristic vector. This makes it possible to conclude that the method is invariant in rotation.

[0383] As mentioned above, methods making it possible to obtain for each image the terms representing the dominant colors, the textural properties, or the structures of the dominant zones of the image, can be applied equally well to the entire image or to portions of the image.

[0384] There follows a brief description of the process whereby a document can be segmented in order to produce image portions for characterizing.

[0385] In a first possible technique, static decomposition is performed. The image is decomposed into blocks with or without overlapping.

[0386] In a second possible technique, dynamic decomposition is performed. Under such circumstances, the image is decomposed into portions as a function of the content of the image.

[0387] In a first example of the dynamic decomposition technique, the portions are produced from germs constituted by singularity points in the image (points of inflection). The germs are calculated initially, and they are subsequently fused so that only a small number remain, and finally the image points are fused with the germs having the same visual properties (statistics) in order to produce the portions or the segments of the image to be characterized.

[0388] In another technique that relies on hierarchical segmentation, the image points are fused to form n first classes. Thereafter, the points of each of the classes are decomposed into m classes and so on until the desired number of classes is reached. During fusion, points are allocated to the nearest class. A class is represented by its center of gravity and/or a boundary (a surrounding box, a segment, a curve, . . . ).

[0389] The main steps of a method of characterizing the shapes of an image are described below.

[0390] Shape characterization is performed in a plurality of steps:

[0391] To eliminate a zoom effect or variation due to movement of non-rigid elements in an image (movement of lips, leaves on a tree, . . . ), the image is subjected to multiresolution followed by decimation.

[0392] To reduce the effect of shifting in translation, the image or image portion is represented by its Fourier transform.

[0393] To reduce the zoom effect, the image is defined in polar logarithmic space.

[0394] The following steps can be implemented:

• • [0395] a) multiresolution f=wavelet(I, n); where I is the starting image and n is the number of decompositions;
  • [0396] b) projection of the image into logpolar space: g(l, m)=f(i, j) with i=l*cos(m) and j=l*sin(m);
  • [0397] c) calculating the Fourier transform of g: H=FFT(g);
  • [0398] d) characterizing H;
    • [0399] d1) projecting H in a plurality of directions (0, 45, 90, . . . ): the result is a set of vectors of dimension equal to the dimension of the projection segment;
    • [0400] d2) calculating the statistical properties of each projection vector (mean, variance, moments).

[0401] The term representing shape is constituted by the values of the statistical properties of each projection vector.

[0402] Reference is made again to the general scheme of the interception system shown in FIG. 6.

[0403] On receiving a suspect document, the comparison module 260 compares the fingerprint of the received document with the fingerprints in the fingerprint base. The role of the comparison function is to calculate a pertinence function, which, for each document, provides a real value indicative of the degree of resemblance between the content of the document and the content of the suspect document (degree of pertinence). If this value is greater than a threshold, the suspect document 211 is considered as containing copies of portions of the document with which it has been compared. An alert is then generated by the means 213. The alert is processed to block dissemination of the document and/or to generate a report 214 explaining the conditions under which the document can be disseminated.

[0404] It is also possible to interpose between the module 260 for comparing fingerprints and the module 213 for processing alerts, a module 212 for calculating similarity between documents, which module comprises means for producing a correlation vector representative of a degree of correlation between a concept vector taken in a given order defining the fingerprint of a sensitive document and a concept vector taken in a given order defining the fingerprint of a suspect intercepted document.

[0405] The correlation vector makes it possible to determine a resemblance score between the sensitive document and the suspect intercepted document under consideration, and the alert processor means 213 deliver the references of a suspect intercepted document when the value of the resemblance score of said document is greater than a predetermined threshold.

[0406] The module 212 for calculating similarity between two documents interposed between the module 260 for comparing fingerprints and the means 213 for processing alerts may present other forms, and in a variant it may comprise:

[0407] a) means for producing an interference wave representative of the results of pairing between a concept vector taken in a given order defining the fingerprint of a sensitive document, and a concept vector taken in a given order defining the fingerprint of a suspect intercepted document; and

[0408] b) means for producing an interference vector from said interference wave and enabling a resemblance score to be determined between the sensitive document and the suspect intercepted document under consideration.

[0409] The means 213 for processing alerts deliver the references of a suspect intercepted document when the value of the resemblance score for said document is greater than a predetermined threshold.

[0410] The module 212 for calculating similarity between documents in this variant serves to measure the resemblance score between two documents by taking account of the algebraic and topological property between the concepts of the two documents. For a linear case (text, audio, or video), the principle of the method consists in generating an interference wave that expresses collision between the concepts and their neighbors of the query documents with those of the response documents. From this interference wave, an interference vector is calculated that enables the similarity between the documents to be determined by taking account of the neighborhood of the concepts. For a document having a plurality of dimensions, a plurality of interference waves are produced, one wave per dimension. For an image, for example, the positions of the terms (concepts) are projected in both directions, and for each direction, the corresponding interference wave is calculated. The resulting interference vector is a combination of these two vectors.

[0411] There follows a description of an example of calculating an interference wave γ for a document having a single dimension, such as a text type document.

[0412] For a text document D and a query document Q, the interference function γ_{D, Q} defined by U (ordered set of pairs (linguistic units: terms or concepts, positions) (u, p) of the document D) and the set E having values lying in the range 0 to 2. When the set is made up of elements having integer values: E={0, 1, 2 }, the function γ_{D, Q} is defined by:

• • [0413] γ_{D, Q(u, p)}=2 the linguistic unit “u” does not exist in the query document Q;
  • [0414] γ_{D, Q(u, p)}=1 the linguistic unit “u” exists in the query document Q but is isolated;
  • [0415] γ_{D, Q(u, p)}=2 the linguistic unit “u” exists in the query document Q and has at least one neighbor “u” that is a neighbor of the linguistic unit “u” in the document D.

[0416] The function γ_{D, Q} can be thought of as a signal of amplitude lying entirely in the range 0 to 2 and made up of samples comprising the pairs (ui, pi).

[0417] γ_{D, Q} is called the interference wave. It serves to represent the interferences that exist between the documents D and Q. FIG. 18 corresponds to the function (D, Q) of the documents D and Q.

Interference Wave Example

[0418] D: “L'enfant de mon voisin va à la piscine après la sortie de l'ècole pour apprendre comment nager, tandis que sa soeur reste à la maison”

[0419] [My neighbor's son goes to the swimming pool after leaving school in order to learn to swim, while his sister stays at home]

[0420] Q₁: “L'enfant de mon voisin va après l'école en vélo à la piscine pour nager, alors que sa soeur reste à la garderiel”

[0421] [My neighbor's child cycles, after school, to the swimming pool to swim, while his sister stays in the nursery]

[0422] γ_{D, Q}(enfant)=0 because the word “enfant” is present in D and in Q, and it has the same neighbor in D as in Q.

[0423] γ_{D, Q}(enfant)=γ_{D, Q}(va)=γ_{D, Q}(nager)=γ_{D, Q}(soeur)=γ_{D, Q}(reste)=0 for the same reasons.

[0424] γ_{D, Q}(piscine)=γ_{D, Q}(école)=1 because the words “piscine” and “école” are present in D and Q but their neighbors in D are not the same as in Q.

[0425] γ_{D, Q}(sortie)=γ_{D, Q}(apprendre)=γ_{D, Q}(maison)=2 because the words “sortie” , “apprendre” , and “maison” exist in D but do not exist in Q.

[0426] FIG. 19 corresponds to the function (D, Q₂) of the documents D and Q₂.

[0427] Q₂: “L'enfant rentre à la maison après l'école”

[0428] [The child comes home after school]

[0429] The function γ_{D, Q} provides information about the degree of resemblance between D and Q. An analysis of this function makes it possible to identify documents Q which are close to D. Thus, it can be seen that Q1 is closer to D than is Q2.

[0430] In order to make γ_{D, Q} easier to analyze, it is possible to introduce two “interference” vectors V₀ and V₁:

[0431] V₀ relates to the number of contiguous zeros in γ_{D, Q};

[0432] V₁ relates to the number of contiguous ones in γ_{D, Q}.

[0433] The dimension of V₀ is equal to the size of the longest sequence of zeros in γ_{D, Q}.

[0434] The interference vectors V₀ and V₁ are defined as follows:

[0435] The dimension of V₁ has the size of the longest sequence of ones in γ_{D, Q}.

[0436] Slot V₀[n] contains the number of sequences of size n at level 0.

[0437] Slot V₁[n] contains the number of sequences of size n at level 1.

[0438] The interference vectors of the above example are shown in FIGS. 20 and 21.

[0439] The case of (D, Q₁) is shown in FIG. 20:

[0440] The dimension of V₀ is 3 because the longest sequence at level 0 is of length 3.

[0441] The dimension of V₁ is 1 because the longest sequence at level 1 is 1.

[0442] The case for (D, Q₂) is shown in FIG. 21:

[0443] The vector V₀ is empty since there are no sequences at level 0.

[0444] The dimension of V₁ is 1 because the longest sequence at level 1 is of length 1.

[0445] To calculate the similarity score for generating alerts, the following function is defined: $\omega =\frac{\alpha *\sum _{j=1}^{n}j\times V_0\left[j\right]+\sum _{j=1}^{m}j\times V_1\left[j\right]}{\beta }$
where:

[0446] ω=similarity score;

[0447] V₀=the level 0 interference vector;

[0448] V₁=the level 1 interference vector;

[0449] T=the size of text document D in linguistic units;

[0450] n=the size of the level 0 interference vector:

[0451] n=the size of the level 1 interference vector:

[0452] α is a value greater than 1, used to give greater importance to zero level sequences. In both examples below, α is taken to be equal to 2;

[0453] β=a normalization coefficient, and is equal to 0.02×T in this example.

[0454] This formula makes it possible to calculate the similarity score between document D and the query document Q.

[0455] The scores in the above example are as follows:
Case (D, Q₁): $\omega =\frac{2\times \left(1\times 0+2\times 0+3\times 2\right)}{2\times 11}\times 100=\frac{14}{22}\times 100=63.63\%$
Case (D, Q₂): $\omega =\frac{\left(1\times 3\right)}{2\times 11}\times 100=\frac{3}{22}\times 100=13.63\%$

[0456] The process of generating an alert can be as follows:

[0457] Initializing the pertinence function: pertinence (i):

[0458] For i=0 to i equal to the number of documents, do: pertinence (i)=0;

[0459] Extract terms from the suspect document.

[0460] For each term determine its concept.

[0461] For each concept c_j determine the documents in which the concept is present.

[0462] For each document d_i update its pertinence value: pertinence(d_i)=pertinence (d_i)+pertinence (d_i, c_j) with pertinence(d_i, c_j) being the degree of pertinence of the concept c_i in the document d_i which depends on the number of occurrences of the concept in the document and on its presence in the other documents of the database: the more the concept is present in the other documents, the more its pertinence is attenuated in the query document.

[0463] Select the K documents of value greater than a given threshold.

[0464] Correlate the terms of the response documents with the terms of the query document and draw up a new list of responses.

[0465] Apply the module 212 to the new list of responses. If the score is greater than a given threshold, the suspect document is considered as containing portions of the elements of the database. An alert is therefore generated.

[0466] Consideration is given again to processing documents in the modules 221, 222 for creating document fingerprints (FIG. 6) and the process of extracting terms (step 502) and the process of extracting concepts (step 504) as already mentioned, in particular with reference to FIG. 8.

[0467] While indexing a multimedia document comprising video signals, terms t_i are selected that are constituted by key-images representing groups of consecutive homogeneous images, and concepts c_i are determined by grouping together the terms t_i.

[0468] Detecting key-images relies on the way images in a video document are grouped together in groups each of which contains only homogeneous images. From each of these groups one or more images (referred to as key-images) are extracted that are representative of the video document.

[0469] The grouping together of video document images relies on producing a score vector SV representing the content of the video, characterizing variation in consecutive images of the video (the elements SV_i represent the difference between the content of the image of index i and the image of index i−1), with SV being equal to zero when the contents im_i and im_i−1 are identical, and it is large when the difference between the two contents is large.

[0470] In order to calculate the signal SV, the red, green, and blue (RGB) bands of each image im_i of index i in the video are added together to constitute a single image referred to as TRi. Thereafter the image TRi is decomposed into a plurality of frequency bands so as to retain only the low frequency component LTRi. To do this, two mirror filters (a low pass filter LP and a high pass filter HP) are used which are applied in succession to the rows and to the columns of the image. Two types of filter are considered: a Haar wavelet filter and the filter having the following algorithm:

Row Scanning

[0471] From TRk the low image is produced

[0472] For each point a_{2×i, j} of the image TR, do

[0473] Calculate the point b_{i, j} of the low frequency low image, b_{i, j} takes the mean value of a_{2×i, j−l}, a_{2×i, j}, and a_{2×i, j+1}.

Column Scan

[0474] From two low images, the image LTRk is produced

[0475] For each point b_{i, 2×j} of the image TR, do

[0476] Calculate the point bb_{i, j} of the low frequency low image, bb_{i, j} takes the mean value of b_{i, 2×i, j−l}, b_{i, 2×j}, and b_{i, 2×j+1}.

[0477] The row and column scans are applied as often as desired. The number of iterations depends on the resolution of the video images. For images having a size of 512×512, n can be set at three.

[0478] The result image LTRi is projected in a plurality of directions to obtain a set of vectors Vk, where k is the projection angle (element j of V0, the vector obtained following horizontal projection of the image, is equal to the sum of all of the points of row j in the image). The direction vectors of the image LTRi are compared with the direction vectors of the image LTRi−1 to obtain a score i which measures the similarity between the two images. This score is obtained by averaging all of the vector distances having the same direction: for each k, the distance is calculated between the vector Vk of image i and the vector Vk of image i−1, and then all of these distances are calculated.

[0479] The set of all the scores constitutes the score vector SV: element i of SV measures the similarity between the image LTRi and the image LTRi−1. The vector SV is smoothed in order to eliminate irregularities due to the noise generated by manipulating the video.

[0480] There follows a description of an example of grouping images together and extracting key-images.

[0481] The vector SV is analyzed in order to determine the key-images that correspond to the maxima of the values of SV. An image of index j is considered as being a key-image if the value SV(j) is a maximum and if SV(j) is situated between two minimums minL (left minimum) and minR (right minimum) and if the minimum M1 where:
M1=min(|SV(Cj)−minG|,|SV(j)−minR|)
is greater than a given threshold.

[0482] In order to detect key-images, minL is initialized with SV(0) and then the vector SV is scrolled through from left to right. At each step, the index j corresponding to the maximum value situated between two minimums (minL and minR) is determined, and then as a function of the result of the equation defining M1 it is decided whether or not to consider j as being an index for a key-image. It is possible to take a group of several adjacent key-images, e.g. key-images having indices j−1, j, and j+1.

[0483] Three situations arise if the minimum of the two slopes, defined by the two minimums (minL and minR) and the maximum value, is not greater than the threshold:

[0484] i) if |SV(j)=minL| is less than the threshold and minL does not correspond to SV(0), then the maximum SV(j) is ignored and minR becomes minL;

[0485] ii) if |SV(j)−minL| is greater than the threshold and if |SV(j)−minR| is less than the threshold, then minR and the maximum SV(j) are retained and minL is ignored unless the closest maximum to the right of minR is greater than a threshold. Under such circumstances, minR is also retained and j is declared as being an index of a key-image. When minR is ignored, minR takes the value closest to the minimum situated to the right of minR; and

[0486] iii) if both slopes are less than the threshold, minL is retained and minR and j are ignored.

[0487] After selecting a key-image, the process is iterated. At each iteration, minR becomes minL.