System and method for generating analytics for entities depicted in multimedia content

Abstract
A system and method for generating analytics for entities depicted in multimedia content, including: identifying at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to a predetermined social pattern threshold, wherein each social linking score is generated based on contexts of at least one multimedia content element (MMCE) in which at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold; and generating, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.
Description
TECHNICAL FIELD

The present disclosure relates generally to contextual analysis of multimedia content elements, and more specifically to identifying patterns from entities depicted in multimedia content based on the contextual analysis of multimedia content.


BACKGROUND

Since the advent of digital photography and, in particular, after the rise of social networks, the Internet has become inundated with uploaded images, videos, and other content. Often, individuals wish to identify persons captured in images, videos and other content, as well as identify relationships between various identified persons.


Some people manually tag multimedia content in order to indicate the persons shown in images and videos in an effort to assists users seeking content featuring the persons to view the tagged content. The tags may be textual or include other identifiers in metadata of the multimedia content, thereby associating the textual identifiers with the multimedia content. Users may subsequently search for multimedia content elements with respect to tags by providing queries indicating desired subject matter. Tags therefore make it easier for users to find content related to a particular topic.


A popular textual tag is the hashtag. A hashtag is a type of label typically used on social networking websites, chats, forums, microblogging services, and the like. Users create and use hashtags by placing the hash character (or number sign) # in front of a word or unspaced phrase, either in the main text of a message associated with content, or at the end. Searching for that hashtag will then present each message and, consequently, each multimedia content element, that has been tagged with it.


Accurate and complete listings of hashtags can increase the likelihood of a successful search for a certain multimedia content. Existing solutions for tagging typically rely on user inputs to provide identifications of subject matter. However, such manual solutions may result in inaccurate or incomplete tagging. Further, although some automatic tagging solutions exist, such solutions face challenges in efficiently and accurately identifying subject matter of multimedia content, including individuals presented within the multimedia content. Moreover, such solutions typically only recognize superficial expressions of subject matter in multimedia content and, therefore, fail to account for context in tagging multimedia content.


Additionally, tagging often fails to demonstrate certain analytics, such as relationships between subjects within one or multiple multimedia content items. For example, a set of images showing two individuals may appear on a user profile of a social media account, but the social media platform may be unaware of the relationship between the two individuals. Further, it may be difficult to visualize the relationship among a larger group of individuals based on multimedia content items when relying on manual tagging to identify subjects within the multimedia content item or to determine underlying patterns among the relationships between the individuals.


It would therefore be advantageous to provide a solution that would overcome the challenges noted above.


SUMMARY

A summary of several example embodiments of the disclosure follows. This summary is provided for the convenience of the reader to provide a basic understanding of such embodiments and does not wholly define the breadth of the disclosure. This summary is not an extensive overview of all contemplated embodiments, and is intended to neither identify key or critical elements of all embodiments nor to delineate the scope of any or all aspects. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as a prelude to the more detailed description that is presented later. For convenience, the term “some embodiments” may be used herein to refer to a single embodiment or multiple embodiments of the disclosure.


Certain embodiments disclosed herein include a method for generating analytics for entities depicted in multimedia content, including: identifying at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to a predetermined social pattern threshold, wherein each social linking score is generated based on contexts of at least one multimedia content element (MMCE) in which at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold; and generating, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.


Certain embodiments disclosed herein also include a non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to perform a process, the process including: identifying at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to a predetermined social pattern threshold, wherein each social linking score is generated based on contexts of at least one multimedia content element (MMCE) in which at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold; and generating, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.


Certain embodiments disclosed herein also include a system for generating analytics for entities depicted in multimedia content, including a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: identify at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to a predetermined social pattern threshold, wherein each social linking score is generated based on contexts of at least one multimedia content element (MMCE) in which at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold; and generate, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.





BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter disclosed herein is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features, and advantages of the disclosed embodiments will be apparent from the following detailed description taken in conjunction with the accompanying drawings.



FIG. 1 is an example network diagram utilized for describing certain embodiment of the system for determining a social relativeness between entities.



FIG. 2 is an example diagram of a Deep Content Classification system for creating concepts according to an embodiment.



FIG. 3 is a block diagram depicting the basic flow of information in the signature generator system.



FIG. 4 is a diagram showing the flow of patches generation, response vector generation, and signature generation in a large-scale speech-to-text system.



FIG. 5 is a flowchart of a method for generating social linking scores for persons shown in multimedia content elements according to an embodiment.



FIG. 6 is a flowchart illustrating a method of analyzing an MMCE according to an embodiment.



FIG. 7 is a flowchart illustrating a method of generating a social linking score in an embodiment.



FIG. 8 is an example diagram of a social linking graph in an embodiment.



FIG. 9 is a flowchart illustrating a method of generating analytics based on social patterns according to an embodiment.



FIG. 10 is an example diagram of a social linking graph indicating groupings based on analytics in an embodiment.





DETAILED DESCRIPTION

It is important to note that the embodiments disclosed herein are only examples of the many advantageous uses of the innovative teachings herein. In general, statements made in the specification of the present application do not necessarily limit any of the various claimed embodiments. Moreover, some statements may apply to some inventive features but not to others. In general, unless otherwise indicated, singular elements may be in plural and vice versa with no loss of generality. In the drawings, like numerals refer to like parts through several views.


The various disclosed embodiments include a method and system for analyzing multimedia content elements and generating social linking scores of individuals represented in the multimedia content items. Signatures are generated for each multimedia content element. Based on the generated signatures, one or more individuals shown in the multimedia content element are identified.


One or more contexts are generated based on the generated signatures. Based on the generated context and associated metadata, a social linking score is generated for each person shown in the multimedia content element. The generated social linking score may be based on, for example, an amount of multimedia content elements in which a person is shown, a time stamp associated with a first appearance in a multimedia content element, a time stamp associated with a last appearance in a multimedia content element, physical interaction with the user in the multimedia content elements (e.g., kissing, hugging, shaking hands, etc.), a location coordinate identified based on the analysis, other persons identified therein, tags, comments, and the like. In an embodiment, a social linking graph is generated based on the generated scores.



FIG. 1 is an example network diagram 100 utilized for describing certain embodiments disclosed herein. A user device 120, a database (DB) 130, a server 140, a signature generator system (SGS) 150, and a Deep Content Classification (DCC) system 160 are connected to a network 110. The network 110 may be, but is not limited to, a local area network (LAN), a wide area network (WAN), a metro area network (MAN), the world wide web (WWW), the Internet, a wired network, a wireless network, and the like, as well as any combination thereof.


The user device 120 may be, but is not limited to, a personal computer (PC), a personal digital assistant (PDA), a mobile phone, a smart phone, a tablet computer, a wearable computing device, and other kinds of wired and mobile devices capable of capturing, uploading, browsing, viewing, listening, filtering, and managing multimedia content elements as further discussed herein below. The user device 120 may have installed thereon an application 125 such as, but not limited to, a web browser. The application 125 may be downloaded from an application repository, such as the AppStore®, Google Play®, or any repositories hosting software applications. The application 125 may be pre-installed in the user device 120.


The application 125 may be configured to store and access multimedia content elements within the user device, such as on an internal storage (not shown), as well as to access multimedia content elements from an external source, such as the database or a social media website. For example, the application 125 may be a web browser through which a user of the user device 120 accesses a social media website and uploads multimedia content elements thereto.


The database 130 is configured to store MMCEs, signatures generated based on MMCEs, concepts that have been generated based on signatures, contexts that have been generated based on concepts, social linking scores, social linking graphs, or a combination thereof. The database 130 is accessible by the server 140, either via the network 110 (as shown in FIG. 1) or directly (not shown).


The server 140 is configured to communicate with the user device 120 via the network 110. The server 140 may include a processing circuitry such as a processing circuitry and a memory (both not shown). The processing circuitry may be realized as one or more hardware logic components and circuits. For example, and without limitation, illustrative types of hardware logic components that can be used include field programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip systems (SOCs), general-purpose microprocessors, microcontrollers, digital signal processors (DSPs), and the like, or any other hardware logic components that can perform calculations or other manipulations of information.


In an embodiment, the memory is configured to store software. Software shall be construed broadly to mean any type of instructions, whether referred to as software, firmware, middleware, microcode, hardware description language, or otherwise. Instructions may include code (e.g., in source code format, binary code format, executable code format, or any other suitable format of code). The instructions, when executed by the one or more processors, cause the processing circuitry to perform the various processes described herein. Specifically, the instructions, when executed, configure the processing circuitry to determine social linking scores, as discussed further herein below.


In an embodiment, the server 140 is configured to access to a plurality of multimedia content elements (MMCEs), for example, from the user device 120 via the application 125 installed thereon, that are associated with a user of the user device 120. The MMCEs may be, for example, an image, a graphic, a video stream, a video clip, an audio stream, an audio clip, a video frame, a photograph, and/or combinations thereof and portions thereof. The MMCEs may be captured by a sensor (not shown) of the user device 120. The sensor may be, for example, a still camera, a video camera, a combination thereof, etc. Alternatively, the MMCEs may be accessed from a web source over the network 110, such as a social media website, or from the database 140.


The server 140 is configured to analyze the plurality of MMCEs and generate signatures based on each of the MMCEs. In an embodiment, the MMCEs are sent to the SGS 150 over the network 110. In an embodiment, the SGS 150 is configured to generate at least on signature for each MMCE, based on content of the received MMCE as further described herein. The signatures may be robust to noise and distortion as discussed below.


According to further embodiment, the server 140 may further be configured to identify metadata associated with each of the MMCEs. The metadata may include, for example, a time stamp of the capturing of the MMCE, the device used for the capturing, a location pointer, tags or comments, and the like.


