WO2021185022A1 - 编码模式的确定方法、装置、设备和存储介质 - Google Patents

编码模式的确定方法、装置、设备和存储介质 Download PDF

Info

Publication number
WO2021185022A1
WO2021185022A1 PCT/CN2021/077148 CN2021077148W WO2021185022A1 WO 2021185022 A1 WO2021185022 A1 WO 2021185022A1 CN 2021077148 W CN2021077148 W CN 2021077148W WO 2021185022 A1 WO2021185022 A1 WO 2021185022A1
Authority
WO
WIPO (PCT)
Prior art keywords
coding
cost
under
unit
encoding
Prior art date
Application number
PCT/CN2021/077148
Other languages
English (en)
French (fr)
Inventor
崔同兵
Original Assignee
百果园技术(新加坡)有限公司
崔同兵
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 百果园技术(新加坡)有限公司, 崔同兵 filed Critical 百果园技术(新加坡)有限公司
Publication of WO2021185022A1 publication Critical patent/WO2021185022A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/146—Data rate or code amount at the encoder output
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter

Definitions

  • This application relates to the field of video coding technology, for example, to a method, device, device, and storage medium for determining a coding mode.
  • Video coding usually uses Coding Unit (CU) as the basic unit for coding.
  • the coding unit CU has four sizes of 64*64, 32*32, 16*16 and 8*8, which are all required in the video coding process.
  • CU Coding Unit
  • the coding unit CU has four sizes of 64*64, 32*32, 16*16 and 8*8, which are all required in the video coding process.
  • 64*64 size CU to 8*8 size CU a quadtree recursive attempt is made to select the encoding size under the optimal efficiency.
  • the recursion depth of 64*64 size CU is 0, and each direction
  • the depth of the next recursion is increased by 1
  • the recursion depth of the 8*8 size CU is 3, and at each recursion depth, the encoding cost of the current non-recursive CU is divided by the current CU after the recursion.
  • the sum of the coding costs of the small CUs is compared to determine whether
  • Each CU usually includes two parts: Transform Unit (TU) and Prediction Unit (PU).
  • TU takes into account the impact of video coding rate and distortion and performs basic rate-distortion optimization (Rate Distortion Optimization, RDO).
  • RDO Rate Distortion Optimization
  • the PU tries to calculate the encoding cost under the RDO process after the CU is recursively divided into multiple TUs in different prediction modes; exemplary, the PU tries to perform the encoding cost in each prediction mode (such as MERGE/SKIP/2Nx2N/BIDIR/2NxN/ Nx2N/2NxnD/2NxnU/nRx2N/nLx2N/Intra2Nx2N/IntraNxN (12 kinds), obtain the prediction data during the execution of TU, and then transform, quantize and entropy the calculated residual data to obtain the coding code in the current prediction mode At the same time, the quantized residual data is inversely quantized and inversely transformed to obtain the
  • This application provides a method, device, equipment, and storage medium for determining an encoding mode, which reduces the computational overhead of video encoding and ensures the adaptability of the video encoding mode.
  • a method for determining an encoding mode includes:
  • the coding unit and the transformation unit under the same coding specification are sequentially integrated for cost optimization, and the overall coding mode under the integrated coding cost is obtained.
  • An apparatus for determining an encoding mode which includes:
  • An encoding division module configured to divide the encoding unit under each encoding specification into a transformation unit under the next encoding specification adjacent to the encoding specification, and calculate the encoding cost of each transformation unit;
  • the coding mode optimization module is set to sequentially perform cost optimization and integration of coding units and transformation units under the same coding specification to obtain an overall coding mode at the integrated coding cost.
  • a device which includes:
  • One or more processors are One or more processors;
  • Storage device set to store one or more programs
  • the one or more processors When the one or more programs are executed by the one or more processors, the one or more processors implement the encoding mode determination method described in any embodiment of the present application.
  • a computer-readable storage medium which stores a computer program, and when the computer program is executed by a processor, the method for determining the encoding mode described in any embodiment of the present application is implemented.
  • FIG. 1A is a flowchart of a method for determining a coding mode according to Embodiment 1 of the application;
  • FIG. 1B is a schematic diagram of the principle of the encoding mode determination process provided in Embodiment 1 of this application;
  • FIG. 2A is a flowchart of a method for determining a coding mode provided in Embodiment 2 of this application;
  • 2B is a schematic diagram of the principle of cost-optimized integration of coding units and transformation units under the same coding specification in the method provided in the second embodiment of this application;
  • FIG. 3 is a schematic structural diagram of an apparatus for determining a coding mode provided in Embodiment 3 of the present application;
  • FIG. 4 is a schematic structural diagram of a device provided in Embodiment 4 of this application.
  • FIG. 1A is a flowchart of a method for determining an encoding mode according to Embodiment 1 of the application.
  • This embodiment may be applicable to a scene where there is an encoding requirement for any video.
  • the method for determining the encoding mode provided in this embodiment may be executed by the apparatus for determining the encoding mode provided in the embodiments of this application.
  • the apparatus may be implemented by software and/or hardware, and is integrated in the device that executes the method.
  • the device can be a background server participating in video data interaction.
  • the method may include the following steps.
  • video coding is usually performed with a coding unit CU as the basic unit.
  • the coding specification in this embodiment refers to the size included in the existing coding unit CU.
  • the coding unit CU has 64*64, For the four encoding specifications of 32*32, 16*16 and 8*8, in the video encoding process, it is necessary to start from the encoding unit under the largest encoding specification, and continue to try quadtree recursion until it recurses to the encoding under the smallest encoding specification. In each coding specification, the coding unit with the best efficiency is selected from the coding units before and after the recursion.
  • a corresponding coding unit is selected under each coding specification, and a corresponding coding unit is selected for each coding unit.
  • the coding units under the encoding specifications are divided accordingly. At this time, since there is a corresponding proportional relationship between the coding specifications, as shown in FIG.
  • this embodiment can divide the coding units under each coding specification into the code
  • calculating the coding cost of each transformation unit in this embodiment may include: calculating the coding cost of each transformation unit in an all-zero block coding manner.
  • the all-zero block coding method enables the transformation unit divided by the coding unit to perform the rate distortion optimization (Rate Distortion Optimization, RDO) process when multiple coefficients are all zero, thereby greatly reducing the computational complexity of the coding cost and improving The computational efficiency of the coding cost.
  • video coding usually uses an encoder in the YUV420 format.
  • the coding cost under the three components of Y, U and V will be calculated by itself. At this time, it may It will fall into the situation of local optimization.
  • the overall coding cost is calculated once. At this time, the coding distortion under the three components of Y, U, and V has been calculated. You can directly calculate the coding cost. No need to bring extra calculations to use.
  • this embodiment changes the overall recursion to a division of coding units under different coding specifications.
  • the coding unit under the 64*64 coding specification The maximum and minimum transformation unit TU corresponding to the coding unit are both 32*32 coding specifications, the maximum conversion unit TU corresponding to the coding unit under the 32*32 coding specification is 32*32 coding specification, and the minimum conversion unit TU is 16*16 coding Specifications, the maximum transformation unit TU corresponding to the coding unit under the 16*16 coding specification is 16*16 coding specification, and the minimum conversion unit TU is the 8*8 coding specification, and the maximum conversion unit corresponding to the coding unit under the 8*8 coding specification TU is an 8*8 coding specification, and the smallest transformation unit TU is a 4*4 coding specification.
  • the smallest transformation unit TU is a 4*4 coding specification.
  • this embodiment also pre-sets the adjacent relationship of the encoding specifications.
  • multiple coding specifications can be sorted in high and low order, for example, the next coding specification next to the 64*64 coding specification is 32 *32, and the next encoding standard of 32*32 is 16*16, and so on.
  • S120 Perform cost optimization integration on coding units and transformation units under the same coding specification in sequence to obtain an overall coding mode under the optimal coding cost.
  • the current coding specification The size of the transformation unit after the division of the coding unit is the same as the size of the coding unit under the next coding specification. Therefore, since the coding unit and the transformation unit under the same coding specification have the same size, they can be replaced with each other to perform the same RDO process.
  • the coding unit under the 64*64 coding specification is divided into a 32*32 coding specification.
  • the coding unit under the 32*32 coding specification will also be divided into 4 conversion units under the 16*16 coding specification.
  • this embodiment will sequentially compare the encoding costs of coding units and transform units under the same coding specification, and the encoding cost of the coding unit is The sum of the coding costs of multiple transformation units divided by the coding unit, so that a unit with a lower coding cost is selected under the same coding specification, for example, 4 32*32 divided by coding units under the 64*64 coding specification Transformation unit under the coding specification, if the coding cost of a 32*32 coding unit in the coding unit under the 64*64 coding specification is greater than the coding cost of the coding unit under the 32*32 coding specification, then the transformation unit Replace with the coding unit under the 32*32 coding specification that has been divided into 4 transformation units under the 16*16 coding specification, and so on, continue to compare the transformation unit under the 16*16 coding specification with the 4 8 8 *8 The size of the coding cost between the coding units under the 16*16 coding specification with the 4 8 8 *8 The size of the coding cost between the coding units under the
  • the coding units under each coding specification are divided into transformation units under the next coding specification adjacent to the coding specification, and the coding cost of each transformation unit after the division is calculated.
  • FIG. 2A is a flowchart of a method for determining a coding mode provided in Embodiment 2 of this application
  • FIG. 2B is a method provided in Embodiment 2 of this application for cost-optimized integration of coding units and transformation units under the same coding specification Schematic diagram of the principle.
  • This embodiment is described on the basis of the above-mentioned embodiment. As shown in FIG. 2A, this embodiment describes the process of cost-optimized integration of coding units and transformation units under the same coding specification.
  • this embodiment may include the following steps.
  • S220 Use the division result of the coding unit under the maximum coding specification as the initial coding mode, and use the next coding specification adjacent to the maximum coding specification as the current coding specification.
  • the integration omission under one coding standard is used in this embodiment according to the pre-set neighbor relationship between multiple coding standards , Perform cost optimization integration of coding units and transformation units under each coding specification in turn to ensure the orderliness of cost optimization integration.
  • the encoding unit under the 64*64 encoding specification will divide the transformation unit under the 32*32 encoding specification, the subsequent need to perform the corresponding RDO process through the transformation unit, at this time the maximum encoding specification of the transformation unit is 32 *32, so the coding unit under the 64*64 coding specification must be divided.
  • the coding unit under the maximum coding specification (64*64) is divided into 4 second-largest coding specifications (32*32) transformations
  • the unit is used as the initial coding mode, and the next coding specification (32*32) adjacent to the largest coding specification (64*64) is used as the current coding specification, so that the transformation unit under the current coding specification in the initial coding mode can be subsequently ordered in an orderly manner Perform cost optimization integration to ensure the efficiency of video coding.
  • the coding unit under the current coding specification is used to perform cost optimization update for each transformation unit under the current coding specification in the initial coding mode, to obtain a new initial coding mode.
  • the initial encoding mode since the initial encoding mode has multiple transformation units divided by the encoding unit under the previous encoding specification under the current encoding specification, it is necessary to perform cost optimization update for each transformation unit in turn. Therefore, this implementation
  • the regular meeting selects each transformation unit under the current coding specification in the initial coding mode, and adopts the coding unit that has been divided into the next coding specification adjacent to the current coding specification under the current coding specification, and is in turn with the initial coding mode
  • Each transformation unit under the current coding specification is cost-optimized and compared. If the coding cost of the coding unit under the current coding specification is less than the coding cost of a transformation unit under the current coding specification, the transformation unit is directly replaced with The coding unit under the current coding specification to obtain a new initial coding mode.
  • the method of using the coding unit under the current coding specification to perform cost optimization update for each transformation unit under the current coding specification in the initial coding mode may include the following two methods:
  • the coding cost of the coding unit under the current coding standard is the sum of the coding costs of multiple transform units under the next coding standard adjacent to the current coding standard divided by the coding unit; in this case, For each transformation unit under the current coding specification in the initial coding mode, the cost optimization comparison is performed with the coding unit under the current coding specification. If the coding cost of a transformation unit is greater than the coding cost of the coding unit under the current coding specification, Then directly replace the transformation unit with the encoding unit under the current encoding specification.
  • the encoding unit has been divided into the transformation unit under the next encoding specification adjacent to the current encoding specification; and if the encoding cost of the transformation unit is less than If it is equal to the coding cost of the coding unit under the current coding specification, the transformation unit is retained in the initial coding mode without replacement; thus, it is ensured that the coding cost of the transformation unit in the overall coding mode finally obtained is optimal.
  • the coding cost of the coding unit under the current coding standard is the sum of the coding costs of multiple transform units under the next coding standard adjacent to the current coding standard divided by the coding unit
  • the coding The unit will be divided into multiple transformation units, and then the encoding cost of each transformation unit will be calculated in a certain order.
  • the cost optimization update rate for each transformation unit under the current coding specification in the initial coding mode in order to speed up the cost optimization update rate for each transformation unit under the current coding specification in the initial coding mode.
  • it is determined that the sum of the coding costs of the first several transformation units divided by the coding unit under the current coding specification is greater than or equal to the coding costs of the transformation unit under the current coding specification in the initial coding mode, it will jump directly out of the initial coding mode.
  • the cost of the transformation unit in the coding mode is optimized and updated, and the rate of cost optimization integration in the coding mode is increased.
  • this embodiment will analyze each For the coding efficiency of the coding unit under the coding specification, a corresponding cost threshold is set in advance under each coding specification.
  • the cost threshold is used to indicate the maximum value of the coding cost that can be achieved when the cost is optimized and updated under the current coding specification.
  • the coding unit under the current coding specification when used to optimize the cost of each transformation unit under the current coding specification in the initial coding mode, it will be selected from multiple transformation units under the current coding specification in the initial coding mode for a transformation unit whose encoding cost is greater than the cost threshold under the current encoding specification, the encoding cost of the selected transformation unit exceeds the limit, indicating that the encoding cost of the transformation unit is not optimal, so directly replace the selected transformation unit with The coding unit under the current coding specification, other transformation units remain unchanged.
  • this embodiment may calculate the cost threshold under each coding specification according to a pre-built cost model.
  • This embodiment will pre-analyze multiple parameters involved in the optimal comparison of the coding costs of transform units and coding units under different coding specifications, and establish a corresponding cost model in advance, which is used to adaptively calculate each coding specification
  • D b is the coding distortion of the coding unit under the current coding specification
  • R b is the current coding specification
  • the coding rate of the coding unit, ⁇ is the adjustment factor, used to adjust the weight of the coding rate and coding distortion
  • R s -R b is positive, it means that the coding cost of the coding unit under the current coding specification is small. If R s -R b is negative, it means that the coding cost of the transformation unit under the current coding specification is small.
  • the embodiment will construct a corresponding cost model in advance based on the adjustment factor ⁇ and the size of each coding specification.
  • Encoding cost is the recursive depth corresponding to different encoding specifications
  • ⁇ can be obtained from the quantization parameter of the encoding cost
  • ⁇ and ⁇ are the adjustment parameters of the code model
  • the value range can be between 1 and 4, which can be obtained through offline statistics To determine; at this time, the cost model can be used to calculate the cost threshold under each coding specification, so that the cost optimization update of each transformation unit under the current coding specification in the initial coding mode can be quickly performed to obtain a new initial Encoding mode.
  • the next coding specification adjacent to the current coding specification is again taken as the new.
  • the transformation unit under the minimum encoding specification is optimized and updated to obtain The final initial coding mode, and then the latest initial coding mode as the overall coding mode at the optimal coding cost obtained after cost optimization integration in this embodiment, so as to orderly complete the coding units and transformations under each coding specification
  • the unit is optimized for cost integration to ensure the efficiency of video coding.
  • the technical solution provided by this embodiment divides the coding unit under each coding specification into the transformation unit under the next coding specification adjacent to the coding specification, and calculates the coding cost of each transformation unit after the division, thereby
  • the coding unit and transform unit under the same coding specification are optimized and integrated in order to obtain the overall coding mode under the optimal coding cost, so that the coding cost when the overall coding mode is used for video coding can be minimized, ensuring that different videos are
  • the adaptability of the adopted video coding mode reduces the computational overhead of video coding, thereby increasing the video coding rate.
  • FIG. 3 is a schematic structural diagram of an apparatus for determining an encoding mode provided in Embodiment 3 of the application. As shown in FIG. 3, the apparatus may include the following modules.
  • the coding division module 310 is configured to divide the coding units under each coding specification into transformation units under the next coding specification adjacent to the coding specification, and calculate the coding cost of each transformation unit;
  • the coding mode optimization module 320 is configured to sequentially perform cost optimization and integration of coding units and transformation units under the same coding specification to obtain an overall coding mode at the optimal coding cost.
  • the coding units under each coding specification are divided into transformation units under the next coding specification adjacent to the coding specification, and the coding cost of each transformation unit after the division is calculated.
  • the apparatus for determining the coding mode provided in this embodiment is applicable to the method for determining the coding mode provided in any of the foregoing embodiments, and has corresponding functions and effects.
  • FIG. 4 is a schematic structural diagram of a device provided in Embodiment 4 of this application.
  • the device includes a processor 40, a storage device 41, and a communication device 42; the number of processors 40 in the device may be one or more.
  • a processor 40 is taken as an example; the processor 40, the storage device 41, and the communication device 42 in the device may be connected by a bus or other means. In FIG. 4, the connection by a bus is taken as an example.
  • the storage device 41 can be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the encoding mode determination method described in any embodiment of the present application.
  • the processor 40 executes multiple functional applications and data processing of the device by running the software programs, instructions, and modules stored in the storage device 41, that is, realizes the method for determining the encoding mode described above.
  • the storage device 41 may include a storage program area and a storage data area.
  • the storage program area may store an operating system and an application program required by at least one function; the storage data area may store data created according to the use of the terminal, and the like.
  • the storage device 41 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices.
  • the storage device 41 may include a memory remotely provided with respect to the processor 40, and these remote memories may be connected to the device through a network. Examples of the aforementioned networks include the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.
  • the communication device 42 may be configured to implement a network connection or a mobile data connection between devices.
  • the device provided in this embodiment can be used to execute the coding mode determination method provided in any of the foregoing embodiments, and has corresponding functions and effects.
  • the fifth embodiment of the present application also provides a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, the method for determining the encoding mode in any of the foregoing embodiments can be implemented.
  • the method can include:
  • the coding unit and transformation unit under the same coding specification are sequentially optimized and integrated to obtain the overall coding mode under the optimal coding cost.
  • An embodiment of the application provides a storage medium containing computer-executable instructions.
  • the computer-executable instructions are not limited to the method operations described above, and can also execute the encoding mode determination method provided by any embodiment of the application. Related operations.
  • This application can be implemented by means of software and necessary general-purpose hardware, or can be implemented by hardware.
  • This application can be embodied in the form of a software product.
  • the computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, Read-Only Memory (ROM), and Random Access Memory (Random Access Memory). , RAM), flash memory (FLASH), hard disk or optical disk, etc., including multiple instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in multiple embodiments of the present application.
  • the multiple units and modules included are only divided according to the functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be realized; in addition, multiple functions
  • the names of the units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of this application.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

