Watermarking of uncompressed and compressed video

Recognizing the mannerism ways to get this books computer organization and design the hardware software interface 4th fourth edition by patterson hennessy is additionally useful. You have remained in right site to begin getting this info. acquire the computer organization and design the hardware software interface 4th fourth edition by patterson hennessy join that we manage to pay for here and check out the link.

[서평]「Computer Organization and Design, The Hardware/Software Interface」

Throughout this article, we concentrate on the transcoding of block-based video coding schemes that use hybrid discrete cosine transform (DCT) and motion compensation (MC). In such schemes, the frames of the video sequence are divided into macroblocks (MBs), where each MB typically consists of a luminance block (e.g., of size 16 /spl times/ 16, or alternatively, four 8 /spl times/ 8 blocks) along with corresponding chrominance blocks (e.g., 8 /spl times/ 8 Cb and 8 /spl times/ 8 Cr). This article emphasizes the processing that is done on the luminance components of the video. In general, the chrominance components can be handled similarly and will not be discussed in this article. We first provide an overview of the techniques used for bit-rate reduction and the corresponding architectures that have been proposed. Then, we describe the advances regarding spatial and temporal resolution reduction techniques and architectures. Additionally, an overview of error resilient transcoding is also provided, as well as a discussion of scalable coding techniques and how they relate to video transcoding. Finally, the article ends with concluding remarks, including pointers to other works on video transcoding that have not been covered in this article, as well as some future directions.

Video transcoding architectures and techniques: an overview

A method for delivering media content over a network includes transcoding the media content to generate multiple copies of the media content, each of the multiple copies having a different destination type or a different source type or both, storing the multiple copies in a cache, receiving requests for the media content, and selecting and delivering a copy of one of the multiple copies in response to each of the requests. A further method for providing media content transcoding services includes fetching media content, selecting one of multiple transcoders for transcoding from multiple source types to multiple destination types, wherein the one transcoder is selected based at least on the destination type, sending the media content to the selected transcoder, transcoding the media content to the destination type, thereby generating transcoded media content, and transmitting the transcoded media content.

Distributed on-demand media transcoding system and method

A system for dynamically transcoding data transmitted between computers is implemented in an apparatus for use in transmitting data between a network server (10) and a network client (12) over a communications link (14). The apparatus includes a parser (22) coupled to a transcode service provider (24). The parser (22) is configured to selectively invoke the transcode service provider (24) in response to a predetermined selection criterion.

System for dynamically transcoding data transmitted between computers

Many of the forthcoming video services and multimedia applications are expected to use preencoded video for storage and transmission. Video transcoding is intended to provide transmission flexibility to preencoded bit streams by dynamically adjusting the bit rate of these bit streams according to new bandwidth constraints that were unknown at the time of encoding. In this paper, we propose a drift-free MPEG-2 video transcoder, working entirely in the frequency domain. The various modes of motion compensation (MC) defined in MPEG-2 are implemented in the discrete cosine transform (DCT) domain at reduced computational complexity. By using approximate matrices to compute the MC-DCT blocks, we show that computational complexity can be reduced by 81% compared with the pixel domain approach. Moreover, by using a Lagrangian rate-distortion optimization for bit reallocation, we show that optimal transcoding of high-quality bit streams can produce better picture quality than that obtained by directly encoding the uncompressed video at the same bit rates using a nonoptimized Test Model 5 (TM5) encoder.

/pdf/a-frequency-domain-video-transcoder-for-dynamic-bit-rate-2jmxof2rrp.pdf

A frequency-domain video transcoder for dynamic bit-rate reduction of MPEG-2 bit streams

This paper presents a performance evaluation study of coding efficiency versus computational complexity for the forthcoming High Efficiency Video Coding (HEVC) standard. A thorough experimental investigation was carried out to identify the tools that most affect the encoding efficiency and computational complexity of the HEVC encoder. A set of 16 different encoding configurations was created to investigate the impact of each tool, varying the encoding parameter set and comparing the results with a baseline encoder. This paper shows that, even though the computational complexity increases monotonically from the baseline to the most complex configuration, the encoding efficiency saturates at some point. Moreover, the results of this paper provide relevant information for implementation of complexity-constrained encoders by taking into account the tradeoff between complexity and coding efficiency. It is shown that low-complexity encoding configurations, defined by careful selection of coding tools, achieve coding efficiency comparable to that of high-complexity configurations.

Performance and Computational Complexity Assessment of High-Efficiency Video Encoders

The High Efficiency Video Coding standard provides improved compression ratio in comparison with its predecessors at the cost of large increases in the encoding computational complexity. An important share of this increase is due to the new flexible partitioning structures, namely the coding trees, the prediction units, and the residual quadtrees, with the best configurations decided through an exhaustive rate-distortion optimization (RDO) process. In this paper, we propose a set of procedures for deciding whether the partition structure optimization algorithm should be terminated early or run to the end of an exhaustive search for the best configuration. The proposed schemes are based on decision trees obtained through data mining techniques. By extracting intermediate data, such as encoding variables from a training set of video sequences, three sets of decision trees are built and implemented to avoid running the RDO algorithm to its full extent. When separately implemented, these schemes achieve average computational complexity reductions (CCRs) of up to 50% at a negligible cost of 0.56% in terms of Bjontegaard Delta (BD) rate increase. When the schemes are jointly implemented, an average CCR of up to 65% is achieved, with a small BD-rate increase of 1.36%. Extensive experiments and comparisons with similar works demonstrate that the proposed early termination schemes achieve the best rate-distortion-complexity tradeoffs among all the compared works.

Fast HEVC Encoding Decisions Using Data Mining

The emerging High Efficiency Video Coding (HEVC) standard is expected to require much more processing power than its predecessors due to the higher algorithmic complexity of new coding tools and associated data structures. This paper proposes a novel complexity control method for the near future HEVC encoders running on power-constrained devices. The proposed method is based on a decision algorithm that dynamically adjusts the depth of the Coding Units (CU) defined by quad-tree structures. New evidence about the relationship between CU depth and coding complexity is used to selectively constrain the CU depth in order to not exceed a predefined complexity target. The experimental results show that the encoder computational complexity can be downscaled by up to 60% at the cost of negligible loss of rate-distortion (RD) performance. The proposed method finds application in the near future multimedia portable devices using HEVC codecs.

Complexity control of high efficiency video encoders for power-constrained devices

Digital light fields are obtained by sampling of huge number of light rays, capturing the colour intensity of a whole visual scene from different view angles. The large amount of data that is necessary to represent a light field requires highly efficient compression methods to store and exchange such type of signals. This paper presents a light field coding scheme based on a low-complexity preprocessing approach that generates a pseudo-video sequence suitable for standard compression using HEVC. The efficiency of the proposed scheme is evaluated using a data set of twelve light field images and low-delay B HEVC coding configuration. The R-D performance obtained by the proposed scheme is consistently better than JPEG, revealing significantly higher gains, particularly for higher compression ratios.

Pedro Assuncao

Papers

A frequency-domain video transcoder for dynamic bit-rate reduction of MPEG-2 bit streams

Performance and Computational Complexity Assessment of High-Efficiency Video Encoders

Fast HEVC Encoding Decisions Using Data Mining

Complexity control of high efficiency video encoders for power-constrained devices

High efficiency coding of light field images based on tiling and pseudo-temporal data arrangement