Abstract

We propose an efficient geometry compression algorithm for three-dimensional (3-D) mesh sequences based on the two-stage vertex-wise motion vector (MV) prediction. In general, the MV of a vertex is highly correlated to those of the adjacent vertices. To exploit this high correlation, we define the neighborhood of a vertex, and predict the MV of the vertex from those of the neighborhood. The error vectors are related to the local shape changes of 3-D objects, and still have redundancy. To remove the redundancy, the error vectors are also predicted, at the second stage, spatially or temporally by using a rate-distortion optimization technique. It is shown that the proposed algorithm has simpler structure than the existing segment-based algorithm, and yields better compression performance.

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 call

Disclaimer: 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.