Abstract
In this paper, two mesh-based motion estimation algorithms are presented. Both algorithms compute the nodal motions in a hierarchical manner. Within each hierarchy level, the first algorithm (HMMA) minimizes the prediction error in the four elements surrounding each node, where the prediction is accomplished by a bilinear mapping. The optimal solution is obtained by a full search within a range defined by the topology of the mesh. The second algorithm (HBMA) minimizes the error in a block surrounding each node, assuming the motion in the block is constant. The two algorithms are compared with an exhaustive block matching algorithm (EBMA) by evaluating their performances in temporal prediction and in an H.263/TMN4 coder. In terms of the PSNR measure, the three algorithms achieve quite similar performances. However, HMMA and HBMA avoid blocking artifacts introduced by EBMA. HMMA outperforms HBMA slightly for certain sequences at the expense of higher computational complexity.
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.
