A novel bitmap based matching criterion for MPEG video coding

This paper presents an efficient matching criterion algorithm, which reduces the computation time. In this algorithm we developed a binary format of a given frame and after integrating the pixels´ value in a block; the difference of target block and candidate are taken as the measure of match. This value must be no less than the pre-setup threshold value. It was found that the new algorithm required less computation than any other matching criteria and this was justified by our experimental results using an MPEG encoder.