WO2022121786A1 - 视频预测编码的方法及装置 - Google Patents

视频预测编码的方法及装置 Download PDF

Info

Publication number
WO2022121786A1
WO2022121786A1 PCT/CN2021/135246 CN2021135246W WO2022121786A1 WO 2022121786 A1 WO2022121786 A1 WO 2022121786A1 CN 2021135246 W CN2021135246 W CN 2021135246W WO 2022121786 A1 WO2022121786 A1 WO 2022121786A1
Authority
WO
WIPO (PCT)
Prior art keywords
coding
block
mode
information
current
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2021/135246
Other languages
English (en)
French (fr)
Inventor
崔同兵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Bigo Technology Pte Ltd
Original Assignee
Bigo Technology Pte Ltd
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 Bigo Technology Pte Ltd filed Critical Bigo Technology Pte Ltd
Priority to EP21902493.2A priority Critical patent/EP4262205A4/en
Priority to US18/256,894 priority patent/US12581057B2/en
Priority to JP2023535576A priority patent/JP7589929B2/ja
Publication of WO2022121786A1 publication Critical patent/WO2022121786A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • 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
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • 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
    • H04N19/107—Selection of coding mode or of prediction mode between spatial and temporal predictive coding, e.g. picture refresh
    • 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
    • H04N19/109—Selection of coding mode or of prediction mode among a plurality of temporal predictive coding modes
    • 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • 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
    • H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
    • 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
    • H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • 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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • 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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
    • 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/189—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding
    • H04N19/192—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding the adaptation method, adaptation tool or adaptation type being iterative or recursive
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H04N19/517—Processing of motion vectors by encoding
    • H04N19/52—Processing of motion vectors by encoding by predictive encoding
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/557—Motion estimation characterised by stopping computation or iteration based on certain criteria, e.g. error magnitude being too large or early exit
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/567—Motion estimation based on rate distortion criteria
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/59—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution

