一种基于单层包络控制的三角形网格简化算法

三维物体的几何造型中,物体通常用三角形网格来描述.对于复杂物体的三角形网格模型,如人脸及人的各种器官的三维几何模型、各种动物的三维几何模型,其庞大的数据量给存储、传输以及渲染等方面带来了很大的困难,因而三角形网格模型的简化成为了当前国内外计算机图形学领域中的一大研究热点.本文在研究总结已有算法的基础上,提出了一种采用单层包络控制的三角形网格简化算法.该算法对Cohen提出的包络构造方法进行了改进,采用一维搜索中的二分法来逼近最佳偏移值,并且采用内层单包络来控制简化误差,从而有效地改善了算法的性能.实验结果表明,采用本算法简化的三角形网格模型,不仅可大大地减少三角形面片数,而且有一个较低的算法时间复杂度.     

面聚类网格简化新算法

三维物体表面重建广泛采用三角网格方法,密集的数据采样可以重建出精确的三维表面,但是庞大的数据量不利于多分辨率三维实时显示和三维物体网络传输,因此三维表面网格简化是迫切需要解决的问题之一.近年来表面简化问题得到了广泛地研究.本文提出基于面聚类的网格简化新算法,通过最小化最大类内距离算法进行面聚类实现区域划分,然后提取区域特征,进而根据特征点和边对区域进行受限三角剖分.实验说明本文提出的面聚类网格简化算法在保持三维表面几何拓扑特征的基础上取得了很好的简化效果.     

一种优化的虚拟手术肝脏软组织切割方法

针对虚拟手术中肝脏模型切割方法存在产生多个重构面、计算量大的问题,提出基于位置动力学模型的改进步进切割算法。首先根据简化后肝脏几何模型的三角网格与四面体网格耦合,并采用位置动力学算法使模型发生形变效果;接着当小球棒与肝脏模型之间发生碰撞时,采用的包围球与AABB包围盒混合的方式进行碰撞检测;最后利用改进的步进切割算法使肝脏模型的表面三角网格拆分切点与拓扑重组,完成模型产生切口的任务。实验结果表明,改进后的步进切割方法提高了软组织肝脏模型模拟切割时的实时性和稳定性。     

局部包络片控制误差简化三角网格模型

利用内外包络控制三角网格模型简化误差是一种可行的方法.但构造整个模型的内外包络需要花费较多的时间,且每次简化操作时也会进行大量重复的三角形相交检测,使算法效率下降.针对这些问题,本文提出了局部包络片控制误差的思想,即每次简化操作仅利用相关部分的包络来控制误差.算法采用三角形收缩操作简化模型,当原始模型上的一个三角形被选中,并尝试进行收缩操作时,先构造其对应的局部包络片;在该三角形收缩后,原来与之相邻的三角形将发生形变,若这些形变后的三角形位于局部包络片之间,则认为此次三角形收缩操作可以接受,否则予以取消.实验结果表明,局部包络片保持了良好的误差控制效果,且由于构造简单,很少发生自交现象,减少了三角形相交检测次数,提高了计算效率.     

三维几何数据压缩

介绍了一种对三角形网格的三维几何数据压缩算法,采用顺序树实现三维模型的拓扑结构压缩和几何数据压缩,可以达到在精度损失较小的情况下对拓扑结构和几何数据的有效压缩。     

三维几何数据压缩

介绍了一种对三角形网格的三维几何数据压缩算法,采用顺序树实现三维模型的拓扑结构压缩和几何数据压缩,可以达到在精度损失较小的情况下对拓扑结构和几何数据的有效压缩。     

基于改进MC算法的CT/MR图像三维重建

针对MC(Marching Cubes)算法重建后模型表面的不光滑性和模型表面三角面片数量大的缺点,提出了在保证一定精度的前提下减少小面片的处理方式。通过对等值面进行三维空间上的方向平滑来代替等值面上的三维坐标平滑,达到了提高模型表面平滑性的目的。以边删除算法为基础,设计了网格简化算法,实现了模型表面的网格简化。以喉管和心血管两组磁共振(Magnetic Resonance,MR)体数据为例进行三维表面重建的结果表明,平滑后的三维显示效果有了显著改善,显示的结构细节清晰度与真实感明显提高。模型的网格简化90%后,依然能保持原模型的特征和较好的视觉效果,并大大提高了实时交互绘制的能力,明显缩短了交互操作时间。     

