The present paper spreads the principal axis intrinsic method to the highdimensional case and discusses the solution of the tensor equation AX --XA = C
By using the center projection image sequence to estimate 3-D motion parameters,one needs to know the corresponding relationship between the feature of motion object in spaceand the projection coordinate on image plan...By using the center projection image sequence to estimate 3-D motion parameters,one needs to know the corresponding relationship between the feature of motion object in spaceand the projection coordinate on image plane.In order to avoid using the relationship of featurecorrespondence,the tensor analysis method in the affine transformation system is presented,andthe simulation data of experimental results are given.展开更多
We propose a generalized Lanczos method to generate the many-body basis states of quantum lattice models using tensor-network states （TNS）. The ground-state wave function is represented as a linear superposition com...We propose a generalized Lanczos method to generate the many-body basis states of quantum lattice models using tensor-network states （TNS）. The ground-state wave function is represented as a linear superposition composed from a set of TNS generated by Lanczos iteration. This method improves significantly the accuracy of the tensor-network algorithm and provides an effective way to enlarge the maximal bond dimension of TNS. The ground state such obtained contains significantly more entanglement than each individual TNS, reproducing correctly the logarithmic size dependence of the entanglement entropy in a critical system. The method can be generalized to non-Hamiltonian systems and to the calculation of low-lying excited states, dynamical correlation functions, and other physical properties of strongly correlated systems.展开更多
Tensor complementarity problem (TCP) is a special kind of nonlinear complementarity problem (NCP). In this paper, we introduce a new class of structure tensor and give some examples. By transforming the TCP to the sys...Tensor complementarity problem (TCP) is a special kind of nonlinear complementarity problem (NCP). In this paper, we introduce a new class of structure tensor and give some examples. By transforming the TCP to the system of nonsmooth equations, we develop a semismooth Newton method for the tensor complementarity problem. We prove the monotone convergence theorem for the proposed method under proper conditions.展开更多
This paper studies the problem of tensor principal component analysis (PCA). Usually the tensor PCA is viewed as a low-rank matrix completion problem via matrix factorization technique, and nuclear norm is used as a c...This paper studies the problem of tensor principal component analysis (PCA). Usually the tensor PCA is viewed as a low-rank matrix completion problem via matrix factorization technique, and nuclear norm is used as a convex approximation of the rank operator under mild condition. However, most nuclear norm minimization approaches are based on SVD operations. Given a matrix , the time complexity of SVD operation is O(mn2), which brings prohibitive computational complexity in large-scale problems. In this paper, an efficient and scalable algorithm for tensor principal component analysis is proposed which is called Linearized Alternating Direction Method with Vectorized technique for Tensor Principal Component Analysis (LADMVTPCA). Different from traditional matrix factorization methods, LADMVTPCA utilizes the vectorized technique to formulate the tensor as an outer product of vectors, which greatly improves the computational efficacy compared to matrix factorization method. In the experiment part, synthetic tensor data with different orders are used to empirically evaluate the proposed algorithm LADMVTPCA. Results have shown that LADMVTPCA outperforms matrix factorization based method.展开更多
Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit （PCP）. This paper exploits the higher-order generalization of matrix recovery, named higher-order princip...Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit （PCP）. This paper exploits the higher-order generalization of matrix recovery, named higher-order principal component pursuit （HOPCP）, since it is critical in multi-way data analysis. Unlike the convexification （nuclear norm） for matrix rank function, the tensorial nuclear norm is stil an open problem. While existing preliminary works on the tensor completion field provide a viable way to indicate the low complexity estimate of tensor, therefore, the paper focuses on the low multi-linear rank tensor and adopt its convex relaxation to formulate the convex optimization model of HOPCP. The paper further propose two algorithms for HOPCP based on alternative minimization scheme： the augmented Lagrangian alternating direction method （ALADM） and its truncated higher-order singular value decomposition （ALADM-THOSVD） version. The former can obtain a high accuracy solution while the latter is more efficient to handle the computationally intractable problems. Experimental results on both synthetic data and real magnetic resonance imaging data show the applicability of our algorithms in high-dimensional tensor data processing.展开更多
This paper studies the problem of recovering low-rank tensors, and the tensors are corrupted by both impulse and Gaussian noise. The problem is well accomplished by integrating the tensor nuclear norm and the l1-norm ...This paper studies the problem of recovering low-rank tensors, and the tensors are corrupted by both impulse and Gaussian noise. The problem is well accomplished by integrating the tensor nuclear norm and the l1-norm in a unified convex relaxation framework. The nuclear norm is adopted to explore the low-rank components and the l1-norm is used to exploit the impulse noise. Then, this optimization problem is solved by some augmented-Lagrangian-based algorithms. Some preliminary numerical experiments verify that the proposed method can well recover the corrupted low-rank tensors.展开更多
In this paper, several approaches for calculation of the effective tensor coefficient for domains with inclusions have been proposed. The limits of the approaches using are found. The series of numerical experiments a...In this paper, several approaches for calculation of the effective tensor coefficient for domains with inclusions have been proposed. The limits of the approaches using are found. The series of numerical experiments are made on the different frequencies, for different inclusions location and boundary conditions for the contrast properties of the matrix and inclusion materials.展开更多
To denoise the diffusion weighted images (DWIs) featured as multi-boundary, which was very important for the calculation of accurate DTIs (diffusion tensor magnetic resonance imaging), a modified Wiener filter was pro...To denoise the diffusion weighted images (DWIs) featured as multi-boundary, which was very important for the calculation of accurate DTIs (diffusion tensor magnetic resonance imaging), a modified Wiener filter was proposed. Through analyzing the widely accepted adaptive Wiener filter in image denoising fields, which suffered from annoying noise around the edges of DWIs and in turn greatly affected the denoising effect of DWIs, a local-shift method capable of overcoming the defect of the adaptive Wiener filter was proposed to help better denoising DWIs and the modified Wiener filter was constructed accordingly. To verify the denoising effect of the proposed method, the modified Wiener filter and adaptive Wiener filter were performed on the noisy DWI data, respectively, and the results of different methods were analyzed in detail and put into comparison. The experimental data show that, with the modified Wiener method, more satisfactory results such as lower non-positive tensor percentage and lower mean square errors of the fractional anisotropy map and trace map are obtained than those with the adaptive Wiener method, which in turn helps to produce more accurate DTIs.展开更多
文摘The present paper spreads the principal axis intrinsic method to the highdimensional case and discusses the solution of the tensor equation AX --XA = C
文摘By using the center projection image sequence to estimate 3-D motion parameters,one needs to know the corresponding relationship between the feature of motion object in spaceand the projection coordinate on image plane.In order to avoid using the relationship of featurecorrespondence,the tensor analysis method in the affine transformation system is presented,andthe simulation data of experimental results are given.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11190024 and 11474331)
文摘We propose a generalized Lanczos method to generate the many-body basis states of quantum lattice models using tensor-network states （TNS）. The ground-state wave function is represented as a linear superposition composed from a set of TNS generated by Lanczos iteration. This method improves significantly the accuracy of the tensor-network algorithm and provides an effective way to enlarge the maximal bond dimension of TNS. The ground state such obtained contains significantly more entanglement than each individual TNS, reproducing correctly the logarithmic size dependence of the entanglement entropy in a critical system. The method can be generalized to non-Hamiltonian systems and to the calculation of low-lying excited states, dynamical correlation functions, and other physical properties of strongly correlated systems.
文摘Tensor complementarity problem (TCP) is a special kind of nonlinear complementarity problem (NCP). In this paper, we introduce a new class of structure tensor and give some examples. By transforming the TCP to the system of nonsmooth equations, we develop a semismooth Newton method for the tensor complementarity problem. We prove the monotone convergence theorem for the proposed method under proper conditions.
文摘This paper studies the problem of tensor principal component analysis (PCA). Usually the tensor PCA is viewed as a low-rank matrix completion problem via matrix factorization technique, and nuclear norm is used as a convex approximation of the rank operator under mild condition. However, most nuclear norm minimization approaches are based on SVD operations. Given a matrix , the time complexity of SVD operation is O(mn2), which brings prohibitive computational complexity in large-scale problems. In this paper, an efficient and scalable algorithm for tensor principal component analysis is proposed which is called Linearized Alternating Direction Method with Vectorized technique for Tensor Principal Component Analysis (LADMVTPCA). Different from traditional matrix factorization methods, LADMVTPCA utilizes the vectorized technique to formulate the tensor as an outer product of vectors, which greatly improves the computational efficacy compared to matrix factorization method. In the experiment part, synthetic tensor data with different orders are used to empirically evaluate the proposed algorithm LADMVTPCA. Results have shown that LADMVTPCA outperforms matrix factorization based method.
基金supported by the National Natural Science Foundationof China(51275348)
文摘Recovering the low-rank structure of data matrix from sparse errors arises in the principal component pursuit （PCP）. This paper exploits the higher-order generalization of matrix recovery, named higher-order principal component pursuit （HOPCP）, since it is critical in multi-way data analysis. Unlike the convexification （nuclear norm） for matrix rank function, the tensorial nuclear norm is stil an open problem. While existing preliminary works on the tensor completion field provide a viable way to indicate the low complexity estimate of tensor, therefore, the paper focuses on the low multi-linear rank tensor and adopt its convex relaxation to formulate the convex optimization model of HOPCP. The paper further propose two algorithms for HOPCP based on alternative minimization scheme： the augmented Lagrangian alternating direction method （ALADM） and its truncated higher-order singular value decomposition （ALADM-THOSVD） version. The former can obtain a high accuracy solution while the latter is more efficient to handle the computationally intractable problems. Experimental results on both synthetic data and real magnetic resonance imaging data show the applicability of our algorithms in high-dimensional tensor data processing.
文摘This paper studies the problem of recovering low-rank tensors, and the tensors are corrupted by both impulse and Gaussian noise. The problem is well accomplished by integrating the tensor nuclear norm and the l1-norm in a unified convex relaxation framework. The nuclear norm is adopted to explore the low-rank components and the l1-norm is used to exploit the impulse noise. Then, this optimization problem is solved by some augmented-Lagrangian-based algorithms. Some preliminary numerical experiments verify that the proposed method can well recover the corrupted low-rank tensors.
文摘In this paper, several approaches for calculation of the effective tensor coefficient for domains with inclusions have been proposed. The limits of the approaches using are found. The series of numerical experiments are made on the different frequencies, for different inclusions location and boundary conditions for the contrast properties of the matrix and inclusion materials.
基金Project(2009AA04Z214) supported by the National High Technology Research and Development Program of ChinaProject(07JJ6133) supported by the Natural Science Foundation of Hunan Province, China
文摘To denoise the diffusion weighted images (DWIs) featured as multi-boundary, which was very important for the calculation of accurate DTIs (diffusion tensor magnetic resonance imaging), a modified Wiener filter was proposed. Through analyzing the widely accepted adaptive Wiener filter in image denoising fields, which suffered from annoying noise around the edges of DWIs and in turn greatly affected the denoising effect of DWIs, a local-shift method capable of overcoming the defect of the adaptive Wiener filter was proposed to help better denoising DWIs and the modified Wiener filter was constructed accordingly. To verify the denoising effect of the proposed method, the modified Wiener filter and adaptive Wiener filter were performed on the noisy DWI data, respectively, and the results of different methods were analyzed in detail and put into comparison. The experimental data show that, with the modified Wiener method, more satisfactory results such as lower non-positive tensor percentage and lower mean square errors of the fractional anisotropy map and trace map are obtained than those with the adaptive Wiener method, which in turn helps to produce more accurate DTIs.