Definitions

  • the embodiments of the present application relate to video coding technologies, for example, to a method and apparatus for video predictive coding.
  • predictive coding is one of the core technologies of video coding, and predictive coding is further divided into intra-frame prediction and inter-frame prediction.
  • Intra prediction is based on the spatial correlation of the video image, using the encoded adjacent pixels in the image to predict the current pixel.
  • Inter-frame coding uses the coded images to predict the images to be coded according to the temporal correlation of the video images.
  • the encoder can eliminate the spatiotemporal correlation of the video, transform, quantize, and entropy encode the predicted residual instead of the original pixel value, thereby greatly improving the encoding efficiency.
  • the main video coding standard inter-frame prediction part adopts block-based motion compensation (Motion Compensation, MC) technology.
  • the main principle is to perform motion estimation (Motion Estimation, ME) in the reference frame through the prediction unit (PU), search for the matching block, and use the motion compensation technology to generate the prediction block, and then obtain the residual block, and then use the residual block.
  • the difference block is used as the input of the subsequent encoding module to perform the next encoding process.
  • the motion of the object is not all whole pixel motion, it may only move half a pixel or 1/4 pixel, so it is also necessary to perform sub-pixel ME, that is, to generate sub-pixels by interpolation on the basis of integer pixels. Data, and then search and compensate for matching blocks in sub-pixels.
  • High Efficiency Video Coding HEVC
  • HEVC High Efficiency Video Coding
  • the inter-frame coding PU in HEVC includes at least 7 kinds of 2Nx2N/BIDIR, 2NxN/Nx2N/2NxnD/2NxnU/nRx2N/nLx2N (RECT/AMP), and each PU has to go through the above-mentioned inter-frame coding process, and the computational overhead is very large.
  • the present application provides a video predictive coding method and apparatus, to avoid the situation in the related art that the PU of each mode needs to perform an inter-frame coding process including motion compensation during the inter-frame coding process, resulting in high coding computational overhead.
  • an embodiment of the present application provides a method for video predictive coding, including:
  • the decision information related to the current coding block is obtained, where the decision information includes one of the following: pre-analysis information determined by the encoder when performing pre-analysis for lightweight video coding, the current coding block is in The encoding information of the multiple sub-blocks obtained after recursive encoding, and the executed mode information determined according to the executed mode;
  • an embodiment of the present application also provides a device for video predictive coding, including:
  • the decision information obtaining module is configured to obtain decision information related to the current coding block during inter-frame predictive coding, where the decision information includes one of the following: pre-analysis information determined by the encoder when performing pre-analysis of lightweight video coding , the encoding information of the multiple sub-blocks obtained after recursive encoding of the current encoding block, and the executed mode information determined according to the executed mode;
  • the ME skipping decision module is configured to judge, according to the decision information, whether to skip the motion estimation ME coding of the current coding block.
  • an embodiment of the present application further provides an electronic device, including a memory, a processor, and a computer program stored in the memory and running on the processor, where the processor implements the above method when executing the program .
  • an embodiment of the present application further provides a computer-readable storage medium on which a computer program is stored, and when the program is executed by a processor, the foregoing method is implemented.
  • FIG. 1 is a schematic diagram of a PU division mode provided by an embodiment of the present application
  • FIG. 2 is a schematic diagram of a decision process for an optimal mode of an inter-frame predictive coding process of a single PU provided by an embodiment of the present application;
  • FIG. 3 is a schematic diagram of an encoding process of a single inter-frame mode provided by an embodiment of the present application
  • FIG. 4 is a flowchart of an embodiment of a method for video predictive coding provided by an embodiment of the present application
  • FIG. 5 is a flow chart of performing ME fast skip judgment according to pre-analysis information provided by an embodiment of the present application
  • FIG. 6 is a schematic diagram of the relationship between recursive division of coding blocks and down-sampling blocks according to an embodiment of the present application
  • FIG. 7 is a flow chart of performing ME fast skip decision according to coding information of sub-blocks provided by an embodiment of the present application.
  • FIG. 8 is a schematic diagram of recursive division of coding blocks provided by an embodiment of the present application.
  • FIG. 9 is a flowchart of a ME fast skip decision of a non-square PU according to the executed mode information of the executed mode provided by an embodiment of the present application.
  • FIG. 10 is a structural block diagram of an embodiment of an apparatus for video predictive coding provided by an embodiment of the present application.
  • FIG. 11 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
  • Predictive coding refers to using one or several coded sample values to predict the current sample value according to a certain model or method, and to compare the real value of the sample and the value of the sample. The difference between the predicted values is encoded, and the encoding efficiency is greatly improved by transforming, quantizing, and entropy encoding the predicted residual instead of the original pixel value.
  • Predictive coding may include intra-prediction Intra mode and inter-prediction Inter mode.
  • the new video compression standard HEVC defines a new set of syntax units for image division, including Coding Unit (CU), Prediction Unit (PU) and Transform Unit (TU).
  • CU is the basic unit for prediction, transformation, quantization and entropy coding
  • PU is the basic unit for predictive coding, including intra-frame prediction or inter-frame prediction
  • TU is the basic unit for transformation and quantization.
  • the PU specifies all the prediction modes of the CU, and all prediction-related information can be defined in the PU. For example, the direction of intra-frame prediction, the division method of inter-frame prediction, motion vector prediction, and the reference image index number of inter-frame prediction are all available. It belongs to the category of PU.
  • the PU division modes included in a 2Nx2N CU may include: for a 2Nx2N CU mode, there are two optional modes for intra-frame prediction PU, 2Nx2N and NxN; frame There are 8 optional modes for inter-prediction PU: 4 symmetric modes (2Nx2N, 2NxN, Nx2N, NxN) and 4 asymmetric modes (2NxnD, 2NxnU, nRx2N, nLx2N), among which, according to the shape of the PU, 2Nx2N can be It is called square PU with NxN, and 2NxN, Nx2N, 2NxnD, 2NxnU, nRx2N, and nLx2N are called non-square PU; skip mode is a kind of inter-frame prediction.
  • the motion information to be encoded is only the motion parameter set index
  • the encoding residual When encoding residual when en
  • the decision-making process may include the following processes (the NxN mode is not used in FIG. 2):
  • non-square modes such as 2NxN, Nx2N, 2NxnU, 2NxnD, nLx2N, and nRx2N contain two PUs. Each PU needs to perform MERGE/SKIP mode, forward ME, backward ME, and two-way ME separately, and compare the optimal model.
  • the motion of the object since the motion of the object is not all whole pixel motion, it may only move half a pixel or 1/4 pixel, so it is also necessary to perform sub-pixel ME, that is, to generate sub-pixel data by interpolation on the basis of integer pixels. , and then search and compensate for matching blocks in sub-pixels.
  • the highest resolution of HEVC luminance component sub-pixel is 1/4 pixel, and the highest resolution of chrominance component is 1/8 pixel.
  • FIG. 3 the encoding process of a single inter-frame mode in the above-mentioned various modes of FIG. 2 is shown: for a PU, it is first judged whether to perform sub-pixel ME, and based on the judgment result of performing sub-pixel ME, the motion estimation of sub-pixel is performed. And motion compensation, based on the judgment result of not performing sub-pixel ME, perform motion estimation and motion supplementation of the whole pixel, and then perform Rate Distortion Optimation (RDO) encoding process on the obtained residual block.
  • each inter-frame inter PU has to go through the inter-frame coding process in Figure 3, and the overhead is very large. If unnecessary PU ME can be reduced, the resource overhead of the encoder can be greatly reduced, thereby improving the coding. speed and reduce coding costs.
  • any encoder that complies with the HEVC coding standard can be applied.
  • AVS2, AVS3, AV1, VVC and other standard encoders can also be used directly after adjustment.
  • the encoder mentioned in this embodiment can be applied not only to the transcoding service, but also to the real-time encoding service of the mobile terminal.
  • FIG. 4 is a flowchart of an embodiment of a video predictive coding method provided by an embodiment of the present application. This embodiment may include the following steps:
  • Step 410 During the inter-frame predictive coding, obtain decision information related to the current coding block, where the decision information includes: pre-analysis information determined by the encoder when performing pre-analysis for lightweight video coding, or the current coding Encoding information of multiple sub-blocks obtained after the block is recursively encoded, or executed mode information determined according to the executed mode.
  • Step 420 determine whether to skip the motion estimation ME coding of the current coding block.
  • skipping the ME process can be divided into two cases, one is to skip all MEs in the above decision-making process; the other is to skip some MEs in the above-mentioned decision-making process, for example, only execute 2Nx2N ME, but after skipping 2Nx2N of other modes of ME.
  • this embodiment may use different methods to determine whether to skip the ME process according to different obtained decision information.
  • the decision to quickly skip ME coding may be made based on pre-analysis information, and the decision information may include: pre-analysis information determined by the encoder when performing pre-analysis of lightweight video coding, as shown in FIG. 5 .
  • step 420 may include the following sub-steps:
  • Sub-step S11 according to the size of the current coding block, determine the number of corresponding down-sampling blocks, and index the pre-analysis information of each down-sampling block.
  • the encoder may use a pre-analysis module to perform a pre-analysis operation on the video before actually encoding the input video.
  • the pre-analysis operation may be: the pre-analysis module is performing a pre-analysis operation on the input video.
  • lightweight video encoding is performed to obtain the frame structure, frame type, and encoding quantization parameters (Quantization Parameter, QP) when encoding is actually performed.
  • QP Quantization Parameter
  • the pre-analyzed coding unit is an 8x8 downsampling block.
  • the 8x8 downsampling block corresponds to 16x16 That is, if the method of sub-step S11 is adopted, the size of the coding block in this embodiment is at least 16 ⁇ 16, including 16 ⁇ 16, 32 ⁇ 32, and 64 ⁇ 64.
  • the 32x32 coding block can be divided into four 16x16 coding sub-blocks, and each 16x16 coding sub-block corresponds to a down-sampling block ( Lowres shown in Figure 6), therefore, the number of downsampling blocks that can be collected from the 32x32 coding block is 4. Similarly, if it is a 64x64 coding block, it can be divided into 16 16x16 coding sub-blocks, corresponding to 16 down-sampling blocks.
  • the ME fast skip decision of the current block can be made according to the pre-analysis information.
  • the corresponding down-sampling block may be indexed according to the coordinate information of the current coding block.
  • Figure 6 for a 32x32 coding block, it can be divided into 4 16x16 coding sub-blocks, and the coordinate information of the coding block is known, so the coordinate information of each 16x16 coding sub-block can be obtained, and then find the The down-sampling block within the coordinate range of each coding sub-block is used as the down-sampling block corresponding to the coding sub-block. After finding the down-sampling block corresponding to each coding block, the pre-analysis information of the down-sampling block can be obtained.
  • the pre-analysis information of the down-sampling block may include, but is not limited to: inter-frame coding cost, intra-frame coding cost, and an optimal mode for prediction of the down-sampling block.
  • Sub-step S12 summarizing the pre-analysis information of the down-sampling block, and determining whether to skip ME coding of the current coding block according to the summarizing result.
  • the pre-analysis information of all the down-sampling blocks corresponding to the current coding block can be aggregated, and whether to skip the ME process of the inter prediction mode is determined according to the aggregated result.
  • sub-step S12 may include the following sub-steps:
  • Sub-step S121 Calculate the sum of the inter-frame coding costs of all down-sampling blocks corresponding to the current coding block, and obtain the estimated inter-frame coding cost of the current coding block.
  • 4 down-sampling blocks can be indexed. After obtaining the inter-frame coding cost of each down-sampling block, the sum of the inter-frame coding costs of the 4 down-sampling blocks can be calculated as The estimated inter-coding cost InterCost of the 32x32 coding block.
  • Sub-step S122 Calculate the sum of the intra-frame coding costs of all down-sampling blocks corresponding to the current coding block to obtain the estimated intra-frame coding cost of the current coding block.
  • the sum of the intra-coding costs of the 4 down-sampling blocks is calculated as the estimated intra-frame cost of the 32x32 coding block.
  • Encoding cost IntraCost is calculated as the estimated intra-frame cost of the 32x32 coding block.
  • Sub-step S123 Calculate the number of down-sampling blocks whose optimal mode is the intra-frame prediction mode in all down-sampling blocks corresponding to the current coding block, and determine that the optimal mode of the current coding block is the intra-frame prediction mode according to the quantity the first ratio.
  • the optimal modes of the 4 down-sampling blocks can be calculated as the number of intra-frame prediction Intra modes and the first ratio IntraRatio, For example, assuming that the optimal mode of 2 downsampling blocks is Intra mode, IntraRatio is 2/4; for another example, assuming that the optimal mode of 3 downsampling blocks is Intra mode, then IntraRatio is 3/4.
  • Sub-step S124 if the first ratio is greater than the first preset ratio threshold, and the product of the estimated intra-frame coding cost and the first adjustment factor is less than the estimated inter-frame coding cost and the second adjustment factor product, the ME coding of the current coding block is skipped, wherein the first adjustment factor is smaller than the second adjustment factor.
  • a is a first preset ratio threshold
  • b is a first adjustment factor
  • c is a second adjustment factor
  • skipME is skip ME.
  • a, b, and c can be adjusted according to requirements.
  • the encoding speed can be linearly increased or decreased to meet different business needs.
  • b ⁇ c can be set according to business needs.
  • the default values of a, b, and c can be set to 0.5, 1, and 4.
  • a decision to quickly skip ME may be made based on the coded information of the sub-block, and the decision information may include: multiple sub-blocks obtained after recursive coding of the coding block Encoding information for the block.
  • the coding information of the sub-block may at least include: the optimal mode of the sub-block and whether the sub-block is further recursively divided.
  • step 420 may include the following sub-steps:
  • Sub-step S21 according to the optimal mode of each sub-block of the current coding block, determine that the optimal mode of the current coding block is the second ratio of the intra prediction mode, and the optimal mode of the current coding block is the third ratio of the SKIP mode. ratio.
  • the second ratio at which the optimal mode of the current coding block is the intra-frame prediction mode may be the number of sub-blocks whose optimal mode is the intra-frame prediction Intra mode in the current coding block to all sub-blocks of the current coding block
  • the ratio of the total number; and the third ratio of the optimal mode of the current coding block is the SKIP mode may be the number of sub-blocks whose optimal mode is the intra-frame prediction SKIP mode in the current coding block and the total number of all sub-blocks of the current coding block ratio.
  • the number of sub-blocks whose optimal mode is Intra mode is 1, and the optimal mode is SKIP
  • Sub-step S22 according to whether each sub-block of the current coding block is further recursively divided, determine the sub-block recursion ratio of the current coding block.
  • the sub-block recursion ratio is used to reflect the ratio of sub-blocks that can be further divided in the current coding block.
  • Sub-step S23 determine whether to skip ME coding of the current coding block.
  • sub-step S23 may include the following sub-steps:
  • SubSplitRatio is the sub-block recursion ratio
  • SubIntraRatio is the second ratio
  • threshold_A is the preset recursion ratio threshold
  • threshold_B is the second preset ratio threshold
  • threshold_A and threshold_B can be set according to actual service requirements.
  • sub-step S23 may include the following sub-steps:
  • the third ratio is greater than a third preset ratio threshold, and the sub-block recursion ratio is greater than a fourth preset ratio threshold, ME coding of the current coding block is skipped.
  • SubSplitRatio is the sub-block recursion ratio
  • SubSkipRatio is the third ratio
  • threshold_C is the third preset ratio threshold
  • threshold_D is the fourth preset ratio threshold
  • threshold_C and threshold_D can be set according to actual service requirements.
  • the decision information may include according to the executed mode.
  • Determined executed mode information may at least include: a stage optimal mode SATD cost and an intra-frame prediction SATD cost; step 420 may include the following sub-steps:
  • the SATD cost of the phase-optimized mode is the SATD cost of the phase-optimized mode obtained by performing mode judgment after this mode is executed.
  • the SATD cost of intra-frame prediction may be the SATD cost of the optimal intra-frame mode determined through SATD rough selection during intra-frame prediction.
  • IntraSATDCost is the intra-frame prediction SATD cost
  • InterSATDCost is the stage optimal mode SATD cost
  • ⁇ is the third adjustment factor
  • ⁇ is the fourth adjustment factor.
  • both ⁇ and ⁇ can be adjusted according to actual business requirements. For example, the default value of ⁇ can be 5, and the default value of ⁇ can be 3.
  • IntraSATDCost* ⁇ is less than ⁇ *InterSATDCost, it means that the spatial correlation of the current block is stronger than the temporal correlation, so the ME coding process of the current coding block can be skipped.
  • each PU needs to perform MERGE separately mode, forward ME, backward ME, and bidirectional ME, and compare the optimal mode.
  • the overall ME process is highly complex.
  • the ME mode that has been executed can be used to quickly jump out of the ME of the non-square PU.
  • the decision information may include the executed mode information determined according to the executed mode, wherein, the executed mode may include at least the 2Nx2N mode and the BIDIR mode in FIG. 2, then the executed mode information may include: The MERGE mode SATD cost of the MERGE mode, and the phase-optimal mode SATD cost.
  • step 420 may include the following sub-steps:
  • Sub-step S31 if the current prediction unit is a non-square prediction unit, determine whether the SATD cost of the MERGE mode is less than the SATD cost of the stage optimal mode.
  • Sub-step S32 if the SATD cost of the MERGE mode is less than the SATD cost of the optimal mode of the stage, execute the MERGE mode on the non-square prediction unit, and skip forward ME coding and backward ME coding of the non-square prediction unit.
  • ME coding and bidirectional ME coding if the SATD cost of the MERGE mode is less than the SATD cost of the optimal mode of the stage, execute the MERGE mode on the non-square prediction unit, and skip forward ME coding and backward ME coding of the non-square prediction unit.
  • the MERGE mode SATD cost of the MERGE mode executed in the 2Nx2N mode is less than the stage-optimal mode SATD cost, only the current non-square PU is executed in the MERGE mode, and the forward ME coding and the backward ME are no longer performed. Encoding and bidirectional ME encoding process.
  • the optimal value of the current coding block may also be considered.
  • the mode is the ratio of the SKIP mode, that is, in the coding sub-blocks of the current coding block, the optimal mode is the ratio of the sub-blocks of the SKIP mode, and the calculation method can refer to the above-mentioned third ratio.
  • Step 420 may include the following sub-steps:
  • the SATD cost of the MERGE mode is less than the SATD cost of the optimal mode of the stage, and the ratio of the optimal mode of the current coding block to the SKIP mode is greater than a preset ratio threshold, execute the MERGE mode on the non-square prediction unit , and skip forward ME coding, backward ME coding and bidirectional ME coding of the non-square prediction unit.
  • SubSkipRatio is the ratio of the optimal mode of the current coding block to the SKIP mode
  • MrgCost is the MERGE mode SATD cost of the MERGE mode executed in the 2Nx2N mode
  • InterSATDCost is the stage optimal mode SATD cost
  • ⁇ , a1, b1 are adjustment factors, respectively , which can be set according to actual business requirements. For example, the default value of ⁇ can be set to 0.8, and the default values of a1 and b1 are both 1.
  • skipMELeft means that RECT/AMP only executes the MERGE mode, and no longer performs forward ME, backward ME, and bidirectional ME.
  • the inter-frame predictive coding it can be determined whether to skip the motion estimation ME coding of the current coding block according to the obtained decision information related to the current coding block.
  • the decision information may include that the encoder is performing light.
  • the pre-analysis information determined during the pre-analysis of the video coding of the magnitude of information different fast decision schemes can be used to make ME skip decision to reduce unnecessary PU ME, which can greatly reduce the coding complexity, reduce the resource overhead of the encoder, and improve the coding compression of the encoder.
  • the throughput rate of the transcoding service can be improved, thereby saving server resources and reducing the cost of transcoding.
  • the coding speed can be increased by 18% under the condition that the compression rate of the encoder is lost by 0.2%. From the perspective of online transcoding applications, it can save 18% of server computing resources under the condition of minor image quality loss, thereby reducing transcoding costs.
  • FIG. 10 is a structural block diagram of an apparatus embodiment of a video predictive coding apparatus provided by an embodiment of the present application, which may include the following modules:
  • the decision information obtaining module 1001 is configured to obtain decision information related to the current coding block during inter-frame predictive coding, where the decision information includes: pre-analysis information determined when the encoder performs pre-analysis of lightweight video coding, or , the encoding information of the multiple sub-blocks obtained after recursive encoding of the current encoding block, or, the executed mode information determined according to the executed mode;
  • the skip ME judgment module 1002 is configured to judge whether to skip the motion estimation ME coding of the current coding block according to the judgment information.
  • the skip ME decision module 1002 may include the following sub-modules:
  • the pre-analysis information index submodule is set to determine the number of corresponding down-sampling blocks according to the size of the current coding block, and index the pre-analysis information of each down-sampling block;
  • the pre-analysis information decision sub-module is configured to summarize the pre-analysis information of the down-sampling block, and judge whether to skip ME coding of the current coding block according to the summary result.
  • the pre-analysis information of the down-sampling block includes an inter-coding cost, an intra-coding cost, and an optimal mode for prediction of the down-sampling block;
  • the pre-analysis information decision sub-module is set to:
  • the product of the estimated intra-coding cost and the first adjustment factor is less than the product of the estimated inter-coding cost and the second adjustment factor, skip through the ME encoding of the current encoding block, wherein the first adjustment factor is smaller than the second adjustment factor.
  • the encoding information of the sub-blocks includes: the optimal mode of the sub-block and the Whether the sub-block is further recursively divided;
  • the skip ME decision module 1002 may include the following sub-modules:
  • the ratio calculation submodule is set to determine the optimal mode of the current coding block as the second ratio of the intra-frame prediction mode according to the optimal mode of each sub-block of the current coding block, and the optimal mode of the current coding block is the SKIP mode and, according to whether each sub-block of the current coding block is further recursively divided, determine the sub-block recursion ratio of the current coding block;
  • the ratio decision submodule is configured to determine whether to skip ME coding of the current coding block according to the second ratio, the third ratio and/or the sub-block recursion ratio.
  • the ratio decision sub-module is set to:
  • sub-block recursion ratio is greater than a preset recursion ratio threshold, and the second ratio is greater than a second preset ratio threshold, skip ME coding of the current coding block;
  • the third ratio is greater than a third preset ratio threshold, and the sub-block recursion ratio is greater than a fourth preset ratio threshold, ME coding of the current coding block is skipped.
  • the executed mode information when the decision information is executed mode information determined according to the executed mode, includes: a stage optimal mode SATD cost and an intra-frame prediction SATD cost;
  • the skip ME decision module 1002 may include the following sub-modules:
  • the SATD cost judgment sub-module is set to if the current encoding block is not recursively encoded, and the product of the intra-frame prediction SATD cost and the third adjustment factor is less than the product of the optimal mode SATD cost and the fourth adjustment factor, Then, the ME coding of the current coding block is skipped, wherein the third adjustment factor is greater than the fourth adjustment factor.
  • the executed mode when the decision information is executed mode information determined according to the executed mode, the executed mode includes at least a 2Nx2N mode and a BIDIR mode, and the executed mode information includes: 2Nx2N mode The MERGE mode SATD cost of the MERGE mode executed in , and the phase-optimal mode SATD cost;
  • the skip ME decision module 1002 may include the following sub-modules:
  • the first part of ME skips the judgment sub-module, and is set to judge whether the SATD cost of the MERGE mode is less than the SATD cost of the optimal mode if the current prediction unit is a non-square prediction unit; if the SATD cost of the MERGE mode is less than the If the SATD cost of the stage-optimal mode is satisfied, the MERGE mode is performed on the non-square PU, and forward ME coding, backward ME coding and bidirectional ME coding of the non-square PU are skipped.
  • the executed mode information further includes the ratio at which the optimal mode of the current coding block is the SKIP mode
  • the skip ME decision module 1002 may include the following sub-modules:
  • the first part of the ME skip decision sub-module is set to if the SATD cost of the MERGE mode is less than the SATD cost of the optimal mode of the stage, and the ratio of the optimal mode of the current coding block to the SKIP mode is greater than a preset ratio threshold, Then the MERGE mode is performed on the non-square PU, and forward ME coding, backward ME coding and bidirectional ME coding of the non-square PU are skipped.
  • the apparatus for video predictive coding provided by the embodiments of the present application can execute the video predictive coding methods provided by the embodiments of the present application, and has functional modules and beneficial effects corresponding to the execution methods.
  • FIG. 11 is a schematic structural diagram of an electronic device provided by an embodiment of the application.
  • the electronic device includes a processor 1110, a memory 1120, an input device 1130, and an output device 1140; the number of processors 1110 in the electronic device There may be one or more, and a processor 1110 is taken as an example in FIG. 11; the processor 1110, the memory 1120, the input device 1130 and the output device 1140 in the electronic device can be connected through a bus or other means, and in FIG. Connect as an example.
  • the memory 1120 may be configured to store software programs, computer-executable programs, and modules, such as program instructions/modules corresponding to the methods in the embodiments of the present application.
  • the processor 1110 executes various functional applications and data processing of the electronic device by running the software programs, instructions and modules stored in the memory 1120, ie, implements the above-mentioned method.
  • the memory 1120 may mainly include a stored program area and a stored data area, wherein the stored program area
  • memory 1120 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • memory 1120 may include memory located remotely from processor 1110, which may be connected to the electronic device through a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the input device 1130 may be configured to receive input numerical or character information, and generate key signal input related to user settings and function control of the electronic device.
  • the output device 1140 may include a display device such as a display screen.
  • the embodiments of the present application further provide a storage medium containing computer-executable instructions, where the computer-executable instructions, when executed by a processor of a server, are configured to execute the method in any of the embodiments of the present application.
  • the present application can be implemented by means of software and necessary general-purpose hardware, and certainly can also be implemented by hardware. Based on such understanding, the technical solutions of the present application can be embodied in the form of software products in essence or the parts that make contributions to related technologies, and the computer software products can be stored in a computer-readable storage medium, such as a computer floppy disk, Read-Only Memory (ROM), Random Access Memory (RAM), flash memory (FLASH), hard disk or optical disk, etc., including several instructions to make a computer device (which can be a personal computer, A server, or a network device, etc.) executes the methods described in the various embodiments of the present application.
  • the computer-readable storage medium may be a non-transitory computer-readable storage medium.
  • the multiple units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be realized;
  • the specific names of the functional units are only for the convenience of distinguishing from each other, and are not used to limit the protection scope of the present application.

