A Novel Integrated Path Planning Algorithm for Warehouse AGVs

We propose an integrated path planning method for multiple automated guided vehicles performing logistics delivery within a real-world warehouse environ-ment considering obstacles. By applying it on each vehicle, this proposed method enables the vehicle the vehicles have the capabilities for autonomous path planning. The path planning consists of three parts, K-means algorithm based task points clustering, genetic algorithm based task points ordering, and the probabilistic road map based best path search. Vehicle conflict resolution is depending on implementing the probabilistic road map construction considering the realistic map with obstacles. The simulations result validate that the clustering and ordering are necessary for the path planning, both the path planning time and the Automated guided vehicles (AGVs) running time can be dramatically reduced.     

基于Dijkstra算法的藏语分词研究

介绍了迪杰斯特拉(Dijkstra)算法的定义、思想和步骤。将一个藏语句子构成一个"线性"图,通过图中的算法实现藏语句子的分词操作。将典型图的非线性结构变成特殊的线性结构,并且通过辅助结点将图特殊化,最后再还原。实践证明,使用本方法能巧妙地使用Dijkstra算法来实现分词操作。     

基于混沌映射的数码防伪技术研究

提出了一种基于混沌映射的数码防伪的加密算法.在加密的过程中,选用结构相对简单且生成序列相对复杂的正弦混沌映射和Chebyshev映射.对两个混沌映射进行敏感性和随机性测试,得出两个混沌映射具有良好的密码学特性,并验证得出该加密系统具有良好的加密性能.应用该混沌系统进行加密,提高了算法的复杂度,增大了密钥空间,提高了破译难度,使商品在市场流通的过程中具有更强的防伪性能.     

求解混沌映射不变分布的区间迭代算法

从Frobeniui—Perron积分方程出发，将混沌映射的不变分布看成Forbenius-Perron算子的不动点，经过简化后得到了该不动点的逼近迭代式。在样本数较少的情况下，采用区间迭代算法完成了不变分布的迭代逼近。该方法克服了直方图法要求样本数目大，统计误差明显的缺点，特别适用于分析样本数受限的实际系统。     

A depth perception and visual comfort guided computational model for stereoscopic 3D visual saliency

With the emerging development of three-dimensional (3D) related technologies, 3D visual saliency modeling is becoming particularly important and challenging. This paper presents a new depth perception and visual comfort guided saliency computational model for stereoscopic 3D images. The prominent advantage of the proposed model is that we incorporate the influence of depth perception and visual comfort on 3D visual saliency computation. The proposed saliency model is composed of three components: 2D image saliency, depth saliency and visual comfort based saliency. In the model, color saliency, texture saliency and spatial compactness are computed respectively and fused to derive 2D image saliency. Global disparity contrast is considered to compute depth saliency. Particularly, we train a visual comfort prediction function to distinguish stereoscopic image pair as high comfortable stereo viewing (HCSV) or low comfortable stereo viewing (LCSV), and devise different computational rules to generate a visual comfort based saliency map. The final 3D saliency map is obtained by using a linear combination and enhanced by a “saliency-center bias” model. Experimental results show that the proposed 3D saliency model outperforms the state-of-the-art models on predicting human eye fixations and visual comfort assessment.     

Image saliency estimation via random walk guided by informativeness and latent signal correlations

Visual saliency is an effective tool for perceptual image processing. In the past decades, many saliency models have been proposed by primarily considering visual cues such as local contrast and global rarity. However, such explicit cues derived only from input stimuli are often insufficient to separate targets from distractors, leading to noisy saliency maps. In fact, the latent cues, especially the latent signal correlations that link visually distinct stimuli (e.g., various parts of a salient target), may also play an important role in saliency estimation. In this paper, we propose a graph-based approach for image saliency estimation by incorporating both explicit visual cues and latent signal correlations. In our approach, the latent correlations between various image patches are first derived according to the statistical prior obtained from 10 million reference images. After that, the informativeness of image patches and their latent correlations are jointly considered to construct a directed graph, on which a random walking process is performed to generate saliency maps that pop-out only the most salient locations. Experimental results show that our approach achieves impressive performances on three public image benchmarks.     

Hedging static saliency models to predict dynamic saliency

In recent years, many computational models for saliency prediction have been introduced. For dynamic scenes, the existing models typically combine different feature maps extracted from spatial and temporal domains either by following generic integration strategies such as averaging or winners take all or using machine learning techniques to set each feature’s importance. Rather than resorting to these fixed feature integration schemes, in this paper, we propose a novel weakly supervised dynamic saliency model called HedgeSal, which is based on a decision-theoretic online learning scheme. Our framework uses two pretrained deep static saliency models as experts to extract individual saliency maps from appearance and motion streams, and then generates the final saliency map by weighted decisions of all these models. As visual characteristics of dynamic scenes constantly vary, the models providing consistently good predictions in the past are automatically assigned higher weights, allowing each expert to adjust itself to the current conditions. We demonstrate the effectiveness of our model on the CRCNS, UCFSports and CITIUS datasets.     

水产食品熟食品和水产食品气调包装的研究

本文介绍水产食品、烘烤食品和熟食品的气调包装工艺。从混合气体配气比例、塑料包装材料的气体阻隔性、贮藏温度和包装前食品的卫生指标四个方面因素分析食品气调包装的保鲜效果。通过试验取得一些气调包装食品的保质期。     

教育移动机器人路径规划技术研究

机器人课程已逐渐进入高中教育,移动机器人的路径规划作为一项关键技术,学生实际学习操作比较困难。结合高中教育实际,本文设计了一种基于模糊控制的机器人局部路径规划方法,该方法简单有效,便于理解,可以使学生对机器人控制及路径规划有初步的认识和理解,以激发其学习机器人技术的兴趣。     

Skew Cyclic Codes over a Non-chain Ring

We study skew cyclic codes over a non-chain ring, which generalizes our previous results in IEICE Trans. on Fundamentals of Electronic Communications and Computer Sciences, 2015. We describe generator polynomi-als of skew cyclic codes over this ring and investigate the structural properties of skew cyclic codes over the ring by a decomposition theorem. The generator polynomial of the dual code of a skew cyclic code are obtained. Moreover, the idempotent generators of skew cyclic codes are consid-ered. Some examples are also presented to illustrate the discussed results.