基于后件直联型分层的广义混合模糊系统及其积分模逼近

首先, 引入后件直联型分层方法及其推理规则, 以对广义混合模糊系统的输入变量实施分层, 获得分层广义混合模糊系统的输入输出表达式和推理规则数的计算公式; 然后, 基于??- 积分模(度量) 和分片线性函数证明分层后广义混合模糊系统对一类可积函数具有逼近性; 最后, 通过模拟实例给出后件直联型分层广义混合模糊系统对可积函数的逼近过程. 模拟结果表明, 所提出的方法不仅能使原系统模糊规则总数大大减少, 而且能使分层后系统仍具有逼近性.

     

基于主题的网页噪音去除机制

由于主题的缺失,传统的网页噪音去除算法均是通过一些启发式的规则判断哪些是有用信息,哪些是噪音信息.而在主题爬行的环境下,由于有了明确的主题,可以使用一些不同的方法来发现网页噪音.提出了一种基于主题的网页噪音去除算法,通过构造网页DOM树的一个变种,即内容块树,利用分类器判断网页的噪音块.实验结果表明,该方法噪音去除精度是87%,而以前的方法仅有42%.     

基于广义相关性的关联规则抽取

在关联规则的数据挖掘中,良好的规则评价方法有利于去除价值不大的关联规则。分析基于概率运算的可信度和作用度这2种传统方法的局限性,指出其缺乏有力的逻辑基础。根据广义相关性理论,运用泛逻辑运算,提出新的关联规则抽取方法。分析和实验表明,该方法能有效提高关联规则的抽取质量。     

基于二叉树型分层的广义混合模糊系统推理规则数的缩减

为避免广义混合模糊系统因输入变量个数的增加而引起规则爆炸现象,应用二叉树型分层方法给出混合推理规则,进而对广义混合模糊系统的输入实施二叉树型分层,从理论上获得了该系统分层后的输入输出表达式和推理规则总数的计算公式.此外,通过实例对该系统分层和不分层的规则总数进行了比较和分析,结果表明分层后广义混合模糊系统可大幅度缩减推理规则总数,并可有效地避免规则爆炸.     

基于粗糙集的两阶段规则提取算法与有效性度量

在总结分析现有规则提取算法的基础上,提出了一种新的带覆盖度和置信度因子的两阶段规则提取算法,以解决噪音数据产生的噪音规则问题,并提出了一个衡量算法有效性的指标——支持度。实例表明,该算法能够有效地去除噪音规则,使提取出的规则更加精练实用。     

一种提高搜索引擎检索质量的网页解析法

通过实验对网页结构和特点进行综合分析,给出对网页分块的原则和方法,在分块的基础上根据网页中噪音的出现规则提出了一种消除网页噪音的方法,使搜索引擎对网页的预处理阶段有效消除网页中的无关项和间接项的超连接,从而大大提高了搜索引擎的检索质量.     

一种基于Rough集的缺省规则挖掘算法

Rough集方法是一种处理不确定或模糊知识的重要工具,对基于Rough集理论的缺省规则挖掘算法进行研究,在引入规则支持度概念后,提出了一种基于Rough集的缺省规则挖掘算法MDRBR。实验结果表明,该算法能较好地过滤噪音,提高规则的挖掘效率。     

一种广义次成分提取算法及其收敛性分析

广义次成分分析(generalized minor component analysis,GMCA)在现代信号处理的许多领域具有重要作用.目前现有的大多算法不能同时具备与算法对应的信息准则,以及收敛性、自稳定性和多个广义次成分提取的性能.针对上述问题,利用一种新的信息传播规则,推导出一种广义次成分提取算法,并采用确定离散时间方法(deterministic discrete time,DDT)对算法的全局收敛性能进行分析;同时,通过理论分析算法的收敛性能与算法初始状态的关系,表明算法具有自稳定性.进一步地,探索了算法在多重广义次成分提取方面的应用.相比之前的算法,所提算法具有更快的收敛速度.Matlab仿真验证了所提出算法的各项性能.     

DNA计算机中广义表数据结构的设计与实现(英文)

类似于电子计算机,数据结构能帮助DNA计算机合理、高效地组织要处理的信息.文中提出了DNA计算机中广义表的一种设计方法.首先,讨论了k-臂 DNA分子的结构及其在DNA计算中的应用.接着,在讨论了广义表存储结构的同时.给出了广义表两种节点的k-臂 DNA编码的形式描述.最后详细描述了DNA计算机中广义表主要操作的实现算法.这些操作包括初始化空的广义表,创建包含指定元素的广义表和遍历广义表的元素.文中的方法可推广到DNA计算机上其它非线性数据结构.     

