The MPEG video compression algorithm

Gall, D.J. Le

doi:10.1016/0923-5965(92)90019-c

Cited by 115 publications

(44 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…DCT is widely used in many practical image/video compression systems because of its compression performance and computational efficiency. DCT has been successfully selected as the first step in many coding systems, such as JPEG (Pennebake and Mitchell, 1993), MPEG (Le Gall, 1992), and H.26x (ITU Recommendation H.26,1 1993;ITU Telecom, 1998) due to its good properties of energy distribution in the frequency domain.…”

Section: Discrete Cosine Transformmentioning

confidence: 99%

Medical images compression for remote diagnosis using modified SPIHT data organization and fidelity enhancement filter

Chen

2007

Int J Imaging Syst Tech

View full text Add to dashboard Cite

In this work, an 8 3 8 Discrete Cosine Transform (DCT) approach is adopted to perform DCT shrinkage, followed by modified set partitioning in hierarchical trees (SPIHT) data organization and fidelity enhancement filter for reducing the memory required to store a remote diagnosis and rapidly transmit it. The DCT shrinkage has the ability to retain the detailed characteristics of an image. By means of a simple transformation to gather the DCT spectrum data with the same frequency domain, the DCT shrinkage exploits all the characteristics of individual blocks to a global framework. In this scheme, insignificant DCT coefficients that correspond to the same spatial location in the high-frequency sub-bands can be used to reduce the redundancy by a combined function proposed in association with the modified SPIHT. Meanwhile, quad-tree decomposition and a set of morphological filters for reducing the artifacts are presented. This set of filters employs 8 predefined morphological operations, namely 4 structuring elements (SE), each of which includes both dilation and erosion operations. The voting strategy is used to select the most suitable morphological filter for each block. Simulation results show that the image compression reduced the computational complexity to only a half of the wavelet based sub-band decomposition and improved the quality of the reconstructed medical image in terms of both the peak signal-to-noise ratio (PSNR) and the perceptual results close to JPEG2000 and the original SPIHT at the same bit rate.

show abstract

Section: Discrete Cosine Transformmentioning

confidence: 99%

Medical images compression for remote diagnosis using modified SPIHT data organization and fidelity enhancement filter

Chen

2007

Int J Imaging Syst Tech

View full text Add to dashboard Cite

show abstract

“…Therefore, it achieves a good allocation of the bandwidth between DFD and motion parameters, and in this respect outperfonns the gradient and pel-recursive techniques. Furthennore, in the current standards MPEG-l [3 1], [32], MPEG-2 [33], [34], and H.261 [35] which are based on a DCT transfonn coding, block matching motion estimation techniques are clearly the most appropriate. Although it is clear that different results would be ob tained when using different gradient, pel-recursive and block matching algorithms, the above comments are gen erally true of these three groups of motion estimation techniques.…”

Section: Comparison Between Gradient Pel-recursive and Block Matcmentioning

confidence: 99%

“…For these reasons, block matching motion estimation techniques are the most widely used in image sequence coding. Recent standards such as MPEG-l [31], [32], MPEG-2 [33], [34], and H.261 [35] are based on them, even though the algorithm to estimate the motion vectors is not specifi ed explicitly.…”

Section: Block Ma Tching Techniquesmentioning

confidence: 99%

“…For instance, the current standards MPEG-I [31], [32], MPEG-2 [33], [34], and H.261 [35] are based on transform coding in which the image is partitioned into small blocks which are then coded separately. In this context, motion estimation techniques that work on a pel-by-pel or block-by-block basis are the most suitable.…”

Section: B Motion Models and Support Fo R The Motion Estimationmentioning

confidence: 99%

“…As far as the DFD is concerned and assuming an entropy coding, its coding cost is given by its entropy. [33], [34], and H.261 [35].…”

Section: (Is)mentioning

confidence: 99%

See 2 more Smart Citations

Motion estimation techniques for digital TV: a review and a new contribution

1995

View full text Add to dashboard Cite

The key to high performance in image sequence coding lies in an efficient reduction of the temporal redundancies. For this purpose, motion estimation and compensation techniques have been suc cessfully applied. This paper studies motion estimation algorithms in the context of fi rst generation coding techniques commonly used in digital TV. In this framework, estimating the motion in the scene is not an intrinsic goal. Motion estimation should indeed provide good temporal prediction and simultaneously require low overhead information. More specifically, the aim is to minimize globally the bandwidth corresponding to both the prediction error information and the motion parameters. This paper first clarifies the notion of motion, reviews classical motion estimation tech niques, and outlines new perspectives. Block matching techniques are shown to be the most appropriate in the framework of first generation coding. To overcome the drawbacks characteristic of most block matching techniques, this paper proposes a new locally adaptive multigrid block matching motion estimation technique.This algorithm has been designed taking into account the above aims. It leads to a robust motion field estimation, precise prediction along moving edges and a decreased amount of side information in uniform areas. Furthermore, the algorithm controls the accuracy of the motion estimation procedure in order to optimally balance the amount of information corresponding to the prediction error and to the motion parameters. Experimental results show that the technique results in greatly enhanced visual quality and significant saving in terms of bit rate when compared to classical block matching techniques.

show abstract