首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 18 毫秒
1.
    
A fully 3D OSEM reconstruction method for positron emission tomography (PET) based on symmetries and sparse matrix technique is described. Great savings in both storage space and computation time were achieved by exploiting the symmetries of scanner and sparseness of the system matrix. More reduction of storage requirement was obtained by introducing the approximation of system matrix. Iteration-filter was performed to restrict image noise in reconstruction. Performances of simulation data and phantom data got from Micro-PET (Type: Epuls-166) demonstrated that similar image quality was achieved using the approximation of the system matrix.  相似文献   

2.
    
The recent advances in image-processing techniques have led to the development of many methods to reduce the scan time without degrading the image quality. In particular, tomography has improved image reconstruction methods with the concomitant improvement of high-quality images. In this study, PRECEDENCE 16 was used to reconstruct images using the filtered back projection method, which is generally used, and the Astonish method and three-dimensional ordered-subsets expectation maximization method, which are based on repetition techniques. In qualitative and quantitative analysis of the reconstructed images, a comparison was made between images with different acquisition times and between images with the same acquisition time, which aimed at determining the optimal method for reconstructing high-quality images. A blind test for qualitative analysis confirmed almost no difference in image quality depending on the image acquisition time. Furthermore, in quantitative analysis, there was no significant difference in image quality depending on the image acquisition time. On the other hand, the results of the analysis in the image reconstruction method with the same acquisition time demonstrated a significant difference. The images reconstructed by the Astonish method, which uses a repetition technique, are believed to be excellent because they have high resolution and provide clinical diagnostic information. This study confirmed that the reconstruction method with a repetition technique could be used to improve image quality and reduce the scan time, despite not being in general use until recently due to the lengthy time needed for image reconstruction and lack of storage space.  相似文献   

3.
We study the spectrum of the Markov matrix of the totally asymmetric exclusion process (TASEP) on a one-dimensional periodic lattice at arbitrary filling. Although the system does not possess obvious symmetries except translation invariance, the spectrum presents many multiplets with degeneracies of high order when the size of the lattice and the number of particles obey some simple arithmetic rules. This behaviour is explained by a hidden symmetry property of the Bethe Ansatz. Assuming a one-to-one correspondence between the solutions of the Bethe equations and the eigenmodes of the Markov matrix, we derive combinatorial formulae for the orders of degeneracy and the number of multiplets. These results are confirmed by exact diagonalisations of small size systems. This unexpected structure of the TASEP spectrum suggests the existence of an underlying large invariance group.  相似文献   

4.
M.L. Gandarias 《Physica A》2008,387(10):2234-2242
In this paper we derive new potential symmetries that seem not to be recorded in the literature. These potential symmetries are determined by considering a generalized potential system, rather than the natural potential system or a general integral variable. An inhomogeneous diffusion equation, a porous medium equation and the Fokker-Planck equation have been considered as application of this procedure.  相似文献   

5.
    
In this note we prove that the method of Bîlã and Niesen to determine nonclassical determining equations is equivalent to that of Nucci’s method with heir-equations and thus in general is equivalent to using an appropriate form of generalised conditional symmetry.  相似文献   

6.
We present sufficient conditions ensuring the locality of hierarchies of symmetries generated by repeated commutation of master symmetry with a seed symmetry. These conditions are applicable to a large class of (1+1)-dimensional evolution systems. Our results can also be used for proving that the time-independent part of a suitable linear-in-time symmetry is a nontrivial master symmetry and hence the system in question has infinitely many symmetries and is integrable.  相似文献   

7.
郭永新  姜丽妍  于莹 《中国物理》2001,10(3):181-185
The dynamical symmetries and adjoint symmetries of nonlinear nonholonomic constrained mechanical systems are analysed in two kinds of geometrical frameworks whose evolution equations are Routh's equations and generalized Chaplygin's equations, respectively. The Lagrangian inverse problem and the interrelation between Noether's symmetries and dynamical symmetries are briefly concerned with. Finally an illustrative example is analysed.  相似文献   

8.
杜臻  谭光明 《计算物理》2024,41(1):33-39
分析稀疏矩阵向量乘(SpMV)程序优化的难点, 介绍两个自动调优的代表性工作: 基于预实现模板的SMAT和从头设计程序的AlphaSparse。详细介绍了它们的设计思路、实现细节、测试结果以及各自的优缺点。最后, 对SpMV自动调优的发展趋势进行了分析和预测。  相似文献   

