In the context of very low bit-rate video coding, pattern representations of a moving region (MR) in block-based motion estimation and compensation has become increasingly attractive. Generally, all existing pattern-matching algorithms apply a similarity metric, involving elementary operations, to compute the mismatch between an MR and a particular fixed pattern in order to select the best-matching pattern from a fixed-size codebook of predefined patterns. An efficient similarity metric, together with a new generic computation strategy, is presented by considering only the mismatch areas of MRs. It is theoretically proven that for a specific MR in a macroblock, the new similarity metric selects exactly the same pattern as existing metrics, while the resulting computational coding efficiency is improved by between 21% and 58% compared with the H.263 low bit-rate coding standard.
展开▼
