Abstract-Matching pursuits over a basis of separable Gabor functions has been demonstrated to outperform DCT methods for displaced frame difference coding for video compression. Unfortunately, apart from very low bit-rate applications, the algorithm involves an extremely high computational load. This paper contains original contribution to the issues of dictionary selection and fast implementation for matching pursuits video coding. First, it is shown that the PSNR performance of existing matching pursuits codecs can be improved and the implementation cost reduced by a better selection of dictionary functions. Secondly, dictionary factorization is put forward to further reduce implementation costs. A reduction of the computational load by a factor of 20 is achieved compared to implementations reported to date. For a majority of test conditions, this reduction is supplemented by an improvement in reconstruction quality. Finally, a pruned full-search algorithm is introduced, which offers significant quality gains compared to the better-known heuristic fast-search algorithm, while keeping the computational cost low.Index Terms-Displaced frame difference, low-complexity algorithm, matching pursuit, pruned full search, video coding.

This paper introduces an error resilient implementation of the matching pursuits algorithm for video coding. The video bitstream is transmitted using the simulated Bluetooth air interface standard, which recommends ARQ as a means of overcoming channel errors in data packets. This may be unsuitable for real time and broadcast applications. Therefore, a modi3ed receiver is proposed in this paper, which does not request a retransmission of erroneous packets, but instead passes them to the video decoder to exploit error resilience. This strategy is shown to be superior to a standard compliant system if ARQ cannot be applied. This work confirms that wireless communication standards should support a transparent mode for video applications.

Matching pursuits is a dictionary-based coding method, which has recently been demonstrated to outperform standard techniques, such as H.263, at low bit rate video compression. Unfortunately, the method involves an extremely high computational cost, compared to the DCT-based H.263. The contribution of this paper relies on reporting three new dictionaries for matching pursuits video coding, whose advantages include both a reduced computational cost and improved PSNR performance, compared to dictionaries reported to date.

No abstract

Classical matching criteria for motion estimation determine match quality by operating in the spatial domain. The resulting DFD signal is, however, compressed by means of frequency transformations, and any optimal matching criteria should esi'imate the cost of coding the composite bit stream.Such criteria are presented in this paper and shown to ofer some improvement in the PSNR of the reconstructed sequence.