This paper focus on the development of a optimization tool in which uncertainties are taken into account to obtain robust and reliable designs. The robustness measures considered here are the expected value and standard deviation of the function involved in the optimization problem. To calculate such quantities, we employ two non-intrusives uncertainty propagation analysis techniques that explo...

In H.264/AVC video encoding, rate-distortion optimization for mode selection plays a significant role to achieve outstanding performance in compression efficiency and video quality. However, this mode selection process also makes the encoding process extremely complex, especially in the computation of the ratedistortion cost function, which includes the computations of the sum of squared differ...

The primary advantage of the H.264 video compression technique is the ability to provide good video quality at substantially lower bit rates compared with other video compression methods. This is due to the use of variable block sizes, multiple reference frames, and the consideration of Rate-Distortion Optimization (RDO). However, these features come with the price of added complexity due to th...

A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes trivial. Ordering constraints are well-known to be reducible to a disjunction of solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Surprisingly, it turns out that this is no longer the case...

This paper presents a revised rate control scheme based on an improved frame complexity measure. Rate control adopted by both MPEG-4 VM18 and H.264/AVC use a quadratic rate-distortion (R-D) model that determines quantization parameters (QPs). Classical quadratic R-D model is suitable for MPEG-4 but it performs poorly for H.264/AVC because one of the important parameters, mean absolute differenc...

A usual technique in symbolic constraint solving is to apply transformation rules until a solved form is reached for which the problem becomes simple. Ordering constraints are well-known to be reducible to (a disjunction of) solved forms, but unfortunately no polynomial algorithm deciding the satissability of these solved forms is known. Here we deal with a diierent notion of solved form, where...

As a key technique in network multimedia signal processing, video transcoding becomes a hot topic in recent years. This paper presents a fast intra mode decision scheme for down-sizing video transcoding in H.264 based on hybrid characteristic of multi-scale videos. In order to reduce the high computational complexity of using conventional intra prediction in the H.264 re-encoder, the proposed s...

The up-to-date video coding standardH.264/AVC could achieve higher encoding performance compared with previous versions since it employs many tools to increase the coding accuracy, particularly the rate-distortion optimization technique for mode decision. However, an extremely high computational complexity isproduced because all possible combinations of modes are calculated in order to find the...

Scalable video coding (SVC) has become more and more important with the enrichment of multimedia data and the diversification of network and terminal devices. In current MPEG SVC activities, a scalable extension of H.264/AVC, called scalable video model (SVM), is proposed by HHI and has shown further coding efficiency improvement and scalability functionality. However, the SVM model doesn’t pro...