Landscapes

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

Abstract

本申请公开了一种视频预测编码的方法及装置，其中所述方法包括：在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括以下之一：编码器在进行轻量级视频编码预分析时确定的预分析信息，所述当前编码块在进行递归编码后得到的多个子块的编码信息，以及根据已执行的模式确定的已执行模式信息；根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。

Description

视频预测编码的方法及装置
本申请要求在2020年12月11日提交中国专利局、申请号为202011459744.1的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及视频编码技术，例如涉及一种视频预测编码的方法及装置。
背景技术
在编码框架中，预测编码是视频编码的核心技术之一，预测编码又分为帧内预测和帧间预测。帧内预测是根据视频图像的空间相关性，利用图像内已编码的邻近像素预测当前像素。帧间编码是根据视频图像的时间相关性，利用已编码图像预测待编码图像。经过帧内和帧间预测，编码器可以消除视频的时空相关性，对预测后的残差而不是原始像素值进行变换、量化、熵编码，由此大幅提高编码效率。
目前主要的视频编码标准帧间预测部分都采用了基于块的运动补偿(Motion Compensation，MC)技术。其主要原理是通过预测单元(Prediction Unit，PU)在参考帧中进行运动估计(Motion Estimation，ME)，搜索出匹配块，并利用运动补偿技术生成预测块，进而得到残差块，然后将残差块作为后续编码模块的输入，进行下一步编码处理。除此之外，由于物体运动并非全为整像素运动，有可能只移动了半个像素或1/4个像素，因此还需要进行分像素ME，即在整像素基础上通过插值方法生成分像素数据，然后在分像素中进行匹配块的搜索及补偿，高效率视频编码(High Efficiency Video Coding，HEVC)亮度分量分像素最高精度为1/4像素，色度分量分像素最高精度为1/8像素。
HEVC中帧间编码PU至少包括2Nx2N/BIDIR、2NxN/Nx2N/2NxnD/2NxnU/nRx2N/nLx2N(RECT/AMP)7种，每种PU都要经过上述的帧间编码过程，计算开销非常大。
发明内容
本申请提供一种视频预测编码的方法及装置，以避免相关技术中因在帧间编码过程中每种模式的PU都需要进行包含运动补偿的帧间编码过程导致编码计算开销大的情况。
第一方面，本申请实施例提供了一种视频预测编码的方法，包括：
在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括以下之一：编码器在进行轻量级视频编码预分析时确定的预分析信息，所述当前编码块在进行递归编码后得到的多个子块的编码信息，以及根据已执行的模式确定的已执行模式信息；
根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。
第二方面，本申请实施例还提供了一种视频预测编码的装置，包括：
判决信息获取模块，设置为在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括以下之一：编码器在进行轻量级视频编码预分析时确定的预分析信息，所述当前编码块在进行递归编码后得到的多个子块的编码信息，以及根据已执行的模式确定的已执行模式信息；
跳过ME判决模块，设置为根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。
第三方面，本申请实施例还提供了一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现上述的方法。
第四方面，本申请实施例还提供了一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现上述的方法。
附图说明
图1是本申请实施例提供的一种PU划分模式示意图；
图2是本申请实施例提供的单个PU的帧间预测编码过程的最优模式的决策过程示意图；
图3是本申请实施例提供的单个帧间模式的编码过程示意图；
图4是本申请一实施例提供的一种视频预测编码的方法实施例的流程图；
图5是本申请一实施例提供的一种根据预分析信息进行ME快速跳过判决的流程图；
图6是本申请一实施例提供的编码块递归划分与下采样块的关系示意图；
图7是本申请一实施例提供的一种根据子块的编码信息进行ME快速跳过判决的流程图；
图8是本申请一实施例提供的编码块递归划分示意图；
图9是本申请一实施例提供的一种根据已执行的模式的已执行模式信息进行非正方形PU的ME快速跳过判决的流程图；
图10是本申请一实施例提供的一种视频预测编码的装置实施例的结构框图；
图11是本申请一实施例提供的一种电子设备的结构示意图。
具体实施方式
下面结合附图和实施例对本申请作进一步的详细说明。可以理解的是，此处所描述的具体实施例仅仅用于解释本申请，而非对本申请的限定。另外还需要说明的是，为了便于描述，附图中仅示出了与本申请相关的部分而非全部结构。
本实施例可以适用于视频编码中的预测编码阶段，预测编码是指利用已编码的一个或几个样本值，根据某种模型或者方法，对当前的样本值进行预测，并对样本真实值和预测值之间的差值进行编码，通过对预测后的残差而不是原始像素值进行变换、量化、熵编码，由此大幅提高编码效率。预测编码可以包括帧内预测Intra模式和帧间预测Inter模式。
新的视频压缩标准HEVC为图像划分定义了一套新的语法单元，包括编码单元(Coding Unit，CU)、预测单元(Prediction Unit，PU)和变换单元(Transform Unit，TU)。其中，CU是进行预测、变换、量化和熵编码等处理的基本单元；PU是进行预测编码，包括帧内预测或者帧间预测的基本单元；TU是进行变换和量化的基本单元。PU规定了CU的所有预测模式，一切与预测相关的信息都可以定义在PU中，例如，帧内预测的方向、帧间预测的分割方式、运动矢量预测、以及帧间预测参考图像索引号都属于PU的范畴。
参考图1示出了一种PU划分模式示意图，一个2Nx2N的CU所包含的PU划分模式可以包括：对于一个2Nx2N的CU模式，帧内预测PU的可选模式有两种，2Nx2N和NxN；帧间预测PU的可选模式有8种：4种对称模式(2Nx2N、2NxN、Nx2N、NxN)和4种非对称模式(2NxnD、2NxnU、nRx2N、nLx2N)，其中，根据PU的形状，可以将2Nx2N与NxN称为正方形PU，将2NxN、Nx2N、2NxnD、2NxnU、nRx2N、nLx2N称为非正方形PU；skip模式是帧间预测的一种，当需要编码的运动信息只有运动参数集索引，编码残差不需要编码时，为2Nx2N skip模式。
参考图2示出了单个PU的帧间预测编码过程的最优模式的决策过程示意图，如图2所示，该决策过程可以包括如下过程(在图2中没有用到NxN模式)：
首先，进行2Nx2N级别的MERGE/SKIP模式，如满足递归条件则执行CU递归模式，递归完成后返回当前块大小CU，继续执行帧内预测Intra模式，Intra完成后，执行2Nx2N的帧间模式(分别进行前向ME、后向ME以获得最优匹配块)，然后执行2Nx2N的BIDIR(只进行双向搜索，得到最优匹配块)，然后继续执行2NxN以及Nx2N模式类型。每做完一种模式均进行一次模式判决，得到阶段最优模式tempBestMode。
在执行完Nx2N之后，
若tempBestMode＝＝2NxN，则继续执行2NxnU、2NxnD，比较后得到最终 的最优模式BestMode。
若tempBestMode＝＝Nx2N，则继续执行nLx2N、nRx2N，比较后得到最终的最优模式BestMode。
若tempBestMode！＝2NxN&&tempBestMode！＝Nx2N，则继续执行2NxnU、2NxnD、nLx2N、nRx2N，比较后得到最终的最优模式BestMode。
需要说明的是，若当前块进行了CU递归，则以子块为单位执行上述的决策过程，并将BestMode的代价与递归代价进行比较，以决定是否进行CU递归划分。
另外，2NxN、Nx2N、2NxnU、2NxnD、nLx2N、nRx2N等非正方形模式包含两个PU，每个PU均需要单独进行MERGE/SKIP模式、前向ME、后向ME、双向ME，并比较出最优模式。
除此以外，由于物体运动并非全为整像素运动，有可能只移动了半个像素或1/4个像素，因此还需要进行分像素ME，即在整像素基础上通过插值方法生成分像素数据，然后在分像素中进行匹配块的搜索及补偿，HEVC亮度分量分像素最高精度为1/4像素，色度分量最高精度为1/8像素。参考图3示出了上述图2的多种模式中，单个帧间模式的编码过程：对于一个PU，首先判断是否进行分像素ME，基于进行分像素ME的判断结果，进行分像素的运动估计和运动补偿，基于不进行分像素ME的判断结果，进行整像素的运动估计和运动补充，然后对得到的残差块进行率失真优化(Rate Distortion Optimation，RDO)编码流程。
可见，每种帧间inter PU都要经过图3的帧间编码过程，开销非常大，如果能够减少不必要的PU ME，则能在很大程度上减小编码器的资源开销，进而提高编码速度，降低编码成本。
需要说明的是，本申请的下述实施例可以应用于任何基于块的混合编码架构中，凡是符合HEVC编码标准的编码器都可以应用，其它的比如符合AVS1、H.264、VP8、VP9、AVS2、AVS3、AV1、VVC等标准的编码器，经过调整后也可以直接使用。并且，本实施例提及的编码器不但可以应用于转码服务，也可以应用于移动端实时编码服务。
图4为本申请一实施例提供的一种视频预测编码的方法实施例的流程图，本实施例可以包括如下步骤：
步骤410，在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括：编码器在进行轻量级视频编码预分析时确定的预分析信息，或者，所述当前编码块在进行递归编码后得到的多个子块的编码信息，或者，根据已执行的模式确定的已执行模式信息。
步骤420，根据所述判决信息，判断是否跳过所述当前编码块的运动估计 ME编码。
例如，针对图2所示的决策过程，在对当前PU进行帧间预测模式的最优模式决策时，可以根据已经获得的判决信息，判断是否跳过上述决策过程中的多个模式的ME过程。其中，跳过ME过程，可以分成两种情况，一是可以跳过上述决策过程中的所有ME；二是跳过上述决策过程中的部分ME，例如只执行2Nx2N的ME，但跳过2Nx2N后的其他模式的ME。
针对跳过上述决策过程中的所有ME的场景，本实施例可以依据获取的判决信息的不同，采用不用的方式来判决是否跳过ME过程。
在一种实施例中，可以基于预分析信息来进行快速跳过ME编码的判决，则判决信息可以包括：编码器在进行轻量级视频编码预分析时确定的预分析信息，如图5所示，步骤420可以包括如下子步骤：
子步骤S11，根据当前编码块的大小，确定对应的下采样块的数量，以及索引每个下采样块的预分析信息。
在实现时，编码器在实际对输入的视频进行编码处理前，可以采用预分析模块先对视频进行预分析操作，示例性的，该预分析操作可以为：预分析模块在对输入的视频进行下采样的基础上，进行轻量级视频编码，以得到真正进行编码时的帧结构、帧类型、编码量化参数(Quantization Parameter，QP)。
而预分析的编码单元为8x8的下采样块，例如，假设原始的块大小为w*h，下采样后的块大小就是w/2*h/2，则8x8的下采样块对应的是16x16的编码块，即，如果采用子步骤S11的方式，本实施例的编码块的大小至少为16x16，包括16x16、32x32、64x64。
在一种例子中，以32x32编码块为例，如图6所示，32x32编码块可以划分成4个16x16的编码子块，而每个16x16的编码子块又对应于1个下采样块(如图6所示的Lowres)，因此，32x32编码块能采集到下采样块的个数为4个。同理，如果是64x64编码块，则能分成16个16x16的编码子块，对应于16个下采样块。
由于在预分析阶段也会进行ME编码，因此如果能找到当前编码块在预分析阶段对应的下采样块的预分析信息，则可以根据该预分析信息来进行当前块的ME快速跳过判决。在一种实现中，可以根据当前编码块的坐标信息来索引其对应的下采样块。例如，在图6中，对于32x32编码块，可以划分成4个16x16编码子块，而该编码块的坐标信息是可知的，因此可以得到每个16x16编码子块的坐标信息，然后找到落入每个编码子块的坐标范围内的下采样块作为该编码子块对应的下采样块，找到每个编码块对应的下采样块以后，则可以获得该下采样块的预分析信息。
作为一种示例，下采样块的预分析信息可以包括但不限于：帧间编码代价、 帧内编码代价、以及该下采样块预测的最优模式。
子步骤S12，汇总所述下采样块的预分析信息，并根据所述汇总的结果判断是否跳过所述当前编码块的ME编码。
得到当前编码块对应的所有下采样块以后，可以汇总当前编码块对应的所有下采样块的预分析信息，并根据汇总的结果来判决是否跳过帧间预测模式的ME过程。
在一种实施方式中，子步骤S12可以包括如下子步骤：
子步骤S121，计算当前编码块对应的所有下采样块的帧间编码代价的总和，得到所述当前编码块的预估帧间编码代价。
例如，对于图6的32x32编码块，可以索引到4个下采样块，当获得每个下采样块的帧间编码代价以后，可以计算该4个下采样块的帧间编码代价之和，作为该32x32编码块的预估帧间编码代价InterCost。
子步骤S122，计算当前编码块对应的所有下采样块的帧内编码代价的总和，得到所述当前编码块的预估帧内编码代价。
例如，对于图6的32x32编码块，当索引到4个下采样块的帧内编码代价以后，计算该4个下采样块的帧内编码代价之和，作为该32x32编码块的预估帧内编码代价IntraCost。
子步骤S123，计算当前编码块对应的所有下采样块中最优模式为帧内预测模式的下采样块的数量，并根据所述数量确定所述当前编码块的最优模式为帧内预测模式的第一比率。
例如，对于图6的32x32编码块，当索引到4个下采样块的最优模式以后，可以计算该4个下采样块的最优模式为帧内预测Intra模式的数量及第一比率IntraRatio，例如，假设有2个下采样块的最优模式为Intra模式，则IntraRatio为2/4；又如，假设有3个下采样块的最优模式为Intra模式，则IntraRatio为3/4。
子步骤S124，若所述第一比率大于第一预设比率阈值，且，所述预估帧内编码代价与第一调节因子的乘积小于所述预估帧间编码代价与第二调节因子的乘积，则跳过所述当前编码块的ME编码，其中，所述第一调节因子小于所述第二调节因子。
在该步骤中，当得到当前编码块的InterCost、IntraCost以及IntraRatio以后，当满足如下的条件式(1)时，则可以跳过ME编码：
if(IntraRatio>a&&IntraCost*b<c*InterCost)    (1)
skipME＝true；
其中，a为第一预设比率阈值，b为第一调节因子，c为第二调节因子，skipME为跳过ME。需要说明的是，a、b、c可根据需求进行调整，在保持一致加速性价比的前提下，可以线性提高或降低编码速度，以满足不同业务需求，例如， 可以根据业务需求设定b<c，比如，可以将a、b、c的默认值设定为0.5、1、4。
根据上述条件式(1)，如果IntraCost*b<c*InterCost，且IntraRatio比较大时，说明当前块的空域相关性比时域相关性更强，因此可以直接跳过ME过程。
在另一种实施例中，若当前编码块进行了递归编码，可以基于子块的已编码信息进行快速跳过ME的判决，则判决信息可以包括：编码块在进行递归编码后得到的多个子块的编码信息。示例性地，子块的编码信息至少可以包括：子块的最优模式以及该子块是否进一步递归划分。如图7所示，步骤420可以包括如下子步骤：
子步骤S21，根据当前编码块的每个子块的最优模式，确定当前编码块的最优模式为帧内预测模式的第二比率，以及，当前编码块的最优模式为SKIP模式的第三比率。
在一种实现中，当前编码块的最优模式为帧内预测模式的第二比率可以为当前编码块中最优模式为帧内预测Intra模式的子块的数量与当前编码块的所有子块总数量的比值；而当前编码块的最优模式为SKIP模式的第三比率可以为当前编码块中最优模式为帧内预测SKIP模式的子块的数量与当前编码块的所有子块总数量的比值。
例如，如图8所示，假设当前编码块被划分成4个16x16编码子块，在这4个编码子块中，最优模式为Intra模式的子块的数量为1，最优模式为SKIP模式的子块的数量为2，则第二比率＝1/4，第三比率＝2/4。
子步骤S22，根据当前编码块的每个子块是否进一步递归划分，确定当前编码块的子块递归比率。
在该步骤中，子块递归比率用于反应当前编码块中可以被进一步划分的子块的比率。在一种实现中，当前编码块的子块递归比率可以为当前编码块中可以进一步进行递归编码的子块的数量与当前编码块的所有子块总数量的比值，例如，如图8所示，假设当前编码块被划分成4个16x16编码子块，在这4个编码子块中，可以进一步进行递归编码的子块的数量为1(如图8的Split子块所示)，则子块递归比率＝1/4。
子步骤S23，根据所述第二比率、所述第三比率和/或所述子块递归比率，判断是否跳过所述当前编码块的ME编码。
在一种实施方式中，子步骤S23可以包括如下子步骤：
若所述子块递归比率大于预设递归比率阈值，且，所述第二比率大于第二预设比率阈值，则跳过所述当前编码块的ME编码。
在该步骤中，当得到子块递归比率以及第二比率以后，当满足如下的条件式(2)时，则可以跳过ME编码：
if(SubSplitRatio>threshold_A&&SubIntraRatio>threshold_B)    (2)
skipME＝true；
其中，SubSplitRatio为子块递归比率，SubIntraRatio为第二比率，threshold_A为预设递归比率阈值，threshold_B为第二预设比率阈值，threshold_A和threshold_B可以根据实际业务需求设定。
当SubSplitRatio>threshold_A且SubIntraRatio>threshold_B时，表示当前编码块中子块Split块较多，且有一定Intra比率，此时当前编码块更容易分割成4个子块进行编码，因此可以跳过当前编码块的ME过程。
在另一种实施方式中，子步骤S23可以包括如下子步骤：
若所述第三比率大于第三预设比率阈值，且，所述子块递归比率大于第四预设比率阈值，则跳过所述当前编码块的ME编码。
在该步骤中，当得到子块递归比率以及第三比率以后，当满足如下的条件式(3)时，则可以跳过ME编码：
if(SubSkipRatio>threshold_C&&SubSplitRatio>threshold_D)   (3)
skipME＝true；
其中，SubSplitRatio为子块递归比率，SubSkipRatio为第三比率，threshold_C为第三预设比率阈值，threshold_D为第四预设比率阈值，threshold_C和threshold_D可以根据实际业务需求设定。
当SubSkipRatio>threshold_C且SubSplitRatio>threshold_D时，表示当前编码块中子块Split块较多，且SKIP模式比率较多，表明当前编码块运动较弱，因此可以跳过剩余的ME过程。
在另一种实施例中，若当前编码块CU未进行递归编码，则可以根据已执行的模式的模式信息来判决是否跳过ME编码，在该场景下，判决信息可以包括根据已执行的模式确定的已执行模式信息。示例性地，已执行模式信息至少可以包括：阶段最优模式SATD代价以及帧内预测SATD代价；步骤420可以包括如下子步骤：
若当前编码块未进行递归编码，且，所述帧内预测SATD代价与第三调节因子的乘积小于所述阶段最优模式SATD代价与第四调节因子的乘积，则跳过所述当前编码块的ME编码，其中，所述第三调节因子大于所述第四调节因子。
在该实施例中，阶段最优模式SATD代价为执行完以此模式后进行模式判决得到的阶段最优模式的SATD代价。帧内预测SATD代价可以为在进行帧内预测时，通过SATD粗选决策出的最优帧内模式的SATD代价。
当得到阶段最优模式SATD代价以及帧内预测SATD代价以后，当满足如下的条件式(4)时，则可以跳过ME编码：
if(IntraSATDCost*α<β*InterSATDCost)   (4)
skipME＝true；
其中，IntraSATDCost为帧内预测SATD代价，InterSATDCost为阶段最优模式SATD代价，α为第三调节因子，β为第四调节因子。其中，α和β都可以根据实际的业务需求调整，例如，α的默认取值可以为5，β的默认取值可以为3。
当IntraSATDCost*α小于β*InterSATDCost时，表示当前块的空域相关性比时域相关性更强，因此可以跳过当前编码块的ME编码过程。
在其他实施例中，针对跳过上述决策过程中的部分ME的场景，例如对于2NxN/Nx2N/2NxnD/2NxnU/nRx2N/nLx2N(RECT/AMP)等非正方形PU，每个PU都需要单独进行MERGE模式、前向ME、后向ME、双向ME，并比较出最优模式，整体ME过程复杂度高，本实施例可以通过已经执行的ME模式做快速跳出上述非正方形PU的ME的决策。则判决信息可以包括根据已执行的模式确定的已执行模式信息，其中，该已执行的模式至少可以包括图2中的2Nx2N模式以及BIDIR模式，则该已执行模式信息可以包括：2Nx2N模式中执行的MERGE模式的MERGE模式SATD代价，以及，阶段最优模式SATD代价。
如图9所示，步骤420可以包括如下子步骤：
子步骤S31，若当前预测单元为非正方形预测单元，则判断所述MERGE模式SATD代价是否小于所述阶段最优模式SATD代价。
子步骤S32，若所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，则对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
在该实施例中，如果2Nx2N模式中执行的MERGE模式的MERGE模式SATD代价小于阶段最优模式SATD代价，则只对当前的非正方形PU执行MERGE模式，不再进行前向ME编码、后向ME编码以及双向ME编码过程。
在其他实施方式中，如果当前编码块进行了递归编码，则在判决是否跳过非正方形PU模式的前向ME、后向ME、双向ME的判决过程中，还可以考虑当前编码块的最优模式为SKIP模式的比率，即，当前编码块的编码子块中，最优模式为SKIP模式的子块的占比，计算方式可以参考上述的第三比率，则步骤420可以包括如下子步骤：
若所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，且，所述当前编码块的最优模式为SKIP模式的比率大于预设比率阈值，则对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
在实现时，若当前非正方形模式满足如下的条件式(5)时，则可以跳过前向ME、后向ME、双向ME的编码过程，只执行该模式的MERGE模式：
if(SubSkipRatio>θ&&MrgCost*a1<b1*InterSATDCost)   (5)
skipMELeft＝true；
其中，SubSkipRatio为当前编码块的最优模式为SKIP模式的比率，MrgCost为2Nx2N模式中执行的MERGE模式的MERGE模式SATD代价，InterSATDCost为阶段最优模式SATD代价；θ、a1、b1分别为调节因子，其可以根据实际业务需求设定，例如，可以设定θ的默认取值为0.8，a1、b1的默认取值均为1。skipMELeft是指RECT/AMP只执行MERGE模式，不再进行前向ME、后向ME、双向ME。
在本实施例中，在帧间预测编码时，可以根据已获取的与当前编码块相关的判决信息来判断是否跳过当前编码块的运动估计ME编码，该判决信息可以包括编码器在进行轻量级视频编码预分析时确定的预分析信息，或者，当前编码块在进行递归编码后得到的多个子块的编码信息，或者，根据已执行的模式确定的已执行模式信息，根据不同的判决信息，可以采取不同的快速判决方案来进行ME跳过判决，以减少不必要的PU ME，能在很大程度上降低编码复杂度，减小编码器的资源开销，进而提高编码器的编码压缩速度，编码器的压缩速度提升后可以提高转码服务的吞吐率，进而节省服务器资源，降低转码成本。通过本实施例的跳过ME编码的判决，能够在编码器压缩率损失0.2％的条件下，提高编码速度18％。从线上转码应用的角度来讲，可以在微小画质损失条件下，节省18％的服务器计算资源，进而降低转码成本。
图10为本申请实施例提供的一种视频预测编码的装置实施例的结构框图，可以包括如下模块：
判决信息获取模块1001，设置为在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括：编码器在进行轻量级视频编码预分析时确定的预分析信息，或者，所述当前编码块在进行递归编码后得到的多个子块的编码信息，或者，根据已执行的模式确定的已执行模式信息；
跳过ME判决模块1002，设置为根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。
在一种实施方式中，当所述判决信息为编码器在进行轻量级视频编码预分析时确定的预分析信息时，所述跳过ME判决模块1002可以包括如下子模块：
预分析信息索引子模块，设置为根据当前编码块的大小，确定对应的下采样块的数量，以及索引每个下采样块的预分析信息；
预分析信息判决子模块，设置为汇总所述下采样块的预分析信息，并根据所述汇总的结果判断是否跳过所述当前编码块的ME编码。
在一种实施方式中，所述下采样块的预分析信息包括帧间编码代价、帧内编码代价、以及所述下采样块预测的最优模式；
所述预分析信息判决子模块设置为：
计算当前编码块对应的所有下采样块的帧间编码代价的总和，得到所述当前编码块的预估帧间编码代价；
计算当前编码块对应的所有下采样块的帧内编码代价的总和，得到所述当前编码块的预估帧内编码代价；
计算当前编码块对应的所有下采样块中最优模式为帧内预测模式的下采样块的数量，并根据所述数量确定所述当前编码块的最优模式为帧内预测模式的第一比率；
若所述第一比率大于第一预设比率阈值，且，所述预估帧内编码代价与第一调节因子的乘积小于所述预估帧间编码代价与第二调节因子的乘积，则跳过所述当前编码块的ME编码，其中，所述第一调节因子小于所述第二调节因子。
在一种实施方式中，当所述判决信息为所述当前编码块在进行递归编码后得到的多个子块的编码信息时，所述子块的编码信息包括：子块的最优模式以及该子块是否进一步递归划分；
所述跳过ME判决模块1002可以包括如下子模块：
比率计算子模块，设置为根据当前编码块的每个子块的最优模式，确定当前编码块的最优模式为帧内预测模式的第二比率，以及，当前编码块的最优模式为SKIP模式的第三比率；以及，根据当前编码块的每个子块是否进一步递归划分，确定当前编码块的子块递归比率；
比率判决子模块，设置为根据所述第二比率、所述第三比率和/或所述子块递归比率，判断是否跳过所述当前编码块的ME编码。
在一种实施方式中，所述比率判决子模块设置为：
若所述子块递归比率大于预设递归比率阈值，且，所述第二比率大于第二预设比率阈值，则跳过所述当前编码块的ME编码；
或者，
若所述第三比率大于第三预设比率阈值，且，所述子块递归比率大于第四预设比率阈值，则跳过所述当前编码块的ME编码。
在一种实施方式中，当所述判决信息为根据已执行的模式确定的已执行模式信息时，所述已执行模式信息包括：阶段最优模式SATD代价以及帧内预测SATD代价；
所述跳过ME判决模块1002可以包括如下子模块：
SATD代价判决子模块，设置为若当前编码块未进行递归编码，且，所述帧内预测SATD代价与第三调节因子的乘积小于所述阶段最优模式SATD代价与第四调节因子的乘积，则跳过所述当前编码块的ME编码，其中，所述第三调节因子大于所述第四调节因子。
在一种实施方式中，当所述判决信息为根据已执行的模式确定的已执行模式信息时，所述已执行的模式至少包括2Nx2N模式以及BIDIR模式，所述已执行模式信息包括：2Nx2N模式中执行的MERGE模式的MERGE模式SATD代价，以及，阶段最优模式SATD代价；
所述跳过ME判决模块1002可以包括如下子模块：
第一部分ME跳过判决子模块，设置为若当前预测单元为非正方形预测单元，则判断所述MERGE模式SATD代价是否小于所述阶段最优模式SATD代价；若所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，则对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
在一种实施方式中，若当前编码块进行了递归编码，则所述已执行模式信息还包括当前编码块的最优模式为SKIP模式的比率；
所述跳过ME判决模块1002可以包括如下子模块：
第一部分ME跳过判决子模块，设置为若所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，且，所述当前编码块的最优模式为SKIP模式的比率大于预设比率阈值，则对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
需要说明的是，本申请实施例所提供的上述视频预测编码的装置可执行本申请实施例所提供的视频预测编码的方法，具备执行方法相应的功能模块和有益效果。
图11为本申请实施例提供的一种电子设备的结构示意图，如图11所示，该电子设备包括处理器1110、存储器1120、输入装置1130和输出装置1140；电子设备中处理器1110的数量可以是一个或多个，图11中以一个处理器1110为例；电子设备中的处理器1110、存储器1120、输入装置1130和输出装置1140可以通过总线或其他方式连接，图11中以通过总线连接为例。
存储器1120作为一种计算机可读存储介质，可设置为存储软件程序、计算机可执行程序以及模块，如本申请实施例中的方法对应的程序指令/模块。处理器1110通过运行存储在存储器1120中的软件程序、指令以及模块，从而执行电子设备的多种功能应用以及数据处理，即实现上述的方法。
存储器1120可主要包括存储程序区和存储数据区，其中，存储程序区
可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据终端的使用所创建的数据等。此外，存储器1120可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。在一些实例中，存储器1120可包括相对于处理器1110远程设置的存储器，这些远程存储器可以通过网络连接至电子设备。上述网络 的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
输入装置1130可设置为接收输入的数字或字符信息，以及产生与电子设备的用户设置以及功能控制有关的键信号输入。输出装置1140可包括显示屏等显示设备。
本申请实施例还提供一种包含计算机可执行指令的存储介质，所述计算机可执行指令在由服务器的处理器执行时设置为执行本申请任一实施例中的方法。
通过以上关于实施方式的描述，所属领域的技术人员可以清楚地了解到，本申请可借助软件及必需的通用硬件来实现，当然也可以通过硬件实现。基于这样的理解，本申请的技术方案本质上或者说对相关技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在计算机可读存储介质中，如计算机的软盘、只读存储器(Read-Only Memory,ROM)、随机存取存储器(Random Access Memory,RAM)、闪存(FLASH)、硬盘或光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请多个实施例所述的方法。计算机可读存储介质可以是非暂态计算机可读存储介质。
值得注意的是，上述装置的实施例中，所包括的多个单元和模块只是按照功能逻辑进行划分的，但并不局限于上述的划分，只要能够实现相应的功能即可；另外，多个功能单元的具体名称也只是为了便于相互区分，并不用于限制本申请的保护范围。

