Fast interframe transform coding based on characteristics of transform coefficients and frame difference

The interframe transform coding has been seldom used in practice because of the considerable computational complexity. To reduce the computational complexity, a fast algorithm is proposed which reduces the number of operations by limiting the calculation of transform coefficients without significant quality degradation. Different modes of transformation are performed according to frame difference. This proposed fast interframe coding, like the MPEG, has an asymmetric property with decoding being much faster than encoding. Computer simulations show that this fast algorithm can significantly reduce the computational burden in interframe transform coding and is even faster than MPEG-like coding