System and method for speech to text translation using cores of a natural liquid architecture system

Information

  • Patent Grant
  • 10621988
  • Patent Number
    10,621,988
  • Date Filed
    Monday, May 8, 2017
    7 years ago
  • Date Issued
    Tuesday, April 14, 2020
    4 years ago
Abstract
A system and method for speech-to-text translation. The method includes determining, based on at least one audio input in a first language, at least one original language concept; identifying, based on the determined at least one original language concept, the first language of the at least one audio input; determining, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; generating a textual output based on the determined at least one translated concept.
Description
TECHNICAL FIELD

The present disclosure relates generally to pattern recognition in speech translation and, more particularly, to pattern recognition in audio analysis for speech translation.


BACKGROUND

Sound files, like images, may be indexed by their titles. Unfortunately, if a sound file is simply an embedded or linked audio file on a Web page, there may be no additional information about it. The audio files may have some descriptive information included, such as the source. Other metadata can be included in audio files, but such inclusion requires more effort on the part of the content producer and, as in the case of images, the metadata may be incomplete or insufficient.


To fully index the content of audio files generally requires having a transcript of the session in a computer-readable text format that enables text-indexing. With voice recognition software, some automated indexing of audio files is possible and has been successfully used. However, it is widely known that such transcripts rarely match what was spoken exactly. The difficulty is compounded if the spoken words are sung and the search is for the song in a specific tune, or a search for a tune regardless of the words.


Analysis of audio signals is desirable for a wide variety of reasons such as speaker recognition, voice command recognition, dictation, instrument or song identification, and the like. In some instances, it may be desirable to convert human speech from one language to one or more other languages in real-time or at a later time. Particularly, a user listening to an audio signal may wish to hear the contents of the file in another language. Currently real-time speech translation is largely performed by human translators, as any machine-based translation algorithm does not provide reliable results.


It would be therefore 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” or “certain 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 speech-to-text translation. The method comprises: determining, based on at least one audio input in a first language, at least one original language concept; identifying, based on the determined at least one original language concept, the first language of the at least one audio input; determining, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; generating a textual output based on the determined at least one translated concept.


Certain embodiments disclosed herein also include a non-transitory computer readable medium having stored thereon causing a processing circuitry to execute a process, the process comprising: determining, based on at least one audio input in a first language, at least one original language concept; identifying, based on the determined at least one original language concept, the first language of the at least one audio input; determining, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; generating a textual output based on the determined at least one translated concept.


Certain embodiments disclosed herein also include a system for speech-to-text translation. The system comprises: a processing circuitry; and a memory, the memory containing instructions that, when executed by the processing circuitry, configure the system to: determine, based on at least one audio input in a first language, at least one original language concept; identify, based on the determined at least one original language concept, the first language of the at least one audio input; determine, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; generate a textual output based on the determined at least one translated concept.





BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter that is regarded as the disclosure 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 flowchart illustrating a method for speech-to-text translation according to an embodiment.



FIG. 2 is a schematic diagram of a speech-to-text translator 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 network diagram utilized to describe the various disclosed embodiments.





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


A system and method for speech-to-text translation. Signatures are generated for audio inputs in a first language. Based on the generated signatures, original language concepts representing portions of the audio are determined. The original language concepts are associated with the first language. Matching translated concepts associated with a desired second language are identified. Textual output is generated based on the identified translated concepts.



FIG. 1 is an example flowchart 100 illustrating a method for speech-to-text translation according to an embodiment. In an embodiment, the method may be performed by the speech-to-text translator 200, FIG. 2.


At S110, at least one audio input is received. Each audio input may be, but is not limited to, a digital representation of an audio signal, a direct feed from one or more microphones, a combination thereof, and the like. In an embodiment, a plurality of audio inputs from a single source is received. As a non-limiting example, a plurality of audio inputs may be received from a plurality of microphones directed at a single podium with one or more speakers.


At S120, at least one signature is generated for the received audio inputs. Each signature may be generated based on an entire audio input, a portion of an audio input, or both. In an embodiment, the signatures are generated as described further herein below with respect to FIGS. 3 and 4. In another embodiment, each generated signature may be stored in, e.g., a database.


In an embodiment, S120 includes generating the signatures via a plurality of at least partially statistically independent computational cores, where the properties of each core are set independently of the properties of the other cores. In another embodiment, S120 includes sending the multimedia content element to a signature generator system and receiving the plurality of signatures. The signature generator system includes a plurality of at least statistically independent computational cores as described further herein. The signature generator system may include a large ensemble of randomly and independently generated heterogenous computational cores, mapping data-segments onto a high-dimensional space in parallel and generating compact signatures for classes of interest.


Each signature represents a concept, and may be robust to noise and distortion. Each concept is a collection of signatures representing multimedia content elements 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 providing a 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”.


At S130, the at least one generated signature is compared to a plurality of previously generated signatures to determine at least one matching signature. The plurality of previously generated signatures may be stored in, e.g., a signature database. In an embodiment, if no matching signature is determined, S130 may result in a null value indicating that a translation for the terms represented by the concept is not available.