本申请实施例公开了一种编码模式的确定方法、装置、设备和存储介质，其中，该编码模式的确定方法包括：将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个变换单元的编码代价；依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到整合后的编码代价下的整体编码模式。

Description

编码模式的确定方法、装置、设备和存储介质
本申请要求在2020年03月18日提交中国专利局、申请号为202010193743.0的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及视频编码技术领域，例如涉及一种编码模式的确定方法、装置、设备和存储介质。
背景技术
视频编码通常以编码单元(Coding Unit，CU)为基本单位进行编码，此时编码单元CU存在64*64、32*32、16*16和8*8四种尺寸，在视频编码过程中均需要从64*64尺寸的CU到8*8尺寸的CU进行四叉树递归尝试，以便选出最优效率下的编码尺寸，此时64*64尺寸的CU所处的递归深度为0，每向下递归一次深度加1，8*8尺寸的CU所处的递归深度为3，同时在每一个递归深度上，对当前不递归的CU下的编码代价与当前CU在递归后划分出的4个小CU的编码代价之和进行比对，从而判断该递归深度下是否需要进行递归划分。
每一个CU通常包括变换单元(Transform Unit，TU)和预测单元(Prediction Unit，PU)两部分，TU考虑到视频编码码率和失真度的影响而执行基本的率失真优化(Rate Distortion Optimization，RDO)过程，PU尝试在不同预测模式下计算CU递归划分为多个TU后执行RDO过程下的编码代价；示例性的，PU尝试在每一个预测模式(如MERGE/SKIP/2Nx2N/BIDIR/2NxN/Nx2N/2NxnD/2NxnU/nRx2N/nLx2N/Intra2Nx2N/IntraNxN12种)下，得到TU执行过程中的预测数据，进而对所计算出的残差数据进行变换、量化和熵编码得到当前预测模式下的编码码率，同时对量化后的残差数据进行反量化和反变换得到对应的重构数据，进而与原始的残差数据进行比对得到对应的编码失真，进而根据该编码码率和编码失真计算出该预测模式下的编码代价，依此分别计算每一个递归深度下当前不递归CU下的编码代价及当前CU在递归后划分出的4个小CU的编码代价之和，从而判断当前CU是否需要进行递归划分；此时从64*64尺寸的CU到8*8尺寸的CU下的每种递归情况均需要基于该CU下划分的TU逐一计算对应的编码代价，造成大量的计算负担，增加了视频编码的资源开销。
因此，为了减少CU在递归划分时TU的计算开销，通常存在如下两种方式：1)采用量化域的系数预估编码失真，同时建立码率模型来预估编码码率，从而无需进行残差数据的反量化和反变换过程，但对编码失真和编码码率预估的准 确性要求较高，一旦预估不准确就会造成加大的视频编码损失；2)根据已有编码信息或者计算分析每个TU下的视频纹理以决定是否需要进行递归划分，此时会增加额外的计算量，同时采用统一计算编码代价的方式会损失不同分量下的编码质量。
发明内容
本申请提供了一种编码模式的确定方法、装置、设备和存储介质，降低视频编码的计算开销，保证视频编码模式的自适应性。
提供了一种编码模式的确定方法，该方法包括：
将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个所述变换单元的编码代价；
依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到整合后的编码代价下的整体编码模式。
还提供了一种编码模式的确定装置，该装置包括：
编码划分模块，设置为将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个所述变换单元的编码代价；
编码模式优化模块，设置为依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到整合后的编码代价下的整体编码模式。
还提供了一种设备，该设备包括：
一个或多个处理器；
存储装置，设置为存储一个或多个程序；
当所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现本申请任意实施例所述的编码模式的确定方法。
还提供了一种计算机可读存储介质，存储有计算机程序，该计算机程序被处理器执行时实现本申请任意实施例所述的编码模式的确定方法。
附图说明
图1A为本申请实施例一提供的一种编码模式的确定方法的流程图；
图1B为本申请实施例一提供的编码模式的确定过程的原理示意图；
图2A为本申请实施例二提供的一种编码模式的确定方法的流程图；
图2B为本申请实施例二提供的方法中对同一种编码规格下的编码单元和变换单元进行代价最优化整合的原理示意图；
图3为本申请实施例三提供的一种编码模式的确定装置的结构示意图；
图4为本申请实施例四提供的一种设备的结构示意图。
具体实施方式
下面结合附图和实施例对本申请进行说明。此处所描述的实施例仅仅用于解释本申请，而非对本申请的限定。为了便于描述，附图中仅示出了与本申请相关的部分而非全部结构。此外，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
实施例一
图1A为本申请实施例一提供的一种编码模式的确定方法的流程图，本实施例可适用于对任一个视频存在编码需求的场景中。本实施例提供的编码模式的确定方法可以由本申请实施例提供的编码模式的确定装置来执行，该装置可以通过软件和/或硬件的方式来实现，并集成在执行本方法的设备中，该设备可以是参与视频数据交互的后台服务器。
参考图1A，该方法可以包括如下步骤。
S110，将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个变换单元的编码代价。
在一实施例中，视频编码通常以编码单元CU为基本单位进行编码，本实施例所述的编码规格是指现有的编码单元CU包含的尺寸大小，此时编码单元CU存在64*64、32*32、16*16和8*8这四种编码规格，在视频编码过程中需要从最大编码规格下的编码单元开始，不断进行四叉树递归尝试，直至递归到最小编码规格下的编码单元，从而在每一种编码规格下递归前后的编码单元中选取出最优效率的编码单元，此时在递归后可能会存在多个相同编码规格的编码单元，而且需要分别计算在每一个递归深度下递归前后的每一个编码单元的编码效率，极大增加了视频编码过程中的计算开销，因此本实施例会针对不同编码规格下的递归进行优化，避免对递归过程中每一种编码规格下的多个编码单元 均计算对应的编码效率时带来的极大计算开销。
可选的，针对编码单元存在的64*64、32*32、16*16和8*8这四种编码规格，分别在每一种编码规格下选出一个对应的编码单元，并对每一种编码规格下的编码单元进行相应的划分，此时由于编码规格之间存在相应的比例关系，如图1B所示，本实施例可以将每一种编码规格下的编码单元分别划分出该编码规格相邻的下一种编码规格下的变换单元TU，例如对于64*64尺寸下的编码单元，能够划分出4个32*32尺寸下的变换单元TU，而32*32尺寸下的编码单元，能够划分出4个16*16尺寸下的变换单元TU，以此类推，8*8尺寸下的编码单元，能够划分出4个4*4尺寸下的变换单元TU，同时针对每一种编码规格，在将编码单元划分出对应的变换单元后，可以采用相关技术中的计算方式分别计算出每一个编码单元划分出的每个变换单元的编码代价，例如基于率失真优化方式计算对应的编码代价，此时该编码代价的计算公式为RDcost＝D+λR，RDcost为当前划分的变换单元的编码代价，D为当前划分的变换单元的编码失真，R为当前划分的变换单元的编码码率，λ为调节因子，用于调节编码码率与编码失真的权重；此时在每一种编码规格下，仅需要计算一个编码单元划分出的变换单元的编码代价，避免从最大编码规格下的编码单元开始不断进行四叉树递归尝试，直至递归到最小编码规格下的编码单元时相同编码规格下的多个编码单元的计算开销，从而极大降低视频编码过程中的计算开销，提高视频编码速率。
示例性的，本实施例中计算每个变换单元的编码代价，可以包括：采用全零块编码方式计算每个变换单元的编码代价。此时全零块编码方式能使编码单元划分出的变换单元在执行率失真优化(Rate Distortion Optimization，RDO)过程时的多项系数均为零，从而极大降低编码代价的计算复杂度，提高编码代价的计算效率。同时，视频编码通常会采用YUV420格式的编码器，每一种编码规格下的编码单元在划分出对应的变换单元时，会自行计算Y、U和V三个分量下的编码代价，此时可能会陷入局部优化的情况，而本实施例在所有分量划分后，统一计算一次整体的编码代价，此时Y、U和V三个分量下的编码失真已经计算出，在计算编码代价时可以直接使用，无需带来额外的计算量。
相对于从64*64编码规格开始到8*8编码规格下的编码单元的递归，本实施例是将整体递归改为不同编码规格下编码单元的一次划分，此时64*64编码规格下的编码单元对应的最大和最小变换单元TU均为32*32编码规格，32*32编码规格下的编码单元对应的最大变换单元TU为32*32编码规格，而最小变换单元TU为16*16编码规格，16*16编码规格下的编码单元对应的最大变换单元TU为16*16编码规格，而最小变换单元TU为8*8编码规格，8*8编码规格下的编码单元对应的最大变换单元TU为8*8编码规格，而最小变换单元TU为4*4编码规格。此时，对于64*64编码规格下的编码单元，如果外部设定的编码量 化参数不为64，则直接对4个32*32编码规格下的全零块进行计算。
此外，由于现有的编码规格之间存在相应的比例关系，本实施例还会预先设定编码规格的相邻关系。
示例性的，按照不同编码规格下对应的尺寸高低，以及多个尺寸之间的关联关系，可以将多个编码规格进行高低排序，如64*64编码规格相邻的下一种编码规格为32*32，而32*32编码规格相邻的下一种编码规格为16*16，以此类推。
S120，依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式。
在一实施例中，在对每一种编码规格下的编码单元进行划分，并计算出划分后的每个变换单元的编码代价后，此时对于每一种编码规格而言，当前编码规格下的编码单元划分后的变换单元与下一种编码规格下的编码单元的尺寸相同，因此同一种编码规格下的编码单元和变换单元之间由于尺寸相同则可以相互替换来执行相同的RDO过程，例如64*64编码规格下的编码单元划分后的变换单元是32*32编码规格，32*32编码规格下的编码单元也会划分出4个16*16编码规格下的变换单元，此时64*64编码规格下的编码单元中划分出的32*32编码规格下的变换单元可以与已经划分出4个16*16编码规格下的变换单元的32*32编码规格下的编码单元相互替换，因此如图1B所示，为了保证视频编码过程中的编码代价达到最低，本实施例会依次对同一种编码规格下的编码单元和变换单元的编码代价进行比对，而该编码单元的编码代价为该编码单元划分出的多个变换单元的编码代价之和，从而在同一种编码规格下选用编码代价较低的单元，例如对于64*64编码规格下的编码单元划分后的4个32*32编码规格下的变换单元，如果64*64编码规格下的编码单元中一个32*32编码规格下的变换单元的编码代价大于32*32编码规格下的编码单元的编码代价，则将该变换单元替换为已经划分出4个16*16编码规格下的变换单元的32*32编码规格下的编码单元，以此类推，继续比对16*16编码规格下的变换单元与已经划分出4个8*8编码规格下的变换单元的16*16编码规格下的编码单元之间的编码代价大小，从而依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，使得在相同编码规格下均选用编码代价较低的单元，得到最优编码代价下的整体编码模式。
本实施例提供的技术方案，将每一种编码规格下的编码单元均划分出该编码规格相邻的下一种编码规格下的变换单元，并计算出划分后的每个变换单元的编码代价，从而依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式，使得采用该整体编码模式进 行视频编码时的编码代价能够达到最低，保证不同视频下所采用的视频编码模式的自适应性，降低视频编码的计算开销，进而提高视频编码速率。
实施例二
图2A为本申请实施例二提供的一种编码模式的确定方法的流程图，图2B为本申请实施例二提供的方法中对同一种编码规格下的编码单元和变换单元进行代价最优化整合的原理示意图。本实施例是在上述实施例的基础上进行说明。如图2A所示，本实施例对于对同一种编码规格下的编码单元和变换单元进行代价最优化整合的过程进行说明。
可选的，如图2A所示，本实施例中可以包括如下步骤。
S210，将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个变换单元的编码代价。
S220，将最大编码规格下编码单元的划分结果作为初始编码模式，并将最大编码规格相邻的下一种编码规格作为当前编码规格。
可选的，为了避免对同一种编码规格下的编码单元和变换单元进行代价最优化整合时一个编码规格下的整合遗漏，本实施例会按照预先设定的多个编码规格之间的相邻关系，依次对每一种编码规格下的编码单元和变换单元进行代价最优化整合，保证代价最优化整合的有序性。
在本实施例中，由于64*64编码规格下的编码单元会划分出32*32编码规格下的变换单元，后续需要通过变换单元执行对应的RDO过程，此时变换单元的最大编码规格为32*32，因此64*64编码规格下的编码单元必定会进行划分，此时将最大编码规格(64*64)下的编码单元划分出的4个次大编码规格(32*32)下的变换单元作为初始编码模式，并将最大编码规格(64*64)相邻的下一种编码规格(32*32)作为当前编码规格，以便后续有序对初始编码模式中当前编码规格下的变换单元进行代价最优化整合，保证视频编码的高效性。
S230，依次采用当前编码规格下的编码单元对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新，得到新的初始编码模式。
可选的，由于初始编码模式在当前编码规格下会存在上一编码规格下的编码单元划分出的多个变换单元，此时需要依次对每一个变换单元进行过代价最优化更新，因此本实施例会在初始编码模式下选取出当前编码规格下的每一个变换单元，并采用当前编码规格下已经划分出当前编码规格相邻的下一种编码规格的变换单元的编码单元，依次与初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化比对，如果当前编码规格下的编码单元的编码代价 小于该当前编码规格下的一个变换单元的编码代价，则直接将该变换单元替换为当前编码规格下的编码单元，从而得到新的初始编码模式。
示例性的，本实施例中对于采用当前编码规格下的编码单元对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新的方式可以包含如下两种：
1)针对初始编码模式内在当前编码规格下的每一个变换单元，如果该变换单元的编码代价大于当前编码规格下的编码单元的编码代价，则将该变换单元替换为当前编码规格下的编码单元，否则该变换单元保持不变。
在一实施例中，当前编码规格下的编码单元的编码代价为该编码单元所划分出的当前编码规格相邻的下一种编码规格下的多个变换单元的编码代价之和；此时，针对初始编码模式内在当前编码规格下的每一个变换单元，分别与当前编码规格下的编码单元进行代价最优化比对，如果一个变换单元的编码代价大于当前编码规格下的编码单元的编码代价，则直接将该变换单元替换为当前编码规格下的编码单元，此时该编码单元内已经划分出当前编码规格相邻的下一种编码规格下的变换单元；而如果该变换单元的编码代价小于或等于当前编码规格下的编码单元的编码代价，则在该初始编码模式内保留该变换单元，无需替换；从而保证最终得到的整体编码模式内的变换单元的编码代价最优。
在一实施例中，由于当前编码规格下的编码单元的编码代价为该编码单元所划分出的当前编码规格相邻的下一种编码规格下的多个变换单元的编码代价之和，而编码单元会划分出多个变换单元，进而会按照一定顺序依次计算每一个变换单元的编码代价，此时为了加快对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新的速率，本实施例会在确定当前编码规格下的编码单元划分出的前几个变换单元的编码代价之和已经大于或等于初始编码模式内在当前编码规格下的变换单元的编码代价时，则直接跳出该初始编码模式内该变换单元的代价最优化更新，提高编码模式进行代价最优化整合的速率。
2)在初始编码模式内当前编码规格下的变换单元中选取出编码代价大于当前编码规格下的代价阈值的变换单元，将所选取出的变换单元替换为当前编码规格下的编码单元，除所述所选取出的变换单元之外的其他变换单元保持不变。
可选的，由于初始编码模式内在当前编码规格下的每一个变换单元均需要与当前编码规格下的编码单元进行代价最优化比对，为了提高编码模式的整合速率，本实施例会通过分析每个编码规格下的编码单元的编码效率，预先在每一种编码规格下设定一个对应的代价阈值，该代价阈值用于指示当前编码规格下代价最优化更新时所允许达到的编码代价的最大值；此时采用当前编码规格 下的编码单元对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新时，会在初始编码模式内当前编码规格下的多个变换单元中选取出编码代价大于当前编码规格下的代价阈值的变换单元，所选取出的变换单元的编码代价超出限定，说明该变换单元的编码代价并不是最优的，因此直接将所选取出的变换单元替换为当前编码规格下的编码单元，其他变换单元保持不变。
示例性的，对于每个编码规格下的代价阈值，本实施例可以根据预先构建的代价模型计算每一种编码规格下的代价阈值。本实施例会预先分析不同编码规格下的变换单元和编码单元的编码代价最优化比对时所涉及到的多项参数，预先建立对应的代价模型，该代价模型用于自适应计算每个编码规格下的代价阈值；例如假设当前编码规格下的编码单元的编码代价为J b＝D b+λR b，其中，D b为当前编码规格下的编码单元的编码失真，R b为当前编码规格下的编码单元的编码码率，λ为调节因子，用于调节编码码率与编码失真的权重，当前编码规格下的变换单元的编码代价为J s＝D s+λR s，其中，D s为当前编码规格下的变换单元的编码失真，R s为当前编码规格下的变换单元的编码码率，此时两者之间编码代价的比对差值为ΔJ＝(D s-D b)+λ(R s-R b)，如果视频编码块为纹理平坦块，则当前编码规格下的编码单元和变换单元之间的编码失真极为接近，此时D s-D b最大概率趋于零，此时如果R s-R b为正，说明当前编码规格下的编码单元的编码代价较小，如果R s-R b为负，说明当前编码规格下的变换单元的编码代价较小，因此本实施例会基于调节因子λ和每个编码规格的大小预先构建出对应的代价模型，本实施例中的代价模型可以为Threshold＝α*λ＞＞(tuDepth+β)，其中Threshold为不同编码规格下的编码代价，tuDepth为不同编码规格对应的递归深度，λ可以从编码代价的量化参数查询得到，α和β为代码模型的调节参数，取值范围可以为1～4之间，可以通过离线统计来确定；此时可以通过该代价模型来计算每一种编码规格下的代价阈值，以便后续快速对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新，从而得到新的初始编码模式。
S240，将当前编码规格相邻的下一种编码规格作为新的当前编码规格，继续对新的初始编码模式内在新的当前编码规格下的每一个变换单元进行代价最优化更新，直至对最小编码规格下的变换单元进行代价最优化更新，则将最新的初始编码模式作为整体编码模式。
可选的，在依次采用当前编码规格下的编码单元对初始编码模式内在当前编码规格下的每一个变换单元进行代价最优化更新后，再次将当前编码规格相邻的下一种编码规格作为新的当前编码规格，继续采用上述步骤对新的初始编码模式内在新的当前编码规格下的每一个变换单元进行代价最优化更新，直至对最小编码规格下的变换单元进行代价最优化更新后，得到最终的初始编码模式，进而将最新的初始编码模式作为本实施例中代价最优化整合后得到的最优 编码代价下的整体编码模式，从而有序完成每一种编码规格下的编码单元和变换单元进行代价最优化整合，保证视频编码的高效性。
本实施例提供的技术方案，将每一编码规格下的编码单元均划分出该编码规格相邻的下一编码规格下的变换单元，并计算出划分后的每个变换单元的编码代价，从而依次对同一编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式，使得采用该整体编码模式进行视频编码时的编码代价能够达到最低，保证不同视频下所采用的视频编码模式的自适应性，降低视频编码的计算开销，进而提高视频编码速率。
实施例三
图3为本申请实施例三提供的一种编码模式的确定装置的结构示意图，如图3所示，该装置可以包括以下模块。
编码划分模块310，设置为将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个变换单元的编码代价；
编码模式优化模块320，设置为依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式。
本实施例提供的技术方案，将每一种编码规格下的编码单元均划分出该编码规格相邻的下一种编码规格下的变换单元，并计算出划分后的每个变换单元的编码代价，从而依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式，使得采用该整体编码模式进行视频编码时的编码代价能够达到最低，保证不同视频下所采用的视频编码模式的自适应性，降低视频编码的计算开销，进而提高视频编码速率。
本实施例提供的编码模式的确定装置可适用于上述任意实施例提供的编码模式的确定方法，具备相应的功能和效果。
实施例四
图4为本申请实施例四提供的一种设备的结构示意图，如图4所示，该设备包括处理器40、存储装置41和通信装置42；设备中处理器40的数量可以是一个或多个，图4中以一个处理器40为例；设备中的处理器40、存储装置41和通信装置42可以通过总线或其他方式连接，图4中以通过总线连接为例。
存储装置41作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请任意实施例所述的编码模式的确定方法对应 的程序指令/模块。处理器40通过运行存储在存储装置41中的软件程序、指令以及模块，从而执行设备的多种功能应用以及数据处理，即实现上述编码模式的确定方法。
存储装置41可包括存储程序区和存储数据区，其中，存储程序区可存储操作***、至少一个功能所需的应用程序；存储数据区可存储根据终端的使用所创建的数据等。此外，存储装置41可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储装置41可包括相对于处理器40远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括互联网、企业内部网、局域网、移动通信网及其组合。
通信装置42可设置为实现设备间的网络连接或者移动数据连接。
本实施例提供的一种设备可用于执行上述任意实施例提供的编码模式的确定方法，具备相应的功能和效果。
实施例五
本申请实施例五还提供了一种计算机可读存储介质，存储有计算机程序，该计算机程序被处理器执行时可实现上述任意实施例中的编码模式的确定方法。该方法可以包括：
将每一种编码规格下的编码单元划分出该编码规格相邻的下一种编码规格下的变换单元，并计算每个变换单元的编码代价；
依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到最优编码代价下的整体编码模式。
本申请实施例所提供的一种包含计算机可执行指令的存储介质，其计算机可执行指令不限于如上所述的方法操作，还可以执行本申请任意实施例所提供的编码模式的确定方法中的相关操作。
本申请可借助软件及必需的通用硬件来实现，也可以通过硬件实现。本申请可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如计算机的软盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、闪存(FLASH)、硬盘或光盘等，包括多个指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请多个实施例所述的方法。
上述编码模式的确定装置的实施例中，所包括的多个单元和模块只是按照 功能逻辑进行划分的，但并不局限于上述的划分，只要能够实现相应的功能即可；另外，多个功能单元的名称也只是为了便于相互区分，并不用于限制本申请的保护范围。

