Positivity-preserving flux-limited method for compressible fluid flow

The extension of a flux discretization method to second-order accuracy can lead to some difficulties in maintaining positivity preservation. While the MUSCL-TVD scheme maintains the positivity preservation property of the underlying 1st-order flux discretization method, a flux-limited-TVD scheme does not. A modification is here proposed to the flux-limited-TVD scheme to make it positivity-preserving when used in conjunction with the Steger-Warming flux vector splitting method. The proposed algorithm is then compared to MUSCL for several test cases. Results obtained indicate that while the proposed scheme is more dissipative in the vicinity of contact discontinuities, it performs significantly better than MUSCL when solving strong shocks in hypersonic flowfields: the amount of pressure overshoot downstream of the shock is minimized and the time step can be set to a value typically two or three times higher. While only test cases solving the one-dimensional Euler equations are here presented, the proposed scheme is written in general form and can be extended to other physical models.     

An efficient unstructured MUSCL scheme for solving the 2D shallow water equations

The aim of this paper is to present a novel monotone upstream scheme for conservation law (MUSCL) on unstructured grids. The novel edge-based MUSCL scheme is devised to construct the required values at the midpoint of cell edges in a more straightforward and effective way compared to other conventional approaches, by making better use of the geometrical property of the triangular grids. The scheme is incorporated into a two-dimensional (2D) cell-centered Godunov-type finite volume model as proposed in Hou et al. (2013a,c) to solve the shallow water equations (SWEs). The MUSCL scheme renders the model to preserve the well-balanced property and achieve high accuracy and efficiency for shallow flow simulations over uneven terrains. Furthermore, the scheme is directly applicable to all triangular grids. Application to several numerical experiments verifies the efficiency and robustness of the current new MUSCL scheme.     

基于压缩感知的改进MPEG-2编码方案

为寻找压缩感知在视频编码上的应用并提高MPEG-2的编码效率,提出了基于压缩感知和MPEG-2的改进方案。该视频编码改进方案从标准重构方法与像素域最小全变分重构算法中选出最终重构方法,使最终重构出的图像具有较小均方误差和。像素域最小全变分重构算法的提出,基于原始图像的梯度比残差图像的梯度更稀疏这个特征。实验结果表明,所提出的方案对于各类序列都有性能的提升。对于有比较锐利边缘物体的序列,平均峰值信噪比(PSNR)提高0.5dB以上;而对于具有较多平坦区域或复杂纹理的序列,平均PSNR也有0.26dB~0.41dB的提高。     

3D reconstruction and face recognition using kernel-based ICA and neural networks

Kernel-based nonlinear characteristic extraction and classification algorithms are popular new research directions in machine learning. In this paper, we propose an improved photometric stereo scheme based on improved kernel-independent component analysis method to reconstruct 3D human faces. Next, we fetch the information of 3D faces for facial face recognition. For reconstruction, we obtain the correct normal vector’s sequence to form the surface, and use a method for enforcing integrability to reconstruct 3D objects. We test our algorithm on a number of real images captured from the Yale Face Database B, and use three kinds of methods to fetch characteristic values. Those methods are called contour-based, circle-based, and feature-based methods. Then, a three-layer, feed-forward neural network trained by a back-propagation algorithm is used to realize a classifier. All the experimental results were compared to those of the existing human face reconstruction and recognition approaches tested on the same images. The experimental results demonstrate that the proposed improved kernel independent component analysis (IKICA) method is efficient in reconstruction and face recognition applications.     

改进C-V模型的木材缺陷彩色图像分割研究

分析了木材节子缺陷图像的特点,将彩色图像作为一个整体的图像进行处理,保护了彩色图像信息的特性,提出了一种基于AOS的扩展C-V矢量模型及背景填充耦合的木材节子缺陷彩色图像分割算法。对Chan-Vese提出的基于Mumford-Shah模型的水平集矢量图像分割模型进行了改进,使分割速度得到了提高;用AOS算法改进了原模型的差分格式,使得差分格式无条件稳定;结合背景填充技术,使得到的新图像缩减了目标与背景间的特征差别。实验结果表明该方法可以较好地实现对木材死节、活节和虫眼等缺陷的彩色图像分割,也可实现对单板多节子缺陷彩色图像的分割,为木材缺陷边缘检测提供一种行之有效的方法。     

