Video data encoding method and device, electronic equipment and medium

Abstract

Embodiments of the present disclosure disclose a video data encoding method and device, electronic equipment and computer readable medium. A specific embodiment of the method comprises: selecting a target number of image regions as target image regions from an image region queue based on a current bandwidth condition, each image region in the image region queue being arranged according to a quantization parameter score corresponding to each image region, the quantization parameter score being determined according to a spatial encoding complexity and a temporal encoding complexity corresponding to each image region; encoding the target image regions in a first encoding manner, and encoding the remaining image regions in the image region queue in a second encoding manner. This embodiment realizes maximum reduction of decoding delay without affecting data transmission, and optimizes the playing effect.

Description

Technical Field

[0001] Embodiments of this disclosure relate to the field of computer technology, and more particularly to video data encoding method apparatus, electronic devices, and computer-readable media. Background Technology

[0002] Related VR (virtual reality) video data transmission generally adopts a viewpoint-based data transmission method. Specifically, high-definition encoded data is provided for the main viewpoint, while low-definition encoded data is provided for other viewpoints. The advantage of this is that, since the encoding complexity and bitrate of low-definition data are relatively low, the decoding pressure and bandwidth requirements of the playback device can be reduced.

[0003] However, when using the above transmission method, the following technical problems often exist:

[0004] When the viewing angle changes, the playback device needs to retrieve the high-definition encoded data again and decode it again. Related video playback technologies include encoding with reference to the previous frame and keyframes, or encoding with reference to keyframes only. With the method of referencing the previous frame and keyframes, decoding requires waiting for all previous frames to be decoded before decoding can begin, resulting in significant decoding latency. While the encoding method that only references keyframes has shorter decoding latency, it leads to a substantial increase in bitrate, higher transmission costs, and a significantly higher demand for network bandwidth. Summary of the Invention

[0005] The summary section of this disclosure provides a brief overview of concepts that will be described in detail in the detailed description section below. This summary section is not intended to identify key or essential features of the claimed technical solutions, nor is it intended to limit the scope of the claimed technical solutions. Some embodiments of this disclosure provide video data encoding methods, data reading and writing methods, apparatuses, electronic devices, and computer-readable media to address one or more of the technical problems mentioned in the background section above.

[0006] In a first aspect, some embodiments of this disclosure provide a video data encoding method, including: selecting a target number of image regions as target image regions from an image region queue based on the current bandwidth, wherein each image region in the image region queue is arranged according to the quantization parameter score corresponding to each image region, and the quantization parameter score is determined based on the spatial encoding complexity and temporal encoding complexity corresponding to each image region; encoding the target image regions using a first encoding method; and encoding the remaining image regions in the image region queue using a second encoding method.

[0007] Secondly, some embodiments of this disclosure provide a video data encoding apparatus, including: a selection unit configured to select a target number of image regions as target image regions from an image region queue based on the current bandwidth, wherein each image region in the image region queue is arranged according to the quantization parameter score corresponding to each image region, and the quantization parameter score is determined based on the spatial encoding complexity and temporal encoding complexity corresponding to each image region; and an encoding unit configured to encode the target image regions using a first encoding method and to encode the remaining image regions in the image region queue using a second encoding method.

[0008] Thirdly, some embodiments of this disclosure provide an electronic device, including: one or more processors; and a storage device having one or more programs stored thereon, wherein when the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any implementation of the first or second aspect above.

[0009] Fourthly, some embodiments of this disclosure provide a computer-readable medium having a computer program stored thereon, wherein the program, when executed by a processor, implements the method described in any of the implementations of the first or second aspect above.

[0010] The above-described embodiments of this disclosure have the following beneficial effects: by dynamically selecting the encoding method according to the network bandwidth, the decoding latency is reduced to the minimum and the playback effect is optimized without affecting data transmission. Attached Figure Description

[0011] The above and other features, advantages, and aspects of the embodiments of this disclosure will become more apparent from the accompanying drawings and the following detailed description. Throughout the drawings, the same or similar reference numerals denote the same or similar elements. It should be understood that the drawings are schematic, and elements are not necessarily drawn to scale.

