Animation data dynamic compression method, electronic equipment, storage medium and control device

Abstract

The invention relates to the technical field of data compression, and discloses an animation data dynamic compression method, electronic equipment, a storage medium and a control device.The animation data dynamic compression method comprises the following steps that animation data is obtained; and compressing the animation data by using a data compression processor based on a sampling fitting algorithm according to a set compression ratio to obtain compressed data, the compressed data being stored in the compressed data memory for an execution device to retrieve from the compressed data memory and perform decompression. According to the animation data dynamic compression method, the data storage space can be saved, so that the configuration of a compressed data memory can be reduced, and the cost is saved.

Description

Technical Field

[0001] This invention relates to the field of data compression technology, specifically to a method for dynamic compression of animation data, and also to an electronic device, storage medium, and control device. Background Technology

[0002] With the development of automotive intelligence, more and more car manufacturers are introducing animation effects into headlights or ambient lighting to enhance the technological feel and aesthetics of vehicles, and these animation effects are becoming increasingly complex.

[0003] However, animation data usually requires a lot of storage space. Therefore, in the application of automotive lighting controllers, due to the presence of animation data, it is often necessary to select a higher-specification microcontroller to store more animation data.

[0004] Existing microcontrollers store each frame of animation data. The size of the animation data increases linearly with the animation duration and frame rate. In order to cope with the animation effects that may be upgraded in the future, a large amount of storage space is often required, which requires higher-specification microcontrollers or memory, leading to a sharp increase in material costs.

[0005] Therefore, how to compress animation data to save storage space and reduce material costs is a technical problem that urgently needs to be solved by those skilled in the art. Summary of the Invention

[0006] The technical problem to be solved by the present invention is to provide a method, electronic device, storage medium and control device for dynamic compression of animation data, so as to solve the problem that the large amount of animation data occupies a large amount of storage space, which leads to the need for high-specification storage devices and increases material costs.

[0007] To address the aforementioned technical problems, the first aspect of the present invention provides a method for dynamic compression of animation data, comprising the following steps:

[0008] Obtain animation data;

[0009] According to the set compression ratio, the data compression processor uses a sampling fitting algorithm to compress the animation data, resulting in compressed data.

[0010] The compressed data is stored in the compressed data memory so that the execution device can retrieve it from the compressed data memory and decompress it.

[0011] Optionally, the compression ratio is set based on the remaining storage space of the compressed data storage device and the size of the animation data, wherein,

[0012] The larger the remaining storage space or the smaller the data volume, the smaller the compression ratio.

[0013] The smaller the remaining storage space or the larger the amount of data, the greater the compression ratio.

[0014] Optionally, the step of compressing the animation data using a data compression processor based on a sampling fitting algorithm according to the compression ratio includes:

[0015] Obtain the pixel information of each pixel in the animation data, record the pixel information of each pixel in each frame of the animation data in time sequence, and obtain the pixel information-time change curve;

[0016] The number of sampling points is determined based on the compression ratio, and a sampling fitting algorithm is used to sample and fit the pixel information-time change curve based on the number of sampling points to obtain a pixel information-time change polygon. The animation data frame corresponding to the sampling point in the pixel information-time change polygon with the highest overlap with the pixel information-time change curve is selected as a key frame and saved to obtain the compressed data.

[0017] Optionally, the sampling fitting algorithm includes at least one of the Douglas-Puk algorithm, dynamic programming algorithm, greedy algorithm, genetic algorithm and simulated annealing algorithm.

[0018] Optionally, the sampling fitting algorithm includes extracting the first frame, the last frame, and the change frame from the animation data as the key frame; if the animation data of the current frame changes compared to the animation data of the previous frame, then the animation data of the current frame is recorded as the change frame, and the key frame includes the change frame and at least one frame of animation data before and after the change frame.

[0019] Optionally, if the number of pixels whose pixel information has changed compared to the animation data of the previous frame exceeds a preset value, then it is determined that the animation data of the current frame has changed compared to the animation data of the previous frame.

[0020] Optionally, the pixel information includes brightness information, and the brightness information of each pixel in each frame of animation data is recorded in time sequence to obtain a brightness-time change curve.

[0021] Optionally, the more pixels in the animation data of the current frame whose pixel information has changed, the higher the priority of the current frame as the changed frame.

