The present disclosure generally relates to the orchestration of a plurality of deep learning networks coupled in an adaptively reconfigurable grid.
The reduction of multiple symbols arranged in a pattern (intentionally or seemingly randomly) to a smaller number of manageable symbols that are easily recognizable is known in the art. For example, in music, a sequence of notes may be combined into two or more notes to form a chord that is played, or otherwise heard as if being played simultaneously. Chords tend to be repetitive in nature such that the plurality of notes may be represented by a single chord symbol, thereby reducing the number of notes explicitly represented in a musical score. Accordingly, the chord, “C7”, is interpreted as the root note A, the minor third C, and a perfect fifth E to be played generally simultaneously.
The subject matter that is regarded as the invention 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 disclosure will be apparent from the following detailed description taken in conjunction with the accompanying drawings.
A method for responding to a query is implemented on at least one computing device and includes: receiving at least one query from a user device; determining a context for the at least one query, selecting at least one deep learning network (DLN) of a plurality of DLNs to process the at least one query, where the selecting is based at least on matching the context to the at least one DLN, sending at least a representation of the at least one query and the context to the at least one DLN, receiving at least one response to the at least one query from the at least one DLN, and sending the at least one response to the user device.
It will be appreciated that patterns of data are typically distributed unevenly in a given population of data. Some patterns may be more prominent than others and are therefore likely to have a larger number of occurrences, while other patterns may be comparatively rare. In addition, some patterns may be correlated to each other, and together form pattern-combinations which may also be very common. This may be problematic for pattern recognition systems. For example, to retrieve a similarity measurement between two content-segments, it may not be enough to consider the number of corresponding patterns; the probability of occurrence for each pattern may be of importance as well. Furthermore, correlations between patterns may also be of importance. For example, if two patterns always appear together, it may be more efficient to consider them to be a single pattern.
It will be appreciated that the issues discussed hereinabove may negatively impact on the scalability and the accuracy of pattern-recognition systems. For example, in a large system where the handling of different patterns is typically spread among multiple resources (e.g., “machines”) of the pattern-recognition system, machines configured to process “less-popular” patterns may remain largely inactive, whereas machines processing “popular” patterns, may be overloaded. It also may not be possible to distribute the handling of patterns according to their a-priory probability without knowledge of the correlations between the patterns. Furthermore, to scale up a pattern-recognition system in an efficient manner it may be beneficial to avoid duplication of the pattern-space and the need to store copies of each of the known patterns in each machine.
Reference is now made to
System 100 comprises a network 110, a plurality of deep learning networks (DLNs) 120, and a query server 130. Network 110 may be used to communicate between different parts of system 100, and may be implemented using the Internet, the world-wide-web (WWW), a local area network (LAN), a wide area network (WAN), a metro area network (MAN), and/or any other network(s) capable of enabling communication between the elements of the system 100.
Deep learning networks (DLNs) 120-1 through 120-n may represent a plurality of networks providing deep learning services to query server 130. It will be appreciated that deep learning as referred to herein is an application of learning tasks of artificial neural networks (ANNs) that contain a plurality of layers by a computing device. To date, deep learning has been applied to fields including computer vision, speech recognition, natural language processing, audio recognition, social network filtering, machine translation and bioinformatics, producing results comparable to, and in some cases superior to, human experts. Deep learning typically uses a cascade of many layers of nonlinear processing units for feature extraction and transformation. Each successive layer uses the output from a previous layer as input. The algorithms may be supervised or unsupervised and applications may include both unsupervised pattern analysis and supervised classification. Deep learning further enables learning of multiple levels of representations that correspond to different levels of abstraction. The levels identified in such manner may represent a hierarchy of concepts.
Query server 130 comprises a processing unit (PU) 135 and a memory unit (MU) 137. Processing unit 135 may be instantiated as processing circuitry comprising one or more hardware logic components and circuits. For example, and without limitation, illustrative types of hardware logic components that may 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, and/or any other hardware logic components capable of performing calculations and/or other manipulations of information. In accordance with embodiments described herein, processing unit 135 may be implemented as an array of at least partially statistically independent computational cores. The properties of each computational core may be set independently of those of each other core, as described further hereinbelow. Memory unit 137 contains therein a query application instantiated as instructions that when executed by processing unit 135 configures query server 130 to perform as further described herein.
Query server 130 also includes a network interface (not shown) for connectivity to DLNs 120 via network 110. In accordance with embodiments described herein, query server 130 is configured to manage DLNs 120 and to optimize their use in providing responses to queries. For example, query server 130 may generate queries and send them to one or more DLNs 120. Query server 130 may then analyze responses and associated metadata received from the DLNs 120 to improve the use and configuration of DLNs 120 with respect to specific types of queries.
As depicted in
Each such user device 125 may comprise a software application (not shown) installed thereon to be executed by processing circuitry (not shown). The software application (app) may be downloaded from an application repository, such as the AppStore®, Google Play®, or any other similar repositories hosting software applications. Alternatively, the application may be pre-installed in user device 125. In accordance with some embodiments described herein, the application may be located on a remote server (e.g., in a cloud, or otherwise accessible via local or wide area network) and accessed by a web-browser application on user device 125. User device 125 may employ the application to send queries via network 110 to be analyzed by one or more of DLNs 120.
In accordance with some embodiments described herein, system 100 may also comprise a data warehouse (not shown) that is configured to store metadata associated with DLNs 120. The data warehouse may also be further configured to store queries received from user device(s) 125 and associated responses received thereof from DLNs 120. Per the exemplary embodiment of
In the exemplary embodiment of
According to an embodiment described herein, query server 130 may be configured to receive at least one query from user device 125 over network 110. Query server 130 may analyze a query received from user device 125 to determine an optimal, or at least a preferred DLN 120 to process the query. In accordance with some embodiments described herein, query server 130 may invoke SGS 140 to generate at least one signature to be associated with the query. In accordance with some embodiments described herein, the process employed by SGS 140 to generate the signature(s) may employ lossless compression of at least part of the element(s) of the query, thereby rendering the generated signature(s) robust to noise and distortions.
DCC system 160 may comprise a database of query identifiers and query classifications. Query server 130 may use the signature as a query identifier to search for a similar query in DCC system 160. Based on this search, DCC system 160 may return a query classification to query server 130. For example, a signature representing a man with a basketball may be classified as representing “basketball.”
Alternatively, or in addition, the signature may be used to search for a concept structure (or concept) in DCC system 160. A concept is a collection of signatures representing elements of the unstructured data and metadata describing the concept. As a non-limiting example, a ‘Superman concept’ is a signature-reduced cluster of signatures describing elements (such as multimedia elements) related to, e.g., a Superman cartoon: a set of metadata representing proving textual representation of the Superman concept. Techniques for generating concept structures are also described in U.S. Pat. No. 8,266,185 (hereinafter '185) to Raichelgauz et al., which is assigned to common assignee, and is incorporated hereby by reference for all that it contains.
For example, user device 125 may provide one or more MMCEs as a query to query server 130, e.g., an image of a basketball player. Query server 130 may invoke SGS 140 to generate at least one signature for each of the MMCEs in the query. The signature(s) may then be used to search DCC system 160 to identify an associated concept. The metadata in the identified concept may be used to identify a context for each of the plurality of MMCEs using each of the generated signatures. For example, for the image of basketball player, the concept may be “basketball”, and the keyword “basketball” may be included in the metadata for the concept. If the query also includes a second image, e.g., the logo for the National Basketball Association (NBA), the second concept may be “NBA”, and the keyword “NBA” may be included in the concept's metadata. In such an example, the context may be derived from the two concepts, yielding “NBA basketball.” An exemplary technique for determining a context of multimedia elements based on signatures is described in detail in U.S. patent application Ser. No. 13/770,603, filed on Feb. 19, 2013, assigned to common assignee, which is hereby incorporated by reference for all the useful information it contains.
It will be appreciated that the embodiments described herein are not necessarily limited to the use of signatures to determine a query's context. In accordance with some embodiments, the query may include text in addition to, or instead of, one or more images. For example, the query may include the names of basketball players from the NBA. The names may be used to search DCC system 160 to identify the associated concept, e.g., “NBA basketball.”
It will be appreciated that DLNs 120 may not be configured identically. Some deep learning models have comparative advantages vis-à-vis other deep learning models for given subjects of interest. For example, some deep learning models may be observed to provide better results for face detection, whereas other deep learning models may be observed to provide better results for facial recognition (given a detected face). And even among deep learning models that provide better results for facial recognition, there may be differences in the quality of results based on ethnicity and/or other factors. It will similarly be appreciated that for practical reasons (e.g., cost/efficiency, resource availability, etc.) the DLNs 120 may be implemented with different levels of computing resources, e.g., RAM, CPU, bandwidth, etc. DLNs 120 may use large amounts of reference data; it may not be practical or efficient to store the entire universe of relevant data on each machine. Furthermore, at any given time, based on previous assignments of queries to perform, the different DLNs 120 may have different levels of resources available to perform additional queries. It will be appreciated that in operation there may be other factors differentiating between the suitability of the DLNs 120 to perform a given query.
In accordance with embodiments described herein, query server 130 may comprise a list of the various DLNs 120 that may include ratings for different contexts, tasks, and processing capabilities. The list and ratings may be based on a pre-processing analysis of actual performance and/or manual input. The ratings may represent the suitability of a given DLN 120 to perform a query in a given context in terms of processing speed and/or accuracy. Query server 130 may also track current workloads for each DLN 120 based on, for example, queries assigned to a given DLN 120 for which a response has not yet been received. Query server 130 may calculate a current processing load for each DLN 120 as a function of current workload and computing resources.
Query server 130 may be configured to use at least the identified context to select at least one DLN of the plurality of DLNs 120 that optimally serves the query in light of the relevant comparative advantages (e.g. per the rating) and current workload as described hereinabove. For example, for a query based on an image of an unknown girl, query server 130 may select a DLN 120 based on its rating for facial recognition. For a crowd scene, query server 130 may split the query into two stages: for the first stage a DLN 120 may be selected based on its rating for face detection; for the second stage a DLN 120 may be selected based on its rating for facial recognition, where the faces detected by the first DLN 120 may be provided (either directly or via query server 130) for further analysis to the second DLN 120. For a crowd scene with an identified context of “Hong Kong,” the DLN 120 selected for facial recognition may be selected based on a higher rating for facial recognition among people of Asian ancestry.
Depending upon the configuration of system 100, the selected DLN 120 may return a response for the query to Query server 130 which may in turn forward the response to user device 125. Alternatively, or in addition, the selected DLN 120 may return the response directly to user device 125. In a case where there may be a plurality of outputs (e.g., from more than one DLN 120), query server 130 may cluster the outputs to a single complex output in order to optimally serve the query response. Alternatively, the plurality of outputs may be prioritized and formatted individually by query server 130 before providing the results to user device 125.
Thereafter, the request may be forwarded to a management unit (MU) 220 that is configured to navigate the request throughout the plurality of DLNs 230 (only one labeled in
Query server 130 may determine (step 320) a context for the query. In accordance with some embodiments described herein, step 320 may comprise query server 130 generating (step 322) a signature for at least one multimedia content element in the query; using the generated signature(s) to search (step 324) DCC 160 (
Based at least on the determined context, query server 130 may select (step 330) one or more DLNs 120 (
Query server 130 may send (step 340) the query to the selected DLN(s) 120, and subsequently receive (step 350) the query response(s) from the selected DLN(s) 120 after the query is processed. It will be appreciated that depending on the configuration of system 100, the query as sent to DLN (s) 120 may not necessarily be identical to the query as received from user device 125, but rather a representation of the original query. For example, the query sent in step 340 may include one or more MMCEs from the query received from user device 125, one or more signatures derived from the MMCE(s), and/or the context(s) as determined in step 326. If necessary, query server 130 may combine (step 360) multiple responses into a single combined response. Query server 130 may then return (step 370) the (combined) response(s) to user device 125.
In accordance with some embodiments described herein, query server 130 may be configured to adjust the ratings for DLNs 120 in accordance with the results of process 300. For example, if the actual response to receive a query response from a given DLN 120 is slower/faster than anticipated as per its current rating for the associated context, query server 130 may adjust the rating accordingly. Similarly, in some implementations, query server 130 may be configured with a feedback mechanism to receive feedback from user device 125 regarding the usefulness of the query responses received in process 300. Query server 130 may also be configured to adjust an associated rating in accordance with the feedback.
It is important to note that the embodiments disclosed herein are only examples of the many advantageous uses of the 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.
The various embodiments disclosed herein may 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.
The present application claims the benefit of priority from U.S. Provisional Patent Application Ser. No. 62/530,215, filed on Jul. 9, 2017 which is incorporated herein in its entirety.
Filing Document | Filing Date | Country | Kind |
---|---|---|---|
PCT/IL2018/050746 | 7/9/2018 | WO |
Publishing Document | Publishing Date | Country | Kind |
---|---|---|---|
WO2019/012527 | 1/17/2019 | WO | A |
Number | Name | Date | Kind |
---|---|---|---|
4733353 | Jaswa | Mar 1988 | A |
4932645 | Schorey et al. | Jun 1990 | A |
4972363 | Nguyen et al. | Nov 1990 | A |
5078501 | Hekker et al. | Jan 1992 | 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, I et al. | Jun 1997 | A |
5745678 | Herzberg et al. | Apr 1998 | A |
5754938 | Herz et al. | May 1998 | A |
5763069 | Jordan | Jun 1998 | A |
5806061 | Chaudhuri et al. | Sep 1998 | A |
5835087 | Herz et al. | Nov 1998 | A |
5835901 | Duvoisin et al. | Nov 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 |
5926812 | Hilsenrath et al. | Jul 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 |
6314419 | Faisal | Nov 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 |
6546405 | Gupta et al. | Apr 2003 | B2 |
6550018 | Abonamah et al. | Apr 2003 | B1 |
6557042 | He et al. | Apr 2003 | B1 |
6594699 | Sahai et al. | Jul 2003 | B1 |
6601026 | Appelt et al. | Jul 2003 | B2 |
6611628 | Sekiguchi et al. | Aug 2003 | B1 |
6618711 | Ananth | Sep 2003 | B1 |
6640015 | Lafruit | Oct 2003 | B1 |
6643620 | Contolini et al. | Nov 2003 | B1 |
6643643 | Lee et al. | Nov 2003 | B1 |
6665657 | Dibachi | Dec 2003 | B1 |
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 |
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 |
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 |
7215828 | Luo | May 2007 | B2 |
7260564 | Lynn et al. | Aug 2007 | B1 |
7289643 | Brunk et al. | Oct 2007 | B2 |
7299261 | Oliver et al. | Nov 2007 | B1 |
7302089 | Smits | 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 |
7383179 | Alves et al. | Jun 2008 | B2 |
7433895 | Li et al. | Oct 2008 | B2 |
7464086 | Black et al. | Dec 2008 | B2 |
7529659 | Wold | May 2009 | B2 |
7657100 | Gokturk et al. | Feb 2010 | B2 |
7660468 | Gokturk et al. | Feb 2010 | B2 |
7801893 | Gulli | Sep 2010 | B2 |
7805446 | Potok et al. | Sep 2010 | B2 |
7860895 | Scofield et al. | Dec 2010 | B1 |
7872669 | Darrell et al. | Jan 2011 | B2 |
7921288 | Hildebrand | Apr 2011 | B1 |
7933407 | Keidar et al. | Apr 2011 | B2 |
8023739 | Hohimer et al. | Sep 2011 | B2 |
8266185 | Raichelgauz et al. | Sep 2012 | B2 |
8275764 | Jeon | Sep 2012 | B2 |
8285718 | Ong et al. | Oct 2012 | B1 |
8312031 | Raichelgauz et al. | Nov 2012 | B2 |
8315442 | Gokturk et al. | Nov 2012 | B2 |
8345982 | Gokturk et al. | Jan 2013 | B2 |
8386400 | Raichelgauz et al. | Feb 2013 | B2 |
8396876 | Kennedy et al. | Mar 2013 | B2 |
8418206 | Bryant et al. | Apr 2013 | B2 |
RE44225 | Aviv | May 2013 | E |
8442321 | Chang et al. | May 2013 | B1 |
8457827 | Ferguson et al. | Jun 2013 | B1 |
8495489 | Everingham | Jul 2013 | B1 |
8527978 | Sallam | Sep 2013 | B1 |
8634980 | Urmson | Jan 2014 | B1 |
8635531 | Graham et al. | Jan 2014 | B2 |
8655801 | Raichelgauz et al. | Feb 2014 | B2 |
8655878 | Kulkarni et al. | Feb 2014 | B1 |
8781152 | Momeyer | Jul 2014 | B2 |
8782077 | Rowley | Jul 2014 | B1 |
8799195 | Raichelgauz et al. | Aug 2014 | B2 |
8799196 | Raichelquaz et al. | Aug 2014 | B2 |
8818916 | Raichelgauz et al. | Aug 2014 | B2 |
8868861 | Shimizu et al. | Oct 2014 | B2 |
8886648 | Procopio et al. | Nov 2014 | B1 |
8954887 | Tseng et al. | Feb 2015 | B1 |
8990199 | Ramesh et al. | Mar 2015 | B1 |
9009086 | Raichelgauz et al. | Apr 2015 | B2 |
9104747 | Raichelgauz et al. | Aug 2015 | B2 |
9165406 | Gray et al. | Oct 2015 | B1 |
9298763 | Zack | Mar 2016 | B1 |
9311308 | Sankarasubramaniam et al. | Apr 2016 | B2 |
9323754 | Ramanathan et al. | Apr 2016 | B2 |
9440647 | Sucan | Sep 2016 | B1 |
9466068 | Raichelgauz et al. | Oct 2016 | B2 |
9646006 | Raichelgauz et al. | May 2017 | B2 |
9679062 | Schillings et al. | Jun 2017 | B2 |
9734533 | Givot | Aug 2017 | B1 |
9807442 | Bhatia et al. | Oct 2017 | B2 |
9875445 | Amer et al. | Jan 2018 | B2 |
9984369 | Li et al. | May 2018 | B2 |
10133947 | Yang | Nov 2018 | B2 |
10347122 | Takenaka | Jul 2019 | B2 |
10491885 | Hicks | Nov 2019 | B1 |
20010019633 | Tenze et al. | Sep 2001 | A1 |
20010034219 | Hewitt et al. | Oct 2001 | A1 |
20010038876 | Anderson | Nov 2001 | A1 |
20020004743 | Kutaragi et al. | Jan 2002 | A1 |
20020010682 | Johnson | Jan 2002 | A1 |
20020010715 | Chinn et al. | Jan 2002 | A1 |
20020019881 | Bokhari et al. | Feb 2002 | A1 |
20020032677 | Morgenthaler et al. | Mar 2002 | A1 |
20020038299 | Zernik et al. | Mar 2002 | A1 |
20020042914 | Walker et al. | Apr 2002 | A1 |
20020072935 | Rowse et al. | Jun 2002 | A1 |
20020087530 | Smith et al. | Jul 2002 | A1 |
20020087828 | Arimilli et al. | Jul 2002 | A1 |
20020091947 | Nakamura | Jul 2002 | A1 |
20020107827 | Benitez-Jimenez et al. | Aug 2002 | A1 |
20020113812 | Walker et al. | Aug 2002 | A1 |
20020126002 | Patchell | Sep 2002 | A1 |
20020126872 | Brunk et al. | Sep 2002 | A1 |
20020129140 | Peled et al. | Sep 2002 | A1 |
20020147637 | Kraft et al. | Oct 2002 | A1 |
20020157116 | Jasinschi | Oct 2002 | A1 |
20020163532 | Thomas et al. | Nov 2002 | A1 |
20020174095 | Lulich et al. | Nov 2002 | A1 |
20020184505 | Mihcak et al. | Dec 2002 | A1 |
20030004966 | Bolle et al. | Jan 2003 | A1 |
20030005432 | Ellis et al. | Jan 2003 | A1 |
20030037010 | Schmelzer | Feb 2003 | A1 |
20030041047 | Chang et al. | Feb 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 |
20030110236 | Yang et al. | Jun 2003 | A1 |
20030115191 | Copperman et al. | Jun 2003 | A1 |
20030126147 | Essafi et al. | Jul 2003 | A1 |
20030140257 | Peterka et al. | Jul 2003 | A1 |
20030158839 | Faybishenko | Aug 2003 | A1 |
20030165269 | Fedorovskaya et al. | Sep 2003 | A1 |
20030174859 | Kim | 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 |
20040059736 | Willse | Mar 2004 | A1 |
20040091111 | Levy | May 2004 | A1 |
20040095376 | Graham et al. | May 2004 | A1 |
20040098671 | Graham et al. | May 2004 | A1 |
20040111432 | Adams et al. | Jun 2004 | A1 |
20040117638 | Monroe | Jun 2004 | A1 |
20040128511 | Sun et al. | Jul 2004 | A1 |
20040153426 | Nugent | Aug 2004 | A1 |
20040162820 | James et al. | Aug 2004 | A1 |
20040230572 | Omoigui | Nov 2004 | A1 |
20040267774 | Lin et al. | Dec 2004 | A1 |
20050021394 | Miedema et al. | Jan 2005 | A1 |
20050080788 | Murata | Apr 2005 | A1 |
20050114198 | Koningstein et al. | May 2005 | A1 |
20050131884 | Gross et al. | Jun 2005 | A1 |
20050163375 | Grady | Jul 2005 | A1 |
20050172130 | Roberts | Aug 2005 | A1 |
20050177372 | Wang et al. | Aug 2005 | A1 |
20050193015 | Logston | Sep 2005 | A1 |
20050226511 | Short | Oct 2005 | A1 |
20050238198 | Brown et al. | Oct 2005 | A1 |
20050238238 | Xu et al. | Oct 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 |
20060015580 | Gabriel et al. | Jan 2006 | A1 |
20060020958 | Allamanche et al. | Jan 2006 | A1 |
20060033163 | Chen | Feb 2006 | A1 |
20060050993 | Stentiford | Mar 2006 | A1 |
20060069668 | Braddy et al. | Mar 2006 | A1 |
20060080311 | Potok et al. | Apr 2006 | A1 |
20060100987 | Leurs | May 2006 | A1 |
20060112035 | Cecchi et al. | May 2006 | A1 |
20060120626 | Perlmutter | Jun 2006 | A1 |
20060129822 | Snijder et al. | Jun 2006 | A1 |
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 |
20060248558 | Barton et al. | Nov 2006 | A1 |
20060251338 | Gokturk et al. | Nov 2006 | A1 |
20060251339 | Gokturk | Nov 2006 | A1 |
20060253423 | McLane et al. | Nov 2006 | A1 |
20060288002 | Epstein et al. | Dec 2006 | A1 |
20070022374 | Huang et al. | Jan 2007 | A1 |
20070033170 | Sull 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 |
20070074147 | Wold | Mar 2007 | A1 |
20070083611 | Farago et al. | Apr 2007 | A1 |
20070091106 | Moroney | Apr 2007 | A1 |
20070130159 | Gulli et al. | Jun 2007 | A1 |
20070136782 | Ramaswamy et al. | Jun 2007 | A1 |
20070156720 | Maren | Jul 2007 | A1 |
20070196013 | Li | Aug 2007 | A1 |
20070244902 | Seide et al. | Oct 2007 | A1 |
20070253594 | Lu et al. | Nov 2007 | A1 |
20070298152 | Baets | Dec 2007 | A1 |
20080049789 | Vedantham et al. | Feb 2008 | A1 |
20080072256 | Boicey et al. | Mar 2008 | A1 |
20080079729 | Brailovsky | Apr 2008 | A1 |
20080109433 | Rose | May 2008 | A1 |
20080152231 | Gokturk et al. | Jun 2008 | A1 |
20080159622 | Agnihotri et al. | Jul 2008 | A1 |
20080165861 | Wen et al. | Jul 2008 | A1 |
20080166020 | Kosaka | Jul 2008 | A1 |
20080201299 | Lehikoinen et al. | Aug 2008 | A1 |
20080201314 | Smith et al. | Aug 2008 | A1 |
20080201361 | Castro et al. | Aug 2008 | A1 |
20080228995 | Tan et al. | Sep 2008 | A1 |
20080237359 | Silverbrook et al. | Oct 2008 | A1 |
20080247543 | Mick et al. | Oct 2008 | A1 |
20080253737 | Kimura et al. | Oct 2008 | A1 |
20080263579 | Mears et al. | Oct 2008 | A1 |
20080270373 | Oostveen et al. | Oct 2008 | A1 |
20080270569 | McBride | Oct 2008 | A1 |
20080294278 | Borgeson et al. | Nov 2008 | A1 |
20080307454 | Ahanger et al. | Dec 2008 | A1 |
20080313140 | Pereira et al. | Dec 2008 | A1 |
20090022472 | Bronstein | Jan 2009 | A1 |
20090024641 | Quigley et al. | Jan 2009 | A1 |
20090034791 | Doretto | Feb 2009 | A1 |
20090037088 | Taguchi | Feb 2009 | A1 |
20090043637 | Eder | Feb 2009 | A1 |
20090043818 | Raichelgauz | Feb 2009 | A1 |
20090080759 | Bhaskar | Mar 2009 | A1 |
20090096634 | Emam et al. | Apr 2009 | A1 |
20090125544 | Brindley | May 2009 | A1 |
20090157575 | Schobben et al. | Jun 2009 | A1 |
20090165031 | Li et al. | Jun 2009 | A1 |
20090172030 | Schiff et al. | Jul 2009 | A1 |
20090208106 | Dunlop et al. | Aug 2009 | A1 |
20090208118 | Csurka | Aug 2009 | A1 |
20090216761 | Raichelgauz et al. | Aug 2009 | A1 |
20090220138 | Zhang et al. | Sep 2009 | A1 |
20090245573 | Saptharishi et al. | Oct 2009 | A1 |
20090254572 | Redlich et al. | Oct 2009 | A1 |
20090278934 | Ecker | 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 et al. | Apr 2010 | A1 |
20100111408 | Matsuhira | May 2010 | A1 |
20100125569 | Nair et al. | May 2010 | A1 |
20100162405 | Cook et al. | Jun 2010 | A1 |
20100191391 | Zeng | Jul 2010 | A1 |
20100198626 | Cho et al. | Aug 2010 | A1 |
20100212015 | Jin et al. | Aug 2010 | A1 |
20100284604 | Chrysanthakopoulos | Nov 2010 | A1 |
20100293057 | Haveliwala et al. | Nov 2010 | A1 |
20100306193 | Pereira | 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 |
20110029620 | Bonforte | Feb 2011 | A1 |
20110035373 | Berg et al. | Feb 2011 | A1 |
20110038545 | Bober | Feb 2011 | A1 |
20110055585 | Lee | Mar 2011 | A1 |
20110164180 | Lee | Jul 2011 | A1 |
20110164810 | Zang et al. | Jul 2011 | A1 |
20110216209 | Fredlund et al. | Sep 2011 | A1 |
20110218946 | Stern et al. | Sep 2011 | A1 |
20110246566 | Kashef | Oct 2011 | A1 |
20110276680 | Rimon | Nov 2011 | A1 |
20110296315 | Lin et al. | Dec 2011 | A1 |
20120131454 | Shah | May 2012 | A1 |
20120133497 | Sasaki | May 2012 | A1 |
20120136853 | Kennedy et al. | May 2012 | A1 |
20120167133 | Carroll et al. | Jun 2012 | A1 |
20120179642 | Sweeney et al. | Jul 2012 | A1 |
20120179751 | Ahn | Jul 2012 | A1 |
20120185445 | Borden et al. | Jul 2012 | A1 |
20120207346 | Kohli et al. | 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 |
20120265735 | McMillan et al. | Oct 2012 | A1 |
20120294514 | Saunders et al. | Nov 2012 | A1 |
20120299961 | Ramkumar et al. | Nov 2012 | A1 |
20120301105 | Rehg et al. | Nov 2012 | A1 |
20120331011 | Raichelgauz et al. | Dec 2012 | A1 |
20130043990 | Al-Jafar | Feb 2013 | A1 |
20130066856 | Ong et al. | Mar 2013 | A1 |
20130067364 | Berntson et al. | Mar 2013 | A1 |
20130086499 | Dyor et al. | Apr 2013 | A1 |
20130089248 | Remiszewski et al. | Apr 2013 | A1 |
20130103814 | Carrasco | Apr 2013 | A1 |
20130151522 | Aggarwal et al. | Jun 2013 | A1 |
20130159298 | Mason et al. | Jun 2013 | A1 |
20130212493 | Krishnamurthy | Aug 2013 | A1 |
20130226820 | Sedota, Jr. | Aug 2013 | A1 |
20130226930 | Amgren et al. | Aug 2013 | A1 |
20130227023 | Raichelgauz et al. | Aug 2013 | A1 |
20130283401 | Pabla et al. | Oct 2013 | A1 |
20130346412 | Raichelgauz et al. | Dec 2013 | A1 |
20140019264 | Wachman et al. | Jan 2014 | A1 |
20140025692 | Pappas | Jan 2014 | A1 |
20140059443 | Tabe | Feb 2014 | A1 |
20140095425 | Sipple | Apr 2014 | A1 |
20140111647 | Atsmon | Apr 2014 | A1 |
20140125703 | Roveta et al. | May 2014 | A1 |
20140147829 | Jerauld | May 2014 | A1 |
20140149918 | Asokan et al. | May 2014 | A1 |
20140152698 | Kim et al. | Jun 2014 | A1 |
20140156691 | Conwell | Jun 2014 | A1 |
20140169681 | Drake | Jun 2014 | A1 |
20140176604 | Venkitaraman et al. | Jun 2014 | A1 |
20140193077 | Shiiyama et al. | Jul 2014 | A1 |
20140198986 | Marchesotti | Jul 2014 | A1 |
20140201330 | Lopez et al. | Jul 2014 | A1 |
20140250032 | Huang et al. | Sep 2014 | A1 |
20140282655 | Roberts | Sep 2014 | A1 |
20140300722 | Garcia | Oct 2014 | A1 |
20140330830 | Raichelgauz et al. | Nov 2014 | A1 |
20140341476 | Kulick et al. | Nov 2014 | A1 |
20140363044 | Williams et al. | Dec 2014 | A1 |
20140379477 | Sheinfeld | Dec 2014 | A1 |
20150033150 | Lee | Jan 2015 | A1 |
20150052089 | Kozloski et al. | Feb 2015 | A1 |
20150100562 | Kohlmeier et al. | Apr 2015 | A1 |
20150117784 | Lin et al. | Apr 2015 | A1 |
20150120627 | Hunzinger et al. | Apr 2015 | A1 |
20150127516 | Studnitzer et al. | May 2015 | A1 |
20150134688 | Jing | May 2015 | A1 |
20150248586 | Gaidon et al. | Sep 2015 | A1 |
20150254344 | Kulkarni et al. | Sep 2015 | A1 |
20150286742 | Zhang et al. | Oct 2015 | A1 |
20150286872 | Medioni et al. | Oct 2015 | A1 |
20150293976 | Guo | Oct 2015 | A1 |
20150324356 | Gutierrez et al. | Nov 2015 | A1 |
20150332588 | Bulan et al. | Nov 2015 | A1 |
20150363644 | Wnuk | Dec 2015 | A1 |
20160007083 | Gurha | Jan 2016 | A1 |
20160026707 | Ong et al. | Jan 2016 | A1 |
20160132194 | Grue et al. | May 2016 | A1 |
20160210525 | Yang | Jul 2016 | A1 |
20160221592 | Puttagunta et al. | Aug 2016 | A1 |
20160275766 | Venetianer et al. | Sep 2016 | A1 |
20160306798 | Guo et al. | Oct 2016 | A1 |
20160342683 | Kwon | Nov 2016 | A1 |
20160357188 | Ansari | Dec 2016 | A1 |
20170017638 | Satyavarta et al. | Jan 2017 | A1 |
20170032257 | Sharifi | Feb 2017 | A1 |
20170041254 | Agara Venkatesha Rao | Feb 2017 | A1 |
20170109602 | Kim | Apr 2017 | A1 |
20170154241 | Shambik et al. | Jun 2017 | A1 |
20170255620 | Raichelgauz | Sep 2017 | A1 |
20170262437 | Raichelgauz | Sep 2017 | A1 |
20170323568 | Inoue | Nov 2017 | A1 |
20170371898 | Sharma | Dec 2017 | A1 |
20180081368 | Watanabe | Mar 2018 | A1 |
20180101177 | Cohen | Apr 2018 | A1 |
20180108258 | Dilger | Apr 2018 | A1 |
20180157903 | Tu et al. | Jun 2018 | A1 |
20180157916 | Doumbouya | Jun 2018 | A1 |
20180158323 | Takenaka | Jun 2018 | A1 |
20180189613 | Wolf et al. | Jul 2018 | A1 |
20180204111 | Zadeh | Jul 2018 | A1 |
20180373929 | Ye | Dec 2018 | A1 |
20190005726 | Nakano | Jan 2019 | A1 |
20190039627 | Yamamoto | Feb 2019 | A1 |
20190043274 | Hayakawa | Feb 2019 | A1 |
20190045244 | Balakrishnan | Feb 2019 | A1 |
20190056718 | Satou | Feb 2019 | A1 |
20190065951 | Luo | Feb 2019 | A1 |
20190096135 | Mutto et al. | Mar 2019 | A1 |
20190171912 | Vallespi-Gonzalez et al. | Jun 2019 | A1 |
20190188501 | Ryu | Jun 2019 | A1 |
20190220011 | Della Penna | Jul 2019 | A1 |
20190279046 | Han et al. | Sep 2019 | A1 |
20190304102 | Chen et al. | Oct 2019 | A1 |
20190317513 | Zhang | Oct 2019 | A1 |
20190364492 | Azizi | Nov 2019 | A1 |
20190384303 | Muller | Dec 2019 | A1 |
20190384312 | Herbach | Dec 2019 | A1 |
20190385460 | Magzimof | Dec 2019 | A1 |
20190389459 | Berntorp | Dec 2019 | A1 |
20200004248 | Healey | Jan 2020 | A1 |
20200004251 | Zhu | Jan 2020 | A1 |
20200004265 | Zhu | Jan 2020 | A1 |
20200005631 | Visintainer | Jan 2020 | A1 |
20200018606 | Wolcott | Jan 2020 | A1 |
20200018618 | Ozog | Jan 2020 | A1 |
20200020212 | Song | Jan 2020 | A1 |
20200050973 | Stenneth | Feb 2020 | A1 |
20200073977 | Montemerlo | Mar 2020 | A1 |
20200090484 | Chen | Mar 2020 | A1 |
20200097756 | Hashimoto | Mar 2020 | A1 |
20200133307 | Kelkar | Apr 2020 | A1 |
20200043326 | Tao | Jun 2020 | A1 |
Number | Date | Country |
---|---|---|
1085464 | Jan 2007 | EP |
0231764 | Apr 2002 | WO |
2003067467 | Aug 2003 | 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 |
Entry |
---|
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, 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. |
Jasinschi et al., A Probabilistic Layered Framework for Integrating Multimedia Content and Context Information, 2002, IEEE, p. 2057-2060. (Year: 2002). |
Jones et al., “Contextual Dynamics of Group-Based Sharing Decisions”, 2011, University of Bath, p. 1777-1786. (Year: 2011). |
Iwamoto, “Image Signature Robust to Caption Superimpostion for Video Sequence Identification”, IEEE, pp. 3185-3188 (Year: 2006). |
Cooperative Multi-Scale Convolutional Neural, Networks for Person Detection, Markus Eisenbach, Daniel Seichter, Tim Wengefeld, and Horst-Michael Gross Ilmenau University of Technology, Neuroinformatics and Cognitive Robotics Lab (Year; 2016). |
Chen, Yixin, James Ze Wang, and Robert Krovetz. “CLUE: cluster-based retrieval of images by unsupervised learning.” IEEE transactions on Image Processing 14.8 (2005); 1187-1201. (Year: 2005). |
Wusk et al (Non-Invasive detection of Respiration and Heart Rate with a Vehicle Seat Sensor; www.mdpi.com/journal/sensors; Published: May 8, 2018). (Year: 2018). |
Chen, Tiffany Yu-Han, et al. “Glimpse: Continuous, real-time object recognition on mobile devices.” Proceedings of the 13th ACM Confrecene on Embedded Networked Sensor Systems. 2015. (Year: 2015). |
“Computer Vision Demonstration Website”, Electronics and Computer Science, University of Southampton, 2005, USA. |
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. |
Guo et al, AdOn: An Intelligent Overlay Video Advertising System (Year: 2009). |
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. |
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. |
Li et al (“Matching Commercial Clips from TV Streams Using a Unique, Robust and Compact Signature” 2005) (Year: 2005). |
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. |
Ma Et El “Semantics modeling based image retrieval system using neural networks”, 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. |
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. 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). |
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 Multi-Core Soc Architecture for Multimedia Signal Processing” 2003). |
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. |
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. |
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. |
Number | Date | Country | |
---|---|---|---|
20200311117 A1 | Oct 2020 | US |
Number | Date | Country | |
---|---|---|---|
62530215 | Jul 2017 | US |