Cycle detection using a stack

We present an algorithm for detecting periodicity in sequences produced by repeated application of a given function. Our algorithm uses logarithmic memory with high probability, runs in linear time, and is guaranteed to stop within the second loop through the cycle. We also present a partitioning technique that offers a time/memory tradeoff. Our algorithm is especially well suited for sequences where the cycle length is typically small compared to the length of the acyclic prefix.     

Speed–accuracy tradeoff in Fitts’ law tasks—on the equivalency of actual and nominal pointing precision

Pointing tasks in human–computer interaction obey certain speed–accuracy tradeoff rules. In general, the more accurate the task to be accomplished, the longer it takes and vice versa. Fitts’ law models the speed–accuracy tradeoff effect in pointing as imposed by the task parameters, through Fitts’ index of difficulty (I_d) based on the ratio of the nominal movement distance and the size of the target. Operating with different speed or accuracy biases, performers may utilize more or less area than the target specifies, introducing another subjective layer of speed–accuracy tradeoff relative to the task specification. A conventional approach to overcome the impact of the subjective layer of speed–accuracy tradeoff is to use the a posteriori “effective” pointing precision W_e in lieu of the nominal target width W. Such an approach has lacked a theoretical or empirical foundation. This study investigates the nature and the relationship of the two layers of speed–accuracy tradeoff by systematically controlling both I_d and the index of target utilization I_u in a set of four experiments. Their results show that the impacts of the two layers of speed–accuracy tradeoff are not fundamentally equivalent. The use of W_e could indeed compensate for the difference in target utilization, but not completely. More logical Fitts’ law parameter estimates can be obtained by the W_e adjustment, although its use also lowers the correlation between pointing time and the index of difficulty. The study also shows the complex interaction effect between I_d and I_u, suggesting that a simple and complete model accommodating both layers of speed–accuracy tradeoff may not exist.     

All updateable objects in working memory are updated whenever any of them are modified: Evidence from the memory updating paradigm.

In a series of experiments, participants were required to keep track of 1 or 2 working memory (WM) objects, having to update their values in 80% of the trials. Updating cost, defined as the difference between update and non-update trials, was larger when 2 objects were involved compared with when there was only 1 object was involved. This finding was interpreted as evidence that the updating process encompasses both objects in WM, even though only 1 of them is actually updated. This feature of WM updating is limited to objects defined as "updateable," throughout the trial sequence. The results are explained by the need to reprogram the phonological loop when updating or the need for desynchronization followed by resynchronization of WM contents. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

与客户建立互惠互利长期稳定的营销关系

在我国加入WTO之后，国内钢铁企业与经销商之间如何实现互惠互利，并建立起长期稳定的营销关系。     

细节保持的曲面浅浮雕算法

为保持曲面浮雕的细节特征,改善浮雕与背景曲面的过渡效果,提出一种细节保持的曲面浮雕算法.首先采用Canny算子在梯度域定位内外轮廓,获得连续的梯度域;其次提出非线性函数,并用其压缩梯度幅值实现形状压缩;再通过双边滤波算子来保持和增强浮雕细节;最终通过求解积分方程重建曲面浮雕.该算法将背景曲面作为积分方程的优化条件,使浮雕在轮廓处向曲面光滑过渡;在重建过程中利用Fourier变换的微分性质在频域实现方程的精确求解,无需设置迭代收敛条件;通过调整参数可方便地控制浮雕整体变化范围、细节锐化程度以及浮雕与背景曲面的过渡效果.实验结果表明,文中算法参数的几何意义直观,所得曲面浮雕细节清晰,边界过渡自然.     

On problem transformability in VLSI

The two basic performance parameters that capture the complexity of any VLSI chip are the area of the chip,A, and the computation time,T. A systematic approach for establishing lower bounds onA is presented. This approach relatesA to the bisection flow, . A theory of problem transformation based on , which captures bothAT ² andA complexity, is developed. A fundamental problem, namely, element uniqueness, is chosen as a computational prototype. It is shown under general input/output protocol assumptions that any chip that decides ifn elements (each with (1+)lognbits) are unique must have =(nlogn), and thus, AT²=(n ²log² n), andA= (nlogn). A theory of VLSI transformability reveals the inherentAT ² andA complexity of a large class of related problems.This work was supported in part by the Semiconductor Research Corporation under contract RSCH 84-06-049-6.     

基于快速双边滤波的图像高光去除研究

在各向异性的物体中,高光被视为是漫反射分量以及镜面反射分量的一种线性组合。单幅图像的高光去除是计算机视觉中一项非常有挑战性的课题。很多方法试图将漫反射分量、镜面反射分量进行分离,然而这些方法往往需要图像分割等预处理过程,方法鲁棒性较差且比较耗时。基于双边滤波器设计了一种高效的高光消除方法,该方法利用最大漫反射色度存在着局部平滑这一性质,使用双边滤波器对色度的最大取值进行传播与扩散,从而完成整幅图像高光去除。方法采用一种加速策略对双边滤波器进行速度优化,与目前流行的方法相比,有效提升了方法的执行效率。与传统方法相比,该方法高光去除效果更好,处理速度更快,非常适用于一些实时应用的场合。     

混合波原子和双边滤波的纹理图像滤波方法

为了更好地去除纹理图像中的噪声, 提出了一种新的混合波原子阈值的振荡纹理图像扩散模型; 利用扩散方程和图像滤波方法的理论联系, 给出了联合双边滤波的图像去噪算法; 最后, 利用峰值信噪比(PSNR)和结构相似度(SSIM)两个客观图像质量评价指标, 与目前流行的图像去噪方法(包括波原子阈值、双边滤波、高斯尺度混合(GSM), 以及非局部滤波(NLM))进行比较。 实验结果验证了新方法的有效性。     

局部平均显著梯度保边滤波算法

针对传统平均保边滤波算法中存在的光晕伪影现象,提出一种显著图局部平均梯度的保边滤波算法.利用显著图像边缘对比度突出的特点,简化边缘区域和非边缘区域间的阈值设定工作,并根据显著图的平均梯度自适应的平滑图像中的细节和噪声部分,同时保持边缘清晰.实验结果表明,显著图局部平均梯度的保边滤波算法利用显著特性有效地避免了传统平均滤波算法中的光晕伪影现象.相对于传统平均滤波算法,在降噪、多尺度增强以及HDR方面都有较好的表现.     

一种改进的非锐化掩模深度图像增强算法

针对深度图像平滑过程中会模糊细节的缺点,提出了自适应的非锐化掩模深度图像增强算法.首先将深度图对应的彩色图像作为联合双边滤波的引导图,利用彩色图像相关特征修复了深度图像的缺失和毛糙,然后将双边滤波后的深度图像与高斯滤波后的深度图像作差,提取出不含噪声的高频部分,克服了经典非锐化掩模算法放大高频噪声的缺点,最后根据边缘以及细节的模糊程度,自适应地调节叠加到图像上的高频部分.实验结果表明,设计的算法有效地增强了深度图像细节,抑制了平坦区域的噪声,并填补了边缘缺失,较好地改善了深度图像的质量.