The Deep Content Classification (DCC) system 160 is configured to identify at least one concept based on the generated signatures. Each concept is a collection of signatures representing MMCEs and metadata describing the concept, and acts as an abstract description of the content to which the signature was generated. As a non-limiting example, a ‘Superman concept’ is a signature-reduced cluster of signatures describing elements (such as multimedia elements) related to, e.g., a Superman cartoon: a set of metadata representing proving textual representation of the Superman concept. As another example, metadata of a concept represented by the signature generated for a picture showing a bouquet of red roses is “flowers”. As yet another example, metadata of a concept represented by the signature generated for a picture showing a bouquet of wilted roses is “wilted flowers”.


The server 140 is further configured to generate one or more contexts for each MMCE in which a person is shown. Each context is determined by correlating among the signatures, the concepts, or both. A strong context may be determined, e.g., when there are at least a threshold number of concepts that satisfy the same predefined condition. As a non-limiting example, by correlating a signature of a person in a baseball uniform with a signature of a baseball stadium, a context representing a “baseball player” may be determined. Correlations among the concepts of multimedia content elements can be achieved using probabilistic models by, e.g., identifying a ratio between signatures' sizes, a spatial location of each signature, and the like. Determining contexts for multimedia content elements is described further in the above-referenced U.S. patent application Ser. No. 13/770,603, assigned to the common assignee, which is hereby incorporated by reference. It should be noted that using signatures for determining the context ensures more accurate reorganization of multimedia content than, for example, when using metadata.


Based on the generated contexts and associated metadata, or both, the server 140 is configured to generate a social linking score associated with each person depicted in the MMCEs. The social linking score is a value representing the social relativeness of two or more entities, where the social relativeness indicates how close the entities are within a social sphere. The entities may include, but are not limited to, people. As a non-limiting example, upon identifying a certain person as the user's son, the social linking score shall be higher than, for example, a colleague of the user. The generation of the social linking score is further described herein below with respect to FIG. 7.


In an embodiment, based on the social linking scores, the server 140 is configured to generate a social linking graph representative of the persons shown in the MMCEs and their respective social linking scores. An example of the social linking graph is shown herein below in FIG. 8. In a further embodiment, the server 140 is configured to generate analytics based on the social linking scores, the social linking graphs, the MMCEs, combinations thereof, portions thereof, and the like. Analytics may include, but are not limited to, a social relationship and social status between two or more entities.


It should be noted that only one user device 120 and one application 125 are discussed with reference to FIG. 1 merely for the sake of simplicity. However, the embodiments disclosed herein are applicable to a plurality of user devices that can communicate with the server 130 via the network 110, where each user device includes at least one application.



FIG. 2 shows an example diagram of a DCC system 160 for creating concepts. The DCC system 160 is configured to receive a first MMCE and at least a second MMCE, for example from the server 140 via a network interface 260.


The MMCEs are processed by a patch attention processor (PAP) 210, resulting in a plurality of patches that are of specific interest, or otherwise of higher interest than other patches. A more general pattern extraction, such as an attention processor (AP) (not shown) may also be used in lieu of patches. The AP receives the MMCE that is partitioned into items; an item may be an extracted pattern or a patch, or any other applicable partition depending on the type of the MMCE. The functions of the PAP 210 are described herein below in more detail.


The patches that are of higher interest are then used by a signature generator, e.g., the SGS 150 of FIG. 1, to generate signatures based on the patch. A clustering processor (CP) 230 inter-matches the generated signatures once it determines that there are a number of patches that are above a predefined threshold. The threshold may be defined to be large enough to enable proper and meaningful clustering. With a plurality of clusters, a process of clustering reduction takes place so as to extract the most useful data about the cluster and keep it at an optimal size to produce meaningful results. The process of cluster reduction is continuous. When new signatures are provided after the initial phase of the operation of the CP 230, the new signatures may be immediately checked against the reduced clusters to save on the operation of the CP 230. A more detailed description of the operation of the CP 230 is provided herein below.


A concept generator (CG) 240 is configured to create concept structures (hereinafter referred to as concepts) from the reduced clusters provided by the CP 230. Each concept comprises a plurality of metadata associated with the reduced clusters. The result is a compact representation of a concept that can now be easily compared against a MMCE to determine if the received MMCE matches a concept stored, for example, in the database 130 of FIG. 1. This can be done, for example and without limitation, by providing a query to the DCC system 160 for finding a match between a concept and a MMCE.


It should be appreciated that the DCC system 160 can generate a number of concepts significantly smaller than the number of MMCEs. For example, if one billion (109) MMCEs need to be checked for a match against another one billon MMCEs, typically the result is that no less than 109×109=1018 matches have to take place. The DCC system 160 would typically have around 10 million concepts or less, and therefore at most only 2×106×109=2×1015 comparisons need to take place, a mere 0.2% of the number of matches that have had to be made by other solutions. As the number of concepts grows significantly slower than the number of MMCEs, the advantages of the DCC system 160 would be apparent to one with ordinary skill in the art.



FIGS. 3 and 4 illustrate the generation of signatures for the multimedia content elements by the SGS 150 according to an embodiment. An example high-level description of the process for large scale matching is depicted in FIG. 3. In this example, the matching is for a video content.


Video content segments 2 from a Master database (DB) 6 and a Target DB 1 are processed in parallel by a large number of independent computational Cores 3 that constitute an architecture for generating the Signatures (hereinafter the “Architecture”). Further details on the computational Cores generation are provided below. The independent Cores 3 generate a database of Robust Signatures and Signatures 4 for Target content-segments 5 and a database of Robust Signatures and Signatures 7 for Master content-segments 8. An exemplary and non-limiting process of signature generation for an audio component is shown in detail in FIG. 4. Finally, Target Robust Signatures and/or Signatures are effectively matched, by a matching algorithm 9, to Master Robust Signatures and/or Signatures database to find all matches between the two databases.


To demonstrate an example of the signature generation process, it is assumed, merely for the sake of simplicity and without limitation on the generality of the disclosed embodiments, that the signatures are based on a single frame, leading to certain simplification of the computational cores generation. The Matching System is extensible for signatures generation capturing the dynamics in-between the frames. In an embodiment the server 130 is configured with a plurality of computational cores to perform matching between signatures.


The Signatures' generation process is now described with reference to FIG. 4. The first step in the process of signatures generation from a given speech-segment is to breakdown the speech-segment to K patches 14 of random length P and random position within the speech segment 12. The breakdown is performed by the patch generator component 21. The value of the number of patches K, random length P and random position parameters is determined based on optimization, considering the tradeoff between accuracy rate and the number of fast matches required in the flow process of the server 140 and SGS 150. Thereafter, all the K patches are injected in parallel into all computational Cores 3 to generate K response vectors 22, which are fed into a signature generator system 23 to produce a database of Robust Signatures and Signatures 4.


In order to generate Robust Signatures, i.e., Signatures that are robust to additive noise L (where L is an integer equal to or greater than 1) by the Computational Cores 3 a frame ‘i’ is injected into all the Cores 3. Then, Cores 3 generate two binary response vectors: {right arrow over (S)} which is a Signature vector, and {right arrow over (RS)} which is a Robust Signature vector.


For generation of signatures robust to additive noise, such as White-Gaussian-Noise, scratch, etc., but not robust to distortions, such as crop, shift and rotation, etc., a core Ci={ni} (1≤i≤L) may consist of a single leaky integrate-to-threshold unit (LTU) node or more nodes. The node ni equations are:







V
i

=



j




w
ij



k
j










n
i

=

θ


(

Vi
-

Th
x


)






where, θ is a Heaviside step function; wij is a coupling node unit (CNU) between node i and image component j (for example, grayscale value of a certain pixel j); kj is an image component ‘j’ (for example, grayscale value of a certain pixel j); Thx is a constant Threshold value, where ‘x’ is ‘S’ for Signature and ‘RS’ for Robust Signature; and Vi is a Coupling Node Value.


