An Optimal Content-Based Pattern Generation Algorithm

Abstract

Abstract-Very low bit-rate video coding algorithms using predefined regular-shaped patterns to segment out moving objects at macroblock level have exhibited good potential for improved coding efficiency when embedded in the H.264 standard as an extra mode. Even the best-matched regular-shaped pattern from a predefined codebook cannot approximate the shape of the object well, and there is no guarantee that even a regular-shaped object will have a close match with one of the limited number of predefined patterns. Intuitively, improved coding performance can be achieved if patterns are dynamically extracted from the video content. This letter presents a content-based pattern generation (CPG) algorithm for a set of macroblocks, which is shown optimal when only one pattern is allowed to represent the entire set. Coupling CPG, generating a pattern codebook after clustering the macroblocks into several disjoint sets, with any pattern selection algorithm outperforms the existing regular-shaped pattern-based coding while both embedded in H.264.

Optimal arbitrary shaped pattern-based video coding

“…Thus, OCPG ensures convergence by providing near optimal solutions. The main advantage of this OCPG approach over previous version is that it takes whole MR information to cluster the CRMB against pattern instead of a gravitation centre of a CRMB [7]. Moreover, multiple of iterations ensure the quality of PC to represent the CRMBs and this approach does not require EPS pattern matching so that it reduces the computational time needed to select the best-match pattern from a PC against each CRMB.…”

“…Intuitively, an efficient coding is possible if the MR is encoded using the pattern templates generated from the content of the video sequences. Very recently, Paul and Murshed [7] proposed a content-based pattern generation (CPG) algorithm to generate eight patterns from the given MRs. The PVC using those generated patterns outperformed the H.264 and the existing PVC by 1.0dB and 0.5dB respectively [7].…”

“…Very recently, Paul and Murshed [7] proposed a content-based pattern generation (CPG) algorithm to generate eight patterns from the given MRs. The PVC using those generated patterns outperformed the H.264 and the existing PVC by 1.0dB and 0.5dB respectively [7]. They also mathematically proved that this pattern generation technique is optimal if only one pattern would be generated for a given division of MRs.…”

“…In first phase MRs are collected from the given number of frames and PC is generated from those MRs using the CPG algorithm [7]. In the second phase, actual coding is taken place using the this PC.…”

Video coding using arbitrarily shaped block partitions in globally optimal perspective

“…Intuitively, an efficient coding is possible if the moving region is encoded using the pattern templates generated from the content of the video sequences. Very recently, Paul and Murshed [16] proposed a contentbased pattern generation (CPG) algorithm to generate eight patterns from the given moving regions. The PVC using those generated patterns outperformed the H.264 (i.e., baseline profile) and the existing PVC by 1.0 and 0.5 dB respectively [16] for head-shoulder-type video sequences.…”