Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is a tissue perfusion imaging technique. Some versatile free-breathing DCE-MRI techniques combining compressed sensing (CS) and parallel imaging with gold...
详细信息
Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is a tissue perfusion imaging technique. Some versatile free-breathing DCE-MRI techniques combining compressed sensing (CS) and parallel imaging with golden-angle radial sampling have been developed to improve motion robustness with high spatial and temporal resolution. These methods have demonstrated good diagnostic performance in clinical setting, but the reconstruction quality will degrade at high acceleration rates and overall reconstruction time remains long. In this paper, we proposed a new parallel CS reconstruction model for DCE-MRI that enforces flexible weighted sparse constraint along both spatial and temporal dimensions. Weights were introduced to flexibly adjust the importance of time and space sparsity, and we derived a fast-thresholding algorithm which was proven to be simple and efficient for solving the proposed reconstruction model. Results on both the brain tumor DCE and liver DCE show that, at relatively high acceleration factor of fast sampling, lowest reconstruction error and highest image structural similarity are obtained by the proposed method. Besides, the proposed method achieves faster reconstruction for liver datasets and better physiological measures are also obtained on tumor images.
We propose a fast numerical algorithm for the multi-dimensional heat equation on unbounded domains with strips tails. The artificial boundary method is used to confine the computational domains. By applying BDF2 for t...
详细信息
We propose a fast numerical algorithm for the multi-dimensional heat equation on unbounded domains with strips tails. The artificial boundary method is used to confine the computational domains. By applying BDF2 for the time discretization and performing the Z transform, we derive an exact semi-discrete artificial boundary condition which contains the discrete temporal convolution and the surface Laplacian operator. Based on the best relative Chebyshev approximation of the square-root function, we design a fast algorithm to approximate and localize the exact semi-discrete artificial boundary condition. The spatial discretization is realized by the Galerkin finite element method with a special boundary treatment. A complete error estimate for the fully discrete problems is performed, and numerical tests are presented to demonstrate the accuracy and efficiency of the proposed algorithm.(c) 2022 Elsevier B.V. All rights reserved.
With the help of the asymptotic expansion for the classic Li formula and based on the L1-type compact difference scheme,we propose a temporal Richardson extrapolation method for the fractional sub-diffusion *** extrap...
详细信息
With the help of the asymptotic expansion for the classic Li formula and based on the L1-type compact difference scheme,we propose a temporal Richardson extrapolation method for the fractional sub-diffusion *** extrapolation formulas are presented,whose temporal convergence orders in L_(∞)-norm are proved to be 2,3-α,and 4-2α,respectively,where 0<α<***,by the method of order reduction,an extrapola-tion method is constructed for the fractional wave equation including two extrapolation formulas,which achieve temporal 4-γ and 6-2γ order in L_(∞)-norm,respectively,where1<γ<*** the derived extrapolation methods with the fast algorithm for Caputo fractional derivative based on the sum-of-exponential approximation,the fast extrapolation methods are obtained which reduce the computational complexity significantly while keep-ing the *** numerical experiments confirm the theoretical results.
This work proposes two fast and efficient numerical methods for a generalized Oldroyd-B fluid model with fractional derivatives. The fast evaluations of the Riemann-Liouville fractional derivatives are developed based...
详细信息
This work proposes two fast and efficient numerical methods for a generalized Oldroyd-B fluid model with fractional derivatives. The fast evaluations of the Riemann-Liouville fractional derivatives are developed based on convolution quadrature generated by the backward Euler and the second-order backward difference methods. By using these fast algorithms in time and employing the finite element method in space, two fully discrete schemes are established for the considered problem. Further, we discuss the error estimates of these numerical schemes based on the property of the initial value and the right hand function instead of the regularity assumption of the exact solution. Finally, some numerical tests are presented to verify the effectiveness of the numerical schemes and confirm the theoretical results.(c) 2022 Elsevier B.V. All rights reserved.
In this paper, we study the variable-order (VO) time-fractional diffusion equations. For a VO function alpha(t) is an element of (0, 1), we develop an exponential-sum-approximation (ESA) technique to approach the VO C...
详细信息
In this paper, we study the variable-order (VO) time-fractional diffusion equations. For a VO function alpha(t) is an element of (0, 1), we develop an exponential-sum-approximation (ESA) technique to approach the VO Caputo fractional derivative. The ESA technique keeps both the quadrature exponents and the number of exponentials in the summation unchanged at different time level. Approximating parameters are properly selected to achieve the efficient accuracy. Compared with the general direct method, the proposed method reduces the storage requirement from O(n) to O(log(2) n) and the computational cost from O(n(2)) to O(n log(2) n), respectively, with n being the number of the time levels. When this fast algorithm is exploited to construct a fast ESA scheme for the VO time-fractional diffusion equations, the computational complexity of the proposed scheme is only of O(mn log(2) n) with O(m log(2) n) storage requirement, where m denotes the number of spatial grid points. Theoretically, the unconditional stability and error analysis of the fast ESA scheme are given. The effectiveness of the proposed algorithm is verified by numerical examples.
ABSTR A C T In this paper, we introduce an algorithm for computing all the shortest reducts in a deci-sion system. The proposed algorithm is based on determining the size of the shortest reducts using a small super-re...
详细信息
ABSTR A C T In this paper, we introduce an algorithm for computing all the shortest reducts in a deci-sion system. The proposed algorithm is based on determining the size of the shortest reducts using a small super-reduct and some new pruning methods. Once the size of the shortest reduct is determined, all other reducts of the same size are found applying the new pruning methods. The results of our experiments using several synthetic and real -world decision systems show that the proposed algorithm is, in most cases, faster than the state of the art algorithms for computing all the shortest reducts reported in the literature. (c) 2021 Elsevier Inc. All rights reserved.
In this paper, a fast temporal second-order compact ADI scheme is proposed for the 2D time multi-term fractional wave equation. At the super-convergence point, the multi-term Caputo derivative is approximated by combi...
详细信息
In this paper, a fast temporal second-order compact ADI scheme is proposed for the 2D time multi-term fractional wave equation. At the super-convergence point, the multi-term Caputo derivative is approximated by combining the order reduction technique with the sum-of-exponential approximation to the kernel function appeared in Caputo derivative. The difference scheme can be solved by the recursion, which reduces the storage and computational cost significantly. The obtained scheme is uniquely solvable. The unconditional convergence and stability of the scheme in the discrete H-1-norm are proved by the discrete energy method and the convergence accuracy is second-order in time and fourth-order in space. Numerical example illustrates the efficiency of the scheme.
Tikhonov regularization is an effective method for particle size inversion of Photon Correlation Spectroscopy (PCS). Regularization parameter selection is the key point of Tikhonov regularization algorithm for solving...
详细信息
ISBN:
(纸本)9781479958252
Tikhonov regularization is an effective method for particle size inversion of Photon Correlation Spectroscopy (PCS). Regularization parameter selection is the key point of Tikhonov regularization algorithm for solving the first kind integral problem. In order to obtain the optimal regularization parameter, according to the Morozov discrepancy principal, this paper proposes an efficient regularization inversion method based on fast algorithm for implementing the problem of particle size distribution. Computer simulation data of monodisperse particles and bi-dispersed particles are inversed by this method respectively. The inversion results show that, when the noise level is 0 similar to 0.01, inversion results of fast algorithm are reasonable, however, when the noise level is greater than 0.005, discrepancy principal can't obtain correct inversion results. Therefore, Tikhonov regularization inversion method with fast algorithm has the advantages of high accuracy, tolerance of noises and fast speed in PCS inversion.
The traditional control methods are not able to keep control performance in a high level because response speed becomes more important for industrial control. This paper presented a fast predictive control algorithm, ...
详细信息
ISBN:
(纸本)9781479958252
The traditional control methods are not able to keep control performance in a high level because response speed becomes more important for industrial control. This paper presented a fast predictive control algorithm, which was easy and simple to calculate and the principle of algorithm was very clear and greatly improved the speed of response and calculation, as well as demonstrated the principles of fast algorithms and operation process of the algorithm. Finally, we analyzed the stability, dynamic characteristics and steady state characteristics of system, and used lead-lag correction link to improve the performance of system. The results of simulation demonstrated that all of methods and improved algorithms were feasibility.
As for JMVC (Joint Multi-view Video Coding), when executing motion and disparity estimation simultaneously, the implicit correlation of reference directions between current and neighboring macroblocks is neglected, an...
详细信息
ISBN:
(纸本)9783037859391
As for JMVC (Joint Multi-view Video Coding), when executing motion and disparity estimation simultaneously, the implicit correlation of reference directions between current and neighboring macroblocks is neglected, and this will lead to useless searching. To reduce this redundancy, we propose an estimation algorithm which sets search ranges properly by exploiting the mentioned correlation. The proposed algorithm first gets the reference directions of macroblocks in the left, top and top right direction of current macroblock, and compares them with current reference direction, then sets search ranges by the comparison results, executes motion and disparity estimation in the new ranges at last. Experimental results show that the proposed algorithm can save 28.98%- 46.30% of coding time without degradation of coding quality comparing to JMVC.
暂无评论