At S140, at least one cluster is identified based on the determined matching signatures. Each cluster includes a group of signatures, where each signature in the group at least partially matches each other signature in the group. A matching portion of signature that is common to all signatures of the cluster is a concept represented by the cluster. Clustering of signatures is described further in U.S. Pat. No. 8,386,400 assigned to the common assignee, which is hereby incorporated by reference.


The clustering process may map a certain content-universe onto a hierarchical structure of clusters. The content-elements of the content-universe are mapped to signatures as appropriate. The signatures of all of the content-elements are matched to each other and, consequently, such matching generates an inter-match matrix. Generation of the inter-match matrix leads to a set of clusters. This results in a highly compressed representation of the content-universe.


At S150, an original language concept is identified for each cluster. The original language concepts may be identified based on previously generated concepts, or based on concepts generated in response to identification of clusters.


At S160, a first language (e.g., Hebrew, English, Spanish, etc.) is determined based on the identified first concepts. The language may be determined by different classification techniques. One such example is a statistical approach based on prevalence of certain function words (such as the word “the” in the English language). Another example is to create a language n-gram model from a training audio file for each language which the system may detect. For any audio for which a language needs to be determined, a similar model is made, and that model is compared to each stored language model. The most likely language is the one with the model that is most similar to the model from the audio needing to be identified.


At S170, a matching translated concept is determined for each identified original language concept. Each of the matching translated concepts is associated with a second language. In an embodiment, S170 includes comparing a signature representing each identified original langauge concept to a plurality of previously generated signatures. Matching may be performed, for example, by statistically identifying proximity of signatures or concepts to each other. In the above example, the concept of “tree” may often appear in proximity to words such as “green”, “brown”, “tall”, and so on in the English language. The concept of “arbre” may often appear in proximity to words such as “vert”, “brun” and “grand” in the French language. It is therefore statistically possible to match “tree” to “arbre” with a degree of certainty determined, for example, by a threshold. Proximity may be based on whether such words appear within the same sentence, paragraph, and the like. Proximity may be, for example, audio detected within a window of time before or after the concept. In another embodiment, proximity may additionally be determined by considering placement of the second concept within written text.


In an embodiment, a translated concept may only be matched if it is associated with a desired second language. As an example, if the desired second language is English, concepts that are similar may only be provided as a match if such concepts are associated with the English language. Association with a language may be determined based on, e.g., metadata associated with the concepts. Which language is desired as the translated language may be determined by, but is not limited to, user preferences provided by a user, a user profile based on previously identified concepts by that user, and so on. In some embodiments, a plurality of translated concepts, each translated concept associated with a distinct language, may be provided, thereby allowing for translation into multiple different languages.


In another embodiment, the desired second language may be indicated in a user profile of a user to view the translated text. The user profile may be generated and modified based on a user's impressions with respect to multimedia content elements. Impressions may be determined based on, but is not limited to, a user gesture; adjustment to computer volume by a user, time spent viewing, interacting with, or listening to a multimedia content element; key strokes entered while viewing or listening to a multimedia content element; and so on. A user gesture may be, but is not limited to, a mouse click, a mouse scroll a tap, a swipe, and any other gesture on a device having a touch screen display or a pointing device. User profiles and user impressions are discussed in more detail in U.S. patent application Ser. No. 13/856,201 assigned to common assignee, which is hereby incorporated by reference for all that it contains.


As a non-limiting example of matching based on a user profile, past interactions with multimedia content featuring English language text and audio demonstrate a positive impression of English language content (i.e., that the user interacts with English language content, suggesting that the user can read English content), thereby causing a subsequently generated user profile to associate the user with the English language as an English language speaker. When the user later listens to an audio file containing Italian speech, the concepts of the words in the audio file are determined and matched respective of related second concepts associated with the English language.


At S180, a textual output is generated based on the determined translated concepts. In an embodiment, S180 includes retrieving (e.g., from a translation database) textual content associated with each matching translated concept, where the texual output is generated using the retrieved textual content. The textual output may be caused to be displayed on, e.g., a user device.


At S190, it is determined whether additional audio content is to be translated and, if so, execution continues with S130; otherwise, execution terminates. Multiple translations may allow for, e.g., translating the same audio inputs to multiple languages.



FIG. 2 is an example schematic diagram of a speech-to-text translator 200 according to an embodiment. The speech-to-text translator 200 includes a processing circuitry 210 coupled to a memory 220, a storage 230, an audio input interface 240, and a network interface 250. In an embodiment, the components of the speech-to-text translator 200 may be communicatively connected via a bus 205.


The processing circuitry 210 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 processing circuitry 210 may be realized as an array of at least partially statistically independent computational cores. The properties of each computational core are set independently of those of each other core, as described further herein above.


The memory 220 may be volatile (e.g., RAM, etc.), non-volatile (e.g., ROM, flash memory, etc.), or a combination thereof. In one configuration, computer readable instructions to implement one or more embodiments disclosed herein may be stored in the storage 230.


