Spatial temporal Fourier single-pixel imaging.

Generally, the imaging quality of Fourier single-pixel imaging (FSI) will severely degrade while achieving high-speed imaging at a low sampling rate (SR). To tackle this problem, a new, to the best of our knowledge, imaging technique is proposed: firstly, the Hessian-based norm constraint is introduced to deal with the staircase effect caused by the low SR and total variation regularization; secondly, based on the local similarity prior of consecutive frames in the time dimension, we designed the temporal local image low-rank constraint for the FSI, and combined the spatiotemporal random sampling method, the redundancy image information of consecutive frames can be utilized sufficiently; finally, by introducing additional variables to decompose the optimization problem into multiple sub-problems and analytically solving each one, a closed-form algorithm is derived for efficient image reconstruction. Experimental results show that the proposed method improves imaging quality significantly compared with state-of-the-art methods.

Working memory asymmetrically modulates auditory and linguistic processing of speech.

Working memory load can modulate speech perception. However, since speech perception and working memory are both complex functions, it remains elusive how each component of the working memory system interacts with each speech processing stage. To investigate this issue, we concurrently measure how the working memory load modulates neural activity tracking three levels of linguistic units, i.e., syllables, phrases, and sentences, using a multiscale frequency-tagging approach. Participants engage in a sentence comprehension task and the working memory load is manipulated by asking them to memorize either auditory verbal sequences or visual patterns. It is found that verbal and visual working memory load modulate speech processing in similar manners: Higher working memory load attenuates neural activity tracking of phrases and sentences but enhances neural activity tracking of syllables. Since verbal and visual WM load similarly influence the neural responses to speech, such influences may derive from the domain-general component of WM system. More importantly, working memory load asymmetrically modulates lower-level auditory encoding and higher-level linguistic processing of speech, possibly reflecting reallocation of attention induced by mnemonic load.

Fast and high-quality single-pixel imaging.

The imaging quality of the conventional single-pixel-imaging (SPI) technique seriously degrades at a low sampling rate. To tackle this problem, we propose an efficient sampling method and a high-quality real-time image reconstruction strategy: first, different from the conventional simple circular path sampling strategy or variable density random sampling technique, the proposed method samples the Fourier spectrum using the spectrum distribution of the image, that is, sampling the significant spectrum coefficients first, which will help to improve the image quality at a relevantly low sampling rate; second, to handle the long image reconstruction time caused by the iterative algorithm, the sparsity of the image and the alternating direction optimization strategy are combined to ameliorate the reconstruction process in the image gradient space. Compared with the state-of-the-art techniques, the proposed method significantly improves the imaging quality and achieves real-time reconstruction on the time scale of milliseconds.

High-speed three-dimensional shape measurement based on tripartite complementary Gray-coded light.

In phase-shifting profilometry based on the Gray code, the jump error is inevitably generated and is further amplified in dynamic scenes. To tackle this problem, we propose the robust tripartite complementary Gray code method (TCG). Without projecting additional patterns, TCG uses different combinations of Gray code to calculate three complementary orders able to avoid jump error in the unwrapping process. TCG is efficient and robust, as it fully utilizes the redundant information of the Gray code. Experimental results demonstrate that TCG can realize high-efficiency and high-speed three-dimensional shape measurement at a rate of 500 fps.

Optical frequency and phase information-based fusion approach for image rotation symmetry detection.

Detecting an object using rotation symmetry property is widely applicable as most artificial objects have this property. However, current known techniques often fail due to using single symmetry energy. To tackle this problem, this paper proposes a novel method which consists of two steps: 1) Based on an optical image, two independent symmetry energies are extracted from the optical frequency space (RSS - Rotation Symmetry Strength) and phase space (SSD - Symmetry Shape Density). And, an optimized symmetry-energy-based fusion algorithm is creatively applied to these two energies to achieve a more comprehensive reflection of symmetry information. 2) In the fused symmetry energy map, the local region detection algorithm is used to realize the detection of multi-scale symmetry targets. Compared with known methods, the proposed method can get more multiple-scale (skewed, small-scale, and regular) rotation symmetry centers, and can significantly boost the performance of detecting symmetry properties with better accuracy. Experimental results confirm the performance of the proposed method, which is superior to the state-of-the-art methods.

