0000000000907369

AUTHOR

Deqing Wang

showing 5 related works from this author

Increasing Stability of EEG Components Extraction Using Sparsity Regularized Tensor Decomposition

2018

Tensor decomposition has been widely employed for EEG signal processing in recent years. Constrained and regularized tensor decomposition often attains more meaningful and interpretable results. In this study, we applied sparse nonnegative CANDECOMP/PARAFAC tensor decomposition to ongoing EEG data under naturalistic music stimulus. Interesting temporal, spectral and spatial components highly related with music features were extracted. We explored the ongoing EEG decomposition results and properties in a wide range of sparsity levels, and proposed a paradigm to select reasonable sparsity regularization parameters. The stability of interesting components extraction from fourteen subjects’ dat…

medicine.diagnostic_testbusiness.industryComputer sciencePattern recognition02 engineering and technologyElectroencephalographystability analysisRegularization (mathematics)ongoing EEG03 medical and health sciences0302 clinical medicinetensor decomposition0202 electrical engineering electronic engineering information engineeringmedicineTensor decompositionsparse regularization020201 artificial intelligence & image processingArtificial intelligencebusiness030217 neurology & neurosurgerynonnegative constraints
researchProduct

Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm

2019

Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higherorder (order > 4) and nonnegative form. However, the decomposition of higher-order nonnegative tensor suffers from poor convergence and low speed. In this study, we propose a new nonnegative CANDECOM/PARAFAC (NCP) model using proximal algorithm. The block principal pivoting method in alternating nonnegative least squares (ANLS) framework is employed to minimize the objective function. Our method can guarantee the convergence and accelerate the computation. The results of experiments on both synthetic and real data demonstrate …

ta113ta213signaalinkäsittelyComputationproximal algorithmnonnegative CAN-DECOMP/PARAFACalternating nonnegative least squares010103 numerical & computational mathematics01 natural sciencesLeast squares03 medical and health sciences0302 clinical medicinetensor decompositionblock principal pivotingConvergence (routing)Decomposition (computer science)Tensor decompositionOrder (group theory)0101 mathematicsMulti way analysisAlgorithm030217 neurology & neurosurgeryBlock (data storage)Mathematics
researchProduct

Exploiting ongoing EEG with multilinear partial least squares during free-listening to music

2016

During real-world experiences, determining the stimulus-relevant brain activity is excitingly attractive and is very challenging, particularly in electroencephalography. Here, spectrograms of ongoing electroencephalogram (EEG) of one participant constructed a third-order tensor with three factors of time, frequency and space; and the stimulus data consisting of acoustical features derived from the naturalistic and continuous music formulated a matrix with two factors of time and the number of features. Thus, the multilinear partial least squares (PLS) conforming to the canonical polyadic (CP) model was performed on the tensor and the matrix for decomposing the ongoing EEG. Consequently, we …

ta113Multilinear mapmedicine.diagnostic_testBrain activity and meditationSpeech recognition02 engineering and technologyElectroencephalographyta3112Matrix decomposition03 medical and health sciences0302 clinical medicinetensor decompositionFrequency domainPartial least squares regression0202 electrical engineering electronic engineering information engineeringmedicineSpectrogramOngoing EEG020201 artificial intelligence & image processingmusicTime domain030217 neurology & neurosurgerymultilinear partial least squaresMathematics
researchProduct

Extracting multi-mode ERP features using fifth-order nonnegative tensor decomposition

2018

Background Preprocessed Event-related potential (ERP) data are usually organized in multi-way tensor, in which tensor decomposition serves as a powerful tool for data processing. Due to the limitation of computation burden for multi-way data and the low algorithm performance of stability and efficiency, multi-way ERP data are conventionally reorganized into low-order tensor or matrix before further analysis. However, the reorganization may hamper mode specification and spoil the interaction information among different modes. New method In this study, we applied a fifth-order tensor decomposition to a set of fifth-order ERP data collected by exerting proprioceptive stimulus on left and right…

nonnegative tensor decompositionevent-related potentialmulti-mode featuresCANDECOMP/PARAFACsignaalinkäsittelycomponent number selectionEEG
researchProduct

Sparse nonnegative tensor decomposition using proximal algorithm and inexact block coordinate descent scheme

2021

Nonnegative tensor decomposition is a versatile tool for multiway data analysis, by which the extracted components are nonnegative and usually sparse. Nevertheless, the sparsity is only a side effect and cannot be explicitly controlled without additional regularization. In this paper, we investigated the nonnegative CANDECOMP/PARAFAC (NCP) decomposition with the sparse regularization item using l1-norm (sparse NCP). When high sparsity is imposed, the factor matrices will contain more zero components and will not be of full column rank. Thus, the sparse NCP is prone to rank deficiency, and the algorithms of sparse NCP may not converge. In this paper, we proposed a novel model of sparse NCP w…

tensor decompositionsignaalinkäsittelyproximal algorithmalgoritmitMathematicsofComputing_NUMERICALANALYSISinexact block coordinate descentsparse regularizationnonnegative CANDECOMP/PARAFAC decomposition
researchProduct