基于数据重建的三角网格模型简化优化方法

由CT切片数据重建得到的三角网格模型常存在数据量大、狭长三角形多等问题,针对这些问题,研究了一种保持特征的高质量三角网格模型的简化优化方法。该方法分为网格简化和网格优化两个阶段。首先,采用基于曲面变化的二次误差度量计算边折叠代价,并按代价值的大小进行迭代的折叠简化,可较好地保持模型表面的特征;其次,通过二阶加权伞算子对简化模型中局部存在的狭长三角形进行优化处理,改善三角网格模型的质量。实验结果表明,该方法能够较好地保持特征区域的细节信息,并可靠地生成高质量、低几何误差的简化模型。     

基于广义S变换和奇异值分解的近红外光谱去噪

针对近红外光谱物质含量检测过程中噪声影响模型精度和稳定性的问题,引入广义S变换与奇异值分解(SVD)。利用广义S变换得到光谱数据的时频谱,并将二维时频谱系数矩阵作为SVD的Hankel矩阵求解奇异值,再采用k-均值聚类算法对奇异值序列进行分类计算,确定重构奇异值个数,对去噪后的数据矩阵进行广义S逆变换得到去噪后的光谱数据。给出组合方法的基本理论和具体实现过程,对仿真数据和谷朊粉导数光谱进行去噪,并与传统的9点平滑法和小波软阈值法的去噪结果进行比较。结果表明:所提方法克服了时域或频域单维滤波的局限性,且无需参考噪声数据和选择基函数,在谷朊粉导数光谱去噪中,只需采用两个奇异值就能实现较好的去噪效果,降低了滤波过程的复杂度。采用所提方法处理后,近红外光谱的分析精度和模型的稳健性优于9点平滑处理法和小波软阈值法。相比9点平滑法,所提方法的预测集的决定系数由0.9436增大为0.9985,预测均方根误差由0.0843减小为0.0406,明显提高了谷朊粉中水分含量定量检测的精度。     

应用小波分析进行油菜籽红外光声光谱去噪

为探究小波分析对油菜籽红外光声光谱的去噪效果,利用db6小波4尺度分解对其进行去噪研究.对比分析低频系数重构、缺省阈值、Birge-Massart阈值和4种自适应阈值(Rigrsure、Minimaxi、Rigsure和Sqtwolog)模型等模型的去噪效果.同时与Savitzky-Golay卷积平滑和快速傅里叶变换的去噪效果进行比较.研究表明,Birge-Massart阈值模型的综合小波去噪效果最好,同时小波去噪的方法较Savitzky-Golay卷积平滑和快速傅里叶变换去噪可以更好地捕获光谱的尖峰特征.     

基于凸优化的傅里叶叠层成像技术研究

在傅里叶叠层成像（FPM）过程中采集的低分辨率图像会对重建图像质量产生直接影响,已有的研究提出用图像超分辨率重建技术和对低分辨率图像进行传统去噪处理的方法来解决该问题,但超分辨率重建的方法需要采集大量的原始图像,会加大采集端的时间损耗,而传统去噪算法会造成原始信息丢失,严重影响重构图像质量。因此论文引入凸优化算法,噪声图像的恢复可以通过求解一个凸优化模型来实现,并用迭代收缩阈值算法来求解该模型,算法中采用Barzilai-Borwein（BB）规则在每次迭代时初始化线搜索步长,加快收敛速度,选用软阈值函数,使图像去噪时原始信息丢失减少,最终重构图像的PSNR为27.634 6 dB,SSIM为0.926 1,所需处理时间为5.850 s,因此基于凸优化的傅里叶叠层成像技术具有时间损耗不大的情况下提高重构图像质量的优点。     

基于赛利斯模型和分数阶微分的兰姆波信号消噪

为降低噪声对超声兰姆波检测信号的影响,提高信噪比和增加特征提取的精度,提出了一种赛利斯模型下分数阶微分方法用于超声兰姆波信号去噪.该方法对含噪声的兰姆波信号幅值谱进行各阶分数微分,用赛利斯分布作为待处幅值谱的模型,提出了幅值谱分数阶微分最大值和过零点与微分阶数的拟合三次关系式,建立了幅值谱特征参数的计算式来提取特征参数和重建原始信号的幅值谱,并结合相位谱重构去噪后的兰姆波信号.仿真结果表明,该方法可以有效地提高兰姆波信号甚至微弱兰姆波信号的信噪比,同时降低均方误差和平滑度.实验结果显示,与小波去噪和集合经验模态去噪方法相比,该方法在没有信号先验知识的情况下,可以更有效地去除兰姆波信号的噪声,同时更好地保留主信号的细节特征.因此,本文提出的方法可以有效地去除兰姆波检测信号中混入的噪声.     

并行重叠/变形混合网格生成技术及其应用

