Animation data refreshing method, vehicle lamp and vehicle
By compressing and differential refreshing the animation data of the headlights, the problem of large storage space and real-time refresh delay is solved, and efficient data processing and communication speed are achieved.
Patent Information
- Application Number
- CN202411914244.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-12-24
- Publication Date
- 2025-05-02
AI Technical Summary
Headlight animation data takes up a lot of space during storage and real-time refresh, and can cause delay problems, requiring high communication rates.
Compression and differential refresh methods when mapping particles through animation data, including polling animation data and compressing continuous repeated data, dynamic framing and differential refreshing, to reduce storage space usage and improve communication rate.
It effectively reduces the storage space requirement of animation data, improves the real-time refresh speed of animation on vehicles, and reduces the communication speed requirement.
Smart Images
Figure CN119919549A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of vehicle control technology, and in particular to a method for controlling an animation data refreshing vehicle interactive screen, a vehicle lamp and a vehicle. Background Art
[0002] With the development of automobile intelligence and personalization, headlight animation has become an important means to enhance vehicle appearance appeal and user experience.
[0003] However, the colorful and complex car light animations usually take up a lot of storage space after being parsed into LED particle mapping, and may encounter delay problems when being refreshed in real time in the vehicle control system. Summary of the invention
[0004] One purpose of the present application is to propose an animation data refresh method, a headlight and a vehicle. The technical solution provided by the present application solves the problem of requiring a large space and the problem of requiring a high communication rate by compressing and differentially refreshing the animation data when mapping particles.
[0005] According to an embodiment of the first aspect of the present application, a method for refreshing animation data is provided, the method comprising:
[0006] Polling the animation data, compressing the data in the animation data that is continuous and repeated for more than two times, until the polling is completed, to obtain compressed animation data;
[0007] Comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic frame division in the area where the picture changes to obtain the animation frame;
[0008] The animation data of the current animation frame and the adjacent previous animation frame are compared, the same animation data in the current animation frame and the adjacent previous animation frame are kept as they are, and the animation data with differences are refreshed.
[0009] In some embodiments, the method further comprises:
[0010] A data structure is established for the animation data to be compressed, the data structure including a compression flag, the number of compressed data and the value of the compressed data, wherein the compression flag is used to identify whether the current data is compressed, the number of compressed data is used to identify the number of compressed repeated data, and the value of the compressed data is used to identify the compressed data itself.
[0011] In some embodiments, the polling animation data compresses data in the animation data that is continuous and repeated for more than two times until the polling is completed to obtain compressed animation data, including:
[0012] Polling the animation data, recording the data in the animation data that is continuous and repeated more than twice, marking the compression flag as 1, and recording the number of compressed data and the value of the compressed data;
[0013] The compressed animation data is obtained based on the number of the compressed data and the value of the compressed data.
[0014] In some embodiments, comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic framing in the area where the picture changes to obtain the animation frame, includes:
[0015] Compare the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, keep the unchanged part of the picture original until the picture changes or the next animation frame starts, and perform dynamic frame division to obtain animation frames, and different animation frames correspond to different pictures.
[0016] In some embodiments, comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic framing in the area where the picture changes to obtain the animation frame, includes:
[0017] Comparing the picture of the current animation frame in the compressed animation data with the adjacent previous animation frame, recording the time points corresponding to the two animation frames where the picture changes, and determining the maximum time interval between the picture changes based on the time points;
[0018] The compressed animation data is dynamically divided into frames based on the maximum time interval to obtain animation frames, and different animation frames include different picture information.
[0019] In some embodiments, the animation frame includes animation data corresponding to a plurality of LEDs;
[0020] The comparing the animation data of the current animation frame and the adjacent previous animation frame, keeping the same animation data in the current animation frame and the adjacent previous animation frame as is, and refreshing the animation data with differences, includes:
[0021] The difference between the LED data included in the current animation frame and the LED data included in the previous animation frame is compared, and the LED data with the difference is refreshed.
[0022] The present application also provides a vehicle lamp, which includes the steps of the animation data refreshing method provided in any one of the above embodiments.
[0023] The present application also provides a vehicle, characterized in that the vehicle includes the steps of the animation data refreshing method provided in any one of the above embodiments. Or the vehicle lights provided in the above embodiments.
[0024] The present application also provides a computer device, including a memory and a processor, wherein a computer program is stored in the memory, and when the processor executes the computer program, the steps of the animation data refreshing method provided in any of the above embodiments are implemented.
[0025] The present application also provides a computer-readable storage medium, characterized in that a computer program is stored therein, and when the computer program is executed by a processor, the steps of the animation data refreshing method provided in any of the above embodiments are implemented.
[0026] In the above embodiment, the animation data is first compressed, and then the compressed data is dynamically framed. When the picture changes, the animation frame is obtained by framing, and the data in the animation frame is differentially refreshed, that is, the difference between the data of the current animation frame and the previous animation frame is compared again, and the data with differences is refreshed. It can be understood that although the pictures of adjacent animation frames have changed, not all data have changed, so not all data in the animation frame is refreshed, but only the data with differences is refreshed. The technical solution provided by the present application solves the problem of requiring a large space and the problem of requiring a high communication rate by compressing and differentially refreshing the animation data when mapping particles.
[0027] Additional aspects and advantages of the present application will be given in part in the description below, and in part will become apparent from the description below, or will be learned through the practice of the present application. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] The above and / or additional aspects and advantages of the present application will become apparent and easily understood from the description of the embodiments in conjunction with the following drawings, in which:
[0029] Figure 1 It is a flowchart of an animation data refreshing method provided in one embodiment of the present application;
[0030] Figure 2 is a flowchart of an animation data compression method provided in one embodiment of the present application;
[0031] Figure 3 is a flowchart of a dynamic framing method provided in one embodiment of the present application;
[0032] Figure 4 is a schematic diagram of the data structure provided by this application;
[0033] Figure 5 It is an overall flow chart of the animation data refreshing method provided by this application;
[0034] Figure 6 It is a structural schematic diagram of an animation data refreshing device according to an embodiment of the present application;
[0035] Figure 7 It is a structural diagram of a computer device according to an embodiment of the present application. DETAILED DESCRIPTION
[0036] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.
[0037] The technical solutions between the various embodiments of the present invention can be combined with each other, but it must be based on the fact that ordinary technicians in the field can implement it. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such combination of technical solutions does not exist and is not within the scope of protection required by the present invention.
[0038] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the specific embodiments of the present application are described in detail below with reference to the accompanying drawings.
[0039] The present application provides an animation data refreshing method, wherein the animation screen is composed of a number of animation frames, each of which contains a large amount of animation data, and these continuous animation data are stored in a memory, and the playback is controlled by a playback instruction. Due to the limited space of the memory, a large amount of bloated data will reduce the communication rate. According to the continuous and repeated data in the animation data, the following can be applied: Figure 5 The execution process shown compresses the animation data, dynamically divides the frames, and performs differential refresh to increase the communication rate during animation projection.
[0040] Specifically, Figure 1 As shown, the above-mentioned animation data refreshing method includes:
[0041] Step 101 , polling the animation data, compressing the data in the animation data that is continuous and repeated for more than two times, until the polling is completed, to obtain compressed animation data.
[0042] Specifically, the animation screen includes a large amount of animation data, which are arranged continuously in the order of playback and recorded in the memory. When refreshing the above animation, the computer polls the animation data that needs to be compressed. If the current animation data is not equal to the previous animation data, the computer continues to poll without compression. If the current animation data is equal to the previous animation data, the computer continues to query until the current animation data is not equal to the previous animation data, that is, the animation data is continuous and repeated more than twice. In this case, the data repeated more than twice is compressed and the compressed animation data is recorded. When the animation is played, the animation content displayed by the compressed animation data is consistent with that before compression, and the refresh rate is higher.
[0043] In some embodiments, for example, there is animation data [0x0021, 0x0021, 0x0021, 0x0183]. The first [0x0021] has three, which can be compressed to [0x8003 0x0021]. The first [0x0183] can remain unchanged, so the final compressed data is [0x8003, 0x0021, 0x0183]. By compressing the animation data, data storage space is saved.
[0044] Step 102 , comparing the image of the current animation frame in the compressed animation data with the adjacent previous animation frame, and performing dynamic frame division in the area where the image changes to obtain animation frames.
[0045] Specifically, after the animation data is compressed, the compressed animation data is further divided into frames.
[0046] Dynamic framing is different from the framing method of the prior art that is performed at fixed time intervals. For example, dynamic framing may refer to framing when the animation picture in the compressed data changes.
[0047] The animation picture corresponding to the animation data is composed of several animation frames, each frame is a still picture, and when these pictures are played continuously, an animation effect will be formed. These continuous pictures include several continuous and identical pictures and several continuous but different pictures. The continuous and identical pictures can be two frames of continuous pictures or more than two frames of continuous pictures.
[0048] In some embodiments, dynamic framing may refer to framing based on whether the animation screen changes. For example, continuous and identical screens are not framed, and the continuous and identical screens are played until the end, and the first frame is performed before the next different screen is played, and the second frame is performed before the next set of continuous and identical screens is encountered, and the dynamic framing is completed until the animation is played.
[0049] The above-mentioned continuous pictures may include a plurality of continuous and identical animation frames, and no frame division processing is performed between the group of continuous and identical animation frames.
[0050] The above-mentioned continuous pictures may also include several continuous but different pictures, so dynamic frame division processing is required between different animation frames.
[0051] Step 103, comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0052] Specifically, an animation picture is composed of a number of animation frames, each of which is a still picture. When these pictures are played continuously, an animation effect is formed.
[0053] Each animation frame includes a number of animation data, and the animation data together form an animation picture. The animation data of the current animation frame is compared with the animation data of the previous animation frame, and the parts of the animation data that are the same are kept as they are, and the parts of the animation data that are different are refreshed.
[0054] In this way, during the data refresh process, only the data with differences is refreshed instead of refreshing all the data, which further improves the efficiency of data processing.
[0055] In some embodiments, Figure 2 As shown, the method also includes:
[0056] Step 201 : establishing a data structure for the animation data to be compressed, wherein the data structure includes a compression flag, the number of compressed data and the value of the compressed data.
[0057] The compression flag is used to indicate whether the data has been compressed. The number of compressed data indicates the number of continuous and repeated (at least 2 times) data (represented by n). The value of the compressed data is the data itself that is continuous and repeated more than twice. The compressed animation data is expressed by the three together. For example, if a certain data is repeated n times in a row, and n is greater than 2, then when the compressed data is parsed and played, it means that the animation data is repeated n times.
[0058] In some embodiments, the polling animation data compresses data in the animation data that is continuous and repeated for more than two times until the polling is completed to obtain compressed animation data, including:
[0059] Step 202 , polling the animation data, recording the data in the animation data that is continuous and repeated more than twice, marking the compression flag as 1, and recording the number of compressed data and the value of the compressed data.
[0060] Specifically, the compression flag is used to indicate whether the data has been compressed. If it has been compressed, the value of the compression flag is 1, otherwise the value of the compression flag is 0. In other embodiments, the value of the compression flag may also be other values, which are not specifically limited here.
[0061] The compression identification bit can be any one of the coding bits corresponding to the animation data, but the compression identification bits corresponding to all the animation data need to be the same one of the coding bits, for example, the first high bit in the coding bits corresponding to the animation data, and in other embodiments, it can also be other bits, such as the first low bit.
[0062] The bit is not specifically limited here, and it is only required that the compression identification bit is a certain bit in the coding bit. Step 203, based on the number of the compressed data and the value of the compressed data, the compressed animation data is obtained.
[0063] Based on the above data structure, compressed animation data is obtained. The compression flag and the number of compressed data are recorded in front, and the value of the compressed data is recorded in the back. When playing the animation, it is first read whether the data is compressed. If it is compressed, the animation data is played according to the number of compressed data. Alternatively, the value of the compressed data can be recorded in front, and the compression flag and the number of compressed data are recorded in the back. When playing the animation, the value of the compressed data is first read, and then the compression flag and the number of compressed data are read, and the animation data is played according to the number of compressed data.
[0064] In some embodiments, comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing frame division in the area where the picture changes to obtain the animation frame, includes:
[0065] The picture of the current animation frame in the compressed animation data is compared with the adjacent previous animation frame, and the picture that has not changed is kept in its original state until the picture changes or the next animation frame starts, and then the animation frame is obtained by dividing the frame.
[0066] Specifically, after the compressed animation data is obtained, the pictures corresponding to adjacent animation frames are compared. If the pictures of adjacent animation frames are consistent, they remain unchanged. If the pictures corresponding to adjacent animation frames change, dynamic frame processing is performed.
[0067] In the above embodiment, the animation frames are not split according to fixed time intervals, but are split based on whether the picture changes, thereby achieving splitting based on actual data conditions and realizing efficient data processing.
[0068] like Figure 3 As shown, in some embodiments, the method further includes:
[0069] Step 301 , compare the image of the current animation frame in the compressed animation data with the adjacent previous animation frame, record the time points corresponding to the two animation frames where the image changes occur, and determine the maximum time interval of the image changes based on the time points.
[0070] For example, the compressed animation data can be polled, and when the current animation frame is polled, the picture difference between the current animation frame and the previous animation frame is compared. When there is a picture difference, the time point when the picture changes is recorded, and the maximum time interval for the picture to change again is determined based on the difference between the current time point and the time point when the picture changed last.
[0071] Step 302: dynamically divide the compressed animation data into frames based on the maximum time interval to obtain animation frames, and different animation frames include different picture information.
[0072] The computer dynamically divides the compressed animation data into frames based on the determined maximum time interval to obtain animation frames. It can be understood that since the animation frames are divided based on the changes in the pictures, the picture information included in different animation frames is different.
[0073] In the above embodiment, the compressed animation data is divided into frames using the dynamic frame principle rather than being divided based on fixed time intervals, thereby ensuring that the images included in the obtained animation frames are different. This can reduce the possibility of invalid animation frames and reduce the space occupied by data storage.
[0074] In some embodiments, the method further comprises:
[0075] The animation frame includes animation data corresponding to a plurality of LEDs. The difference between the LED data included in the current animation frame and the previous animation frame is compared, and the LED data with the difference is refreshed.
[0076] It can be understood that an animation frame is composed of animation data. Specifically, an animation frame may include animation data corresponding to multiple LEDs for displaying an animation picture. The method further includes comparing the difference between the data included in two consecutive animation frames, refreshing the LED data with differences, and keeping the animation data that has not changed as it is without refreshing.
[0077] In the above embodiment, not all data are refreshed, but only the changed differential data are refreshed, so that the storage space occupied by the headlight animation is optimized through the efficient compression storage and fast refresh method, and the real-time refresh speed of the animation on the vehicle is improved, thereby improving the communication rate. The present application relates to the field of automobile technology, and in particular to an efficient compression storage and fast refresh method for headlight animation, which aims to optimize the storage space occupied by the headlight animation, and at the same time improve the real-time refresh speed of the animation on the vehicle, thereby enhancing the user experience.
[0078] In some scenarios, complex headlight animations often take up a lot of storage space after being parsed into LED particle mappings, and may encounter delay problems when refreshing in real time in the vehicle control system. The realization of headlight animation requires parsing each frame of LED particles to display brightness, which requires a relatively large access space. For example, there are 100 LEDs, and each LED needs to use one byte to represent the brightness at a certain moment. One frame of animation requires 100 bytes. If an animation has 100 frames, it will require nearly 1KB. On the other hand, the LED particles are refreshed at a fixed time, and each particle in each frame needs to be refreshed. The longer the animation, the higher the refresh rate, and the larger the space required, the higher the ROM requirement of the MCU, and the communication rate requirement also needs to increase. In the above embodiment, it is necessary to use an MCU with a large ROM and adopt a higher communication rate, which has a relatively high cost requirement for the product and poor stability.
[0079] This application proposes a method for data compression, dynamic framing, and differential refreshing when mapping animation data to particles, solving the problem of requiring large storage space and requiring high communication rates. The overall process is as follows Figure 4 The specific implementation method is as follows:
[0080] Data compression: Create a data structure, including a compression flag indicating whether to compress, the number of compressed data, and the value of the compressed data. Figure 4 The data structure shown in the figure. Among them, 0x0021 corresponds to Byte1-Byte0, indicating the value of compressed data; 0x8003 corresponds to Byte3-Byte2, including the flag indicating whether it is compressed and the number of compressed data; 0x8003 = 1000 0000 0000 0011, bit15 = 1 indicates that data compression exists, bit14-bit0 = 3, indicating that 3 data are compressed.
[0081] like Figure 5 As shown, Figure 5 It is an overall flow chart of the animation data refreshing method provided by this application.
[0082] Poll the data that needs to be compressed. If the current data is equal to the previous data, continue to query until the current data is unequal to the previous data. If the number of unequal data is greater than 2, record the current data and set the compression flag to 1; otherwise, do not compress, continue polling, and repeat the above polling steps until all data are polled and compressed.
[0083] For example, there is the following data:
[0084] [0x0021, 0x0021, 0x0021, 0x0183, 0x0183, 0x0142, 0x0142, 0x0142, 0x0142, 0x0142, 0x0142, 0x0142, 0x0142, 0x0021], there are three 0x0021 in the front, which can be compressed to 0x8003 0x0021; there are two 0x0183, which can be compressed to 0x8002 0x0183; there are eight 0x0142, which can be compressed to 0x8008 0x0142, and there is one 0x0021 at the end, which does not need to be compressed, and the data remains 0x0021.
[0085] The final compressed data becomes: [0x8003, 0x0021, 0x8002, 0x0183, 0x8008, 0x0142, 0x0021]. After compression, the space is only 50% of the original. As the number of repeated data increases, the compression ratio will be greater, and the space saved will be more considerable.
[0086] Dynamic framing: records the time interval from the current animation frame to the next animation frame. It does not use fixed time to divide the frames, but only divides the frames when the animation changes. For example, for a 10-second animation, with one frame every 50ms, it takes 200 frames to divide the frames at fixed intervals. If there is no change in the animation between the 200ms and the 1s, it is only necessary to record the time difference of 800ms between the 200ms frame and the 1s. It is only necessary to wait 800ms before refreshing the data at the 1s moment.
[0087] Differential refresh: Compare the difference between the current animation frame and the previous frame, and do not refresh the data without difference. For example, the previous frame refreshed LED1, LED5, LED8, and the current frame LED1, LED5, LED8, and LED13 need to be refreshed, then the data of LED1, LED5, and LED8 remain unchanged, and this refresh only needs to refresh the data of LED13.
[0088] In one embodiment, Figure 6 As shown, the present application also provides an animation data refreshing device, the device comprising:
[0089] A polling module 601 is used to poll the animation data, and compress the data in the animation data that is continuous and repeated for more than two times, until the polling is completed, to obtain compressed animation data;
[0090] A comparison module 602 is used to compare the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically divide the pictures in the area where the pictures change to obtain animation frames;
[0091] The refresh module 603 is used to compare the current animation frame with the previous animation frame, keep the data without difference as it is, and refresh the data with difference.
[0092] The specific definition of the animation data refreshing device can be found in the definition of the animation data refreshing method above, which will not be repeated here. Each module in the above data refreshing device can be implemented in whole or in part by software, hardware and a combination thereof. Each of the above modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to each of the above modules.
[0093] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Figure 7 As shown. The computer device includes a processor, a memory and a network interface connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store animation data related data. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a method for refreshing animation data is implemented.
[0094] Those skilled in the art will understand that Figure 7 The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.
[0095] In one embodiment, a computer device is also provided, including a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps in the above-mentioned method embodiments when executing the computer program. The animation data refreshing method includes: polling the animation data, compressing the data in the animation data continuously and repeatedly for more than two times until the polling is completed, and obtaining the compressed animation data; comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically dividing the picture in the area where the picture changes to obtain the animation frame; comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0096] In one embodiment, a computer-readable storage medium is provided, which stores a computer program, and when the computer program is executed by a processor, the steps in the above-mentioned method embodiments are implemented. The animation data refreshing method includes: polling the animation data, compressing the data in the animation data that is continuous and repeated more than twice, until the polling is completed, and obtaining the compressed animation data; comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically dividing the picture in the area where the picture changes to obtain the animation frame; comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0097] The present application also provides a computer program product, including a computer program or instruction, characterized in that the computer program or instruction, when executed by a processor, implements the steps of the method provided in any of the above embodiments. Among them, the animation data refreshing method includes: polling the animation data, compressing the data in the animation data that is continuous and repeated more than twice, until the polling is completed, and obtaining compressed animation data; comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically dividing the picture in the area where the picture changes to obtain the animation frame; comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0098] Some embodiments of the present application also provide a vehicle lamp, which includes the animation data refreshing method provided in any of the above embodiments. The method includes: polling the animation data, compressing the data in the animation data continuously and repeatedly for more than two times until the polling is completed, and obtaining the compressed animation data; comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically dividing the picture in the area where the picture changes to obtain the animation frame; comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0099] Some embodiments of the present application also provide a vehicle, the vehicle includes the headlight provided in any of the above embodiments, and the animation data refreshing method provided in any of the above embodiments. The method includes: polling the animation data, compressing the data in the animation data continuously and repeatedly for more than two times until the polling is completed, and obtaining the compressed animation data; comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and dynamically dividing the picture in the area where the picture changes to obtain the animation frame; comparing the current animation frame with the previous animation frame, keeping the data without difference as it is, and refreshing the data with difference.
[0100] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory or optical memory, etc. Volatile memory can include random access memory (RAM) or external cache memory. As an illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).
[0101] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.
[0102] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.
Claims
1. A method for refreshing animation data, characterized in that: The method comprises: Polling the animation data, compressing the data in the animation data that is continuous and repeated for more than two times, until the polling is completed, to obtain compressed animation data; Comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic frame division in the area where the picture changes to obtain the animation frame; The animation data of the current animation frame and the adjacent previous animation frame are compared, the same animation data in the current animation frame and the adjacent previous animation frame are kept as they are, and the animation data with differences are refreshed.
2. The method according to claim 1, characterized in that The method further comprises: A data structure is established for the animation data to be compressed, the data structure including a compression flag, the number of compressed data and the value of the compressed data, wherein the compression flag is used to identify whether the current data is compressed, the number of compressed data is used to identify the number of compressed repeated data, and the value of the compressed data is used to identify the compressed data itself.
3. The method according to claim 2, characterized in that The polling animation data compresses the data in the animation data continuously and repeatedly for more than two times until the polling is completed to obtain the compressed animation data, including: Polling the animation data, recording the data in the animation data that is continuous and repeated more than twice, marking the compression flag as 1, and recording the number of compressed data and the value of the compressed data; The compressed animation data is obtained based on the number of the compressed data and the value of the compressed data.
4. The method according to claim 1, characterized in that: The step of comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic frame division in the area where the picture changes to obtain the animation frame, includes: Compare the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, keep the unchanged part of the picture original until the picture changes or before the next animation frame starts, and perform dynamic frame division to obtain animation frames, and different animation frames correspond to different pictures.
5. The method according to claim 4, characterized in that The step of comparing the picture of the current animation frame in the compressed animation data with the picture of the adjacent previous animation frame, and performing dynamic frame division in the area where the picture changes to obtain the animation frame, includes: Comparing the picture of the current animation frame in the compressed animation data with the adjacent previous animation frame, recording the time points corresponding to the two animation frames where the picture changes, and determining the maximum time interval between the picture changes based on the time points; The compressed animation data is dynamically divided into frames based on the maximum time interval to obtain animation frames, and different animation frames include different picture information.
6. The method according to claim 5, characterized in that The animation frame includes animation data corresponding to a plurality of LEDs; The comparing the animation data of the current animation frame and the adjacent previous animation frame, keeping the same animation data in the current animation frame and the adjacent previous animation frame as is, and refreshing the animation data with differences, includes: The difference between the LED data included in the current animation frame and the LED data included in the previous animation frame is compared, and the LED data with the difference is refreshed.
7. A vehicle lamp, characterized in that: The vehicle lamp comprises the steps of the method according to any one of claims 1 to 6.
8. A vehicle, characterized in that: The vehicle comprises the steps of the method according to any one of claims 1 to 6 or the vehicle lamp according to claim 7.
9. A computer device, characterized in that: The method comprises a memory and a processor, wherein a computer program is stored in the memory, and the processor implements the steps of the method according to any one of claims 1 to 6 when executing the computer program.
10. A computer-readable storage medium, characterized in that: A computer program is stored, and when the computer program is executed by a processor, the steps of the method described in any one of claims 1 to 6 are implemented.