基于非线性滤波和纹理传输的图像风格化

纹理传输通过将样本图像纹理信息传递给源图像实现风格化.但在处理纹理细节丰富的源图像和复杂样本图像时,现有技术的处理效果差,且不便于用户进行直观的交互操作.为此,提出一种基于非线性滤波的显式纹理传输方法.首先通过相对总变差和L0梯度最小化滤波器对源图像进行去纹理操作,然后通过相对总变差滤波器对样本图像进行纹理提取,最后通过亮度重映射和线性叠加实现纹理传输.实验结果表明,该方法能够在保持源图像结构和色调信息的同时进行纹理替换;与已有方法相比,交互过程更加直观且风格化效果更好.     

双球面投影几何可量测全景模型的构建

针对全景影像难以提供空间度量的问题,提出一种基于双球面投影几何的可量测立体全景模型构建方法.该方法依据球面全景投影关系与多视几何原理,采用对应变换与本质变换求取旋转及平移参数,并推导出双球面核线约束;在此基础上,建立起双球面投影几何的立体全景模型,解决了球面全景的量测问题.实验结果表明,文中方法可使全景影像在真实呈现户外场景的同时,提供满足一定应用需求的量测分析功能.     

基于激光雷达的大兴安岭典型森林生物量制图技术研究

森林生物量作为森林生态系统基本的数量表征,表明了森林的经营水平和开发利用价值,并能反映其与环境在物质循环和能量流动方面的复杂关系。同时,森林生物量也是林业问题和生态问题研究的基础。以内蒙古大兴安岭国家野外生态站为研究区域,通过对机载激光雷达(LiDAR)点云数据的预处理,利用计算机编程提取LiDAR点云数据的结构参数,以植被分位数高度变量与密度变量为自变量,结合地面调查数据,建立生物量与LiDAR结构参数的回归模型(决定系数为0.69,均方根误差为0.34)。运用IDL编程对LiDAR点云块数据进行运算并生成分辨率为20m×20m的栅格图像,拼接后得到整个区域的地上生物量分布图,对生成的地上生物量分布图进行验证的R2为0.78,RMSE为23.09t/hm2,平均估测精度达83%。     

基于光谱和时相特征的夏玉米遥感识别

精确提取作物种植面积一直是农业遥感关注的主要问题之一。综合运用低分辨率的时相变化特征和中分辨率的光谱特征,提出一种夏玉米识别方法。首先基于MODIS NDVI时间序列曲线,分析夏玉米在时相变化上的识别特征,构建识别模型。夏玉米纯像元利用识别模型识别,而耕地和非耕地类型的植被产生的混合像元,则基于像元分解办法获取耕地组分的NDVI时序特征,再利用识别模型判定,然后结合土地利用数据根据空间关系得到中分辨率结果;玉米与其他作物的混合像元则利用中分辨率尺度光谱差异加以区分。研究结果表明,在伊洛河流域主要农业区,识别精度达到90.33%,为作物类型识别提供了新的思路。     

遥感网格的数据压缩与任务分配方法研究

网格计算作为分布式计算在科学计算领域的发展方向,可以为对地观测数据的处理提供强大的计算力。在分析遥感信息服务网格节点(Remote Sensing Information Service Grid Nodes,RSSN)中网络数据传输和负载均衡两个关键问题的基础上,提出了一种有效的基于游程编码和Huffman编码的数据压缩方法和基于"计算端元"的任务分配策略,该方法针对遥感影像特点进行有效数据压缩,具有较好的压缩比,达到了17%,且能实现任务负载均衡。并在遥感信息服务网格节点计算平台上,以中国范围内1km分辨率气溶胶光学厚度(Aerosol Optical Depth,AOD)反演计算为例,从压缩率和计算时间效率方面验证和分析了上述方法的有效性。     

OPTIMA: On-Line Partitioning Skew Mitigation for MapReduce with Resource Adjustment