The Threshold values Thx are set differently for Signature generation and for Robust Signature generation. For example, for a certain distribution of Vi values (for the set of nodes), the thresholds for Signature (ThS) and Robust Signature (ThRS) are set apart, after optimization, according to at least one or more of the following criteria:

    • 1: For: Vi>ThRS
      • 1−p(V>ThS)−1−(1−ε)l<<1


        i.e., given that l nodes (cores) constitute a Robust Signature of a certain image I, the probability that not all of these I nodes will belong to the Signature of same, but noisy image, Ĩ is sufficiently low (according to a system's specified accuracy).
    • 2: p(Vi>ThRS)≈l/L


      i.e., approximately l out of the total L nodes can be found to generate a Robust Signature according to the above definition.
    • 3: Both Robust Signature and Signature are generated for certain frame i.


It should be understood that the generation of a signature is unidirectional, and typically yields lossless compression, where the characteristics of the compressed data are maintained but the uncompressed data cannot be reconstructed. Therefore, a signature can be used for the purpose of comparison to another signature without the need of comparison to the original data. The detailed description of the Signature generation can be found in U.S. Pat. No. 8,326,775, assigned to the common assignee, which is hereby incorporated by reference.


A Computational Core generation is a process of definition, selection, and tuning of the parameters of the cores for a certain realization in a specific system and application. The process is based on several design considerations, such as:


(a) The Cores should be designed so as to obtain maximal independence, i.e., the projection from a signal space should generate a maximal pair-wise distance between any two cores' projections into a high-dimensional space.


(b) The Cores should be optimally designed for the type of signals, i.e., the Cores should be maximally sensitive to the spatio-temporal structure of the injected signal, for example, and in particular, sensitive to local correlations in time and space. Thus, in some cases a core represents a dynamic system, such as in state space, phase space, edge of chaos, etc., which is uniquely used herein to exploit their maximal computational power.


(c) The Cores should be optimally designed with regard to invariance to a set of signal distortions, of interest in relevant applications.


A detailed description of the Computational Core generation and the process for configuring such cores is discussed in more detail in the U.S. Pat. No. 8,655,801 referenced above, the contents of which are incorporated by reference.


Signatures are generated by the Signature Generator System based on patches received either from the PAP 210, or retrieved from the database 130, as discussed herein above. It should be noted that other ways for generating signatures may also be used for the purpose the DCC system 160. Furthermore, as noted above, the array of computational cores may be used by the PAP 210 for the purpose of determining if a patch has an entropy level that is of interest for signature generation according to the principles of the invention.



FIG. 5 illustrates a flowchart of a method 500 for generating social linking scores for persons shown in multimedia content elements according to an embodiment. In an embodiment, the method may be performed by the server 140, FIG. 1.


At S510, a plurality of MMCEs are received. At S520, the MMCEs are analyzed. In an embodiment, the analysis includes generating signatures, concepts, contexts, or a combination thereof, based on the received MMCEs as further described herein with respect to FIGS. 1 and 6.


At S530, a social linking score is generated for each person shown in the received MMCEs based on the analysis. Generating social linking scores is further described herein below with respect to FIG. 7.


At optional S540, a social linking graph is generated based on the generated social linking scores, where the social linking graph is a visual representation of the connections and relationship between persons identified within the received MMCEs. At optional S550, the social linking graph is sent to, for example, a user device (e.g., the user device 120, FIG. 1). At S560, it is checked whether additional MMCEs are to be analyzed and if so, execution continues with S520; otherwise, execution terminates.



FIG. 6 is a flowchart illustrating a method S520 of analyzing an MMCE according to an embodiment. At S610, at least one signature is generated for the MMCE, as described above with respect to FIG. 1, where signatures represent at least a portion of the MMCE. At S620, metadata associated with the MMCE is collected. The metadata may include, for example, a time stamp of the capturing of the MMCE, the device used for the capturing, a location pointer, tags or comments associated therewith, and the like.


At S630, based on the generated signatures and collected metadata, it is determined if at least one person is shown or depicted within the MMCE. If so, execution continues with S640; otherwise, execution terminates. In an embodiment, S630 includes comparing the generated signatures to reference signatures representing people, where it is determined that at least one person is shown when at least a portion of the generated signatures matches the reference signatures above a predetermined threshold.


At S640, when it is determined that a person is depicted in the MMCE, concepts are generated, where a concept is a collection of signatures representing elements of the unstructured data and metadata describing the concept. Each generated concept represents a person depicted in the MMCE. At S650, a context is generated based on correlation between the generated concepts. A context is determined as the correlation between a plurality of concepts.



FIG. 7 is a flowchart illustrating a method S530 of generating a social linking score in an embodiment. At S710, the generated context of each MMCE having a person shown therein is analyzed. At S720, metadata associated with the MMCEs is identified. At S730, based on the generated context and the identified metadata, the social relativeness between two or more persons shown in each MMCE and the user is determined. At S740, a social linking score is generated based on the social relativeness determination, and execution terminates. Each social linking score represents a closeness between two persons. For example, family members may have a higher social linking score than friends or acquaintances.


The generated social linking score may be based on, for example, an amount of multimedia content elements in which a person is shown, a time stamp associated with a first appearance in a multimedia content element, a time stamp associated with a last appearance in a multimedia content element, physical interaction with the user in the multimedia content elements (e.g., kissing, hugging, shaking hands, etc.), a location coordinate identified based on the analysis, other persons therein, tags and comments, a combination thereof, and the like.


In an embodiment, the social linking score may be determined based on weighted scoring. For example, if person A and person B only appear in one MMCE where they are kissing, while person A and person C appear in twenty MMCEs without physical contact, it may be determined that persons A and B are related or have a very close relationship, whereas persons A and C are not closely connected. Accordingly, the social linking score generated for persons A and B may be higher than the social linking score generated for persons B and C. In a further example, if persons A and D appear in an MMCE together where they are the only persons identified within the MMCE, and persons A and E appear together in large group picture, it may be determined that persons A and D have a closer relationship that persons A and E, and the social linking score generated for persons A and D may be higher than the social linking score generated for persons A and E.



FIG. 8 is an example diagram of a social linking graph 800 in an embodiment. The social linking graph 800 visually represents the social relativeness of each person shown in the MMCEs associated with the user of a user device, for example, the user device 120. Each circle 810 represents a person identified in the MMCEs. In an embodiment, lines 820 are shown extending between circles to represent connection between persons shown in the MMCEs. In some implementations, different colors, shading, line thickness, and other visual markers may be utilized to differentiate among individuals having higher social linking scores than individuals having lower social linking scores.



FIG. 9 is a flowchart illustrating a method 900 for generating analytics based on social patterns according to an embodiment. In an embodiment, the method may be performed by the server 140, FIG. 1.


At S910, a request is received to generate analytics. In some implementations, the request may be received from a user device.


At S920, a social linking graph is obtained. In an embodiment, the social linking graph is retrieved from a database, e.g., the database 130 of FIG. 1. The social linking graph indicates entities and social linking scores, where each entity is associated with social linking scores indicating the social relativeness between the entity and other entities of the social linking graph.


At S930, a social pattern is identified based on the social linking graph. The social pattern may be determined by analyzing the social linking graph, the social linking scores, MMCEs associated with the social linking graph, a combination thereof, a portion thereof, and the like. To this end, S930 may include determining whether one or more predetermined social pattern thresholds are met. The social pattern threshold may be, but is not limited to, a social linking score, number of connections, a number of MMCEs in which two or more of the same entities appear and the like.


The social pattern may include social characteristics such as connections between two or more entities, locations depicted in MMCEs, dates of MMCEs, number of MMCEs in which two or more of the same entities appear therein, number of MMCEs in which each of two entities appear therein with a third entity, a combination thereof, and the like. For example, a social pattern may indicate that person A and person B appear in at least 25 images together, where the location is determined to be an office building. In an embodiment, the MMCEs are embedded with location data, such as Global Positioning System (GPS) coordinates, which may be matched to a public mapping database to determine the location of the capture of an MMCE. The location data may be included in, e.g., metadata associated with the MMCEs.


At S940, analytics are generated based on the social pattern. Analytics may include a social relationship between entities such as, but not limited to, a familial relationship, a friend relationship, a professional relationship, and the like. The social relationship may be determined based on the social linking score between the entities, e.g., where a social linking score between two entities above a first predetermined threshold may indicate a professional relationship, a social linking score above a second predetermined threshold may indicate a friend relationship, and a social linking score above a third predetermined threshold may indicate a familial relationship.


In a further embodiment, the analytics may be further generated based on one or more demographic parameters, names, and the like, of each entity (e.g., demographic parameters indicated in social media profiles of the entities, stored in a database, etc.). As a non-limiting example, if last names of the entities match (e.g., the entities are named “John Smith” and Mary Smith”) and the social linking score is above a threshold, a familial relationship may be determined.


In another embodiment, signatures generated from MMCEs associated with the social linking graph may be utilized to identify objects that indicate a type of location in which the entities appear together, e.g., a couch indicating a home location and a desk with a computer indicating an office location. As a non-limiting example, if a social pattern indicates that person C and person D have a social linking score above 0.8, are depicted together in at least 25 images, wherein the majority of those images show a house, and the person C is at least 20 years older than person D, the analytics may be generated to indicate that person C is a parent of person D. In an embodiment, the generated analytics may be sent to a user device for display.


In a further embodiment, the analytics may include additional characteristics associated with the entities. Additional characteristics may include the hierarchy or position of a relationship, such as an older sibling and a younger sibling or an employer and employee. The additional characteristics may further include other shared information related to the relationship between the entities such as, but not limited to, same place of work, same positions of employment, sameworking groups, same location of residence, and the like. The additional characteristics may be determined based on the depicted ages of the entities within the MMCEs, dynamics displayed within the MMCEs (e.g., an older person behind a desk indicating an employer, and a younger person standing in front of the desk indicating an employee), and the like. In some implementations, the additional characteristics may be determined based further on the type of relationship. As a non-limiting example, ages may only be compared when a familial relationship is determined.


In some implementations, S940 may further include comparing signatures representing one entity to signatures representing another entity to determine whether there is a similarity in appearance among the entities. The signatures of each entity may include portions of signatures generated for MMCEs associated with the social linking graph showing the respective entities. For example, if the signatures of the two entities match above a predetermined threshold, a similarity in appearance may be determined. The analytics may be generated based further on any determined similarities in appearance. For example, when the social linking score between two entities is above a threshold and the entities demonstrate a similarity in appearance, a familial relationship may be determined.


At S950, it is checked if more patterns are to be identified from the social linking graph. If so, execution continues with S930; otherwise, execution terminates. In some implementations, execution continues until no more patterns are identified.



FIG. 10 is an example diagram illustrating the social linking graph 800 indicating groupings 1010 and 1020. The social linking graph 800 indicates entities 810 representing entities identified in MMCEs, and the groupings 1010 and 1020 indicate the entities demonstrating social patterns. An analysis of the social patterns enables the discovery of analytics, such as the type of relationship between two or more entities. In some implementations, differences in color, shading, line thickness, and other visual markers may be utilized to visually differentiate among the various groupings shown in the social linking graph 800.


As used herein, the phrase “at least one of” followed by a listing of items means that any of the listed items can be utilized individually, or any combination of two or more of the listed items can be utilized. For example, if a system is described as including “at least one of A, B, and C,” the system can include A alone; B alone; C alone; A and B in combination; B and C in combination; A and C in combination; or A, B, and C in combination.


It should be understood that any reference to an element herein using a designation such as “first,” “second,” and so forth does not generally limit the quantity or order of those elements. Rather, these designations are generally used herein as a convenient method of distinguishing between two or more elements or instances of an element. Thus, a reference to first and second elements does not mean that only two elements may be employed there or that the first element must precede the second element in some manner. Also, unless stated otherwise, a set of elements comprises one or more elements.


The various embodiments disclosed herein can be implemented as hardware, firmware, software, or any combination thereof. Moreover, the software is preferably implemented as an application program tangibly embodied on a program storage unit or computer readable medium consisting of parts, or of certain devices and/or a combination of devices. The application program may be uploaded to, and executed by, a machine comprising any suitable architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (“CPUs”), a memory, and input/output interfaces. The computer platform may also include an operating system and microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or part of the application program, or any combination thereof, which may be executed by a CPU, whether or not such a computer or processor is explicitly shown. In addition, various other peripheral units may be connected to the computer platform such as an additional data storage unit and a printing unit. Furthermore, a non-transitory computer readable medium is any computer readable medium except for a transitory propagating signal.


All examples and conditional language recited herein are intended for pedagogical purposes to aid the reader in understanding the principles of the disclosed embodiment and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments of the disclosed embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.

Claims
  • 1. A method for generating analytics for entities depicted in multimedia content, comprising: accessing, by a server and over a network, at least one multimedia content element (MMCE);identifying, by a server, at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to at least one predetermined social pattern threshold, wherein each social linking score is generated, by the server, based on contexts of the at least one MMCE, wherein in each of the at least one MMCE at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold;wherein the identifying at least one social pattern further comprises:determining the plurality of concepts for each MMCE by a deep content classification system, wherein each concept is a collection of signatures representing MMCEs and metadata describing the concept, wherein each context of each MMCE is determined by correlating among the determined plurality of concepts of the MMCE; and wherein the signatures are robust to noise and distortion; andgenerating, based on the identified at least one social pattern and by the server, analytics for the plurality of entities depicted in the social linking graph.
  • 2. The method of claim 1, wherein the plurality of entities is identified in the at least one MMCE based on the signatures generated for the at least one MMCE.
  • 3. The method of claim 1, wherein the at least one social pattern includes at least one of: connections among the plurality of entities, locations depicted in the at least one MMCE, dates associated with the at least one MMCE, a number of MMCEs of the at least one MMCE in which each set of two of the plurality of entities appear, and a number of MMCEs of the at least one MMCE in which each set of two entities of the plurality of entities appear with a third entity.
  • 4. The method of claim 1, wherein the analytics include at least one social relationship between two of the plurality of entities.
  • 5. The method of claim 4, further comprising: determining at least one additional characteristic of each social relationship, wherein the analytics further include the determined at least one additional characteristic of each social relationship, wherein each additional characteristic is determined based on at least one of: demographic parameters of the at least two entities, at least one identified object in the at least one MMCE, and comparison between signatures representing the at least two entities.
  • 6. The method of claim 1, wherein each social linking score is generated based further on at least one of: a number of MMCEs in which the at least two entities are shown, a time stamp associated with a first appearance of one of the at least two entities in the at least one MMCE, a time stamp associated with a last appearance of one of the at least two entities in the at least one MMCE, a physical interaction between the at least two entities depicted in at least one of the at least one MMCE, a location coordinate associated with each of the at least one MMCE, other entities depicted in the at least one MMCE, and tags of the at least one MMCE.
  • 7. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry of a server to perform a process, the process comprising: accessing over a network at least one multimedia content element (MMCE);identifying at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to at least one predetermined social pattern threshold, wherein each social linking score is generated based on contexts of the at least one MMCE, wherein in each of the at least one MMCE at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold;wherein the identifying at least one social pattern further comprises:determining the plurality of concepts for each MMCE by a deep content classification system, wherein each concept is a collection of signatures representing MMCEs and metadata describing the concept, wherein each context of each MMCE is determined by correlating among the determined plurality of concepts of the MMCE; and wherein the signatures are robust to noise and distortion;andgenerating, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.
  • 8. A server for determining a social relativeness between at least two entities depicted in at least one multimedia content element (MMCE), comprising: a processing circuitry; anda memory, the memory containing instructions that, when executed by the processing circuitry, configure the server to:access over a network at least one multimedia content element (MMCE);identify at least one social pattern based on social linking scores of a plurality of entities indicated in a social linking graph, wherein each social pattern is identified at least by comparing one of the social linking scores to at least one predetermined social pattern threshold, wherein each social linking score is generated based on contexts of the at least one MMCE, wherein in each of the at least one MMCE at least two of the plurality of entities are depicted, wherein each context is determined based on a plurality of concepts of one of the at least one MMCE, wherein each concept matches at least one signature generated for the at least one MMCE above a predetermined threshold;wherein the identifying at least one social pattern further comprises:determining the plurality of concepts for each MMCE by a deep content classification system, wherein each concept is a collection of signatures representing MMCEs and metadata describing the concept, wherein each context of each MMCE is determined by correlating among the determined plurality of concepts of the MMCE; and wherein the signatures are robust to noise and distortion; andgenerate, based on the identified at least one social pattern, analytics for the plurality of entities depicted in the social linking graph.
  • 9. The server of claim 8, wherein the plurality of entities is identified in the at least one MMCE based on the signatures generated for the at least one MMCE.
  • 10. The server of claim 8, wherein the at least one social pattern includes at least one of: connections among the plurality of entities, locations depicted in the at least one MMCE, dates associated with the at least one MMCE, a number of MMCEs of the at least one MMCE in which each set of two of the plurality of entities appear, and a number of MMCEs of the at least one MMCE in which each set of two entities of the plurality of entities appear with a third entity.
  • 11. The server of claim 8, wherein the analytics include at least one social relationship between two of the plurality of entities.
  • 12. The server of claim 11, that is configured to: determine at least one additional characteristic of each social relationship, wherein the analytics further include the determined at least one additional characteristic of each social relationship, wherein each additional characteristic is determined based on at least one of: demographic parameters of the at least two entities, at least one identified object in the at least one MMCE, and comparison between signatures representing the at least two entities.
  • 13. The server of claim 8, that is configured to identify at least one social pattern by: determining the plurality of concepts for each MMCE, wherein each concept is a collection of signatures representing the content within the MMCE and metadata describing the concept, wherein each context of each MMCE is determined by correlating among the determined plurality of concepts of the MMCE.
  • 14. The server of claim 8, wherein each social linking score is generated based further on at least one of: a number of MMCEs in which the at least two entities are shown, a time stamp associated with a first appearance of one of the at least two entities in the at least one MMCE, a time stamp associated with a last appearance of one of the at least two entities in the at least one MMCE, a physical interaction between the at least two entities depicted in at least one of the at least one MMCE, a location coordinate associated with each of the at least one MMCE, other entities depicted in the at least one MMCE, and tags of the at least one MMCE.
  • 15. The method according to claim 1 comprising assigning a first social linking score to two of the plurality of entities when only the two of the plurality of entities appear together in the at least one MMCE; and assigning a second social linking score to the two of the plurality of entities when the two of the plurality of entities and additional entities appear together in the at least one MMCE; wherein the first social linking score is higher than the second social linking score.
  • 16. The method according to claim 1 comprising assigning social linking score to two of the plurality of entities, the social linking score is based on (a) a number of the at least one MMCE, and (b) a physical interaction between the two of the plurality of entities that is captured in the at least one MMCE.
  • 17. The method of claim 1, wherein the at least one social pattern includes locations depicted in the at least one MMCE.
  • 18. The method according to claim 1 comprising assigning social linking score to two of the plurality of entities, the social linking score is based on whether the at least one MMCE captures a kissing of the two of the plurality of entities.
  • 19. The method according to claim 1 wherein the accessing comprises accessing a user device to retrieve the at least one MMCE.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 62/424,572 filed on Nov. 21, 2016. This application is also a continuation-in-part of U.S. patent application Ser. No. 13/770,603 filed on Feb. 19, 2013, which is a continuation-in-part (CIP) of U.S. patent application Ser. No. 13/624,397 filed on Sep. 21, 2012, now U.S. Pat. No. 9,191,626. The Ser. No. 13/624,397 application is a CIP of: (a) U.S. patent application Ser. No. 13/344,400 filed on Jan. 5, 2012, now U.S. Pat. No. 8,959,037, which is a continuation of U.S. patent application Ser. No. 12/434,221 filed on May 1, 2009, now U.S. Pat. No. 8,112,376;(b) U.S. patent application Ser. No. 12/195,863 filed on Aug. 21, 2008, now U.S. Pat. No. 8,326,775, which claims priority under 35 USC 119 from Israeli Application No. 185414, filed on Aug. 21, 2007, and which is also a continuation-in-part of the below-referenced U.S. patent application Ser. No. 12/084,150; and(c) U.S. patent application Ser. No. 12/084,150 having a filing date of Apr. 7, 2009, now U.S. Pat. No. 8,655,801, which is the National Stage of International Application No. PCT/IL2006/001235, filed on Oct. 26, 2006, which claims foreign priority from Israeli Application No. 171577 filed on Oct. 26, 2005, and Israeli Application No. 173409 filed on Jan. 29, 2006.All of the applications referenced above are herein incorporated by reference.

US Referenced Citations (447)
Number Name Date Kind
4733353 Jaswa Mar 1988 A
4932645 Schorey et al. Jun 1990 A
4972363 Nguyen et al. Nov 1990 A
5307451 Clark Apr 1994 A
5568181 Greenwood et al. Oct 1996 A
5745678 Herzberg et al. Apr 1998 A
5806061 Chaudhuri et al. Sep 1998 A
5852435 Vigneaux et al. Dec 1998 A
5870754 Dimitrova et al. Feb 1999 A
5873080 Coden et al. Feb 1999 A
5887193 Takahashi et al. Mar 1999 A
5978754 Kumano Nov 1999 A
6052481 Grajski et al. Apr 2000 A
6076088 Paik et al. Jun 2000 A
6122628 Castelli et al. Sep 2000 A
6128651 Cezar Oct 2000 A
6137911 Zhilyaev Oct 2000 A
6144767 Bottou et al. Nov 2000 A
6147636 Gershenson Nov 2000 A
6243375 Speicher Jun 2001 B1
6243713 Nelson et al. Jun 2001 B1
6275599 Adler et al. Aug 2001 B1
6329986 Cheng Dec 2001 B1
6381656 Shankman Apr 2002 B1
6411229 Kobayashi Jun 2002 B2
6422617 Fukumoto et al. Jul 2002 B1
6507672 Watkins et al. Jan 2003 B1
6523046 Liu et al. Feb 2003 B2
6524861 Anderson Feb 2003 B1
6550018 Abonamah et al. Apr 2003 B1
6594699 Sahai et al. Jul 2003 B1
6611628 Sekiguchi et al. Aug 2003 B1
6618711 Ananth Sep 2003 B1
6640015 Lafruit Oct 2003 B1
6643620 Contolini et al. Nov 2003 B1
6643643 Lee et al. Nov 2003 B1
6665657 Dibachi Dec 2003 B1
6704725 Lee Mar 2004 B1
6732149 Kephart May 2004 B1
6751363 Natsev et al. Jun 2004 B1
6751613 Lee et al. Jun 2004 B1
6754435 Kim Jun 2004 B2
6763069 Divakaran et al. Jul 2004 B1
6763519 McColl et al. Jul 2004 B1
6774917 Foote et al. Aug 2004 B1
6795818 Lee Sep 2004 B1
6804356 Krishnamachari Oct 2004 B1
6819797 Smith et al. Nov 2004 B1
6845374 Oliver et al. Jan 2005 B1
6901207 Watkins May 2005 B1
6938025 Lulich et al. Aug 2005 B1
7006689 Kasutani Feb 2006 B2
7013051 Sekiguchi et al. Mar 2006 B2
7020654 Najmi Mar 2006 B1
7043473 Rassool et al. May 2006 B1
7047033 Wyler May 2006 B2
7158681 Persiantsev Jan 2007 B2
7199798 Echigo et al. Apr 2007 B1
7215828 Luo May 2007 B2
7260564 Lynn et al. Aug 2007 B1
7277928 Lennon Oct 2007 B2
7302117 Sekiguchi et al. Nov 2007 B2
7313805 Rosin et al. Dec 2007 B1
7340458 Vaithilingam et al. Mar 2008 B2
7353224 Chen et al. Apr 2008 B2
7376672 Weare May 2008 B2
7376722 Sim et al. May 2008 B1
7433895 Li et al. Oct 2008 B2
7464086 Black et al. Dec 2008 B2
7519238 Robertson et al. Apr 2009 B2
7526607 Singh et al. Apr 2009 B1
7536417 Walsh et al. May 2009 B2
7574668 Nunez et al. Aug 2009 B2
7577656 Kawai et al. Aug 2009 B2
7657100 Gokturk et al. Feb 2010 B2
7660468 Gokturk et al. Feb 2010 B2
7660737 Lim et al. Feb 2010 B1
7689544 Koenig Mar 2010 B2
7694318 Eldering et al. Apr 2010 B2
7697791 Chan et al. Apr 2010 B1
7769221 Shakes et al. Aug 2010 B1
7788132 Desikan et al. Aug 2010 B2
7788247 Wang et al. Aug 2010 B2
7801893 Gulli Sep 2010 B2
7836054 Kawai et al. Nov 2010 B2
7860895 Scofield et al. Dec 2010 B1
7904503 De Mar 2011 B2
7920894 Wyler Apr 2011 B2
7921107 Chang et al. Apr 2011 B2
7933407 Keidar et al. Apr 2011 B2
7974994 Li et al. Jul 2011 B2
7987194 Walker et al. Jul 2011 B1
7987217 Long et al. Jul 2011 B2
7991715 Schiff et al. Aug 2011 B2
8000655 Wang et al. Aug 2011 B2
8036893 Reich Oct 2011 B2
8098934 Vincent et al. Jan 2012 B2
8112376 Raichelgauz et al. Feb 2012 B2
8266185 Raichelgauz et al. Sep 2012 B2
8275764 Jeon Sep 2012 B2
8312031 Raichelgauz et al. Nov 2012 B2
8315442 Gokturk et al. Nov 2012 B2
8316005 Moore Nov 2012 B2
8326775 Raichelgauz et al. Dec 2012 B2
8332478 Levy et al. Dec 2012 B2
8345982 Gokturk et al. Jan 2013 B2
RE44225 Aviv May 2013 E
8527978 Sallam Sep 2013 B1
8548828 Longmire Oct 2013 B1
8634980 Urmson Jan 2014 B1
8655801 Raichelgauz et al. Feb 2014 B2
8677377 Cheyer et al. Mar 2014 B2
8682667 Haughay Mar 2014 B2
8688446 Yanagihara Apr 2014 B2
8706503 Cheyer et al. Apr 2014 B2
8775442 Moore et al. Jul 2014 B2
8781152 Momeyer Jul 2014 B2
8782077 Rowley Jul 2014 B1
8799195 Raichelgauz et al. Aug 2014 B2
8799196 Raichelquaz et al. Aug 2014 B2
8818916 Raichelgauz et al. Aug 2014 B2
8868619 Raichelgauz et al. Oct 2014 B2
8880539 Raichelgauz et al. Nov 2014 B2
8880566 Raichelgauz et al. Nov 2014 B2
8886648 Procopio et al. Nov 2014 B1
8898568 Bull et al. Nov 2014 B2
8922414 Raichelgauz et al. Dec 2014 B2
8959037 Raichelgauz et al. Feb 2015 B2
8990125 Raichelgauz et al. Mar 2015 B2
9009086 Raichelgauz et al. Apr 2015 B2
9031999 Raichelgauz et al. May 2015 B2
9087049 Raichelgauz et al. Jul 2015 B2
9104747 Raichelgauz et al. Aug 2015 B2
9165406 Gray et al. Oct 2015 B1
9191626 Raichelgauz et al. Nov 2015 B2
9197244 Raichelgauz et al. Nov 2015 B2
9218606 Raichelgauz et al. Dec 2015 B2
9235557 Raichelgauz et al. Jan 2016 B2
9256668 Raichelgauz et al. Feb 2016 B2
9298763 Zack Mar 2016 B1
9323754 Ramanathan et al. Apr 2016 B2
9330189 Raichelgauz et al. May 2016 B2
9438270 Raichelgauz et al. Sep 2016 B2
9440647 Sucan Sep 2016 B1
9734533 Givot Aug 2017 B1
10133947 Yang Nov 2018 B2
10347122 Takenaka Jul 2019 B2
10491885 Hicks Nov 2019 B1
20010019633 Tenze et al. Sep 2001 A1
20010038876 Anderson Nov 2001 A1
20010056427 Yoon et al. Dec 2001 A1
20020010682 Johnson Jan 2002 A1
20020019881 Bokhari et al. Feb 2002 A1
20020019882 Bokhani Feb 2002 A1
20020037010 Yamauchi Mar 2002 A1
20020038299 Zernik et al. Mar 2002 A1
20020059580 Kalker et al. May 2002 A1
20020072935 Rowse et al. Jun 2002 A1
20020087530 Smith et al. Jul 2002 A1
20020099870 Miller et al. Jul 2002 A1
20020107827 Benitez-Jimenez et al. Aug 2002 A1
20020123928 Eldering et al. Sep 2002 A1
20020126872 Brunk et al. Sep 2002 A1
20020129140 Peled et al. Sep 2002 A1
20020129296 Kwiat et al. Sep 2002 A1
20020143976 Barker et al. Oct 2002 A1
20020147637 Kraft et al. Oct 2002 A1
20020152267 Lennon Oct 2002 A1
20020157116 Jasinschi Oct 2002 A1
20020159640 Vaithilingam et al. Oct 2002 A1
20020161739 Oh Oct 2002 A1
20020163532 Thomas et al. Nov 2002 A1
20020174095 Lulich et al. Nov 2002 A1
20020178410 Haitsma et al. Nov 2002 A1
20030028660 Igawa et al. Feb 2003 A1
20030037010 Schmelzer Feb 2003 A1
20030041047 Chang et al. Feb 2003 A1
20030050815 Seigel et al. Mar 2003 A1
20030078766 Appelt et al. Apr 2003 A1
20030086627 Berriss et al. May 2003 A1
20030089216 Birmingham et al. May 2003 A1
20030101150 Agnihotri May 2003 A1
20030105739 Essafi et al. Jun 2003 A1
20030126147 Essafi et al. Jul 2003 A1
20030182567 Barton et al. Sep 2003 A1
20030191764 Richards Oct 2003 A1
20030200217 Ackerman Oct 2003 A1
20030217335 Chung et al. Nov 2003 A1
20030229531 Heckerman et al. Dec 2003 A1
20040003394 Ramaswamy Jan 2004 A1
20040025180 Begeja et al. Feb 2004 A1
20040059736 Willse Mar 2004 A1
20040068510 Hayes et al. Apr 2004 A1
20040091111 Levy May 2004 A1
20040107181 Rodden Jun 2004 A1
20040111465 Chuang et al. Jun 2004 A1
20040117367 Smith et al. Jun 2004 A1
20040128142 Whitham Jul 2004 A1
20040128511 Sun et al. Jul 2004 A1
20040133927 Sternberg et al. Jul 2004 A1
20040153426 Nugent Aug 2004 A1
20040215663 Liu et al. Oct 2004 A1
20040230572 Omoigui Nov 2004 A1
20040249779 Nauck et al. Dec 2004 A1
20040260688 Gross Dec 2004 A1
20040267774 Lin et al. Dec 2004 A1
20050021394 Miedema et al. Jan 2005 A1
20050114198 Koningstein et al. May 2005 A1
20050131884 Gross et al. Jun 2005 A1
20050144455 Haitsma Jun 2005 A1
20050172130 Roberts Aug 2005 A1
20050177372 Wang et al. Aug 2005 A1
20050193015 Logston Sep 2005 A1
20050238238 Xu et al. Oct 2005 A1
20050245241 Durand et al. Nov 2005 A1
20050262428 Little et al. Nov 2005 A1
20050281439 Lange Dec 2005 A1
20050289163 Gordon et al. Dec 2005 A1
20050289590 Cheok et al. Dec 2005 A1
20060004745 Kuhn et al. Jan 2006 A1
20060013451 Haitsma Jan 2006 A1
20060020860 Tardif et al. Jan 2006 A1
20060020958 Allamanche et al. Jan 2006 A1
20060026203 Tan et al. Feb 2006 A1
20060031216 Semple et al. Feb 2006 A1
20060041596 Stirbu et al. Feb 2006 A1
20060048191 Xiong Mar 2006 A1
20060064037 Shalon et al. Mar 2006 A1
20060100987 Leurs May 2006 A1
20060112035 Cecchi et al. May 2006 A1
20060120626 Perlmutter Jun 2006 A1
20060129822 Snijder et al. Jun 2006 A1
20060143674 Jones et al. Jun 2006 A1
20060153296 Deng Jul 2006 A1
20060159442 Kim et al. Jul 2006 A1
20060173688 Whitham Aug 2006 A1
20060184638 Chua et al. Aug 2006 A1
20060204035 Guo et al. Sep 2006 A1
20060217818 Fujiwara Sep 2006 A1
20060217828 Hicken Sep 2006 A1
20060224529 Kermani Oct 2006 A1
20060236343 Chang Oct 2006 A1
20060242130 Sadri Oct 2006 A1
20060242139 Butterfield et al. Oct 2006 A1
20060242554 Gerace et al. Oct 2006 A1
20060247983 Dalli Nov 2006 A1
20060248558 Barton et al. Nov 2006 A1
20060251339 Gokturk Nov 2006 A1
20060253423 McLane et al. Nov 2006 A1
20070019864 Koyama et al. Jan 2007 A1
20070033163 Epstein et al. Feb 2007 A1
20070038614 Guha Feb 2007 A1
20070042757 Jung et al. Feb 2007 A1
20070061302 Ramer et al. Mar 2007 A1
20070067304 Ives Mar 2007 A1
20070067682 Fang Mar 2007 A1
20070071330 Oostveen et al. Mar 2007 A1
20070074147 Wold Mar 2007 A1
20070083611 Farago et al. Apr 2007 A1
20070091106 Moroney Apr 2007 A1
20070130159 Gulli et al. Jun 2007 A1
20070168413 Barletta et al. Jul 2007 A1
20070195987 Rhoads Aug 2007 A1
20070196013 Li Aug 2007 A1
20070220573 Chiussi et al. Sep 2007 A1
20070244902 Seide et al. Oct 2007 A1
20070253594 Lu et al. Nov 2007 A1
20070255785 Hayashi et al. Nov 2007 A1
20070294295 Finkelstein et al. Dec 2007 A1
20070298152 Baets Dec 2007 A1
20080019614 Robertson et al. Jan 2008 A1
20080040277 DeWitt Feb 2008 A1
20080046406 Seide et al. Feb 2008 A1
20080049629 Morrill Feb 2008 A1
20080072256 Boicey et al. Mar 2008 A1
20080091527 Silverbrook et al. Apr 2008 A1
20080109433 Rose May 2008 A1
20080152231 Gokturk Jun 2008 A1
20080163288 Ghosal et al. Jul 2008 A1
20080165861 Wen et al. Jul 2008 A1
20080166020 Kosaka Jul 2008 A1
20080201299 Lehikoinen et al. Aug 2008 A1
20080201314 Smith et al. Aug 2008 A1
20080204706 Magne et al. Aug 2008 A1
20080228995 Tan et al. Sep 2008 A1
20080237359 Silverbrook et al. Oct 2008 A1
20080253737 Kimura et al. Oct 2008 A1
20080263579 Mears et al. Oct 2008 A1
20080270373 Oostveen et al. Oct 2008 A1
20080270569 McBride Oct 2008 A1
20080294278 Borgeson Nov 2008 A1
20080313140 Pereira et al. Dec 2008 A1
20090013414 Washington et al. Jan 2009 A1
20090022472 Bronstein Jan 2009 A1
20090024641 Quigley et al. Jan 2009 A1
20090034791 Doretto Feb 2009 A1
20090043637 Eder Feb 2009 A1
20090043818 Raichelgauz Feb 2009 A1
20090080759 Bhaskar Mar 2009 A1
20090089587 Brunk et al. Apr 2009 A1
20090119157 Dulepet May 2009 A1
20090125529 Vydiswaran et al. May 2009 A1
20090125544 Brindley May 2009 A1
20090148045 Lee et al. Jun 2009 A1
20090157575 Schobben et al. Jun 2009 A1
20090172030 Schiff et al. Jul 2009 A1
20090175538 Bronstein et al. Jul 2009 A1
20090204511 Tsang Aug 2009 A1
20090216639 Kapczynski et al. Aug 2009 A1
20090216761 Raichelgauz Aug 2009 A1
20090245573 Saptharishi et al. Oct 2009 A1
20090245603 Koruga et al. Oct 2009 A1
20090253583 Yoganathan Oct 2009 A1
20090254824 Singh Oct 2009 A1
20090277322 Cai et al. Nov 2009 A1
20090278934 Ecker Nov 2009 A1
20100023400 DeWitt Jan 2010 A1
20100042646 Raichelqauz Feb 2010 A1
20100082684 Churchill Apr 2010 A1
20100088321 Solomon et al. Apr 2010 A1
20100104184 Bronstein et al. Apr 2010 A1
20100106857 Wyler Apr 2010 A1
20100111408 Matsuhira May 2010 A1
20100125569 Nair et al. May 2010 A1
20100162405 Cook et al. Jun 2010 A1
20100173269 Puri et al. Jul 2010 A1
20100191567 Lee et al. Jul 2010 A1
20100268524 Nath et al. Oct 2010 A1
20100306193 Pereira Dec 2010 A1
20100318493 Wessling Dec 2010 A1
20100322522 Wang et al. Dec 2010 A1
20110029620 Bonforte Feb 2011 A1
20110035289 King et al. Feb 2011 A1
20110038545 Bober Feb 2011 A1
20110052063 McAuley et al. Mar 2011 A1
20110055585 Lee Mar 2011 A1
20110106782 Ke et al. May 2011 A1
20110125727 Zou et al. May 2011 A1
20110145068 King et al. Jun 2011 A1
20110202848 Ismalon Aug 2011 A1
20110208822 Rathod Aug 2011 A1
20110246566 Kashef Oct 2011 A1
20110251896 Impollonia et al. Oct 2011 A1
20110313856 Cohen et al. Dec 2011 A1
20120082362 Diem et al. Apr 2012 A1
20120131454 Shah May 2012 A1
20120133497 Sasaki May 2012 A1
20120150890 Jeong et al. Jun 2012 A1
20120167133 Carroll et al. Jun 2012 A1
20120179751 Ahn Jul 2012 A1
20120185445 Borden et al. Jul 2012 A1
20120191686 Hjelm et al. Jul 2012 A1
20120197857 Huang et al. Aug 2012 A1
20120239694 Avner et al. Sep 2012 A1
20120299961 Ramkumar et al. Nov 2012 A1
20120330869 Durham Dec 2012 A1
20120331011 Raichelgauz et al. Dec 2012 A1
20130031489 Gubin et al. Jan 2013 A1
20130066856 Ong et al. Mar 2013 A1
20130067035 Amanat et al. Mar 2013 A1
20130067364 Berntson et al. Mar 2013 A1
20130086499 Dyor et al. Apr 2013 A1
20130089248 Remiszewski Apr 2013 A1
20130103814 Carrasco Apr 2013 A1
20130104251 Moore et al. Apr 2013 A1
20130159298 Mason et al. Jun 2013 A1
20130173635 Sanjeev Jul 2013 A1
20130212493 Krishnamurthy Aug 2013 A1
20130226820 Sedota, Jr. Aug 2013 A1
20130262588 Barak Oct 2013 A1
20130325550 Varghese et al. Dec 2013 A1
20130332951 Gharaat et al. Dec 2013 A1
20140019264 Wachman et al. Jan 2014 A1
20140025692 Pappas Jan 2014 A1
20140059443 Tabe Feb 2014 A1
20140095425 Sipple Apr 2014 A1
20140111647 Atsmon Apr 2014 A1
20140125703 Roveta May 2014 A1
20140147829 Jerauld May 2014 A1
20140152698 Kim et al. Jun 2014 A1
20140176604 Venkitaraman et al. Jun 2014 A1
20140188786 Raichelgauz et al. Jul 2014 A1
20140193077 Shiiyama et al. Jul 2014 A1
20140201330 Lozano Lopez Jul 2014 A1
20140250032 Huang et al. Sep 2014 A1
20140282655 Roberts Sep 2014 A1
20140300722 Garcia Oct 2014 A1
20140310825 Raichelgauz et al. Oct 2014 A1
20140317510 Ku Oct 2014 A1
20140330830 Raichelgauz et al. Nov 2014 A1
20140379477 Sheinfeld Dec 2014 A1
20150033150 Lee Jan 2015 A1
20150117784 Lin Apr 2015 A1
20150134688 Jing May 2015 A1
20150185827 Sayed Jul 2015 A1
20150242755 Gross Aug 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150289022 Gross Oct 2015 A1
20150304437 Vaccari Oct 2015 A1
20150363644 Wnuk Dec 2015 A1
20160007083 Gurha Jan 2016 A1
20160026707 Ong et al. Jan 2016 A1
20160210525 Yang Jul 2016 A1
20160221592 Puttagunta Aug 2016 A1
20160224871 Koren Aug 2016 A1
20160342683 Kwon Nov 2016 A1
20160357188 Ansari Dec 2016 A1
20170032257 Sharifi Feb 2017 A1
20170041254 Agara Venkatesha Rao Feb 2017 A1
20170109602 Kim Apr 2017 A1
20170255620 Raichelgauz Sep 2017 A1
20170262437 Raichelgauz Sep 2017 A1
20170323568 Inoue Nov 2017 A1
20180081368 Watanabe Mar 2018 A1
20180101177 Cohen Apr 2018 A1
20180115797 Wexler Apr 2018 A1
20180157916 Doumbouya Jun 2018 A1
20180158323 Takenaka Jun 2018 A1
20180184171 Danker Jun 2018 A1
20180204111 Zadeh Jul 2018 A1
20190005726 Nakano Jan 2019 A1
20190039627 Yamamoto Feb 2019 A1
20190043274 Hayakawa Feb 2019 A1
20190045244 Balakrishnan Feb 2019 A1
20190056718 Satou Feb 2019 A1
20190065951 Luo Feb 2019 A1
20190188501 Ryu Jun 2019 A1
20190220011 Della Penna Jul 2019 A1
20190317513 Zhang Oct 2019 A1
20190364492 Azizi Nov 2019 A1
20190384303 Muller Dec 2019 A1
20190384312 Herbach Dec 2019 A1
20190385460 Magzimof Dec 2019 A1
20190389459 Berntorp Dec 2019 A1
20200004248 Healey Jan 2020 A1
20200004251 Zhu Jan 2020 A1
20200004265 Zhu Jan 2020 A1
20200005631 Visintainer Jan 2020 A1
20200018606 Wolcott Jan 2020 A1
20200018618 Ozog Jan 2020 A1
20200020212 Song Jan 2020 A1
20200050973 Stenneth Feb 2020 A1
20200073977 Montemerlo Mar 2020 A1
20200090484 Chen Mar 2020 A1
20200097756 Hashimoto Mar 2020 A1
20200133307 Kelkar Apr 2020 A1
20200043326 Tao Jun 2020 A1
Foreign Referenced Citations (8)
Number Date Country
0231764 Apr 2002 WO
2003005242 Jan 2003 WO
2003067467 Aug 2003 WO
2004019527 Mar 2004 WO
2005027457 Mar 2005 WO
20070049282 May 2007 WO
2014137337 Sep 2014 WO
2016040376 Mar 2016 WO
Non-Patent Literature Citations (87)
Entry
Ma Et El. (“Semantics modeling based image retrieval system using neural networks” 2005 (Year: 2005).
Queluz, “Content-Based Integrity Protection of Digital Images”, SPIE Conf. on Security and Watermarking of Multimedia Contents, San Jose, Jan. 1999, pp. 85-93, downloaded from http://proceedings.spiedigitallibrary.org/ on Aug. 2, 2017.
Raichelgauz, I. et al.: “Co-evolutionary Learning in Liquid Architectures”, Lecture Notes in Computer Science, [Online] vol. 3512, Jun. 21, 2005 (Jun. 21, 2005), pp. 241-248, XP019010280 Springer Berlin / Heidelberg ISSN: 1611-3349 ISBN: 978-3-540-26208-1.
Ribert et al. “An Incremental Hierarchical Clustering”, Visicon Interface 1999, pp. 586-591.
Santos, et al., “SCORM-MPEG: an Ontology of Interoperable Metadata for Multimedia and e-Learning”, 2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM) Year: 2015, pp. 224-228, DOI: 10.1109/SOFTCOM.2015.7314122 IEEE Conference Publications.
Scheper et al, “Nonlinear dynamics in neural computation”, ESANN'2006 proceedings—European Symposium on Artificial Neural Networks, Bruges (Belgium), Apr. 26-28, 2006, d-side publi, ISBN 2-930307-06-4.
Schneider, et. al., “A Robust Content Based Digital Signature for Image Authentication”, Proc. ICIP 1996, Laussane, Switzerland, Oct. 1996, pp. 227-230.
Semizarov et al. “Specificity of Short Interfering RNA Determined through Gene Expression Signatures”, PNAS, 2003, pp. 6347-6352.
Shih-Fu Chang, et al., “VideoQ: A Fully Automated Video Retrieval System Using Motion Sketches”, 1998, IEEE, , New York, pp. 1-2.
The International Search Report and the Written Opinion for PCT/US2016/050471, ISA/RU, Moscow, RU, dated May 4, 2017.
The International Search Report and the Written Opinion for PCT/US2016/054634 dated Mar. 16, 2017, ISA/RU, Moscow, RU.
The International Search Report and the Written Opinion for PCT/US2017/015831, ISA/RU, Moscow, Russia, dated Apr. 20, 2017.
Theodoropoulos et al, “Simulating Asynchronous Architectures on Transputer Networks”, Proceedings of the Fourth Euromicro Workshop On Parallel and Distributed Processing, 1996. PDP '96.
Vailaya, et al., “Content-Based Hierarchical Classification of Vacation Images,” I.E.E.E.: Multimedia Computing and Systems, vol. 1, 1999, East Lansing, MI, pp. 518-523.
Vallet, et al., “Personalized Content Retrieval in Context Using Ontological Knowledge,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 17, No. 3, Mar. 2007, pp. 336-346.
Verstraeten et al., “Isolated word recognition with the Liquid State Machine: a case study”; Department of Electronics and Information Systems, Ghent University, Sint-Pietersnieuwstraat 41, 9000 Gent, Belgium, Available online Jul. 14, 2005; Entire Document.
Wang et al. “A Signature for Content-based Image Retrieval Using a Geometrical Transform”, ACM 1998, pp. 229-234.
Ware et al., “Locating and Identifying Components in a Robot's Workspace using a Hybrid Computer Architecture”; Proceedings of the 1995 IEEE International Symposium on Intelligent Control, Aug. 27-29, 1995, pp. 139-144.
Wei-Te Li et al., “Exploring Visual and Motion Saliency for Automatic Video Object Extraction”, IEEE, vol. 22, No. 7, Jul. 2013, pp. 1-11.
Whitby-Strevens, “The Transputer”, 1985 IEEE, Bristol, UK.
Wilk, et al., “The Potential of Social-Aware Multimedia Prefetching on Mobile Devices”, 2015 International Conference and Workshops on Networked Systems (NetSys) Year: 2015, pp. 1-5, DOI: 10.1109/NetSys.2015.7089081 IEEE Conference Publications.
Xian-Sheng Hua et al.: “Robust Video Signature Based on Ordinal Measure” In: 2004 International Conference on Image Processing, ICIP '04; Microsoft Research Asia, Beijing, China; published Oct. 24-27, 2004, pp. 685-688.
Yanagawa, et al., “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts.” Columbia University ADVENT technical report, 2007, pp. 222-2006-8.
Yanai, “Generic Image Classification Using Visual Knowledge on the Web,” MM'03, Nov. 2-8, 2003, Tokyo, Japan, pp. 167-176.
Zang, et al., “A New Multimedia Message Customizing Framework for Mobile Devices”, Multimedia and Expo, 2007 IEEE International Conference on Year: 2007, pp. 1043-1046, DOI: 10.1109/ICME.2007.4284832 IEEE Conference Publications.
Zeevi, Y. et al.: “Natural Signal Classification by Neural Cliques and Phase-Locked Attractors”, IEEE World Congress on Computational Intelligence, IJCNN2006, Vancouver, Canada, Jul. 2006 (Jul. 2006), XP002466252.
Zhou et al., “Ensembling neural networks: Many could be better than all”; National Laboratory for Novel Software Technology, Nanjing Unviersirty, Hankou Road 22, Nanjing 210093, PR China; Received Nov. 16, 2001, Available online Mar. 12, 2002; Entire Document.
Zhou et al., “Medical Diagnosis With C4.5 Rule Preceded by Artificial Neural Network Ensemble”; IEEE Transactions on Information Technology in Biomedicine, vol. 7, Issue: 1, pp. 37-42, Date of Publication: Mar. 2003.
Zhu et al., Technology-Assisted Dietary Assessment. Computational Imaging VI, edited by Charles A. Bouman, Eric L. Miller, Ilya Pollak, Proc. of SPIE-IS&T Electronic Imaging, SPIE vol. 6814, 681411, Copyright 2008 SPIE-IS&T. pp. 1-10.
Zou, et al., “A Content-Based Image Authentication System with Lossless Data Hiding”, ICME 2003, pp. 213-216.
Jasinschi et al., A Probabilistic Layered Framework for Integrating Multimedia Content and Context Information, 2002, IEEE, p. 2057-2060. (Year: 2002).
Jones et al., “Contextual Dynamics of Group-Based Sharing Decisions”, 2011, University of Bath, p. 1777-1786. (Year: 2011).
Iwamoto, “Image Signature Robust to Caption Superimpostion for Video Sequence Identification”, IEEE, pp. 3185-3188 (Year: 2006).
Cooperative Multi-Scale Convolutional Neural, Networks for Person Detection, Markus Eisenbach, Daniel Seichter, Tim Wengefeld, and Horst-Michael Gross Ilmenau University of Technology, Neuroinformatics and Cognitive Robotics Lab (Year; 2016).
Chen, Yixin, James Ze Wang, and Robert Krovetz. “CLUE: cluster-based retrieval of images by unsupervised learning.” IEEE transactions on Image Processing 14.8 (2005); 1187-1201. (Year: 2005).
Wusk et al (Non-Invasive detection of Respiration and Heart Rate with a Vehicle Seat Sensor; www.mdpi.com/journal/sensors; Published: May 8, 2018). (Year: 2018).
Chen, Tiffany Yu-Han, et al. “Glimpse: Continuous, real-time object recognition on mobile devices.” Proceedings of the 13th ACM Confrecene on Embedded Networked Sensor Systems. 2015. (Year: 2015).
Boari et al., “Adaptive Routing for Dynamic Applications in Massively Parallel Architectures”, 1995 IEEE, Spring 1995.
Brecheisen, et al., “Hierarchical Genre Classification for Large Music Collections”, ICME 2006, pp. 1385-1388.
Burgsteiner et al.: “Movement Prediction From Real-World Images Using a Liquid State Machine”, Innovations in Applied Artificial Intelligence Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence, LNCS, Springer-Verlag, BE, vol. 3533, Jun. 2005, pp. 121-130.
Cernansky et al., “Feed-forward Echo State Networks”; Proceedings of International Joint Conference on Neural Networks, Montreal, Canada, Jul. 31-Aug. 4, 2005; Entire Document.
Chuan-Yu Cho, et al., “Efficient Motion-Vector-Based Video Search Using Query by Clip”, 2004, IEEE, Taiwan, pp. 1-4.
Clement, et al. “Speaker Diarization of Heterogeneous Web Video Files: A Preliminary Study”, Acoustics, Speech and Signal Processing (ICASSP), 2011, IEEE International Conference on Year: 2011, pp. 4432-4435, DOI: 10.1109/ICASSP.2011.5947337 IEEE Conference Publications, France.
Cococcioni, et al, “Automatic Diagnosis of Defects of Rolling Element Bearings Based on Computational Intelligence Techniques”, University of Pisa, Pisa, Italy, 2009.
Emami, et al, “Role of Spatiotemporal Oriented Energy Features for Robust Visual Tracking in Video Surveillance, University of Queensland”, St. Lucia, Australia, 2012.
Fathy et al., “A Parallel Design and Implementation For Backpropagation Neural Network Using NIMD Architecture”, 8th Mediterranean Electrotechnical Corsfe rersce, 19'96. MELECON '96, Date of Conference: May 13-16, 1996, vol. 3, pp. 1472-1475.
Foote, Jonathan et al., “Content-Based Retrieval of Music and Audio”; 1997, Institute of Systems Science, National University of Singapore, Singapore (ABSTRACT).
Freisleben et al., “Recognition of Fractal Images Using a Neural Network”, Lecture Notes in Computer Science, 1993, vol. 6861, 1993, pp. 631-637.
Garcia, “Solving the Weighted Region Least Cost Path Problem Using Transputers”, Naval Postgraduate School, Monterey, California, Dec. 1989.
Gomes et al., “Audio Watermaking and Fingerprinting: For Which Applications?” University of Rene Descartes, Paris, France, 2003.
Gong, et al., “A Knowledge-based Mediator for Dynamic Integration of Heterogeneous Multimedia Information Sources”, Video and Speech Processing, 2004, Proceedings of 2004 International Symposium on Year: 2004, pp. 467-470, DOI: 10.1109/ISIMP.2004.1434102 IEEE Conference Publications, Hong Kong.
Guo et al, “AdOn: An Intelligent Overlay Video Advertising System”, SIGIR, Boston, Massachusetts, Jul. 19-23, 2009.
Howlett et al., “A Multi-Computer Neural Network Architecture in a Virtual Sensor System Application”, International Journal of Knowledge-based Intelligent Engineering Systems, 4 (2). pp. 86-93, 133N 1327-2314; first submitted Nov. 30, 1999; revised version submitted Mar. 10, 2000.
Hua, et al., “Robust Video Signature Based on Ordinal Measure”, Image Processing, 2004. 2004 International Conference on Image Processing (ICIP), vol. 1, IEEE, pp. 685-688, 2004.
Ihab Al Kabary, et al., “SportSense: Using Motion Queries to Find Scenes in Sports Videos”, Oct. 2013, ACM, Switzerland, pp. 1-3.
International Search Authority: “Written Opinion of the International Searching Authority” (PCT Rule 43bis.1) including International Search Report for International Patent Application No. PCT/US2008/073852; dated Jan. 28, 2009.
International Search Authority: International Preliminary Report on Patentability (Chapter I of the Patent Cooperation Treaty) including “Written Opinion of the International Searching Authority” (PCT Rule 43bis. 1) for the corresponding International Patent Application No. PCT/IL2006/001235; dated Jul. 28, 2009.
International Search Report for the corresponding International Patent Application PCT/IL2006/001235; dated Nov. 2, 2008.
IPO Examination Report under Section 18(3) for corresponding UK application No. GB1001219.3, dated May 30, 2012.
IPO Examination Report under Section 18(3) for corresponding UK application No. GB1001219.3, dated Sep. 12, 2011; Entire Document.
Iwamoto, K.; Kasutani, E.; Yamada, A.: “Image Signature Robust to Caption Superimposition for Video Sequence Identification”; 2006 IEEE International Conference on Image Processing; pp. 3185-3188, Oct. 8-11, 2006; doi: 10.1109/ICIP.2006.313046.
Jaeger, H.: “The “echo state” approach to analysing and training recurrent neural networks”, GMD Report, No. 148, 2001, pp. 1-43, XP002466251 German National Research Center for Information Technology.
Jianping Fan et al., “Concept-Oriented Indexing of Video Databases: Towards Semantic Sensitive Retrieval and Browsing”, IEEE, vol. 13, No. 7, Jul. 2004, pp. 1-19.
Johnson, John L., “Pulse-Coupled Neural Nets: Translation, Rotation, Scale, Distortion, and Intensity Signal Invariance for Images.” Applied Optics, vol. 33, No. 26, 1994, pp. 6239-6253.
Lau, et al., “Semantic Web Service Adaptation Model for a Pervasive Learning Scenario”, 2008 IEEE Conference on Innovative Technologies in Intelligent Systems and Industrial Applications Year: 2008, pp. 98-103, DOI: 10.1109/CITISIA.2008.4607342 IEEE Conference Publications.
Li, et al., “Matching Commercial Clips from TV Streams Using a Unique, Robust and Compact Signature,” Proceedings of the Digital Imaging Computing: Techniques and Applications, Feb. 2005, vol. 0-7695-2467, Australia.
Lin, C.; Chang, S.: “Generating Robust Digital Signature for Image/Video Authentication”, Multimedia and Security Workshop at ACM Mutlimedia '98; Bristol, U.K., Sep. 1998; pp. 49-54.
Lin, et al., “Robust Digital Signature for Multimedia Authentication: A Summary”, IEEE Circuits and Systems Magazine, 4th Quarter 2003, pp. 23-26.
Lin, et al., “Summarization of Large Scale Social Network Activity”, Acoustics, Speech and Signal Processing, 2009, ICASSP 2009, IEEE International Conference on Year 2009, pp. 3481-3484, DOI: 10.1109/ICASSP.2009.4960375, IEEE Conference Publications, Arizona.
Liu, et al., “Instant Mobile Video Search With Layered Audio-Video Indexing and Progressive Transmission”, Multimedia, IEEE Transactions on Year: 2014, vol. 16, Issue: 8, pp. 2242-2255, DOI: 10.1109/TMM.2014.2359332 IEEE Journals & Magazines.
Lyon, Richard F.; “Computational Models of Neural Auditory Processing”; IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP '84, Date of Conference: Mar. 1984, vol. 9, pp. 41-44.
Maass, W. et al.: “Computational Models for Generic Cortical Microcircuits”, Institute for Theoretical Computer Science, Technische Universitaet Graz, Graz, Austria, published Jun. 10, 2003.
Mahdhaoui, et al, “Emotional Speech Characterization Based on Multi-Features Fusion for Face-to-Face Interaction”, Universite Pierre et Marie Curie, Paris, France, 2009.
Marti, et al, “Real Time Speaker Localization and Detection System for Camera Steering in Multiparticipant Videoconferencing Environments”, Universidad Politecnica de Valencia, Spain, 2011.
May et al., “The Transputer”, Springer-Verlag, Berlin Heidelberg, 1989, teaches multiprocessing system.
McNamara, et al., “Diversity Decay in Opportunistic Content Sharing Systems”, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks Year: 2011, pp. 1-3, DOI: 10.1109/WoWMoM.2011.5986211 IEEE Conference Publications.
Mei, et al., “Contextual In-Image Advertising”, Microsoft Research Asia, pp. 439-448, 2008.
Mei, et al., “VideoSense—Towards Effective Online Video Advertising”, Microsoft Research Asia, pp. 1075-1084, 2007.
Mladenovic, et al., “Electronic Tour Guide for Android Mobile Platform with Multimedia Travel Book”, Telecommunications Forum (TELFOR), 2012 20th Year: 2012, pp. 1460-1463, DOI: 10.1109/TELFOR.2012.6419494 IEEE Conference Publications.
Morad, T.Y. et al.: “Performance, Power Efficiency and Scalability of Asymmetric Cluster Chip Multiprocessors”, Computer Architecture Letters, vol. 4, Jul. 4, 2005 (Jul. 4, 2005), pp. 1-4, XP002466254.
Nagy et al, “A Transputer, Based, Flexible, Real-Time Control System for Robotic Manipulators”, UKACC International Conference on CONTROL '96, Sep. 2-5, 1996, Conference 1996, Conference Publication No. 427, IEE 1996.
Nam, et al., “Audio Visual Content-Based Violent Scene Characterization”, Department of Electrical and Computer Engineering, Minneapolis, MN, 1998, pp. 353-357.
Natsclager, T. et al.: “The “liquid computer”: A novel strategy for real-time computing on time series”, Special Issue on Foundations of Information Processing of Telematik, vol. 8, No. 1, 2002, pp. 39-43, XP002466253.
Nouza, et al., “Large-scale Processing, Indexing and Search System for Czech Audio-Visual Heritage Archives”, Multimedia Signal Processing (MMSP), 2012, pp. 337-342, IEEE 14th Intl. Workshop, DOI: 10.1109/MMSP.2012.6343465, Czech Republic.
Odinaev, et al., “Cliques in Neural Ensembles as Perception Carriers”, Technion—Israel Institute of Technology, 2006 International Joint Conference on Neural Networks, Canada, 2006, pp. 285-292.
Ortiz-Boyer et al., “CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features”, Journal of Artificial Intelligence Research 24 (2005), pp. 1-48 Submitted Nov. 2004; published Jul. 2005.
Park, et al., “Compact Video Signatures for Near-Duplicate Detection on Mobile Devices”, Consumer Electronics (ISCE 2014), The 18th IEEE International Symposium on Year: 2014, pp. 1-2, DOI: 10.1109/ISCE.2014.6884293 IEEE Conference Publications.
Related Publications (1)
Number Date Country
20180137127 A1 May 2018 US
Provisional Applications (1)
Number Date Country
62424572 Nov 2016 US