二次多项式拟合在分布式光纤传感中的应用

基于布里渊散射的分布式光纤传感中温度和应变与布里渊频移成线性关系,为了提高温度和应变测量的准确性,提出了一种改进的二次多项式拟合算法用于提取布里渊频移。该算法分为两步:首先使用一种改进的中值滤波算法对含噪布里渊谱信号进行预处理,以提高增益峰值定位的准确性；然后截取围绕峰值左右对称的一个线宽的原始布里渊谱进行二次多项式拟合以实现布里渊频移的高精度提取。以布里渊频移误差及峰值定位准确性作为衡量指标,比较研究后确定同一频率下所有空间点对应的布里渊增益作为滤波器的输入。研究了不同扫频间隔和信噪比及不同滤波窗长下改进算法的效果,同时研究了最优窗长的选择问题。结果表明,不同信噪比和扫频间隔下改进算法均能有效提高布里渊频移提取的准确性。随窗口长度增加布里渊频移误差先减少后增加,在扫频间隔为1~10MHz、信噪比为0～40dB情况下,通用的最优窗长为53~163。     

Space-filling approach for fast window query on compressed images

Based on the space-filling approach, this paper presents a fast algorithm for window query on compressed images. Given a query window of size n/sub 1//spl times/n/sub 2/, the proposed algorithm takes O(n/sub 1/logT+P) time to perform the window query, where n/sub 1/=max(n/sub 1/, n/sub 2/) and T/spl times/T is the image size; P is the number of outputted codes. The proposed algorithm improves the naive algorithm, which needs O(n/sub 1/n/sub 2/log T+P) time, significantly. Some experimentations are carried out to demonstrate the computational advantage of the proposed algorithm. From the experimental results, it is observed that the proposed algorithm has about 72-98% time improvement when compared to the naive algorithm.     

二维滑动矩形窗傅氏变换的快速递推算法

该文利用相邻滑动窗数据之间的关系以及傅氏变换的平移性质,提出一种二维滑动矩形窗傅氏变换的快速递推算法。文中分析了该快速递推算法的复杂度和传统直接计算法的复杂度,证明了新的快速递推法可以大大降低计算复杂性,尤其是在图像尺寸和窗口尺寸较大的场合中。该算法可以改善滑窗傅氏变换或Gabor变换的计算效率。     

Speckle filtering of SAR images based on adaptive windowing

Speckle noise usually occurs in synthetic aperture radar (SAR) images owing to coherent processing of SAR data. The most well-known image domain speckle filters are the adaptive filters using local statistics such as the mean and standard deviation. The local statistics filters adapt the filter coefficients based on data within a fixed running window. In these schemes, depending on the window size, there exists trade-off between the extent of speckle noise suppression and the capability of preserving fine details. The authors propose a new adaptive windowing algorithm for speckle noise suppression which solves the problem of window size associated with the local statistics adaptive filters. In the algorithm, the window size is automatically adjusted depending on regional characteristics to suppress speckle noise as much as possible while preserving fine details. Speckle noise suppression gets stronger in homogeneous regions as the window size increases succeedingly. In fine detail regions, by reducing the window size successively, edges and textures are preserved. The fixed-window filtering schemes and the proposed one are applied to both a simulated SAR image and an ERS-1 SAR image to demonstrate the excellent performance of the proposed adaptive windowing algorithm for speckle noise     

Overlapping block transform: window design, fast algorithm, and animage coding experiment

A window design and fast algorithm for the overlapping block transform (OBT) of size N×L are presented. The presented algorithm for the OBT reduces the calculation complexity to an N×N transform with a fast algorithm and a simple preprocessing including windowing. A signal-independent window optimization strategy is introduced for image coding application. Results for a first-order Markov model and an image coding experiment show, that the coding gains of the optimized OBTs increase and blocking effects decrease with increasing window length L. A comparison with DCT-coding shows that the OBT, which has a slightly increased realization complexity, provides higher coding gain and a significant blocking effect reduction     

改进自适应中值滤波的图像去噪

传统自适应中值滤波的最大最小窗口尺寸固定,并且其最大最小窗口相差较大时,运算时间较长,去噪效果并小一定最佳。本文针对传统自适应中值滤波算法的不足,提出了改进自适应中值滤波算法,首先根据椒盐噪声的分布特点,从单幅含椒盐噪声图像中估算出椒盐噪声的浓度,并分析噪声浓度与自适应中值滤波窗口尺寸之间的关系,建立它们之间的函数关系一其次根据噪声浓度确定自适应中值滤波的最大最小窗口尺寸,最后对图像进行自适应中值滤波：实验结果表明本文算法运算时间随着噪声浓度的变化而变化,而且从PSNR角度来看本文去噪效果比传统自适应中值滤波效果较好。     

Sliding window and interleaver design

