Magnetic Resonance Imaging Image under Low-Rank Matrix Denoising Algorithm in the Diagnosis and Evaluation of Tibial Plateau Fracture Combined with Meniscus Injury

This study was carried out to explore the diagnostic effect of magnetic resonance imaging (MRI) based on the low-rank matrix (LRM) denoising algorithm under gradient sparse prior for the tibial plateau fracture (TPF) combined with meniscus injury (TPF + MI). In this study, the prior information of the noise-free MRI image block was combined with the self-phase prior, the gradient prior of MRI was introduced to eliminate the ringing effect, and a new MRI image denoising algorithm was constructed, which was compared with the anisotropic diffusion fusion (ADF) algorithm. After that, the LRM denoising algorithm based on gradient sparse prior was applied to the diagnosis of 112 patients with TPF + MI admitted to hospital, and the results were compared with those of the undenoised MRI image. Then, the incidence of patients with all kinds of different meniscus injury parting was observed. A total of 66 cases (58.93%) of meniscus tears (MT) were found, including 56 cases (50.00%) of lateral meniscus (LM), 10 cases (8.93%) of medial meniscus (MM), 16 cases (14.29%) of meniscus contusion (MC), and 18 cases (16.07%) of meniscus degenerative injury (MDI). The incidences of MI in Schatzker subtypes were 0%, 53.33% (24/45), 41.67% (5/12), 76.47% (13/17), 78.94% (15/19), and 23.53% (4/17), showing no statistically significant difference ( P > 0.05 ), but the incidence of MT was 54.46% (61/112), which was greatly higher than that of MC (15.18% (17/112)), and the difference was statistically obvious ( P < 0.05 ). The diagnostic specificity (93.83%) and accuracy (95.33%) of denoised MRI images were dramatically higher than those of undenoised MRI images, which were 78.34% and 71.23%, respectively, showing statistically observable differences ( P < 0.05 ). In short, the algorithm in this study showed better denoising performance with the most retained image information. In addition, denoising MRI images based on the algorithm constructed in this study can improve the diagnostic accuracy of MI.

A spatial-temporal topic model with sparse prior and RNN prior for bursty topic discovering in social networks

With the rapid growth of social network users, the social network has accumulated massive social network topics. However, due to the randomness of content, it becomes sparse and noisy, accompanied by many daily chats and meaningless topics, which brings challenges to bursty topics discovery. To deal with these problems, this paper proposes the spatial-temporal topic model with sparse prior and recurrent neural networks (RNN) prior for bursty topic discovering (ST-SRTM). The semantic relationship of words is learned through RNN to alleviate the sparsity. The spatial-temporal areas information is introduced to focus on bursty topics for further weakening the semantic sparsity of social network context. Besides, we introduced the “Spike and Slab” prior to decouple the sparseness and smoothness. Simultaneously, we realized the automatic discovery of social network bursts by introducing the burstiness of words as the prior and binary switching variables. We constructed multiple sets of comparative experiments to verify the performance of ST-SRTM by leveraging different evaluation indicators on real Sina Weibo data sets. The experimental results confirm the superiority of our ST-SRTM.

Sparse connectivity for MAP inference in linear models using sister mitral cells

Sensory processing is hard because the variables of interest are encoded in spike trains in a relatively complex way. A major goal in studies of sensory processing is to understand how the brain extracts those variables. Here we revisit a common encoding model in which variables are encoded linearly. Although there are typically more variables than neurons, this problem is still solvable because only a small number of variables appear at any one time (sparse prior). However, previous solutions require all-to-all connectivity, inconsistent with the sparse connectivity seen in the brain. Here we propose an algorithm that provably reaches the MAP (maximum a posteriori) inference solution, but does so using sparse connectivity. Our algorithm is inspired by the circuit of the mouse olfactory bulb, but our approach is general enough to apply to other modalities. In addition, it should be possible to extend it to nonlinear encoding models.