In another embodiment, the memory 220 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 processing circuitry 610, cause the processing circuitry 210 to perform the various processes described herein. Specifically, the instructions, when executed, cause the processing circuitry 210 to perform speech-to-text translation based on audio inputs received from the audio input interface 240 as described herein. The audio input interface 240 may be used to receive different signals, a single signal from a plurality of locations, or any combination thereof.


The storage 230 may be magnetic storage, optical storage, and the like, and may be realized, for example, as flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVDs), or any other medium which can be used to store the desired information.


The network interface 250 allows the speech-to-text translator 130 to communicate with the signature generator system 140 for the purpose of, for example, sending multimedia content elements, receiving signatures, and the like. Further, the network interface 250 allows the speech-to-text translator 130 to receive audio inputs from the audio input interface 240.


It should be understood that the embodiments described herein are not limited to the specific architecture illustrated in FIG. 2, and other architectures may be equally used without departing from the scope of the disclosed embodiments. In particular, the speech-to-text translator 130 may further include a signature generator system configured to generate signatures as described herein without departing from the scope of the disclosed embodiments.



FIGS. 3 and 4 illustrate the generation of signatures for the multimedia content elements by the SGS 140 according to an embodiment. An exemplary 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. 3. 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 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, θ 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. Nos. 8,326,775 and 8,312,031, assigned to the common assignee, which are 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 U.S. Pat. No. 8,655,801, referenced above.



FIG. 5 is an example network diagram 500 utilized to describe the various disclosed embodiments. The network diagram 500 includes a user device 520, the speech-to-text translator (STTT) 200, a database 530, and a plurality of audio capturing devices (ACDs) 550-1 through 550-n (hereinafter referred to individually as an audio capturing device 550 and collectively as audio capturing devices 550, merely for simplicity purposes) communicatively connected via a network 510. The network 510 may be, but is not limited to, the Internet, the world-wide-web (WWW), a local area network (LAN), a wide area network (WAN), a metro area network (MAN), and other networks capable of enabling communication between the elements of the network diagram 500.


The user device 520 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 appliances, equipped with browsing, viewing, listening, filtering, managing, and other capabilities that are enabled as further discussed herein below. The user device 520 may have installed thereon an agent 525 such as, but not limited to, a web browser, an application, and the like. The application 525 may be configured to receive and display textual content.


The database 530 may store signatures, multimedia content elements, or both. Each of the multimedia content elements stored in the database 530 may be associated with one or more of the stored signatures. In some implementations, multiple databases (not shown), each storing signatures, multimedia content elements, or both, may be utilized.


The speech-to-text translator 200 is configured to obtain audio inputs in a first language from, e.g., the database 530, the audio capturing devices 550, or a combination thereof, and to generate textual outputs in a second language as described further herein above. The speech-to-text translator 200 may be configured to store the textual outputs in the database 530, to send the textual outputs to the user device 520, or both.


In an embodiment, the speech-to-text translator 200 is communicatively connected to a signature generator system (SGS) 540, which is utilized by the speech-to-text translator 200 to perform the various disclosed embodiments. Specifically, the signature generator system 540 is configured to generate signatures to multimedia content elements and includes a plurality of computational cores, each computational core having properties that are at least partially statistically independent of each other core, where the properties of each core are set independently of the properties of each other core.


The signature generator system 540 may be communicatively connected to the The signature generator system 540 may be communicatively connected to the speech-to-text translator 200 directly (as shown), or through the network 510 (not shown). In another embodiment, the speech-to-text translator 200 may further include the signature generator system 540, thereby allowing the speech-to-text translator 200 to generate signatures for multimedia content elements directly (as shown), or through the network 510 (not shown). In another embodiment, the speech-to-text translator 200 may further include the signature generator system 540, thereby allowing the speech-to-text translator 200 to generate signatures for multimedia content elements.


The audio capturing devices 550 are configured to capture audio inputs to be translated. The audio capturing devices 550 may be, but are not limited to, microphones. Alternatively or collectively, audio inputs to be translated may include audio inputs stored in the database 530.


It should be noted that using signatures for determining the context ensures more accurate identification of trending multimedia content than, for example, based on metadata alone.


It should be noted that only one user device 520 and one agent 525 are described herein above with reference to FIG. 5 merely for the sake of simplicity and without limitation on the disclosed embodiments. Multiple user devices may receive textual outputs generated by the speech-to-text translator 530 without departing from the scope of the disclosure.


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 disclosed embodiments 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 invention, 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.


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.


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.

