种子填充算法改进

本文对种子填充算法进行了分析,提出了使用基于8-连通的射线扫描算法,减少了大量的种子点重复出栈入栈操作,节省了大量存储空间和存取时间。并改进了在填充中出现的填充溢出现象。经过实验验证,该算法能够快速填充给定的不规则区域,提高了填充效率。     

复杂连通区域扫描线填充算法的问题及改进

针对复杂连通区域扫描线填充算法可能出现的重复填充错误，分析了产生错误的原因，并给出了相应的改进办法．从而实现了复杂连通区域的快速正确填充。     

基于立方剪枝的短语机器解码算法改进

柱搜索算法是短语统计机器翻译广泛使用的解码算法.文中在立方剪枝算法的基础上提出了另一种对柱搜索算法的改进算法-基于立方剪枝的逆向递归算法.柱搜索算法对栈中所有的假进行扩展,立方剪枝算法有选择地扩展栈中的前k个最好假设,而基于立方剪枝的逆向递归算法只扩展栈中评分高的假设.实验结果表明获得相同的翻译质量,立方剪枝算法比柱搜索算法快10倍,立方剪枝的改进算法在大规模语料中比立方剪枝算法更节省时间.     

半失能老人远程健康监测大数据缺失处理

本文对传统蚂蚁聚类算法易出现早熟和收敛速度慢的问题,提出了基于改进K-means蚂蚁聚类算法,并将优化后的聚类算法与优化填充策略结合,对半失能老人远程健康监测缺失数据进行填充。仿真结果说明：改进K-means蚂蚁聚类算法的分类精度有所提高,基于改进K-means蚂蚁聚类的缺失数据填充算法的填充效果有所改善,可以有效填充半失能老人远程健康监测的缺失数据。     

支持IP-SAN远程映射与引导的固件协议栈

设计了一种基于IP存储区域网络的远程引导技术,该技术的核心是运行在裸机下的固件协议栈.针对固件协议栈运行特性,提出了一种非路由iSCSI/TCP通信协议原型,并实现了基于固件的iSCSI/TCP协议.同时提出了几种优化算法以提升远程引导性能与可靠性,包括乐观预测、固定回避重传算法和避免协议栈重入的输出请求挂起策略.建立了一种便于操作系统内核iSCSI启动器平滑接管的固件iSCSI启动器有限状态模型.通过将固件协议栈集成到IP-SAN扩展BIOS中,并应用于无本地存储设备的主机上,实现了基于IP-SAN的网络引导,测试结果表明该固件协议栈有很好的性能和可靠性,并且部署、移动和重新分配主机与存储卷之间的映射关系变得更加便利.     

基于改进栈式自编码算法的中期负荷预测研究

综合考虑影响电力系统中期负荷预测的各个因素并提高预测精度,提出了基于改进栈式自编码算法的中期负荷预测方法。利用ICA进行特征提取,筛选主导的影响因素并对数据进行归一化处理,结合模糊理论构建气温因素的隶属度关系,通过参数自适应微分进化算法对栈式自编码算法参数展开在线优化,进而匹配最佳基于改进栈式自编码算法的组合中期负荷预测模型,并展开案例分析。其结果表明：该改进算法通过影响因素筛选、参数选择与优化,能够有效避免参数选择的盲目性,将气温动态因素进行模糊化处理,能够进一步提高预测精度,其预测结果优于PSO-SVM算法,与实际结果更为接近,且稳定性好,为电力系统负荷预测提供了重要手段。     

基于种子填充的指针式仪表自动识别算法

针对指针式仪表自动识别中的指针提取,提出了一种基于种子填充的指针式仪表自动识别方法。算法主要由基于种子填充的指针提取算法和基于改进Hough变换的指针识别算法组成。算法首先运用差影法获取种子点,然后采用行扫描法提取指针,最后通过改进的Hough变换对指针式仪表进行读数识别。实验表明,种子填充法有效提取了指针特征,为后续获取较好的识别效果奠定了基础,整个算法高效快速,获得了较好的识别效果。     

基于模板的图像修复算法优先权的改进

