基于特征异质性优选的面向对象建筑物提取

利用面向对象方法提取遥感影像中的建筑物是当前研究热点之一。针对此方法中特征选择问题,文章基于面向对象的分析方法,充分考虑影像特征与多种地物在空间异质性上的相似程度,提出了一种特征优选方法,进而完成建筑物的提取。具体方法是:首先,计算对象内同质性与对象间异质性,基于均值变点原理确定全局最优尺度;其次,利用地理探测器基于空间异质性相似度对分割对象的光谱、纹理、高度、形状等特征进行优选;最后,根据优选出的特征进行建筑物提取,并辅以邻域高程比对算法进行优化,获得建筑物较完整、可靠的轮廓。结果表明,该方法对建筑物提取更加高效且精度更高。

边缘计算综述:应用、现状及挑战

通过对边缘计算概念、典型应用场景、研究现状及关键技术等系统性的介绍,认为边缘计算的发展还处在初级阶段,在实际的应用中还存在很多问题需要解决研究,包括优化边缘计算性能、安全性、互操作性以及智能边缘操作管理服务。

结合小波包变换和随机森林的ASTER蚀变信息提取

为了更准确地提取蚀变信息,本文选择新疆、甘肃和内蒙古三省交界部位为研究区,结合小波包变换和随机森林提取ASTER蚀变信息。首先,选择主要蚀变类型的诊断性波段进行特征向量主成分分析,得到主分量影像;接着,对主分量影像进行小波包变换,使用代价函数选择最优小波包树,并提取高低频信息构造分类向量;然后,经过特征筛选构造随机森林分类模型,并提取矿化蚀变信息;最后,通过野外采样、薄片鉴定对提取结果进行精度评价。铁染、Al-OH及Mg-OH蚀变信息的主成分分析波段组合分别选择Band 1、2、3、4,Band 1、3、4、6及Band 1、5、8、9。结果表明,本文方法提取铁染、Al-OH基团及Mg-OH基团蚀变信息的总体精度可达到88.7443、85.5469及91.7594,Kappa分别为0.7767、0.6732及0.8362,与成矿区带及已有的该区域的成矿特征相关性较好。本研究采用的最优小波包树能充分利用矿物光谱的能量特征,随机森林可削弱矿物组分的噪声干扰,研究结果可为遥感蚀变信息提取提供技术参考。

多方向小波变换高分影像边缘提取

由于小波变换方向分辨率较低,而高分影像中地物几何结构丰富,边缘存在于各个方向,导致了图像小波变换的频率系数仅被分解到水平、垂直和对角3个方向子带上,使得小波变换对具有复杂几何结构的地物边缘提取存在不足。为此提出一种Directionlet变换理论结合模极大值法的高分影像边缘提取方法。首先,对原始影像进行基于格的分解获得任意方向一维线集合,再进行小波变换并恢复图像格式得到高频方向子带;然后,利用改进模极大值法和双阈值法对系数进行处理得到边缘结果;最后,采用数学形态学方法对边缘提取结果进行细化连接等后处理,从而实现对高分影像边缘的提取。实验结果表明,该方法与传统边缘检测方法和小波变换相比,边缘提取更加完整,定位精度更高。

基于协作反馈控制算法的车联网行车安全动态强化模型

针对车联网(IoV)环境下,单车的信息采集和处理能力不足以满足时间敏感的行车安全应用需求,需要通过多车协作增强车间信息共享和信道接入能力等问题,提出一种基于协作反馈控制算法的行车安全动态强化模型。首先,提出虚拟车队协作模型,提升交通信息的采集精度,扩大采集范围,建立车间的稳定协作关系,在形成协作虚拟车队的同时降低信道拥塞;然后,实现一个针对消息传输和驾驶控制的联合优化模型,通过异构交通数据的深度融合最大化IoV的安全效用;最后,在对车流量时空变化进行预测的基础上,提出自适应的反馈控制模型实时调整驾驶安全策略。仿真结果表明,所提出的行车安全动态强化模型在各种车流分布模型下,均能够取得良好的性能指标,可以有效支持驾驶辅助控制系统,在保障行车安全的同时降低信道拥塞。

PLS与EM算法支持下的遥感影像变化检测

针对高分辨率遥感影像波段间大量数据冗余及小比例变化阈值难以准确确定问题,提出一种偏最小二乘法(PLS)与局部最大期望(EM)的高分辨率影像变化检测算法。首先,以前后时相多波段的遥感影像为两组多元变量,通过多元数据统计PLS变换模型分析,提取有效成分并以差值法构造差异影像;然后,采用局部变化比例比较大的区域通过EM算法提出差异影像的变化检测阈值;最后,利用局部影像确定的阈值将整幅差异影像分为变化和非变化两类并利用滤波算子对检测结果进行处理。采用高分辨率遥感影像数据进行试验,试验表明该方法能够较好地利用多光谱影像提取地表覆盖的变化信息,对地理国情动态监测具有一定的应用价值。

