Using Spatial Pooler of Hierarchical Temporal Memory to classify noisy videos with predefined complexity

Abstract

This paper examines the performance of a Spatial Pooler (SP) of a Hierarchical Temporal Memory (HTM) in the task of noisy object recognition. To address this challenge, a dedicated custom-designed system based on the SP, histogram calculation module and SVM classifier was implemented. In addition to implementing their own version of HTM, the authors also designed a profiler which is capable of tracing all of the key parameters of the system. This was necessary, since an analysis and monitoring of the system performance turned out to be extremely difficult using conventional testing and debugging tools.The system was initially trained on artificially prepared videos without noise and then tested with a set of noisy video streams. This approach was intended to mimic a real life scenario where an agent or a system trained to deal with ideal objects faces a task of classifying distorted and noisy ones in its regular working conditions.The authors conducted a series of experiments for various macro parameters of HTM SP, as well as for different levels of video reduction ratios. The experiments allowed them to evaluate the performance of two different system setups (i.e. 'Multiple HTMs' and 'Single HTM') under various noise conditions with 32-frame video files. Results of all the tests were compared to SVM baseline setup.It was determined that the system featuring SP is capable of achieving approximately 12 times the noise reduction for a video signal with with distorted bits accounting for 13% of the total. Furthermore, the system featuring SP performed better also in the experiments without a noise component and achieved a max F1 score of 0.96. The experiments also revealed that a rise of column and synapse number of SP has a substantial impact on the performance of the system. Consequently, the highest F1 score values were obtained for 256 and 4096 synapses and columns respectively. It is worth noting that 'Multiple HTMs' setup outperforms the 'Single HTM' one. Nevertheless, this is achieved at the expense of increased computational demands.

The model of an anomaly detector for HiLumi LHC magnets based on Recurrent Neural Networks and adaptive quantization

“…The third kind of the anomaly detection systems adapts online which means that all the novelties which are detected are incorporated in the model [40,41]. Next time the same phenomenon occurs in the input signal to the system, it will not be considered as an anomaly.…”

Anomaly Detection in Meteorological Data Using a Hierarchical Temporal Memory Model: A Study on the Case of Kazakhstan

“…The primary data structure in HTM is sparse distributed representation (SDR) [19] [56] [57]. The HTM methodology for processing TS data includes essential components such as Encoder, Spatial Pooling (SP), and Temporal Memory (TM) [58]. The encoder part normalizes the data by converting the input data into binary representations called fixed-length SDRs [59].…”

A Temporal Pool Learning Algorithm Based on Location Awareness

“…Krestinskaya et al develop circuits and systems to achieve the optimized design of an HTM SP, an HTM TM, and a memristive analog pattern matcher for pattern recognition applications [13]. SPL abstracts the input features through a hierarchical structure [14], which makes HTM have wideranging applications in recognition and classification, such as data classification [15], face recognition [16], speech recognition [17], biometric recognition [18], detection of multiple objects located in clutter color images [19], handwriting recognition [20], action recognition [21], gait recognition and understanding [22], and natural language processing [23].…”