为了适用于柔性变形、相对运动等复杂动边界问题,建立了并行环境下重叠和变形相结合的动态混合网格生成技术.通过计算区域分解以及分布式并行实现了重叠和变形技术的结合,其中重叠网格采用了并行化的隐式装配方法,并发展了两种并行化查询策略.变形网格则采用了并行化的径向基函数（RBF）插值方法.并行化动态网格生成方法大幅提高了动态网格生成效率,有利于处理大规模的动边界问题.在此基础上,发展了基于变形/重叠动态混合网格的流动/运动/控制一体化数值模拟方法,进一步改进了耦合模拟软件平台——HyperFLOW.典型应用算例证明了该动态混合网格技术及一体化算法的实用性.      

保特征的自适应三角网格规范化算法

为了提高基于工业CT图像重构的三角网格质量，提出了顶点调整和特征因子相结合的网格规范化算法。引入模型特征因子和局部网格质量提高程度作为网格调整的控制条件，保留原始模型的局部细节特征；采用法矢量阈值按规律递增的方式自适应控制网格调整，实现不同曲率特征的自动识别。实验结果表明，与现有方法相比，该方法能更好地规范模型的三角网格，同时保留了原始模型的细节特征。     

多点择优推进阵面法生成曲面三角形网格

在现有曲面非结构网格生成法的基础上,提出了一种新的曲面网格生成法——多点择优推进阵面法.它可在曲面上直接进行三角形网格划分,克服了映射法的网格变形问题,并且可以在网格生成结束后,对曲面网格直接进行Laplace格点松弛光顺.该方法使用简单,不受曲面块类型的限制,且网格质量高,可以为三维非结构网格生成提供高质量的初始阵面,并给出了若干个算例.     

自适应多尺度窗口平均光谱平滑

去噪算法是极其重要的光谱预处理步骤,能够显著提高后续光谱分析算法的准确性。然而,大多数去噪算法都需要通过反复试验的方式来人为设置初始参数,不能自动完成光谱去噪。为了能够对光谱进行自动且可靠的平滑去噪,提出了一种自适应多尺度窗口平均平滑(AMWA)去噪算法。该算法针对光谱中不同位置采用不同宽度的平滑窗口,这些窗口的宽度将直接影响到平滑效果。当窗口宽度选择不合适时,可能出现去噪过度,使得峰畸变或者丢失;也有可能导致去噪不足,使得光谱的较平坦区域仍包含大量的噪声。因此判断每个窗口宽度是否合适,是光谱平滑的关键。该算法通过迭代的方法不断优化各个窗口的宽度,并以统计学中的Z检验来判断窗口宽度是否为最佳。另外,为了提高假设检验的可靠性,用不同信噪比的模拟数据对假设检验中使用的阈值进行比较,发现当阈值设为1.1时可使去噪效果最佳。用模拟光谱和实际光谱对该算法进行了测试,该算法能够自动适应不同的光谱形状和噪声强度。还将AMWA去噪算法与SG算法及移动窗口平均平滑算法进行了全面的比较,AMWA算法都明显优于其他两种算法。结果表明AMWA算法不仅去噪效果更好,而且准确性及保真性也更高,对模拟光谱和实际光谱都具有极好的平滑效果。     

结构型网格分块生成技术

构造了一种适用于模拟具有复杂几何特征的流动问题的结构型网格生成方法,该方法应用CAD技术中非均匀有理B样条(NURBS)曲面表达形式,根据给定物体的典型站位截面,首先对物体进行分片表面网格的构造与重构,同时根据物体几何特征及流场特性对绕流流场进行区域分解并构造其块边界,在此基础上再采用数值方法进行相应的分块网格生成,并给出了应用所建立的方法生成的几种天地往返运输系统流场网格.     

Surface mesh denoising via diffusing gradient field

Surface mesh denoising is an important preprocess for many digital geometrical applications. Unlike most previous smoothing algorithms, which are vertex- or normal-based, we present a smoothing approach based on gradient field. The proposed algorithm first applies an extended non-local means image filter to diffuse mesh gradient field and then reconstructs a smoothed surface from the smoothed field by solving the Poisson equations in the least-squares sense. Experimental results on various data demonstrate that the proposed approach can successfully remove noise from meshes while preserving geometrical detail features of the original object and avoiding significant volume shrinkage.     

基于质心Voronoi图重构的UDSM边折叠简化

城市数字表面模型网格(UDSM)的相邻网格常常出现曲率剧变，而这些位置是UDSM的细节部分，简化过程中应当尽量保持。针对该情况，引入了质心Voronoi图重划分网格，将曲率较小的表面的点云密度大大降低。重划分的网格表面细节与周围的平滑表面的三角网格尺寸悬殊，在该基础上使用二次误差矩阵边折叠进行LOD构建时网格发生明显变化，范围大大减少。算法在时间性能与网格误差与直接边折叠相近的前提下，更多地保存简化后的网格细节。     