Supervised methods for symptom name recognition in free-text clinical records of traditional Chinese medicine: an empirical study.

Clinical records of traditional Chinese medicine (TCM) are documented by TCM doctors during their routine diagnostic work. These records contain abundant knowledge and reflect the clinical experience of TCM doctors. In recent years, with the modernization of TCM clinical practice, these clinical records have begun to be digitized. Data mining (DM) and machine learning (ML) methods provide an opportunity for researchers to discover TCM regularities buried in the large volume of clinical records. There has been some work on this problem. Existing methods have been validated on a limited amount of manually well-structured data. However, the contents of most fields in the clinical records are unstructured. As a result, the previous methods verified on the well-structured data will not work effectively on the free-text clinical records (FCRs), and the FCRs are, consequently, required to be structured in advance. Manually structuring the large volume of TCM FCRs is time-consuming and labor-intensive, but the development of automatic methods for the structuring task is at an early stage. Therefore, in this paper, symptom name recognition (SNR) in the chief complaints, which is one of the important tasks to structure the FCRs of TCM, is carefully studied. The SNR task is reasonably treated as a sequence labeling problem, and several fundamental and practical problems in the SNR task are studied, such as how to adapt a general sequence labeling strategy for the SNR task according to the domain-specific characteristics of the chief complaints and which sequence classifier is more appropriate to solve the SNR task. To answer these questions, a series of elaborate experiments were performed, and the results are explained in detail.

A framework and its empirical study of automatic diagnosis of traditional Chinese medicine utilizing raw free-text clinical records.

Automatic diagnosis is one of the most important parts in the expert system of traditional Chinese medicine (TCM), and in recent years, it has been studied widely. Most of the previous researches are based on well-structured datasets which are manually collected, structured and normalized by TCM experts. However, the obtained results of the former work could not be directly and effectively applied to clinical practice, because the raw free-text clinical records differ a lot from the well-structured datasets. They are unstructured and are denoted by TCM doctors without the support of authoritative editorial board in their routine diagnostic work. Therefore, in this paper, a novel framework of automatic diagnosis of TCM utilizing raw free-text clinical records for clinical practice is proposed and investigated for the first time. A series of appropriate methods are attempted to tackle several challenges in the framework, and the Naïve Bayes classifier and the Support Vector Machine classifier are employed for TCM automatic diagnosis. The framework is analyzed carefully. Its feasibility is validated through evaluating the performance of each module of the framework and its effectiveness is demonstrated based on the precision, recall and F-Measure of automatic diagnosis results.

Identifying vital nodes for influence maximization in attributed networks.

Identifying a set of vital nodes to achieve influence maximization is a topic of general interest in network science. Many algorithms have been proposed to solve the influence maximization problem in complex networks. Most of them just use topology information of networks to measure the node influence. However, the node attribute is also an important factor for measuring node influence in attributed networks. To tackle this problem, we first propose an extension model of linear threshold (LT) propagation model to simulate the information propagation in attributed networks. Then, we propose a novel community-based method to identify a set of vital nodes for influence maximization in attributed networks. The proposed method considers both topology influence and attribute influence of nodes, which is more suitable for identifying vital nodes in attributed networks. A series of experiments are carried out on five real world networks and a large scale synthetic network. Compared with CELF, IMM, CoFIM, HGD, NCVoteRank and K-Shell methods, experimental results based on different propagation models show that the proposed method improves the influence spread by [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text].

High quality and fast compressed sensing MRI reconstruction via edge-enhanced dual discriminator generative adversarial network.

Generative adversarial networks (GAN) are widely used for fast compressed sensing magnetic resonance imaging (CSMRI) reconstruction. However, most existing methods are difficult to make an effective trade-off between abstract global high-level features and edge features. It easily causes problems, such as significant remaining aliasing artifacts and clearly over-smoothed reconstruction details. To tackle these issues, we propose a novel edge-enhanced dual discriminator generative adversarial network architecture called EDDGAN for CSMRI reconstruction with high quality. In this model, we extract effective edge features by fusing edge information from different depths. Then, leveraging the relationship between abstract global high-level features and edge features, a three-player game is introduced to control the hallucination of details and stabilize the training process. The resulting EDDGAN can offer more focus on edge restoration and de-aliasing. Extensive experimental results demonstrate that our method consistently outperforms state-of-the-art methods and obtains reconstructed images with rich edge details. In addition, our method also shows remarkable generalization, and its time consumption for each 256 × 256 image reconstruction is approximately 8.39 ms.

