加权二次有理Bézier插值曲线

在本文中,给定一组有序空间数据点列及每个数据点的切矢向量,利用加权二次有理Bézier曲线对数据点作插值曲线,使该曲线具有C1连续性,并且权因子只是对相应顶点曲线附近产生影响,同调整两个相邻的权因子可以调整这两个相邻顶点之间的曲线和它的控制多边形.     

Degenerate polynomial patches of degree 11 for almostGC 2 interpolation over triangles

We consider the problem of interpolating scattered data in ³ by analmost geometrically smoothGC ² surface, where almostGC ² meansGC ² except in a finite number of points (the vertices), where the surface isGC ¹. A local method is proposed, based on employing so-called degenerate triangular Bernstein-Bézier patches. We give an analysis of quintic patches forGC ¹ and patches of degree eleven for almostGC ² interpolation.     

Measurement of rail cross-section with solid-state sensor arrays

The application of light sectioning to the accurate measurement of a rail cross-section, from a train moving at high speed, is described. The intensity distribution through the thickness of the illuminating light sheet is deliberately graded, allowing the shape of the object to be recovered more accurately by interpolation of the sampled image. Rail profiles are extracted with a definition approximately ten-times better than that of the sampled image.     

一类重心权Hermite有理插值的二阶导数收敛性

研究了一类特殊情形\left(m=\mathrm{1}\right)的重心权Hermite有理插值,证明了该插值函数的二阶导数r_{\mathrm{1}}^{″}\text{?}\left(x\right)在插值节点和非插值节点处分别以O\left(h^{\mathrm{2}d-\mathrm{1}}\right)和O\left(h^{\mathrm{2}d-\mathrm{3}}\right)的速度收敛于函数f^{″}\text{?}\left(x\right)。数值例子进一步验证了方法的有效性。     

一种用硬件实现的Bayer格式图像恢复算法

针对传统的双线性Bayer彩色图像恢复算法恢复效果不理想,边界部分不明显,局部图像有团块等问题,提出了一种基于硬件实现的Bayer图像快速插值算法。采用梯度算法对Bayer格式图像绿色通道进行恢复,根据像素点所属的颜色组对蓝色通道进行恢复。实验结果表明,本文算法比双线性法有更好的峰值信噪比(PSNR)值,RGB 3个通道的PSNR值均比双线性法高5 dB以上,而且算法消耗时间比双线性法少,恢复的图像视觉效果更好。实验处理一幅512×512的全彩图像仅需要9.3 ms,完全可以满足实时性的要求,因此,本文算法在对实时性要求高的场合有很好的应用前景。     

三维面形测量中基于模版匹配的变形条纹修复

在基于条纹投影和相位分析的三维面形测量中,由于被测物体表面标志点或复杂面形的阴影遮挡存在,会造成变形条纹局部区域的条纹数据缺失,影响相位和高度信息的最终重建,需要人为地对缺失图像信息进行修复。提出了一种新的缺失条纹数据修复方法——基于模版匹配的图像修复算法,通过图像中已有条纹信息(特别是与待修复区域周围相位信息相似度较高的已知条纹信息)对缺失的变形条纹信息进行估算,实现数据修复。该方法修复效果好,运算过程无需人为参与,便于计算机自动实现,尤其适合于待修复图像整体结构明显、纹理清晰图像的数据修复,有助于提高被测物体相位计算质量和在此基础上的三维面形重建质量。     

Artifact Reduction Based on Sinogram Interpolation for the 3D Reconstruction of Nanoparticles Using Electron Tomography

Electron tomography is a well‐known technique providing a 3D characterization of the morphology and chemical composition of nanoparticles. However, several reasons hamper the acquisition of tilt series with a large number of projection images, which deteriorate the quality of the 3D reconstruction. Here, an inpainting method that is based on sinogram interpolation is proposed, which enables one to reduce artifacts in the reconstruction related to a limited tilt series of projection images. The advantages of the approach will be demonstrated for the 3D characterization of nanoparticles using phantoms and several case studies.     

Fast evaluation of Helmholtz potential on graphics processing units (GPUs)

This paper presents a parallel algorithm implemented on graphics processing units (GPUs) for rapidly evaluating spatial convolutions between the Helmholtz potential and a large-scale source distribution. The algorithm implements a non-uniform grid interpolation method (NGIM), which uses amplitude and phase compensation and spatial interpolation from a sparse grid to compute the field outside a source domain. NGIM reduces the computational time cost of the direct field evaluation at N observers due to N co-located sources from O(N²) to O(N) in the static and low-frequency regimes, to O(N log N) in the high-frequency regime, and between these costs in the mixed-frequency regime. Memory requirements scale as O(N) in all frequency regimes. Several important differences between CPU and GPU implementations of the NGIM are required to result in optimal performance on respective platforms. In particular, in the CPU implementations all operations, where possible, are pre-computed and stored in memory in a preprocessing stage. This reduces the computational time but significantly increases the memory consumption. In the GPU implementations, where handling memory often is a critical bottle neck, several special memory handling techniques are used to accelerate the computations. A significant latency of the GPU global memory access is hidden by implementing coalesced reading, which requires arranging many array elements in contiguous parts of memory. Contrary to the CPU version, most of the steps in the GPU implementations are executed on-fly and only necessary arrays are kept in memory. This results in significantly reduced memory consumption, increased problem size N that can be handled, and reduced computational time on GPUs. The obtained GPU–CPU speed-up ratios are from 150 to 400 depending on the required accuracy and problem size. The presented method and its CPU and GPU implementations can find important applications in various fields of physics and engineering.     

有耗介质层上多导体传输线的电磁耦合时域分析方法

目前,针对空间电磁场作用有耗介质层上传输线的电磁耦合,仍缺乏有效的数值分析方法.因此,本文提出一种高效的时域混合算法,很好地解决了有耗介质层上传输线电磁耦合建模难的问题.首先,对经典传输线方程进行改进,推导了适用于有耗介质层上多导体传输线电磁耦合分析的修正传输线方程.然后,结合时域有限差分方法和相应插值技术,求解修正传输线方程,获得多导线及其端接负载上的电压和电流响应,并实现空间电磁场辐射与多导线瞬态响应的同步计算.最后,通过相应计算实例的数值模拟,与CST软件的仿真结果进行对比,验证了时域混合算法的正确性和高效性.