9.
Essential to (cardiac) 3D ultrasound are 2D matrix array transducer technology and the associated (two-stage) beam forming. Given the large number of degrees of freedom and the complexity of this problem, simulation tools play an important role. Hereto, the impulse response (IR) method is commonly used. Unfortunately, given the large element count of 2D array transducers, simulation times become significant jeopardizing the efficacy of the design process. The aim of this study was therefore to derive a new analytical expression to more efficiently calculate the IR in order to speed up the calculation process. To compare accuracy and computation time, the reference and the proposed method were implemented in MATLAB and contrasted. For all points of observation tested, the IR with both methods was identical. The mean calculation time however reduced in average by a factor of 3.93 ± 0.03 times. The proposed IR method therefore speeds up the calculation time of the IR of an individual transducer element while remaining perfectly accurate. This new expression will be particularly relevant for 2D matrix transducer design where computation times remain currently a bottle neck in the design process.  相似文献   

10.
    
Data representation has been one of the core topics in 3D graphics and pattern recognition in high-dimensional data. Although the high-resolution geometrical information of a physical object can be well preserved in the form of metrical data, e.g., point clouds/triangular meshes, from a regular data (e.g., image/audio) processing perspective, they also bring excessive noise in the course of feature abstraction and regression. For 3D face recognition, preceding attempts focus on treating the scan samples as signals laying on an underlying discrete surface (mesh) or morphable (statistic) models and by embedding auxiliary information, e.g., texture onto the regularized local planar structure to obtain a superior expressive performance to registration-based methods, but environmental variations such as posture/illumination will dissatisfy the integrity or uniform sampling condition, which holistic models generally rely on. In this paper, a geometric deep learning framework for face recognition is proposed, which merely requires the consumption of raw spatial coordinates. The non-uniformity and non-grid geometric transformations in the course of point cloud face scanning are mitigated by modeling each identity as a stochastic process. Individual face scans are considered realizations, yielding underlying inherent distributions under the appropriate assumption of ergodicity. To accomplish 3D facial recognition, we propose a windowed solid harmonic scattering transform on point cloud face scans to extract the invariant coefficients so that unrelated variations can be encoded into certain components of the scattering domain. With these constructions, a sparse learning network as the semi-supervised classification backbone network can work on reducing intraclass variability. Our framework obtained superior performance to current competing methods; without excluding any fragmentary or severely deformed samples, the rank-1 recognition rate (RR1) achieved was 99.84% on the Face Recognition Grand Challenge (FRGC) v2.0 dataset and 99.90% on the Bosphorus dataset.  相似文献   

11.
S K Soni 《Pramana》1980,15(6):571-587
For each of a couple of two-dimensional forms for quark mass matrix, it is discussed how that form may be realised in a certain gauge scheme (one of them in the standard model and the other in a scheme based on simple rank two times U(1)) by imposing suitable discrete symmetries and how under a certain small angle approximation that form may be regarded as the simplest member of a family of higher dimensionality forms.  相似文献   

12.
    
Nonlinear PDE’s having given conditional symmetries are constructed. They are obtained starting from the invariants of the conditional symmetry generator and imposing the extra condition given by the characteristic of the symmetry. Series of examples starting from the Boussinesq and including non-autonomous Korteweg–de Vries like equations are given to show and clarify the methodology introduced.  相似文献   

13.
混响背景下低秩矩阵恢复的目标亮点特征提取   总被引:2,自引:0,他引:2       下载免费PDF全文
有源声呐探测水下目标时,混响干扰增加了从目标回波信号中提取目标亮点特征的难度.依据目标回波与混响在时频域上能量分布的相关性不同,采用自适应核时频分析方法将目标回波信号变换到时频域上进行分析.通过低秩矩阵恢复方法将目标回波与混响分到稀疏矩阵和低秩矩阵中,从而分离目标回波与混响,降低混响对回波信号的干扰.针对稀疏矩阵采用Hough变换提取回波中的亮点峰,得到目标的亮点特征。通过仿真和实验数据证明在较低信混比情况下通过低秩矩阵恢复方法能够在时频域上进一步区分目标回波与混响,达到抑制混响的目的,便于获取目标亮点特征。  相似文献   