基于平面拟合恢复运动矢量的错误隐藏算法

针对压缩视频码流在无线信道传输过程中由于运动矢量失配导致重构图像质量的问题,提出了一种基于平面拟合恢复运动矢量的错误隐藏算法。首先,根据H.264视频标准具有多参考帧且相邻宏块间的相关性的特点,通过把与受损宏块直接相邻的每个分块的运动矢量定义为一个点,采用平面拟合方法表征小范围内相邻运动矢量的变化趋势,对受损宏块运动矢量进行重建,然后利用改进的边界匹配函数,选取最优运动矢量对受损图像进行恢复。实验结果表明,该算法不仅避免了AIC算法产生的块效应,而且在不同的RTP丢包概率下,该算法比AIC算法得到的峰值信噪比有0.3~2.5 dB的提升。     

未知输入和可测噪声重构之线性矩阵不等式非线性系统观测器设计

针对一类同时具有未知输入和输出可测噪声的Lipschitz非线性系统,讨论了状态估计、未知输入与可测噪声重构的问题.首先,基于广义系统和线性矩阵不等式的方法设计滑模未知输入观测器,不仅对原系统状态进行渐近估计,而且实现了对系统输出可测噪声的重构;其次,考虑一种鲁棒滑模微分器,实现了广义系统输出向量微分的精确估计,并在此基础上,提出了一种未知信息重构方法,该方法具有避免直接使用系统输出微分信息的优点.最后,对火车牵引拖动系统模型仿真,结果表明该方法不但能够实现对系统状态的估计,而且可以有效重构未知信息.     

基于ETRN具有任意压缩率的彩色加密图像有损压缩

当前大多数的先加密后压缩ETC（encryption-then-compression）方法只能够获得有限固定的压缩率,而无法获取到实际需求的任意压缩率。针对此问题提出一种具有任意压缩率的加密彩色图像有损压缩算法,该算法采用均匀下采样和随机下采样有机结合的方式对加密图像进行压缩,以获得加密图像的任意压缩率。接收方接收到加密图像的压缩序列后通过解压解密获得解密图像,随后把从解密图像有损重构原始图像的过程表征为一个结合下采样压缩方式约束的最优化问题,并设计一种基于卷积神经网络的有损ETC系统图像重构模型ETRN（ETC-oriented reconstruction network）来求解该优化问题。ETRN模型包含浅层特征提取层SFE（shallow feature extraction）、残差堆叠模块RIR（residual in residual）、残差信息补充模块RCS（residual content supplementation）、下采样约束模块DC（down-sampling constraint）。实验仿真结果表明,提出的加密彩色图像有损压缩算法能够获得优秀的加密压缩和重构性能,充分体现了该方法的可行性和有效性。     

无证书代理盲签名方案的密码学分析与改进

对黄隽等人提出的无证书代理盲签名方案进行安全分析,指出该方案不仅不能抵抗公钥替换攻击,而且也不能抵抗恶意但被动的KGC的攻击,给出了具体的攻击方法。针对此方案的安全缺陷,提出一种改进方案,使得改进后的方案具有更高的安全性,并且改进后方案的效率与原方案相同。     

一种基于压缩域的穿戴式心电信号直接特征提取与分类方法

压缩感知是实现可穿戴式健康监测系统低能耗工作方式的一种有效途径,而现有基于压缩感知的心电信号分类方法大多需要在进行分类之前,先使用重构算法恢复出原始心电信号,这可能会导致较高的计算复杂度高,不适合于具有实时性需求的可穿戴式系统。提出一种基于压缩域的穿戴式心电信号的特征提取与自动分类方法。跳过信号重构步骤,使用改进的主成分分析法在压缩域上直接对压缩后的心电信号进行特征提取,并基于最小二乘支持向量机半监督学习方法实现心电信号的自动分类。实验结果表明,相较于在非压缩域上的分类方法,该方法在保证分类性能下降非常少的前提下,心电数据量大大地减少,有效提高了心电信号自动分类的效率。     