研究了基于块填充的图像修复算法,修复图像的质量容易受到待修复区域边界像素修复顺序的影响,通过分析待修复区域像素点所在模块的图像特征,改进了填充算法的优先权,分别是基于P_Laplace算子和Euler' s elastics模型的优先权计算方法的改进.实验结果证实了文中所介绍算法能有效提高重建图像的感知质量.     

基于属性重要性的不完备数据填充算法

现有的不完备数据填充算法对所有缺失数据采用统一方式填充,没有考虑数据的重要性,效率低,实时性差。因此,本文提出一种基于属性重要性的不完全数据填充算法。通过差分矩阵求得属性约简,根据约简区分重要属性和非重要属性,对于重要属性数据填充采用改进的马氏距离填充方法,而不重要属性数据填充采用相似度概率填充方法,保证了数据精确度的同时,提高了实时性,具有实用性。最后,实验部分采用数据家庭系统数据和UCI标准数据集分别对算法性能进行了分析,验证了该算法的优越性。     

用平衡树实现集合运算的研究之二

定义了集合运算中公用的各种栈的数据结构,给出栈的初始化、入栈、出栈操作算法。对BT中结点进行了分类。详细论述了在BT中查找一个特定结点key值的算法,同时对三个函数(Findmax、Findmin、Leftmost)和四个过程(LMRmax Minorder Minorder1Move)的功能进行了定义,对相应的算法进行了实现,并给出时间复杂度的证明。     

Optimization of stack filters based on mirrored thresholddecomposition

An adaptive optimization algorithm for the design of a new class of stack filters is presented. Unlike stack smoothers, this new class of stack filters, based on mirrored threshold decomposition, has been empowered not only with lowpass filtering characteristics but with bandpass and highpass filtering characteristics as well. Therefore, these filters can be effectively used in applications where frequency selection is critical. An adaptive optimization approach is introduced, where the positive Boolean function (PBF) that characterizes the stack filter in the binary domain of mirrored threshold decomposition is represented by a soft truth table where each possible binary input sequence is mapped to a real number in the interval [-1, 1]. At each iteration of the adaptive algorithm, the probability that the PBF makes the correct decision when a given input sequence is presented is incremented by suitably changing the entries of the soft truth table. The proposed adaptive algorithm is simple to implement since it requires only increment, decrement, and local comparison operations. The performance of optimal stack filters is illustrated by several simulations     

A fast algorithm for designing stack filters

Stack filters are a class of nonlinear filters with excellent properties for signal restoration. Unfortunately, present algorithms for designing stack filters can only be used for small window sizes because of either their computational overhead or their serial nature. This paper presents a new adaptive algorithm for determining a stack filter that minimizes the mean absolute error criterion. The new algorithm retains the iterative nature of many current adaptive stack filtering algorithms, but significantly reduces the number of iterations required to converge to an optimal filter. This algorithm is faster than all currently available stack filter design algorithms, is simple to implement, and is shown in this paper to always converge to an optimal stack filter. Extensive comparisons between this new algorithm and all existing algorithms are provided. The comparisons are based both on the performance of the resulting filters and upon the time and space complexity of the algorithms. They demonstrate that the new algorithm has three advantages: it is faster than all other available algorithms; it can be used on standard workstations (SPARC 5 with 48 MB) to design filters with windows containing 20 or more points; and, its highly parallel structure allows very fast implementations on parallel machines. This new algorithm allows cascades of stack filters to be designed; stack filters with windows containing 72 points have been designed in a matter of minutes under this new approach.     

Comparison of line-by-line and two-dimensional encoding of random images

Most methods of encoding images require complicated implementation. Thus it is of interest to compare the transmission rates that can be achieved by classes of encoding methods of different complexity. We consider two classes of encoding operations. The first class allows any possible operation on the two-dimensional image source output. The second class allows only certain restricted operations on the image. In acquisition of images by electronic means, the image intensity is in general scanned line by line, resulting in data that appear as a sequence of ordinary time series. In encoding, a simpler implementation results if one accepts the time series from a single scan line and encodes it independently of adjacent scan lines. This limits storage requirements to a single scan line and limits processing to operations on a one-parameter time series instead of operations on a two-dimensional field. This is the second class of encoding operations that we consider. We choose a distortion measure and discuss the rate-distortion function, which represents the minimum rate required by any encoding method in the first (arbitrary complex encoding). We then derive the minimum rate that can be achieved by any encoder from the second class. These rates are compared for a specific example.     