[0022] Optionally, the step of identifying the changing frame in the animation data includes:

[0023] Let the brightness of the pixel in the current frame be L1, the brightness in the previous frame be L2, and the brightness in the next frame be L3. Calculate the brightness change of the pixel in the current frame and the previous and next frames, ΔL = (L2 + L3) / 2 - L1.

[0024] The total brightness change is obtained by summing the brightness change ΔL of the pixels in each frame of the animation data, or by averaging the brightness change ΔL of the pixels in each frame of the animation data.

[0025] If the total brightness change or the average brightness change of the animation data in a frame is greater than or equal to a set value, then the animation data in that frame is a changed frame.

[0026] Optionally, the number of keyframes extracted is determined based on the compression ratio of the animation data. The compression ratio is the percentage of the extracted keyframes to the total number of frames in the original animation data. The larger the compression ratio, the fewer keyframes are extracted, and the smaller the compression ratio, the fewer keyframes are extracted.

[0027] Optionally, the compressed data is decompressed using a linear frame interpolation method.

[0028] A second aspect of the present invention provides an electronic device comprising:

[0029] A data compression processor, on which a computer program is stored, which is executed when the data compression processor is running;

[0030] The animation data dynamic compression method described in the above technical solution.

[0031] A third aspect of the present invention provides a storage medium storing a computer program, the computer program being executed by a processor:

[0032] The animation data dynamic compression method described in the above technical solution.

[0033] A fourth aspect of the present invention provides a control device comprising a compressed data storage device and an execution device. The compressed data storage device is used to store compressed data obtained by compression using the above-described animation data dynamic compression method. The execution device is connected to the compressed data storage device to retrieve the compressed data and decompress it. The execution device is also connected to an in-vehicle display device to transmit the decompressed compressed data to the display device for display.

[0034] The beneficial effects of the present invention through the above technical solution are as follows:

[0035] The first aspect of this invention provides a dynamic compression method for animation data. It first uses a data compression processor to compress the animation data and stores the compressed data in a compressed data memory. When the animation needs to be played, the compressed data already in the compressed data memory can be directly called for decompression, instead of placing the relevant compression program and the uncompressed animation data in the compressed data memory. This greatly reduces the memory requirements of the compressed data memory and thus reduces material costs.

[0036] A second aspect of the present invention provides an electronic device comprising: a data compression processor having a computer program stored thereon, wherein the computer program is executed by the data compression processor to perform the aforementioned dynamic compression of animation data, so that the compressed data is less prone to distortion.

[0037] The third aspect of the present invention provides a storage medium that, when run, can perform the above-mentioned dynamic compression of animation data, so that the compressed data is not easily distorted.

[0038] The fourth aspect of the present invention provides a control device in which the compressed data storage device is used to store compressed data obtained by the above-described animation data dynamic compression method. Therefore, the specifications of the compressed data storage device are relatively low, which can save material costs.

[0039] Other features and advantages of the present invention will be described in detail in the following detailed description section. Attached Figure Description

[0040] The accompanying drawings are provided to further illustrate the invention and form part of the specification. They are used together with the following detailed description to explain the invention, but do not constitute a limitation thereof. In the drawings:

[0041] Figure 1 This is a flowchart illustrating the dynamic compression method for animation data according to the present invention;

[0042] Figure 2 This is a brightness-time variation curve of the animation data of the present invention before compression, where OriginalCurve1 to OriginalCurve10 represent the original curves of the brightness of 10 LED beads.

[0043] Figure 3 This is a simplified brightness-time variation curve obtained after compression of the animation data of the present invention, where Sampled Curve 1 to Sampled Curve 10 represent the sampling curves of the brightness of 10 LED beads. Detailed Implementation

[0044] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are only for illustration and explanation of the present invention, and the scope of protection of the present invention is not limited to the specific embodiments described below.

[0045] like Figure 1 As shown, the first aspect of the present invention provides a dynamic compression method for animation data, comprising the following steps: acquiring animation data; compressing the animation data using a data compression processor based on a sampling fitting algorithm according to a set compression ratio to obtain compressed data, wherein the compressed data is used to store in a compressed data memory for the execution device to retrieve from the compressed data memory and decompress.