一种基于图像几何矩的非降维连续尺度解构模式

针对降维解构分析的多尺度图像处理容易造成高维信息的破碎与损失这一问题,建立了一种基于图像几何矩的非降维连续尺度解构模式,并在此模式下构建了10组非降维解构模型。模型以单通道图像为应用对象,以几何矩为算子,以不同尺度窗口下矩运算产生的特征值为基础对原始信息进行非降维解构。10组解构结果呈现均衡模式和增长模式两种形态。代入多尺度分割算法验证证明,基于图像几何矩的非降维连续解构分析可以提升多尺度分割精度,且增长模式下的解构信息对于图像分割更有利。

Privacy-Preserving Relative Location Based Services for Mobile Users

Location-aware applications have been used widely with the assistance of the latest positioning features in Smart Phone such as GPS,AGPS,etc.However,all the existing applications gather users' geographical data and transfer them into the pertinent information to give meaning and value.For this kind of solutions,the user's privacy and security issues might be raised because the geographical location has to be exposed to the service provider.A novel and practical solution is proposed in this article to provide the relative location of two mobile users based on their WiFi scanned results without any additional sensors.There is no privacy concern in this solution because end users will not collect and send any sensitive information to the server.This solution adopts a Client/Server(C/S) architecture,where the mobile user as a client reports the ambient WiFi APs and the server calculates the distances based on the WiFi AP's topological relationships.A series of technologies are explored to improve the accuracy of the estimated distance and the corresponding algorithms are proposed.We also prove the feasibility with the prototype of "Circle Your Friends" System(CYFS) on Android phone which lets the mobile user know the distance between him and his social network friends.

Buffer and Switch： Road-to-Road Routing Scheme for Intermittently Connected Vehicular Networks

Due to the road-constrained data delivery and highly dynamic topology of vehicle nodes in a Vehicular Ad Hoc Network (VANET), it is better to construct routing based on the road-to-road pattern than the traditional node-to-node routing pattern in MANETs. However, the challenging issue is the opportunistic forwarding at intersections. Therefore, we propose a novel routing scheme, called Buffer and Switch (BAS). In BAS, each road buffers the data packets with multiple duplicates propagation in order to provide more opportunities for packet switching at intersections. Different from conventional protocols in VANETs, the propagation of duplicates in BAS is bidirectional along the routing path. Moreover, BAS's cost is much lower than other flooding-based protocols due to its spatio-temporally controlled duplicates propagation. Different from recent researches, BAS can deliver packets not only to a stationary node, but also to the stationary or mobile nodes in a specified area. We conduct the extensive simulations to evaluate the performance of BAS based on the road map of a real city collected from Google Earth. The simulation results show that BAS can outperform the existing protocols, especially when the network resources are limited.

Edge Computing

Edge computing refers to the computing paradigm in which the processing power, communication capabilities and intelligence are pushed down to the edge of the networking system like gateways and devices, where the data originates. In doing so, edge computing enables an infrastructure for processing the data directly from devices with low latency, battery consumption and bandwidth cost. With opportunities for research and advanced applications such as augmented reality and wearable cognitive assistance come new challenges. This special issue reports the current re? search on various topics related to edge computing, addressing the challenges in the enabling technologies and practical implementations.

Security in Edge Blockchains:Attacks and Countermeasures

Edge blockchains,the blockchains running on edge computing infrastructures,have attracted a lot of attention in recent years.Thanks to data privacy,scalable computing resources,and distributed topology nature of edge computing,edge blockchains are considered promising solutions to facilitating future blockchain applications.However,edge blockchains face unique security issues caused by the de⁃ployment of vulnerable edge devices and networks,including supply chain attacks and insecure consensus offloading,which are mostly not well studied in previous literature.This paper is the first survey that discusses the attacks and countermeasures of edge blockchains.We first summarize the three-layer architecture of edge blockchains:blockchain management,blockchain consensus,and blockchain lightweight cli⁃ent.We then describe seven specific attacks on edge blockchain components and discuss the countermeasures.At last,we provide future re⁃search directions on securing edge blockchains.This survey will act as a guideline for researchers and developers to design and implement se⁃cure edge blockchains.

结合PCA、多尺度分割及SVM的ASTER遥感蚀变信息提取