Terminating the trellis was considered essential to lower the bit error probability in a turbo coded system. When a sliding window algorithm is used, this issue becomes even more important. It is shown that trellis termination can be completely ignored by using an interleaver that takes into account the particular window size of the sliding window algorithm     

Bounds on the delay distribution of window random-access algorithms

A method for analyzing the delay distribution of window random-access algorithms is presented. The window size is allowed to vary during the operation of the algorithm. It is shown that the quantities of interest in the computation of the delay distribution can be related to the solution of appropriate infinite systems of linear equations. Once the constants and the coefficients of the unknowns of the system are determined, bounds on the solution can be developed by applying previously developed methodologies. The method is applied to the delay distribution analysis of the Capetanakis window random-access algorithm and the part-and-try algorithm, both under binary feedback     

Design of optimal stack filters under the MAE criterion

The design of optimal stack filters under the MAE criterion is addressed in this paper. In our work, the Hasse diagram is adopted to represent the positive Boolean functions to solve the optimization problem. After problem transformation, the finding of the optimal stack filter is equivalent to the finding of the optimal on-set such that the total cost of the on-set is minimal. An efficient algorithm is developed that makes use of an important property of the optimal on-set to avoid fruitless search. It thereby greatly reduces the complexity in finding the corresponding optimal stack filter. A design example is illustrated in detail to demonstrate the optimization procedures. The proposed algorithm can generate the optimal stack filter in 1 s for the window size of 14 pixels. It can still generate the optimal stack filter for the window size of 21, although it takes about 4 h. Experimental results for real images reveal that the proposed algorithm essentially extends the maximum filter window size to make the stack filter optimization problem computationally tractable     

一种新的SAR图像相干斑抑制算法

针对经典局域统计自适应滤波器的窗口大小问题,提出了一种新的用于抑制合成孔径雷达图像相干斑噪声的滤波算法.基于SAR图像的统计特性,窗口大小根据区域特征自动调整,尽可能将窗口调整为包含同一均匀区域,从而在保持细节的同时尽最大可能地抑制斑点噪声.实验结果表明,本算法不仅有效抑制了SAR图像的相干斑,保持图像的边缘细节.而且有着良好的图像视觉效果.     

Online traffic prediction in the cloud

Network traffic prediction is a fundamental tool to harness several management tasks, such as monitoring and managing network traffic. Online traffic prediction is usually performed based on large sets of historical data used in training algorithms, for example, to determine the size of static windows to bound the amount of traffic under consideration. However, using large sets of historical data may not be suitable in highly volatile environments, such as cloud computing, where the coupling between time series observations decreases rapidly with time. To fill this gap, this work presents a dynamic window size algorithm for traffic prediction that contains a methodology to optimize a threshold parameter alpha that affects both the prediction and computational cost of our scheme. The alpha parameter defines the minimum data traffic variability needed to justify dynamic window size changes. Thus, with the optimization of this parameter, the number of operations of the dynamic window size algorithm decreases significantly. We evaluate the alpha estimation methodology against several prediction models by assessing the normalized mean square error and mean absolute percent error of predicted values over observed values from two real cloud computing datasets, collected by monitoring the utilization of Dropbox, and a data center dataset including traffic from several common cloud computing services. Copyright © 2016 John Wiley & Sons, Ltd.     

基于光流场估计的自适应Mean-Shift目标跟踪算法

针对Mean-Shift算法在目标跟踪中出现由于目标运动速度过快或尺度明显变化以及目标遮挡时导致跟踪失败的问题,结合光流场估计,提出了一种自适应Mean-Shift跟踪算法。本文方法在基于传统均值漂移矢量法的同时,引入光流法,在目标上找寻特征点,通过特征点前后变化的信息,修正跟踪窗口中心位置和大小,再根据Bhattacharyya系数二分法分别自适应得到更为精确的窗口长宽;而针对目标被静止物体遮挡,通过色差分析观测目标被遮挡区域,利用Bhatta-charyya系数重新捕捉目标。实验结果表明,本文方法在对目标移动方向较明显或由透视变化而导致的尺度变化具有较其他算法更优异的表现。将本文方法应用到铁轨跟踪实际中,测试结果表明,结合本文方法可显著提高轨道跟踪的可靠性。     

SCTP performance improvement based on virtual receiver window

This article puts forward one algorithm for stream control transfer protocol （SCTP） improvement with limited receiver buffer （RBUF）. As is well known, SCTP is one of the most important transfer control protocol, but most researches focus on the situations without the RBUF limit. In this study, we analyze the impact of the RBUF size on the performance. Computer simulations show that the network utility is low in reliable transfer, when the RBUF size is smaller than bandwidth delay product. By studying the transmission sequence number （TSN） transfer progress, we find that the peer receiver window （PEER_RWND）, which lags behind the true receiver window （RWND）, leads to the poor network utility. To improve SCTP performance with limited RBUF, the virtual receiver window （VIRTUAL_RWND） is introduced. Based on the VIRTUAL_RWND, one algorithm is proposed to increase the sending rate. Computer simulations have evaluated an excellent performance of the proposed algorithm at both ideal link without lost packet and nonideal link with lost packet.     

