Laplacian group sparse modeling of human actions

Recently, many local-feature based methods have been proposed for feature learning to obtain a better high-level representation of human behavior. Most of the previous research ignores the structural information existing among local features in the same video sequences, while it is an important clue to distinguish ambiguous actions. To address this issue, we propose a Laplacian group sparse coding for human behavior representation. Unlike traditional methods such as sparse coding, our approach prefers to encode a group of relevant features simultaneously and meanwhile allow as less atoms as possible to participate in the approximation so that video-level sparsity is guaranteed. By incorporating Laplacian regularization the method is capable to ensure the similar approximation of closely related local features and the structural information is successfully preserved. Thus, a compact but discriminative human behavior representation is achieved. Besides, the objective of our model is solved with a closed-form solution, which reduces the computational cost significantly. Promising results on several popular benchmark datasets prove the efficiency and effectiveness of our approach.     

Tool path generation framework for accurate manufacture of complex 3D sheet metal parts using single point incremental forming

The prototyping of complex sheet metal parts using single point incremental forming (SPIF) requires the generation of optimal tool paths and/or tool path sequences that ensure that the formed part is within geometric design specifications. The presence of a multitude of features on complex parts leads to multiple inaccuracy inducing phenomena occurring simultaneously due to interactions between the features. This paper proposes a network analysis methodology using topological conceptual graphs to capture the effects of different phenomena on the final accuracy of a sheet metal part manufactured by SPIF. Using this framework optimized tool paths can be generated that compensate for the inaccuracy inducing behavior. Tool path generation algorithms to create partial tool paths that account for the accuracy of specific features in the part based on the proposed framework are also presented. Finally, the creation of integrated tool paths maintaining complementarity between tool paths and desired continuity behavior using non-uniform cubic B-splines is illustrated. A number of case studies demonstrating the applicability of the integrated framework are discussed, where the maximum deviations in the part are significantly reduced and the average absolute deviations for the complete part are brought down to less than 0.5 mm.     

H.264/SVC mode decision based on mode correlation and desired mode list

Design of video encoders involves implementation of fast mode decision (FMD) algorithm to reduce computation complexity while maintaining the performance of the coding. Although H.264/scalable video coding (SVC) achieves high scalability and coding efficiency, it also has high complexity in implementing its exhaustive computation. In this paper, a novel algorithm is proposed to reduce the redundant candidate modes by making use of the correlation among layers. A desired mode list is created based on the probability to be the best mode for each block in base layer and a candidate mode selection in the enhancement layer by the correlations of modes among reference frame and current frame. Our algorithm is implemented in joint scalable video model (JSVM) 9.19.15 reference software and the performance is evaluated based on the average encoding time, peak signal to noise ration (PSNR) and bit rate. The experimental results show 41.89% improvement in encoding time with minimal loss of 0.02 dB in PSNR and 0.05% increase in bit rate.     

基于Voronoi图的连续反向最近邻查询

为解决动态环境中移动点的连续反向最近邻查询问题,将连续反向最近邻查询分为单色和双色2种情况进行研究。利用移动点Voronoi图,分别给出单色连续反向最近邻查询算法、双色连续反向最近邻查询算法以及相关定理,对算法正确性和可终止性进行证明,分析算法时间复杂性。按照移动点Voronoi图的拓扑结构是否改变分为2种情况,分析每种情况下候选所在区域的变化,在变化区域内进行Voronoi图的重构,得到对应的解决方法。在多数情况下,该算法只需生成局部移动点的Voronoi图即可找到结果,减小了连续反向最近邻查询的代价。     

基于线性动态系统稀疏编码的异常事件检测

线性动态系统模型结合稀疏编码实现异常事件检测。线性动态系统可有效地捕捉动态纹理在时间和空间的转移信息,描述视频的时空小块。然而,线性动态系统属于非欧氏空间,无法直接用传统的稀疏编码进行异常检测。基于约束凸优化公式,将相似性变换与稀疏编码结合,可实现线性动态系统稀疏编码的优化求解。实验表明,所提出的方法具有更好的性能。     

改进行移编码的文本数字水印算法研究

研究了文本数字水印在追溯涉密纸质文档中的重要意义,介绍了常见的文本数字水印技术,分析了Brassil经典行移编码文本数字水印技术,在算法的标记策略中引入检验编码,文本行分割划段和引入基调行三个方面进行改进,改进后算法具有更大水印信息容量,更强的鲁棒性和可控的计算量.     

FC-AE-ASM网络的模糊可靠性研究

针对目前FC-AE-ASM(fibre channel avionic environment anonymous subscriber messaging)网络可靠性计算问题, 以网络任务模型为基础, 提出了FC-AE-ASM网络的模糊可靠性模型。该模型主要分析了FC-AE-ASM网络的三种基本拓扑, 得出了这三种结构的模糊可靠性表达式。同时, 结合串并联的推导方法, 推导出了FC-AE-ASM冗余网络的模糊可靠性计算式。对实例的计算结果表明, FC-AE-ASM网络模糊可靠性的改善取决于关键因素, 并且基本路径冗余网络在自身网络可靠性较高时与全网冗余网络性能基本相同。     

Olfactory coding in the perception of semiochemicals

Information processing in the olfactory pathway underlying the perception of semiochemicals by insects is discussed. Both the chemical message for mates and the message for food consist of blends of chemicals. Olfactory receptors in an insect species are tuned to the detection of those compounds which comprise such chemical messages for that species. The classification of receptors as specialists or generalists coincides with two concepts of information processing, i.e., labeled lines and across-fiber patterns, respectively. The olfactory code coming from antennal receptors inPieris brassicae larvae is a combination of labeled lines and across-fiber patterning. When antennae of adult Colorado potato beetles,Leptinotarsa decemlineata, are stimulated by binary mixtures of leaf odor components, the pattern of neural activities in the olfactory receptors shows some separation into two channels, quantitative versus qualitative detection. The separation is complete in the antennal lobe of this beetle.Presented at the Symposium on Insect Chemical Communications: Unifying Concepts. ACS 194th National Meeting, New Orleans, Louisiana, August 31, 1987.     

一种多参数优化的联合信源信道编码方法*

针对JPEG2000码流的渐进传输特性,提出了一种多参数优化的联合信源信道编码方法,即MPO-JSCC。在码率分配的基础上,动态地选择Turbo码交织长度、迭代译码次数,通过优化编码器多个参数更好地执行不等差错保护策略,同时加入JPEG2000容错工具,在接收端利用错误掩藏机制以提高图像解码成功率。将该方法应用于噪声信道的图像传输系统中,仿真结果表明,MPO-JSCC既能在不增加系统复杂度及延迟时间的同时提高重建图像的质量,又能节省系统发射功率,具有一定的现实指导意义。