无线ILC系统测控信号延时效应补偿方法

针对通过无线信道进行测控信号传输的远程迭代学习控制( ILC)系统,研究信号传输延时对控制系统性能的影响.分析了测控信号延时情况下ILC系统的收敛性问题,通过引入预控制向量,提出了ILC系统信道延时效应补偿的向量更新方法.数值仿真结果表明了所提方法的有效性.     

Perspective:Societally connected multimedia across cultures

The advance of the Internet in the past decade has radically changed the way people communicate and col- laborate with each other. Physical distance is no more a barrier in online social networks, but cultural differences (at the individual, community, as well as societal levels) still govern human-human interactions and must be con- sidered and leveraged in the online world. The rapid de-ployment of high-speed Internet allows humans to interact using a rich set of multimedia data such as texts, pictures, and videos. This position paper proposes to define a new research area called ’connected multimedia’, which is the study of a collection of research issues of the super-area social media that receive little attention in the literature. By connected multimedia, we mean the study of the social and technical interactions among users, multimedia data, and devices across cultures and explicitly exploiting the cultural differences. We justify why it is necessary to bring attention to this new research area and what benefits of this new research area may bring to the broader scientific research community and the humanity.     

LTE下行MIMO模式自适应切换算法

由于用户在各种不同场景下采用不同的MIMO模式可以达到不同的传输效果,为了使用户达到平均吞吐量和频谱效率的最佳要求,提高系统传输率,研究了TDD LTE系统下行MIMO模式切换技术。搭建TDD LTE下行业务控制信道PDSCH仿真平台,对MIMO传输模式进行仿真实验,通过比较不同模式下的误码率和吞吐量的仿真结果,确定切换门限,提出MIMO模式自适应切换算法。在实际应用中,根据这种算法自适应地配置适合的MIMO技术,可以最大限度的提高系统频谱利用率,此方法优于单独采用一种MIMO技术达到的传输效率。     

运动目标检测与跟踪的DSP实现

研究了运动目标检测与跟踪的DSP（DigitalSignalProcessor）实现算法,以形心跟踪算法为整个处理系统的核心。采用目标形心跟踪算法,通过目标分割阶段的目标标记,如目标面积、周长、形心位置等信息的提取建立目标跟踪波门,实现目标的连续跟踪,并将此算法移植到sEED—VPM642硬件平台,实验结果表明能够达到预定目标。此外,为了克服形心算法的准确性和实时性缺陷,采用粒子滤波对算法进行必要的扩展,从MATLAB的仿真结果看,除个别采样点存在误差较大的情况,真实值曲线与粒子滤波跟踪曲线拟合较好。     

Paradigm and performance analysis of distributed frequent itemset mining algorithms based on Mapreduce

FrequentItemsetMining (FIM) is one of the most important data mining tasks and is the foundation of many data mining tasks. In Big Data era, centralized FIM algorithms cannot meet the needs of FIM for big data in terms of time and space, so Distributed Frequent Itemset Mining (DFIM) algorithms have been designed to meet the above challenges. In this paper, LocalGlobal and RedistributionMining which are two main paradigms of DFIM algorithm are discussed; Two algorithms of these paradigms on MapReduce named LG and RM are proposed while MapReduce is a popular distributed computing model, and also the related work is discussed. The experimental results show that the RM algorithm has better performance in terms of computation and scalability of sites, and can be used as the basis for designing the DFIM algorithm based on MapReduce. This paper also discusses the main ideas of improving the DFIM algorithms based on MapReduce.     

RAFNet: RGB-D attention feature fusion network for indoor semantic segmentation

Semantic segmentation based on the complementary information from RGB and depth images has recently gained great popularity, but due to the difference between RGB and depth maps, how to effectively use RGB-D information is still a problem. In this paper, we propose a novel RGB-D semantic segmentation network named RAFNet, which can selectively gather features from the RGB and depth information. Specifically, we construct an architecture with three parallel branches and propose several complementary attention modules. This structure enables a fusion branch and we add the Bi-directional Multi-step Propagation (BMP) strategy to it, which can not only retain the feature streams of the original RGB and depth branches but also fully utilize the feature flow of the fusion branch. There are three kinds of complementary attention modules that we have constructed. The RGB-D fusion module can effectively extract important features from the RGB and depth branch streams. The refinement module can reduce the loss of semantic information and the context aggregation module can help propagate and integrate information better. We train and evaluate our model on NYUDv2 and SUN-RGBD datasets, and prove that our model achieves state-of-the-art performances.     

Bayesian network based general correspondence retrieval method for depth sensing with single-shot structured light

This study reinvestigated one of the most fundamental problems in structure light depth sensing field: correspondence retrieval of features between patterns and images. We formulate the global optimum correspondence retrieval by maximizing a conditional probability of correspondence given observed features, which is depicted by a Bayesian network. Different from traditional “code-only” based correspondence retrieval methods, the proposed Bayesian network based method exploits the positional correlations of correspondences of neighboring features, namely, the correspondences of poorly detected features are estimated with the aid of the correspondences of well detected features. The method performs especially well on challenging scenes with rich depth variations, abrupt depth changes, edges, etc. Experiments show that the proposed method increase the correspondence accuracy by about 40% on challenging scenes, compared with traditional “code-only” based correspondence retrieval methods.     

Visual tracking using convolutional features with sparse coding

Artificial Intelligence Review - Visual object tracking has become one of the most active research topics in computer vision, and it has been applied in several commercial...     

A novel dual-biological-community swarm intelligence algorithm with a commensal evolution strategy for multimodal problems

The Journal of Supercomputing - For sophisticated applications, engineers should always consider multi-objective, multi-task or multi-modal problems, especially in the Internet of Things, such as...     

Lung nodules detection using semantic segmentation and classification with optimal features

Neural Computing and Applications - Lung cancer is a deadly disease if not diagnosed in its early stages. However, early detection of lung cancer is a challenging task due to the shape and size of...