针对SPIHT(set partitioning in hierarchical trees)算法的编码过程具有重复运算、存储量大等问题,提出了一种适合于DSP(digital signal processors)处理的低内存并行SPIHT算法。该算法采用乒乓缓存策略,使得数据的传输和编码能够同时...针对SPIHT(set partitioning in hierarchical trees)算法的编码过程具有重复运算、存储量大等问题,提出了一种适合于DSP(digital signal processors)处理的低内存并行SPIHT算法。该算法采用乒乓缓存策略,使得数据的传输和编码能够同时进行。通过引入基于行的整型提升方案,使得只需经少量行变换就能进行列变换,提高了小波的变换速度。根据DSP的并行特性和SPIHT算法的缺点,采用“改进的最大幅值求取方法”、“误差位数以及绝对零值和绝对零集合”、“最大值与零值图”和“单棵零树编码”等多种方法对其进行了改进,大大缓解了对内存的压力,减少了算法的运算量。该算法与LZC(listless zerotree coding)算法相比,重构图像的峰值信噪比相当,但速度提高了2倍,能满足一般的实时压缩要求。展开更多
A new fault diagnosis technique for rolling element bearing using multi-scale Lempel-Ziv complexity(LZC) and Mahalanobis distance(MD) criterion is proposed in this study. A multi-scale coarse-graining process is used ...A new fault diagnosis technique for rolling element bearing using multi-scale Lempel-Ziv complexity(LZC) and Mahalanobis distance(MD) criterion is proposed in this study. A multi-scale coarse-graining process is used to extract fault features for various bearing fault conditions to overcome the limitation of the single stage coarse-graining process in the LZC algorithm. This is followed by the application of MD criterion to calculate the accuracy rate of LZC at different scales, and the best scale corresponding to the maximum accuracy rate is identified for fault pattern recognition. A comparison analysis with Euclidean distance(ED) criterion is also presented to verify the superiority of the proposed method. The result confirms that the fault diagnosis technique using a multi-scale LZC and MD criterion is more effective in distinguishing various fault conditions of rolling element bearings.展开更多
文摘提出了一种改进的 L ZC(listless zerotree coding)图像编码算法 ,该算法不仅继承了原有 L ZC算法不使用链表、易于硬件实现的优点 ,而且针对原始算法子带扫描顺序不尽合理、递归结构算法复杂度较高等缺点 ,通过改变空间子带的编码顺序 ,将块的概念引入编码过程在改进算法中完全采用顺序结构等措施进一步提高了原有算法的工作效率、降低了 L ZC算法的复杂度。实验结果表明 ,该算法是一种高效的图像编码算法 ,其不仅具有良好的视觉效果、无方块效应 ,而且在相同压缩比情况下 ,该算法的图像重构质量和 PSNR均明显优于原始的 L
文摘针对SPIHT(set partitioning in hierarchical trees)算法的编码过程具有重复运算、存储量大等问题,提出了一种适合于DSP(digital signal processors)处理的低内存并行SPIHT算法。该算法采用乒乓缓存策略,使得数据的传输和编码能够同时进行。通过引入基于行的整型提升方案,使得只需经少量行变换就能进行列变换,提高了小波的变换速度。根据DSP的并行特性和SPIHT算法的缺点,采用“改进的最大幅值求取方法”、“误差位数以及绝对零值和绝对零集合”、“最大值与零值图”和“单棵零树编码”等多种方法对其进行了改进,大大缓解了对内存的压力,减少了算法的运算量。该算法与LZC(listless zerotree coding)算法相比,重构图像的峰值信噪比相当,但速度提高了2倍,能满足一般的实时压缩要求。
基金the National Natural Science Foundation of China(No.51075220)the Special Research Fund for the Higher Education Doctoral Program(No.20123721110001)+1 种基金the Basic Research Project of Qingdao Science and Technology Plan(No.12-1-4-4-(3)-JCH)the Privileged Shandong Provincial Government’s "Taishan Scholar" Program
文摘A new fault diagnosis technique for rolling element bearing using multi-scale Lempel-Ziv complexity(LZC) and Mahalanobis distance(MD) criterion is proposed in this study. A multi-scale coarse-graining process is used to extract fault features for various bearing fault conditions to overcome the limitation of the single stage coarse-graining process in the LZC algorithm. This is followed by the application of MD criterion to calculate the accuracy rate of LZC at different scales, and the best scale corresponding to the maximum accuracy rate is identified for fault pattern recognition. A comparison analysis with Euclidean distance(ED) criterion is also presented to verify the superiority of the proposed method. The result confirms that the fault diagnosis technique using a multi-scale LZC and MD criterion is more effective in distinguishing various fault conditions of rolling element bearings.
