Compression detects changes in spiking neural data from cortical lesions

Motor cortical points are linked by intrinsic horizontal connections having a recurrent network topology. However, it is not known whether neural activity can propagate over the area covered by these intrinsic connections and whether there are spatial anisotropies of synaptic strength, as opposed to synaptic density. Moreover, the mechanisms by which activity spreads have yet to be determined. To address these issues, an 8 × 8 microelectrode array was inserted in the forelimb area of the cat motor cortex (MCx). The centre of the array had a laser etched hole ∼500 μm in diameter. A microiontophoretic pipette, with a tip diameter of 2-3 μm, containing bicuculline methiodide (BIC) was inserted in the hole and driven to a depth of 1200-1400 μm from the cortical surface. BIC was ejected for ∼2min from the tip of the micropipette with positive direct current ranging between 20 and 40 nA in different experiments. This produced spontaneous nearly periodic bursts (0.2-1.0 Hz) of multi-unit activity in a radius of about 400 μm from the tip of the micropipette. The bursts of neural activity spread at a velocity of 0.11-0.24 ms⁻¹ (mean=0.14 mm ms⁻¹, SD=0.05)with decreasing amplitude.The area activated was on average 7.22 mm² (SD=0.91 mm²), or ∼92% of the area covered by the recording array. The mode of propagation was determined to occur by progressive recruitment of cortical territory, driven by a central locus of activity of some 400 μm in radius. Thus, activity did not propagate as a wave. Transection of the connections between the thalamus and MCx did not significantly alter the propagation velocity or the size of the recruited area, demonstrating that the bursts spread along the routes of intrinsic cortical connectivity. These experiments demonstrate that neural activity initiated within a small motor cortical locus (≤ 400 μm in radius) can recruit a relatively large neighbourhood in which a variety of muscles acting at several forelimb joints are represented. These results support the hypothesis that the MCx controls the forelimb musculature in an integrated and anticipatory manner based on a recurrent network topology

Telemetric information is great in size, requiring extra room and transmission time. There is a significant obstruction of storing or sending telemetric information. Lossless data compression (LDC) algorithms have evolved to process telemetric data effectively and efficiently with a high compression ratio and a short processing time. Telemetric information can be packed to control the extra room and association data transmission. In spite of the fact that different examinations on the pressure of telemetric information have been conducted, the idea of telemetric information makes pressure incredibly troublesome. The purpose of this study is to offer a subsampled and balanced recurrent neural lossless data compression (SB-RNLDC) approach for increasing the compression rate while decreasing the compression time. This is accomplished through the development of two models: one for subsampled averaged telemetry data preprocessing and another for BRN-LDC. Subsampling and averaging are conducted at the preprocessing stage using an adjustable sampling factor. A balanced compression interval (BCI) is used to encode the data depending on the probability measurement during the LDC stage. The aim of this research work is to compare differential compression techniques directly. The final output demonstrates that the balancing-based LDC can reduce compression time and finally improve dependability. The final experimental results show that the model proposed can enhance the computing capabilities in data compression compared to the existing methodologies.

A novel method of recording neural activity from the rodent medial prefrontal cortex reveals that the medial prefrontal cortex is composed of functionally distinct subregions that process economic decision information differentially along a dorso-ventral gradient.

Reliability and Representational Bandwidth in the Auditory Cortex

The article considers the relevance of the development of lossless image compression and transmission algorithms and their application for creating transport video surveillance systems. A brief overview of lossless transport image compression methods is provided. We propose a method for compressing transport plots based on the pyramid-recursive method of splitting the source image into polygons of various shapes and sizes. We consider two new algorithms for implementing the proposed method that are fundamentally different from each other: with a transition to the spectral region and without a transition to the spectral region of the original signal to ensure lossless compression. The results of testing various well-known lossless compression algorithms are analyzed: series length, Huffman, and arithmetic encoding, and compared with the proposed algorithms. It is shown that the proposed algorithms are more efficient in terms of compression ratio (2—3 times) compared to the known ones, while the computational complexity increases approximately by more than 3-4 times.

Lossless image compression plays a vital role in improving data storage and transmission efficiency without compromising data integrity. However, the throughput of current lossless compression and decompression systems remains limited and is unable to meet the growing demands of high-speed data transfer. To address this challenge, a previously proposed hybrid lossless compression and decompression algorithm has been implemented on an FPGA platform. This implementation significantly improves processing speed and efficiency. A multi-core system architecture is introduced, utilizing the processing system (PS) and programmable logic (PL) of a Xilinx Zynq-706 evaluation board. The PS handles coordination. The PL performs compression and decompression using multiple cores. Each core can process up to eight image tiles at the same time. The compression process is designed with a four-stage pipeline, and decompression is managed by a dynamic state machine to ensure optimized control. The parallel architecture and innovative algorithm design enable high-throughput operation, achieving compression and decompression rates of 480 Msubpixels/s and 372 Msubpixels/s, respectively. Through this work, a practical and high-performance solution for real-time lossless image compression is demonstrated.