[0046] Based on the above technical solution, the data is first compressed by a data compression processor and then stored in a compressed data storage device. When animation is needed, the compressed data already in the compressed data storage device can be directly called for decompression, instead of placing the relevant compression program and the uncompressed animation data in the compressed data storage device. This greatly reduces the memory requirements of the compressed data storage device, thereby reducing material costs.

[0047] Specifically, the compression ratio is set based on the remaining storage space of the compressed data storage device and the size of the animation data. The larger the remaining storage space or the smaller the data size, the smaller the compression ratio; the smaller the remaining storage space or the larger the data size, the larger the compression ratio. This allows for adaptive adjustment of the compression ratio, ensuring that the compressed data can be stored in the compressed data storage device while ensuring that the animation data is not easily distorted after compression.

[0048] Furthermore, based on the compression ratio, the data compression processor compresses the animation data using a sampling fitting algorithm, including:

[0049] Obtain the pixel information of each pixel in the animation data, record the pixel information of each pixel in each frame of animation data in time sequence, and obtain the pixel information-time change curve;

[0050] The number of sampling points is determined based on the compression ratio. Then, a sampling fitting algorithm is used to sample and fit the pixel information-time change curve based on the number of sampling points to obtain a pixel information-time change polygon. The animation data frame corresponding to the sampling point in the pixel information-time change polygon with the highest overlap with the pixel information-time change curve is selected as the key frame and saved to obtain compressed data.

[0051] Based on the above technical solution, the pixel information of each pixel in each frame of animation data is first recorded in time sequence to obtain the pixel information-time change curve. Then, the number of sampling points is determined according to the compression ratio, and the pixel information-time change curve is sampled and fitted using a sampling fitting algorithm based on the number of sampling points to obtain a pixel information-time change polygon. Finally, the animation data frame corresponding to the sampling point in the pixel information-time change polygon with the highest overlap with the pixel information-time change curve is selected as the key frame and saved to obtain compressed data. This makes the overlap between compressed data and animation data higher, and thus makes the decompressed data less prone to distortion compared with the animation data. It can also greatly save the storage space of the compressed data storage device, so that a low-memory compressed data storage device or microcontroller can be used to save material costs.

[0052] Specifically, the sampling fitting algorithm includes at least one of the following: Douglas-Puk algorithm, dynamic programming algorithm, greedy algorithm, genetic algorithm and simulated annealing algorithm. All of the above algorithms are existing technologies and will not be described in detail here.

[0053] Specifically, the sampling and fitting algorithm includes extracting the first frame, last frame, and change frames from the animation data as keyframes. Specifically, if the animation data of the current frame changes compared to the previous frame, the current frame is designated as a change frame. Keyframes include the change frame and at least one frame of animation data before and after it. For example, comparing the animation data of the current frame with the previous frame, if the number of pixels whose pixel information has changed exceeds a preset value, then it is determined that the animation data of the current frame has changed compared to the previous frame.

[0054] Specifically, taking a black and white animation as an example, the pixel information includes brightness information, which is the brightness of the LED corresponding to the pixel on the display device. Before determining the changing frame, it is necessary to record the brightness information of each pixel in each frame of animation data in time sequence to obtain the brightness-time change curve.

[0055] The steps for identifying a changing frame provided in this application are as follows:

[0056] Calculate the first slope K1 of the brightness change of a pixel in the current frame compared to the brightness of the previous frame, and the second slope K2 of the brightness change of a pixel in the previous frame compared to the brightness of the frame before that (i.e., the frame before the previous frame) in the brightness-time variation curve. If the first slope K1 = 0, the pixel information in the current frame is unchanged from the previous frame; if the second slope K2 = 0, it can be determined that the pixel information in the current frame has changed compared to the previous frame when K1 is less than -0.2 or greater than 0.2; if both the first slope K1 and the second slope K2 are not 0, then... When the pixel information of the current frame has changed compared to the previous frame, it is determined that the pixel information of the current frame has changed.

