A hybrid homogeneously weighted moving average control chart for process monitoring: Discussion

The sensitivity of a monitoring scheme depends on many factors including the variance of the charting statistic which is very important in the computation of the control limits. This paper discusses the computation of the variance of the recently proposed hybrid homogeneously weighted moving average (HHWMA) $\overline{X}$ scheme which was based on an incorrect assumption. The correct variance is used to evaluate the run-length characteristics of the HHWMA $\overline{X}$ scheme. It is observed that the incorrect variance has a significant impact on the sensitivity (or performance) of the HHWMA $\overline{X}$ scheme.     

New Algorithm for Binary Connected-Component Labeling Based on Run-Length Encoding and Union-Find Sets

Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling (CCL) algorithm, a new algorithm for binary connected components labeling based on run-length encoding (RLE) and union-find sets has been put forward. The new algorithm uses RLE as the basic processing unit, converts the label merging of connected RLE into sets grouping in accordance with equivalence relation, and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE. And the label merging procedure has been optimized: the union operation has been modified by adding the "weighted rule" to avoid getting a degenerated-tree, and the "path compression" has been adopted when implementing the find operation, then the time complexity of label merging is O(nα(n)). The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly, save more memory, and facilitate the subsequent image analysis.     

连通域标记并行算法在多核处理器上的设计和实现

为满足全方位视觉运动目标检测跟踪系统中检测和跟踪实时性的要求,采用多核程序设计和并行处理技术,对系统中连通域标记算法,重新进行了设计和实现。为解决由图像分割造成的连通域的分离,应用边界处的游程码,将两个不同任务块中分割处的连通域合并成一个连通域。最后通过实验证明该并行算法比传统算法在多核处理器上运行更快,更好地解决了多核处理器饥饿问题,让多核处理器发挥了更高的效率。     

用扫描链重构来提高EFDR编码的测试压缩率和降低测试功耗

为了解决系统芯片测试中日益增长的测试数据和测试功耗的问题,提出一种不影响芯片正常逻辑功能的扫描链重构算法--Run-Reduced-Reconfiguration(3R).该算法针对扩展频率导向游程(EFDR)编码来重排序扫描链和调整扫描单元极性,重新组织测试数据,减少了游程的数量.从而大人提高了EFDR编码的测试压缩率并降低测试功耗;分析了扫描链调整对布线长度带来的影响后,给出了权衡压缩率和布线长度的解决方案.在ISCAS89基准电路上的实验结果表明,使用3R算法后,测试压缩率提高了52%,测试移位功耗降低了53%.     

Efficient Compositing Methods for the Sort-Last-Sparse Parallel Volume Rendering System on Distributed Memory Multicomputers

In the sort-last-sparse parallel volume rendering system on distributed memory multicomputers, one can achieve a very good performance improvement in the rendering phase by increasing the number of processors. This is because each processor can render images locally without communicating with other processors. However, in the compositing phase, a processor has to exchange local images with other processors. When the number of processors exceeds a threshold, the image compositing time becomes a bottleneck. In this paper, we propose three compositing methods to efficiently reduce the compositing time in parallel volume rendering. They are the binary-swap with bounding rectangle (BSBR) method, the binary-swap with run-length encoding and static load-balancing (BSLC) method, and the binary-swap with bounding rectangle and run-length encoding (BSBRC) method. The proposed methods were implemented on an SP2 parallel machine along with the binary-swap compositing method. The experimental results show that the BSBRC method has the best performance among these four methods.     

基于游程编码思想的条码定位与识别方法

在复杂背景中的定位条码是图像式条码识别系统中的一个关键步骤,在复杂的背景中快速、自动地检测出条形码是文章研究的主要内容。该文首先介绍了条型码的编码结构,然后提出了一种基于游程编码思想的条码定位与识别方法,最后通过相关实验结果验证了该算法的可行性和实用性。     

基于游程编码的块边缘模式图像检索算法

提出一种利用块边缘模式来进行图像检索的方法。该方法对图像中每个8×8块分别提取其块边缘模式,然后利用游程编码的原理,用块边缘模式构成图像的特征向量,以便进行基于内容的图像检索。所有数据在DCT压缩域中进行处理,不需要解压缩,从而降低了计算复杂度。实验结果表明,该算法与传统的基于DCT域的图像检索方法相比,具有更好的图像检索性能。     

基于游程编码的连通区域标记算法优化及应用

为提高空间液滴蒸发实验中图像实时反馈控制系统的鲁棒性,在液滴的边缘提取中采用了连通区域标记算法,并从两个方面对该算法进行了优化,从而在实时图像处理中获得较快的处理速度和较小的内存占用。一是在DSP实时图像处理中应用了游程编码来减少对象数量和存储所需空间;二是优化了Suzuki的连通区域标记算法,解决了该算法在一次扫描的赋值过程中可能会出现标记等价信息丢失的问题,通过改变对标记连接表的赋值,实现了只需要一次扫描就能获得完整的标记等价信息。实验结果表明,优化算法比传统算法运行速度更快并减少了内存占用。     

指纹图像复合分割算法研究

良好的指纹分割能够有效提高特征提取精度和减少后续处理时间,在指纹图像预处理中具有重要作用。文章在分析了传统指纹分割方法优缺点后,改进了传统方向图计算方法,然后提出了一种基于方向图法、方差法和跑长码目标标记法的复合分割方法,通过实验证明,这种方法能够有效解决传统方法的一些缺点,并对不同类型指纹图像有较高的适应性。     

基于快速连通域分析的目标特征提取算法

基于子区域思想,提出了一种快速的连通域分析方法用于提取视频目标特征。算法只需对图像进行一遍扫描,就可以用一棵多叉树描述出连通域各子区域之间的等价关系,同时由多叉树支节点向根节点完成目标特征提取并将特征保存在多叉树的根节点中。算法占用内存小,具有很高的运行效率。