The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Intra prediction coding is mainly to eliminate the correlation of the spatial domain. Firstly the article introduces the traditional intra prediction algorithm. And then according to the correlation between the most likely patterns and best mode, It draws a pattern matrix. By the advantage of this mode matrix for early termination, it can improve the efficiency of intra prediction 9%–15% in the condition...
The paper presents a systematic approach to synthesizing and implementing fast algorithms for computing the DCT of a power-of-two size. The main features of the obtainable algorithms are regularity of their signal flow graphs and low arithmetic complexity. Multiplierless implementation of the algorithms is based on the algebraic integer (AI) technique. A general AI encoding scheme for fast DCT algorithms...
Fractal image coding method is a novel compression method, in which the local self-similarity of the image is used to eliminate cross-scale redundancy existing in image data. It receives wide academic attention with its innovative idea, high compression ratio, high decoding speed, independent resolution etc. however, for the encoding time and quality of decoding needs to be improved, there have been...
An algorithm is proposed based on multiple choice of video watermarking scheme, watermark information is embedded in the video file at the video encoding stage. The scheme implements three main functions, including an optional multi-algorithm, embedded in the proportion of adjustable and extract frame number can set. We development a video watermarking system under the program design, experimental...
In Mode-Dependent Directional Transform (MDDT), Karhunen¨CLo¨¨ve Transform (KLT) was employed to better compress the directional edges of intra prediction residues. The transform bases of MDDT were derived from the Singular Value Decomposition (SVD) of the intra prediction residues with the diversity of video characteristics. MDDT was mode dependent, but not video content dependent. It was expected...
Recent advances in video capturing and display technologies, along with the exponentially increasing demand of video services, challenge the video coding research community to design new algorithms able to significantly improve the compression performance of the current H.264/AVC standard. This target is currently gaining evidence with the standardization activities in the High Efficiency Video Coding...
An intra-only video coding algorithm based on a so called node-cell pixel coding structure has been proposed for high definition video by the authors. This novel coding structure divides pixels within one macro-block into node and cell pixels. The node pixels are first encoded using DCT, quantization, and entropy coding. The cell pixels are then interpolated using the reconstructed node pixels, and...
In this paper, we propose a new structure for the transform domain Wyner Ziv coding to achieve fast and light-weight encoding of standard-definition (SD) video. The proposed scheme divides each picture into multiple tiles which do not have computational dependencies between each other in order to facilitate parallelization. The proposed parallelized encoder is implemented using OpenMP API. In addition,...
Trajectory basis Non-Rigid Structure From Motion (NRSFM) currently faces two problems: the limit of reconstructability and the need to tune the basis size for different sequences. This paper provides a novel theoretical bound on 3D reconstruction error, arguing that the existing definition of reconstructability is fundamentally flawed in that it fails to consider system condition. This insight motivates...
The transform used in most image and video coding standards is the separable 2-D discrete cosine transform (DCT), which has been proven to be a robust approximation of the optimal Karhunen-Loève transform (KLT) for the 1st-order Markov sources with a large correlation coefficient. However, such separable 2-D DCT surely is not the best choice when it is applied on some residual or directional signals...
In depth map coding for 3D video coding systems, coding errors in edges can severely affect the synthesis quality. Edge errors mainly compose of two parts: one is blurring and ringing artifact around sharp edge and the other is fake edge caused by blocking artifact. In this paper, we propose an adaptive depth map filter to remove blocking artifacts while preserving depth edges. The proposed filter...
In this study, a new adaptive post-filtering algorithm is proposed to remove observed blocking artifacts as a result of discrete cosine transform (DCT) based image and video compression standarts at low bit rates. With identification of blocking artifact strength, fuzzy filter is applied by adjusting filtering range and its parameters. Experimental results showed that, the proposed algorithm exhibits...
On the basis of a non-local means denosing process, a novel progressive side information refinement framework for a transform domain Wyner-Ziv video codec is proposed, where the side information is progressively improved, as the decoding proceeds, by exploring both temporal-spatial similarities and already decoded DCT bands. Simulation results show up to 2.5dB in RD performance gain against that of...
Video broadcasting is a popular application of wireless network. However, the existing layered approaches can hardly accommodate users with diverse channel conditions as analog communication can do. The newly emerged `soft cast' approach, utilizing soft broadcast, provides smooth multicast performance but is not very efficient in inter frame compression. In this work, we propose a motion-aligned wireless...
We introduce a dynamically reconfigurable DCT architecture system that allows us to select optimal implementations based on bitrate and dynamic power constraints. For our approach, we first compute Pareto-optimal hardware realizations that are assessed in terms of reconstructed image quality, bitrate and dynamic power. The space of Paretooptimal realizations are generated by varying both the number...
In this paper, an improved video tampering detection model based on MPEG double compression is proposed. Double compression will import disturbance into Discrete Cosine Transform (DCT) coefficients, reflecting in the violation of the parametric logarithmic law for first digit distribution of quantized Alternating Current (AC) coefficients. A 12-D feature can be extracted from each group of pictures...
In video coding, motion compensation prediction residuals are typically compressed by applying two-dimensional transforms such as the two-dimensional discrete cosine transform (2D-DCT). Using direction-adaptive one-dimensional discrete cosine transforms (1D-DCTs) can provide significant additional bitrate savings. However, this requires optimization over all available transforms to minimize the overall...
This paper focuses on prediction optimality in spatially scalable video coding. It is inspired by the earlier estimation-theoretic prediction framework developed by our group for quality (SNR) scalability, which achieved optimality by fully accounting for relevant information from the current base layer (e.g., quantization intervals) and the enhancement layer, to efficiently calculate the conditional...
In this paper a graph-based transform is proposed as an alternative to the discrete cosine transform. An image or video signal is represented as a graph signal, where the graph is generated so as not to cross an image edge in a local region, i.e., square block. Then, spectral representation of graph signal is used to form transform kernels by finding eigenvectors of Laplacian matrix of the graph....
Discrete cosine transform (DCT) is known as efficient frequency transform, and when it is implemented on software/hardware, multiplier is undesirable for faster implementation. This paper presents a realization of multiplierless fast DCT for lossy image/video coding on arbitrary devices. First, the proposed DCT is constructed by using fast Hartley transform (FHT). Next, the redundancy of the structure...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.