基于顶点删除的三角网格模型简化新方法

为进一步提高海量三角网格模型的简化速度,在经典顶点删除算法的基础上,从顶点法向量的保持、平均平面的近似获取、顶点删除后所留空洞的直接三角化3方面进行了改进.实验结果表明,改进后的顶点删除算法对三角网格模型的简化速度显著加快,简化后的模型与原模型相比在视觉上保持了良好的一致性,证明了该算法的有效性和可靠性.     

基于VTK的医学图像三维重建研究

使用VTK工具包和MC重建算法开发了一套医学影像三维重建系统.由于重建后图像数据的处理时间和存储代价与三角形网格中三角形数量成正比, 过于复杂和细节化的网格会给图像数据的存储、传输、计算和实时绘制等带来负担, 故采用了顶点合并的三角形网格简化方法来减少三角形数量.     

基于27邻域网格的医疗图像三维重建

为实现医疗图像三维重建中的网格简化,提出一种基于27邻域网格建立三角形网格拓扑的新方法。首先利用移动立方体(MC)算法从一组计算机层析(CT)图像序列中提取三维重建体数据,将二维图像转化为由一组三角形面片组成的三维模型网;然后利用27邻域网格算法对此三角形网进行空间扫描,构建出三维模型的网格拓扑;最后利用二次误差测度(QEM)算法对所得三维模型拓扑进行简化,实现医疗图像三维模型动态可视化操作。通过使用Visual C++软件平台和OPENGL库对医疗图像进行三维重建,重建效果表明,本文方法的计算效率要优于传统的循环迭代方法;与传统的建立网格拓扑方法相比,本文方法具有算法简单、速度快、运算复杂度与数据量呈线性增长的优点。     

两类点绘制方法

对于复杂场景和物体实现实时高效的绘制,以点模型为基本元素的绘制比传统的三角网格绘制技术更有优势.针对点模型的各种应用,归纳了近30年点模型的发展,简要叙述了点模型的整体处理流程,详细分析了两类点绘制方法,基于质量的绘制方法和基于效率的绘制方法.利用双目相机获取深度图像,把点数据信息经过处理、建模和绘制得到屏幕上显示的图...     

Encoding of colour images using adaptive decimation andinterpolation

A low-complexity colour image compression scheme based on adaptive decimation is considered. Reconstruction of the encoded image is performed with an intelligent edge prediction algorithm which is capable of maintaining a reasonable coding fidelity, as well as a natural and pleasant visual effect for the object contours contained in the picture. The method involves only a small amount of computation in both the encoding and decoding processes and hence can be implemented to operate in real time with simple hardware and a small amount of memory storage. Results obtained by applying the proposed scheme for encoding colour images at a high compression ratio are presented to demonstrate the feasibility of the approach and its potential in practical applications     

A switched-capacitor preprocessor for speech recognition

A switched-capacitor (SC) preprocessing system (preprocessor) which extracts and emphasizes the local peaks of the spectrum in real time is proposed for speech recognition systems. Main components of the system are a specially designed bandpass filter bank, a low-pass decimation filter bank, two-dimensional local peak extraction (LPE) filters, and a LPE filter selection circuit. Furthermore, a SC cascaded integrator-comb filter design technique is proposed to realize the decimation low-pass filter and the LPE filter. Finally, the system is tested by using two speech recognition systems.     

Power-Efficient Clock/Data Distribution Technique for Polyphase Comb Filter in Digital Receivers

A power-efficient clock/data distribution technique for the input registers of the polyphase comb decimation filter is presented. A general form of the proposed technique is developed with respect to the decimation factor. Both proposed and conventional comb filters are implemented using Xilinx Spartan3 low-power field-programmable gate array family. The implementation results show that applying the proposed technique reduces the dynamic power consumption of the second- and third-order polyphase comb filters up to 62.87% and 57.6%, respectively, depending on the decimation factor and the number of quantizer bits. For a particular power consumption, a higher input sampling rate can be utilized by applying the proposed technique. Consequently, the signal-to-noise ratio of a second-order $SigmaDelta$ modulator is increased using second- and third-order modified filters by 21.6 and 20.5 dB, respectively, depending on the decimation factor and the number of quantizer bits.      