一种新的鲁棒子空间建模方法

针对传统子空间建模技术中存在的两个难点问题,即对训练数据中的噪音或局外点非常敏感和基于批处理方式的大尺度高维样本模型学习计算非常费时,提出了一种新的鲁棒子空间建模方法.该方法先利用基于双平方函数的鲁棒估计,基于梯度下降的学习规则和M-估计器来同时学习和估计线性模型的初始参数,自动分级检测出初始训练样本集中的样本级局外点和样本中的信号级局外点;然后利用鲁棒的增量学习来更新参数,获得可靠的子空间模型.实验证明,这种新的鲁棒子空间建模方法能有效处理不同类型的噪音数据,在学习亮度子空间模型时能有效解决亮度明显变化、遮挡、噪音污染等敏感问题,并且具有较快的学习速度.     

Linear quadratic regulation problem for discrete-time systems with multi-channel multiplicative noise

This paper investigates the linear quadratic regulation (LQR) problem for discrete-time systems with multiplicative noise. Multiplicative noise is usually assumed to be a scalar in existing literature works. Motivated by recent applications of networked control systems and MIMO communication technology, we consider multi-channel multiplicative noise represented by a diagonal matrix. We first show that the finite horizon LQR problem can be solved using a generalized Riccati equation. We then prove the convergence of the generalized Riccati equation under the conditions of stabilization and exact observability, and obtain the solution to the infinite horizon LQR problem. Finally, we provide a numerical example to demonstrate the proposed approach.     

基于广义Gibbs先验的低剂量X-CT优质重建研究

为获取低剂量条件下X-CT的优质重建,提出基于广义Gibbs先验的低剂量X-CT重建算法。新算法首先对投影数据进行统计建模,其后采用Bayesian最大后验估计方法,将投影数据中非局部的先验信息加诸于该数据的恢复中,达到抑制噪声的效果,最后仍采用经典的滤波反投影方法对恢复后的投影数据进行解释CT重建。文中将非局部先验称为广义Gibbs先验,其原因在于该先验具有传统Gibbs先验形式的同时,可以通过选择较大邻域和自适应的加权方式充分利用投影数据的全局信息进行数据恢复。通过与已有算法的对比实验,表明该文提出的基于广义Gibbs先验的低剂量X-CT重建算法在降低噪声效果和保持边缘方面具有较好的表现。     

Noise Reduction Algorithms in a Generalized Transform Domain

Noise reduction for speech applications is often formulated as a digital filtering problem, where the clean speech estimate is obtained by passing the noisy speech through a linear filter/transform. With such a formulation, the core issue of noise reduction becomes how to design an optimal filter (based on the statistics of the speech and noise signals) that can significantly suppress noise without introducing perceptually noticeable speech distortion. The optimal filters can be designed either in the time or in a transform domain. The advantage of working in a transform space is that, if the transform is selected properly, the speech and noise signals may be better separated in that space, thereby enabling better filter estimation and noise reduction performance. Although many different transforms exist, most efforts in the field of noise reduction have been focused only on the Fourier and Karhunen–LoÈve transforms. Even with these two, no formal study has been carried out to investigate which transform can outperform the other. In this paper, we reformulate the noise reduction problem into a more generalized transform domain. We will show some of the advantages of working in this generalized domain, such as 1) different transforms can be used to replace each other without any requirement to change the algorithm (optimal filter) formulation, and 2) it is easier to fairly compare different transforms for their noise reduction performance. We will also address how to design different optimal and suboptimal filters in such a generalized transform domain.      

Generalized likelihood ratio test for voiced-unvoiced decision in noisy speech using the harmonic model

In this paper, a novel method for voiced-unvoiced decision within a pitch tracking algorithm is presented. Voiced-unvoiced decision is required for many applications, including modeling for analysis/synthesis, detection of model changes for segmentation purposes and signal characterization for indexing and recognition applications. The proposed method is based on the generalized likelihood ratio test (GLRT) and assumes colored Gaussian noise with unknown covariance. Under voiced hypothesis, a harmonic plus noise model is assumed. The derived method is combined with a maximum a-posteriori probability (MAP) scheme to obtain a pitch and voicing tracking algorithm. The performance of the proposed method is tested using several speech databases for different levels of additive noise and phone speech conditions. Results show that the GLRT is robust to speaker and environmental conditions and performs better than existing algorithms.     

Anisotropic noise samples

