System and method for recognizing characters in multimedia content

Information

  • Patent Grant
  • 10776585
  • Patent Number
    10,776,585
  • Date Filed
    Wednesday, March 4, 2015
    9 years ago
  • Date Issued
    Tuesday, September 15, 2020
    3 years ago
Abstract
A system and method for recognizing characters embedded in multimedia content are provided. The method includes extracting at least one image of at least one character from a received multimedia content item; identifying a natural language character corresponding to the at least one image of the at least one character, wherein the identification is performed by a deep content classification (DCC) system; and storing the identified natural language character in a data warehouse.
Description
TECHNICAL FIELD

The present disclosure relates generally to the analysis of multimedia content, and more specifically to recognizing natural language characters appearing in multimedia content items.


BACKGROUND

Identification of textual content embedded in multimedia content is a challenging problem with many practical applications. Currently available optical character recognition (OCR) systems are mainly used in order to recognize such textual content. However, such solutions are insufficient in cases where the input content is not properly scanned, captured or printed into an accurate computer-readable text.


In additional, prior art solutions may have difficulty recognizing textual content that is in an unexpected font type and/or a particularly small font size (e.g., smaller than 12 point font). Inability of such solutions to appropriately identify textual content may lead to data loss and/or decreased efficiency as a result of compensating for such data loss.


It would therefore be advantageous to provide a solution that would overcome the deficiencies of the prior art by recognizing natural language character in multimedia content.


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 embodiments. 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 recognizing characters embedded in multimedia content. The method comprises extracting at least one image of at least one character from a received multimedia content item; identifying a natural language character corresponding to the at least one image of the at least one character, wherein the identification is performed by a deep content classification (DCC) system; and storing the identified natural language character in a data warehouse.


Certain embodiments disclosed herein also include a system for recognizing characters embedded in multimedia content. The system comprises an interface to a network for receiving a multimedia content item; a processor; a memory connected to the processor, wherein the memory contains instructions that, when executed by the processor, configure the system to: extract at least one image of at least one character from the received multimedia content item; identify a natural language character corresponding to the at least one image of the at least one character, wherein the identification is performed by a deep content classification (DCC) system; and store the identified natural language character in a data warehouse.





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 a schematic block diagram of a network system utilized to describe the various embodiments disclosed herein.



FIG. 2 is a flowchart describing a method for recognizing natural language characters embedded in multimedia content according to one 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 illustrating a method returning a natural language character corresponding to an image according to 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 recognizing natural language characters embedded in multimedia content. The natural language characters may be, for example, one or more letters in a natural language, numbers, and so on. The multimedia content item in which the natural language characters are embedded is received, and at least an image of each character is extracted therefrom. At least one natural language character corresponding to the image of the character is identified, using for example, a deep content classification (DCC) system. The natural language character is then stored for further use.


According to one embodiment, a sequence of characters of a natural language embedded in multimedia content is compared to a library of words stored in a memory. In that embodiment, word in the natural language that compares positively with the sequence of characters of at least a natural language respective of the comparison results is stored in the memory for further use.



FIG. 1 shows an exemplary and non-limiting schematic diagram of a network system 100 utilized to describe the various embodiments disclosed herein. A network 110 is used to communicate between different parts of the network system 100. The network 110 may be the Internet, the world-wide-web (WWW), a local area network (LAN), a wide area network (WAN), a metro area network (MAN), and another network capable of enabling communication between the elements of the system 100.


Further connected to the network 110 is a user device 120 configured to execute at least one application 125. The application 125 may be, for example, a web browser, a script, or any other application configured to interact with a server 130. 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 laptop, a wearable computing device, or another kind of computing device equipped with browsing, viewing and managing capabilities that is enabled as further discussed herein below. It should be noted that only one user device 120 and one application 125 are illustrated in FIG. 1 merely for the sake of simplicity and without limitation on the generality of the disclosed embodiments. Additional user devices and/or applications may be utilized without departing from the scope of the disclosed embodiments.


The network system 100 also includes a data warehouse 160 configured to store at least one multimedia content item in which characters, natural language characters in a variety of natural languages, a plurality of words in natural languages, and the like may be embedded. In the embodiment illustrated in FIG. 1, the server 130 communicates with the data warehouse 160 through the network 110. In other non-limiting configurations, the server 130 may be directly connected to the data warehouse 160.


The various embodiments disclosed herein are realized using the server 130, a signature generator system (SGS) 140 that is communicatively connected to the server 130, and a deep-content-classification (DCC) system 150. The SGS 140 may be connected to the server 130 directly or through the network 110. The server 130 is configured to receive and serve at least one multimedia content item in which at least one character is embedded. The server 130 extracts at least one image of the at least one character from the multimedia content item.


The DCC system 150 is configured to identify at least one natural language character corresponding to the image of the at least one character. According to one embodiment, the identification comprises generation of concept structures (or concepts) and identification of concepts that correspond to the image of the at least one character. A concept is a collection of signatures representing a multimedia element and metadata describing the concept. The collection is a signature reduced cluster generated by inter-matching the signatures generated for the many multimedia elements, clustering the inter-matched signatures, and providing a reduced cluster set of such clusters. 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 including textual representations of the Superman concept.


