Research On 3D Animation Compression And Optimization Method Based On Data Structure

With the development of graphics technology,3D animation data is gradually becoming another mainstream data carrier after text,voice,picture and video.It has been widely used in digital entertainment,film and television,medicine,virtual reality and other fields.Driven by the strong demand in many application fields,3D animation has gradually become an important research object in the field of computer graphics.With the rapid development of motion capture and 3D model scanning technology,the acquisition methods of 3D animation are diversified and convenient.However,due to the limitation of bandwidth and storage capacity,the dissemination and popularization of 3D animation are still restricted.How to effectively compress 3D animation data and reduce the pressure of network bandwidth has become an important research direction in the field of graphics.Many scholars are committed to studying image and video compression and have formulated relevant standards,such as JPEG image compression algorithm and MPEG video compression algorithm.Both video and 3D animation consist of static frames.A static frame can be regarded as an image,but different from regular image data and video data,the vertices of the model in 3D animation are disordered.Therefore,this thesis discusses how to optimize the above algorithm to make it suitable for 3D animation compression,and improve the compression effect.3D animation compression optimization algorithm based on JPEG is proposed.The disorder of vertices in 3D animation is the core that makes the classical compression algorithm unable to reuse directly.So consider constructing the structured expression of each frame model in 3D animation to solve the above problems.Specifically,firstly,the e K-means clustering algorithm is proposed to reorder the vertex sequence of each frame of 3D animation,store the data in the matrix to make the 3D animation data structured,and then optimize the optimal sub-block segmentation size and quantization table of 3D animation data.Finally,the algorithm is compared with the previous algorithms,and the results show that the compression effect of this algorithm is better than other algorithms.Although the spatial redundancy of 3D animation is considered in the optimization algorithm of 3D animation compression based on JPEG,the time-domain redundancy between3 D animation frames has not been processed.Therefore,3D animation compression optimization algorithm based on MPEG is proposed to solve this problem.Specifically,firstly,the e K-means clustering algorithm is used to structurally process the 3D animation data,and then the LLE dimensionality reduction algorithm is used to reduce the dimension of the 3D animation data.The 2D features after dimensionality reduction are used to classify the 3D animation frames to adapt to the MPEG algorithm,and the DZIP algorithm is used to optimize the compression strategy.The experimental results show that this algorithm further improves the compression effect.