自适应二进制算术编码的动态可重构实现研究

针对H.266/VVC视频编码标准下的上下文自适应二进制算术编码器编码速度慢、资源开销大的问题,面向可重构结构依据算法的内在并行特性优化了编码架构,并基于动态可重构阵列处理器设计实现了CABAC编码器常规编码模式下的并行映射方法,阵列结构能够根据编码输入对优化后的算法进行动态重构,在避免专用硬件编码器较高的资源开销情况下利用软件重构的方法实现熵编码过程,保证编码准确性的同时提高了视频数据流编码效率,为此类运算密集型算法的硬件实现提供了更为灵活高效的参考途径。仿真结果表明,映射实现的编码过程中每个编码周期完成5个二进制序列的编码,平均编码效率达到384.13Mbin/s。基于FPGA的测试结果表明,软件重构方法与专用硬件实现的编码器相比,资源开销降低且编码效率提升5.47%,与同类型可重构视频编码结构相比,编码效率提升7.03%。     

HEp-2 cell pattern classification with discriminative dictionary learning

The paper presents a supervised discriminative dictionary learning algorithm specially designed for classifying HEp-2 cell patterns. The proposed algorithm is an extension of the popular K-SVD algorithm: at the training phase, it takes into account the discriminative power of the dictionary atoms and reduces their intra-class reconstruction error during each update. Meanwhile, their inter-class reconstruction effect is also considered. Compared to the existing extension of K-SVD, the proposed algorithm is more robust to parameters and has better discriminative power for classifying HEp-2 cell patterns. Quantitative evaluation shows that the proposed algorithm outperforms general object classification algorithms significantly on standard HEp-2 cell patterns classifying benchmark¹ and also achieves competitive performance on standard natural image classification benchmark.     

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.     

Fisher discrimination based low rank matrix recovery for face recognition

In this paper, we consider the issue of computing low rank (LR) recovery of matrices with sparse errors. Based on the success of low rank matrix recovery in statistical learning, computer vision and signal processing, a novel low rank matrix recovery algorithm with Fisher discrimination regularization (FDLR) is proposed. Standard low rank matrix recovery algorithm decomposes the original matrix into a set of representative basis with a corresponding sparse error for modeling the raw data. Motivated by the Fisher criterion, the proposed FDLR executes low rank matrix recovery in a supervised manner, i.e., taking the with-class scatter and between-class scatter into account when the whole label information are available. The paper shows that the formulated model can be solved by the augmented Lagrange multipliers and provides additional discriminating power over the standard low rank recovery models. The representative bases learned by the proposed method are encouraged to be closer within the same class, and as far as possible between different classes. Meanwhile, the sparse error recovered by FDLR is not discarded as usual, but treated as a feedback in the following classification tasks. Numerical simulations demonstrate that the proposed algorithm achieves the state of the art results.     

Image clustering based on sparse patch alignment framework

Image clustering methods are efficient tools for applications such as content-based image retrieval and image annotation. Recently, graph based manifold learning methods have shown promising performance in extracting features for image clustering. Typical manifold learning methods adopt appropriate neighborhood size to construct the neighborhood graph, which captures local geometry of data distribution. Because the density of data points’ distribution may be different in different regions of the manifold, a fixed neighborhood size may be inappropriate in building the manifold. In this paper, we propose a novel algorithm, named sparse patch alignment framework, for the embedding of data lying in multiple manifolds. Specifically, we assume that for each data point there exists a small neighborhood in which only the points that come from the same manifold lie approximately in a low-dimensional affine subspace. Based on the patch alignment framework, we propose an optimization strategy for constructing local patches, which adopt sparse representation to select a few neighbors of each data point that span a low-dimensional affine subspace passing near that point. After that, the whole alignment strategy is utilized to build the manifold. Experiments are conducted on four real-world datasets, and the results demonstrate the effectiveness of the proposed method.     

Advancements in the design and validation of an air pollution integrated assessment model for Spain

This paper describes the design and application of the Atmospheric Evaluation and Research Integrated model for Spain (AERIS). Currently, AERIS can provide concentration profiles of NO₂, O₃, SO₂, NH₃, PM, as a response to emission variations of relevant sectors in Spain. Results are calculated using transfer matrices based on an air quality modelling system (AQMS) composed by the WRF (meteorology), SMOKE (emissions) and CMAQ (atmospheric-chemical processes) models. The AERIS outputs were statistically tested against the conventional AQMS and observations, revealing a good agreement in both cases. At the moment, integrated assessment in AERIS focuses only on the link between emissions and concentrations. The quantification of deposition, impacts (health, ecosystems) and costs will be introduced in the future. In conclusion, the main asset of AERIS is its accuracy in predicting air quality outcomes for different scenarios through a simple yet robust modelling framework, avoiding complex programming and long computing times.     

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.     

计算机网络安全性分析建模研究

计算机与互联网的结合,通过遵循共通的TCP/IP通信协议实现了全世界互联。针对脉冲编码调制技术中传输数据信息的抽样、量化和编码,抽取的模拟信号完成幅值跳变,使Q个变化的电平之间完成转换模式,最终在终端设备上对数据信息解码以及解调,恢复原始信号,保证了传输数据信息的有效性,使传输的数据信息无失真的传送至终端设备,这种技术模式将会使计算机网络安全更加严谨。     

一种基于稀疏表示的WLAN室内定位算法

随着科技进步和人民生活水平的提高,越来越多的用户对定位技术需求变得日益迫切。基于WLAN的室内定位技术研究在此背景下应运而生,但是该技术容易受非视距离以及多径影响。而位置指纹算法有效地克服了上述缺点,并得到了广泛应用。提出一种基于稀疏表示的WLAN室内定位算法,以解决位置指纹算法K近邻方法中参数选择问题、不能综合利用全局参考点信息问题,并对其进行了实验仿真。