14.
    
Deep neural networks may achieve excellent performance in many research fields. However, many deep neural network models are over-parameterized. The computation of weight matrices often consumes a lot of time, which requires plenty of computing resources. In order to solve these problems, a novel block-based division method and a special coarse-grained block pruning strategy are proposed in this paper to simplify and compress the fully connected structure, and the pruned weight matrices with a blocky structure are then stored in the format of Block Sparse Row (BSR) to accelerate the calculation of the weight matrices. First, the weight matrices are divided into square sub-blocks based on spatial aggregation. Second, a coarse-grained block pruning procedure is utilized to scale down the model parameters. Finally, the BSR storage format, which is much more friendly to block sparse matrix storage and computation, is employed to store these pruned dense weight blocks to speed up the calculation. In the following experiments on MNIST and Fashion-MNIST datasets, the trend of accuracies with different pruning granularities and different sparsity is explored in order to analyze our method. The experimental results show that our coarse-grained block pruning method can compress the network and can reduce the computational cost without greatly degrading the classification accuracy. The experiment on the CIFAR-10 dataset shows that our block pruning strategy can combine well with the convolutional networks.  相似文献   

15.
高维预条件子的填充技术   总被引:1,自引:1,他引:1  
给出了高维问题差分离散后形成的大型稀疏线性代数方程组预条件子的填充技术,讨论了填充与加速效率、计算量的关系。并把这一技术在实际应用问题中进行检验。  相似文献   

16.
    
《Physics letters. A》2020,384(3):126065
We show that nonlocal reductions of systems of integrable nonlinear partial differential equations are the special discrete symmetry transformations.  相似文献   

17.
It is shown that the correct mathematical implementation of symmetry in the geometric formulation of classical field theory leads naturally beyond the concept of Lie groups and their actions on manifolds, out into the realm of Lie group bundles and, more generally, of Lie groupoids and their actions on fiber bundles. This applies not only to local symmetries, which lie at the heart of gauge theories, but is already true even for global symmetries when one allows for fields that are sections of bundles with (possibly) non-trivial topology or, even when these are topologically trivial, in the absence of a preferred trivialization.  相似文献   

18.
刘侃  杨磊  薛巍  陈文光 《计算物理》2024,41(1):22-32
本文提出新一代申威众核架构上稀疏通用矩阵-矩阵乘法(SpGEMM)的并行算法swSpGEMM。设计轻量级并行任务划分有效地应对了矩阵非零元分布引起的负载不均衡问题; 针对累加过程中的不规则访存和指令流水低效问题, 设计了分层稀疏累加器, 在不同输入特征下高效利用申威从核层次化内存, 且减少了整数查找中的指令间依赖, 更有效地发挥硬件的计算能力。SuiteSparse稀疏矩阵测试集中较大规模输入矩阵上, swSpGEMM的性能相比Intel Skylake双CPU上的MKL和NVIDIA A100上的cuSPARSE分别加速了21.1%和95.3%。  相似文献   

19.
Martin Hirsch 《Pramana》2009,72(1):183-193
Recent neutrino oscillation experiments have measured leptonic mixing angles with considerable precision. Many theoretical attempts to understand the peculiar mixing structure, observed in these measurements, are based on non-Abelian flavour symmetries. This talk concentrates exclusively on models based on the non-Abelian symmetry A 4. A 4 is particularly well suited to describe three family mixing, and allows to explain the near tri-bimaximal mixing observed. Special emphasis is put here on the discussion of the neutrinoless double beta decay observable 〈:m ν 〉. Different models based on A 4 with very similar predictions for neutrino angles can yield vastly different expectations for 〈m ν 〉. Neutrinoless double beta decay can thus serve, in principle, as a discriminator between different neutrino mass models.   相似文献   

20.
It has been pointed out by Hall et al. [Gen. Rel. Gray. 28 (1996) 299.] that matter collineations can be defined by using three different methods. But there arises the question whether one studies matter collineations by using LεTab=0, or LεT^ab = 0 or LεT^b a=0. These alternative conditions are, of. course, not generally equivalent. This problem has been explored by applying these three definitions to general static spherically symmetric spacetimes. We compare the results with each definition.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号