[0057] Then, the animation data of the current frame can be compared with the animation data of the previous frame. If the number of pixels whose pixel information has changed exceeds a preset value, for example, reaching more than 60% of the number of pixels in the animation data of that frame, then the animation data of the current frame is recorded as a changed frame. Of course, it can be understood that if the animation data is a color animation, taking a common RGB color mode display device with LEDs that have red, green, and blue light as an example, then reaching more than 30% of the number of pixels in the animation data of that frame can be recorded as a changed frame. And each frame of animation data can be... The number of pixels whose pixel information has changed is counted and sorted in descending order. The more pixels whose pixel information has changed in a frame of animation data, the higher the priority of that frame of animation data as a changed frame. It can be understood that if the number of pixels whose pixel information has changed in two frames of animation data is the same, then when the second change slope K2 = 0 in each frame of animation data, the absolute value of K1 and the absolute value of K1 / K2-1 when the first change slope K1 and the second change slope K2 are not 0 are calculated. The larger the sum, the higher the priority of that frame of animation data as a changed frame.

[0058] The above-mentioned determination method can more accurately identify animation data frames with many pixel changes and large changes, so that the selected key frames are more accurate, and the compressed data is less likely to be distorted after decompression.

[0059] The above-described determination method is merely illustrative. The thresholds K1, K2, and the numerical relationship between K1 and K2 used to determine whether the pixel information of the current frame has changed compared to the pixel information of the previous frame can be adjusted according to actual needs. In some variation examples, when there are many sampling points, any frame that has changed can be used as a keyframe. This application can implement more variation methods, and is not limited thereto.

[0060] Finally, the brightness information of the pixels in the keyframes and the time information of the keyframes are saved to obtain the compressed animation data and a simplified brightness-time change curve. During decompression, the brightness of the same pixel in two adjacent keyframes can be linearly interpolated to determine the change in brightness of that pixel over the time interval between the two adjacent keyframes, thereby obtaining the decompressed animation data. The above linear interpolation is an existing technology and will not be described in detail here.

[0061] In addition, this application also provides another step for identifying changed frames:

[0062] Let L1 be the brightness of a pixel in the current frame, L2 be the brightness of the previous frame, and L3 be the brightness of the next frame in the brightness-time change curve. Calculate the brightness change of the pixel between the current frame and the previous and next frames, ΔL = (L2 + L3) / 2 - L1. Then, sum the brightness changes ΔL of the pixels in each frame of animation data to obtain the total brightness change, or average the brightness changes ΔL of the pixels in each frame of animation data to obtain the average brightness change. If the total brightness change or the average brightness change of the animation data of a frame is greater than or equal to a set value, then the animation data of that frame is a changed frame.

[0063] Understandably, the total brightness change or average brightness change can be further sorted in descending order. The larger the value of the total brightness change or average brightness change, the higher the priority of the corresponding animation frame as a changed frame.

[0064] The above-described determination method can adapt to animation data of various color modes and can more conveniently and quickly identify animation data frames with many pixel changes, so that the selection of keyframes can be faster, thereby reducing the data compression time. However, since the value of brightness change ΔL = (L2 + L3) / 2 - L1 can be positive or negative, the sum of the absolute values ​​of brightness change ΔL of pixels in each frame of animation data can be further calculated. If the sum of the absolute values ​​of brightness change ΔL of pixels in a frame of animation data is larger, the higher the priority of that frame of animation data as a changing frame, so as to more accurately identify animation data frames with many pixel changes and large degree of change, so as to select more accurate keyframes, thereby making the compressed data less prone to distortion after decompression.

[0065] Finally, the brightness information of the pixels in the keyframes and the time information of the keyframes are saved to obtain the compressed animation data and a simplified brightness-time change curve. During decompression, the brightness of the same pixel in two adjacent keyframes can be linearly interpolated to determine the change in brightness of that pixel over the time interval between the two adjacent keyframes, thereby obtaining the decompressed animation data. The above linear interpolation is an existing technology and will not be described in detail here.

[0066] Furthermore, it is understandable that the number of keyframes extracted is determined based on the compression ratio of the animation data. The compression ratio is the percentage of extracted keyframes relative to the total number of frames in the original animation data. The smaller the compression ratio, the fewer keyframes are extracted; the larger the compression ratio, the more keyframes are extracted. The compression ratio is determined based on the size of the animation data and the remaining memory in the storage device. The smaller the remaining memory or the larger the data size, the smaller the compression ratio; conversely, the larger the remaining memory or the smaller the data size, the larger the compression ratio. For example, a welcoming animation effect involves 10 LED beads. The original animation data of this welcoming animation effect has 503 frames, a total playback time of 5030ms, and a total data size of 50Kb. If there is 10Kb of storage space remaining, the compression ratio of the animation data can be set to 20%, meaning that 100 or 101 keyframes can be extracted and saved to obtain the compressed animation data and a simplified brightness-time change curve for each LED bead, as long as the total data size of the extracted keyframes is within 10Kb.