一种基于圆形区块随机增长的多样图约束纹理合成算法

本文提出了一种基于圆形区块随机增长的多样图纹理合成算法改善了扫描线算法所带来的锯齿效应。算法利用高斯分布约束各个输入样图在合成结果中的比例,采用基于梯度引导的泊松平滑处理相邻纹理块之间的过渡区域,并在合成匹配函数中引入结构特征约束。实验结果表明,算法在引入比例约束的同时有效地保持了视觉效果和纹理结构的连续性。     

新型可重构移位-置换单元研究与设计

本文利用Inverse Butterfly/Butterfly多级动态网络的自重构特性,提出了一种针对循环移位操作的高速可重构控制信息生成算法,该算法不仅具有极高的并行性和较小的资源消耗,还首次将循环移位、双向循环移位和以2ⁱ（i=0,1,2…）为位宽的短字循环移位等10余种不同类型的移位操作统一在一个算法中.并在此基础上,设计了一种新型可重构移位-置换单元.该单元在SMIC 65nm工艺完成了逻辑综合.实验结果表明,当该单元只实现循环移位时,与以往研究成果相比,频率提升了6.4%~12%,面积减小了22%~30%;当该单元实现多种移位操作时,频率下降约8.4%,但能够支持的移位操作类型是以往研究成果的2倍.     

Efficient Path Delay Testing Using Scan Justification

Delay testing has become an area of focus in the field of digital circuits as the speed and density of circuits have greatly improved. This paper proposes a new scan flip‐flop and test algorithm to overcome some of the problems in delay testing. In the proposed test algorithm, the second test pattern is generated by scan justification, and the first test pattern is processed by functional justification. In the conventional functional justification, it is hard to generate the proper second test pattern because it uses a combinational circuit for the pattern. The proposed scan justification has the advantage of easily generating the second test pattern by direct justification from the scan. To implement our scheme, we devised a new scan in which the slave latch is bypassed by an additional latch to allow the slave to hold its state while a new pattern is scanned in. Experimental results on ISCAS’89 benchmark circuits show that the number of testable paths can be increased by about 45% over the conventional functional justification.     

Breakdown points,breakdown probabilities,midpoint sensitivity curves,and optimization of stack filters

Three new concepts — breakdown points, breakdown probabilities, and midpoint sensitivity curves — for stack filter analysis are introduced and analyzed in this paper. Breakdown points and probabilities can be used as measures of the robustness of stack filters. Midpoint sensitivity curves in turn give information on how sensitive the output of a stack filter is to the changes of a single value in the input window. The second major contribution of this paper is the extension of the current optimality theory of stack filters. This theory combines noise attenuation and different constraints on the filter's behavior. New constraints are introduced in this paper. A new optimization approach based on breakdown probability as a noise attenuation measure is also derived. In certain special cases it is shown that the optimal stack filter that achieves the best noise attenuation subject to given constraints can be obtained in closed form. An algorithm for finding this form is given in this paper, and its modification for finding a stack filter having (approximately) a required rank selection vector is presented.     

自然背景下车牌定位算法研究

提出一种综合边缘检测、形态学、扫描行法的车牌定位算法,该方法利用边缘检测获取车牌区域垂直边缘,利用形态学运算得到车牌候选区域,最后结合车牌特征,采用双扫描行法定位车牌,解决了自然背景中车牌定位困难的问题.实验表明,该算法定位准确,鲁棒性强,适用于多车牌情况.     

最优结构元约束层叠滤波器分析与设计

在对信号阈值分解基础上,利用结构化方法结合最优估计理论,对最优结构元约束层叠滤波器进行建模和分析,证明了最优结构元约束层叠滤波器实质是一类由多个极大/极小滤波单元组成的多级秩排序滤波器,并给出基于层叠处理操作和多级秩排序操作的滤波器实现结构.最后,结合图像处理应用实例,与其它传统多级秩排序滤波器进行了比较,证明了本文滤波器的有效性.     

Scan Latch Design for Test Applications

This JETTA letter describes a new single-latch scan design that uses a single clock for both scan and functional operations. A test mode signal differentiates between normal and test operations. This new design enjoys savings in circuits, pins, test time, and also enjoys the benefits of a high-speed scan capability.