Low-complexity video coding via power-rate-distortion optimization

Wireless multimedia sensor networks (WMSNs) have been potentially applicable for several emerging applications. The resources, i.e., power and bandwidth available to visual sensors in a WMSN are, however, very limited. Hence, it is important but challenging to achieve efficient resource allocation and optimal video data compression while maximizing the overall network lifetime. In this paper, a power-rate-distortion (PRD) optimized resource-scalable low-complexity multiview video encoding scheme is proposed. In our video encoder, both the temporal and interview information can be exploited based on the comparisons of extracted media hashes without performing motion and disparity estimations, which are known to be time-consuming. We present a PRD model to characterize the relationship between the available resources and the RD performance of our encoder. More specifically, an RD function in terms of the percentages for different coding modes of blocks and the target bit rate under the available resource constraints is derived for optimal coding mode decision. The major goal here is to design a PRD model to optimize a “motion estimation-free” low-complexity video encoder for applications with resource-limited devices, instead of designing a general-purpose video codec to compete compression performance against current compression standards (e.g., H.264/AVC). Analytic results verify the accuracy of our PRD model, which can provide a theoretical guideline for performance optimization under limited resource constraints. Simulation results on joint RD performance and power consumption (measured in terms of encoding time) demonstrate the applicability of our video coding scheme for WMSNs.     

Achieving inter-session fairness for layered video multicast

The Internet is increasingly used to deliver multimedia services. Since there are heterogeneous receivers and changing network conditions, it has been proposed to use adaptive rate control techniques such as layered video multicast to adjust the video traffic according to the available Internet resources. A problem of layered video multicast is that it is unable to provide fair bandwidth sharing between competing video sessions. We propose two schemes, layered video multicast with congestion sensitivity and adaptive join-timer (LVMCA) and layered video multicast with priority dropping (LVMPD), to achieve inter-session fairness for layered video multicast. Receiver-driven layered multicast (RLM), layer-based congestion sensitivity, LVMCA, and LVMPD are simulated and compared. Results show both proposed schemes, especially LVMPD, are fairer and have shorter convergence time than the other two schemes.     

Low-complexity video coding based on two-dimensional singular value decomposition

In this paper, we propose a low-complexity video coding scheme based upon 2-D singular value decomposition (2-D SVD), which exploits basic temporal correlation in visual signals without resorting to motion estimation (ME). By exploring the energy compaction property of 2-D SVD coefficient matrices, high coding efficiency is achieved. The proposed scheme is for the better compromise of computational complexity and temporal redundancy reduction, i.e., compared with the existing video coding methods. In addition, the problems caused by frame decoding dependence in hybrid video coding, such as unavailability of random access, are avoided. The comparison of the proposed 2-D SVD coding scheme with the existing relevant non-ME-based low-complexity codecs shows its advantages and potential in applications.     

Robust video multicast with joint network coding and video interleaving

In this work, we propose a cross-layer solution to robust video multicast in erasure networks based on random linear network coding (RLNC) in the network layer and video interleaving (VI) in the application layer, and call it the joint RLNC-VI scheme. In the RLNC implementation, we partition one video coding unit (VCU) into several priority levels using scalable properties of H.264/SVC video. Packets from the same priority level of several VCUs form one RLNC generation, and unequal protection is applied to different generations. RLNC provides redundancy for video packets in the network layer and has proved to be useful in a multicast environment. Then, we propose a new packet-level interleaving scheme, called the RLNC-facilitated interleaving scheme, where each received packet corresponds to a new constraint on source packets. As a result, it can facilitate the RLNC decoding at the destination node. Furthermore, we study the problem of optimal interleaving design, which selects the optimal interleaving degree and the optimal redundancy of each generation. The tradeoff between delay and received video quality due to the choice of different VCUs is also examined. It is shown by simulation results that the proposed RLNC-VI scheme outperforms the pure RLNC method for robust video multicast in erasure networks. This can be explained by two reasons. First, the VI scheme distributes the impact of the loss (or erasure) of one VCU into partial data loss over multiple neighboring VCUs. Second, the original video content can be easily recovered with spatial/temporal error concealment (EC) in the joint RLNC-VI scheme.     