Association Between MTHFR C677T Polymorphism and Susceptibility to Autism Spectrum Disorders: A Meta-Analysis in Chinese Han Population.

Prior studies have examined the influence of MTHFR C677T on autism susceptibility, however, there are no consensus conclusions and specific analyses of a Chinese population. This meta-analysis included a false-positive report probability (FPRP) test to comprehensively evaluate the association of MTHFR C677T polymorphism with autism susceptibility among a Chinese Han population. A large-scale literature retrieval was conducted using various databases including PubMed, Embase, Wan Fang, and the Chinese National Knowledge Infrastructure (CNKI) up to July 31, 2020, with a total of 2,258 cases and 2,073 controls included. The strength of correlation was assessed by odds ratios (ORs) and 95% confidence intervals (95% CIs). MTHFR C677T showed a significant correlation with increased ASD susceptibility under all genetic models (T vs. C, OR = 1.89, 95% CI 1.28 to 2.79; TT vs. CC: OR = 2.44, 95% CI 1.43 to 4.15; CT vs. CC, OR = 1.73; 95% CI 1.19 to 2.51; CT + TT vs. CC: OR = 2.03, 95% CI 1.31 to 3.15; TT vs. CT + CC, OR = 1.95, 95% CI 1.21 to 3.13). Stratification analysis by region also revealed a consistent association in the Northern Han subgroup, but not in the Southern Han subgroup. Pooled minor allele frequency (MAF) of 30 studies were 45% in Northern Han and 39% in Southern Han. To avoid a possible "false positive report," we further investigated the significant associations observed in the present meta-analysis using the FPRP test, which consolidated the results. In conclusion, MTHFR C677T polymorphism is associated with the increased risk of autism in China, especially in Northern Han. For those mothers and children who are generally susceptible to autism, prenatal folate and vitamin B12 may reduce the risk that children suffer from autism, especially in Northern Han populations. In the future, more well-designed studies with a larger sample size are expected.

Why Smoggy Days Suppress Our Mood: Automatic Association Between Clarity and Valence.

The intuition of clarity-valence association seems to be pervasive in daily life, however, whether there exists a potential association between clarity (i.e., operationalized as visual resolution) and affect in human cognition remains unknown. The present study conducted five experiments, and demonstrated the clarity-valence congruency effect, that is, the evaluations showed performance advantage in the congruent conditions (clear-positive, blurry-negative). Experiments 1 through 3 demonstrated the influence of the perception of clarity on the conceptualization of affective valence, while Experiments 4 and 5 verified the absence of the influence of conceptualization on perception, thus the unidirectionality of clarity-valence association in cognition is confirmed. The findings extend the affective perceptual-conceptual associations into the dimension of clarity, thus providing support for the ideas of embodied cognition as well as implications for our preference for clarity and aversion to blur.

Quantifying Interpreting Types: Language Sequence Mirrors Cognitive Load Minimization in Interpreting Tasks.

Most interpreting theories claim that different interpreting types should involve varied processing mechanisms and procedures. However, few studies have examined their underlying differences. Even though some previous results based on quantitative approaches show that different interpreting types yield outputs of varying lexical and syntactic features, the grammatical parsing approach is limited. Language sequences that form without relying on parsing or processing with a specific linguistic approach or grammar excel other quantitative approaches at revealing the sequential behavior of language production. As a non-grammatically-bound unit of language sequences, frequency motif can visualize the local distribution of content and function words, and can also statistically classify languages and identify text types. Thus, the current research investigates the distribution, length and position-dependent properties of frequency motifs across different interpreting outputs in pursuit of the sequential generation behaviors. It is found that the distribution, the length and certain position-dependent properties of the specific language sequences differ significantly across simultaneous interpreting and consecutive interpreting output. The features of frequency motifs manifest that both interpreting output is produced in the manner that abides by the least effort principle. The current research suggests that interpreting types can be differentiated through this type of language sequential unit and offers evidence for how the different task features mediate the sequential organization of interpreting output under different demand to achieve cognitive load minimization.

On the almost periodic solution of cellular neural networks with distributed delays.