Claims
  • 1. A method for speech-to-text translation, comprising: determining, based on at least one audio input in a first language, at least one original language concept;identifying, based on the determined at least one original language concept, the first language of the at least one audio input;determining, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; andgenerating a textual output based on the determined at least one translated concept.
  • 2. The method of claim 1, further comprising: selecting the second language based on past interactions of a user with multimedia.
  • 3. The method of claim 1, wherein each matching translated concept is statistically proximate to one of the at least one original language concept.
  • 4. The method of claim 3, wherein each signature is robust to noise and distortion.
  • 5. The method of claim 3, wherein each signature is generated by a signature generator system, wherein the signature generator system includes a plurality of at least partially statistically independent computational cores, wherein the properties of each core are set independently of the properties of each other core.
  • 6. The method of claim 1, further comprising: generating at least one signature for the at least one audio input, wherein the at least one original language concept is determined further based on the generated at least one signature.
  • 7. The method of claim 6, wherein determining the at least one original language concept further comprises: determining at least one previously generated signature that matches the generated at least one signature, wherein each matching signature represents one of the at least one original language concept.
  • 8. The method of claim 7, wherein each concept is a collection of signatures and metadata representing the concept.
  • 9. The method of claim 1, comprising selecting the second language based on a user profile.
  • 10. The method according to claim 1 wherein each concept is a collection of signatures and is an abstract description of contents for which the signatures of the concept were generated.
  • 11. The method according to claim 1 herein the at least one input audio comprises a speech segment; wherein the method comprises generating at least one signature for the speech segment by breaking down the speech segment to multiple patches of random length and of random position in the speech segment.
  • 12. A non-transitory computer readable medium having stored thereon instructions for causing a processing circuitry to execute a process, the process comprising: determining, based on at least one audio input in a first language, at least one original language concept; identifying, based on the determined at least one original language concept, the first language of the at least one audio input; determining, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; and generating a textual output based on the determined at least one translated concept.
  • 13. A system for speech-to-text translation, comprising: a processing circuitry; and a memory connected to the processing circuitry, the memory containing instructions that, when executed by the processing circuitry, configure the system to: determine, based on at least one audio input in a first language; at least one original language concept, identify, based on the determined at least one original language concept, the first language of the at least one audio input; determine, for each original language concept, a matching translated concept, wherein each matching translated concept is associated with a second language, wherein the second language is different from the first language; and generate a textual output based on the determined at least one translated concept.
  • 14. The system of claim 13, wherein each matching translated concept is statistically proximate to one of the at least one original language concept.
  • 15. The system of claim 14, wherein each signature is robust to noise and distortion.
  • 16. The system of claim 14, further comprising: a signature generator system, wherein each signature is generated by the signature generator system, wherein the signature generator system includes a plurality of at least partially statistically independent computational cores, wherein the properties of each core are set independently of the properties of each other core.
  • 17. The system of claim 13, wherein the system is further configured to: generate at least one signature for the at least one audio input, wherein the at least one original language concept is determined further based on the generated at least one signature.
  • 18. The system of claim 17, wherein the system is further configured to: determine at least one previously generated signature that matches the generated at least one signature, wherein each matching signature represents one of the at least one original language concept.
  • 19. The system of claim 18, wherein each concept is a collection of signatures and metadata representing the concept.
  • 20. The non-transitory computer readable medium according to claim 12 wherein each concept is a collection of signatures and is an abstract description of contents for which the signatures of the concept were generated.
  • 21. The non-transitory computer readable medium according to claim 12 wherein the at least one input audio comprises a speech segment; wherein the method comprises generating at least one signature for the speech segment by breaking down the speech segment to multiple patches of random length and of random position in the speech segment.
  • 22. The system of claim 13, wherein the system is further configured to select the second language based on past interactions of a user with multimedia.
  • 23. The system of claim 13, wherein the system is further configured to select the second language based on a user profile.
  • 24. The system according to claim 13 wherein each concept is a collection of signatures and is an abstract description of contents for which the signatures of the concept were generated.
  • 25. The system according to claim 13 wherein the at least one input audio comprises a speech segment; wherein the system comprises a signature generator system that is configured to generate at least one signature for the speech segment by breaking down the speech segment to multiple patches of random length and of random position in the speech segment.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application No. 62/333,493 filed on May 9, 2016. This application is also a continuation-in-part (CIP) of U.S. patent application Ser. No. 15/289,696 filed on Oct. 10, 2016, now pending, which is a continuation of U.S. patent application Ser. No. 14/302,495 filed on Jun. 12, 2014, now U.S. Pat. No. 9,477,658, which claims the benefit of U.S. Provisional Application No. 61/833,933 filed on Jun. 12, 2013. The Ser. No. 15/289,696 application is also a CIP of U.S. patent application Ser. No. 13/602,858, filed on Sep. 4, 2012, now U.S. Pat. No. 8,868,619. The Ser. No. 13/602,858 application is a continuation of U.S. patent application Ser. No. 12/603,123, filed on Oct. 21, 2009, now U.S. Pat. No. 8,266,185. The Ser. No. 12/603,123 application is a continuation-in-part of: (1) 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; and (2) 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 above-referenced U.S. patent application Ser. No. 12/084,150; and (3) U.S. patent application Ser. No. 12/348,888 filed on Jan. 5, 2009, now pending, which is a CIP of the above-referenced U.S. patent application Ser. No. 12/084,150 and the above-referenced U.S. patent application Ser. No. 12/195,863; and (4) U.S. patent application Ser. No. 12/538,495 filed on Aug. 10, 2009, now U.S. Pat. No. 8,312,031, which is a continuation-in-part of the above-referenced U.S. patent application Ser. No. 12/084,150, the above-referenced U.S. patent application Ser. No. 12/195,863, and the above-referenced U.S. patent application Ser. No. 12/348,888. All of the applications referenced above are herein incorporated by reference.