Claims (11)

  1. 一种视频预测编码的方法，包括：
    在帧间预测编码时，获取与当前编码块相关的判决信息，所述判决信息包括以下之一：编码器在进行轻量级视频编码预分析时确定的预分析信息，所述当前编码块在进行递归编码后得到的多个子块的编码信息，以及根据已执行的模式确定的已执行模式信息；
    根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。
  2. 根据权利要求1所述的方法，其中，响应于确定所述判决信息为编码器在进行轻量级视频编码预分析时确定的预分析信息，所述根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码，包括：
    根据所述当前编码块的大小，确定对应的下采样块的数量，以及索引每个下采样块的预分析信息，其中，所述下采样块的数量为多个；
    汇总所述下采样块的预分析信息，并根据所述汇总的结果判断是否跳过所述当前编码块的ME编码。
  3. 根据权利要求2所述的方法，其中，所述下采样块的预分析信息包括帧间编码代价、帧内编码代价、以及所述下采样块预测的最优模式；
    所述汇总所述下采样块的预分析信息，并根据所述汇总的结果判断是否跳过所述当前编码块的ME编码，包括：
    计算所述当前编码块对应的所有下采样块的帧间编码代价的总和，得到所述当前编码块的预估帧间编码代价；
    计算所述当前编码块对应的所有下采样块的帧内编码代价的总和，得到所述当前编码块的预估帧内编码代价；
    计算所述当前编码块对应的所有下采样块中最优模式为帧内预测模式的下采样块的数量，并根据所述数量确定所述当前编码块的最优模式为帧内预测模式的第一比率；
    响应于确定所述第一比率大于第一预设比率阈值，且所述预估帧内编码代价与第一调节因子的乘积小于所述预估帧间编码代价与第二调节因子的乘积，跳过所述当前编码块的ME编码，其中，所述第一调节因子小于所述第二调节因子。
  4. 根据权利要求1所述的方法，其中，响应于确定所述判决信息为所述当前编码块在进行递归编码后得到的多个子块的编码信息，所述子块的编码信息包括：每个子块的最优模式以及所述每个子块是否递归划分；
    所述根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码，包括：
    根据所述当前编码块的所述每个子块的最优模式，确定所述当前编码块的最优模式为帧内预测模式的第二比率，以及所述当前编码块的最优模式为SKIP 模式的第三比率；
    根据所述当前编码块的所述每个子块是否递归划分，确定所述当前编码块的子块递归比率；
    根据所述第二比率、所述第三比率和所述子块递归比率中的至少之一，判断是否跳过所述当前编码块的ME编码。
  5. 根据权利要求4所述的方法，其中，所述根据所述第二比率、所述第三比率和所述子块递归比率中的至少之一，判断是否跳过所述当前编码块的ME编码，包括：
    响应于确定所述子块递归比率大于预设递归比率阈值，且所述第二比率大于第二预设比率阈值，跳过所述当前编码块的ME编码；或者，
    响应于确定所述第三比率大于第三预设比率阈值，且所述子块递归比率大于第四预设比率阈值，跳过所述当前编码块的ME编码。
  6. 根据权利要求1所述的方法，其中，响应于确定所述判决信息为根据已执行的模式确定的已执行模式信息，所述已执行模式信息包括：阶段最优模式SATD代价以及帧内预测SATD代价；
    所述根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码，包括：
    响应于确定所述当前编码块未进行递归编码，且所述帧内预测SATD代价与第三调节因子的乘积小于所述阶段最优模式SATD代价与第四调节因子的乘积，跳过所述当前编码块的ME编码，其中，所述第三调节因子大于所述第四调节因子。
  7. 根据权利要求1所述的方法，其中，响应于确定所述判决信息为根据已执行的模式确定的已执行模式信息，所述已执行的模式至少包括2Nx2N模式以及BIDIR模式，所述已执行模式信息包括：2Nx2N模式中执行的MERGE模式的MERGE模式SATD代价，以及阶段最优模式SATD代价，N为正整数；
    所述根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码，包括：
    响应于确定所述当前预测单元为非正方形预测单元，判断所述MERGE模式SATD代价是否小于所述阶段最优模式SATD代价；
    响应于确定所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
  8. 根据权利要求7所述的方法，其中，响应于确定所述当前编码块进行了递归编码，所述已执行模式信息还包括所述当前编码块的最优模式为SKIP模式的比率；
    所述根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码，还包括：
    响应于确定所述MERGE模式SATD代价小于所述阶段最优模式SATD代价，且所述当前编码块的最优模式为SKIP模式的比率大于预设比率阈值，对所述非正方形预测单元执行MERGE模式，并跳过所述非正方形预测单元的前向ME编码、后向ME编码以及双向ME编码。
  9. 一种视频预测编码的装置，包括：
    判决信息获取模块，设置为在帧间预测编码时，获取与当前编码块相关的判决信息；所述判决信息包括以下之一：编码器在进行轻量级视频编码预分析时确定的预分析信息，所述当前编码块在进行递归编码后得到的多个子块的编码信息，以及根据已执行的模式确定的已执行模式信息；
    跳过ME判决模块，设置为根据所述判决信息，判断是否跳过所述当前编码块的运动估计ME编码。
  10. 一种电子设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述程序时实现如权利要求1-8中任一所述的方法。
  11. 一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1-8任一所述的方法。