By exponential dichotomy about differential equations, a formal almost periodic solution (APS) of a class of cellular neural networks (CNNs) with distributed delays is obtained. Then, within different normed spaces, several sufficient conditions guaranteeing the existence and uniqueness of an APS are proposed using two fixed-point theorems. Based on the continuity property and some inequality techniques, two theorems insuring the global stability of the unique APS are given. Comparing with known literatures, all conclusions are drawn with slacker restrictions, e.g., do not require the integral of the kernel function determining the distributed delays from zero to positive infinity to be one, and the activation functions to be bounded, etc.; besides, all criteria are obtained by different ways. Finally, two illustrative examples show the validity and that all criteria are easy to check and apply.

Geometry Guided Multi-Scale Depth Map Fusion via Graph Optimization.

In depth discontinuous and untextured regions, depth maps created by multiple view stereopsis are with heavy noises, but existing depth map fusion methods cannot handle it explicitly. To tackle the problem, two novel strategies are proposed: 1) a more discriminative fusion method, which is based on geometry consistency, measuring the consistency, and stability of surface geometry computed on both partial and global surfaces, different from traditional methods only using visibility consistency; 2) a graph optimization method which fuses pyramids of depth maps as mutual complementary information is available in different scales, and differs from existing multi-scale fusion methods. The method considers both sampling scale of a point and relations among points, and is proven to be solvable by graph cuts. Experimental results verify the superior performance of the proposed method to the traditional visibility consistency-based methods, and the proposed method is also compared favorably with a number of state-of-the-art methods. Moreover, the proposed method achieves the highest completeness among all the methods compared.

L1-Norm Low-Rank Matrix Decomposition by Neural Networks and Mollifiers.

The L1-norm cost function of the low-rank approximation of the matrix with missing entries is not smooth, and also cannot be transformed into a standard linear or quadratic programming problem, and thus, the optimization of this cost function is still not well solved. To tackle this problem, first, a mollifier is used to smooth the cost function. High closeness of the smoothed function to the original one can be obtained by tuning the parameters contained in the mollifier. Next, a recurrent neural network is proposed to optimize the mollified function, which will converge to a local minimum. In addition, to boost the speed of the system, the mollifying process is implemented by a filtering procedure. The influence of two mollifier parameters is theoretically analyzed and experimentally confirmed, showing that one of the parameters is critical to computational efficiency and accuracy, while the other not. A large number of experiments on synthetic data show that the proposed method is competitive to the state-of-the-art methods. In particular, the experiments on large matrices and a real application in the structure from motion indicate that the memory requirement of the proposed algorithm is mild, making it suitable for real applications that often involve large-scale matrix decomposition.

A functional neural network computing some eigenvalues and eigenvectors of a special real matrix.

How to quickly compute eigenvalues and eigenvectors of a matrix, especially, a general real matrix, is significant in engineering. Since neural network runs in asynchronous and concurrent manner, and can achieve high rapidity, this paper designs a concise functional neural network (FNN) to extract some eigenvalues and eigenvectors of a special real matrix. After equivalent transforming the FNN into a complex differential equation and obtaining the analytic solution, the convergence properties of the FNN are analyzed. If the eigenvalue whose imaginary part is nonzero and the largest of all eigenvalues is unique, the FNN will converge to the eigenvector corresponding to this special eigenvalue with general nonzero initial vector. If all eigenvalues are real numbers or there are more than one eigenvalue whose imaginary part equals the largest, the FNN will converge to zero point or fall into a cycle procedure. Comparing with other neural networks designed for the same domain, the restriction to matrix is very slack. At last, three examples are employed to illustrate the performance of the FNN.

Accurate and Fast Convergent Initial-Value Belief Propagation for Stereo Matching.

The belief propagation (BP) algorithm has some limitations, including ambiguous edges and textureless regions, and slow convergence speed. To address these problems, we present a novel algorithm that intrinsically improves both the accuracy and the convergence speed of BP. First, traditional BP generally consumes time due to numerous iterations. To reduce the number of iterations, inspired by the crucial importance of the initial value in nonlinear problems, a novel initial-value belief propagation (IVBP) algorithm is presented, which can greatly improve both convergence speed and accuracy. Second, .the majority of the existing research on BP concentrates on the smoothness term or other energy terms, neglecting the significance of the data term. In this study, a self-adapting dissimilarity data term (SDDT) is presented to improve the accuracy of the data term, which incorporates an additional gradient-based measure into the traditional data term, with the weight determined by the robust measure-based control function. Finally, this study explores the effective combination of local methods and global methods. The experimental results have demonstrated that our method performs well compared with the state-of-the-art BP and simultaneously holds better edge-preserving smoothing effects with fast convergence speed in the Middlebury and new 2014 Middlebury datasets.