Reversible fragile watermarking for locating tampered blocks in 2D vector maps

For 2D vector maps, obtaining good tamper localization performance and original content recovery with existing reversible fragile watermarking schemes is a technically challenging problem. Using an improved reversible watermarking method and a fragile watermarking algorithm based on vertex insertion, we propose a reversible fragile watermarking scheme that detects and locates tampered blocks with high accuracy while ensuring recovery of the original content. In particular, we propose dividing the features of the vector map into different blocks, calculating the block authentication watermarks and embedding the watermarks with different watermarking schemes. While the block division ensures superior accuracy of tamper localization, the reversible watermarking method and the fragile watermarking algorithm based on vertex insertion provide recovery of the original content. Experimental results show that the proposed scheme could detect and locate malicious attacks such as vertex/feature modification, vertex/feature addition, and vertex/feature deletion.     

对一种新型代理签名方案的进一步分析和改进

通过对鲁荣波等人提出的新型代理签名方案进行分析,指出该方案不满足公钥替换攻击,并给出了攻击方法。在此基础上提出一种改进的代理签名方案,克服了原方案的安全缺陷,有效地防止原始签名人的伪造攻击。与原方案相比,改进的方案在效率不变的情况下具有更高的安全性。     

基于SRCNN和SSD网络的小目标检测方法

针对实时目标检测SSD(Sing shot multibox detector)算法对小目标检测能力弱的问题,提出一种提高特征图分辨率的超分辨率重建SRCNN(Super Resolution Convolutional Neural Networks)设计策略。改进算法是在SSD基础网络VGG_16网络的conv4_3卷积层上进行的,把conv4_3卷积层产生的特征图通过SRCNN网络进行超分辨重建以提高conv4_3卷积层的特征图分辨率。然后再利用超分辨重建后的特征图和原特征图一起为小目标检测提供所需要的特征。实验表明上述设计方法相比于原经典SSD算法具有更高的检测精度和检测能力,以及在小目标检测上的效果更加明显。     

Robotics in Education

Collision avoidance is essential for safe robot manipulation. Especially with humans around, robots should work only when safety can be robustly guaranteed. In this paper, we propose using virtual impedance control for reactive, smooth, and consistent collision avoidance that interferes minimally with the original task. The virtual impedance control operates in the risk space, a vector space describing the possibilities of all forthcoming collisions, and is designed to elude all risks in a consistent response in order to create assuring human-robot interaction experiences. The proposed scheme intrinsically handles kinematic singularity and the activation of avoidance using a boundary layer defined on the spectrum of Jacobian. In cooperation with the original controller, the proposed avoidance scheme provides a proof of convergence if the original controller is stable with and without projection. In simulations and experiments, we verified the characteristics of the proposed control scheme and integrated the system with Microsoft Kinect to monitor the workspace for real-time collision detection and avoidance. The results show that the proposed approach is suitable for robot operation with humans nearby.     

Integration of Dynamic Equation of Spring-Mass-Damper Systems via Chebyshev Polynomials

A numerical scheme based on Chebyshev polynomials for the determination of the response of spring-mass-damper systems is presented. The state vector of the differential equation of the spring-mass-damper system is expanded in terms of Chebyshev polynomials. This expansion reduces the original differential equations to a set of linear algebraic equations where the unknowns are the coefficient of Chebyshev polynomials. A formal procedure to generate the coefficient matrix and the right-hand side vector of this system of algebraic equations is discussed. The numerical efficiency of the proposed method is compared with that of Runge-Kutta method. It is shown that this scheme is accurate and is computationally efficient.     

基于IPv6拒绝服务攻击和改进确定包算法研究