PCT/CN2021/135246 2020-12-11 2021-12-03 视频预测编码的方法及装置 Ceased WO2022121786A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP21902493.2A EP4262205A4 (en) 2020-12-11 2021-12-03 METHOD AND APPARATUS FOR PREDICTIVE VIDEO CODING
US18/256,894 US12581057B2 (en) 2020-12-11 2021-12-03 Video predictive coding method and apparatus
JP2023535576A JP7589929B2 (ja) 2020-12-11 2021-12-03 動画予測符号化の方法及び装置

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202011459744.1 2020-12-11
CN202011459744.1A CN112637592B (zh) 2020-12-11 2020-12-11 一种视频预测编码的方法及装置

Publications (1)

Publication Number Publication Date
WO2022121786A1 true WO2022121786A1 (zh) 2022-06-16

Family

ID=75312249

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/135246 Ceased WO2022121786A1 (zh) 2020-12-11 2021-12-03 视频预测编码的方法及装置

Country Status (5)

Country Link
US (1) US12581057B2 (zh)
EP (1) EP4262205A4 (zh)
JP (1) JP7589929B2 (zh)
CN (1) CN112637592B (zh)
WO (1) WO2022121786A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116389763A (zh) * 2023-06-05 2023-07-04 瀚博半导体(上海)有限公司 基于多种编码器的视频编码方法和装置
CN116996679A (zh) * 2023-06-16 2023-11-03 有半岛(北京)信息科技有限公司 基于预编码信息拆分的编码加速方法及系统

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112637592B (zh) * 2020-12-11 2024-07-05 百果园技术(新加坡)有限公司 一种视频预测编码的方法及装置
CN115314716A (zh) * 2021-05-06 2022-11-08 腾讯科技（深圳）有限公司 视频编码方法、装置、计算机可读介质及电子设备
CN113645465B (zh) * 2021-08-06 2023-10-13 广州安思创信息技术有限公司 一种基于hevc的帧间cu深度估计方法及装置
CN114584768A (zh) * 2022-02-17 2022-06-03 百果园技术(新加坡)有限公司 视频编码控制方法、装置、设备和存储介质
CN114845103B (zh) * 2022-06-08 2025-08-29 百果园技术(新加坡)有限公司 基于肤色检测的视频编码控制方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080019448A1 (en) * 2006-07-24 2008-01-24 Samsung Electronics Co., Ltd. Motion estimation apparatus and method and image encoding apparatus and method employing the same
CN104918047A (zh) * 2015-05-29 2015-09-16 北京奇艺世纪科技有限公司 一种双向运动估计的排除方法和装置
CN107396102A (zh) * 2017-08-30 2017-11-24 中南大学 一种基于Merge技术运动矢量的帧间模式快速选择方法及装置
CN108848381A (zh) * 2018-06-20 2018-11-20 腾讯科技（深圳）有限公司 视频编码方法、解码方法、装置、计算机设备及存储介质
CN112637592A (zh) * 2020-12-11 2021-04-09 百果园技术(新加坡)有限公司 一种视频预测编码的方法及装置

