Marathon timing score real-time acquisition and processing analysis method and device

Abstract

The invention discloses a marathon timing score real-time acquisition and processing analysis method and device. The method comprises the following steps: establishing a marathon player historical database, a match information table, a point location ranking table and a task table; wherein the task table at least comprises a first task instruction, a second task instruction and a third task instruction; during a game, data of players are transmitted to the cloud service terminal through the sensor; the first task instruction circularly sends a score obtaining request to the cloud service terminal, and matches scores of all players in each cycle interval with information of players in a local database; after matching is completed, the data are issued to a live broadcast platform background database and the like. According to the distributed multi-table and multi-task management mode provided by the invention, the conditions of database table locking and single host breakdown are effectively reduced, the tasks with problems can be monitored in real time, the faults can be timely processed, and live broadcast accidents are prevented.

Description

Technical Field

[0001] The present invention relates to the technical field of real-time collection of marathon data, and in particular to a method and device for real-time collection, processing and analysis of marathon timing results. Background Art

[0002] In marathon events, timing chips, sensors and radio frequency identification systems have been widely used to collect athletes' chip scores in real time on the marathon track, to help the referee team obtain the athletes' accurate scores in time after the game and officially release them. In past marathon live broadcasts, the live broadcast team could only obtain the scores from the referee team through WeChat, fax, and email, and then the subtitlers would have to process them twice before they could be released, which was inefficient. Summary of the invention

[0003] In view of this, the purpose of the present invention is to propose a method for real-time collection, processing and analysis of marathon timing results, which can utilize the data processing and analysis system to efficiently analyze and process the big data obtained from chip companies to assist marathon event live broadcast personnel in obtaining real-time and accurate data and convey more effective information to the audience.

[0004] According to one aspect of the present invention, a method for real-time collection, processing and analysis of marathon timing results is provided, the method comprising:

[0005] Establishing a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction;

[0006] During the competition, the player's data is transmitted to the cloud service terminal through the sensor; the first task instruction sends a score acquisition request to the cloud service terminal in a loop, matches the scores of all players in each cycle interval with the player information in the local database; after the matching is completed, the data is sent to the live broadcast platform backend database;

[0007] The backend database executes the second task instruction and the third task instruction to respectively update the data of the competition information table and the data of the point ranking table in real time;

[0008] The results obtained by executing the first task instruction, the second task instruction, and the third task instruction are displayed in real time in a visual manner.

[0009] In the above technical scheme, the marathon live broadcast athlete performance collection system proposed in this case aims to achieve efficient collection, statistical analysis and prediction of various points and athlete information on the marathon track through the comprehensive use of big data visualization technology. The system greatly enhances the real-time information grasping ability of the live broadcast personnel by intuitively displaying the performance information in the form of charts or maps, and at the same time provides the audience with a more intuitive way to understand the game, significantly improving the viewing experience. In the early stage of system design, through multiple tests of actual competitions, it was found that the original programming framework had the problem of database table deadlock. This phenomenon is mainly due to the fact that after the data is acquired and inserted into the table, multiple tasks simultaneously operate and update different fields of the same data, including ranking, query, calculation of difference and pace and other functions. In addition, the original data may be updated again due to correction, further increasing the risk of deadlock. Although this problem can be alleviated by sending or pausing other tasks multiple times, this will undoubtedly seriously affect the efficiency and speed of data processing, and thus affect the timely acquisition of data by the live broadcast personnel. In order to solve the above problems, the present invention innovatively adopts the method of allocating multi-table multi-task management, which effectively reduces the risk of database table deadlock and the possibility of a single host crash. The system can monitor and handle problematic tasks in real time, ensuring that faults are handled promptly, thereby preventing unexpected situations during the live broadcast and ensuring the smoothness and stability of the live broadcast.

[0010] In some embodiments, the backend database updates the data in the game information table by executing the second task instruction, specifically:

[0011] The backend database executes the second task instruction to filter out the farthest point and the current best score of the point from the obtained player scores in all legal data of the points, and updates them to the competition information table.