A layered coding system for very low bit rate video coding

Known coding techniques for transmitting moving images at very low bit rates are explained by the source models on which these coding techniques are based. It is shown that with motion-compensated hybrid coding, object-based analysis-synthesis coding, knowledge-based coding and semantic coding, there is a consistent development of source models. In consequence these coding techniques can be combined in a layered coding system. From experimental results obtained for object-based analysis-synthesis, coding estimates for the coding efficiency of such a layered coding system are derived using head and shoulder video telephone test sequences. It is shown that an additional compression factor of about 3 can be expected with such a complex layered coding system, when compared to block-based hybrid coding.     

Optimized layered multicast with superposition coding in cellular systems

We consider the problem of optimal power allocation and optimal user selection in a layered multicast transmission over quasi‐static Rayleigh fading channels. A scheme based on superposition coding is proposed in which basic multicast streams and enhanced multicast streams are superimposed and transmitted by a base station, while users with worse channel conditions can only decode basic multicast streams, and users with better channel conditions can decode both basic and enhanced multicast streams. In this paper, subject to fixed user selection ratios, the optimal power allocation for each stream that maximizes average throughput is investigated, and the impact of power allocation on average outage probability is discussed. Finally, subject to fixed transmit power and power allocation, the optimal user selection ratio for enhanced multicast streams is also studied. Numerical results show that the optimized layered multicast scheme outperforms the conventional multicast scheme in terms of average throughput. Copyright © 2010 John Wiley & Sons, Ltd.     

一种基于主动代理的增强型分层多播算法——AELM

为一种典型的多速率视频多播算法,RLM 通过动态地加入和退出一定的多播组来实现对网络的拥塞控制。然而,RLM 算法存在要求用户协同工作、反应时间长以及对路由表项容量要求高的问题。本文通过引入主动代理反馈机制以及历史相关决策因子对其进行了改进,提出了一种基于主动代理的增强型分层多播算法——AELM。试验表明本文的算法能够解决 RLM 算法存在的问题。     

Low-complexity 8-point DCT approximation based on angle similarity for image and video coding

Multidimensional Systems and Signal Processing - The principal component analysis (PCA) is widely used for data decorrelation and dimensionality reduction. However, the use of PCA may be...     

A spatially layered hierarchical approach to video coding

Layered techniques offer attractive features for video coding in several applications including high definition TV (HDTV). After describing these in general, we propose an approach in which the layering is performed in the pel domain using a modified version of the conventional spatial pyramid technique. Comparisons are made with the alternative methods of subband coding and layering of DCT coefficients. Results with HDTV pictures were first demonstrated on 3 November 1992.     

Low-complexity sequential lossless coding for piecewise-stationarymemoryless sources

Three strongly sequential, lossless compression schemes, one with linearly growing per-letter computational complexity, and two with fixed per-letter complexity, are presented and analyzed for memoryless sources with abruptly changing statistics. The first method, which improves on Willems' (1994) weighting approach, asymptotically achieves a lower bound on the redundancy, and hence is optimal. The second scheme achieves redundancy of O(log N/N) when the transitions in the statistics are large, and O (log log N/log N) otherwise. The third approach always achieves redundancy of O (√log N/N). Obviously, the two fixed complexity approaches can be easily combined to achieve the better redundancy between the two. Simulation results support the analytical bounds derived for all the coding schemes     

Optimal joint rate and power allocation for layered multicast with superposition coding in cellular systems

We propose a layered multicast transmission scheme with superposition coding for cellular systems, i.e., at a base station a basic multicast stream (BMS) and an enhanced multicast stream (EMS) are superimposed and transmitted, the same BMS is repeatedly transmitted multiple times to ensure most users in the cell receive basic qualities of the service, while in each transmission different EMSs are transmitted to make the users with good channel conditions receive higher qualities of the service. In this paper, the optimal joint rate and power allocation for the layered multicast scheme is studied. Specifically, we first give a proof on the claim that the system delay of a BMS is minimized if the transmission rate of the BMS is set according to a fixed user selection ratio in each transmission. Then subject to fixed transmit power and power allocation, we derive the optimal transmission rate of a BMS that minimizes the system delay of the BMS, and the optimal transmission rate of an EMS that maximizes the average throughput of the EMS. Finally, by balancing the tradeoff between the system delay of a BMS and the average throughput of an EMS, we find the optimal joint rate and power allocation for the layered multicast scheme. Numerical results show that the optimized layered multicast scheme outperforms the conventional schemes in terms of the system delay of a BMS and the average throughput of an EMS.     