为了利用遥感影像进行更加精确的找矿预测,本文选择新疆东天山尾亚地区ASTER数据进行矿化蚀变信息提取方法研究。为了提高信息提取精度,本文提出了结合主成分分析(PCA)、多尺度分割和支持向量机(SVM)的遥感矿化蚀变信息提取方法。首先,分析ASTER数据的特征,选取各矿化蚀变信息的特征波段,对组合波段进行主成分分析,获得主分量图像;然后,对各主分量图像进行多尺度分割,并获得分割之后的均值图像;接着,提取训练样本,利用SVM对训练样本进行训练,采用试验方法求得最优核参数和松弛变量,构造最优SVM模型;最后,运用最优SVM模型完成矿化蚀变信息的提取。进行主成分分析时,铁染蚀变信息选择Band1、2、3、4组合,Al-OH基团蚀变信息选择Band 1、4、6、7组合,OH和CO32-基团蚀变信息采用Band 1、2、8、9组合。在运行SVM时采用了序列最小优化算法(SMO)进行求解,速度提高了12%。实验结果表明,与波段比值法、主成分分析法及基于光谱角和SVM的方法等3种方法相比,本文方法提取铁染蚀变信息、Al-OH基团蚀变信息及OH和CO32-基团蚀变信息的总体精度可达到87.98%、90.01%及88.93%,Kappa系数分别为0.8011、0.8134及0.8023,与成矿区带、已知矿点和已有不同地质背景成矿特征相关性较好。

高分辨率遥感影像建筑区域局部几何特征提取

及时准确地获取城市建筑区域的空间分布及其变化信息对于城市规划、空间地理数据库建设及区域社会经济分析具有重要意义。本文提出一种基于多尺度Gabor变换和感知聚类方法即张量投票TV (Tensor Voting)相结合的自适应局部几何不变特征检测方法,并将其应用于高空间分辨率遥感影像建筑区域提取。首先,考虑到高分辨率遥感影像复杂的几何结构特征,使用Gabor滤波器组对影像进行多尺度多方向变换检测奇异性特征。然后,在感知聚类框架下,根据张量投票理论将不同方向子带系数位置编码为相应的二阶对称方向张量,为了突出影像几何特征,对不同尺度、不同方向子带中任意像素位置方向张量使用滤波器响应系数加权并求和完成多尺度特征融合。再次,对张量特征分解得到点结构与线结构显著性图并使用非极大抑制提取相应角点和曲线等局部几何特征,同时生成约束准则筛选角点以确定建筑物坐标。最后,利用概率密度估计结合局部角点特征生成全局概率密度场描述影像中像素从属于建筑目标的概率,并使用最大类间方差法(Otsu)阈值分割自动提取居民地多边形区域。使用分辨率分别为0.49 m、0.98 m的Google Earth及0.8 m的高分二号等影像数据集进行实验,实验结果表明本文方法相对于已有的Harris和HSCD点检测算法,在建筑区域提取质量上(Quality)上分别提高了4.79%,5.96%;1.47%,3.76%和1.91%,4.08%。

多尺度对象高空间分辨率遥感影像谱聚类分割

针对基于像素模型的单尺度或多尺度谱聚类影像分割方法在相似矩阵存储、特征分解效率及分割精度方面存在的不足。该文首先通过给定多组空间及光谱带宽参数,利用mean-shift初分割生成不同尺度的超像素对象层;然后联合像素与超像素对高空间分辨率影像中的不同类别地物进行的多尺度建模表达其空间拓扑关系,即在图割理论框架下建立“像素-超像素”联合的多尺度无向权图模型G(V,E,W),同时根据遥感影像纹理特征丰富的特点,在顶点相似性计算过程中融合纹理特征;最后使用基于normalized cut准则的谱聚类算法,对图模型划分得到最终分割结果。该方法较好地降低了基于像素的谱聚类分割方法的计算复杂度,同时提高分割结果准确率。标准测试数据集和“高分2号”遥感影像分割结果表明了该方法的有效性。

Mobile agent-enabled framework for structuring and building distributed systems on the internet

Mobile agent has shown its promise as a powerful means to complement and enhance existing technology in various application areas. In particular, existing work has demonstrated that MA can simplify the development and improve the performance of certain classes of distributed applications, especially for those running on a wide-area, heterogeneous, and dynamic networking environment like the Internet. In our previous work, we extended the application of MA to the design of distributed control functions, which require the maintenance of logical relationship among and/or coordination of processing entities in a distributed system. A novel framework is presented for structuring and building distributed systems, which use cooperating mobile agents as an aid to carry out coordination and cooperation tasks in distributed systems. The framework has been used for designing various distributed control functions such as load balancing and mutual ex- clusion in our previous work. In this paper, we use the framework to propose a novel approach to detecting deadlocks in distributed system by using mobile agents, which demonstrates the advantage of being adaptive and flexible of mobile agents. We first describe the MAEDD （Mobile Agent Enabled Deadlock Detection） scheme, in which mobile agents are dispatched to collect and analyze deadlock information distributed across the network sites and, based on the analysis, to detect and resolve deadlocks. Then the design of an adaptive hybrid algorithm derived from the framework is presented. The algorithm can dynamically adapt itself to the changes in system state by using different deadlock detection strategies. The performance of the proposed algorithm has been evaluated using simulations. The results show that the algorithm can outperform existing algorithms that use a fixed deadlock detection strategy.