[0067] Furthermore, in some embodiments, dozens of animation effects may be stored within the same control device, involving a relatively large number of LEDs. This application can significantly reduce the memory requirements of the compressed data storage device through a dynamic animation data compression method. For example, a low-cost microcontroller with a storage space typically between 128Kb and 1Mb can be used, thereby reducing material costs. In addition, this application is particularly suitable for displaying simple animations in vehicle lights, ambient lighting strips, etc.

[0068] like Figure 2 and Figure 3 As shown, taking a welcoming animation effect involving 10 LED beads as an example, LED beads 1 to 5 are compressed based on the slope of brightness change, while LED beads 6 to 10 are compressed based on the amount of brightness change. By comparing the simplified brightness-time change curve after decompression with the original brightness-time change curve of the animation data, it can be clearly seen that the simplified brightness-time change curve after decompression is basically consistent with the original brightness-time change curve of the animation data. Therefore, the decompressed animation data is basically lossless compared with the original animation data, and there is no distortion.

[0069] A second aspect of the present invention provides an electronic device including a data compression processor storing a computer program thereon. When the data compression processor runs the computer program, it performs the dynamic compression of animation data as described above. Because the electronic device can perform the aforementioned dynamic compression of animation data when it is running, it can prevent the compressed animation data from becoming distorted.

[0070] A third aspect of the present invention provides a storage medium storing a computer program, which is executed by a processor: the animation data dynamic compression in the above technical solution, since the storage medium can perform the above-mentioned animation data dynamic compression when it is run, can make the compressed animation data less prone to distortion.

[0071] A fourth aspect of the present invention provides a control device comprising a compressed data storage device and an execution device. The compressed data storage device is used to store compressed data obtained by the above-described dynamic compression method for animation data. The execution device is connected to the compressed data storage device to retrieve and decompress the compressed data. The execution device is also connected to an in-vehicle display device to transmit the decompressed compressed data to the display device for display. Since the steps of compressing animation data and the related compression program are all completed on the data compression processor, the storage specifications of the compressed data storage device are relatively low, and the data processing capabilities of the execution device are also relatively low. A lower-specification execution device can be used to reduce material costs. Furthermore, as the vehicle undergoes software upgrades, further reducing storage space, the compressed animation data can be transferred out of the compressed data storage device, further compressed on the data compression processor, and then imported back into the compressed data storage device to free up storage space for software upgrades, thereby preserving existing animation data.

[0072] This invention is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations and / or block diagrams. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0073] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0074] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0075] In a typical configuration, a computing device includes one or more processors (CPU), input / output interfaces, network interfaces, and memory.

[0076] Memory may include non-persistent memory in computer-readable media, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of computer-readable media.

[0077] Computer-readable media, including both permanent and non-permanent, removable and non-removable media, can store information using any method or technology. Information can be computer-readable instructions, data structures, program modules, or other data.

[0078] Examples of computer storage media include, but are not limited to, phase-change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, CD-ROM, digital versatile optical disc (DVD) or other optical storage, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transferable medium that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transient media, such as modulated data signals and carrier waves.

[0079] The preferred embodiments of the present invention have been described in detail above with reference to the accompanying drawings. However, the present invention is not limited to the specific details of the above embodiments. Within the scope of the technical concept of the present invention, various simple modifications can be made to the technical solution of the present invention, and these simple modifications all fall within the protection scope of the present invention.

[0080] It should also be noted that the various specific technical features described in the above embodiments can be combined in any suitable manner without contradiction. To avoid unnecessary repetition, the present invention will not describe the various possible combinations separately.

[0081] Furthermore, various different embodiments of the present invention can be combined in any way, as long as they do not violate the spirit of the present invention, they should also be regarded as the content disclosed by the present invention.

Claims

