基于不确定性度量的证据组合方法

针对Dempster组合规则不能有效组合冲突证据,已有的基于证据间距离的改进组合方法计算复杂度较大的情况,提出了一种证据加权平均组合方法。首先以邓勇等人的组合方法为例计算了基于证据间距离的改进组合方法的计算复杂度,分析了造成计算复杂度较大的原因;然后通过引入证据的不确定性度量概念来描述证据的不确定性并以此为基础定义证据的权重;最后给出算法步骤。理论分析和数值算例表明,该方法能有效融合冲突证据,收敛速度快且降低了计算复杂度。     

模糊机会约束数据包络分析模型及其应用

为求解模糊环境下输出倾向的数据包络分析（DEA）模型,利用可信性测度建立了一类新的输出倾向的可信性DEA（CDEA）模型,其中目标函数采用了模糊机会约束规划的概念,且所有的约束条件中都含有模糊输入和模糊输出数据。当模糊输入和模糊输出数据为相互独立的梯形模糊变量时,把所建立的CDEA模型转化为其清晰等价形式,进而研究了模型的两个基本性质;通过一个应用实例来说明所建立CDEA模型的有效性。     

GPER路由协议的安全性改进

无线传感器网络存在很多安全问题,节点间的信任关系难以确认。针对上述问题,采用模糊理论建立一种模糊信任模型解决节点间信任的评价、计算问题,并用该模糊信任模型解决无线传感器网络的路由安全问题。实验结果表明,该信任模型能有效评价节点的信任状态,抵御不良节点的丢包问题。     

基于判别度的实值决策系统的属性约简

研究实值决策系统中的知识获取是粒计算研究的主要方向之一。为给出一种高效的知识获取方法,基于邻域粗糙集的原理,针对实值特点,在相容的实值决策系统中,给出判别度描述下的约简定义。进一步提出一种基于判别度的属性约简的启发式算法,同时对算法的性质进行了分析,通过实例验证了算法的有效性。     

CrackTree: Automatic crack detection from pavement images

Pavement cracks are important information for evaluating the road condition and conducting the necessary road maintenance. In this paper, we develop CrackTree, a fully-automatic method to detect cracks from pavement images. In practice, crack detection is a very challenging problem because of (1) low contrast between cracks and the surrounding pavement, (2) intensity inhomogeneity along the cracks, and (3) possible shadows with similar intensity to the cracks. To address these problems, the proposed method consists of three steps. First, we develop a geodesic shadow-removal algorithm to remove the pavement shadows while preserving the cracks. Second, we build a crack probability map using tensor voting, which enhances the connection of the crack fragments with good proximity and curve continuity. Finally, we sample a set of crack seeds from the crack probability map, represent these seeds by a graph model, derive minimum spanning trees from this graph, and conduct recursive tree-edge pruning to identify desirable cracks. We evaluate the proposed method on a collection of 206 real pavement images and the experimental results show that the proposed method achieves a better performance than several existing methods.     

基于CL多小波变换和组合位平面理论的秘密信息共享算法

针对信息隐藏算法容量和不可见性与鲁棒性矛盾的特点,提出了一种新的基于Chui-Lian(CL)多小波变换和组合位平面(CBP)理论的数字图像载体预处理算法,并将该算法用于以数字图像为载体的信息隐藏,以实现秘密通信和图像共享。其中,CL多小波变换能够将载体图像划分为4个能量等级不同的最低分辨率子图像,组合位平面理论可将子图像解析为不同的位平面层次,在隐藏秘密信息时,可根据最低分辨率子图和组合位平面的能量等级由高到低分别嵌入鲁棒信息、秘密信息和脆弱信息。实验结果表明,在25%的嵌入率时,与基于离散余弦变换和最低有效位方法的信息隐藏算法（DCT-LSB）、基于离散小波变换和最低有效位方法的信息隐藏算法（DWT-LSB）相比,所提算法针对若干常见攻击的鲁棒性有一定程度提升,峰值信噪比（PSNR）分别提高了37.16%和20.00%。     

Near optimal solutions to least-squares problems with stochastic uncertainty

In this paper, we consider least-squares (LS) problems where the regression data is affected by parametric stochastic uncertainty. In this setting, we study the problem of minimizing the expected value with respect to the uncertainty of the LS residual. For general nonlinear dependence of the data on the uncertain parameters, determining an exact solution to this problem is known to be computationally prohibitive. Here, we follow a probabilistic approach, and determine a probable near optimal solution by minimizing the empirical mean of the residual. Finite sample convergence of the proposed method is assessed using statistical learning methods. In particular, we prove that if one constructs the empirical approximation of the mean using a finite number N of samples, then the minimizer of this empirical approximation is, with high probability, an ε-suboptimal solution for the original problem. Moreover, this approximate solution can be efficiently determined numerically by a standard recursive algorithm. Comparisons with gradient algorithms for stochastic optimization are also discussed in the paper and several numerical examples illustrate the proposed methodology.     

Connectivity of core habitat in the Northeastern United States: Parks and protected areas in a landscape context

The exurbanization process, particularly rural residential development, is reducing the amount of roadless areas and remote habitat across the nation, with implications for biodiversity and ecosystem integrity of parks and protected areas. The need for connecting protected areas via existing habitat centers, or relatively undisturbed core areas, is greater than ever as exurbanization expands. Our objective was to make use of nationally available data sets on roads as well as information derived from satellite imagery, including impervious cover of the built environment and forest canopy density, to identify core habitat of the northeastern and mid-Atlantic USA. The identified core habitat areas, which covered 73,730 km² across 1177 discrete units, were stratified in terms of land ownership and management, and then analyzed in a landscape context using connectivity metrics derived from graph theory. The connectivity analysis made use of a suitability surface, derived from the land cover information, which approximated the costs incurred by hypothetical animals traversing the landscape. We show that protected areas are frequently identified as core habitat but are typically isolated, albeit sometimes buffered by adjacent multi-use lands (such as state or national forests). Over one third of the core habitat we identified has no protection, and another 42% is subject to motorized recreation or timber extraction. We provide maps showing the relative importance of core habitat areas for potentially connecting existing protected areas, and also provide an example of the vulnerability of connectivity to projected future residential development around one greater park ecosystem.     

基于结构张量的Non-Local Means去噪算法研究

非局部平均是当前一种新兴而有效的图像去噪方法。为了能充分利用数字图像局部几何结构的自相似性,同时由于结构张量可有效刻画数字图像的局部几何结构特征,进而提出了基于结构张量相似性度量的非局部平均去噪算法。实验结果验证了该算法抑制噪声的有效性,同时能很好地保持边缘等细节特征,峰值信噪比得到有效提高。     

空间信息论的新研究进展

空间信息指雷达探测系统中目标的距离、方向和散射等信息,空间信息论是采用香农信息论的思想方法研究雷达等信息获取系统的基础理论。本文围绕空间信息的概念、空间信息量的理论公式及闭合表达式、熵误差和雷达分辨率等基本理论问题,论述了空间信息论当前的研究现状,总结了空间信息论方面的主要研究工作,介绍了空间信息的概念及其系统模型,目标距离信息、散射信息和方向信息方面的研究工作,重点分析了空间信息量的理论推导,熵误差的概念及其与均方误差的关系,分辨率的新定义及其与传统分辨率的关系。本文指出空间信息论亟待解决的理论问题,最后对空间信息论的发展趋势做出了分析和展望。