Family Cites Families (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
BRPI0411765A (pt) 2003-06-25 2006-08-08 Thomson Licensing codificação de decisão modal rápida para inter-quadros
US8848799B2 (en) * 2009-09-02 2014-09-30 Sony Computer Entertainment Inc. Utilizing thresholds and early termination to achieve fast motion estimation in a video encoder
KR20110069740A (ko) * 2009-12-17 2011-06-23 에스케이 텔레콤주식회사 영상 부호화/복호화 방법 및 장치
WO2011129672A2 (ko) * 2010-04-16 2011-10-20 에스케이텔레콤 주식회사 영상 부호화/복호화 장치 및 방법
JP5598199B2 (ja) 2010-09-16 2014-10-01 富士通株式会社 動画像符号化装置
JP5655480B2 (ja) 2010-10-04 2015-01-21 富士通株式会社 動画像符号化装置
KR101337345B1 (ko) * 2012-01-27 2013-12-06 한양대학교 산학협력단 부호화기 및 서브펠 움직임 추정 생략 방법
US9667996B2 (en) * 2013-09-26 2017-05-30 Qualcomm Incorporated Sub-prediction unit (PU) based temporal motion vector prediction in HEVC and sub-PU design in 3D-HEVC
US10187655B2 (en) * 2015-09-30 2019-01-22 Apple Inc. Memory-to-memory low resolution motion estimation systems and methods
US10652570B2 (en) 2016-01-15 2020-05-12 Nec Corporation Moving image encoding device, moving image encoding method, and recording medium for recording moving image encoding program
CN105828084B (zh) 2016-03-30 2021-04-13 腾讯科技（深圳）有限公司 Hevc帧间编码处理方法和装置
CN110351552B (zh) * 2018-04-03 2021-06-25 杭州微帧信息科技有限公司 视频编码中一种快速编码方法
CN109729351B (zh) 2018-12-18 2020-09-29 中南大学 一种低复杂度配置下的hevc快速模式选择方法
EP3893505A4 (en) * 2018-12-27 2022-05-11 Huawei Technologies Co., Ltd. METHOD AND DEVICE FOR DETERMINING PREDICTION MODE, ENCODING DEVICE AND DECODING DEVICE
CN110896481B (zh) 2019-12-31 2022-03-08 杭州当虹科技股份有限公司 一种适用于hevc的快速帧内模式编码方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20080019448A1 (en) * 2006-07-24 2008-01-24 Samsung Electronics Co., Ltd. Motion estimation apparatus and method and image encoding apparatus and method employing the same
CN104918047A (zh) * 2015-05-29 2015-09-16 北京奇艺世纪科技有限公司 一种双向运动估计的排除方法和装置
CN107396102A (zh) * 2017-08-30 2017-11-24 中南大学 一种基于Merge技术运动矢量的帧间模式快速选择方法及装置
CN108848381A (zh) * 2018-06-20 2018-11-20 腾讯科技（深圳）有限公司 视频编码方法、解码方法、装置、计算机设备及存储介质
CN112637592A (zh) * 2020-12-11 2021-04-09 百果园技术(新加坡)有限公司 一种视频预测编码的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4262205A4 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116389763A (zh) * 2023-06-05 2023-07-04 瀚博半导体(上海)有限公司 基于多种编码器的视频编码方法和装置
CN116389763B (zh) * 2023-06-05 2023-08-11 瀚博半导体(上海)有限公司 基于多种编码器的视频编码方法和装置
CN116996679A (zh) * 2023-06-16 2023-11-03 有半岛(北京)信息科技有限公司 基于预编码信息拆分的编码加速方法及系统
CN116996679B (zh) * 2023-06-16 2026-02-06 有半岛(北京)信息科技有限公司 基于预编码信息拆分的编码加速方法及系统

Also Published As

Publication number Publication date
US20240098248A1 (en) 2024-03-21
CN112637592A (zh) 2021-04-09
JP2023553628A (ja) 2023-12-25
US12581057B2 (en) 2026-03-17
EP4262205A4 (en) 2024-06-19
CN112637592B (zh) 2024-07-05
EP4262205A1 (en) 2023-10-18
JP7589929B2 (ja) 2024-11-26

Similar Documents

Publication Publication Date Title
CN112637592B (zh) 一种视频预测编码的方法及装置
JP7610233B2 (ja) 動画予測符号化の方法および装置
CN110351552B (zh) 视频编码中一种快速编码方法
US10798414B2 (en) Method and device for selective multi-sample intra-prediction
CN112075077B (zh) 图像预测方法、装置、设备、系统及存储介质
CN105141954A (zh) 一种hevc帧间编码快速模式选择方法
CN111355951A (zh) 视频解码方法、装置及解码设备
CN113491132B (zh) 视频图像解码、编码方法、装置及可读存储介质
CN111385572A (zh) 预测模式确定方法、装置及编码设备和解码设备
US11962803B2 (en) Method and device for intra-prediction
JP2021536689A (ja) ピクチャパーティショニング方法及び機器
CN111355959A (zh) 一种图像块划分方法及装置
CN110139099B (zh) 基于预编码和编码satd值加权的帧间预测模式选择方法
WO2020143684A1 (zh) 图像预测方法、装置、设备、系统及存储介质
WO2020224476A1 (zh) 一种图像划分方法、装置及设备
CN105872564A (zh) H.264/avc到h.265/hevc转码的帧内预测模式决定方法及系统
WO2023123736A1 (zh) 预测方法、装置、设备、系统、及存储介质
WO2020134817A1 (zh) 预测模式确定方法、装置及编码设备和解码设备
WO2020043136A1 (zh) 图像划分方法及装置
CN112135128A (zh) 图像预测方法、编码树节点划分方法及其装置
CN112135148B (zh) 非可分离变换方法以及设备
RU2837746C1 (ru) Способ и устройство для прогнозного видеокодирования
Wang et al. Optimizing Technology in Video Coding and Decoding
KR20180121340A (ko) 압축 영역에서 야간 영상의 장면 전환 검출 방법 및 장치
WO2025145288A1 (zh) 编解码方法、码流、编码器、解码器以及存储介质

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: 21902493

Country of ref document: EP

Kind code of ref document: A1

WWE Wipo information: entry into national phase

Ref document number: 18256894

Country of ref document: US

Ref document number: 2023535576

Country of ref document: JP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2021902493

Country of ref document: EP

Effective date: 20230711

WWG Wipo information: grant in national office

Ref document number: 2023116573

Country of ref document: RU

WWG Wipo information: grant in national office

Ref document number: 18256894

Country of ref document: US