We present a practical approach to generate stochastic anisotropic samples with Poisson-disk characteristic over a two-dimensional domain. In contrast to isotropic samples, we understand anisotropic samples as non-overlapping ellipses whose size and density match a given anisotropic metric. Anisotropic noise samples are useful for many visualization and graphics applications. The spot samples can be used as input for texture generation, e.g., line integral convolution (LIC), but can also be used directly for visualization. The definition of the spot samples using a metric tensor makes them especially suitable for the visualization of tensor fields that can be translated into a metric. Our work combines ideas from sampling theory and mesh generation. To generate these samples with the desired properties we construct a first set of non-overlapping ellipses whose distribution closely matches the underlying metric. This set of samples is used as input for a generalized anisotropic Lloyd relaxation to distribute noise samples more evenly. Instead of computing the Voronoi tessellation explicitly, we introduce a discrete approach which combines the Voronoi cell and centroid computation in one step. Our method supports automatic packing of the elliptical samples, resulting in textures similar to those generated by anisotropic reaction-diffusion methods. We use Fourier analysis tools for quality measurement of uniformly distributed samples. The resulting samples have nice sampling properties, for example, they satisfy a blue noise property where low frequencies in the power spectrum are reduced to a minimum.     

数字图像与数码相机噪声相关性的分布

在利用数字图像与数码相机的噪声相关性来鉴别数字图像来源的实验中,发现噪声相关性有对称和非对称两种分布。为了提高鉴别数字图像来源的正确性,正确设置判别阈值,针对噪声相关性的非对称分布,在(0,1]区间构造了一个广义chi平方分布的新函数,并提出了一种利用广义chi平方分布来描述噪声相关性的非对称分布和利用广义高斯分布来描述噪声相关性的对称分布的新方法。实验结果表明,该方法与仅采用一个广义高斯分布的方法相比,可以使鉴别错误率降低38%以上,可见利用不同的概率密度函数来描述相应的分布是减小鉴别错误率的一个有效途径。     

Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications

The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper, we generalize this algorithm in two important directions. The generalized algorithm—called GDBSCAN—can cluster point objects as well as spatially extended objects according to both, their spatial and their nonspatial attributes. In addition, four applications using 2D points (astronomy), 3D points (biology), 5D points (earth science) and 2D polygons (geography) are presented, demonstrating the applicability of GDBSCAN to real-world problems.     

基于非局部总广义变分的图像去噪

针对全变分(TV)模型在去除图像噪声时容易产生阶梯效应的缺点,将二阶总广义变分(TGV)作为正则项应用于全变分模型中可以有效地去除阶梯效应,并且还能够更好地保持图像边缘纹理结构;利用非局部均值滤波算法的思想来构造非局部微分算子,将非局部微分算子应用于总广义变分模型中,综合提出了一种基于非局部总广义变分的图像去噪新模型。新模型充分利用了图像的全局信息进行去噪。实验结果显示了该模型的有效性和优越性。     

Robust 1-bit compressive sensing via variational Bayesian algorithm

In a compressive sensing (CS) framework, a sparse signal can be stably reconstructed at a reduced sampling rate. Quantization and noise corruption are inevitable in practical applications. Recent studies have shown that using only the sign information of measurements can achieve accurate signal reconstruction in a CS framework. We consider the problem of reconstructing a sparse signal from 1-bit quantized, Gaussian noise corrupted measurements. In this paper, we present a variational Bayesian inference based 1-bit compressive sensing algorithm, which essentially models the effect of quantization as well as the Gaussian noise. A variational message passing method is adopted to achieve the inference. Through numerical experiments, we demonstrate that our algorithm outperforms state-of-the-art 1-bit compressive sensing algorithms in the presence of Gaussian noise corruption.     

Adaptive haptic rendering for time‐varying haptic and video frame rates in multi‐modal interactions

In multi‐modal interactions including haptics, problems such as input sensor noise, temporal mismatch between graphics and haptics, and non‐constant refresh rates may cause non‐smooth force/torque display. This paper proposes temporal smoothing technique for haptic interaction using a sensing glove in multi‐modal applications. The proposed technique employs two processes: (1) a noise reduction method is applied to reduce jitter noise at the sensors in the sensing glove and (2) an adaptive force extrapolation is applied for time‐varying haptic and video frame rates. To demonstrate the performance of the proposed method, we developed a test platform to assess a simple box model and relatively complex models such as gamephone, portable media player (PMP). It was subsequently demonstrated that the proposed method can support smooth haptic interactions in multi‐modal applications where a haptic device and a sensing glove are used. Copyright © 2009 John Wiley & Sons, Ltd.