[0012] Figure 1 This is a schematic diagram illustrating the encoding of related video playback technologies using the LDP reference mode;

[0013] Figure 2 This is a flowchart of some embodiments of the video data encoding method according to the present disclosure;

[0014] Figure 3 This is an exemplary schematic diagram of multiple image regions corresponding to a video in the video data encoding method according to this disclosure;

[0015] Figure 4 This is a flowchart of some other embodiments of the video data encoding method according to the present disclosure;

[0016] Figure 5These are schematic diagrams illustrating the structure of some embodiments of the video data encoding apparatus according to the present disclosure;

[0017] Figure 6 This is a schematic diagram of the structure of an electronic device suitable for implementing some embodiments of the present disclosure. Detailed Implementation

[0018] Embodiments of this disclosure will now be described in more detail with reference to the accompanying drawings. While some embodiments of this disclosure are shown in the drawings, it should be understood that this disclosure can be implemented in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided to provide a more thorough and complete understanding of this disclosure. It should be understood that the accompanying drawings and embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of protection of this disclosure.

[0019] It should also be noted that, for ease of description, only the parts relevant to the invention are shown in the accompanying drawings. Unless otherwise specified, the embodiments and features described in this disclosure can be combined with each other.

[0020] It should be noted that the concepts of "first" and "second" mentioned in this disclosure are used only to distinguish different devices, modules or units, and are not used to limit the order of functions performed by these devices, modules or units or their interdependencies.

[0021] It should be noted that the terms "a" and "a plurality of" used in this disclosure are illustrative rather than restrictive, and those skilled in the art should understand that, unless otherwise expressly indicated in the context, they should be understood as "one or more".

[0022] The names of messages or information exchanged between multiple devices in the embodiments of this disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

[0023] This disclosure will now be described in detail with reference to the accompanying drawings and embodiments.

[0024] To better explain this disclosure, the encoding methods of the relevant video playback technologies will be explained first. Figure 1 A schematic diagram is shown illustrating the encoding of related video playback technologies using the LDP reference mode.

[0025] like Figure 1As shown, the image contains 5 frames numbered (POC) 1-5. POC1 is an I-frame (keyframe), and POCs 2-5 are P-frames (predicted frames). The arrows indicate the reference frame for encoding each frame. As shown, POC2 references an I-frame. POC3 references both an I-frame and POC2. POC4 references both an I-frame and POC3. POC5 references both an I-frame and POC4. In other words, in LDP reference mode, except for POC1 and POC2, all other frames reference both an I-frame and the previous frame. Therefore, during decoding at the playback end, it is necessary to wait for all preceding frames to be decoded before decoding can begin. Taking POC5 as an example, the decoding latency reaches 5 frames, which can easily cause excessively long video buffering times.

[0026] Continue to refer to Figure 2 The flowchart 200 illustrates some embodiments of a video data encoding method according to the present disclosure. The video data encoding method includes the following steps:

[0027] Step 201: Based on the current bandwidth, select a target number of image regions from the image region queue as target image regions.

[0028] In some embodiments, the execution entity of the video data encoding method can select a target number of image regions from the image queue as target image regions based on the current bandwidth. The image regions in the image queue are arranged according to the quantization parameter score corresponding to each image region. In practice, during video encoding, the video frame is often divided as needed, resulting in multiple image regions (tiles) corresponding to the video. The content of frames belonging to the same image region has a certain temporal correlation, which helps in the encoding process.

[0029] Figure 3 An exemplary schematic diagram of multiple image regions corresponding to a video is shown. Taking a video containing frame image 301 and frame image 302 as an example, image 301 can be divided into three rectangular regions vertically, namely rectangular regions 3011, 3012, and 3013. It can be understood that, as needed, the video can be flexibly divided into several rectangular regions horizontally and / or vertically. Similarly, frame image 302 can be divided to obtain rectangular regions 3021, 3022, and 3023. In practice, within a certain time range, the same division method is generally used. Based on this, rectangular regions at the same location in each frame image belong to the same image region. For example, rectangular region 3011 in frame image 301 and rectangular region 3021 in frame image 302 belong to the same image region. The video corresponds to three image regions. Based on this, encoding the content (rectangular regions) in each frame image corresponding to each image region yields the encoded data corresponding to that image region.