US Referenced Citations (476)
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
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
5940821 Wical Aug 1999 A
5978754 Kumano Nov 1999 A
5987454 Hobbs Nov 1999 A
5991306 Burns et al. Nov 1999 A
6038560 Wical Mar 2000 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
6240423 Hirata May 2001 B1
6243375 Speicher Jun 2001 B1
6243713 Nelson et al. Jun 2001 B1
6275599 Adler et al. Aug 2001 B1
6329986 Cheng Dec 2001 B1
6363373 Steinkraus Mar 2002 B1
6381656 Shankman Apr 2002 B1
6411229 Kobayashi Jun 2002 B2
6422617 Fukumoto et al. Jul 2002 B1
6493692 Kobayashi et al. Dec 2002 B1
6493705 Kobayashi et al. Dec 2002 B1
6507672 Watkins et al. Jan 2003 B1
6523022 Hobbs Feb 2003 B1
6523046 Liu et al. Feb 2003 B2
6524861 Anderson Feb 2003 B1
6526400 Takata et al. Feb 2003 B1
6550018 Abonamah et al. Apr 2003 B1
6557042 He et al. Apr 2003 B1
6560597 Dhillon et al. May 2003 B1
6594699 Sahai et al. Jul 2003 B1
6601026 Appelt et al. Jul 2003 B2
6601060 Tomaru Jul 2003 B1
6611628 Sekiguchi et al. Aug 2003 B1
6611837 Schreiber Aug 2003 B2
6618711 Ananth Sep 2003 B1
6643620 Contolini et al. Nov 2003 B1
6643643 Lee et al. Nov 2003 B1
6665657 Dibachi Dec 2003 B1
6675159 Lin et al. Jan 2004 B1
6681032 Bortolussi et al. Jan 2004 B2
6704725 Lee Mar 2004 B1
6728706 Aggarwal et al. Apr 2004 B2
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
6836776 Schreiber Dec 2004 B2
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
6970881 Mohan et al. Nov 2005 B1
6978264 Chandrasekar et al. Dec 2005 B2
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
7124149 Smith et al. Oct 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
7296012 Ohashi Nov 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
7346629 Kapur et al. Mar 2008 B2
7353224 Chen et al. Apr 2008 B2
7376672 Weare May 2008 B2
7392238 Zhou et al. Jun 2008 B1
7406459 Chen et al. Jul 2008 B2
7433895 Li et al. Oct 2008 B2
7450740 Shah et al. Nov 2008 B2
7464086 Black et al. Dec 2008 B2
7523102 Bjarnestam et al. Apr 2009 B2
7526607 Singh et al. Apr 2009 B1
7529659 Wold May 2009 B2
7536384 Venkataraman et al. May 2009 B2
7542969 Rappaport et al. Jun 2009 B1
7548910 Chu et al. Jun 2009 B1
7555477 Bayley et al. Jun 2009 B2
7555478 Bayley et al. Jun 2009 B2
7562076 Kapur Jul 2009 B2
7574436 Kapur et al. Aug 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
7694318 Eldering et al. Apr 2010 B2
7836054 Kawai et al. Nov 2010 B2
7860895 Scofield Dec 2010 B1
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
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
8316005 Moore Nov 2012 B2
8326775 Raichelgauz et al. Dec 2012 B2
8345982 Gokturk et al. Jan 2013 B2
8386400 Raichelgauz et al. Feb 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
8799175 Sereboff Aug 2014 B2
8799176 Walker Aug 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
9286623 Raichelgauz et al. Mar 2016 B2
9292519 Raichelgauz et al. Mar 2016 B2
9323754 Ramanathan et al. Apr 2016 B2
9330189 Raichelgauz et al. May 2016 B2
9372940 Raichelgauz et al. Jun 2016 B2
9384196 Raichelgauz et al. Jul 2016 B2
9396435 Raichelgauz et al. Jul 2016 B2
9438270 Raichelgauz et al. Sep 2016 B2
9449001 Raichelgauz et al. Sep 2016 B2
9466068 Raichelgauz et al. Oct 2016 B2
9477658 Raichelgauz et al. Oct 2016 B2
9489431 Raichelgauz et al. Nov 2016 B2
9529984 Raichelgauz et al. Dec 2016 B2
9558449 Raichelgauz et al. Jan 2017 B2
9575969 Raichelgauz et al. Feb 2017 B2
9639532 Raichelgauz et al. May 2017 B2
9646005 Raichelgauz et al. May 2017 B2
9646006 Raichelgauz et al. May 2017 B2
9652785 Raichelgauz et al. May 2017 B2
9672217 Raichelgauz et al. Jun 2017 B2
9679062 Schillings et al. Jun 2017 B2
9691164 Raichelgauz et al. Jun 2017 B2
9747420 Raichelgauz et al. Aug 2017 B2
9767143 Raichelgauz et al. Sep 2017 B2
9792620 Raichelgauz et al. Oct 2017 B2
9798795 Raichelgauz et al. Oct 2017 B2
9807442 Bhatia et al. Oct 2017 B2
9875445 Amer et al. Jan 2018 B2
9886437 Raichelgauz et al. Feb 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 Bokhani 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
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
20020113812 Walker 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 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
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 et al. 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
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
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
20050261890 Robinson 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
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
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
20060218191 Gopalakrishnan Sep 2006 A1
20060224529 Kermani Oct 2006 A1
20060236343 Chang Oct 2006 A1
20060242130 Sadri et al. Oct 2006 A1
20060242139 Butterfield et al. Oct 2006 A1
20060242554 Gerace 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
20070009159 Fan Jan 2007 A1
20070011151 Hagar et al. Jan 2007 A1
20070019864 Koyama et al. Jan 2007 A1
20070022374 Huang et al. Jan 2007 A1
20070038608 Chen 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 Dostveen et al. Mar 2007 A1
20070074147 Wold Mar 2007 A1
20070083611 Farago et al. Apr 2007 A1
20070091106 Moroney Apr 2007 A1
20070130112 Lin Jun 2007 A1
20070130159 Gulli et al. Jun 2007 A1
20070156720 Maren Jul 2007 A1
20070168413 Barletta et al. Jul 2007 A1
20070174320 Chou Jul 2007 A1
20070195987 Rhoads 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
20070268309 Tanigawa et al. Nov 2007 A1
20070282826 Hoeber et al. Dec 2007 A1
20070294295 Finkelstein et al. Dec 2007 A1
20070298152 Baets Dec 2007 A1
20080046406 Seide et al. Feb 2008 A1
20080049629 Morrill 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
20080163288 Ghosal et al. Jul 2008 A1
20080165861 Wen Jul 2008 A1
20080172615 Igelman et al. Jul 2008 A1
20080201299 Lehikoinen et al. Aug 2008 A1
20080201314 Smith et al. Aug 2008 A1
20080201361 Castro 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 Oct 2008 A1
20080263579 Mears et al. Oct 2008 A1
20080270373 Oostveen 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
20090037408 Rodgers Feb 2009 A1
20090043637 Eder Feb 2009 A1
20090089587 Brunk et al. Apr 2009 A1
20090119157 Dulepet 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
20090208106 Dunlop et al. Aug 2009 A1
20090216761 Raichelgauz et al. Aug 2009 A1
20090245573 Saptharishi et al. Oct 2009 A1
20090245603 Koruga et al. Oct 2009 A1
20090253583 Yoganathan 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
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
20100322522 Wang et al. 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
20110145068 King et al. Jun 2011 A1
20110164180 Lee Jul 2011 A1
20110164810 Zang et al. Jul 2011 A1
20110202848 Ismalon Aug 2011 A1
20110218946 Stern et al. Sep 2011 A1
20110238407 Kent 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 Bemtson et al. Mar 2013 A1
20130086499 Dyor et al. Apr 2013 A1
20130089248 Remiszewski et al. Apr 2013 A1
20130104251 Moore et al. Apr 2013 A1
20130159298 Mason et al. Jun 2013 A1
20130173635 Sanjeev Jul 2013 A1
20130226930 Arngren et al. Aug 2013 A1
20130283401 Pabla et al. 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
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
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
20160306798 Guo et al. Oct 2016 A1
20170017638 Satyavarta et al. Jan 2017 A1
20170154241 Shambik et al. Jun 2017 A1
Foreign Referenced Citations (19)
Number Date Country
1085464 Jan 2007 EP
0231764 Apr 2002 WO
0231764 Apr 2002 WO
2003005242 Jan 2003 WO
2003067467 Aug 2003 WO
2004019527 Mar 2004 WO
2005027457 Mar 2005 WO
2007049282 May 2007 WO
20070049282 May 2007 WO
PCTUS0873852 Aug 2008 WO
PCTUS1346155 Jun 2013 WO
2014076002 May 2014 WO
2014137337 Sep 2014 WO
2016040376 Mar 2016 WO
2016070193 May 2016 WO
PCTUS1650471 Sep 2016 WO
PCTUS1654634 Sep 2016 WO
PCTUS1659111 Oct 2016 WO
PCTUS1715831 Jan 2017 WO
Non-Patent Literature Citations (225)
Entry
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.
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).
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, Mar. 10, 2000.
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 the related International Patent Application No. PCT/US2008/073852; dated Jan. 28, 2009; Entire Document.
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 related International Patent Application No. PCT/IL2006/001235; dated Jul. 28, 2009.
International Search Report for the related 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.
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.
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.
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-04.
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/054634 dated Mar. 16, 2017, ISA/Ru, Moscow, RU.
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.
Verstraeten et al.: “Isolated word recognition with the Liquid State Machine: a case study”, Information Processing Letters, Amsterdam, NL, vol. 95, No. 6, Sep. 30, 2005 (Sep. 30, 2005), pp. 521-528, XP005028093 ISSN: 0020-0190.
Wang et al. “A Signature for Content-based Image Retrieval Using a Geometrical Transform”, ACM 1998, pp. 229-234.
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.
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; 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.
U.S. Appl. No. 13/770,603, filed Feb. 19, 2013.
U.S. Appl. No. 13/773,112, filed Feb. 21, 2013.
U.S. Appl. No. 13/856,201, filed Apr. 3, 2013.
U.S. Appl. No. 14/050,991, filed Oct. 10, 2013.
U.S. Appl. No. 14/087,800, filed Nov. 22, 2013.
U.S. Appl. No. 14/096,865, filed Dec. 4, 2013.
U.S. Appl. No. 14/168,811, filed Jan. 30, 2014.
U.S. Appl. No. 14/171,158, filed Feb. 3, 2014.
U.S. Appl. No. 14/175,569, filed Feb. 7, 2014.
U.S. Appl. No. 14/198,178, filed Mar. 5, 2014.
U.S. Appl. No. 14/203,047, filed Mar. 10, 2014.
U.S. Appl. No. 14/209,448, filed Mar. 13, 2014.
U.S. Appl. No. 14/212,213, filed Mar. 14, 2014.
U.S. Appl. No. 15/455,363, filed Mar. 10, 2017.
U.S. Appl. No. 14/224,923, filed Mar. 25, 2014.
U.S. Appl. No. 14/267,990, filed May 2, 2014.
U.S. Appl. No. 14/280,928, filed May 19, 2014.
U.S. Appl. No. 14/302,487, filed Jun. 12, 2014.
U.S. Appl. No. 15/336,218, filed Oct. 27, 2016.
U.S. Appl. No. 14/321,231, filed Jul. 1, 2014.
U.S. Appl. No. 14/499,795, filed Sep. 29, 2014.
U.S. Appl. No. 14/509,552, filed Oct. 8, 2014.
U.S. Appl. No. 14/513,863, filed Oct. 14, 2014.
U.S. Appl. No. 14/530,922, filed Nov. 3, 2014.
U.S. Appl. No. 14/596,605, filed Jan. 14, 2015.
U.S. Appl. No. 14/596,553, filed Jan. 14, 2015.
U.S. Appl. No. 14/597,324, filed Jan. 15, 2015.
U.S. Appl. No. 14/608,880, filed Jan. 29, 2015.
U.S. Appl. No. 14/621,643, filed Feb. 13, 2015.
U.S. Appl. No. 14/621,661, filed Feb. 13, 2015.
U.S. Appl. No. 14/638,210, filed Mar. 4, 2015.
U.S. Appl. No. 14/638,176, filed Mar. 4, 2015.
U.S. Appl. No. 14/700,809, filed Apr. 30, 2015.
U.S. Appl. No. 14/700,801, filed Apr. 30, 2015.
U.S. Appl. No. 14/811,185, filed Jul. 28, 2015.
U.S. Appl. No. 14/811,201, filed Jul. 28, 2015.
U.S. Appl. No. 14/811,209, filed Jul. 28, 2015.
U.S. Appl. No. 14/811,219, filed Jul. 28, 2015.
U.S. Appl. No. 14/811,227, filed Jul. 28, 2015.
U.S. Appl. No. 14/836,249, filed Aug. 26, 2015.
U.S. Appl. No. 14/836,254, filed Aug. 26, 2015.
U.S. Appl. No. 14/962,532, filed Dec. 8, 2015.
U.S. Appl. No. 14/606,546, filed Jan. 27, 2015.
U.S. Appl. No. 14/994,435, filed Jan. 13, 2016.
U.S. Appl. No. 15/019,223, filed Feb. 9, 2016.
U.S. Appl. No. 15/140,977, filed Apr. 28, 2016.
U.S. Appl. No. 15/162,042, filed May 23, 2016.
U.S. Appl. No. 15/189,386, filed Jun. 22, 2016.
U.S. Appl. No. 15/206,711, filed Jul. 11, 2016.
U.S. Appl. No. 15/206,792, filed Jul. 11, 2016.
U.S. Appl. No. 15/206,726, filed Jul. 11, 2016.
U.S. Appl. No. 15/252,790, filed Aug. 31, 2016.
U.S. Appl. No. 15/258,072, filed Sep. 7, 2016.
U.S. Appl. No. 15/259,907, filed Sep. 8, 2016.
U.S. Appl. No. 15/265,117, filed Sep. 14, 2016.
U.S. Appl. No. 15/289,696, filed Oct. 10, 2016.
U.S. Appl. No. 15/296,551, filed Oct. 18, 2016.
U.S. Appl. No. 15/388,035, filed Dec. 22, 2016.
U.S. Appl. No. 15/416,415, filed Jan. 26, 2017.
U.S. Appl. No. 15/419,567, filed Jan. 30, 2017.
U.S. Appl. No. 15/420,989, filed Jan. 31, 2017.
U.S. Appl. No. 15/452,148, filed Mar. 7, 2017.
U.S. Appl. No. 15/456,902, filed Mar. 13, 2017.
U.S. Appl. No. 15/463,414, filed Mar. 20, 2017.
U.S. Appl. No. 15/474,019, filed Mar. 30, 2017.
U.S. Appl. No. 15/585,698, filed May 3, 2017.
U.S. Appl. No. 15/585,707, filed May 3, 2017.
U.S. Appl. No. 15/601,440, filed May 22, 2017.
U.S. Appl. No. 15/601,303, filed May 22, 2017.
U.S. Appl. No. 15/601,309, filed May 22, 2017.
U.S. Appl. No. 15/601,314, filed May 22, 2017.
U.S. Appl. No. 15/602,669, filed May 23, 2017.
U.S. Appl. No. 15/602,770, filed May 23, 2017.
U.S. Appl. No. 15/605,521, filed May 25, 2017.
U.S. Appl. No. 15/605,527, filed May 25, 2017.
U.S. Appl. No. 15/608,493, filed May 30, 2017.
U.S. Appl. No. 15/611,019, filed Jun. 1, 2017.
U.S. Appl. No. 15/612,643, filed Jun. 2, 2017.
U.S. Appl. No. 15/613,819, filed Jun. 5, 2017.
U.S. Appl. No. 15/614,982, filed Jun. 6, 2017.
U.S. Appl. No. 15/625,187, filed Jun. 16, 2017.
U.S. Appl. No. 15/628,171, filed Jun. 20, 2017.
U.S. Appl. No. 15/628,178, filed Jun. 20, 2017.
U.S. Appl. No. 15/637,674, filed Jun. 29, 2017.
U.S. Appl. No. 15/641,830, filed Jul. 5, 2017.
U.S. Appl. No. 15/647,888, filed Jul. 12, 2017.
U.S. Appl. No. 15/667,188, filed Aug. 2, 2017.
U.S. Appl. No. 15/677,496, filed Aug. 15, 2017.
U.S. Appl. No. 15/684,377, filed Aug. 23, 2017.
U.S. Appl. No. 15/695,665, filed Sep. 5, 2017.
U.S. Appl. No. 15/698,317, filed Sep. 7, 2017.
U.S. Appl. No. 15/700,893, filed Sep. 11, 2017.
U.S. Appl. No. 15/722,602, filed Oct. 2, 2017.
U.S. Appl. No. 15/722,608, filed Oct. 2, 2017.
U.S. Appl. No. 15/802,890, filed Nov. 3, 2017.
U.S. Appl. No. 15/808,292, filed Nov. 9, 2017.
U.S. Appl. No. 15/810,532, filed Nov. 13, 2017.
U.S. Appl. No. 15/813,453, filed Nov. 15, 2017.
U.S. Appl. No. 15/818,081, filed Nov. 20, 2017.
U.S. Appl. No. 15/820,731, filed Nov. 22, 2017.
U.S. Appl. No. 15/827,311, filed Nov. 30, 2017.
U.S. Appl. No. 15/834,937, filed Dec. 7, 2017.
U.S. Appl. No. 62/530,301.
U.S. Appl. No. 62/530,215.
U.S. Appl. No. 62/528,745.
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.
Chinchor, Nancy A. et al.; Multimedia Analysis + Visual Analytics=Multimedia Analytics; IEEE Computer Society; 2010; pp. 52-60. (Year: 2010).
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.
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.
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.
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 pn 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. 2005, 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.
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.
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.
“Computer Vision Demonstration Website”, Electronics and Computer Science, University of Southampton, 2005, USA.
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).
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).
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.
Nhitby-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.
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.
Ma Et El. (“Semantics modeling based image retrieval system using neural networks” 2005 (Year: 2005).
Related Publications (1)
Number Date Country
20170243583 A1 Aug 2017 US
Provisional Applications (2)
Number Date Country
61833933 Jun 2013 US
62333493 May 2016 US
Continuations (2)
Number Date Country
Parent 14302495 Jun 2014 US
Child 15289696 US
Parent 12603123 Oct 2009 US
Child 13602858 US
Continuation in Parts (12)
Number Date Country
Parent 15289696 Oct 2016 US
Child 15589558 US
Parent 13602858 Sep 2012 US
Child 14302495 US
Parent 12084150 US
Child 12603123 US
Parent 12195863 Aug 2008 US
Child 12603123 Oct 2009 US
Parent 12084150 Apr 2009 US
Child 12195863 US
Parent 12348888 Jan 2009 US
Child 12603123 Oct 2009 US
Parent 12084150 Apr 2009 US
Child 12348888 US
Parent 12195863 Aug 2008 US
Child 12084150 US
Parent 12538495 Aug 2009 US
Child 12603123 Oct 2009 US
Parent 12084150 Apr 2009 US
Child 12538495 US
Parent 12195863 Aug 2008 US
Child 12084150 US
Parent 12348888 Jan 2009 US
Child 12195863 US