Dynamic Attribute Data Block for Animation File Size Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional animation file encoding processes require numerous flag fields to identify attribute states, resulting in excessively large file sizes and wasteful use of storage space due to inefficiencies in data representation and compression.
Innovation Solution
The proposed solution involves an animation data encoding method that processes animation data from an animation project file by determining attribute flag information and encoding attribute values based on this information, using a dynamic attribute data block structure to efficiently store and decode animation data, reducing file size through optimized data storage and compression techniques.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If traditional animation file encoding uses numerous flag fields to identify attribute states, then attribute states can be accurately identified, but file size becomes excessively large and storage space is wasted
Solution Approach 1:
The patent segments the animation data structure into multiple blocks, each containing specific attribute information. Instead of using a single large structure with numerous flag fields, the data is divided into smaller, organized blocks that can be efficiently stored and accessed, reducing overall file size while maintaining identification accuracy.
Solution Approach 2:
The patent implements a dynamic attribute data structure where the presence and content of attribute blocks are determined by flag information. This dynamic structure allows the file to contain only the necessary attribute data for each animation element, avoiding the storage of unnecessary flag fields and reducing file size while preserving the ability to accurately identify attribute states.
2Reliability
If traditional animation file encoding includes all possible attribute data, then data completeness is ensured, but storage efficiency decreases
Solution Approach 1:
The patent extracts only the necessary attribute information into separate blocks based on flag indicators. Instead of including all possible attribute data in every animation file, the system extracts and stores only the attributes that are actually present or needed, ensuring data completeness for required attributes while improving storage efficiency by eliminating redundant data.
Solution Approach 2:
The patent changes the parameter representation by using a dynamic block structure with flag information instead of a fixed comprehensive structure. This parameter change allows the system to adapt the data structure to the actual content needs, storing complete attribute data when necessary while using minimal space when attributes are default or absent.
3Adaptability or versatility
If animation files use complex data structures to represent all animation attributes, then animation complexity is supported, but encoding and decoding efficiency decreases
Solution Approach 1:
The patent segments animation data into organized blocks with clear structures, making encoding and decoding more efficient. Each block represents a specific attribute category, allowing processors to quickly locate and handle relevant data without parsing through a complex monolithic structure, thus improving productivity while maintaining adaptability.
Solution Approach 2:
The patent performs preliminary organization of animation data into standardized blocks with flag information during the encoding phase. This preliminary action structures the data in advance, enabling faster decoding and processing later without requiring complex real-time analysis, thereby improving encoding and decoding efficiency while supporting diverse animation attributes.
Data Source
AI summary
In an animation data encoding method, animation data corresponding to an animation element is obtained from an animation project file. When one or more attributes of the animation element exist in a predefined attribute structure table, for each of the one or more attributes, an attribute structure table is generated by sequentially storing attribute flag information corresponding to each of the one or more attributes and sequentially storing, after the attribute flag information, corresponding attribute content for each of the one or more attributes, to obtain a dynamic attribute data block corresponding to the animation element.