Robust Prostate Segmentation Using Intrinsic Properties of TRUS Images.

Accurate segmentation is usually crucial in transrectal ultrasound (TRUS) image based prostate diagnosis; however, it is always hampered by heavy speckles. Contrary to the traditional view that speckles are adverse to segmentation, we exploit intrinsic properties induced by speckles to facilitate the task, based on the observations that sizes and orientations of speckles provide salient cues to determine the prostate boundary. Since the speckle orientation changes in accordance with a statistical prior rule, rotation-invariant texture feature is extracted along the orientations revealed by the rule. To address the problem of feature changes due to different speckle sizes, TRUS images are split into several arc-like strips. In each strip, every individual feature vector is sparsely represented, and representation residuals are obtained. The residuals, along with the spatial coherence inherited from biological tissues, are combined to segment the prostate preliminarily via graph cuts. After that, the segmentation is fine-tuned by a novel level sets model, which integrates (1) the prostate shape prior, (2) dark-to-light intensity transition near the prostate boundary, and (3) the texture feature just obtained. The proposed method is validated on two 2-D image datasets obtained from two different sonographic imaging systems, with the mean absolute distance on the mid gland images only 1.06±0.53 mm and 1.25±0.77 mm, respectively. The method is also extended to segment apex and base images, producing competitive results over the state of the art.

A Random Algorithm for Low-Rank Decomposition of Large-Scale Matrices With Missing Entries.

A random submatrix method (RSM) is proposed to calculate the low-rank decomposition U(m×r)V(n×r)(T) (r < m, n) of the matrix Y∈R(m×n) (assuming m > n generally) with known entry percentage 0 < ρ ≤ 1. RSM is very fast as only O(mr(2)ρ(r)) or O(n(3)ρ(3r)) floating-point operations (flops) are required, compared favorably with O(mnr+r(2)(m+n)) flops required by the state-of-the-art algorithms. Meanwhile, RSM has the advantage of a small memory requirement as only max(n(2),mr+nr) real values need to be saved. With the assumption that known entries are uniformly distributed in Y, submatrices formed by known entries are randomly selected from Y with statistical size k×nρ(k) or mρ(l)×l , where k or l takes r+1 usually. We propose and prove a theorem, under random noises the probability that the subspace associated with a smaller singular value will turn into the space associated to anyone of the r largest singular values is smaller. Based on the theorem, the nρ(k)-k null vectors or the l-r right singular vectors associated with the minor singular values are calculated for each submatrix. The vectors ought to be the null vectors of the submatrix formed by the chosen nρ(k) or l columns of the ground truth of V(T). If enough submatrices are randomly chosen, V and U can be estimated accordingly. The experimental results on random synthetic matrices with sizes such as 13 1072 ×10(24) and on real data sets such as dinosaur indicate that RSM is 4.30 ∼ 197.95 times faster than the state-of-the-art algorithms. It, meanwhile, has considerable high precision achieving or approximating to the best.

An improved SOM algorithm and its application to color feature extraction.

Reducing the redundancy of dominant color features in an image and meanwhile preserving the diversity and quality of extracted colors is of importance in many applications such as image analysis and compression. This paper presents an improved self-organization map (SOM) algorithm namely MFD-SOM and its application to color feature extraction from images. Different from the winner-take-all competitive principle held by conventional SOM algorithms, MFD-SOM prevents, to a certain degree, features of non-principal components in the training data from being weakened or lost in the learning process, which is conductive to preserving the diversity of extracted features. Besides, MFD-SOM adopts a new way to update weight vectors of neurons, which helps to reduce the redundancy in features extracted from the principal components. In addition, we apply a linear neighborhood function in the proposed algorithm aiming to improve its performance on color feature extraction. Experimental results of feature extraction on artificial datasets and benchmark image datasets demonstrate the characteristics of the MFD-SOM algorithm.