Techniques for generating concepts and concept structures are described further in U.S. Pat. No. 8,266,185 (hereinafter the '185 Patent) to Raichelgauz, et al., which is assigned to a common assignee, and is hereby incorporated by reference for all that it contains. In an embodiment, the DCC system 150 is configured to operate as the DCC system discussed in the '185 patent. The process of generating the signatures in the SGS 140 is explained in more detail herein below with respect to FIGS. 3 and 4.


In certain configurations, the DCC system 150 and SGS 140 may be embedded in the server 130. It should be noted that each of the server 130, the SGS 140, and the DCC system 150 typically comprises a processing unit. The memory contains instructions that can be executed by the processor. The server 130 also includes an interface (not shown) to the network 110.


In one embodiment, the processing unit may be realized through architecture of computational cores as described in further detail herein below. In another embodiment, the processing unit may comprise, or be a component of, a larger processing unit implemented with one or more processors. The one or more processors may be implemented with any combination of general-purpose microprocessors, microcontrollers, digital signal processors (DSPs), field programmable gate array (FPGAs), programmable logic devices (PLDs), controllers, state machines, gated logic, discrete hardware components, dedicated hardware finite state machines, or any other suitable entities that can perform calculations or other manipulations of information.


The processing unit may also include machine-readable media for storing 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 processing unit, cause the processing unit to perform the various functions described herein.


According to the disclosed embodiments, the server 130 is configured to receive a multimedia content item in which at least one character is embedded from the user device 120. The multimedia content item may be, but is not limited to, an image, a graphic, a video stream, a video clip, a video frame, a photograph, and/or combinations thereof and portions thereof. In one embodiment, the server 130 receives a URL of a web-page viewed by the user device 120 and accessed by the application 125. The web-page is processed to extract the multimedia content item contained therein. The request to analyze the multimedia content item can be sent by a script executed in the web-page such as the application 125 (e.g., a web server or a publisher server) when requested to upload one or more multimedia content items to the web-page. Such a request may include a URL of the web-page or a copy of the web-page. The application 125 can also send a picture or a video clip taken by a user of the user device 120 to the server 130.


The server 130, in response to receiving the multimedia content item, is configured to extract at least one image of the at least one character. The server 130 identifies at least one natural language character corresponding to the least one image. The at least one natural language character is stored in a data warehouse 160 for further use. According to one embodiment, the at least one corresponding natural language character is provided to the user device 120 by the server 130. According to yet another embodiment, the server 130 is further configured to compare a sequence of characters of at least a natural language embedded in a multimedia content item to a library of words stored in the data warehouse 160. The word(s) in the natural language that positively compares with the sequence of characters of at least a natural language respective of the comparison results is then stored in the data warehouse 160 for further use.


As a non-limiting example, when the server 130 receives a multimedia content item in which the sequence of characters: m, o, r, n, i, n and g, are embedded, an image of the sequence is extracted by the server 130. Then, the sequence is compared to a plurality of words stored in the data warehouse 160. The word “morning” in English is determined as positive comparing to the sequence of characters. The comparison results are then stored in the data warehouse 160 for further use.



FIG. 2 depicts an exemplary and non-limiting flowchart 200 describing a method for recognizing natural language characters embedded in multimedia content items according to an embodiment. In an embodiment, the method may be performed by the server 130.


In S210, a multimedia content item in which at least one character is embedded is received. In an embodiment, the multimedia content item is received together with a request to identify the character(s) embedded in the multimedia content item. The multimedia content item may be, but is not limited to, an image, a graphic, a video stream, a video clip, a video frame, a photograph, a combination thereof, and a portion thereof.


In S220, at least one image of the at least one character is extracted from the at least one multimedia content item. The at least one multimedia content item may contain multiple sets of at least one character (e.g., multiple words, multiple sentences, multiple paragraphs, multiple phrases, portions thereof, and so on), each of which may be represented by an image. In an embodiment, each image of the at least one multimedia content item may be extracted based on an extraction order. The extraction order may be, e.g., left to right, right to left, top to bottom, bottom to top, paragraphs before sentences, sentences before phrases, phrases before words, combinations thereof, and so on.


In S230, at least one signature for the extracted at least one image is generated to the at least one character. The signatures are generated by the SGS 140 as described in greater detail herein below with respect to FIGS. 3 and 4.


In S240, at least a natural language character corresponding to the extracted image of the at least one character is identified. In an embodiment, a DCC system (e.g., the DCC system 150) may be queried respective of the desired identification. In such an embodiment, the DCC system returns at least a natural language character corresponding to the extracted image and the returned at least a natural language character is identified as corresponding to the extracted image. According to an embodiment, the identification is made through a data warehouse (e.g., the data warehouse 160). According to another embodiment, the identification is made through one or more data sources accessible over a network (e.g., the network 110).


According to one embodiment, returning at least a natural language character corresponding to the extracted image further includes generating concept structures (or concepts) and identifying concepts that correspond to the image of the at least one character. Techniques for generating concepts and concept structures are described further in the '185 Patent referenced above. Returning a natural language character corresponding to an image is described further herein below with respect to FIG. 5.


In S250, the at least one natural language character corresponding to the extracted image is stored. In an embodiment, the at least one natural language character is stored in a data warehouse (e.g., the data warehouse 160). In S260, it is checked whether additional multimedia content items have been received and, if so, execution continues with S210; otherwise, execution terminates.



FIGS. 3 and 4 illustrate the generation of signatures for multimedia content items according to one embodiment. An exemplary high-level description of the process for large scale matching is depicted in FIG. 3. In this example, the matching is conducted based on 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 generation of computational Cores 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 dynamics in-between the frames.


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 130 and SGS 140. 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, custom character 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 T (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 than 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 I 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 for comparison to the original data. A detailed description of the Signature generation can be found in U.S. Pat. Nos. 8,326,775 and 8,312,031, both assigned to common assignee, which are hereby incorporated by reference for all the useful information they contain.


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 its 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.



FIG. 5 is an exemplary and non-limiting flowchart 500 illustrating returning a natural language character corresponding to an image according to an embodiment. In an embodiment, the steps of flowchart 500 may be performed by a deep content classification (DCC) system (e.g., the DCC system 150).


In S510, a request to return at least a natural language character corresponding to an image is received. In a typical embodiment, the request may further include the image and a signature that was generated based on the image. In an alternative embodiment, the image and a signature generated based on the image may be found. The image may be found in, but is not limited to, a data warehouse (e.g., the data warehouse 160), one or more data sources accessible over a network (e.g., the network 110), and so on.


In S520, a concept structure corresponding to the image is identified. The concept structure may be identified as corresponding to the image if, e.g., matching between the signature of the image and each concept signature of at least one multimedia content item within a concept structure is above a predefined threshold. In an embodiment, if no existing concept structure matches the signature of the image, a new concept structure may be generated respective thereof.


A concept is a collection of signatures representing a multimedia element and metadata describing the concept. The collection is a signature reduced cluster generated by inter-matching the signatures generated for the many multimedia elements, clustering the inter-matched signatures, and providing a reduced cluster set of such clusters. 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 including textual representations of the Superman concept.


In S530, a natural language word associated with the identified concept structure is determined. In an embodiment, the associations between concept structures and natural language words may be stored in, but not limited to, a data warehouse (e.g., the data warehouse 160).


In S540, the determined natural language word is compared to the image to determine if there is a match and, if so, execution continues with S550; otherwise, execution continues with S530. A match may be determined if, e.g., a signature of the determined natural language word matches a signature of the image above a predefined threshold. In a typical embodiment, the threshold for determining if a signature of the determined natural language word matches the signature of the image is higher than the threshold for determining if multimedia content items of a concept structure match the signature of the image. Signatures and signature matching are described further herein above with respect to FIGS. 3 and 4.


In S550, the matching natural language word is returned. In an embodiment, if no natural language words match, an error message may be returned.


As a non-limiting example, a request to return at least a natural language character corresponding to an image is received, wherein the image includes the word “motorcycle.” The request includes the image and a signature generated respective of the image. The signature is matched to at least one signature of a multimedia content item associated with a concept structure, wherein the concept structure is “motor vehicles.” Based on the signature matching with the concept structure, it is determined that the “motor vehicles” concept structure corresponds to the image of the word “motorcycle” because the signatures match above a 50% matching threshold.


The signature of the image is compared to signatures of natural language words associated with the concept structure until a match is found. A signature of the natural word “motorcycle” is determined to match the signature of the image containing the word “motorcycle” because the signatures match above a 90% matching threshold. Thus, it is determined that the natural language word “motorcycle” represents the at least a character in the image. The natural language word “motorcycle” is returned.


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, embodiments, 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 recognizing characters embedded in multimedia content, comprising: extracting at least one image of at least one character from a received multimedia content item;identifying a natural language character corresponding to the at least one image of the at least one character, wherein the identification is performed by a deep content classification (DCC) system;comparing a first signature of a first image of at least one first natural language character to at least one second signature of at least one second multimedia content item within a concept structure, a matching concept structure being identified if matching between the first signature of the first image and the at least one second signature of the at least one second multimedia content item within the concept structure is above a first threshold;comparing the first signature of the first image to a plurality of signatures of a plurality of natural language words associated with the matching concept structure until a match is found above a second threshold yielding a matching natural language word of the plurality of natural words;wherein the second threshold exceeds the first threshold; andstoring the identified natural language character in a data warehouse.
  • 2. The method of claim 1, further comprising: comparing a sequence of the natural language character to a library of natural language words;detecting a natural language word in the library of natural language words that matches the sequence of natural language characters; andstoring the detected natural language word in the data warehouse.
  • 3. The method of claim 1, wherein the multimedia content item is received from a user device.
  • 4. The method of claim 3, further comprising: sending the natural language character to the user device.
  • 5. The method of claim 1, wherein the at least one multimedia content item is any one of: an image, a graphic, a video stream, a video clip, a video frame, and a photograph.
  • 6. The method of claim 1, further comprising: generating at least one signature respective of the at least one character; andquerying the DCC system using the at least on generated signature to identify the natural language character corresponding to the image of the at least one character.
  • 7. The method of claim 6, further comprising: identifying a concept structure corresponding to the image based on the at least one signature, wherein the identified natural language character is associated with the identified concept structure.
  • 8. The method of claim 1, wherein each image of the extracted at least one image is extracted based on an extraction order.
  • 9. The method of claim 1, wherein the extraction order is at least any of: left to right, right to left, top to bottom, bottom to top, paragraphs before sentences, sentences before phrases, and phrases before words.
  • 10. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1.
  • 11. A system for recognizing characters embedded in multimedia content, comprising: an interface to a network for receiving a multimedia content item;a processor;a memory connected to the processor,wherein the memory contains instructions that, when executed by the processor, configure the system to: extract at least one image of at least one character from the received multimedia content item;identify a natural language character corresponding to the at least one image of the at least one character, wherein the identification is performed by a deep content classification (DCC) system;compare a first signature of a first image of at least one first natural language character to at least one second signature of at least one second multimedia content item within a concept structure, a matching concept structure being identified if matching between the first signature of the first image and the at least one second signature of the at least one second multimedia content item within the concept structure is above a first threshold;compare the first signature of the first image to a plurality of signatures of a plurality of natural language words associated with the matching concept structure until a match is found above a second threshold yielding a matching natural language word of the plurality of natural words; wherein the second threshold exceeds the first threshold;and store the identified natural language character in a data warehouse.
  • 12. The system of claim 11, wherein the system is further configured to: compare a sequence of the at least a natural language character to a library of natural language words; detect a natural language word in the library of natural language words that matches the sequence of natural language characters; and store the detected natural language word in the data warehouse.
  • 13. The system of claim 11, wherein the multimedia content item is received from a user device.
  • 14. The system of claim 13, wherein the system is further configured to: send the natural language character to the user device.
  • 15. The system of claim 11, wherein the at least one multimedia content item is any one of: an image, a graphic, a video stream, a video clip, a video frame, and a photograph.
  • 16. The system of claim 11, wherein the system is further configured to: generate at least one signature respective of the at least one character; and querying the DCC system using the at least on generated signature to identify the natural language character corresponding to the image of the at least one character.
  • 17. The system of claim 16, wherein the system is further configured to: identify a concept structure corresponding to the image based on the at least one signature, wherein the identified natural language character is associated with the identified concept structure.
  • 18. The system of claim 11, wherein each image of the extracted at least one image is extracted based on an extraction order.
  • 19. The system of claim 11, wherein the extraction order is at least any one of: left to right, right to left, top to bottom, bottom to top, paragraphs before sentences, sentences before phrases, and phrases before words.
  • 20. The method according to claim 1 wherein the first signature represents a response of leaky integrate-to-threshold unit nodes to the first image.
  • 21. The method according to claim 1 comprising generating the first signature by a plurality of mutually independent computational cores.
  • 22. The method according to claim 1 wherein the concept structure comprises signatures of objects of different type that share a property.
  • 23. The method according to claim 1 wherein the concept structure comprises signature reduced cluster.
  • 24. The method according to claim 1 wherein the concept structure comprises signatures of different types of motor vehicles.
Priority Claims (3)
Number Date Country Kind
171577 Oct 2005 IL national
173409 Jan 2006 IL national
185414 Aug 2007 IL national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 61/948,050 filed on Mar. 5, 2014. This application is a continuation-in-part (CIP) of U.S. patent application Ser. No. 14/096,865 filed on Dec. 4, 2013, now pending, which claims the benefit of U.S. Provisional Patent Application No. 61/890,251 filed on Oct. 13, 2013. The Ser. No. 14/096,865 application is a CIP of U.S. patent application Ser. No. 13/624,397 filed on Sep. 21, 2012, now pending. 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 (393)
Number Name Date Kind
4733353 Jaswa Mar 1988 A
4932645 Schorey et al. Jun 1990 A
4972363 Nguyen et al. Nov 1990 A
5214746 Fogel et al. May 1993 A
5307451 Clark Apr 1994 A
5412564 Ecer May 1995 A
5436653 Ellis et al. Jul 1995 A
5568181 Greenwood et al. Oct 1996 A
5638425 Meador et al. Jun 1997 A
5745678 Herzberg et al. Apr 1998 A
5763069 Jordan Jun 1998 A
5806061 Chaudhuri et al. Sep 1998 A
5835901 Duvoisin et al. Nov 1998 A
5852435 Vigneaux et al. Dec 1998 A
5864855 Ruocco Jan 1999 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
5991306 Burns et al. Nov 1999 A
6052481 Grajski et al. Apr 2000 A
6070167 Qian et al. May 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
6163510 Lee et al. Dec 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
6557042 He et al. Apr 2003 B1
6594699 Sahai et al. Jul 2003 B1
6601026 Appelt Jul 2003 B2
6611628 Sekiguchi et al. Aug 2003 B1
6618711 Ananth Sep 2003 B1
6643620 Contolini et al. Nov 2003 B1
6643643 Lee et al. Nov 2003 B1
6665657 Dibachi Dec 2003 B1
6681032 Bortolussi et al. Jan 2004 B2
6704725 Lee Mar 2004 B1
6732149 Kephart May 2004 B1
6742094 Igari May 2004 B2
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
6813395 Kinjo Nov 2004 B1
6819797 Smith et al. Nov 2004 B1
6845374 Oliver et al. Jan 2005 B1
6877134 Fuller et al. Apr 2005 B1
6901207 Watkins May 2005 B1
6938025 Lulich et al. Aug 2005 B1
6985172 Rigney et al. Jan 2006 B1
7006689 Kasutani Feb 2006 B2
7013051 Sekiguchi et al. Mar 2006 B2
7020654 Najmi Mar 2006 B1
7023979 Wu et al. Apr 2006 B1
7043473 Rassool et al. May 2006 B1
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
7299261 Oliver et al. Nov 2007 B1
7302117 Sekiguchi et al. Nov 2007 B2
7313805 Rosin et al. Dec 2007 B1
7340358 Yoneyama Mar 2008 B2
7353224 Chen et al. Apr 2008 B2
7376672 Weare May 2008 B2
7433895 Li et al. Oct 2008 B2
7464086 Black et al. Dec 2008 B2
7529659 Wold May 2009 B2
7577656 Kawai et al. Aug 2009 B2
7657100 Gokturk et al. Feb 2010 B2
7660468 Gokturk et al. Feb 2010 B2
7694318 Eldering et al. Apr 2010 B2
7836054 Kawai et al. Nov 2010 B2
7860895 Scofield Dec 2010 B1
7933407 Keidar et al. Apr 2011 B2
7987217 Long et al. Jul 2011 B2
8023739 Hohimer et al. Sep 2011 B2
8036893 Reich Oct 2011 B2
8098934 Vincent Jan 2012 B2
8112376 Raichelgauz et al. Feb 2012 B2
8266185 Raichelgauz et al. Sep 2012 B2
8312031 Raichelgauz et al. Nov 2012 B2
8315442 Gokturk et al. Nov 2012 B2
8326775 Raichelgauz et al. Dec 2012 B2
8345982 Gokturk et al. Jan 2013 B2
8457827 Ferguson et al. Jun 2013 B1
8495489 Everingham Jul 2013 B1
8548828 Longmire Oct 2013 B1
8635531 Graham et al. Jan 2014 B2
8655801 Raichelgauz et al. Feb 2014 B2
8655878 Kulkarni et al. Feb 2014 B1
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
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
8868861 Shimizu 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
8990199 Ramesh et al. Mar 2015 B1
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
9323754 Ramanathan et al. Apr 2016 B2
9330189 Raichelgauz et al. May 2016 B2
9384196 Raichelgauz et al. Jul 2016 B2
9438270 Raichelgauz et al. Sep 2016 B2
9466068 Raichelgauz et al. Oct 2016 B2
9646006 Raichelgauz et al. May 2017 B2
9679062 Schillings et al. Jun 2017 B2
9807442 Bhatia et al. Oct 2017 B2
9875445 Amer et al. Jan 2018 B2
9984369 Li et al. May 2018 B2
20010019633 Tenze Sep 2001 A1
20010038876 Anderson Nov 2001 A1
20010056427 Yoon et al. Dec 2001 A1
20020010682 Johnson Jan 2002 A1
20020010715 Chinn et al. Jan 2002 A1
20020019881 Bokhari et al. Feb 2002 A1
20020019882 Soejima et al. Feb 2002 A1
20020032677 Morgenthaler et al. Mar 2002 A1
20020037010 Yamauchi Mar 2002 A1
20020038299 Zernik et al. Mar 2002 A1
20020042914 Walker et al. Apr 2002 A1
20020059069 Hsu May 2002 A1
20020059580 Kalker et al. May 2002 A1
20020072935 Rowse et al. Jun 2002 A1
20020083468 Dudkiewicz Jun 2002 A1
20020087530 Smith et al. Jul 2002 A1
20020087828 Arimilli et al. Jul 2002 A1
20020099870 Miller et al. Jul 2002 A1
20020107827 Benitez-Jimenez et al. Aug 2002 A1
20020113812 Walker et al. Aug 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 Nov 2002 A1
20020174095 Lulich et al. Nov 2002 A1
20020178410 Haitsma et al. Nov 2002 A1
20020184505 Mihcak et al. Dec 2002 A1
20030005432 Ellis et al. Jan 2003 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
20030093790 Logan et al. May 2003 A1
20030101150 Agnihotri May 2003 A1
20030105739 Essafi et al. Jun 2003 A1
20030115191 Copperman et al. Jun 2003 A1
20030126147 Essafi et al. Jul 2003 A1
20030182567 Barton et al. Sep 2003 A1
20030184598 Graham 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
20040068510 Hayes et al. Apr 2004 A1
20040095376 Graham et al. May 2004 A1
20040098671 Graham et al. May 2004 A1
20040107181 Rodden Jun 2004 A1
20040111432 Adams et al. Jun 2004 A1
20040111465 Chuang et al. Jun 2004 A1
20040117367 Smith et al. Jun 2004 A1
20040117638 Monroe 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
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
20050163375 Grady Jul 2005 A1
20050172130 Roberts Aug 2005 A1
20050177372 Wang et al. Aug 2005 A1
20050238198 Brown et al. Oct 2005 A1
20050238238 Xu et al. Oct 2005 A1
20050245241 Durand et al. Nov 2005 A1
20050249398 Khamene et al. Nov 2005 A1
20050256820 Dugan 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
20060033163 Chen Feb 2006 A1
20060041596 Stirbu et al. Feb 2006 A1
20060048191 Xiong Mar 2006 A1
20060064037 Shalon et al. Mar 2006 A1
20060112035 Cecchi et al. May 2006 A1
20060129822 Snijder et al. Jun 2006 A1
20060143674 Jones et al. Jun 2006 A1
20060159442 Kim et al. Jul 2006 A1
20060173688 Whitham Aug 2006 A1
20060184638 Chua et al. Aug 2006 A1
20060217818 Fujiwara Sep 2006 A1
20060217828 Hicken Sep 2006 A1
20060218191 Gopalakrishnan 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
20060247983 Dalli Nov 2006 A1
20060248558 Barton Nov 2006 A1
20060253423 McLane et al. Nov 2006 A1
20060288002 Epstein et al. Dec 2006 A1
20070019864 Koyama et al. Jan 2007 A1
20070022374 Huang 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
20070156720 Maren Jul 2007 A1
20070168413 Barletta et al. Jul 2007 A1
20070244902 Seide et al. Oct 2007 A1
20070253594 Lu et al. Nov 2007 A1
20070255785 Hayashi et al. Nov 2007 A1
20070298152 Baets Dec 2007 A1
20080013838 Lane Jan 2008 A1
20080046406 Seide et al. Feb 2008 A1
20080049789 Vedantham et al. Feb 2008 A1
20080072256 Boicey et al. Mar 2008 A1
20080079729 Brailovsky Apr 2008 A1
20080091527 Silverbrook et al. Apr 2008 A1
20080152231 Gokturk et al. Jun 2008 A1
20080159622 Agnihotri et al. Jul 2008 A1
20080165861 Wen Jul 2008 A1
20080201299 Lehikoinen et al. Aug 2008 A1
20080201314 Smith et al. Aug 2008 A1
20080201361 Castro et al. Aug 2008 A1
20080228995 Tan et al. Sep 2008 A1
20080237359 Silverbrook et al. Oct 2008 A1
20080253737 Kimura Oct 2008 A1
20080263579 Mears et al. Oct 2008 A1
20080270373 Dostveen et al. Oct 2008 A1
20080307454 Ahanger et al. Dec 2008 A1
20080313140 Pereira et al. Dec 2008 A1
20090013414 Washington et al. Jan 2009 A1
20090022472 Bronstein et al. Jan 2009 A1
20090024641 Quigley et al. Jan 2009 A1
20090043637 Eder Feb 2009 A1
20090043818 Raichelgauz et al. Feb 2009 A1
20090125544 Brindley May 2009 A1
20090157575 Schobben et al. Jun 2009 A1
20090172030 Schiff et al. Jul 2009 A1
20090175538 Bronstein et al. Jul 2009 A1
20090208106 Dunlop et al. Aug 2009 A1
20090216761 Raichelgauz et al. Aug 2009 A1
20090245573 Saptharishi et al. Oct 2009 A1
20090254572 Redlich et al. Oct 2009 A1
20090277322 Cai et al. Nov 2009 A1
20090282218 Raichelgauz et al. Nov 2009 A1
20090297048 Slotine et al. Dec 2009 A1
20100042646 Raichelgauz et al. Feb 2010 A1
20100082684 Churchill et al. Apr 2010 A1
20100104184 Bronstein Apr 2010 A1
20100125569 Nair May 2010 A1
20100162405 Cook Jun 2010 A1
20100173269 Puri et al. Jul 2010 A1
20100198626 Cho et al. Aug 2010 A1
20100212015 Jin et al. Aug 2010 A1
20100268524 Nath et al. Oct 2010 A1
20100284604 Chrysanthakopoulos Nov 2010 A1
20100306193 Pereira et al. Dec 2010 A1
20100312736 Kello Dec 2010 A1
20100318493 Wessling Dec 2010 A1
20100325138 Lee et al. Dec 2010 A1
20100325581 Finkelstein et al. Dec 2010 A1
20110052063 McAuley et al. Mar 2011 A1
20110055585 Lee Mar 2011 A1
20110164180 Lee Jul 2011 A1
20110164810 Zang et al. Jul 2011 A1
20110218946 Stern et al. Sep 2011 A1
20110246566 Kashef et al. Oct 2011 A1
20110251896 Impollonia et al. Oct 2011 A1
20110276680 Rimon Nov 2011 A1
20110296315 Lin et al. Dec 2011 A1
20110313856 Cohen et al. Dec 2011 A1
20120082362 Diem et al. Apr 2012 A1
20120131454 Shah May 2012 A1
20120150890 Jeong et al. Jun 2012 A1
20120167133 Carroll Jun 2012 A1
20120179642 Sweeney et al. Jul 2012 A1
20120185445 Borden et al. Jul 2012 A1
20120197857 Huang Aug 2012 A1
20120221470 Lyon Aug 2012 A1
20120227074 Hill et al. Sep 2012 A1
20120239690 Asikainen et al. Sep 2012 A1
20120239694 Avner et al. Sep 2012 A1
20120299961 Ramkumar et al. Nov 2012 A1
20120301105 Rehg et al. Nov 2012 A1
20090220138 Zhang et al. Dec 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
20130080433 Raichelgauz et al. Mar 2013 A1
20130086499 Dyor et al. Apr 2013 A1
20130089248 Remiszewski Apr 2013 A1
20130104251 Moore et al. Apr 2013 A1
20130159298 Mason et al. Jun 2013 A1
20130173635 Sanjeev Jul 2013 A1
20130226930 Amgren et al. Aug 2013 A1
20130283401 Pabla et al. Oct 2013 A1
20130332951 Gharaat et al. Dec 2013 A1
20140025692 Pappas Jan 2014 A1
20140125703 Roveta May 2014 A1
20140147829 Jerauld May 2014 A1
20140152698 Kim et al. Jun 2014 A1
20140169681 Drake Jun 2014 A1
20140176604 Venkitaraman et al. Jun 2014 A1
20140188786 Raichelgauz et al. Jul 2014 A1
20140193077 Shiiyama et al. 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
20140330830 Raichelgauz et al. Nov 2014 A1
20140341476 Kulick et al. Nov 2014 A1
20150100562 Kohlmeier et al. Apr 2015 A1
20150120627 Hunzinger et al. Apr 2015 A1
20150154189 Raichelgauz et al. Jun 2015 A1
20150254344 Kulkarni et al. Sep 2015 A1
20150286742 Zhang et al. Oct 2015 A1
20150289022 Gross Oct 2015 A1
20150324356 Gutierrez et al. Nov 2015 A1
20160007083 Gurha Jan 2016 A1
20160026707 Ong et al. Jan 2016 A1
20160239566 Raichelgauz et al. Aug 2016 A1
20160306798 Guo et al. Oct 2016 A1
20170017638 Satyavarta et al. Jan 2017 A1
20170154241 Shambik et al. Jun 2017 A1
Foreign Referenced Citations (11)
Number Date Country
1085464 Jan 2007 EP
0231764 Apr 2002 WO
2003005242 Jan 2003 WO
2003067467 Aug 2003 WO
2004019527 Mar 2004 WO
2005027457 Mar 2005 WO
2007049282 May 2007 WO
2014076002 May 2014 WO
2014137337 Sep 2014 WO
2016040376 Mar 2016 WO
2016070193 May 2016 WO
Non-Patent Literature Citations (100)
Entry
Srihari, Rohini K., Zhongfei Zhang, and Aibing Rao. “Intelligent indexing and semantic retrieval of multimodal documents.” Information Retrieval 2.2-3 (2000): 245-275.
Rui, Yong, et al. “Relevance feedback: a power tool for interactive content-based image retrieval.” IEEE Transactions on circuits and systems for video technology 8.5 (1998): 644-655.
Srihari, Rohini K. “Automatic indexing and content-based retrieval of captioned images.” Computer 9 (1995): 49-56.
Veltkamp, Remco C., Mirela Tanase, and Danielle Sent. “Features in content-based image retrieval systems: a survey.” State-of-the-art in content-based image and video retrieval. Springer, Dordrecht, 2001. 97-124. (Year: 2001).
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.
The International Search Report and the Written Opinion for PCT/US2016/054634 dated Mar. 16, 2017, ISA/RU, Moscow, RU.
Yanagawa, et al., “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts.” Columbia University ADVENT technical report, 2007, pp. 222-2006-8.
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.
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.
Schneider, et. al., “A Robust Content Based Digital Signature for Image Authentication”, Proc. ICIP 1996, Laussane, Switzerland, Oct. 1996, pp. 227-230.
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/US2017/015831, ISA/RU, Moscow, Russia, dated Apr. 20, 2017.
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.
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.
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.
Wang et al. “A Signature for Content-based Image Retrieval Using a Geometrical Transform”, ACM 1998, pp. 229-234.
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.
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.
May et al., “The Transputer”, Springer-Verlag, Berlin Heidelberg, 1989, teaches multiprocessing system.
Nam, et al., “Audio Visual Content-Based Violent Scene Characterization”, Department of Electrical and Computer Engineering, Minneapolis, MN, 1998, pp. 353-357.
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.
Whitby-Strevens, “The Transputer”, 1985 IEEE, Bristol, UK.
Yanai, “Generic Image Classification Using Visual Knowledge on the Web,” MM'03, Nov. 2-8, 2003, Tokyo, Japan, pp. 167-176.
Guo et al, “AdOn: An Intelligent Overlay Video Advertising System”, SIGIR, Boston, Massachusetts, Jul. 19-23, 2009.
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.
Semizarov et al. “Specificity of Short Interfering RNA Determined through Gene Expression Signatures”, PNAS, 2003, pp. 6347-6352.
Brecheisen, et al., “Hierarchical Genre Classification for Large Music Collections”, ICME 2006, pp. 1385-1388.
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.
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.
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.
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.
Chuan-Yu Cho, et al., “Efficient Motion-Vector-Based Video Search Using Query by Clip”, 2004, IEEE, Taiwan, pp. 1-4.
Gomes et al., “Audio Watermaking and Fingerprinting: For Which Applications?” University of Rene Descartes, Paris, France, 2003.
Ihab Al Kabary, et al., “SportSense: Using Motion Queries to Find Scenes in Sports Videos”, Oct. 2013, ACM, Switzerland, pp. 1-3.
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.
Shih-Fu Chang, et al., “VideoQ: A Fully Automated Video Retrieval System Using Motion Sketches”, 1998, IEEE, , New York, pp. 1-2.
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.
Zhu et al., Technology-Assisted Dietary Assessment. Computational Imaging VI, edited by Charles A. Bauman, Eric L. Miller, Ilya Pollak, Proc. of SPIE-IS&T Electronic Imaging, SPIE vol. 6814, 681411, Copyright 2008 SPIE-IS&T. pp. 1-10.
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.
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. 167-470, DOI: 10.1109/ISIMP.2004.1434102 IEEE Conference Publications, Hong Kong.
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.
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.
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, Mar. 2003, pp. 37-42.
Zhu et al., “Technology-Assisted Dietary Assesment”, Proc SPIE. Mar. 20, 2008, pp. 1-15.
Zou et al., “A Content-Based Image Authentication System with Lossless Data Hiding”, ICME 2003, pp. 213-216.
Big Bang Theory Series 04 Episode 12, aired Jan. 6, 2011; [retrieved from Internet: ].
Boari et al, “Adaptive Routing for Dynamic Applications in Massively Parallel Architectures”, 1995 IEEE, Spring 1995, pp. 1-14.
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, pp. 1-4.
Fathy et al, “A Parallel Design and Implementation for Backpropagation Neural Network Using MIMD Architecture”, 8th Mediterranean Electrotechnical Conference, 19'96. MELECON '96, Date of Conference: May 13-16, 1996, vol. 3 pp. 1472-1475, vol. 3.
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.
Hogue, “Tree Pattern Inference and Matching for Wrapper Induction on the World Wide Web”, Master's Thesis, Massachusetts Institute of Technology, Jun. 2004, pp. 1-106.
Hogue, “Tree Pattern Inference and Matching for Wrapper Induction on the World Wide Web”, Master's Thesis, Massachusetts institute of Technology, 2004, pp. 1-106.
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.
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.
International Search Report and Written Opinion for PCT/US2016/050471, ISA/RU, Moscow, RU, dated May 4, 2017.
International Search Report and Written Opinion for PCT/US2016/054634, ISA/RU, Moscow, RU, dated Mar. 16, 2017.
International Search Report and Written Opinion for PCT/US2017/015831, ISA/RU, Moscow, RU, dated Apr. 20, 2017.
Johnson et al, “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, 2008, pp. 98-103.
Lin et al., “Generating robust digital signature for image/video authentication”, Multimedia and Security Workshop at ACM Multimedia '98, Bristol, U.K., Sep. 1998, pp. 245-251.
Lu et al, “Structural Digital Signature for Image Authentication: An Incidental Distortion Resistant Scheme”, IEEE Transactions on Multimedia, vol. 5, No. 2, Jun. 2003, pp. 161-173.
Lyon, “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.
May et al, “The Transputer”, Springer-Verlag Berlin Heidelberg 1989, vol. 41.
McNamara et al., “Diversity Decay in opportunistic Content Sharing Systems”, 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1-3.
Morad et al., “Performance, Power Efficiency and Scalability of Asymmetric Cluster Chip Multiprocessors”, Computer Architecture Letters, vol. 4, 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 Publication No. 427, IEE 1996.
Natschlager 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.
Odinaev et al, “Cliques in Neural Ensembles as Perception Carriers”, Technion—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) Submitted Nov. 2004; published Jul. 2004, pp. 1-48.
Queluz, “Content-Based Integrity Protection of Digital Images”, SPIE Conf. on Security and Watermarking of Multimedia Contents, San Jose, Jan. 1999, pp. 85-93.
Santos et al., “SCORM-MPEG: an Ontology of Interoperable Metadata for multimediaand E-Learning”, 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCom), 2015, pp. 224-228.
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 publication, ISBN 2-930307-06-4, pp. 1-12.
Schneider et al, “A Robust Content based Digital Signature for Image Authentication”, Proc. ICIP 1996, Lausane, Switzerland, Oct. 1996, pp. 227-230.
Srihari et al., “Intelligent Indexing and Semantic Retrieval of Multimodal Documents”, Kluwer Academic Publishers, May 2000, vol. 2, Issue 2-3, pp. 245-275.
Srihari, Rohini K. “Automatic indexing and content-based retrieval of captioned images” Computer 0 (1995): 49-56.
Stolberg et al, “Hibrid-SOC: A Mul Ti-Core SOC Architecture for Mul Timedia Signal Processing”, 2003 IEEE, pp. 189-194.
Theodoropoulos et al, “Simulating Asynchronous Architectures on Transputer Networks”, Proceedings of the Fourth Euromicro Workshop on Parallel and Distributed Processing, 1996. PDP '96, pp. 274-281.
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 onlline Jul. 14, 2005, pp. 521-528.
Wang et al., “Classifying Objectionable Websites Based onImage Content”, Stanford University, pp. 1-12.
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.
Whitby-Strevens, “The transputer”, 1985 IEEE, pp. 292-300.
Wilk et al., “The Potential of Social-Aware Multimedia Prefetching on Mobile Devices”, International Conference and Workshops on networked Systems (NetSys), 2015, pp. 1-5.
Yanagawa et al, “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts”, Columbia University ADVENT Technical Report # 222-2006-8, Mar. 20, 2007, pp. 1-17.
Yanagawa et al., “Columbia University's Baseline Detectors for 374 LSCOM Semantic Visual Concepts”, Columbia University ADVENT Technical Report #222, 2007, pp. 2006-2008.
Zhou et al, “Ensembling neural networks: Many could be better than all”, National Laboratory for Novel Software Technology, Nanjing University, Hankou Road 22, Nanjing 210093, PR China Received Nov. 16, 2001, Available online Mar. 12, 2002, pp. 239-263.
“Computer Vision Demonstration Website”, Electronics and Computer Science, University of Southampton, 2005, USA.
Chinchor, Nancy A. et al.; Multimedia Analysis + Visual Analytics = Multimedia Analytics; IEEE Computer Society; 2010; pp. 52-60. (Year: 2010).
Guo et al, AdOn: An Intelligent Overlay Video Advertising System (Year: 2009).
Li et al (“Matching Commercial Clips from TV Streams Using a Unique, Robust and Compact Signature” 2005) (Year: 2005).
Marian Stewart B et al., “Independent component representations for face recognition”, Proceedings of the SPIE Symposium on Electronic Imaging: Science and Technology; Conference on Human Vision and Electronic Imaging III, San Jose, California, Jan. 1998, pp. 1-12.
Ortiz-Boyer et al, “CIXL2: A Crossover Operator for Evolutionary Algorithms Based on Population Features”, Journal of Artificial Intelligence Research 24 (2005) Submitted Nov. 2004; published Jul. 2005, pp. 1-48.
Pandya etal. A Survey on QR Codes: in context of Research and Application. International Journal of Emerging Technology and U Advanced Engineering. ISSN 2250-2459, ISO 9001:2008 Certified Journal, vol. 4, Issue 3, Mar. 2014 (Year: 2014).
Stolberg et al (“Hibrid-SOC: A Multi-Core SOC Architecture for Multimedia Signal Processing” 2003).
Vallet et al (“Personalized Content Retrieval in Context Using Ontological Knowledge” Mar. 2007) (Year: 2007).
Ma et el. (“Semantics modeling based image retrieval system using neural networks” 2005 (Year: 2005).
Related Publications (1)
Number Date Country
20150199336 A1 Jul 2015 US
Provisional Applications (2)
Number Date Country
61948050 Mar 2014 US
61890251 Oct 2013 US
Continuations (1)
Number Date Country
Parent 12434221 May 2009 US
Child 13344400 US
Continuation in Parts (6)
Number Date Country
Parent 14096865 Dec 2013 US
Child 14638210 US
Parent 13624397 Sep 2012 US
Child 14096865 US
Parent 13344400 Jan 2012 US
Child 13624397 US
Parent 12195863 Aug 2008 US
Child 13624397 Sep 2012 US
Parent 12084150 Apr 2009 US
Child 12195863 US
Parent 12084150 US
Child 13624397 Sep 2012 US