[0030] Within a certain time range, image regions corresponding to several video frames within that time range can be sorted according to their quantization parameter scores to obtain an image region queue. In practice, the time range can be flexibly determined; for example, the time interval corresponding to one or more video frame groups can be defined as the aforementioned time range. It should be noted that in practice, when preparing to encode the Nth video frame group, since it has not yet been encoded, the quantization parameter score of the Nth video frame group cannot be calculated. However, research has found that the (N-1)th video frame group generally changes very little because the time interval between it and the Nth video frame group is very short. Therefore, a target image region can be selected based on the (N-1)th video frame group, and then the Nth video frame group can be encoded. Furthermore, although this example uses sending one video frame group (GOP) at a time, it is understood that this disclosure also applies when transmitting in a packetized manner (each packet contains multiple video frame groups).

[0031] In some embodiments, the quantization parameter score for each image region can be determined based on the spatial coding complexity and temporal coding complexity corresponding to that image region. In practice, such as Figure 1 As shown, the frames corresponding to an image region can be divided into keyframes (I-frames), prediction frames (P-frames), etc., according to their different functions. Based on this, for a certain image region, the average quantization parameter (qp) of the keyframes in each frame corresponding to that image region can be determined first. I ) and the average quantization parameter (qp) of the predicted frame P Among them, the average quantization parameters of keyframes represent the time complexity, while the average quantization parameters of predicted frames represent the space complexity. In practice, when qp I The smaller the qp P A larger value indicates lower time complexity but higher space complexity. Using a full-reference encoding method that only references keyframes can reduce decoding latency without significantly increasing the bitrate. Therefore, the quantization parameter score (qpscore) of this image region can be calculated using the following formula: qpscore = qp P -qp I .

[0032] Building upon this, as an example, image regions can be sorted in descending order based on their quantization parameter scores to obtain a queue of image regions. Then, a target number of image regions are selected from the head of the queue as target image regions. Since the queue is sorted in descending order based on quantization parameter scores, the selected target image regions all have high quantization parameter scores. In other words, the target image regions represent lower time complexity but higher space complexity. Therefore, encoding these target image regions using a keyframe-only reference method can reduce decoding latency without significantly increasing the bitrate. The number of target regions can be specified or selected based on certain conditions. For example, a first value can be specified when bandwidth is sufficient, while a second value can be specified when bandwidth is insufficient.

[0033] Step 202: Encode the target image region using the first encoding method, and encode the remaining image regions in the image region queue using the second encoding method.

[0034] In some embodiments, the execution entity may encode the target image region using a first encoding method and encode the remaining image regions in the image region queue using a second encoding method. For example, the first encoding method may be a low-latency encoding method, such as an encoding method that only references keyframes. The second encoding method may be a low-latency encoding method, such as an encoding method that references the previous frame and keyframes.

[0035] In some embodiments, the video data encoding method provided in this disclosure dynamically selects the encoding method based on network bandwidth conditions, thereby minimizing decoding latency and optimizing playback effects without affecting data transmission.

[0036] Further reference Figure 4 This illustrates a flow 400 of another embodiment of the video data encoding method. Flow 400 of the video data encoding method includes the following steps:

[0037] Step 401: In response to the current bandwidth index meeting the preset conditions, the target number is obtained by incrementally increasing the historical number, and the target number of image regions are selected from the image region queue as target image regions, wherein the historical number is the number of image regions that were previously encoded using the first encoding method.

[0038] In some embodiments, the current bandwidth metric can be bandwidth latency duration. For example, the preset condition could be less than a duration threshold.