[0012] In the above technical solution, when performing a query operation, only the score table is accessed, and no write or update operations are performed on the task one score table. In addition, all update operations are performed specifically on the event table to ensure that when the data panel is refreshed, the ranking and best results always reflect the latest data points. This process is designed to maintain data consistency and real-time, while avoiding accidental modifications to the original data during the query process.

[0013] In some embodiments, the backend database updates the data in the point ranking table by executing the third task instruction, specifically:

[0014] The backend database counts the scores of the players at each check-in point by executing the third task instruction, calculates the average pace of each stage, calculates the score after the finish line based on the average pace, and updates it to the point ranking table.

[0015] In the above technical solution, in order to ensure that the performance table of Task 1 is not disturbed, this case designs and implements the point performance table and the point number table. The creation of these tables aims to achieve cross-table data updates through inline tables, thereby effectively avoiding deadlock problems. Specifically, through the mechanism of inline tables, real-time data updates can be achieved without triggering deadlocks. In addition, each table can be updated by an independent task thread. This design not only improves the parallelism of data operations, but also enhances the stability and response speed of the system. Through this multi-threaded parallel update strategy, the consistency and integrity of the data can be ensured, while avoiding deadlock problems that may occur in high-concurrency scenarios.

[0016] In some embodiments, the backend database updates the data in the point ranking table by executing the third task instruction, further comprising:

[0017] The backend database ranks the legal scores of the players at each check-in point at the current time by executing the third task instruction, and calculates the difference between the check-in score at this point and the first place.

[0018] In the above technical solution, in order to prevent the deadlock phenomenon in the score table and other related tables during concurrent calculations, this case adopts an innovative data structure design strategy. Specifically, by creating a point ranking table, the table aims to count the rankings of the players at each point and the difference between them and the first-ranked player. This design not only ensures the independence of the operation, but also effectively reduces the probability of deadlock by reducing the dependencies between different data tables. The introduction of the point ranking table realizes the logical separation of data, so that the ranking calculation of each point can be performed independently of the main score table. This design not only improves the efficiency of data processing, but also ensures that in a high-concurrency environment, each computing task can be executed in parallel without interfering with each other. In addition, by recording the difference with the first-place player, the table also facilitates further data analysis and comparison, and enhances the readability and practicality of the data.

[0019] According to another aspect of the present invention, a device for real-time collection, processing and analysis of marathon timing results is provided, comprising:

[0020] A construction module is used to establish a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction;

[0021] The acquisition module is used for transmitting the data of the players to the cloud service terminal through the sensor during the competition; the first task instruction sends a request for obtaining scores to the cloud service terminal in a loop, matches the scores of all players in each cycle interval with the information of the players in the local database; after the matching is completed, it is sent to the background database of the live broadcast platform through the API;

[0022] An analysis module is used for the backend database to update the data of the competition information table and the data of the point ranking table in real time by executing the second task instruction and the third task instruction respectively;

[0023] The visualization module is used to display the results obtained based on the first task instruction, the second task instruction, and the third task instruction in real time in a visualized manner.

[0024] In the above technical solution, in order to better use the above method, the present application proposes a device for real-time collection, processing and analysis of marathon timing results. Each module corresponds to each step of the above method. The specific principles have been described above and will not be repeated here.

[0025] According to another aspect of the present invention, a device for real-time collection, processing and analysis of marathon timing results is provided, comprising:

[0026] at least one processor and a memory communicatively coupled to the at least one processor;

[0027] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can perform the above method.

[0028] In the above technical solution, in order to better run and process the method, the above method is stored in a memory, and the stored method is executed by a processor. It should be noted that the principle and effect of each step have been described above and will not be described in detail here.

[0029] According to another aspect of the present invention, a computer-readable storage medium is provided, storing a computer program, wherein the computer program implements the above method when executed by a processor.

[0030] In the above technical solution, in order to better run and use the method, the above method is stored in a computer-readable storage medium, and the above method is implemented using a processor. It should be noted that the principle and effect of each step have been described above and will not be described in detail here. BRIEF DESCRIPTION OF THE DRAWINGS

