Abstract
Publisher Summary This chapter describes the term “overlapped block-matching” and experimentally evaluate the performance of the corresponding sequential implementation. Overlapped block-matching motion compensation (OBMC) enhances the prediction results of classical non-overlapped block-matching in the context of video compression significantly and is especially well suited for wavelet-based video coding. However, this is achieved at a high additional computational cost. The possibilities for parallelization of two classical OBMC algorithms and the performance of implementations using MPI and OpenMP are investigated. Classical block-matching (BM) is a standard technique in video compression. A frame is divided into a grid of pixel blocks, and for each block a motion vector (MV) is computed. The result is a motion vector field (MVF) for each frame. The MVs are used to translate blocks of pixels from the previous frame into the current frame when decoding the video sequence. The MPI implementation on the hpcLine exhibited a communication overhead, which made it perform below the results of the MPI implementations on the origin, which has shared memory, and on the SR8000, with shared memory for 8 processors on a node.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
