Skip to Main Content
Matching pursuits is proved to be one of the most efficient techniques used in video coding. However, its computation effort is so tremendous that it may not be affordable in some real-time applications. This paper presents an efficient algorithm for the implementation of matching pursuits. Simulation results show that the computation effort can be successfully reduced with the proposed method.