[0031] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0032] Figure 1It is a flow chart of an embodiment of a method for real-time collection and processing and analysis of marathon timing results of the present invention;

[0033] Figure 2 It is an algorithm logic diagram of an embodiment of a method for real-time collection and processing and analysis of marathon timing results of the present invention;

[0034] Figure 3 The present invention is a schematic structural diagram of an embodiment of a device for real-time collection, processing and analysis of marathon timing results. DETAILED DESCRIPTION

[0035] The present invention will be further described in detail below in conjunction with the accompanying drawings and examples. It is particularly noted that the following examples are only used to illustrate the present invention, but are not intended to limit the scope of the present invention. Similarly, the following examples are only partial embodiments of the present invention rather than all embodiments, and all other embodiments obtained by those of ordinary skill in the art without creative work are within the scope of protection of the present invention.

[0036] The present invention provides a method for real-time collection, processing and analysis of marathon timing results, which can utilize a data processing and analysis system to efficiently analyze and process big data acquired from chip companies to assist marathon event live broadcast personnel in acquiring real-time and accurate data and convey more effective information to the audience.

[0037] Embodiment 1

[0038] See also Figure 1 , a method for real-time collection and processing and analysis of marathon timing results, the method comprising:

[0039] A. Establish a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction;

[0040] B. During the competition, the player's data is transmitted to the cloud service terminal through the sensor; the first task instruction sends a score acquisition request to the cloud service terminal in a loop, matching the scores of all players in each cycle interval with the player information in the local database; after the matching is completed, the data is sent to the live broadcast platform backend database;

[0041] C. The backend database executes the second task instruction and the third task instruction to respectively update the data of the competition information table and the data of the point ranking table in real time;

[0042] In this embodiment, the background database updates the data of the competition information table by executing the second task instruction. Specifically, the background database filters out the farthest point in all legal data points and the current best score of the point from the obtained player scores by executing the second task instruction, and updates them to the competition information table. When performing a query operation, it is limited to accessing the score table, and no write or update operation is performed on the task one score table. In addition, all update operations are performed specifically on the event table to ensure that when the data panel is refreshed, the ranking and best score always reflect the latest data points. This process is designed to maintain data consistency and real-time performance, while avoiding unexpected modifications to the original data during the query process.

[0043] In this embodiment, the backend database updates the data of the point ranking table by executing the third task instruction. Specifically, the backend database counts the scores of each punch-in point of the contestants by executing the third task instruction, calculates the average pace of each stage, and calculates the score after the finish line according to the average pace, and updates it to the point ranking table. In order to ensure that the score table of task one is not disturbed, this case designs and implements the point score table and the point number table. The creation of these tables is intended to achieve cross-table data updates through inline tables, thereby effectively avoiding deadlock problems. Specifically, through the mechanism of inline tables, real-time data updates can be achieved without triggering deadlock. In addition, each table can be updated by an independent task thread. This design not only improves the parallelism of data operations, but also enhances the stability and response speed of the system. Through this multi-threaded parallel update strategy, the consistency and integrity of the data can be ensured, while avoiding the deadlock problem that may occur in high concurrency scenarios.

[0044] In this embodiment, the backend database updates the data of the point ranking table by executing the third task instruction, and also includes: the backend database ranks the legal scores of the players at each point at the current time by executing the third task instruction, and calculates the difference between the score of this point and the first place. In order to prevent the deadlock phenomenon in the score table and other related tables during the concurrent operation, this case adopts an innovative data structure design strategy. Specifically, by creating a point ranking table, the table aims to count the ranking of the players at each point and the difference between them and the first-ranked player. This design not only ensures the independence of the operation, but also effectively reduces the probability of deadlock by reducing the dependency between different data tables. The introduction of the point ranking table realizes the logical separation of data, so that the ranking calculation of each point can be performed independently of the main score table. This design not only improves the efficiency of data processing, but also ensures that in a high-concurrency environment, each computing task can be executed in parallel without interfering with each other. In addition, by recording the difference with the first-place player, the table also facilitates further data analysis and comparison, and enhances the readability and practicality of the data.