1. A method for dynamic compression of animation data, characterized in that, Includes the following steps: Obtain animation data; According to the set compression ratio, the data compression processor uses a sampling fitting algorithm to compress the animation data, resulting in compressed data. The compressed data is stored in a compressed data memory for the execution device to retrieve and decompress.

2. The animation data dynamic compression method according to claim 1, characterized in that, The compression ratio is set based on the remaining storage space of the compressed data storage device and the size of the animation data, wherein, The larger the remaining storage space or the smaller the data volume, the smaller the compression ratio. The smaller the remaining storage space or the larger the amount of data, the greater the compression ratio.

3. The animation data dynamic compression method according to claim 1, characterized in that, The step of compressing the animation data using a data compression processor based on a sampling fitting algorithm according to the compression ratio includes: Obtain the pixel information of each pixel in the animation data, record the pixel information of each pixel in each frame of the animation data in time sequence, and obtain the pixel information-time change curve; The number of sampling points is determined based on the compression ratio, and the pixel information-time change curve is sampled and fitted using the sampling fitting algorithm based on the number of sampling points to obtain a pixel information-time change polygon. The animation data frame corresponding to the sampling point in the pixel information-time change polygon with the highest overlap with the pixel information-time change curve is selected as a key frame and saved to obtain the compressed data.

4. The animation data dynamic compression method according to claim 3, characterized in that, The sampling fitting algorithm includes at least one of the following: Douglas-Puk algorithm, dynamic programming algorithm, greedy algorithm, genetic algorithm, and simulated annealing algorithm.

5. The animation data dynamic compression method according to claim 3, characterized in that, The sampling and fitting algorithm includes extracting the first frame, the last frame, and the change frame from the animation data as the key frame; if the animation data of the current frame changes compared to the animation data of the previous frame, the animation data of the current frame is recorded as the change frame, and the key frame includes the change frame and at least one frame of animation data before and after the change frame.

6. The animation data dynamic compression method according to claim 5, characterized in that, If the number of pixels whose pixel information has changed compared to the animation data of the previous frame exceeds a preset value, then it is determined that the animation data of the current frame has changed compared to the animation data of the previous frame.

7. The animation data dynamic compression method according to claim 6, characterized in that, The pixel information includes brightness information. The brightness information of each pixel in each frame of animation data is recorded in time sequence to obtain a brightness-time change curve.

8. The animation data dynamic compression method according to claim 6 or 7, characterized in that, The more pixels in the animation data of the current frame whose pixel information has changed, the higher the priority of the current frame as the changed frame.

9. The animation data dynamic compression method according to claim 5, characterized in that, The step of identifying the animation data as the changed frame includes: Let the brightness of the pixel in the current frame be L1, the brightness in the previous frame be L2, and the brightness in the next frame be L3. Calculate the brightness change of the pixel in the current frame and the previous and next frames, ΔL = (L2 + L3) / 2 - L1. The total brightness change is obtained by summing the brightness change ΔL of the pixels in each frame of the animation data, or by averaging the brightness change ΔL of the pixels in each frame of the animation data. If the total brightness change or the average brightness change of the animation data in a frame is greater than or equal to a set value, then the animation data in that frame is a changed frame.

10. The animation data dynamic compression method according to claim 3, characterized in that, The number of keyframes extracted is determined based on the compression ratio of the animation data. The compression ratio is the percentage of the extracted keyframes to the total number of frames in the original animation data. The larger the compression ratio, the fewer keyframes are extracted, and the smaller the compression ratio, the fewer keyframes are extracted.

11. The animation data dynamic compression method according to claim 1, characterized in that, The compressed data is decompressed using linear frame interpolation.

12. An electronic device, characterized in that, The electronic device includes: A data compression processor having a computer program stored thereon, the computer program being executed by the data compression processor during runtime; The animation data dynamic compression method as described in any one of claims 1 to 11.

13. A storage medium, characterized in that, The storage medium stores a computer program, which is executed by a processor: The animation data dynamic compression method as described in any one of claims 1 to 11.

14. A control device, characterized in that, The device includes a compressed data storage device and an execution device. The compressed data storage device is used to store compressed data obtained by the dynamic compression method for animation data as described in any one of claims 1 to 11. The execution device is connected to the compressed data storage device to retrieve the compressed data and decompress it. The execution device is also connected to an in-vehicle display device to transmit the decompressed compressed data to the display device for display.

Images