Using local transition probability models in Markov random fields for forest change detection

Change detection based on the comparison of independently classified images (i.e. post-classification comparison) is well-known to be negatively affected by classification errors of individual maps. Incorporating spatial-temporal contextual information in the classification helps to reduce the classification errors, thus improving change detection results. In this paper, spatial-temporal Markov Random Fields (MRF) models were used to integrate spatial-temporal information with spectral information for multi-temporal classification in an attempt to mitigate the impacts of classification errors on change detection. One important component in spatial-temporal MRF models is the specification of transition probabilities. Traditionally, a global transition probability model is used that assumes spatial stationarity of transition probabilities across an image scene, which may be invalid if areas have varying transition probabilities. By relaxing the stationarity assumption, we developed two local transition probability models to make the transition model locally adaptive to spatially varying transition probabilities. The first model called locally adjusted global transition model adapts to the local variation by multiplying a pixel-wise probability of change with the global transition model. The second model called pixel-wise transition model was developed as a fully local model based on the estimation of the pixel-wise joint probabilities. When applied to the forest change detection in Paraguay, the two local models showed significant improvements in the accuracy of identifying the change from forest to non-forest compared with traditional models. This indicates that the local transition probability models can present temporal information more accurately in change detection algorithms based on spatial-temporal classification of multi-temporal images. The comparison between the two local transition models showed that the fully local model better captured the spatial heterogeneity of the transition probabilities and achieved more stable and consistent results over different regions of a large image scene.     

Use of a dark object concept and support vector machines to automate forest cover change analysis

An automated method was developed for mapping forest cover change using satellite remote sensing data sets. This multi-temporal classification method consists of a training data automation (TDA) procedure and uses the advanced support vector machines (SVM) algorithm. The TDA procedure automatically generates training data using input satellite images and existing land cover products. The derived high quality training data allow the SVM to produce reliable forest cover change products. This approach was tested in 19 study areas selected from major forest biomes across the globe. In each area a forest cover change map was produced using a pair of Landsat images acquired around 1990 and 2000. High resolution IKONOS images and independently developed reference data sets were available for evaluating the derived change products in 7 of those areas. The overall accuracy values were over 90% for 5 areas, and were 89.4% and 89.6% for the remaining two areas. The user's and producer's accuracies of the forest loss class were over 80% for all 7 study areas, demonstrating that this method is especially effective for mapping major disturbances with low commission errors. IKONOS images were also available in the remaining 12 study areas but they were either located in non-forest areas or in forest areas that did not experience forest cover change between 1990 and 2000. For those areas the IKONOS images were used to assist visual interpretation of the Landsat images in assessing the derived change products. This visual assessment revealed that for most of those areas the derived change products likely were as reliable as those in the 7 areas where accuracy assessment was conducted. The results also suggest that images acquired during leaf-off seasons should not be used in forest cover change analysis in areas where deciduous forests exist. Being highly automatic and with demonstrated capability to produce reliable change products, the TDA-SVM method should be especially useful for quantifying forest cover change over large areas.     

基于故障概率的可拓诊断法

基于可拓学的故障诊断法现已成功应用于电力设备的故障诊断中,但在故障诊断过程中,没有考虑电力设备常见的几种故障发生的概率．对诊断结果的准确性有一定的影响。基于故障概率的可拓诊断法是在分析可拓诊断法优缺点基础上,将常见的故障概率与可拓法中的关联度相结合,即在可拓法中引入贝叶斯判别法,在故障诊断过程中综合考虑各种故障总体物元出现的先验概率和分布,得出故障所属类型,最后介绍了这一方法在电力设备的故障诊断中的应用。     

n值逻辑系统中的随机化研究

利用赋值集的随机化方法,在n值逻辑系统Rn提出了公式的DRn-真度的概念。给出了两公式间的DRn-相似度与伪距离的概念,建立了DRn-逻辑度量空间。     

话语标记的语体特征研究及应用