Claims (10)

  1. 一种编码模式的确定方法，包括：
    将每一种编码规格下的编码单元划分出所述每一种编码规格相邻的下一种编码规格下的变换单元，并计算每个所述变换单元的编码代价；
    依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到整合后的编码代价下的整体编码模式。
  2. 根据权利要求1所述的方法，其中，所述依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，包括：
    将编码单元包括的编码规格中最大编码规格下编码单元的划分结果作为初始编码模式，并将所述最大编码规格相邻的下一种编码规格作为当前编码规格；
    依次采用所述当前编码规格下的编码单元对所述初始编码模式内在所述当前编码规格下的每一个变换单元进行代价最优化更新，得到新的初始编码模式；
    将所述当前编码规格相邻的下一种编码规格作为新的当前编码规格，继续对新的初始编码模式内在新的当前编码规格下的每一个变换单元进行代价最优化更新，直至对编码单元包括的编码规格中最小编码规格下的变换单元进行代价最优化更新，则将更新后的初始编码模式作为所述整体编码模式。
  3. 根据权利要求2所述的方法，其中，所述采用所述当前编码规格下的编码单元对所述初始编码模式内在所述当前编码规格下的每一个变换单元进行代价最优化更新，得到新的初始编码模式，包括：
    针对所述初始编码模式内在所述当前编码规格下的每一个变换单元，在所述每一个变换单元的编码代价大于所述当前编码规格下的编码单元的编码代价的情况下，将所述每一个变换单元替换为所述当前编码规格下的编码单元，在所述每一个变换单元的编码代价小于或等于所述当前编码规格下的编码单元的编码代价的情况下，所述每一个变换单元保持不变，所述当前编码规格下的编码单元的编码代价为所述当前编码规格下的编码单元所划分出的多个变换单元的编码代价之和。
  4. 根据权利要求2所述的方法，其中，所述依次采用所述当前编码规格下的编码单元对所述初始编码模式内在所述当前编码规格下的每一个变换单元进行代价最优化更新，得到新的初始编码模式，包括：
    在所述初始编码模式内所述当前编码规格下的变换单元中选取出编码代价大于所述当前编码规格下的代价阈值的变换单元，将所选取出的变换单元替换为所述当前编码规格下的编码单元，除所述所选取出的变换单元之外的其他变换单元保持不变。
  5. 根据权利要求4所述的方法，还包括：
    根据预先构建的代价模型计算每一种编码规格下的代价阈值。
  6. 根据权利要求1-5中任一项所述的方法，其中，所述计算每个所述变换单元的编码代价，包括：
    采用全零块编码方式计算每个所述变换单元的编码代价。
  7. 根据权利要求1-5中任一项所述的方法，还包括：
    预先设定编码规格的相邻关系。
  8. 一种编码模式的确定装置，包括：
    编码划分模块，设置为将每一种编码规格下的编码单元划分出所述每一种编码规格相邻的下一种编码规格下的变换单元，并计算每个所述变换单元的编码代价；
    编码模式优化模块，设置为依次对同一种编码规格下的编码单元和变换单元进行代价最优化整合，得到整合后的编码代价下的整体编码模式。
  9. 一种设备，包括：
    一个或多个处理器；
    存储装置，设置为存储一个或多个程序；
    所述一个或多个程序被所述一个或多个处理器执行，使得所述一个或多个处理器实现如权利要求1-7中任一项所述的编码模式的确定方法。
  10. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1-7中任一项所述的编码模式的确定方法。
