Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

A signal adaptive diffusion filter for video coding: Mathematical framework and complexity reductions

In this paper we combine video compression and modern image processing methods. We construct novel iterative filter methods for prediction signals based on Partial Differential Equation (PDE) based methods. The mathematical framework of the employed diffusion filter class is given and some desirable properties are stated. In particular, two types of diffusion filters are constructed: a uniform diffusion filter using a fixed filter mask and a signal adaptive diffusion filter that incorporates the structures of the underlying prediction signal. The latter has the advantage of not attenuating existing edges while the uniform filter is less complex. The filters are embedded into a software based on HEVC with additional QTBT (Quadtree plus Binary Tree) and MTT (Multi-Type-Tree) block structure. In this setting, several measures to reduce the coding complexity of the tool are introduced, discussed and tested thoroughly. The coding complexity is reduced by up to 70% while maintaining over 80% of the gain. Overall, the diffusion filter method achieves average bitrate savings of 2.27% for Random Access having an average encoder runtime complexity of 119% and 117% decoder runtime complexity. For individual test sequences, results of 7.36% for Random Access are accomplished.     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

嵌入式盲文单手输入系统设计与实现

计算机录入编辑盲文是信息处理的特殊应用领域，是特殊教育中的重要研究课题。文中将盲文制作为特殊符号，通过制作字库，编写个性化码表，然后嵌入到主流输入法，从而实现盲文与汉字混排以及实现单手盲文输入。该系统具有易学易记性、盲文编码多样性、嵌入性强等优点，并通过实验证明输入盲文效率能提高5~6倍，在盲文出版、盲文印刷、盲文教学等领域有重要的应用价值。但盲文字符在不同平台(如智能手机)与不同操作系统兼容性问题还有待进一步研究开发。     

激光脉冲编码抗有源干扰效果研究

激光脉冲编码是激光制导武器的抗干扰措施之一。角度欺骗式干扰和高重频干扰是目前半主动激光制导武器的主要有源干扰来源。为研究不同激光脉冲编码方式对激光半主动制导武器抗这两种干扰性能的影响,本文针对敌方激光告警机的识别算法与我方导引头的解码过程,提出自相关函数与归一化互相关函数评价方法,并对目前主要编码方式进行仿真,仿真结果表明:激光脉冲编码的抗角度欺骗式干扰能力受编码序列周期性与脉冲间隔随机性的影响；抗高重频激光干扰能力受编码序列脉冲间隔随机性的影响；LFSR状态码的抗角度欺骗式干扰与抗高重频干扰效果均优于其他编码方式。     

基于密集神经网络的灰度图像着色算法

针对在灰度图像着色领域中，传统算法信息提取率不高、着色效果不理想的问题，提出了基于密集神经网络的灰度图像着色算法，以实现改善着色效果，让人眼更好地观察图片信息的目的。利用密集神经网络的信息提取高效性，构建并训练了一个端到端的深度学习模型，对图像中的各类信息及特征进行提取。训练网络时与原图像进行对比，以逐渐减小网络输出结果的信息、分类等各类型的损失。训练完成后，只需向网络输入一张灰度图片，即可生成一张颜色饱满、鲜明逼真的彩色图片。实验结果表明，引入密集网络后，可有效改善着色过程中的漏色、细节信息损失、对比度低等问题，所提算法着色效果较基于VGG网络及U-Net、双流网络结构、残差网络（ResNet）等性能优异的先进着色算法而言取得了显著的改进。     

基于CVSD编码的无线语音系统方案的设计

简要介绍了连续可变斜率增量(CVSD)调制的原理。与目前应用较为广泛的其它语音编码方式相比较,CVSD拥有更优的数字特性。着重介绍了由CML公司研制开发的基于CVSD的语音编码芯片———CMX649的特点及相关的应用方式。CMX649能够成功地应用在广泛的语音编码系统中,尤其适合无线语音系统应用。在此基础上,给出了一种实用性很强的低成本、低功耗无线语音系统的设计与应用方案。该方案可提供清晰可靠的语音传输,可广泛应用于农村地区,具有广阔的市场空间。     

一种改进的新三步搜索算法

在对三步法工作原理进行研究的基础上提出了新三步搜索算法（NITSS）。该方法充分利用视频序列运动矢量概率分布上的中心偏置特性．在三步搜索算法的基础上引入了十字型分布的4个点构成搜索点群。实验结果表明。新三步搜索算法解决了三步法的小运动估计效果较差问题．提高了搜索精度，保持了三步法的高效率。     

基于循环前缀的单载波直接序列扩频技术(CP/CDMA)

介绍了下行链路中基于循环前缀的单载波直接序列扩频技术(CP/CDMA)。这种技术结合了多载波系统中的循环前缀和频域均衡,具有较低的复杂度。同时保留了单载波系统发射端复杂度低的优点。在时变信道中,利用基于辅助数据的信道估计方法,即每隔一定帧数的数据帧发送一帧训练序列来估计信道。在仿真中使用了信道编码。