Long, naturalistic stimuli are effective in evoking meaningfully differential neural response patterns between groups. However, the resulting timeseries data often have a high number of features compared to a limited sample size, increasing the likelihood of overfitting and reducing predictive power. This paper introduces multi-timepoint pattern analysis (MTPA) as a temporal dimension reduction approach for improving prediction accuracy when building models with long neural timeseries data. Using feature selection with elastic net regression, MTPA identifies predictive neural patterns while preserving the temporal structure and interpretability of the data. Across two experiments with distinct populations and objectives, MTPA demonstrated consistent advantages over approaches using principal component analysis, windowed averaging, and no dimension reduction. Experiment 1 predicted persistent work-related psychological states in business professionals, achieving accuracies up to 79.1%. Experiment 2 predicted cognitive load and narrative context during video viewing in undergraduates, with accuracies up to 66.5%. These findings suggest that MTPA may be a useful tool for analysing neural data from extended naturalistic designs, enabling researchers to improve prediction accuracy across diverse outcomes and obtain new insights into the temporal dynamics of neural responses.

Dimension reduction on neural activity paves a way for unsupervised neural decoding by dissociating the measurement of internal neural state repetition from the measurement of external variable tuning. With assumptions only on the smoothness of latent dynamics and of internal tuning curves, the Poisson Gaussian-process latent variable model (P-GPLVM) (Wu et al., 2017) is a powerful tool to discover the low-dimensional latent structure for high-dimensional spike trains. However, when given novel neural data, the original model lacks a method to infer their latent trajectories in the learned latent space, limiting its ability for estimating the internal state repetition. Here, we extend the P-GPLVM to enable the latent variable inference of new data constrained by previously learned smoothness and mapping information. We also describe a principled approach for the constrained latent variable inference for temporally-compressed patterns of activity, such as those found in population burst events (PBEs) during hippocampal sharp-wave ripples, as well as metrics for assessing whether the inferred new latent variables are congruent with a previously learned manifold in the latent space. Applying these approaches to hippocampal ensemble recordings during active maze exploration, we replicate the result that P-GPLVM learns a latent space encoding the animal’s position. We further demonstrate that this latent space can differentiate one maze context from another. By inferring the latent variables of new neural data during running, certain internal neural states are observed to repeat, which is in accordance with the similarity of experiences encoded by its nearby neural trajectories in the training data manifold. Finally, repetition of internal neural states can be estimated for neural activity during PBEs as well, allowing the identification for replay events of versatile behaviors and more general experiences. Thus, our extension of the P-GPLVM framework for unsupervised analysis of neural activity can be used to answer critical questions related to scientific discovery.

Circadian difference in firing rate of isolated rat suprachiasmatic nucleus neurons

Daily preferential use was shown to alter physiological and mechanical properties of skeletal muscle. This study was aimed at revealing differences in the control strategy of muscle pairs in humans who show a clear preference for one hand. We compared the motor unit (MU) recruitment and firing behavior in the first dorsal interosseous (FDI) muscle of both hands in eight male volunteers whose hand preference was evaluated with the use of a standard questionnaire. Myoelectric signals were recorded while subjects isometrically abducted the index finger at 30% of the maximal voluntary contraction (MVC) force. A myoelectric signal decomposition technique was used to accurately identify MU firing times from the myoelectric signal. In MUs of the dominant hand, mean values for recruitment threshold, initial firing rate, average firing rate at target force, and discharge variability were lower when compared with the nondominant hand. Analysis of the cross-correlation between mean firing rate and muscle force revealed cross-correlation peaks of longer latency in the dominant hand than in the nondominant side. This lag of the force output with respect to fluctuations in the firing behavior of MUs is indicative of a greater mechanical delay in the dominant FDI muscle. MVC force was not significantly different across muscle pairs, but the variability of force at the submaximal target level was higher in the nondominant side. The presence of lower average firing rates, lower recruitment thresholds, and greater firing rate/force delay in the dominant hand is consistent with the notion of an increased percentage of slow twitch fibers in the preferentially used muscle, allowing twitch fusion and force buildup to occur at lower firing rates. It is suggested that a lifetime of preferred use may cause adaptations in the fiber composition of the dominant muscle such that the mechanical effectiveness of its MUs increased.