PCT/CN2021/077148 2020-03-18 2021-02-22 编码模式的确定方法、装置、设备和存储介质 WO2021185022A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010193743.0A CN111182298B (zh) 2020-03-18 2020-03-18 一种编码模式的确定方法、装置、设备和存储介质
CN202010193743.0 2020-03-18

Publications (1)

Publication Number Publication Date
WO2021185022A1 true WO2021185022A1 (zh) 2021-09-23

Family

ID=70651612

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/077148 WO2021185022A1 (zh) 2020-03-18 2021-02-22 编码模式的确定方法、装置、设备和存储介质

Country Status (2)

Country Link
CN (1) CN111182298B (zh)
WO (1) WO2021185022A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023070403A1 (zh) * 2021-10-27 2023-05-04 深圳市大疆创新科技有限公司 编码方法、装置、电子设备和计算机可读介质

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111182298B (zh) * 2020-03-18 2022-04-12 广州市百果园信息技术有限公司 一种编码模式的确定方法、装置、设备和存储介质
CN113596442B (zh) * 2021-07-07 2022-10-04 北京百度网讯科技有限公司 视频处理方法、装置、电子设备及存储介质

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103348651A (zh) * 2011-03-09 2013-10-09 联发科技（新加坡）私人有限公司 具有降低复杂性的变换单元分割的方法及装置
CN104363450A (zh) * 2014-11-27 2015-02-18 北京奇艺世纪科技有限公司 一种帧内编码模式决策方法及装置
CN104902276A (zh) * 2015-05-15 2015-09-09 腾讯科技（北京）有限公司 变换单元划分方法及装置
US20190394469A1 (en) * 2012-03-16 2019-12-26 Texas Instruments Incorporated Low-complexity two-dimensional (2d) separable transform design with transpose buffer management
CN111182298A (zh) * 2020-03-18 2020-05-19 广州市百果园信息技术有限公司 一种编码模式的确定方法、装置、设备和存储介质

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8902988B2 (en) * 2010-10-01 2014-12-02 Qualcomm Incorporated Zero-out of high frequency coefficients and entropy coding retained coefficients using a joint context model
CN103733628A (zh) * 2011-08-08 2014-04-16 摩托罗拉移动有限责任公司 变换单元分割的残差树结构
US9591312B2 (en) * 2012-04-17 2017-03-07 Texas Instruments Incorporated Memory bandwidth reduction for motion compensation in video coding
EP3053337B1 (en) * 2013-10-01 2020-07-29 Telefonaktiebolaget LM Ericsson (publ) Encoder and method for video processing
US20160373744A1 (en) * 2014-04-23 2016-12-22 Sony Corporation Image processing apparatus and image processing method
CN105530518B (zh) * 2014-09-30 2019-04-26 联想(北京)有限公司 一种视频编码、解码方法及装置
KR102559063B1 (ko) * 2017-02-24 2023-07-24 주식회사 케이티 비디오 신호 처리 방법 및 장치
CN108933941A (zh) * 2017-05-26 2018-12-04 富士通株式会社 图像编码方法和装置以及图像解码方法和装置
CN110581990B (zh) * 2019-09-25 2021-07-27 杭州当虹科技股份有限公司 一种适用于hevc 4k和8k超高清编码的tu递归快速算法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103348651A (zh) * 2011-03-09 2013-10-09 联发科技（新加坡）私人有限公司 具有降低复杂性的变换单元分割的方法及装置
US20190394469A1 (en) * 2012-03-16 2019-12-26 Texas Instruments Incorporated Low-complexity two-dimensional (2d) separable transform design with transpose buffer management
CN104363450A (zh) * 2014-11-27 2015-02-18 北京奇艺世纪科技有限公司 一种帧内编码模式决策方法及装置
CN104902276A (zh) * 2015-05-15 2015-09-09 腾讯科技（北京）有限公司 变换单元划分方法及装置
CN111182298A (zh) * 2020-03-18 2020-05-19 广州市百果园信息技术有限公司 一种编码模式的确定方法、装置、设备和存储介质

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023070403A1 (zh) * 2021-10-27 2023-05-04 深圳市大疆创新科技有限公司 编码方法、装置、电子设备和计算机可读介质