话语标记作为一种常见的话语现象,已成为话语分析研究的重要课题。由于研究角度不同,人们对于话语标记的认识和分类至今仍存在较大差异。该文从语体的角度提出假设,认为话语标记具有一定的语体特征。为准确描写话语标记的语体特征,提出了“语体度”的概念。通过对采样话语标记在不同语体的语料中分布情况进行定量分析,证实了相当一部分话语标记具有明显的语体特征,并根据分析结果选择特征向量,采用Rocchio分类法对开放文本进行自动语体分类实验,正确率达到82.9%。事实证明话语标记的语体特征对文本分类具有一定的参考价值。     

SINS/GPS组合导航系统仿真研究

以某载体的规划航迹数据为对象,针对捷联、卫星组合导航系统(SINS/GPS)进行了仿真研究。由规划航迹数据计算出载体的比力和角速度信息,输入至惯性测量器件模型,模型输出激励捷联解算模块,得到惯导系统输出参数;同时对规划数据添加观测噪声模拟GPS测量值。采用相对简单的基于半位置、半速度误差的误差方程作为状态方程,以松耦合方式进行集中式Kalman滤波,给出了SINS单独工作与SINS/GPS组合得到的半位置、半速度误差分布。对各状态的观测度进行了研究,确定了不可观测的状态并给出了部分状态可观测度的时间分布。仿真结果表明,方法正确有效,可对SINS/GPS组合导航系统进行算法验证和方案性评估。     

基于中间节点效应的无标度网络演化模型研究

原BA模型以网络中已存在的各个节点与新增节点的连接相互独立为前提。然而,在真实系统中,当网络中一个节点与新增节点连接后,该节点对其邻居节点与新增节点的连接会存在影响。针对该现象,提出了基于中间节点效应的无标度网络演化模型。首先描述与定义了中间节点效应,然后给出了中间节点效应模型的生成算法,并从理论上分析了该模型的度分布情况,最后利用仿真验证了理论分析的正确性,并就度分布、群聚系数、平均路径长度等复杂网络参数与原BA模型进行了对比,结果表明此模型能生成无标度网络并且更符合现实网络的演化过程。     

通风网络区域划分算法与程序实现

通风网络风道之间的风量依从关系对于通风网络的合理性分析具有重要意义。对于任意复杂的通风网络系统,有时很难从图形上直接判断出任意2条风道之间的风量依从关系。文章提出了通风网络任意风道影响区和依赖区的概念,指出其可用于任意风道之间的风量依从关系的分析;介绍了通风网络各风道依赖区、影响区划分方法以及任意风道之间归属度和依赖度计算方法,并采用C#语言编制了程序;最后用实例验证了文中所论及算法的正确性。     

电力巡检移动操作机控制系统的分析与设计

为了提高电力巡检移动机器人的实时性和可操作性,介绍一种以嵌入式Linux系统为核心的电力巡检移动操作机控制系统的软硬件体系结构。给出移动操作臂的动态模型,并基于D-H方法和公式法,给出基于该体系结构的具有冗余自由度电力巡检移动操作机逆运动学分析。在实验中,利用固定在移动机器人上的CCD摄像机对目标物体进行定位,然后根据目标物体的位姿信息,通过逆运动学分析的结果控制移动操作臂实现了对目标物体的抓取操作。进一步分析说明了所设计的体系结构的合理性和可行性。     

The Topology of Transportation Networks: A Comparison Between Different Economies

This paper presents an analysis of the topology of transportation networks within different systems of cities. Urban entities and their components are complex systems by their nature; there is no central force that affects their spatial structure. Thus, we study transportation networks within different countries as complex networks. Based on the above, we consider cities as nodes, while direct air and railways routes represent the links. We present characteristics of these networks including their degree and clustering coefficient. Transportation networks can be used as an indicator of economic activity between cities. Cities with strong economic relationship are characterized by high volume of connectivity. Our findings suggest that the topology of the analyzed transportation networks can be used to classify the countries they belong to based on their economic development.