Dimensionality reduction as a preprocessing step to machine learning is effective in removing irrelevant and redundant data, increasing learning accuracy, and improving result comprehensibility. However, the recent increase of dimensionality of data poses a severe challenge to many existing feature selection and feature extraction methods with respect to efficiency and effectiveness. In the field of machine learning and pattern recognition, dimensionality reduction is important area, where many approaches have been proposed. In this paper, some widely used feature selection and feature extraction techniques have analyzed with the purpose of how effectively these techniques can be used to achieve high performance of learning algorithms that ultimately improves predictive accuracy of classifier. An endeavor to analyze dimensionality reduction techniques briefly with the purpose to investigate strengths and weaknesses of some widely used dimensionality reduction methods is presented.

In many bandwidth constrained applications, lossless compression may be unnecessary, as only two to three times of compression can be achieved. An alternative way to save bandwidth is to adopt perceptually lossless compression, which can attain eight times or more compression without loss of important information. In this research, our first objective is to compare and select the best compression algorithm in the literature to achieve 8:1 compression ratio with perceptually lossless compression for still images. Our second objective is to demonstrate error concealment algorithms that can handle corrupted pixels due to transmission errors in communication channels. We have clearly achieved the above objectives using realistic images.

An antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary alphabet. This paper proposes on-line ECG lossless compression for a given data on a finite alphabet. The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do. Moreover, the proposed algorithm work in real-time. Its effectiveness is demonstrated by simulation results.

This brief presents a VLSI implementation of an efficient lossless compression scheme for electrocardiogram (ECG) data encoding to save storage space and reduce transmission time. As compression algorithm is able to save storage space and reduce transmission time, this opportunity has been seized by implementing memory-less design while working at a high clock speed in VLSI. ECG compression algorithm comprises two parts: an adaptive linear prediction technique and content-adaptive Golomb Rice code. An efficient and low power VLSI implementation of compression algorithm has been presented. To improve the performance, the proposed VLSI design uses bit shifting operations as a replacement for the different arithmetic operations. VLSI implementation has been applied to the MIT-BIH arrhythmia database which is able to achieve a lossless bit compression rate of 2.77. Moreover, VLSI architecture contains 3.1 K gate count and core of the chip consumes 27.2 nW of power while working at 1 KHz frequency. The core area is 0.05 mm2 in 90 nm CMOS process.

INTRODUCTION: Genetic data plays a key role in the healthcare area in specific, but they are typically very large in size. Many research shows that absence of DNA information at the right time is one of the major causes of error in the healthcare area. The more genomics information that analysts secure, the better the prospects for individual and general wellbeing. Persevering and retrieving genetic information in the right form within the given time is a big challenge in the field of Healthcare. Effectively, pre-birth DNA tests screen for formative variations from the norm. Before long, patients will have their blood sequenced to detect any nonhuman DNA that may flag an irresistible illness. Later on, somebody managing malignancy will most likely track the movement of the sickness by having the DNA and RNA of single cells from various tissues sequenced every day. DNA sequencing of whole population will give a complete and better prediction of population wellbeing.OBJECTIVES: Hereditary data is growing exponentially; hence it is hard to deal with the consistently developing hereditary database. The human genome in its base configuration occupies almost thirty terabyte of storage space. Computational assets are constrained. Not just storage, transmission abilities and run time memory is likewise constrained. Data Compression is a test when the hereditary information is exponentially expanding. It is critical to save the integrity of hereditary information while packing it. Hence the main objective of this paper is to develop a lossless DNA compression algorithm that not only gives better compression but also help in retrieval of Information for efficient use in the area of Healthcare.METHODS: In this paper a lossless hereditary data compression method is being proposed. The proposed calculation works in a horizontal mode and utilization a reference based substitution technique for compression. The principle thought of this paper is in the kind of similarity scanned. All the predominant hereditary Compression methods search for similarity within the chromosome. These calculations either pursue flat mode or vertical mode for accomplishing compression. But whichever method the existing genetic compression algorithms use, they are all based on searching similarities within the chromosome i.e. they exploit only inter chromosomal similarities. The current studies focus will show that compression ratio achieved by analyzing individual chromosome is always less than the method in which we analyze and compress intra chromosomal similarities.RESULTS: This study shows that by simply using exactly matching repeats amongst all the chromosomes of the same genome, not only the compression ratio is improving but also a detailed study of all the similarities and differences between two genomes of the same species can be conducted.CONCLUSION: In this study, a new compression algorithm is being proposed for compressing DNA. Along with Inter chromosomal similarities, Intra chromosomal similarities are considered for this method. The results clearly shows that intra chromosomal matches are bigger and more than inter chromosomal matches which helps us to achieve better compression ratio.