[0039] In some optional implementations of certain embodiments, the current bandwidth metric is calculated through the following steps: obtaining the current network latency and historical network latency; determining the rate of change of the current network latency relative to the historical network latency; and determining the rate of change as the current bandwidth metric. In these implementations, the rate of change can accurately measure network changes, allowing for corresponding adjustments to the encoding method to achieve better adaptive encoding. In this case, the preset condition can be less than a rate of change threshold. In practice, the current network latency can be the transmission latency of sending video data, which can be obtained by the difference between the sending and receiving times. The current network latency can be the most recently statistically recorded network latency. Historical network latency can be the second most recently statistically recorded network latency. Optionally, the current bandwidth metric can also be the difference between the current network latency and the historical network latency.

[0040] In some embodiments, in response to the current bandwidth indicator meeting a preset condition, indicating sufficient current bandwidth margin, the execution entity of the video data encoding method can increment the historical quantity (e.g., add one) to obtain the target quantity. Here, the historical quantity refers to the number of image regions previously encoded using the first encoding method. This allows for dynamic adjustment based on the historical quantity, better adapting to the current network bandwidth situation.

[0041] Step 402: In response to the current bandwidth index not meeting the preset conditions, the target number is obtained by decreasing the historical number, and the target number of image regions are selected from the image region queue as the target image regions.

[0042] In some embodiments, in response to the current bandwidth indicator not meeting preset conditions, indicating insufficient current bandwidth margin, the execution entity of the video data encoding method can subtract (e.g., subtract one) from the historical quantity to obtain the target quantity. This allows for dynamic adjustment based on the historical quantity, better adapting to the current network bandwidth situation.

[0043] Step 403: Encode the target image region using the first encoding method, and encode the remaining image regions in the image region queue using the second encoding method.

[0044] In some embodiments, the specific implementation of step 403 and its resulting technical effects can be found in [reference needed]. Figure 2 Step 202 in the corresponding embodiments will not be repeated here.

[0045] Figure 4 In the corresponding embodiments, the target number is obtained by dynamically adjusting the number of image regions previously encoded using the first encoding method. This allows for better adaptation to network conditions and enables adaptive adjustment of the target number.

[0046] Further reference Figure 5 As an implementation of the methods shown in the above figures, this disclosure provides some embodiments of a video data encoding apparatus, which are similar to... Figure 2 Corresponding to the method embodiments shown, the device can be specifically applied to various electronic devices.

[0047] like Figure 5 As shown, a video data encoding apparatus 500 in some embodiments includes a selection unit 501 and an encoding unit 502. The selection unit 501 is configured to select a target number of image regions from an image region queue as target image regions based on the current bandwidth. The image regions in the queue are arranged according to their quantization parameter scores, which are determined based on the spatial and temporal encoding complexity of each image region. The encoding unit 502 is configured to encode the target image regions using a first encoding method and to encode the remaining image regions in the image region queue using a second encoding method.

[0048] In some optional implementations of the embodiments, the selection unit 501 is further configured to: in response to the current bandwidth index meeting a preset condition, increment the historical quantity to obtain a target quantity, and select a target quantity of image regions from the image region queue as target image regions, wherein the historical quantity is the number of image regions previously encoded using the first encoding method.

[0049] In some optional implementations of embodiments, the selection unit 501 is further configured to: in response to the current bandwidth index not meeting the preset conditions, reduce the historical quantity to obtain the target quantity, and select the target quantity of image regions from the image region queue as the target image regions.

[0050] In some optional implementations of embodiments, the current bandwidth metric is calculated by the following steps: obtaining the current network latency and historical network latency; determining the rate of change of the current network latency relative to the historical network latency; and determining the rate of change as the current bandwidth metric.

[0051] It is understandable that the units described in the device 500 are related to the reference. Figure 2 The steps in the described method correspond accordingly. Therefore, the operations, features, and beneficial effects described above for the method also apply to the device 500 and the units contained therein, and will not be repeated here.

