1 November 1992 Video compression using lapped transforms for motion estimation/compensation and coding
Author Affiliations +
Proceedings Volume 1818, Visual Communications and Image Processing '92; (1992) https://doi.org/10.1117/12.131445
Event: Applications in Optical Science and Engineering, 1992, Boston, MA, United States
Many conventional video coding schemes, such as the CCITT H.261 recommendation, are based on the independent processing of non-overlapping image blocks. An important disadvantage with this approach is that blocking artifacts may be visible in the decoded frames. In this paper, we propose a coding scheme based entirely on the processing of overlapping, windowed data blocks, thus eliminating blocking effects. Motion estimation and compensation are both performed in the frequency domain using a complex lapped transform (CLT), which may be viewed as a complex extension of the lapped orthogonal transform (LOT). The motion compensation algorithm is equivalent to overlapped compensation in the spatial domain, but also allows image interpolation for sub-pel displacements and sophisticated loop filters to be conveniently applied in the frequency domain. For inter- and intra-frame coding, we define the modified fast lapped transform (MFLT). This is a modified form of the LOT, which entirely eliminates blocking artifacts in the reconstructed data. The transform is applied in a hierarchical structure, and performs better than the discrete cosine transform (DCT) for both coding modes. The proposed coder is compared with the H.261 scheme, and is found to have significantly improved performance.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Robert W. Young and Nick G. Kingsbury "Video compression using lapped transforms for motion estimation/compensation and coding", Proc. SPIE 1818, Visual Communications and Image Processing '92, (1 November 1992); doi: 10.1117/12.131445; https://doi.org/10.1117/12.131445

Back to Top