Dynamically adaptive real-time disparity estimation hardware using iterative refinement

The computational complexity of disparity estimation algorithms and the need of large size and bandwidth for the external and internal memory make the real-time processing of disparity estimation challenging, especially for High Resolution (HR) images. This paper proposes a hardware-oriented adaptive window size disparity estimation (AWDE) algorithm and its real-time reconfigurable hardware implementation that targets HR video with high quality disparity results. Moreover, an enhanced version of the AWDE implementation that uses iterative refinement (AWDE-IR) is presented. The AWDE and AWDE-IR algorithms dynamically adapt the window size considering the local texture of the image to increase the disparity estimation quality. The proposed reconfigurable hardware architectures of the AWDE and AWDE-IR algorithms enable handling 60 frames per second on a Virtex-5 FPGA at a 1024×768 XGA video resolution for a 128 pixel disparity range.     

提高哈特曼波前传感器质心探测精度的一种计算方法

分析了哈特曼(Hartmann)波前传感器传统阈值一阶矩质心算法的局限性,提出了一种改进算法,对质心探测窗口的大小先进行合理优化,再采用灰度积分图原理进行自动搜索,最后采用灰度平方加权质心算法进行质心计算。仿真分析验证了算法的可行性和优越性,有利于提高波前传感器质心探测精度。     

DOCSIS performance analysis under high traffic conditions in the HFC networks

Hybrid Fiber Coaxial (HFC) networks provide a wide bandwidth and represent the solution of choice for many residential networks nowadays. The Data Over Cable Service Interface Specification (DOCSIS) protocol is an important standard for HFC networks and is supported by the majority of current vendors. This protocol uses the Truncated Binary Exponential Back-off (TBEB) algorithm to resolve collisions within the network by means of a back-off window. However, the performance of this algorithm tends to deteriorate when the network load is high. Consequently, the present study develops a novel mathematical model for the TBEB algorithm and then uses this model to identify the window size which yields the optimal system throughput and minimum delay time under high traffic conditions. The present numerical results confirm that the performance is improved when the window settings identified from the developed model are applied.     

对变形目标的跟踪研究

在目标跟踪过程中,目标在图像中的形状和大小常发生不同程度的变化,为了准确、有效地实现目标跟踪,采用多次迭代的连续自适应平均值移动算法。该算法是一种基于颜色跟踪的算法,根据多次迭代的计算结果,自适应调整图像序列中搜索窗口的大小和位置,从而得到当前图像中的目标中心,实现对运动目标的跟踪。最后分别在不同变形情况下和多个运动目标下进行实验。实验结果表明,当目标发生旋转、大小变化及存在多个目标的情况下,该算法仍能有效地对运动目标进行准确跟踪。     

基于梯度方向检测的自适应带宽meanshift目标跟踪算法

传统核窗宽固定的meanshift跟踪算法不能很好地对尺寸变化的目标进行有效的跟踪。在结合增量试探法和梯度方向检测的基础上,提出了一种适应带宽的meanshift目标跟踪算法。算法能够对逐渐放大和逐渐缩小的目标都能够进行有效的跟踪,解决了增量试探法难以很好地对放大目标进行自适应带宽跟踪的f＊l题,提高了自适应带宽跟踪的准确性。两段不同场景下的运动目标跟踪实验,证实了该算法的有效性。     

Novel Adaptive DCF Protocol Using the Computationally-Efficient Optimization with the Feedback Network Information for Wireless Local-Area Networks

In this paper, we design a novel computationallyefficient linear programming (LP) algorithm to maximize the throughput with respect to the minimum contention window size for the IEEE 802.11 Distributed Coordination Function (DCF) protocol. Based on our LP scheme, a new DCF protocol which can select the best access mode and the optimal size of the minimum contention window is proposed by considering the channel condition and the number of competing stations jointly. The numerical results demonstrate that our proposed DCF protocol significantly outperforms the conventional method.     

基于中值滤波器的红外图像噪声处理的改进方法

基于红外图像成像的机理和热像仪工作方式,红外图像往往混有大量随机噪声,而这些都是造成红外图像和视频质量下降的重要原因。中值滤波是一种常用的非线性的滤波方式,对于图像降噪有很好的效果。中值滤波器的处理窗口大小需要提前设定且在处理过程中不能改变。噪声密度越大需要处理窗口越大,但也导致图像的细节相应越模糊。综合窗口大小对降噪能力和细节处理能力的影响,文中对传统的中值滤波器算法进行改进。实验表明,在中值滤波器去除噪声的过程中,随着窗口图像噪声分布情况动态调整窗口大小,能够做到既尽可能去除噪声,又尽可能保持图片的细节,使图像处理整体效果得到提升。