1 / 22

Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVTH.264

Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVTH.264. Mei-Juan Chen, Yi-Yen Chiang, Hung-Ju Li and Ming-Chieh Chi ISCAS 2004. Outline. Introduction FDVS FDVS for multi-frame FDVS for multi-frame in H.264 VADS VADVS in H.264 Refinement Experiment Conclusion.

josh
Download Presentation

Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVTH.264

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Efficient multi-frame motion estimation algorithms for MPEG-4 AVC/JVTH.264 Mei-Juan Chen, Yi-Yen Chiang, Hung-Ju Li and Ming-Chieh Chi ISCAS 2004

  2. Outline • Introduction • FDVS • FDVS for multi-frame • FDVS for multi-frame in H.264 • VADS • VADVS in H.264 • Refinement • Experiment • Conclusion

  3. Backgrounds • H.264 can refer from previous 1~5 frames, that can get smaller prediction error and obtain better performance. • MPEG-4 AVC/JVT/H.264 motion estimation involves considerable complexity, which increases linearly with the number of reference frames.

  4. Introduction • In multi-frame motion estimation, we reuse the motion information of each frame to its previous one frame for obtaining the MV.

  5. Introduction • Forward Dominant Vector Selection (FDVS) for multi-frame motion estimation in h.264 • Variable block size Activity Dominant Vector Selection (VADVS) in H.264 • Refinement for the Composed MV

  6. FDVS for multi-frame • FDVS：For frame-rate conversion • new MVs for outgoing bit-stream need to be computed • generates the outgoing MV from the incoming MVs instead of performing the full-scale motion estimation

  7. FDVS MV(n-2)(estimated)=MV1+ MV2=I(n)1+I(n-1)2

  8. FDVS for multi-frame • Dominant MV：MV carried by a dominant macroblock • Dominant macroblock：macroblock has the largest overlapping segment with the block pointed by the incoming motion vector

  9. FDVS for multi-frame Ref.0 Frame Current Frame

  10. FDVS for multi-frame motion estimation in h.264 • H.264 standard can 16x16, 16x8, 8x16, 8x8, 8x4, 4x8, and 4x4 block size to perform the motion compensation. • Therefore, we must store the seven block size MV with for FDVS algorithm for the previous reference frame.

  11. FDVS for multi-frame motion estimation in h.264 • Variable block size in h.264 (16x16 8x8 4x4) MV5=I1(n)+I2(n-1)+I1(n-2)+I4(n-3)+I3(n-4)

  12. FDVS for multi-frame motion estimation in h.264 • Variable block size in h.264 • 16x8 and 8x4 • 8x16 and 4x8

  13. Variable block size Activity Dominant Vector Selection (VADVS) • FDVS selects the dominant block with the largest overlapping area from the four neighboring blocks. • ADVS algorithm utilizes the activity information of the macroblock. • Counting the numbers of NZ (nonzero quantized DCT coefficients) of covered 8x8 residual blocks represents the activity information of a macroblock.

  14. VADVS 8x8 dct residual

  15. VADVS in h.264 • In H.264 standard, residual coding uses 4X4 block size to perform the transformation. • H.264 standard uses integer transform instead of the DCT transform. • Dominant MV：the MV carried by a dominant block. • dominant block：block that has the maximum NZ

  16. VADVS in h.264

  17. Refinement for composed MV • A composed MV is usually not optimal because each dominant motion vector is an approximated value of the optimal MV. • Horizontal and Vertical Search (HAVS) to refine the composed motion vector.

  18. Refinement for composed MV

  19. Experiment bit-rate variation is less than 2%

  20. Experiment PSNR difference is less than 0.1dB compared with the reference software JM61E_REF5.

  21. Experiment

  22. Conclusion • In this paper, we propose the efficient algorithms to improve the coding speed by 4 times in average, and maintain the performance.

More Related