Also Published As

Publication number Publication date
CN111182298A (zh) 2020-05-19
CN111182298B (zh) 2022-04-12

Similar Documents

Publication Publication Date Title
WO2021185022A1 (zh) 编码模式的确定方法、装置、设备和存储介质
US9699468B2 (en) Adaptive screen and video coding scheme
US11070803B2 (en) Method and apparatus for determining coding cost of coding unit and computer-readable storage medium
CN111316642B (zh) 信令图像编码和解码划分信息的方法和装置
US11122284B2 (en) Picture coding device, picture coding method, and picture coding program, and picture decoding device, picture decoding method, and picture decoding program
WO2020248715A1 (zh) 基于高效率视频编码的编码管理方法及装置
JP2023171878A (ja) 画像の符号化及び復号化
WO2022121787A1 (zh) 视频预测编码的方法及装置
JP2024514294A (ja) マルチメディアデータ処理方法、装置、機器、コンピュータ可読記憶媒体及びコンピュータプログラム
CN109218722B (zh) 一种视频编码方法、装置及设备
EP4262205A1 (en) Video predictive coding method and apparatus
CN111541898B (zh) 一种编码模式的确定方法、装置、服务器和存储介质
CN109618152B (zh) 深度划分编码方法、装置和电子设备
RU2799709C1 (ru) Способ и устройство для кодирования видео на основании долговременного опорного кадра, вычислительное устройство и носитель данных
CN112637592B (zh) 一种视频预测编码的方法及装置
TWI840401B (zh) 基於多運動模型的跳過和直接模式編碼的視頻塊中的修剪
TW202011746A (zh) 基於多運動模型的視頻編碼和解碼
WO2024054689A1 (en) Methods and apparatus for transform training and coding
KR20140120396A (ko) 영상의 고속 부호화를 위한 방법
BR122021013566B1 (pt) Método de decodificar um vídeo

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 21771506

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 21771506

Country of ref document: EP

Kind code of ref document: A1