boundary Matching Algorithm in JM H.264/AVC Decoder

Collapse
X
 
  • Time
  • Show
Clear All
new posts
  • hardikshuklay2k
    Junior Member
    Junior Member
    • Aug 2010
    • 5

    boundary Matching Algorithm in JM H.264/AVC Decoder

    I was going through the Inter frame error concealment in the JM decoder. While going through that I observed that within the ercCollect8PredBlocks() it actually marks the 8 neighboring blocks of the lost macroblock as reliable or not. The numbering is as follows:
    1 4 0
    5 x 7
    2 6 3

    After this when the code goes within the concealbyTrial() function it tries only four neighbouring macroblocks for concealment i.e. the top one, bottom one, right one and the left one.

    As a modification I was changing the code to actually take the top left, top right, bottom left and bottom right macroblocks also in consideration.

    In the code the smallest neighbor block size that is considered separately as predictor is set to 8X8 Y pixels. That means each macroblock is split into four 8X8 macroblocks. Within the code, in concealbyTrial() function, the compsplit1 and compsplit 2 variables select the particular macroblock partition. I am confused as in which partition withing the macroblocks numbered 1,0,2 and 3 to select if I also want to use them for concealment.

    Kindly let me know the solution.
Working...