[0045] D. Displaying the results obtained by executing the first task instruction, the second task instruction, and the third task instruction in real time in a visual manner.

[0046] In this embodiment, the marathon live broadcast athlete performance collection system proposed in this case aims to achieve efficient collection, statistical analysis and prediction of various points and athlete information on the marathon track through the comprehensive use of big data visualization technology. The system greatly enhances the real-time information grasping ability of the live broadcast personnel by intuitively displaying the performance information in the form of charts or maps, and at the same time provides the audience with a more intuitive way to understand the game, significantly improving the viewing experience. In the early stage of system design, through multiple tests of actual competitions, it was found that the original programming framework had a database table deadlock problem. This phenomenon is mainly due to the fact that after the data is acquired and inserted into the table, multiple tasks simultaneously operate and update different fields of the same data, including ranking, query, calculation of difference and pace functions. In addition, the original data may be updated again due to correction, further increasing the risk of deadlock. Although this problem can be alleviated by sending or pausing other tasks multiple times, this will undoubtedly seriously affect the efficiency and speed of data processing, and thus affect the timely acquisition of data by the live broadcast personnel. In order to solve the above problems, the present invention innovatively adopts a method of allocating multi-table multi-task management, which effectively reduces the risk of database table deadlock and the possibility of a single host crash. The system can monitor and handle problematic tasks in real time, ensuring that faults are handled promptly, thereby preventing unexpected situations during the live broadcast and ensuring the smoothness and stability of the live broadcast.

[0047] In order to better explain the method of this embodiment, the following will be described in detail:

[0048] See also Figure 2 The specific process of the method in this embodiment is as follows:

[0049] S1, establish the event database, create the competition information table, results table, ranking table, track point table, point number table, point ranking table, point results table and task table, etc., obtain the competition number, competition start time, player registration information and previous competition records. And the detailed data of outstanding players (including personal best and awards to match the sports data of the players in this event, and also as reference data in the live broadcast), and write the point information of each stage into the database.

[0050] S2, transmitted to the cloud service terminal through the sensor device and then sent to the live platform backend through the API. In step S2, the process of sending to the live platform database according to the cloud server requires the following steps:

[0051] S21. Before the competition, you must first obtain the competition registration information, including the competition venue, competition start time, player registration information and previous competition records.

[0052] S22, Task 1 in the task table is used by the host to cyclically send a request to obtain the scores, match the scores of all players in each cycle interval with the player information in the local database one by one, and use the algorithm to determine whether there are any omissions in the player, label it as illegal data, exclude it in subsequent steps, and then insert it into the database form. If there are serious errors in the data, the complete data will be obtained again and re-entered into the database.

[0053] S3, process and analyze the event data in the background database, such as the current overall ranking, domestic player ranking, the pace of each stage, the full pace, and compare it with the player's pace in past events, and predict the player's final score in this event. In order to ensure that the database does not deadlock and the host program does not freeze, a multi-table multi-task management solution is adopted, and the database task table is used to allocate multiple hosts to execute multiple processes. In step S3, processing and analyzing event data includes the following steps:

[0054] S31, through the task 2 assigned by the task table, the farthest point in all legal data of points and the current best score of the point are filtered out from the obtained player scores, written into the table, and updated to the competition information table.

[0055] S32, Task 3 assigned in the task list is to collect statistics on the results of each check-in point, calculate the average pace of each stage, and predict the results after the finish line based on this pace, and update it to the point ranking table at one time

[0056] S33, Task 3 assigned by the task list is to rank the legal scores of the players at each check-in point at the current time, and calculate the difference between the score at this check-in point and the first place.

[0057] S4, presents all data to the live broadcast staff in a reasonable and effective manner on the data visualization platform.

[0058] Based on the above examples, the present invention has the following advantages:

[0059] 1. The system for collecting athlete performance based on live broadcast of marathon provided by the present invention collects, counts, analyzes and predicts the results of information of various points on the marathon track and athletes, and displays the performance information in the form of charts or maps through big data visualization technology, so that the live broadcast personnel can grasp more detailed and specific information, and the audience can understand the competition situation more intuitively, thereby improving the viewing experience.

[0060] 2. The method of allocating multi-table and multi-task management provided by the present invention effectively reduces the situations of database table locking and single host crash, can monitor the tasks with problems in real time, ensure that the faults can be handled in time, and prevent accidents in live broadcast.

[0061] 3. The method and system of the present invention make full use of the big data of the athletes' movement status collected from the marathon track, so that it can be further promoted to the application of various competitions.

[0062] Embodiment 2

[0063] See also Figure 3 , a device for real-time collection and processing and analysis of marathon timing results, comprising:

[0064] A construction module is used to establish a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction;

[0065] The acquisition module is used for transmitting the data of the players to the cloud service terminal through the sensor during the competition; the first task instruction sends a request for obtaining scores to the cloud service terminal in a loop, matches the scores of all players in each cycle interval with the information of the players in the local database; after the matching is completed, it is sent to the background database of the live broadcast platform through the API;

[0066] An analysis module is used for the backend database to update the data of the competition information table and the data of the point ranking table in real time by executing the second task instruction and the third task instruction respectively;

[0067] The visualization module is used to display the results obtained based on the first task instruction, the second task instruction, and the third task instruction in real time in a visualized manner.

[0068] In this embodiment, the analysis module is also used to: execute the second task instruction to filter out the farthest point in all legal data points and the current best score of the point from the obtained player scores, and update them to the competition information table. When performing a query operation, it is limited to accessing the score table, and no write or update operation is performed on the task one score table. In addition, all update operations are performed specifically on the event table to ensure that when the data panel is refreshed, the ranking and best score always reflect the latest data points. This process is designed to maintain data consistency and real-time performance, while avoiding unexpected modifications to the original data during the query process.

[0069] In this embodiment, the analysis module is also used to: execute the third task instruction to count the scores of each check-in point of the contestants, calculate the average pace of each stage, and calculate the score after the finish line based on the average pace, and update it to the point ranking table. In order to ensure that the score table of task one is not interfered with, this case designs and implements the point score table and the point number table. The creation of these tables is intended to achieve cross-table data updates through inline tables, thereby effectively avoiding deadlock problems. Specifically, through the mechanism of inline tables, real-time data updates can be achieved without triggering deadlocks. In addition, each table can be updated by an independent task thread. This design not only improves the parallelism of data operations, but also enhances the stability and response speed of the system. Through this multi-threaded parallel update strategy, the consistency and integrity of the data can be ensured, while avoiding deadlock problems that may occur in high-concurrency scenarios.

[0070] In this embodiment, the analysis module is also used to: execute the third task instruction to rank the legal scores of the players at each point at the current time, and calculate the difference between the score of this point and the first place. In order to prevent the deadlock phenomenon in the score table and other related tables during the concurrent operation, this case adopts an innovative data structure design strategy. Specifically, by creating a point ranking table, the table is intended to count the ranking of the players at each point and the difference between them and the first-ranked player. This design not only ensures the independence of the operation, but also effectively reduces the probability of deadlock by reducing the dependencies between different data tables. The introduction of the point ranking table realizes the logical separation of data, so that the ranking calculation of each point can be performed independently of the main score table. This design not only improves the efficiency of data processing, but also ensures that in a high-concurrency environment, each computing task can be executed in parallel without interfering with each other. In addition, by recording the difference with the first-place player, the table also facilitates further data analysis and comparison, and enhances the readability and practicality of the data.

[0071] In this embodiment, in order to better use the method described in one of the embodiments, the present application proposes a device for real-time collection and processing and analysis of marathon timing results. Each module corresponds to each step of the above method. The specific principles have been described above and will not be repeated here.

[0072] Embodiment 3