A modified TLS-Prony method using data decimation

The paper introduces a modified TLS-Prony method that incorporates data decimation. The use of data decimation results in the reduction in the computational complexity because one high-order estimation is replaced by several low-order estimations. The authors present an analysis of pole variance statistics for this modified TLS-Prony method. This analysis provides a quantitative comparison of the parameter estimation accuracy as a function of decimation factors. The authors show that by using decimation, one can obtain comparable statistical performance results at a fraction of the computational cost, when compared with the conventional TLS-Prony algorithm     

改进的宽带信号有理数倍采样率变换结构

针对现有的数字器件无法满足对宽带信号进行有理数倍采样率变换的问题,提出了一种改进的宽带信号有理数倍采样率转换结构.在分析抽取器与内插器顺序的基础上,得出了等效变换的前提条件,并结合多相滤波结构使改进的结构更具有实际应用价值.仿真实验证明了改进后结构的有效性.通过与现有有理数倍采样率变换结构运算量对比分析表明,改进后的结构的运算效率为传统结构运算效率的1/(LM)倍,其中L和M为变换过程中的内插因子和抽取因子.     

软件无线电数字中频处理的优化设计

软件无线电是目前通信领域研究的热点,其关键技术之一数字中频技术是多速率信号处理理论的典型应用。本文研究了窄带信号条件下,高倍抽取的数字下变频设计,重点分析了基于CIC滤波器和HB滤波器的多级抽取算法。经比较,该设计比单级多相抽取设计节省98.8％的资源,完全可在单片FPGA内实现,而且,滤波性能优于设计指标要求。     

Fully synthesised decimation filter for delta-sigma A/D converters

Digital decimation filters are used in delta-sigma analogue-to-digital converters to reduce the oversampled data rate to the final Nyquist rate. This paper presents the design and implementation of a fully synthesised digital decimation filter that provides a time-to-market advantage. The filter consists of a cascaded integrator-comb filter and two cascaded half-band FIR filters. A canonical signed-digit representation of the filter coefficients is used to minimise the area and to reduce the hardware complexity of the multiplication arithmetic. Coefficient multiplications are implemented by using shifters and adders. This three-stage decimation filter is fabricated by using 0.25-μm CMOS technology with an active area of 1.36 mm² and shows 4.4 mW power consumption at a clock rate of 2.8224 MHz. Experimental results show that this digital decimation filter is suitable for use in oversampled data converters and can be applied to new processes requiring a fast redesign time. This is possible because the filter does not have process-dependent ROM or RAM circuits.     

A Low-Complexity PTS-Based Radix FFT Method for PAPR Reduction in OFDM Systems

A low-complexity partial transmit sequence (PTS) technique for reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) signal is presented. Signals at the middle stages of an -point radix FFT using decimation in frequency (DIF) or decimation in time (DIT) are considered for PTS subblocking. We show that DIF has a lower multiplicative complexity than DIT for similar PAPR reduction. A higher radix based FFT achieves better PAPR reduction per stage with less multiplicative complexity compared with a lower radix FFT. We further reduce the computational complexity by proposing a new technique, called decomposition PTS (D-PTS) subblocking, where subblocks are assigned through different stages of the transform. This new technique reduces the multiplicative complexity, while providing PAPR reduction similar to other techniques such as original PTS (O-PTS). Moreover, it has lower additive complexity.     

用于开放式系统的二维优先级实时调度

提出了一种新的用于开放式系统的调度机制,即二维优先级实时调度,它不仅划分任务优先级,还划分调度策略优先级.任务的执行顺序由其调度策略优先级和任务优先级共同决定.它不仅可以解决传统优先级调度机制中机制与调度策略不能相分离的问题,还提高了效率.这种机制中引入的CPU带宽控制策略,可以根据需要实现硬实时、软实时、混合实时不同目标的实时系统,并简化了任务可调度性分析,且可以为不同权限或级别的用户提供不同QoS服务.这种调度架构不仅效率高,而且具有很强的开放性,适用广、易扩展.