Statistical parametric mapping (SPM) of functional magnetic resonance imaging (fMRI) uses a canonical hemodynamic response function (HRF) to construct the design matrix within the general linear model (GLM) framework....
详细信息
ISBN:
(纸本)9781424441259;9781424441266
Statistical parametric mapping (SPM) of functional magnetic resonance imaging (fMRI) uses a canonical hemodynamic response function (HRF) to construct the design matrix within the general linear model (GLM) framework. Recently, there has been many research on data-driven method on fMRI data, such as the independence component analysis (ICA). The main weakness of ICA for fMRI is its restrictive assumption, especially independence. Furthermore, recent study demonstrated that sparsity is more important than independency in ICA analysis for fMRI. Hence, we propose sparse learning algorithm, such as K-SVD, as an alternative, that decomposes the dictionary-atoms using sparsity rather than independence of the components. For the fMRI finger tapping task data, we employed the K-SVD algorithm to extract the time-course signal atoms of brain activation. The activation maps using trained dictionary as a design matrix showed tightly localized signals in a small set of brain areas.
In dynamic MRI, spatio-temporal resolution is a very important issue. Recently, compressed sensing approach has become a highly attracted imaging technique since it enables accelerated acquistion without aliasing arti...
详细信息
ISBN:
(纸本)9781424441259;9781424441266
In dynamic MRI, spatio-temporal resolution is a very important issue. Recently, compressed sensing approach has become a highly attracted imaging technique since it enables accelerated acquistion without aliasing artifacts. Our group has proposed an ℓ 1 -norm based compressed sensing dynamic MRI called k-t FOCUSS, which outperforms existing methods. However, it is known that the restrictive conditions for ℓ 1 exact reconstruction usually cost more measurements than ℓ 1 minimization. In this paper, we adopts a sparse Bayesian learning approach to improve k-t FOCUSS and achieve ℓ 0 solution. We demonstrated the improved image quality using in vivo cardiac cine imaging.
In this paper we present a preliminary analysis of the radiometric performance of the three 1.4 GHz Noise Injection Radiometers of the SMOS satellite. We assess the radiometric resolution and stability of the receiver...
详细信息
In this paper we present a preliminary analysis of the radiometric performance of the three 1.4 GHz Noise Injection Radiometers of the SMOS satellite. We assess the radiometric resolution and stability of the receivers, and the similarity between their measurements. The units aim at measurements of a common antenna temperature, which determines the overall brightness temperature level of SMOS retrievals. For this purpose, we use measurement data gathered during the first two months of the in-orbit operations of the satellite, which was launched in November 2009. The preliminary assessment of the abovementioned performance parameters shows that the units meet the requirements with a margin.
Nonnegative Matrix/Tensor factorization (NMF/NTF) have been used in the study of EEG, and the fit (explained variation) is often used to evaluate the performance of a nonnegative decomposition algorithm. However, this...
详细信息
Nonnegative Matrix/Tensor factorization (NMF/NTF) have been used in the study of EEG, and the fit (explained variation) is often used to evaluate the performance of a nonnegative decomposition algorithm. However, this parameter only reveals the information derived from the mathematical model and just exhibits the reliability of the algorithms, and the property of EEG can not be reflected. If fits of two algorithms are identical, it is necessary to examine whether the desired components extracted by them are identical too. In order to verify this doubt, we performed NMF and NTF on the same dataset of an auditory event-related potentials (ERPs), and found that the identical fits of NMF and NTF under the hierarchical alternating least squares algorithms corresponded to different desired ERPs extracted by NMF and NTF, moreover, NTF contributed the ERP with much better timing and spectral properties. Such analysis implies that to combine the fit and property of the desired ERP component together helps evaluate the performance of NMF and NTF algorithms in the study of ERPs.
Brain-computer interface (BCI) is a specific Human-Computer interface in which the brain wave is employed as the carrier of control information. The ultimate goal of BCI is to build a direct communication pathway betw...
详细信息
Brain-computer interface (BCI) is a specific Human-Computer interface in which the brain wave is employed as the carrier of control information. The ultimate goal of BCI is to build a direct communication pathway between human brain and external environment that does not depend on the limb mobility and language. In this paper, we carry out the experiment about the left or right hand motor imagery, and support vector machine with genetic algorithm (GA-SVM) and back propagation neural network with genetic algorithm (GA-BP) are employed to classify the μ rhythm evoked by movement imagination. The experiment results prove that GA-SVM can easily find out the appropriate parameters of SVM and GA-BP can avoid getting into local minimization to great extend. So higher accuracy of classification is achieved.
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an ...
详细信息
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an issue which is a special SMC problem. Based on Scalar Product Protocol, Monte Carlo Method and Oblivious Transfer, we give two solutions to the problem about how to decide the areas. That is, a polygon is divided into two parts by a line: S 1 and S 2 . Furthermore, we analyze the security and computational complexity, as well as the comparison of these two protocols. The results of analysis show that the proposed protocols are secure and efficient. We believe the two protocols will be useful in other geometric and combinatorial problems.
A new noise reduction method for speech signals is proposed in this paper. The method is based upon the N-mode singular value decomposition algorithm, which exploits the multilinear subspace analysis of given speech d...
详细信息
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with ti...
详细信息
Randić et al. proposed a significant graphical representation for DNA sequences, which is very compact and avoids loss of information. In this paper, we build a fast algorithm for this graphical representation with time complexity O(n 2 ), and find another important advantage in the representation: no degeneracy. Moreover, we propose a new method to do similarity analysis of DNA sequences based on the representation. The approach adopts four elements of covariance matrix as a descriptor, and is illustrated on the first exon of beta-globin genes from 11 different species.
In this paper, we propose a distributed group signature scheme with traceable signers for mobile Ad hoc networks. In such scheme, there isn't a trusted center, and all members of Ad hoc group cooperate to generate...
详细信息
ISBN:
(纸本)9781424472352
In this paper, we propose a distributed group signature scheme with traceable signers for mobile Ad hoc networks. In such scheme, there isn't a trusted center, and all members of Ad hoc group cooperate to generate all system parameters and all private/public keys. Any ' members in Ad hoc group can collaboratively generate the group signature with the help of a designated clerk, where the signer respectively generates the partial signature by using his private key and the clerk can check the correctness of the partial signature. Furthermore, anyone can verify the validity of the group signature by the group public key and trace back to find the identities of signers from the warrant created by the clerk. What's more, it can dynamically increase the parameter values of ~t and ~n, according to the actual security needs of mobile Ad hoc networks, but the private and public keys of the whole Ad hoc group still are not changed for relatively long-term stability.
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-...
详细信息
ISBN:
(纸本)9781424475421
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a new class of clustering algorithm, K-Alpha Means (KAM), which is insensitive to the initial centers. With K-Harmonic Means as a special case, KAM dynamically weights data points during iteratively updating centers, which deemphasizes data points that are close to centers while emphasizes data points that are not close to any centers. Through replacing minimum operator in K-Means by alpha-mean operator, KAM significantly improves the clustering performances.
暂无评论