Partitioning skew has been shown to be a major issue that can significantly prolong the execution time of MapReduce jobs. Most of the existing off-line heuristics for partitioning skew mitigation are inefficient; they have to wait for the completion of all the map tasks. Some solutions can tackle this problem on-line, but will impose an additional overhead by repartitioning the workload of overloaded tasks. In this paper, we present OPTIMA, an on-line partitioning skew mitigation technique for MapReduce. OPTIMA predicts the workload distribution of reduce tasks at run-time, leverages the deviation detection technique to identify the overloaded tasks and pro-actively adjusts resource allocation for these tasks to reduce their execution time. We provide the upper bound of OPTIMA in time complexity, while allowing OPTIMA to perform totally on-line. Through experiments using both real and synthetic workloads running on an 11-node Hadoop cluster, we have observed OPTIMA can effectively mitigate the partitioning skew and improved the job completion time by up to 36.73 % in our experiments.     

Distributed average computation for multiple time‐varying signals with output measurements

This paper studies the distributed average computation problem for multiple time‐varying signals with bounded inputs. Based only on relative output measurements, a pair of continuous algorithms with, respectively, static and adaptive coupling strengths are designed and utilized. From the concept of boundary layer approach, the proposed continuous algorithm with static coupling strengths can asymptotically obtain the average value of the multiple reference signals without chattering phenomenon. Furthermore, for the case of algorithms with adaptive coupling strengths, the calculation errors are uniformly ultimately bounded and exponentially converge to a small adjustable bounded set. Finally, a simulation example is presented to show the validity of the theoretical results. Copyright © 2015 John Wiley & Sons, Ltd.     

Stochastic consensus control with finite frequency specification for Markov jump networks

A stochastic finite frequency consensus protocol for directed networks with Markov jump topologies and external disturbances is proposed in this paper. By introducing the frequency band information into consensus control design, the disagreement dynamics of interconnected networks asymptotically converge to zero with an improved level of disturbance attenuation in the specific frequency band. In addition, the new model transformation approach is presented by exploring certain features of Laplacian matrix in real Jordan form, which leads to more generality of the designed protocol. A numerical example validates the potential of the developed results. Copyright © 2015 John Wiley & Sons, Ltd.     

Semi‐global and global containment control of multi‐agent systems with second‐order dynamics and input saturation

This paper considers both semi‐global and global containment control for a second‐order multi‐agent system that is composed by a network of identical harmonic oscillators or double integrators with multiple leaders and input saturation. A distributed low gain feedback algorithm is proposed to solve the semi‐global containment control problem for the network whose topology is directed and initial condition is taken from any a priori given bounded set. In particular, by using a parametric Lyapunov equation approach, M‐matrix properties and algebraic graph theory, an upper bound of the low gain parameter is estimated such that the low gain feedback matrix can be analytically determined without involving numerical computation. Furthermore, under the assumption that the induced subgraph formed by the followers is strongly connected and detail balanced, two linear feedback protocols are designed for coupled harmonic oscillators and coupled double integrators, respectively, to asymptotically achieve the global containment control of the network with any initial condition. Finally, numerical examples are given to illustrate the effectiveness of the theoretical results. Copyright © 2016 John Wiley & Sons, Ltd.     

Media Niche of Electronic Communication Channels in Friendship: A Meta‐Analysis

The current landscape of communication technologies is characterized by a wide variety of choices. As each medium provides different affordances, each may occupy a different niche and be used in different relationships. Drawing on the theory of the niche, we did a meta‐analysis involving 27 effect sizes from 22 independent samples to test the correlation between media selection/use and friendship closeness. Results showed that the 5 communication channels filled 2 different friendship closeness niches. Mobile phone calls and texting had stronger positive correlations with friendship closeness than instant messaging, social network sites, and online gaming. Culture, but not gender, moderated some of these correlations: Friendship closeness had a stronger positive association with SNS use and online gaming in collectivist cultures.