[0052] The following is for reference. Figure 6 It illustrates electronic devices suitable for implementing some embodiments of this disclosure (e.g., Figure 1 The structural diagram of the server (600) in the middle. Figure 6The electronic device shown is merely an example and should not be construed as limiting the functionality and scope of the embodiments of this disclosure.

[0053] like Figure 6 As shown, electronic device 600 may include a processing device (e.g., a central processing unit, a graphics processor, etc.) 601, which can perform various appropriate actions and processes according to a program stored in read-only memory (ROM) 602 or a program loaded from storage device 608 into random access memory (RAM) 603. RAM 603 also stores various programs and data required for the operation of electronic device 600. Processing device 601, ROM 602, and RAM 603 are interconnected via bus 604. Input / output (I / O) interface 605 is also connected to bus 604.

[0054] Typically, the following devices can be connected to I / O interface 605: input devices 606 including, for example, touchscreens, touchpads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, etc.; output devices 607 including, for example, liquid crystal displays (LCDs), speakers, vibrators, etc.; storage devices 608 including, for example, magnetic tapes, hard disks, etc.; and communication devices 609. Communication device 609 allows electronic device 600 to communicate wirelessly or wiredly with other devices to exchange data. Although Figure 6 An electronic device 600 with various devices is shown; however, it should be understood that it is not required to implement or possess all of the devices shown. More or fewer devices may be implemented or possessed alternatively. Figure 6 Each box shown can represent a device or multiple devices as needed.

[0055] In particular, according to some embodiments of this disclosure, the processes described above with reference to the flowcharts can be implemented as computer software programs. For example, some embodiments of this disclosure include a computer program product comprising a computer program carried on a computer-readable medium, the computer program containing program code for performing the methods shown in the flowcharts. In such embodiments, the computer program can be downloaded and installed from a network via a communication device 609, or installed from a storage device 608, or installed from a ROM 602. When the computer program is executed by the processing device 601, it performs the functions defined above in the methods of some embodiments of this disclosure.

[0056] It should be noted that, in some embodiments of this disclosure, the computer-readable medium may be a computer-readable signal medium or a computer-readable storage medium, or any combination thereof. A computer-readable storage medium may be, for example,—but not limited to—an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of a computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fiber, portable compact disk read-only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination thereof. In some embodiments of this disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In some embodiments of this disclosure, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium can be any computer-readable medium other than a computer-readable storage medium, which can send, propagate, or transmit a program for use by or in connection with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium can be transmitted using any suitable medium, including but not limited to: wires, optical fibers, RF (radio frequency), etc., or any suitable combination thereof.

[0057] In some implementations, clients and servers can communicate using any currently known or future-developed network protocol such as HTTP (Hypertext Transfer Protocol) and can interconnect with digital data communication (e.g., communication networks) of any form or medium. Examples of communication networks include local area networks (“LANs”), wide area networks (“WANs”), the Internet (e.g., the Internet of Things), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future-developed networks.

[0058] The aforementioned computer-readable medium may be included in the aforementioned electronic device; or it may exist independently and not assembled into the electronic device. The aforementioned computer-readable medium carries one or more programs that, when executed by the electronic device, cause the electronic device to: select a target number of image regions from an image region queue as target image regions based on the current bandwidth, wherein each image region in the image region queue is arranged according to the quantization parameter score corresponding to each image region, and the quantization parameter score is determined based on the spatial coding complexity and temporal coding complexity corresponding to each image region; encode the target image regions using a first coding method; and encode the remaining image regions in the image region queue using a second coding method.

[0059] Computer program code for performing operations of some embodiments of this disclosure can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, and conventional procedural programming languages ​​such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, as a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network—including a local area network (LAN) or a wide area network (WAN)—or can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0060] The flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of this disclosure. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions indicated in the blocks may occur in a different order than those indicated in the drawings. For example, two consecutively indicated blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in the block diagrams and / or flowcharts, and combinations of blocks in the block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or operation, or using a combination of dedicated hardware and computer instructions.

[0061] The units described in some embodiments of this disclosure can be implemented in software or in hardware. The described units can also be housed in a processor; for example, a processor may be described as including a selection unit and an encoding unit. The names of these units do not necessarily limit the unit itself; for example, a selection unit may also be described as "a unit that selects a target number of image regions as target image regions from an image region queue."

