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.     

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.     

Reducing the complexity of distance measurement methods for circular turbo codes that use structured interleavers

The knowledge of turbo code's minimum Hamming distance (d_min) and its corresponding codeword multiplicity (A_min) is of a great importance because the error correction capability of a code is strongly tied to the values of d_min and A_min. Unfortunately, the computational complexity associated with the search for d_min and A_min can be very high, especially for a turbo code that has high d_min value. This paper introduces some useful properties of turbo codes that use structured interleavers together with circular encoding. These properties allow for a significant reduction of search space and thus reduce significantly the computational complexity associated with the determination of d_min and A_min values. © 2014 The Authors. International Journal of Communication Systems published by John Wiley & Sons, Ltd.     

Graph-based video fingerprinting using double optimal projection

A double optimal projection method that involves projections for intra-cluster and inter-cluster dimensionality reduction are proposed for video fingerprinting. The video is initially set as a graph with frames as its vertices in a high-dimensional space. A similarity measure that can compute the weights of the edges is then proposed. Subsequently, the video frames are partitioned into different clusters based on the graph model. Double optimal projection is used to explore the optimal mapping points in a low-dimensional space to reduce the video dimensions. The statistics and geometrical fingerprints are generated to determine whether a query video is copied from one of the videos in the database. During matching, the video can be roughly matched by utilizing the statistics fingerprint. Further matching is thereafter performed in the corresponding group using geometrical fingerprints. Experimental results show the good performance of the proposed video fingerprinting method in robustness and discrimination.     

WCDMA系统接口信令消息的描述与实现

WCDMA作为第三代移动通信系统的主流标准，能够提供多种类型的多媒体服务。为了实现各种用户平面数据的传输，系统会提前通过控制平面对所需的无线资源进行分配。由于配置过程是通过接口之间发送控制平面应用协议消息来实现的，因此能否正确有效地对信令消息进行编解码成为保证系统稳定工作的关键因素。3GPP标准中，ASN．1语言被用来描述接口信令消息。首先简要介绍了WCDMA系统结构以及主要接口协议，重点描述了ASN．1存在的意义及其编解码规则，最后给出了基于ASN．1的开发环境下应用层网络协议的开发流程。     

光折变三维信息存储器

分析光折变三维存储器的机理,探讨了光折变三维存储器的编码方式、光折变材料的选择及存储技术,阐述了其产业化进程.     

Threshold‐Based Camera Motion Characterization of MPEG Video

We propose an efficient scheme for camera motion characterization in MPEG‐compressed video. The proposed scheme detects six types of basic camera motions through threshold‐based qualitative interpretation, in which fixed thresholds are applied to motion model parameters estimated from MPEG motion vectors (MVs). The efficiency and robustness of the scheme are validated by the experiment with real compressed video sequences.     

运动估计块匹配两级搜索算法

根据视频图像相邻块在空间上具有很大的相关性,吸收了矢量预测块匹配的核心思想,提出一种两级块匹配运动估计算法,在第一级中,首先根据矢量预测确定一个小区域,然后在此区域内进行快速搜索,如果在第一级中没有搜索到匹配块则进行第二级搜索,该算法可大大提高搜索速度.     

网格技术在广播电视中的应用

网格是继Internet和Web技术之后的第三个信息技术浪潮。简述了网格的定义、特点和基本体系结构 ,并且分析了网格技术在广播电视中的应用     

产生特殊聚焦图形的二元光学元件

通过面积编码将伽博（Gabor)波带片的透过率函数的余弦分布等效为二元分布，研制了能产生各种特殊聚焦图形的二元光学元件。根据透镜聚焦的物理原理制作的二元振幅型波带片可以方便地产生多种聚焦线，给出了相应的实验结果，并讨论了改善聚焦效果的优化条件。