[0073] A device for real-time collection, processing and analysis of marathon timing results, comprising:

[0074] at least one processor and a memory communicatively coupled to the at least one processor;

[0075] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method described in one of the embodiments.

[0076] In this embodiment, in order to better run and process the method described in one of the embodiments, the above method is stored in a memory, and a processor is used to execute the stored method. It should be noted that the principle and effect of each step have been described above and will not be described in detail here.

[0077] Embodiment 4

[0078] A computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the method described in one of the embodiments is implemented.

[0079] In this embodiment, in order to better run and use the method described in one of the embodiments, the method is stored in a computer-readable storage medium and implemented by a processor. It should be noted that the principle and effect of each step have been described above and will not be described in detail here.

[0080] The above descriptions are only some embodiments of the present invention, and are not intended to limit the protection scope of the present invention. Any equivalent device or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.

Claims

1. A method for real-time collection and processing and analysis of marathon timing results, characterized in that: The method comprises: Establishing a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction; During the competition, the player's data is transmitted to the cloud service terminal through the sensor; the first task instruction sends a score acquisition request to the cloud service terminal in a loop, matches the scores of all players in each cycle interval with the player information in the local database; after the matching is completed, the data is sent to the live broadcast platform backend database; The backend database executes the second task instruction and the third task instruction to respectively update the data of the competition information table and the data of the point ranking table in real time; The results obtained by executing the first task instruction, the second task instruction, and the third task instruction are displayed in real time in a visual manner.

2. A method for real-time collection and processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The backend database updates the data in the competition information table by executing the second task instruction, specifically: The backend database executes the second task instruction to filter out the farthest point and the current best score of the point from the obtained player scores in all legal data of the points, and updates them to the competition information table.

3. The method for real-time collection and processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The backend database updates the data in the point ranking table by executing the third task instruction, specifically: The backend database counts the scores of the players at each check-in point by executing the third task instruction, calculates the average pace of each stage, calculates the score after the finish line based on the average pace, and updates it to the point ranking table.

4. The method for real-time collection and processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The backend database updates the data in the point ranking table by executing the third task instruction, and also includes: The backend database ranks the legal scores of the players at each check-in point at the current time by executing the third task instruction, and calculates the difference between the check-in score at this point and the first place.

5. A device for real-time collection, processing and analysis of marathon timing results, characterized in that: Included in sequence: A construction module is used to establish a marathon runner history database, as well as a competition information table, a point ranking table, and a task table; wherein the task table at least includes: a first task instruction, a second task instruction, and a third task instruction; The acquisition module is used for transmitting the data of the players to the cloud service terminal through the sensor during the competition; the first task instruction sends a request for obtaining scores to the cloud service terminal in a loop, matches the scores of all players in each cycle interval with the information of the players in the local database; after the matching is completed, it is sent to the background database of the live broadcast platform through the API; An analysis module is used for the backend database to update the data of the competition information table and the data of the point ranking table in real time by executing the second task instruction and the third task instruction respectively; The visualization module is used to display the results obtained based on the first task instruction, the second task instruction, and the third task instruction in real time in a visualized manner.

6. The device for real-time collection and processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The analysis module is also used for: The second task instruction is executed to filter out the farthest point and the current best score of the point from all the legal data of the points of the obtained players, and update them to the competition information table.

7. The device for real-time collection and processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The analysis module is also used for: Execute the third task instruction to count the scores of the players at each check-in point, calculate the average pace of each stage, calculate the score after the finish line based on the average pace, and update it to the point ranking table.

8. The device for real-time collection, processing and analysis of marathon timing results as claimed in claim 1, characterized in that: The analysis module is also used for: The third task instruction is executed to rank the valid scores of the players at each check-in point at the current time, and the difference between the check-in score at this point and the first place is calculated.

9. A device for real-time collection and processing and analysis of marathon timing results, characterized in that: include: at least one processor and a memory communicatively coupled to the at least one processor; The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the method as claimed in any one of claims 1 to 4.

10. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.

Images