[0062] The functions described above in this document can be performed, at least in part, by one or more hardware logic components. For example, exemplary types of hardware logic components that can be used, without limitation, include: Field Programmable Gate Arrays (FPGAs), Application-Specific Integrated Circuits (ASICs), Application Standard Products (ASSPs), System-on-Chip (SoCs), Complex Programmable Logic Devices (CPLDs), and so on.

[0063] The above description is merely a selection of preferred embodiments of this disclosure and an explanation of the technical principles employed. Those skilled in the art should understand that the scope of the invention involved in the embodiments of this disclosure is not limited to technical solutions formed by specific combinations of the above-described technical features, but should also cover other technical solutions formed by arbitrary combinations of the above-described technical features or their equivalents without departing from the above-described inventive concept. For example, technical solutions formed by substituting the above-described features with (but not limited to) technical features with similar functions disclosed in the embodiments of this disclosure.

Claims

1. A method of encoding video data, the method comprising: The method comprises: selecting a target number of image regions as target image regions from the head of an image region queue based on current bandwidth conditions, each image region in the image region queue being arranged in descending order according to a quantization parameter score corresponding to each image region, and the target image regions being image regions with higher quantization parameter scores, the quantization parameter score being determined according to a spatial coding complexity and a temporal coding complexity corresponding to each image region; encoding the target image regions in a first encoding mode, and encoding the remaining image regions in the image region queue in a second encoding mode, the first encoding mode being an encoding mode with lower decoding latency, and the second encoding mode being an encoding mode with higher decoding latency.

2. The method of claim 1, wherein, The method of selecting a target number of image regions as target image regions from the head of an image region queue based on current bandwidth conditions comprises: in response to the current bandwidth indicator meeting a preset condition, increasing a historical number to obtain the target number, and selecting a target number of image regions as target image regions from the head of the image region queue, wherein the historical number is the number of image regions encoded in the first encoding mode last time.

3. The method of claim 2, wherein, The method of selecting a target number of image regions as target image regions from the head of an image region queue based on current bandwidth conditions comprises: in response to the current bandwidth indicator not meeting a preset condition, decreasing the historical number to obtain the target number, and selecting a target number of image regions as target image regions from the head of the image region queue.

4. The method of claim 2, wherein, The current bandwidth indicator is calculated by the following steps: obtaining a current network latency and a historical network latency; determining a change rate of the current network latency relative to the historical network latency; determining the change rate as the current bandwidth indicator.

5. The method of claim 1, wherein, The first encoding mode is an encoding mode that only references key frames, and the second encoding mode is an encoding mode that references key frames and previous frames.

6. A video data encoding device, comprising: The method comprises: a selecting unit configured to select a target number of image regions as target image regions from the head of an image region queue based on current bandwidth conditions, each image region in the image region queue being arranged in descending order according to a quantization parameter score corresponding to each image region, and the target image regions being image regions with higher quantization parameter scores, the quantization parameter score being determined according to a spatial coding complexity and a temporal coding complexity corresponding to each image region; an encoding unit configured to encode the target image regions in a first encoding mode, and encode the remaining image regions in the image region queue in a second encoding mode, the first encoding mode being an encoding mode with lower decoding latency, and the second encoding mode being an encoding mode with higher decoding latency.

7. The apparatus of claim 6, wherein, The selecting unit is configured to: in response to the current bandwidth indicator meeting a preset condition, increase a historical number to obtain the target number, and select a target number of image regions as target image regions from the head of the image region queue, wherein the historical number is the number of image regions encoded in the first encoding mode last time.

8. The apparatus of claim 7, wherein, The selecting unit is configured to: In response to the current bandwidth index not satisfying the preset condition, the target quantity is obtained by decreasing the historical quantity, and a target quantity of image regions are selected from the head of the image region queue as target image regions. 9.An electronic device, comprising: one or more processors; a memory device having stored thereon one or more programs, when the one or more programs are executed by the one or more processors, the one or more processors implement the method of any one of claims 1-5.

10. A computer readable medium having stored thereon a computer program, wherein, The program is executed by the processor to implement the method of any one of claims 1-5. The program is executed by the processor to implement the method of any one of claims 1-5.

Images