Semi-implicit surface tension formulation with a Lagrangian surface mesh on an Eulerian simulation grid

We present a method for applying semi-implicit forces on a Lagrangian mesh to an Eulerian discretization of the Navier Stokes equations in a way that produces a sparse symmetric positive definite system. The resulting method has semi-implicit and fully-coupled viscosity, pressure, and Lagrangian forces. We apply our new framework for forces on a Lagrangian mesh to the case of a surface tension force, which when treated explicitly leads to a tight time step restriction. By applying surface tension as a semi-implicit Lagrangian force, the resulting method benefits from improved stability and the ability to take larger time steps. The resulting discretization is also able to maintain parasitic currents at low levels.     

A fourth-order adaptive mesh refinement algorithm for the multicomponent,reacting compressible Navier–Stokes equations

In this paper, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.     

自适应结构网格上扩散方程隐式时间积分算法及其应用

提出一种自适应结构网格(SAMR)上求解扩散方程的隐式时间积分算法.该算法从粗网格到细网格逐层进行时间积分,通过多层迭代同步校正保证粗细界面的流连续和计算区域的扩散平衡.分析算法复杂度,并给出评估算法低复杂度的准则.典型算例表明,相对于一致加密情形,本文算法能够在保持相同计算精度的前提下,大幅度降低网格规模和计算量,且具有低复杂度.将算法应用于辐射流体力学数值模拟中非线性扩散方程组求解,相对于一致加密网格,SAMR计算将计算量下降一个量级以上,计算效率提高33.2倍.     

The differential characteristics of control rods of VVER-1000 core simulator at a low number of axial mesh points

An algorithm for refining the differential characteristics of the control rods (CRs) of the control and protection system (CPS) for a neutronics model of the VVER-1000 simulator at a low number of axial mesh points of the core is described. The problem of determining the constants for a cell with a partially inserted CR is solved. The cell constants obtained using the proposed approach ensure smoothing of the differential characteristics of an absorbing rod. The algorithm was used in the VVER-1000 simulators (Bushehr NPP, unit no. 1; Rostov NPP, unit no. 1; and Balakovo NPP, unit no. 4).     

Simulating finger phenomena in porous media with a moving finite element method

The non-equilibrium Richards equation is solved using a moving finite element method in this paper. The governing equation is discretized spatially with a standard finite element method, and temporally with second-order Runge–Kutta schemes. A strategy of the mesh movement is based on the work by Li et al. [R.Li, T.Tang, P.W. Zhang, A moving mesh finite element algorithm for singular problems in two and three space dimensions, Journal of Computational Physics, 177 (2002) 365–393]. A Beckett and Mackenzie type monitor function is adopted. To obtain high quality meshes around the wetting front, a smoothing method which is based on the diffusive mechanism is used. With the moving mesh technique, high mesh quality and high numerical accuracy are obtained successfully. The numerical convergence and the advantage of the algorithm are demonstrated by a series of numerical experiments.     

Scalable parallel methods for monolithic coupling in fluid–structure interaction with application to blood flow modeling

We introduce and study numerically a scalable parallel finite element solver for the simulation of blood flow in compliant arteries. The incompressible Navier–Stokes equations are used to model the fluid and coupled to an incompressible linear elastic model for the blood vessel walls. Our method features an unstructured dynamic mesh capable of modeling complicated geometries, an arbitrary Lagrangian–Eulerian framework that allows for large displacements of the moving fluid domain, monolithic coupling between the fluid and structure equations, and fully implicit time discretization. Simulations based on blood vessel geometries derived from patient-specific clinical data are performed on large supercomputers using scalable Newton–Krylov algorithms preconditioned with an overlapping restricted additive Schwarz method that preconditions the entire fluid–structure system together. The algorithm is shown to be robust and scalable for a variety of physical parameters, scaling to hundreds of processors and millions of unknowns.     

A new paradigm for signal processing of Raman spectra using a smoothing free algorithm: Coupling continuous wavelet transform with signal removal method

Noise removal is considered a primary and inevitable step for background correction in experimentally obtained Raman spectra. Employing an appropriate algorithm for a smoothing‐free background correction technique not only increases the speed but also eliminates unwanted errors from the smoothing algorithms. Herein, we show a new smoothing‐free method for background correction, which we developed by merging continuous wavelet transform and signal removal method, which in combination, could be applied to noisy signals without smoothing. We used wavelet transformation for suppressing the side effects of noise and eliminating peaks from the spectrum, thereby providing spectral sections purely related to the background to be used in the background correction process. We applied a range of statistical analyses to test the performance of this algorithm, wherein a low deviation in background correction procedure was observed. Additionally, when we tested this algorithm for experimentally obtained real Raman spectra, it showed good capability to correct background of noisy signals without the requirement of a smoothing process. Copyright © 2013 John Wiley & Sons, Ltd.