US 7,937,342 B2Grant
Method and apparatus for detecting spatial patterns
Issue Date:2011-05-03
•16 Claims
•19 Drawing Sheets
Abstract
An HTM node learns a plurality of groups of sensed input patterns over time based on the frequency of temporal adjacency of the input patterns. An HTM node receives a new sensed input, the HTM node assigns probabilities as to the likelihood that the new sensed input matches each of the plurality of learned groups. The HTM node then combines this probability distribution (may be normalized) with previous state information to assign probabilities as to the likelihood that the new sensed input is part of each of the learned groups of the HTM node. Then, as described above, the distribution over the set of groups learned by the HTM node is passed to a higher level node. This process is repeated at higher level nodes to infer a cause of the newly sensed input.
Metadata
Assignee
- Numenta, Inc.
Inventors
- Dileep George
- Jeffrey C Hawkins
- Robert Gilchrist Jaros
Application Information
Application Number:US 11/945,919
Filing Date:2007-11-27
Priority Date:2006-11-28
Art Unit:2129
Classifications
IPC:
G06E1/00
Patent Drawings (19 sheets)
Description
Related Applications
[0001] This Application claims the benefit of Provisional Application No. 60/867,483 filed Nov. 28, 2006, the entire disclosure of which is hereby incorporated by reference, in its entirety.
Field of the Invention
[0002] The present invention is directed toward the field of machine learning using Hierarchical Temporal Memory (HTM) systems and learning probability distributions based on temporally co-occurring groups of inputs.
Background
[0003] Machine learning has generally been thought of and attempted to be implemented in the context of artificial intelligence. Artificial intelligence depends on algorithmic solutions (e.g., a computer program) to replicate particular human acts and/or behaviors. The study of neural networks is a sub-area of artificial intelligence which attempts to mimic certain human brain behavior by using individual processing elements that are interconnected by adjustable connections.
[0004] In human cognition, perception and understanding of phenomena happen over time and space. That is, we learn things have a common cause based on “temporal adjacency”, meaning that two phenomena around the same time. For example, if a child always sees lightening and then thunder, the child will learn that both phenomena have a common cause. As temporal perception is such an important mechanism in cognition, the inability to model temporal events has been a fundamental limitation of most traditional machine learning models. To this end, Hierarchical Temporary Memories (HTMs) have been developed to simulate temporal aspects of perception and learning. An HTM is a hierarchical network of interconnected nodes that individually and collectively (i) learn, over space and time, one or more causes of sensed input data and (ii) determine, dependent on learned causes, likely causes of novel sensed input data.
[0005] One use of HTMs is to learn temporal sequences of sensed input data which have the same cause. These sequences are used in inference to determine causes of new sequences of sensed input data. However, there are instances when sensed inputs with the same cause do not always happen in the same sequence. These circumstances can lead to a large number of similar sequences with the same cause. As learning sequences and their causes is based on the frequency at which the sequences of inputs are sensed, enumerating the frequencies of a large number of sequences can be computationally expensive.
[0006] While sequence-based inference is a powerful application of temporal learning, there are also instances when a sequence of sensed inputs is not available and a cause needs to be inferred based on a single sensed input. This is called “flash inference”. While flash inference may be performed using known causes of single inputs alone, this model of learning fails to incorporate the temporal adjacency of inputs with the same cause. Therefore this model is limited by each input being assigned a cause independently of all other inputs over time, even inputs which always occur together or are very similar.
Summary
[0007] The above needs are met by computer program products, computer-implemented methods and HTM networks which learn groups of sensed inputs based on temporal adjacency of sensed inputs.
[0008] According to one aspect of one or more embodiments of the present invention, the present invention provides a computer-implemented method of determining a cause of a sensed input, wherein a cause represents an object. A first sensed input is received at a first time point. A second sensed input is received at a second time point, wherein the second time point is temporally adjacent to the first time point. The first sensed input and the second sensed input are determined to form a group, wherein the group is associated with the cause. A third sensed input is received. A first value that indicates a probability that the third sensed input is a member of the group is determined and stored the first value in a computer readable memory.
[0009] According to another aspect of the present invention, the present invention provides a HTM network comprising a child node and a parent node. The child node is adapted to determine a plurality of groups of inputs based at least in part on the frequency of temporal adjacency of a plurality of sequential inputs. The child node is adapted to store the plurality of groups in a computer readable memory. The child node is further adapted to receive a first input. the child node is further adapted to determine a plurality of probability values, wherein each probability value is based on a similarity between the first input and a group of the plurality of groups. The child node is further adapted to store the plurality of probability values in a computer readable memory. The child node is further adapted to transmit at least a first probability value of the plurality of probability values from the child node to the parent node.
[0010] According to another aspect of the present invention, the present invention provides a computer-readable storage medium upon which is encoded program code for determining a subset of input patterns with a common cause, wherein the cause represents an object. The program code comprising program code for determining a plurality of temporal adjacency values for a plurality of input patterns received over a plurality of time points. The program code further provides program code for selecting a subset of input patterns based on the plurality of temporal adjacency values. The program further provide program code for determining the subset of input patterns is associated with a common cause and storing the group in a computer readable memory.
[0011] Other aspects of the invention will be apparent from the following description and the appended claims.
[0012] The features and advantages described in the specification are not all inclusive and, in particular, many additional features and advantages will be apparent to one of ordinary skill in the art in view of the drawings, specification, and claims. Moreover, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter.
Brief Description of Drawings
[0013] FIG. 1 shows a flow of data between an object and a human.
[0014] FIG. 2 shows an HTM in accordance with an embodiment of the present invention.
[0015] FIG. 3 shows a node in accordance with an embodiment of the present invention.
[0016] FIG. 4 shows a flow process in accordance with an embodiment of the present invention.
[0017] FIG. 5 shows a conceptual illustration of temporal perception.
[0018] FIGS. 6( a)-6(d) illustrates four consecutive updates of a time adjacency matrix in accordance with an embodiment of the present invention.
[0019] FIG. 7( a) illustrates a decay function in accordance with an embodiment of the present invention. FIG. 7( b) illustrates an update of the time-adjacency matrix using a decay-function in accordance with an embodiment of the present invention.
[0020] FIG. 8( a) illustrates a multiple assignment of a sensed input in accordance with an embodiment of the present invention. FIG. 8( b) illustrates an update of the time-adjacency matrix using multiple assignment of a sensed input in accordance with an embodiment of the present invention.
[0021] FIG. 9( a) illustrates a time-adjacency matrix. FIG. 9( b) illustrates a clustering of a time-adjacency matrix of FIG. 9( a) in accordance with an embodiment of the present invention.
[0022] FIG. 10( a) illustrated a graph representing a time-adjacency matrix. FIG. 10( b) illustrates the selection of nodes in the graph according in accordance with an embodiment of the present invention. FIG. 10( c) shows a grouping of a graph into three sub-graphs in accordance with an embodiment of the present invention. FIG. 10( d) shows a time adjacency matrix.
[0023] FIG. 11 shows a flow process in accordance with an embodiment of the present invention.
[0024] FIG. 12 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
[0025] FIG. 13 shows a flow process in accordance with an embodiment of the present invention.
[0026] FIG. 14 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
[0027] FIG. 15 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
[0028] FIG. 16 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
[0029] FIG. 17 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
[0030] FIG. 18 shows at least a portion of an HTM-based system in accordance with an embodiment of the present invention.
Detailed Description
[0031] In the following description of embodiments of the present invention, numerous specific details are set forth in order to provide a more thorough understanding of the present invention. However, note that the present invention may be practiced without one or more of these specific details. In other instances, well-known features have not been described in detail to avoid unnecessarily complicating the description.
[0032] A preferred embodiment of the present invention is now described with reference to the figures where like reference numbers indicate identical or functionally similar elements. Also in the figures, the left most digits of each reference number corresponds to the figure in which the reference number is first used.
[0033] Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
[0034] Some portions of the detailed description that follows are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.
[0035] However, all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
[0036] Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention could be embodied in software, firmware or hardware, and when embodied in software, could be downloaded to reside on and be operated from different platforms used by a variety of operating systems.
[0037] The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Furthermore, the computers referred to in the specification may include a single processor or may be architectures employing multiple processor designs for increased computing capability.
[0038] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references below to specific languages are provided for disclosure of enablement and best mode of the present invention.
[0039] In addition, the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the claims.
[0040] Humans understand and perceive the world in which they live as a collection—or more specifically, a hierarchy—of objects. An “object” is at least partially defined as having some persistent structure over space and/or time. For example, an object may be a car, a person, a building, a word, a song, an abstract entity such as a concept or information flowing in a network.
[0041] Moreover, referring to FIG. 1 , an object in the world 10 may also be referred to as a “cause” in that the object causes particular data to be sensed, via senses 12, by a human 14. For example, the smell (sensed input data) of a rose (object/cause) results in the recognition/perception of the rose. In another example, the image (sensed input data) of a dog (object/cause) falling upon a human eye results in the recognition/perception of the dog. Even as sensed input data caused by an object change over space and time, humans want to stably perceive the object because the cause of the changing sensed input data, i.e., the object itself, is unchanging. For example, the image (sensed input data) of a dog (object/cause) falling upon the human eye may change with changing light conditions and/or as the human moves; yet, however, the human is able to form and maintain a stable perception of the dog.
[0042] In embodiments of the present invention, learning causes and associating novel input with learned causes are achieved using what may be referred to as a “hierarchical temporal memory” (HTM). An HTM is a hierarchical network of interconnected nodes that individually and collectively (i) learn, over space and time, one or more causes of sensed input data and (ii) determine, dependent on learned causes, likely causes of novel sensed input data. HTMs, in accordance with one or more embodiments of the present invention, are further described below with reference to FIGS. 2-18 .
HTM Structure
[0043] An HTM has one or more levels of nodes. For example, as shown in FIG. 2 , HTM 20 has three levels L1, L2, L3, with level L1 being the lowest level, level L3 being the highest level, and level L2 being between levels L1 and L3. Level L1 has nodes 22, 24, 26, 28; level L2 has nodes 30, 32, and level L3 has node 34. The nodes 22, 24, 26, 28, 30, 32, 34 are hierarchically connected in a tree-like structure such that each node may have several children nodes (i.e., nodes connected at a lower level) and one parent node (i.e., node connected at a higher level). Note that it is also possible to have a single child node connected to multiple parent nodes. Each node 22, 24, 26, 28, 30, 32, 34 may have or be associated with a capacity to store and process information. For example, each node 22, 24, 26, 28, 30, 32, 34 may store sensed input data (e.g., groups of patterns) associated with or derived from particular causes. Further, each node 22, 24, 26, 28, 30, 32, 34 may be arranged to (i) propagate information “forward” (i.e., “up” an HTM hierarchy) to any connected parent node and/or (ii) propagate information “backward” (i.e., “down an HTM hierarchy) to any connected children nodes.
[0044] The nodes are associated or coupled to each other by links. A link represents logical or physical relationship between an output of a node and an input of another node. Outputs from a node in the form of variables are communicated between the nodes via the links.
[0045] Inputs to the HTM 20 from, for example, a sensory system, are supplied to the level L1 nodes 22, 24, 26, 28. A sensory system through which sensed input data is supplied to level L1 nodes 22, 24, 26, 28 may relate to commonly thought-of human senses (e.g., touch, sight, sound) or other human or non-human senses.
[0046] The range of sensed input data that each of the level L1 nodes 22, 24, 26, 28 is arranged to receive is a subset of an entire input space. For example, if an 8×8 image represents an entire input space, each level L1 node 22, 24, 26, 28 may receive sensed input data from a particular 4×4 section of the 8×8 image. Each level L2 node 30, 32, by being a parent of more than one level L1 node 22, 24, 26, 28, covers more of the entire input space than does each individual level L1 node 22, 24, 26, 28. It follows that in FIG. 2 , the level L3 node 34 covers the entire input space by receiving, in some form, the sensed input data received by all of the level L1 nodes 22, 24, 26, 28. Moreover, in one or more embodiments of the present invention, the ranges of sensed input data received by two or more nodes 22, 24, 26, 28, 30, 32, 34 may overlap.
[0047] While HTM 20 in FIG. 2 is shown and described as having three levels, an HTM in accordance with one or more embodiments of the present invention may have any number of levels. Moreover, the hierarchical structure of an HTM may be different than that shown in FIG. 2 . For example, an HTM may be structured such that one or more parent nodes have three children nodes as opposed to two children nodes like that shown in FIG. 2 . Further, in one or more embodiments of the present invention, an HTM may be structured such that a parent node in one level of the HTM has a different number of children nodes than a parent node in the same or another level of the HTM. Further, in one or more embodiments of the present invention, an HTM may be structured such that a parent node receives input from children nodes in multiple levels of the HTM. Further, the sensed input data may be received by nodes at levels other than the lowest level L1. In general, note that there are various and numerous ways to structure an HTM other than as shown in FIG. 2 .
[0048] Any entity that uses or is otherwise dependent on an HTM as, for example, described above with reference to FIG. 2 and below with reference to FIGS. 3-27 , may be referred to as an “HTM-based” system. Thus, for example, an HTM-based system may be a machine that uses an HTM, either implemented in hardware or software, in performing or assisting in the performance of a task.
Learning Causes
[0049] In embodiments of the present invention, an HTM discovers one or more causes in its world from sensory input data received by the HTM. In other words, an HTM does not necessarily have a sense particular to each of the types of causes being sensed; instead, an HTM may discover from raw sensed input data that causes such as cars and words exist. In such a manner, an HTM is able to learn and form representations of causes existing in its world.
[0050] As described above, an “object” has persistent structure. The persistent structure causes persistent patterns to be sensed by an HTM. Each sensed input pattern has one or more spatial attributes. In other words, each sensed input pattern may be thought of as being represented as a particular set of bits. In general, a node in an HTM “learns,” i.e., stores and associates with a common cause, sensed input patterns by determining “temporal co-occurrences” and “temporal adjacencies” of sensed input patterns in its input. Determining co-occurrences and adjacencies of sensed input patterns involves determining which sensed input patterns are active at around the same time at a rate statistically greater than what would be expected based on mere chance. For example, if an HTM node having one hundred inputs has seven inputs that become active together at some statistically significant rate, then the HTM node learns that the sensed input patterns at those seven inputs co-occur.
[0051] Further, in one or more embodiments of the present invention, it may not be necessary for an HTM node to learn all sensed input patterns occurring together at some statistically significant rate. For example, an HTM node may store the x most common sensed input patterns found in its input. Alternatively, an HTM node may store sensed input patterns according a pre-defined measure of significance (e.g. uniqueness).
[0052] In addition to an HTM node learning commonly occurring sensed input patterns as described above, the HTM node learns temporal groups of those learned sensed input patterns. A particular temporal group of learned sensed input patterns may be learned by recognizing that the sensed input patterns occur together at a rate statistically greater than what would be expected based on mere chance. For example, if of fifty sensed input patterns learned by an HTM node, three occur in order at some statistically significant rate, then the HTM node may learn that group of sensed input patterns
[0053] The assignation of patterns to temporal groups representing a single cause enables the application of HTMs to single point or “flash inference” problems in which an unknown single pattern or input is to be assigned a cause. Although, temporal groups are learned over time by the group learner, there needs to be no temporal information associated with the newly sensed input or pattern upon which inference is performed. In this way, temporal grouping or “pooling” allows the exploitation of temporal co-occurrence in the learning stage but does not require temporal information for inference. This type of inference may be applied in image recognition systems trained on temporal data such as face recognition systems, medical image classification systems and satellite image recognition. Flash inference may also be applied to audio data such as in speaker identification. Other applications of flash inference include monitoring engine and electronics data, climate and weather modeling and prediction and stock market prediction.
[0054] In one or more embodiments of the present invention, the groups learned by an HTM node may each be represented by one or more variables. As each learned group is associated with a particular cause, each variable accordingly represents a different cause. The HTM node may pass each of its variables up to a parent node via a vector containing probabilities as to the likelihood that each of its learned groups is active at its input at a given time. The parent node may then (i) determine temporal adjacencies of its sensed input patterns (i.e., the variables received from its child node), (ii) learn sensed input patterns as described above, and (iii) learn high-order groups of learned sensed input patterns (i.e., learn groups of temporally co-occurring variables representing groups learned by its child node).
Group Learning
[0055] As described above, temporal group learning involves learning frequently co-occurring sensed input patterns and outputting a probability that a given sensed input elements is part of each group of sensed input patterns. FIG. 3 shows a node 40 having a temporal group learning functionality. The node 40 has a co-occurrence detector 42 and a group learner 44. The co-occurrence detector 42 receives some input patterns 46. Generally, the co-occurrence detector 42 identifies co-occurrences among input patterns. At each time-step, the co-occurrence detector 42 outputs a distribution P(e−t|y), where P(e−t|y) represents the probability of observing e− (evidence from a lower level) at time t when in state y. The distribution P(e−t|y) is a vector in which each entry corresponds to a different y, where y represents some state of a world to which node 40 is exposed. Thus, for example, at time t, the first entry in P(e−t|y) is P(e−t|y1), the second entry is P(e−t|y2), and so forth. In one embodiment, the co-occurrences are communicated outside of the co-occurrences detector 42.
[0056] Based on the distributions outputted over time by the co-occurrence detector 42, the group learner 44 outputs a distribution P(e−t|G), where P(e−t|G) represents the probability of observing e− (evidence from a lower level) at time t over learned groups G. Thus, each entry in the distribution P(e−t|G) corresponds to a different learned group Gi. In one or more embodiments of the present invention, the learned groups themselves may not be communicated outside of the group learner 44. Further, note that the group learner 44, has a behavior (i.e., outputting distributions over learned groups of sensed input patterns) that may be independent of a type and/or topology of network of which the group learner 44 is part.
[0057] As described above, y represents some state of a world as understood by the system. Note that the statistical nature of the world is such that these states are likely to occur together over time. As shown in FIG. 4 , to learn groups in its world, a group learner (e.g., 44 in FIG. 3 ) builds a time-adjacency matrix which is updated over time ST50. Further, the group learner is arranged to collect statistics from the time-adjacency matrix to learn temporal groups ST52 and then, based on its learned groups and statistics thereof, compute probability distributions for new inputs (as described above) ST54.
Group Based Temporal Pooling
[0058] As described above, learning causes in an HTM-based system involves learning patterns and groups of patterns. In general, patterns and groups of patterns that co-occur frequently are stored and assigned to the same causes. For example, groups of patterns that co-occur frequently at some statistically significant rate may be assigned to the same cause. Accordingly, learning causes may effectively entail mapping many patterns and/or inputs to a single cause. Such assigning of multiple patterns and/or inputs to a single cause may also be referred to as “pooling.”
[0059] In one or more embodiments of the present invention, pooling may be dependent on “spatial” similarities between two or more patterns (noting that a pattern may actually represent a sequence from a lower level). In such embodiments, an HTM node may compare a spatial property of a received sensed input pattern with that of a learned sensed input pattern (or “quantization” point). If the two patterns are “similar enough” (i.e., have enough “overlap”), then the received sensed input pattern may be assigned to the same cause as that of the quantization point. For example, if a quantization point is equal to ‘10010110’, then a received sensed input pattern of ‘10011110’ may be assigned to the same cause as that of the quantization point due to there being a difference of only one bit between the two patterns. Note that the amount of similarity needed to perform such “spatial” pooling may vary within and/or among HTM-based systems.
[0060] Further, in one or more embodiments of the present invention, pooling may involve assigning patterns to the same cause based on temporal adjacency. For example, if an HTM node receives pattern A followed by pattern B followed by pattern D, then patterns A, B, and D may be assigned to the same cause as there is some likelihood that this sequence of patterns was caused by the same object. Accordingly, such “temporal” pooling enables the mapping of patterns, some or all of which may have no significant spatial overlap, to a single cause.
[0061] FIG. 5 illustrates an example of sensing or perceiving a right corner moving in and out of vision. Although the individual sequences of input patterns may represent the same input of a right corner, the sequences of viewing the corner moving into view may be interspersed over time. Additionally, not all of the sequences of patterns representing the right corner are comprised of the exact same image or pattern but instead patterns which represent the same cause.
[0062] As discussed above, one limitation of temporal pooling based strictly on sequential patterns is that this technique often causes a large number of sequences to be created and grouped. When inputs or patterns of inputs with the same cause are sensed in real life, it is not always the case that they adhere to the same sequence every time. Random noise and variety in the order which inputs or patterns are sensed can create a large number of sequences of events, which all have the same cause. Due to different orders in which inputs can be sensed, a large number of patterns which have the same cause can create a combinatorial explosion when considering all possible sequences the patterns can form. Enumerating all of the possible different sequences is not only computationally expensive but often inaccurately reflects the frequency with which patterns co-occur. Promiscuous sequences can sometimes lead to an even or “flat” distribution in frequencies of temporal adjacencies. This “flat” distribution can occlude the detection of differences in frequency of temporal adjacency due to a common cause.
[0063] Group based temporal pooling addresses these problems in temporal and spatial pooling by identifying groups of input patterns thought to have the same cause by identifying temporally temporal adjacency between inputs without relying on the sequence of occurrence of these inputs. Temporal adjacency is used herein to refer to two input patterns occurring at the exact same time as well as close in time point to each other such as directly before or after each other (temporally adjacent) or close to each other in a sequence of inputs over time (temporally proximal). In temporal adjacency, the order in which the input patterns occur can be symmetrical or asymmetrical. In other words, the identified temporal adjacency values may be based or the order the inputs occur (e.g. A . . . B is not equivalent to B . . . A) or independent of the order the input occur (i.e. A . . . B is equivalent to B . . . A). In most embodiments, the groups identified by group based temporal pooling are unordered, meaning that there is no inherent structure or sequence in which the input patterns occur within the group. However, in alternate embodiments, the input patterns may be partially ordered in a group based on various criteria such as frequency of occurrence.
[0064] In one embodiment, temporal adjacency is enumerated for each of the input patterns in a time-adjacency matrix. Each row in the time adjacency matrix represents a sensed input pattern for a time point. Each column in the time adjacency matrix also represents a sensed input pattern. The matrix is enumerated to reflect the frequency of temporal adjacency. At each time point t, the matrix is updated at the row corresponding to the input at time t and the column corresponding to the input that occurred at the previous time point Wt-1. According to the embodiment of the present invention, the matrix is also updated at several previous time points. The number of time points can range from 1 to n, where n represents all previous all time points used to update the matrix. According to the embodiment, n may be parameterized or take a default value. The matrix may be updated with an integer number which enumerates the number of times the input at time t and the input at time Wt-1 are temporally adjacent, or any alternative numeric variable to represent the frequency of temporal adjacency. Additionally, alternate data structures may be used to score temporal adjacency. Various combinations of data structures and numeric variables to enumerate frequency will be apparent to those skilled in the art.
[0065] Four consecutive updates of a time adjacency matrix are illustrated in FIGS. 6 (a)-(d). In FIG. 6( a) the row corresponding to the pattern at time t is updated at the column corresponding to the pattern at time Wt-1 to add an integer value of 1. The increment of +1 represents an update to a value representing the frequency of temporally adjacency of the two patterns. In FIG. 6( b), the time point is advanced such that the previous times t and Wt-1 are now respectively Wt-1 and Wt-2. The matrix is again updated at the column corresponding to the pattern of Wt-1 and the row corresponding to the pattern of time t. FIGS. 6( c) and 6(d) illustrate two additional consecutive updates of the time-adjacency matrix.
[0066] In embodiments where the matrix is updated for temporal adjacency up to Wt-n where n>1, a decay function can be used to weight the enumeration of temporal adjacency. The decay functions may be linear in proportion to n, which represents the number of time points between t and Wt-n. Alternatively, the decay function may be exponential or pseudo-exponential over time. Examples of suitable decay functions to weight temporal adjacency by proximity include but are not limited to: persistence decay functions, block decay functions and exponential decay functions. According to the embodiment, the decay function may be adjusted to weight temporally proximal patterns with a greater or lesser weight. Those skilled in the art will understand the utility of adjusting the decay function according to the application of group-based temporal pooling and the type of input data which pooling is applied to.
[0067] FIGS. 7( a) and 7(b) illustrate a linear decay function using the integer based enumeration shown in FIGS. 6( a)-(d). FIG. 7( a) illustrates a decay function which is linearly proportional to n, where n equals 4. In FIG. 7( a), the maximum number used to enumerate the temporal adjacency is 4 for Wt-1. Each pattern at the previous time points (Wt-2, Wt-3, Wt-4) is assigned an integer value which reflects its temporal distance relative to the pattern at time t. In the example illustrated, the linear decay function subtracts one integer value for every time point between the enumerated pattern and the pattern at time t. FIG. 7( b) illustrates one update of the time adjacency matrix using the decay function. In FIG. 7( b), the row representing the pattern at time t is updated at the columns representing patterns at Wt-1, Wt-2, Wt-3 and Wt-4 with values 4, 3, 2 and 1, respectively.
[0068] In addition to temporal proximity, the enumeration of the time adjacency matrix is also weighted to reflect spatial proximity of the patterns in some embodiments. In systems where a large number of potential patterns may exist, it may be necessary to represent new patterns using a set of quantization points or by defining a threshold on the number of input patterns to include in the time-adjacency matrix. As discussed above, quantization points may be determined based upon frequency of occurrence. Quantization points may also be determined using standard machine learning techniques such as principle components analysis. Alternatively, quantization points may be determined using other unsupervised learning methods such as Gaussian clustering. According to the embodiment, the number of quantization points may be parameterized by specifying the number of input patterns to include in the time-adjacency matrix.
[0069] Similarity to existing patterns or quantization points may be determined in a number of ways using conventional methods. In some embodiments, each pattern may be assigned a set of features and similarity may be determined between two patterns using a variety of distance functions. The set of features and distance functions may be specific to the type of pattern used and the application of the pooled groups. For example, patterns comprised of images may be compared using distance functions based on image-based features such as pixel color, luminescence, etc. Patterns comprised of sequences may be compared using distance functions including mismatch values and gapped alignments. Additional similarity metrics and distance functions will be readily apparent to those skilled in the art in light of this disclosure.
[0070] In situations where a new input has a large amount of similarity to more than one existing inputs, the new pattern may be assigned to multiple different existing inputs to represent spatial proximity. Multiple assignment of new inputs is used to enumerate several existing patterns based one new input, instead of creating a new row in the time-adjacency matrix representing every input not previously sensed by the system. According to the embodiment and similarity, the temporal adjacency enumeration value may be multiply divided over several images in any suitable method. If similarity is probabilistically determined using machine learning methods, multiple assignment may correspond to the probability the two images are the same. Alternately, multiple assignment may be based on one or more similarity values.
[0071] The concept of multiple assignment is illustrated in FIG. 8( a). In this illustration, the image of the intersection of perpendicular horizontal and vertical lines has both high similarity to the images of the horizontal line and the image of the vertical line. Both the images of the horizontal line and the vertical line are assigned a value of ½ or 0.5 of a temporal adjacency enumeration value of 1. In FIG. 8( b), the rows corresponding to both the horizontal line image and the vertical line image are updated at time t at the column corresponding to the image of time Wt-1.
[0072] Once the time-adjacency matrix is fully updated, the groups of sensed input patterns are identified. FIG. 9( a) illustrates a simple example of a complete time-adjacency matrix with two distinct groups of input patterns, a set of right corners and a set of left corners. Upon inspection of the time-adjacency matrix it is clear that the two groups distinctly co-occur with each other only (there are never any left corners in the columns enumerated for the right corners) and are separate entities. The only pattern (i.e. image) that has overlap between the two groups is that of the straight line, which temporally co-occurs or is adjacent to both the left corner and the right corners. If the pattern representing the straight line is removed from the time adjacency matrix, the right corners and left corners would form two separate and distinct groups.
[0073] In one embodiment, these groups are identified using hierarchical agglomerative clustering or any method of “hard” clustering wherein each row of the time-adjacency matrix is assigned to only one cluster or group. In one embodiment, the clustering algorithm may learn a number of clusters reflective of the natural groups of input patterns. Alternatively, the clustering algorithm may be take a number of clusters to form as a parameter. The identification of the two groups of input patterns through clustering is illustrated in FIG. 9( b). Suitable clustering methods include single linkage clustering and n-means clustering. In this type of clustering, the temporal adjacencies enumerated in each row of the matrix form the set of values used to pair-wise similarities between the two input patterns. Any type of distance metric can be employed to determine the pair-wise similarities which are then used to cluster or group the rows representing the input patterns.
[0074] In some embodiments, the groups are identified though a method which employs a greedy graph traversal to identify cliques or groups of co-occurring patterns. This method relies on the principle of graph connectivity to identify and remove patterns which have overlap between multiple groups. This concept is illustrated in FIGS. 10( a)-(c). FIG. 10( a) depicts a graphic illustration of a time adjacency matrix wherein each pattern is represented by a node in the graph and each edge between the nodes in the graph indicates temporal adjacencies between the two patterns. In FIG. 10 (b), the two center nodes are identified as a distinct group of having high connectivity to other nodes. Each node is connected to four other nodes, causing both of the center nodes have a high sum of temporal adjacency values due to increased connectivity. However, the two center nodes have low temporal adjacency values with the other nodes, having the largest temporal adjacency value with each other. In FIG. 10( c) the identified group of center nodes (Group 0) is removed from the graph, forming two other distinct sub-graphs representing the remaining groups (Group 1 and 2).
[0075] This method of identifying groups based on the time-adjacency matrix works well because there are several patterns which will be over-represented or sensed more frequently than others, leading to both higher connectivity and also higher likelihood of connectivity (i.e. a high number of temporal adjacencies) with input patterns in multiple groups. Since the rows representing these frequently sensed patterns will be enumerated at each time point, the row representing pattern will have a large value when summed. The inequity in frequency of different patterns produces an uneven distribution over the sum of the rows of the matrix. The sum of the rows of the matrix can then serve as an indicator of the relative frequency of temporal adjacency or “connectivity” of each pattern. This concept is also illustrated in FIG. 9( a) by the straight line having the highest frequency of occurrence while not having the same cause as the right corners or the left corners. In FIG. 10( d) each rows of the matrix in FIG. 9( a) is summed, indicating that the straight line has both the highest temporal connectivity with each other pattern corresponding to its temporal adjacency with multiple groups.
[0076] In one embodiment of the present invention, a greedy algorithm is used to identify groups based on the above discussed connectivity as an indicator of group overlap. The greedy algorithm works by the principle of identifying for each sensed input pattern the nearest neighbors, that is, the sensed input patterns which have the highest frequency of temporal adjacency based on the time-adjacency matrix. In this embodiment, the group is defined as the smallest set of elements in which every element's closest topN neighbors are in the group. The topN neighbors are the highest N neighbors according to the sorted rankings representing temporal adjacency, where N is a numeric value. According to the specific embodiment, the greedy algorithm may be parameterized to allow the user to specify the N number of nearest neighbors of each element to be contained in each group. In one or more embodiments, the topN parameter may have as default value of 1.
[0077] Other parameters to allow the user to control the greedy algorithm include maxGroupSize and minGroupSize. maxGroupSize allows the user to specify a maximum number of elements in a group and provides the user the ability to ensure that not all elements will be grouped into one group. minGroupSize allows the user to specify a minimum number of elements to be contained within each group, thereby allowing the user to control spurious small groups. These parameters are specific to the embodiment discussed, but those skilled in the art will note the utility of using other constraints on group size and connectivity in light of this disclosure.
[0078] FIG. 11 illustrates a flow control of the greedy algorithm according to one embodiment. Initially, the time-adjacency matrix is sorted by rowSum values in order to rank the rows representing different inputs according to their frequency of occurrence ST60. The element with the highest rowSum is selected and added to the group ST62. The neighbors of the first selected element are identified in the time adjacency matrix by determining which elements correspond to enumerated columns with in the row of the selected element ST64. The identified neighbors are checked to determine if all of the neighbors have already been selected ST66. If not, the identified neighbors are then sorted according the numeric value in of their corresponding columns in the time-adjacency metric which represents the temporal adjacency of the each neighbor relative to the first selected element. A number of elements equal to the lesser of the number of neighbors remaining unselected or the topN neighbors is then selected for addition to the group ST68. If the number of elements in the group after addition is less than maxGroupsize the method is repeated with all the elements of the group ST70.
[0079] In one embodiment, a tie breaking heuristic is used to determine which element to add to the group. In one embodiment, the original ranking of rowSum is used to determine the element with the highest frequency of occurrence of the two elements and add it to the group. For example, if the value of topN is 3 and the respective values of the top 4 neighbors are {9,8,4,4} then the neighbor with the value 4 with the higher rowSum is added.
[0080] If all of the neighbors of the elements are already selected, the unselected element with the highest rowSum is selected ST62, it's neighbors are identified ST64, and subsequent steps may be repeated until all of the unselected elements have been selected and grouped. This process of forming a group as outlined in FIG. 11 is performed until all the elements form a part of a group.
[0081] In alternate embodiments, additional parameters such as minGroupSize may be defined and utilized by the greedy algorithm to ensure a minimum number of elements in each group.
Determining Causes of Novel Input
[0082] After an HTM has learned, one or more causes in its world, the HTM may determine causes of novel input using what may be referred to as “inference.” In general, presented with novel sensed input data, an HTM may infer which of its learned causes is/are the source of the novel sensed input data based on statistical comparisons of learned groups and patterns with patterns in the novel sensed input data.
[0083] In one or more embodiments, a cause is determined based on a single sensed input. An HTM node receives the newly sensed input, the HTM node assigns probabilities as to the likelihood that the new sensed input matches each of its learned sensed input groups. Then, as described above, the distribution over the set of groups learned by the HTM node is passed to a higher level node.
[0084] Note that the distribution passed by an HTM node is derived from a “belief” as to the likelihood that each learned cause is the cause of sensed input patterns at the input of the HTM node. A “belief” also includes those messages that are derived from or based on the belief. For example, an HTM node having learned five causes may deterministically assign scores that represent the probability that each of the five learned causes is the cause of sensed input. In one embodiment, the inputs are not exclusively associated with a single cause. Therefore, in some instances one or more scores indicating the probability that learned causes are the cause of the sensed input could equal 1 or a corresponding score which indicates a high likelihood that the learned cause is the cause of the sensed inputs. These scores (or “beliefs” as described above) may be normalized (or un-normalized) and passed to a parent node.
[0085] The parent node may then determine temporal adjacencies among the distributions sent from its child nodes, and then, based on its learned sensed input patterns and groups thereof, pass to a yet higher level node its own belief as to the likelihood that each of its learned causes is the cause of sensed groups at its input. In other words, a parent node forms its own “higher level” belief as to the cause of the sensed input patterns at least partly based on some statistical convergence of the beliefs passed from its child nodes.
[0086] Further, in one or more embodiments of the present invention, one or more prior probabilities may be set manually in addition to or instead of having prior probabilities set via prediction. In other words, an HTM may be manually controlled to anticipate a particular cause or set of causes.
Belief Propagation
[0087] As described above, in one or more embodiments of the present invention, inferring causes of sensed input patterns involves passing beliefs from lower level nodes to higher level nodes. In FIG. 12 , such “belief propagation” is shown in HTM 80 (beliefs indicated with arrows; nodes shown, but not labeled). Generally, as described above, a belief is a vector of values, where each value represents a different cause. A current belief of a node may be a distribution of several causes being at least partially active at the same time. Further, the values in the belief vector may be normalized so that a stronger likelihood of one cause represented in the vector will diminish the likelihood of other causes represented in the vector. Further, note that a meaning of a value representing a cause in a belief vector may not vary depending on what other causes represented in the belief vector are active.
[0088] As described above with reference to FIG. 2 , an HTM is a hierarchy of connected nodes. Each node may be thought as having a belief. In one or more embodiments of the present invention, a belief at one node may influence a belief at another node dependent on, for example, whether the nodes are connected via a conditional probability table (CPT).
[0089] A CPT is a matrix of numbers, where each column of the matrix corresponds to the individual beliefs from one node, and where each row of the matrix corresponds to the individual beliefs from another node. Thus, note that by multiplying a vector representing a belief in a source node by an appropriate CPT results in a vector in the dimension and “language” of beliefs of a destination node. For example, in an HTM-based system designed for operation in a “weather” domain, a lower level node may form a belief about air temperature and have values representing the likelihood of the following causes: “hot”; “warm”; “mild”; “cold”; and “freezing”. A higher level node may form a belief about precipitation and have values representing the likelihood of the following causes: “sunny”; “rain”; “sleet”; and “snow”. Thus, using a CPT, the belief about air temperature in the lower level node may inform the belief about precipitation in the higher level node (and vice-versa). In other words, multiplying the vector representing the belief about air temperature in the lower level node by the CPT results in a vector representing the appropriate belief about precipitation in the higher level node.
[0090] Accordingly, in one or more embodiments of the present invention, belief propagation allows an HTM to infer causes such that each node in the HTM represents a belief that is maximally or optimally consistent with its input. Note that performing inference in such a manner results in ambiguities being resolved as beliefs ascend through the HTM. For example, in an HTM (or part thereof) having a parent node and two child nodes, if (i) the first child node believes with 80% certainty that it is seeing a “dog” and with 20% certainty that it is seeing a “cat” and (ii) the second child=node believes with 80% certainty that it is hearing a “pig” and with 20% certainty that it is hearing a “cat,” then the parent node may decide with relatively high certainty that a “cat” is present and not a “dog” or “pig.” The parent node effectively settled on “cat” because this belief is the only one that is consistent with its inputs, despite the fact the “cat” image and the “cat” sound were not the most likely beliefs of its child nodes.
[0091] Further, as described above, a higher level node in an HTM may pass a “prediction” to a lower level node in the HTM. The “prediction” is a “belief” in that it contains values representing the likelihoods of different causes. The vector representing the belief in the higher level node may be multiplied by an appropriate CPT to inform a belief in the lower level node. Thus, in effect, a higher level node in an HTM uses its learned sequences combined with recent state information (i.e., the current input to the higher level node) to (i) predict what its next belief should be and (ii) then pass the expectation down to one or more lower level nodes in the HTM.
[0092] FIG. 13 shows a flow process in accordance with an embodiment of the present invention. Particularly, FIG. 13 shows in summary the steps of belief propagation described above. Initially, a current node in the HTM receives input (in the form of sensed input patterns or beliefs from lower level nodes) ST82. Based on the received input and any beliefs passed down from a higher level node, the current node forms/adjusts its belief as to the likelihood of causes at its input distributed over its learned causes ST84. This belief is then passed to higher level and/or lower level nodes to inform beliefs at those nodes ST86.
Architecture
[0093] In one or more embodiments of the present invention, at least part of an HTM network may be provided as a software platform. As shown in FIG. 14 , in one or more embodiments of the present invention, an HTM network (nodes shown, but not labeled) 164 may run across several CPUs 166, 168, 170. The CPUs 166, 168, 170 may either be part of a single system (e.g., a single server) or multiple systems. For example, an HTM network may be created in software across several multiprocessor servers, where such a group of servers may be referred to as a “cluster.” The servers in a cluster may be heterogeneous, i.e., the servers may have differing configurations/specifications (e.g., clock speeds, memory size, number of processors per server). Further, the servers may be connected via Ethernet or one or more other networking protocols such as, for example, Infiniband, Myrinet, or over a memory bus. Further, the servers may run any operating system (OS) (e.g., Windows, Linux). In general, each of the servers in a cluster may be responsible for running some portion of an HTM network. The portion of the HTM network dedicated to each server may vary from server to server depending on, for example, the configuration/specification of each server.
[0094] Further, in one or more embodiments of the present invention, the CPUs over which an HTM network runs may be located at a single location (e.g., at a datacenter) or at locations remote from one another.
[0095] As described above, in one or more embodiments of the present invention, at least part of an HTM network may be provided as a software platform. The software executables for creating and running the HTM network may be referred to as being part of a “runtime engine.” As shown in FIG. 15 , a runtime engine 172 of an HTM-based system includes, in addition to the executables for running an HTM network 174, a Supervisor entity 176. In one or more embodiments of the present invention, the Supervisor entity 176 is responsible for, among other things, starting and stopping the HTM network 174 and communicating with external applications (i.e., “tools”) 180, 182, 184, each of which are further described below. However, although the Supervisor entity 176 may be used to start and stop the HTM network 174, it may not be necessary for the Supervisor entity 176 to be running while the HTM network 174 is in operation.
[0096] As shown in FIG. 15 , the Supervisor entity 176 is associated with a net list 178. The Supervisor entity 176 uses a description in the net list 178 to configure the HTM network 174. For example, a description in the net list 178 may specify the distribution of nodes across a given set of CPUs. However, in one or more other embodiments of the present invention, the Supervisor entity 176 may configure an HTM network dynamically if, for example, certain information is not contained in the net list 178. Further, in one or more embodiments of the present invention, the Supervisor entity 176 may read a net list from a date file. Further, in one or more embodiments of the present invention, a net list may be specified interactively by a user using one or more tools 180, 182, 184.
[0097] Further, in one or more embodiments of the present invention, the Supervisor entity 176 may perform global network actions, distribute nodes across CPUs, and/or coordinate CPU activity/behavior. Further, in one or more embodiments of the present invention, the Supervisor entity 176 may enforce licensing restrictions such as those relating to, for example, the number of usable CPUs, license expiration dates, number of user limitations, and/or the ability to load third-party “plug-ins.”
[0098] Further, in one or more embodiments of the present invention, the Supervisor entity 176 may check for software updates on some regular basis. In such embodiments, if there is a software update available, the Supervisor entity 176 may, for example, install the software update and restart the HTM network 174. Further, in one or more embodiments of the present invention, the Supervisor entity 176 may determine and/or select the order in which portions of the HTM network 174 are to be updated.
[0099] Further, in one or more embodiments of the present invention, the Supervisor entity 176 may communicate with one or more CPUs (not shown in FIG. 15 ) running the HTM network 174 using, for example, a private or internal application program interface (API). Further, in one or more embodiments of the present invention, the Supervisor entity 176 and the one or more CPUs (not shown in FIG. 15 ) running the HTM network 174 may all be on the same local area network (LAN).
[0100] Further, in one or more embodiments of the present invention, the Supervisor entity 176 may run on a CPU separate from one or more CPUs (not shown in FIG. 15 ) running the HTM network 174. However, in one or more other embodiments of the present invention, the Supervisor entity 176 may run on a CPU that runs all or part of the HTM network 174.
[0101] FIG. 16 shows at least a portion of an HTM-based system that runs an HTM network 186 on a single CPU 188. In such embodiments of the present invention, an instance of Supervisor entity 190, along with a net list 192, may run on CPU 188. Further, as shown in FIG. 19 , a runtime engine 194 may be composed of the software executables for the HTM network 186, the Supervisor entity 190, and the net list 192.
[0102] FIG. 17 shows at least a portion of an HTM-based system that runs an HTM network 220 on multiple CPUs 222, 224, 226. The CPUs 222, 224, 226 may all be part of the same server (thereby, sharing resources of that server) or they may be distributed over two or more servers. An instance of Supervisor entity 228, along with a net list 230, may run on a separate CPU 232. In such embodiments of the present invention, the Supervisor entity 228 may communicate (across, for example, a switch 234) with instances of “node processing units” (NPUs) 236, 238, 240 running on each of the CPUs 222, 224, 226. Each NPU 236, 238, 240 may be a software component that is responsible for running and/or scheduling a portion (i.e., a “sub-net”) of the HTM network 220 running on the CPU 222, 224, 226 to which the NPU 236, 238, 240 is respectively allocated. At an initial stage, each NPU 236, 238, 240 may receive information from the Supervisor entity 228 describing all or part of the HTM network 220, including information relating to the portion of the HTM network 220 that each NPU 236, 238, 240 will manage. Further, each NPU 236, 238, 240 may be responsible for allocating the memory needed for the nodes, links, and other data structures for the portion of the HTM network 220 for which it is responsible. Further, each NPU 236, 238, 240 may run and/or schedule a portion of the HTM network 220 in some timing relation to at least one other NPU 236, 238, 240.
[0103] Further, in one or more embodiments of the present invention, each NPU 236, 238, 240 may maintain a local net list. A local net list may be used by an NPU to determine when to update one or more nodes, where “updating” a node may include executing an operation of the node and then updating the state of the node. An NPU may perform such updating based on, for example, one or more timestamps of previous updates of one or more nodes, one or more values (e.g., beliefs) of one or more nodes, priorities of one or more nodes, and/or a set of rules for updating nodes.
[0104] Further, as shown in FIG. 17 , a runtime engine 242 may be composed of the software executables for the HTM network 220, the Supervisor entity 228, the net list 230, and the NPUs 236, 238, 240. Moreover, a file server (not shown) may be present to store file information for one or more of the various components shown in FIG. 17 .
[0105] Further, as shown, for example, in FIG. 17 , there is one NPU per CPU running a portion of an HTM network. However, in one or more other embodiments of the present invention, there may be a different relationship as to the number of NPUs allocated per CPU.
[0106] As described above with reference to FIG. 15 (also shown in FIGS. 16 and 17 ), a runtime engine 1720 running HTM network 174 may interface with one or more tools 180, 182, 184. Each of these tools 180, 182, 184 may be used by a user (e.g., a software developer) to, for example, modify, improve, augment, restrict, configure, or otherwise affect an operation or configuration of the HTM network 174 or a CPU on which the HTM network 174 runs. Generally, in one or more embodiments of the present invention, Configurator tool 180 may be used to create and/or configure an HTM network, Trainer tool 182 may be used to create a trained HTM network for a particular application, and/or Debugger tool 184 may be used to debug the operation of an HTM network. Further, in one or more embodiments of the present invention, tools (not shown) may be provided to, for example, monitor/report performance of an HTM network and/or deploy a designed, trained, and/or debugged HTM network as a running application. In general, one or more embodiments of the present invention may use any number and/or types of different tools to interface with an HTM network.
[0107] In one or more embodiments of the present invention, a Supervisor entity (e.g., 176 in FIG. 18 , 190 in FIG. 19 , 228 in FIG. 20 ) may communicate with developer/client tools (e.g., 180, 182, 184 in FIG. 18 ) using a designated Supervisor API. In one or more embodiments of the present invention, the Supervisor API may support Unicode and/or multi-byte character sets.
[0108] Because the developer/client tools may reside at, or otherwise be accessible from, locations remote from a location running a particular HTM network, a Supervisor API may be accessible through, for example, a firewall. One protocol that may be used to facilitate such accessibility involves encoding messages in Extensible Markup Language (XML) and passing them over the Internet (i.e., HTTP transmission). If security is desired or required, then messages may be passed over a secure Internet protocol (e.g., HTTPS transmission). Further, in one or more embodiments of the present invention, if a Supervisor entity (e.g., 176 in FIG. 15 , 190 in FIG. 16 , 228 in FIG. 17 ) and developer/client tools (e.g., 180, 182, 184 in FIG. 15 ) are on the same LAN, messages may be passed using means such as, for example, socket connections and/or pipes.
[0109] As described above, a Supervisor API may interact with developer/client tools. In one or more embodiments of the present invention, the Supervisor API may be used to authenticate one or more client applications attempting to communicate with a Supervisor entity (e.g., 176 in FIG. 15 , 190 in FIG. 16 , 228 in FIG. 17 ). If the client is authenticated, the Supervisor API may return session information to the client and connect the client with the Supervisor entity. The Supervisor API may also disconnect the client from the Supervisor entity.
[0110] Further, in one or more embodiments of the present invention, a net list describing all or part of an HTM network may be passed from a client to a Supervisor entity through a Supervisor API. Further, a Supervisor API may be used to return state information to the client. State information may include, for example, the beliefs at one or more nodes of the HTM network, whether the HTM network is running, paused, or restarting, the number of nodes in all or part of the HTM network, and the number of CPUs actively running portions of the HTM network. Further, a Supervisor API may be accessed to start, pause and restart, or stop an HTM network.
[0111] Further, in one or more embodiments of the present invention, a Supervisor API may be accessed to: return a list of network files that have been stored by a system (e.g., a cluster of servers) used to run an HTM network; load an HTM network from a network file stored locally in a system (e.g., a cluster of servers) usable to run an HTM network; locally save a state of an HTM network in a system (e.g., a cluster of servers) running the HTM network; move one or more nodes from running on one CPU to running on another CPU; turn a debugging feature “on” or “off”; retrieve detailed state information of a component in an HTM network; set a state of a component in an HTM network; instruct an HTM network to pause operations after a specific triggering event, where the triggering event may be completion of one complete iteration of the HTM network, completion of updating a given list of nodes, completion of updating one node on each CPU, reaching a particular time, reaching a particular node value, and/or an occurrence of an error; retrieve statistics regarding operation of an HTM network; request storage of historical data regarding an HTM network; retrieve stored historical data regarding an HTM network; retrieve messages from an event log that, for example, occurred during a particular time frame; execute an OS command; reboot a set of servers used to run an HTM network; and/or request the triggering of an alarm if certain conditions are met.
[0112] Further, in one or more embodiments of the present invention, a Supervisory API may have a “batch command” system. In one or more embodiments of the present invention, a batch command system may be used to execute one or more operations of a Supervisor API in a particular sequence. Further, in one or more embodiments of the present invention, a batch command system may be used to execute one or more of the same commands on more than one node. Further, in one or more embodiments of the present invention, a batch command system may include the capabilities of a full scripting language (e.g., Python, Perl) so that, for example, ‘if’ statements and loops may be performed easily. Note that the use of a full scripting language may allow a user to script complex commands (e.g., commands: train level 1 of hierarchy until states of level 1 nodes reach a given condition; then turn “off” learning in level 1 and train level 2 of hierarchy until states of level 2 nodes reach a given condition, etc.).
[0113] Further, in one or more embodiments of the present invention, the Supervisor API may be arranged to handle a failure of any of the hardware components needed to run a particular HTM network. Further, in one or more embodiments of the present invention, the Supervisor API may handle a software failure (e.g., failure of an NPU instance). Further, in one or more embodiments of the present invention, the Supervisor API may handle a communication establishment error. Further, in one or more embodiments of the present invention, the Supervisor API may handle one or more errors in reading a provided net list describing a particular HTM network.
[0114] In addition to the Supervisor API, an HTM-based system may also have a Node Plug-in API 250 as shown in FIG. 18 . In FIG. 18 (elements labeled similarly to that shown in FIG. 19 ), the Node Plug-in API 250 may be used to create new node types. For example, the Node Plug-in API 250 may be used to interface new hardware for running the HTM network 186 and/or implement, for example, new learning algorithms. In one or more embodiments of the present invention, using the Node Plug-in API 250, one or more “plug-ins” may be dynamically loaded when the HTM network 186 is initialized or rebooted. In such a manner, a functionality of a runtime engine running the HTM network 186 may be extended as further described below.
[0115] While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of the above description, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein. Accordingly, the scope of the invention should be limited only by the attached claims.
Claims
What is claimed is:
1. A computer-implemented method, comprising:
in a learning stage:
receiving a first input data at a first computing module in a hierarchy of computing modules, the first input data including a plurality of first spatial patterns corresponding to different time points;
storing temporal relationships between the plurality of first spatial patterns based on the corresponding time points of the first spatial patterns; and
assigning the first spatial patterns into a plurality of groups based on the temporal relationships of the first spatial patterns, a spatial pattern assigned to a group more likely to be temporally proximate within the first input data to another spatial pattern assigned to the same group compared to a spatial pattern assigned to another group;
in an inference stage subsequent to the learning stage:
detecting second spatial patterns in second input data at the first computing module responsive to receiving the second input data at the first computing module;
generating a first output at the first computing module based on a group to which each of the second spatial patterns was assigned in the learning stage; and
sending the first output to a second computing module higher in the hierarchy compared to the first computing module.
2. The method of claim 1, wherein the second computing module assigns third spatial patterns in the first output to groups based on time points corresponding to each of the third spatial patterns in a learning stage, the second computing module generating a second output in an inference stage responsive to receiving an output for inference from the first computing module.
3. The method of claim 1, further comprising determining a time adjacency value for each combination of two spatial patterns in the first spatial patterns, the time adjacency value increased responsive to detecting the two spatial patterns appearing within a threshold temporal distance from each other, wherein spatial patterns in the first spatial patterns are assigned to the groups based on time adjacency values.
4. The method of claim 3, wherein the temporal adjacency value is weighted by the temporal distance between the two spatial patterns in each combination.
5. The method of claim 3, further comprising:
(a) adding temporal adjacency values of each spatial pattern relative to other spatial patterns;
(b) assigning a spatial pattern with a highest added temporal adjacency value to a first group;
(c) assigning, to the first group, fewer than a predetermined number of spatial patterns having highest temporal adjacency values relative to the spatial pattern with the highest added temporally adjacency value;
(d) assigning, to a nth group, a spatial pattern with a nth highest added temporal adjacency value;
(e) assigning, to the nth group, fewer than the predetermined number of unassigned spatial patterns having highest temporal adjacency values relative to the spatial pattern with the nth highest added temporally adjacency value; and
(f) repeating (d) and (e) until a predetermined condition is met.
6. The method of claim 3, further comprising:
selecting spatial patterns for determining time adjacency values;
for each unselected spatial pattern, determining a selected spatial pattern that is closest to the unselected pattern; and
for each unselected spatial pattern, assigning a weight based on spatial similarity between the unselected spatial pattern and a selected spatial pattern that is most spatially similar to the unselected spatial pattern, wherein time adjacency values for the selected spatial patterns are determined based further on the assigned weight.
7. A computer system including a processor and memory, the computer system implementing a hierarchy of computing modules configured to:
in a learning stage:
receive a first input data at a first computing module in the hierarchy of computing modules, the first input data including a plurality of first spatial patterns corresponding to different time points;
store temporal relationships between the plurality of first spatial patterns based on the corresponding time points of the first spatial patterns; and
assign the first spatial patterns into a plurality of groups based on the temporal relationships of the first spatial patterns, a spatial pattern assigned to a group more likely to be temporally proximate within the first input data to another spatial pattern assigned to the same group compared to a spatial pattern assigned to another group;
in an inference stage subsequent to the learning stage:
detect second spatial patterns in second input data at the first computing module responsive to receiving the second input data at the first computing module;
generate a first output at the first computing module based on a group to which each of the second spatial patterns was assigned in the learning stage; and
send the first output to a second computing module higher in the hierarchy compared to the first computing module.
8. The computer system of claim 7, wherein the hierarchy of computing modules implements a hierarchical temporal network.
9. The computer system of claim 7, wherein the second computing module assigns third spatial patterns in the first output to groups based on time points corresponding to each of the third spatial patterns in a learning stage, the second computing module generating a second output in an inference stage responsive to receiving an output for inference from the first computing module.
10. A computer-readable storage medium structured to store instructions executable by a processor to implement a hierarchy of computing modules, the instructions, when executed cause the processor to:
in a learning stage:
receive a first input data at a first computing module in the hierarchy of computing modules, the first input data including a plurality of first spatial patterns corresponding to different time points;
store temporal relationships between the plurality of first spatial patterns based on the corresponding time points of the first spatial patterns; and
assign the first spatial patterns into a plurality of groups based on the temporal relationships of the first spatial patterns, a spatial pattern assigned to a group more likely to be temporally proximate within the first input data to another spatial pattern assigned to the same group compared to a spatial pattern assigned to another group;
in an inference stage subsequent to the learning stage:
detect second spatial patterns in second input data at the first computing module responsive to receiving the second input data at the first computing module;
generate a first output at the first computing module based on a group to which each of the second spatial patterns was assigned in the learning stage; and
send the first output to a second computing module higher in the hierarchy compared to the first computing module.
11. The medium of claim 10, further comprising instructions to:
determine a time adjacency value for each combination of two spatial patterns in the first spatial patterns, the time adjacency value increased responsive to detecting the two spatial patterns appearing within a threshold temporal distance from each other, wherein spatial patterns in the first spatial patterns are assigned to the groups based on time adjacency values.
12. The medium of claim 10, further comprising instructions to determine a time adjacency value for each combination of two spatial patterns in the first spatial patterns, the time adjacency value increased responsive to detecting the two spatial patterns appearing within a threshold temporal distance from each other, wherein spatial patterns in the first spatial patterns are assigned to the groups based on time adjacency values.
13. The medium of claim 12, wherein each temporal adjacency value is weighted by the temporal distance between the two spatial patterns in each combination.
14. The medium of claim 12, further comprising instructions to:
(a) add temporal adjacency values of each spatial pattern relative to all other spatial patterns;
(b) assign a spatial pattern with a highest added temporal adjacency value to a first group;
(c) assign, to the first group, fewer than a predetermined number of spatial patterns having highest temporal adjacency values relative to the spatial pattern with the highest added temporally adjacency value;
(d) assign a spatial pattern with a nth highest added temporal adjacency value to a nth group;
(e) assign, to the nth group, fewer than the predetermined number of unassigned spatial patterns having highest temporal adjacency values relative to the spatial pattern with the nth highest added temporally adjacency value; and
(f) repeat (d) and (e) until a predetermined condition is met.
15. The method of claim 12, further comprising instructions to:
select spatial patterns for determining the time adjacency value;
for each unselected spatial pattern, determine a selected spatial pattern that is closest to the unselected pattern; and
for each unselected spatial pattern, assign a weight based on spatial similarity between the unselected spatial pattern and a selected spatial pattern that is most spatially similar to the unselected spatial pattern, wherein time adjacency values for the selected spatial patterns are determined based further on the assigned weight.
16. The medium of claim 10, further comprising instructions to assign, by the second computing module, third spatial patterns in the first output to groups based on time points corresponding to each of the third spatial patterns in a learning stage, the second computing module generating a second output in an inference stage responsive to receiving an output for inference from the first computing module.
Patent Citations (46)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4766534(A) | 1988-08-01 | DeBenedictis | Applicant |
| US4845744(A) | 1989-07-01 | DeBenedictis | Applicant |
| US5255348(A) | 1993-10-01 | Nenov | Applicant |
| US5712953(A) | 1998-01-01 | Langs | Applicant |
| US6122014(A) | 2000-09-01 | Panusopone et al. | Applicant |
| US6195622(B1) | 2001-02-01 | Altschuler et al. | Applicant |
| US6400996(B1) | 2002-06-01 | Hoffberg et al. | Applicant |
| US6468069(B2) | 2002-10-01 | Lemelson et al. | Applicant |
| US6567814(B1) | 2003-05-01 | Bankier et al. | Applicant |
| US6625585(B1) | 2003-09-01 | MacCuish et al. | Applicant |
| US6714941(B1) | 2004-03-01 | Lerman et al. | Applicant |
| US6751343(B1) | 2004-06-01 | Ferrell et al. | Applicant |
| US7251637(B1) | 2007-07-01 | Caid et al. | Examiner |
| US7739208(B2) | 2010-06-01 | George et al. | Applicant |
| US2002/0150044(A1) | 2002-10-01 | Wu et al. | Examiner |
| US2003/0069002(A1) | 2003-04-01 | Hunter et al. | Applicant |
| US2003/0123732(A1) | 2003-07-01 | Miyazaki et al. | Applicant |
| US2003/0167111(A1) | 2003-09-01 | Kipersztok et al. | Applicant |
| US2004/0002838(A1) | 2004-01-01 | Oliver et al. | Applicant |
| US2004/0148520(A1) | 2004-07-01 | Talpade et al. | Applicant |
| US2004/0267395(A1) | 2004-12-01 | Discenzo et al. | Applicant |
| US2005/0063565(A1) | 2005-03-01 | Nagaoka et al. | Applicant |
| US2005/0190990(A1) | 2005-09-01 | Burt et al. | Applicant |
| US2005/0222811(A1) | 2005-10-01 | Jakobson et al. | Applicant |
| US2006/0184462(A1) | 2006-08-01 | Hawkins | Applicant |
| US2006/0212444(A1) | 2006-09-01 | Handman et al. | Examiner |
| US2006/0235320(A1) | 2006-10-01 | Tan et al. | Applicant |
| US2006/0248026(A1) | 2006-11-01 | Aoyama et al. | Applicant |
| US2006/0248073(A1) | 2006-11-01 | Jones et al. | Applicant |
| US2006/0253491(A1) | 2006-11-01 | Gokturk et al. | Examiner |
| US2006/0259163(A1) | 2006-11-01 | Hsiung et al. | Applicant |
| US2007/0005531(A1) | 2007-01-01 | George et al. | Applicant |
| US2007/0192264(A1) | 2007-08-01 | Hawkins et al. | Applicant |
| US2007/0192267(A1) | 2007-08-01 | Hawkins et al. | Applicant |
| US2007/0192268(A1) | 2007-08-01 | Hawkins et al. | Applicant |
| US2007/0192269(A1) | 2007-08-01 | Saphir et al. | Applicant |
| US2007/0192270(A1) | 2007-08-01 | Hawkins et al. | Applicant |
| US2007/0228703(A1) | 2007-10-01 | Breed | Examiner |
| US2007/0276774(A1) | 2007-11-01 | Ahmad et al. | Applicant |
| US2008/0059389(A1) | 2008-03-01 | Jaros et al. | Applicant |
| US2009/0006289(A1) | 2009-01-01 | Jaros et al. | Applicant |
| US2010/0207754(A1) | 2010-08-01 | Shostak et al. | Examiner |
| EP1557990(A) | 2005-07-01 | Applicant | |
| WO2006/063291(A) | 2006-06-01 | Applicant | |
| WO2008/067326(A2) | 2008-06-01 | Applicant | |
| WO2009/006231(A) | 2009-01-01 | Applicant |
Non-Patent Literature (97)
- Adelson, E.H. et al., “The Perception of Shading and Reflectance,” Perception as Bayesian Inference, Knill, D.C. et al., ed., 1996, pp. 409-423, Cambridge University Press, UK.Applicant
- Agrawal, R. et al., “Mining Sequential Patterns,” IEEE, 1995, pp. 3-14.Applicant
- Archive of “Numenta Platform for Intelligent Computing Programmer's Guide,” Numenta, Mar. 7, 2007, pp. 1-186, www.numenta.com, [Online] Archived by http://archive.org on Mar. 19, 2007; Retrieved on Aug. 13, 2008] Retrieved from the Internet<URL:http://web.archive.org/web/20070319232606/http://www.numenta.com/for-developers/software/pdf/nupic—prog—guide.pdf>.Applicant
- Becerra, J.A. et al., “Multimodule Artificial Neural Network Architectures for Autonomous Robot Control Through Behavior Modulation,” IWANN 2003, LNCS, J. Mira (Ed.), pp. 169-176, vol. 2687, Springer-Verlag.Applicant
- Csapo, A.B. et al., “Object Categorization Using VFA-Generated Nodemaps and Hierarchical Temporal Memories,” IEEE International Conference on Computational Cybernetics, IEEE, Oct. 7, 2007, pp. 257-262.Applicant
- Demeris, Y. et al., “From Motor Babbling to Hierarchical Learning by Imitation: A Robot Developmental Pathway,” Proceedings of the Fifth International Workshop on Epigenetic Robotics: Modeling Cognitive Development in Robotic Systems, 2005, pp. 31-37.Applicant
- Ding, C.H.Q., “Cluster Merging and Splitting in Hierarchical Clustering Algorithms,” Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), Dec. 9, 2002, pp. 139-146.Applicant
- European Examination Report, European Application No. 05853611.1, Jun. 23, 2008, 4 pages.Applicant
- European Examination Report, European Application No. 07750385.2, Apr. 21, 2009, 8 pages.Applicant
- Felleman, D.J. et al., “Distributed Hierarchical Processing in the Primate Cerebral Cortex,” Cerebral Cortex, Jan./Feb. 1991, pp. 1-47, vol. 1.Applicant
- Fine, S. et al., “The Hierarchical Hidden Markov Model: Analysis and Applications,” Machine Learning, Jul. 1998, pp. 41-62, vol. 32.Applicant
- Foldiak, P., “Learning Invariance from Transformation Sequences,” Neural Computation, 1991, pp. 194-200, vol. 3, No. 2.Applicant
- Fukushima, K., “Neocognitron: A Self-Organizing Neural Network Model for a Mechanism of Pattern Recognition Unaffected by Shift in Position,” Biol. Cybernetics, 1980, pp. 193-202, vol. 36.Applicant
- George, D. et al., “A Hierarchical Bayesian Model of Invariant Pattern Recognition in the Visual Cortex,” Mar. 2005.Applicant
- George, D. et al., “Invariant Pattern Recognition Using Bayesian Inference on Hierarchical Sequences,” Technical Report, Oct. 2004, pp. 1-8.Applicant
- George, D. et al., “A Hierarchical Bayesian Model of Invariant Pattern Recognition in the Visual Cortex,” Proceedings, 2005 IEEE International Joint Conference on Neural Networks, Jul. 31-Aug. 4, 2005, pp. 1812-1817, vol. 3.Applicant
- Gottschalk, K. et al., “Introduction to Web Services Architecture,” IBM Systems Journal, 2002, pp. 170-177, vol. 41, No. 2.Applicant
- Guinea, D. et al., “Robot Learning to Walk: An Architectural Problem for Intelligent Controllers,” Proceedings of the 1993 International Symposium on Intelligent Control, Chicago, IL, IEEE, Aug. 1993, pp. 493-498.Applicant
- Guo, C-E. et al., “Modeling Visual Patterns by Integrating Descriptive and Generative Methods,” International Journal of Computer Vision, May 29, 2003, 28 pages, vol. 53, No. 1.Applicant
- Han, K. et al., “Automated Robot Behavior Recognition Applied to Robotic Soccer,” in Proceedings of the IJCAI-99 Workshop on Team Behaviors and Plan Recognition, 1999, 6 pages.Applicant
- Hasegawa, Y. et al., “Learning Method for Hierarchical Behavior Controller,” Proceedings of the 1999 IEEE International Conference on Robotics & Automation, May 1999, pp. 2799-2804.Applicant
- Hawkins, J. et al., “Hierarchical Temporal Memory Concepts, Theory and Terminology,” Numenta, Jan. 27, 2007, pp. 1-20.Applicant
- Hawkins, J. et al., “Hierarchical Temporal Memory Concepts, Theory and Terminology,” Numenta, Mar. 27, 2007 [Online] [Retrieved on Oct. 7, 2008] Retrieved from the Internet<URL:http://www.numenta.com/Numenta—HTM—Concepts.pdf>.Applicant
- Hawkins, J. et al., “Hierarchical Temporal Memory Concepts, Theory and Terminology,” Numenta, May 10, 2006 [Online] [Retrieved on Jul. 16, 2008] Retrieved from the Internet<URL:http://www.neurosecurity.com/whitepapers/Numenta—HTM—Concepts.pdf>.Applicant
- Hawkins, J. et al., “On Intelligence,” Sep. 2004, pp. 23-29, 106-174, 207-232, Times Books, Henry Holt and Company, New York, NY 10011.Applicant
- Hawkins, J., “Why Can't a Computer Be More Like a Brain?” IEEE Spectrum, Apr. 1, 2007, pp. 21-26, vol. 44, No. 4, IEEE Inc., New York, US.Applicant
- Hernandez-Gardiol, N. et al., “Hierarchical Memory-Based Reinforcement Learning,” Proceedings of Neural Information Processing Systems, 2001, 7 pages.Applicant
- Hinton, G.E. et al., “The “Wake-Sleep” Algorithm for Unsupervised Neural Networks,” Science, May 26, 1995, pp. 1158-1116, vol. 268.Applicant
- Hoey, J., “Hierarchical Unsupervised Learning of Facial Expression Categories,” 2001, IEEE, 0-7695-1293-3, pp. 99-106.Applicant
- Hyvarinen, A. et al., “Bubbles: A Unifying Framework for Low-Level Statistical Properties of Natural Image Sequences,” J. Opt. Soc. Am. A., 2003, pp. 1237-1252, vol. 20, No. 7.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2007/003544, Jun. 16, 2008, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2005/044729, May 14, 2007, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US07/85661, Jun. 13, 2008, 7 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US08/55389, Jul. 25, 2008, 8 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US08/55352, Aug. 1, 2008, 8 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2008/054631, Aug. 18, 2008, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2008/068435, Oct. 31, 2008, 14 pages.Applicant
- International Search Report and Written Opinion, International Application No. PCT/US2009/035193, Apr. 22, 2009, 14 pages.Applicant
- Isard, M. et al., “Icondensation: Unifying Low-Level and High-Level Tracking in a Stochastic Framework,” Lecture Notes in Computer Science 1406, Burkhardt, H. et al., ed., 1998, pp. 893-908, Springer-Verlag, Berlin.Applicant
- Lee, T.S. et al., “Hierarchical Bayesian Inference in the Visual Cortex,” Journal of the Optical Society of America, Opt. Image. Sci. Vis., Jul. 7, 2003, pp. 1434-1448, vol. 20, No. 7.Applicant
- Lenser, S. et al., “A Modular Hierarchical Behavior-Based Architecture,” RoboCup 2001, LNAI 2377, 2002, Birk, A. et al, (Eds.), pp. 423-428, Springer-Verlag, Berlin, Heidelberg.Applicant
- Lewicki, M.S. et al., “Bayesian Unsupervised Learning of Higher Order Structure,” Moser, M.C. et al., ed., Proceedings of the 1996 Conference in Advances in Neural Information Processing Systems 9, 1997, pp. 529-535.Applicant
- Murphy, K. et al., “Using the Forest to See the Trees: A Graphical Model Relating Features, Objects and Scenes,” Advances in Neural Processing System, 2004, vol. 16.Applicant
- Murray, S.O. et al., “Shaper Perception Reduces Activity in Human Primary Visual Cortex,” Proceedings of the Nat. Acad. Of Sciences of the USA, Nov. 2002, pp. 15164-151169, vol. 99, No. 23.Applicant
- “Numenta Node Algorithms Guide NuPIC 1.6,” Numenta, Jun. 13, 2008, pp. 1-6.Applicant
- “Numenta Node Algorithms Guide NuPIC 1.6,” Numenta, Jul. 22, 2008, pp. 1-7.Applicant
- Olshausen, B.A. et al., “A Neurobiological Model of Visual Attention and Invariant Pattern Recognition Based on Dynamic Routing Information,” Jnl. Of Neuroscience, Nov. 1993.Applicant
- Pearl, J., “Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference,” 1988, pp. 143-223, Morgan Kaufmann Publishers, Inc.Applicant
- Riesenhuber, M. et al., “Hierarchical Models of Object Recognition in Cortex,” Nature Neuroscience, Nov. 1999, pp. 1019-1025, vol. 2, No. 11.Applicant
- Sinha, P. et al., “Recovering Reflectance and Illumination in a World of Painted Polyhedra,” Fourth International Conference on Computer Vision, Berlin, May 11-14, 1993, pp. 156-163, IEEE Computer Society Press, Los Alamitos, CA.Applicant
- Stringer, S.M. et al., “Invariant Object Recognition in the Visual System with Novel Views of 3D Objects,” Neural Computation, Nov. 2002, pp. 2585-2596, vol. 14, No. 11.Applicant
- Sudderth, E.B. et al., “Nonparametric Belief Propagation and Facial Appearance Estimation,” AI Memo 2002-020, Dec. 2002, pp. 1-10, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA.Applicant
- Thomson, A.M. et al., “Interlaminar Connections in the Neocortex,” Cerebral Cortex, 2003, pp. 5-14, vol. 13, No. 1.Applicant
- Tsukada, M, “A Theoretical Model of the Hippocampal-Cortical Memory System Motivated by Physiological Functions in the Hippocampus”, Proceedings of the 1993 International Joint Conference on Neural Networks, Oct. 25, 1993, pp. 1120-1123, vol. 2, Japan.Applicant
- Van Essen, D.C. et al., “Information Processing Strategies and Pathways in the Primate Visual System,” An Introduction to Neural and Electronic Networks, 1995, 2nd ed.Applicant
- Vlajic, N. et al., “Vector Quantization of Images Using Modified Adaptive Resonance Algorithm for Hierarchical Clustering”, IEEE Transactions on Neural Networks, Sep. 2001, pp. 1147-1162, vol. 12, No. 5.Applicant
- Wiskott, L. et al., “Slow Feature Analysis: Unsupervised Learning of Invariances,” Neural Computation, 2002, pp. 715-770, vol. 14, No. 4.Applicant
- Yedidia, J.S. et al., “Understanding Belief Propagation and its Generalizations,” Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, WA, Aug. 4-10, 2001, 35 pages.Applicant
- Zemel, R.S., “Cortical Belief Networks,” Computational Models for Neuroscience, Hecht-Nielsen, R. et al., ed., 2003, pp. 267-287, Springer-Verlag, New York.Applicant
- “Zeta1 Algorithms Reference, Version 1.0,” Numenta Inc., Mar. 1, 2007, pp. 1-36.Applicant
- “Zeta1 Algorithms Reference, Version 1.2,” Numenta Inc., Jun. 8, 2007, pp. 1-38.Applicant
- “Zeta1 Algorithms Reference, Version 1.3,” Numenta Inc., Aug. 22, 2007, pp. 1-41.Applicant
- “Zeta1 Algorithms Reference, Version 1.5,” Numenta Inc., Aug. 24, 2007, pp. 1-45.Applicant
- George, D. et al., “The HTM Learning Algorithm,” [Online] [Retrieved on Jan. 1, 2009] Retrieved from the Internet<URL:http://www.numenta.com/for-developers/education/Numenta—HTM—Learning—Algos.pdf>.Applicant
- PCT International Search Report and Written Opinion, PCT Application No. PCT/US2009/047250, Sep. 25, 2009, 13 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,456, Mar. 20, 2009, 9 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,456, Nov. 6, 2008, 7 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,456, May 7, 2008, 14 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,454, Mar. 30, 2009, 11 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,454, Jun. 3, 2008, 13 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,457, Apr. 21, 2009, 6 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,457, Nov. 20, 2008, 8 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,457, May 6, 2008, 14 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,457, Aug. 24, 2007, 10 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, Jul. 29, 2009, 43 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, Jan. 9, 2009, 38 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, May 15, 2008, 37 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, Oct. 30, 2007, 34 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, May 29, 2007, 36 pages.Applicant
- U.S. Office Action, U.S. Appl. No. 11/147,069, Jan. 9, 2007, 27 pages.Applicant
- Fine, S. et al., “The Hierarchical Hidden Markov Model: Analysis and Applications,” Machine Learning, 1998, pp. 41-62, vol. 32, Kluwer Academic Publishers, Boston.Applicant
- Kuenzer, A. et al., “An Empirical Study of Dynamic Bayesian Networks for User Modeling,” Proc. of the UM 2001 Workshop on Machine Learning, pages.Applicant
- Dimitrova, N. et al., “Motion Recovery for Video Content Classification,” ACM Transactions on Information Systems, Oct. 1995, pp. 408-439, vol. 13, No. 4.Applicant
- Dolin, R. et al., “Scalable Collection Summarization and Selection,” Association for Computing Machinery, 1999, pp. 49-58.Applicant
- Guerrier, P., “A Generic Architecture for On-Chip Packet-Switched Interconnections,” Association for Computing Machinery, 2000, pp. 250-256.Applicant
- Kim, J. et al., “Hierarchical Distributed Genetic Algorithms: A Fuzzy Logic Controller Design Application,” IEEE Expert, Jun. 1996, pp. 76-84.Applicant
- Mishkin, M. et al., “Hierarchical Organization of Cognitive Memory,” Phil. Trans. R. Soc. B., 1997, pp. 1461-1467, London.Applicant
- Park, S. et al., “Recognition of Two-person Interactions Using a Hierarchical Bayesian Network,” ACM SIGMM International Workshop on Video Surveillance (IWVS) 2003, pp. 65-76, Berkeley, USA.Applicant
- Poppel, E., “A Hierarchical Model of Temporal Perception,” Trends in Cognitive Sciences, May 1997, pp. 56-61, vol. 1, No. 2.Applicant
- Tsinarakis, G.J. et al. “Modular Petri Net Based Modeling, Analysis and Synthesis of Dedicated Production Systems,” Proceedings of the 2003 IEEE International Conference on Robotics and Automation, Sep. 14-19, 2003, pp. 3559-3564, Taipei, Taiwan.Applicant
- Tsinarakis, G.J. et al. “Modular Petri Net Based Modeling, Analysis, Synthesis and Performance Evaluation of Random Topology Dedicated Production Systems,” Journal of Intelligent Manufacturing, 2005, vol. 16, pp. 67-92.Applicant
- United States Office Action, U.S. Appl. No. 11/680,197, Mar. 23, 2010, twelve pages.Applicant
- Wu, G. et al., “Multi-camera Spatio-temporal Fusion and Biased Sequence-data Learning for Security Surveillance,” Association for Computing Machinery, 2003, pp. 528-538.Applicant
- U.S. Office Action, U.S. Appl. No. 11/622,455, Apr. 21, 2010, 12 pages.Applicant
- European Patent Office Communication, European Patent Application No. 08796030.08, Dec. 6, 2010, seven pages.Applicant
- European Patent Office Communication, European Patent Application No. 07750385.2 Dec. 6, 2010, eight pages.Applicant
- Lim, K. et al., “Estimation of Occlusion and Dense Motion Fields in a Bidirectional Bayesian Framework,” IEEE Transactions on Pattern Analysis and Machine Intelligence, May 2002, pp. 712-718, vol. 24, No. 5.Applicant