FLID-DL: congestion control for layered multicast

We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion control protocol (RLC) introduced by Vicisano et al. (Proc. IEEE INFOCOM, San Francisco, CA, , p.996-1003, Mar. 1998)ameliorating the problems associated with large Internet group management protocol (IGMP) leave latencies and abrupt rate increases. Like RLC, FLID-DL, is a scalable, receiver-driven congestion control mechanism in which receivers add layers at sender-initiated synchronization points and leave layers when they experience congestion. FLID-DL congestion control coexists with transmission control protocol (TCP) flows as well as other FLID-DL sessions and supports general rates on the different multicast layers. We demonstrate via simulations that our congestion control scheme exhibits better fairness properties and provides better throughput than previous methods. A key contribution that enables FLID-DL and may be useful elsewhere is dynamic layering (DL), which mitigates the negative impact of long IGMP leave latencies and eliminates the need for probe intervals present in RLC. We use DL to respond to congestion much faster than IGMP leave operations, which have proven to be a bottleneck in practice for prior work.     

Minimum coding nodes multicast tree for two-channel all-optical network coding scheme

A heuristic algorithm of establishing a minimum coding nodes multicast tree on which a two-channel all-optical network coding scheme can be performed is presented.To minimize the coding nodes,the heuri...     

视频编码预处理算法研究

针对现有降噪采用时空域滤波、去块效应采用环路滤波/后处理这种分而治之方案的缺点,通过分析降噪的基本技术、低码率视频应用中块效应产生的原因和去块效应的常用方法,从滤除不需要或相对不重要的高频离散余弦变换(DCT,discrete cosine transform)系数角度提出了降噪和去块效应可同时处理的设想。新提出的预处理算法是根据图像纹理特性、运动情况和码率约束等,在图像的不同区域采用不同强度的自适应双边滤波,这样不仅去噪,滤除不重要的细节以便于高效压缩,避免块效应的产生,同时也可起到一定程度的码率控制效果。     

基于网络控制的分层多点播送速率控制机制研究

本文在视频分层编码及分层传输协议的基础上，将基于网络控制与接收端控制机制相结合，提出一种新的分层多点播送速率控制机制。文中给出了该机制的拥塞检测、流行度权衡和数据层增加和丢弃算法。实验结果表明，该速率控制机制通史对拥塞做也快速响应，并在较好利用宽带的基础上保证高流行度的会话流具有较好的服务质量。     

Low-complexity 3D-DWT video encoder applicable to IPTV

3D-DWT encoders are good candidates for applications like professional video editing, IPTV video surveillance, live event IPTV broadcast, multispectral satellite imaging, HQ video delivery, etc., where a frame must be reconstructed as fast as possible. However, the main drawback of the algorithms that compute the 3D-DWT is the huge memory requirement in practical implementations. In this paper, and in order to considerably reduce the memory requirements of this kind of video encoders, we present a new 3D-DWT video encoder based on (a) the use of a novel frame-based 3D-DWT transform that avoids video sequence partitioning in Groups Of Pictures (GOP) and (b) a very fast run-length encoder. Furthermore, an exhaustive evaluation of the proposed encoder (3D-RLW) has been performed, analyzing the sensibility of the filters employed in the 3D-DWT transform and comparing the evaluation results with other video encoders in terms of R/D, coding/decoding delay and memory consumption.     

Absolute value coding for robust and scalable video coding

Absolute value coding is introduced as a method for significantly reducing temporal drift within a motion compensated predictive video codec in the presence of loss. Drift reduction both improves error resilience and enables scalability by omission of parts of the bit-stream. In conjunction with matching pursuits, the system can be used to provide a displaced frame difference codec using fixed length codewords, which further improves error resilience and facilitates simple bit-stream editing.