对IPv6下拒绝服务攻击进行了研究,并根据IPv6协议的特点,提出一种基于IPv6的MAC认证改进确定包标记(ADPM-v6)算法。ADPM-v6利用IPv6新特性,即逐跳选项和改进的MAC认证方法,有效解决了受控路由器修改标记的问题,能直接快速地追踪攻击源。同时分析验证了IPv6真实攻击环境的数据包大小分布,使得算法有效且更具有较强的实用性。理论分析和仿真实验结果表明,该算法在IPv6下大大缩短了重构时间,减少了重构计算量和误报率。     

基于改进KNN算法的中文文本分类方法

介绍了中心向量算法和KNN算法两种分类方法。针对KNN分类方法在计算文本相似度时存在的不足,提出了改进方案。新方案引入了中心向量分类法的思想。通过实验,对改进的KNN算法、中心向量算法和传统的KNN算法应用于文本分类效果进行了比较。实验结果表明,改进的KNN算法较中心向量法和传统的KNN算法在处理中文文本分类问题上有较好的分类效果,验证了对KNN算法改进的有效性和可行性。     

VQ indexes compression and information hiding using hybrid lossless index coding

For the compression of memoryless vector quantization (VQ), most of the lossless index coding algorithms are not suitable for various test images. As a result, we present a hybrid dynamic tree-coding scheme (DTCS) and modified search order coding scheme (MSOC) to re-encode the output index map efficiently without causing any extra coding distortion. The main idea behind this scheme is that the adjacent left and upper around the current processed block usually provide more useful information than its adjacent left-upper and right-upper block, thus we employ two different coding methods according to their corresponding left or upper spatial relations. In addition, we applied the HLIC method to the information hiding. The proposed method does not modify the contents of the secret data and the compressed image. Experimental results show that the newly proposed algorithm achieves significant reduction of bit rate compared to the other lossless index coding schemes for various test images and different codebook sizes. The proposed information hiding scheme can hide a huge amount of information in the index map of an image and allows complete reconstruction of the indexes of the image.     

基于压缩感知的SAR图像鲁棒编码传输

目的 尽管传统的联合信源信道编码方案可以获得高效的压缩性能,但当信道恶化超过信道编码的纠错能力时会导致解码端重构性能的急剧下降;为此利用压缩感知的民主性提出一种鲁棒的SAR图像编码传输方案,且采用了一系列方法提高该方案的率失真性能。方法 考虑到SAR图像丰富的边缘信息,采用具有更强方向表示能力的方向提升小波变换(DLWT)对SAR图像进行稀疏表示,且为消除压缩感知中恢复非稀疏信号时存在的混叠效应,采用了稀疏滤波方法保证大系数的精确恢复,在解码端采用了高效的Bayesian重建算法获得图像的高性能重建。结果 在同等码率下,与传统的联合信源信道编码方案CCSDS-RS相比,本文方案可以实现更加鲁棒的编码传输,当丢包率达到0.05时,本文方案DSFB-CS获得的重建性能明显要高于CCSDS-RS;与基于Bayesian重建算法TSW-CS的传统方案相比,本文方案可提高峰值信噪比(PSNR)3.9 dB。结论 本文方案DSFB-CS 实现了SAR图像的鲁棒传输,随着丢包率的上升,DSFB-CS获得的重建性能缓慢下降,保证了面对不稳定信道时,解码端可以获得相对稳定的重构图像。     

多尺度图割曲面重建算法

针对图割曲面重建算法计算量过大的难题, 根据代数多栅理论对图割计算过程进行多尺度分解, 仅对最后一级进行最大流计算, 其他级的标记值通过插值得到。首先, 根据点云法向和重建曲面法向的一致性构建能量函数; 其次, 将能量函数映射到三维权重图的顶点和边上; 然后, 定义顶点间的一致性并由此构造抽取矩阵, 以决定哪些图的顶点参与图割运算; 之后, 构造插值矩阵, 将最后一级图割计算结果逐级插值到第一级; 最后, 利用步进立方体算法得到重建曲面的三角网格表示。实验结果表明, 与窄带图割算法相比, 本方法计算速度更快, 当图的顶点数越多时速度提高得越多; 对于不均匀采样的点云数据, 重建效果更好; 其他情况下两者效果相当。