Image processing method, processing device and storage medium

By flexibly determining the indication information in video encoding, the problem of fixed indication information affecting encoding efficiency in existing technologies is solved, and a more efficient encoding process is achieved.

WO2025242236A1PCT designated stage Publication Date: 2025-11-27SHENZHEN TRANSSION HLDG CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2025/102215
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-06-19
Publication Date
2025-11-27

AI Technical Summary

Technical Problem

In existing video coding standards, the indication information during intra-frame prediction and/or inter-frame prediction is relatively fixed, which affects coding efficiency.

Method used

By flexibly determining or obtaining indication information, including indices, index groups, and index-related codewords in the candidate indication information list, the target indication information is determined based on the selection probability and rate-distortion optimization process, thereby improving coding efficiency.

Benefits of technology

It enables more efficient determination of instruction information during video encoding, thereby improving encoding efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025102215_27112025_PF_FP_ABST
    Figure CN2025102215_27112025_PF_FP_ABST
Patent Text Reader

Abstract

The present application provides an image processing method, a processing device, and a storage medium. The image processing method can be applied to the processing device. The image processing method comprises: according to a candidate indication information list, determining or obtaining indication information. The technical solution of the present application can flexibly determine or obtain indication information, thereby supporting improvement of coding efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Image processing method, processing device and storage medium TECHNICAL FIELD

[0001] The present application relates to the technical field of image processing, in particular to an image processing method, a processing device and a storage medium. BACKGROUND

[0002] The existing video coding standard (H.266 / VVC) proposes a coding technology for video frames, for example, when coding and decoding a video frame, the protocol divides each frame into different blocks and performs prediction processing and coding and decoding processing.

[0003] In the process of conceiving and implementing the present application, the inventors have found that at least the following problems exist: In the intra prediction and / or inter prediction process, the determination or obtaining of the indication information is relatively fixed, which affects the coding efficiency.

[0004] The foregoing description is to provide general background information and does not necessarily constitute prior art. SUMMARY

[0005] To solve the above technical problems, the present application provides an image processing method, a processing device and a storage medium, which can flexibly determine or obtain indication information, thereby supporting the improvement of coding efficiency.

[0006] The present application provides an image processing method, which can be applied to a processing device, comprising the steps of:

[0007] According to the candidate indication information list, the indication information is determined or obtained.

[0008] Optionally, the indication information comprises at least one of the following:

[0009] An index corresponding to the first mode;

[0010] A code word of the index corresponding to the first mode;

[0011] An index of an index group corresponding to the first mode;

[0012] A code word related to the index of the index group corresponding to the first mode;

[0013] An index of the first mode in the index group;

[0014] A code word related to the index of the first mode in the index group;

[0015] Information for indicating the first mode;

[0016] Information for indicating a sub-mode of the first mode;

[0017] Information for indicating a first mode in the first mode list;

[0018] The first mode and / or the syntax element related to the image block.

[0019] Optionally, the image processing method further comprises at least one of the following:

[0020] The code word of the index corresponding to the first mode is determined according to the selection probability of the first mode corresponding to the index;

[0021] The code word of the index related to the index grouping of the first mode corresponding index grouping is determined according to the selection probability of the first mode corresponding to the index grouping;

[0022] The code word of the index related to the index grouping of the first mode is determined according to the selection probability of the index in the index grouping;

[0023] The length of the code word is inversely proportional to the size of the selection probability.

[0024] Optionally, the image processing method further comprises at least one of the following:

[0025] The indication information is determined or obtained from the code stream,

[0026] The indication information is determined or obtained according to the rate-distortion optimization process;

[0027] The indication information is determined or obtained according to the selection probability and the list of candidate indication information;

[0028] The indication information is located in the code stream.

[0029] Optionally, the image processing method further comprises at least one of the following:

[0030] The indication information is determined according to a target indication information list in the at least one list of candidate indication information;

[0031] The indication information is included in an indication information grouping of the target indication information list;

[0032] The list of indication information corresponds to at least one candidate first mode;

[0033] The list of indication information includes first indication information with the same index and different index-related code words.

[0034] Optionally, the indication information grouping includes the index grouping.

[0035] Optionally, the list of indication information includes the list of indexes.

[0036] Optionally, the image processing method further comprises at least one of the following:

[0037] The selection probability of the indication information or the indication information grouping corresponding to the first position in the list of indication information is higher than the selection probability of the indication information or the indication information grouping corresponding to the second position.

[0038] the information length of the indication information or the indication information group at the first position in the indication information list is less than the information length of the indication information or the indication information at the second position;

[0039] the grouping scheme of the candidate indication information list comprises the number of indication information groups and the number of indication information of at least one indication information group.

[0040] Optionally, the target indication information list is determined or obtained according to at least one of the following:

[0041] the selected probability corresponding to the index is matched in the at least one candidate indication information list;

[0042] the selected probability corresponding to the index group is matched in the at least one candidate indication information list;

[0043] the selected probability distribution obtained by grouping the selected probability corresponding to the at least one index according to the grouping scheme of the at least one candidate indication information list;

[0044] at least one of the intra-group variance corresponding to the grouping result of the selected probability corresponding to the at least one index under the grouping scheme of the at least one candidate indication information list, the range of the intra-group selected probability mean, the square error of the intra-group selected probability mean, and the selected probability corresponding to the at least one indication information in the group.

[0045] The application further provides a processing device, comprising a memory and a processor, wherein the memory stores an image processing program, and the image processing program is executed by the processor to implement the steps of the image processing method according to any one of the above.

[0046] The application further provides a storage medium, wherein the storage medium stores a computer program, and the computer program is executed by a processor to implement the steps of the image processing method according to any one of the above.

[0047] As described above, the image processing method of the application can be applied to a processing device, comprising determining or obtaining indication information according to a candidate indication information list. Through the technical solution of the application, the indication information can be flexibly determined or obtained, thereby supporting the improvement of coding efficiency. BRIEF DESCRIPTION OF DRAWINGS

[0048] The accompanying drawings, which are incorporated into and form part of the specification, illustrate embodiments consistent with the application and, together with the specification, serve to explain the principles of the application. In order to more clearly illustrate the technical solutions of the embodiments of the application, the drawings needed to be used in the embodiment description will be briefly introduced as follows. Obviously, for those of ordinary skill in the art, other drawings can also be obtained without creative labor based on these drawings.

[0049] Fig. 1 is a schematic diagram of a hardware structure of a mobile terminal implementing various embodiments of the present application;

[0050] Fig. 2 is a schematic diagram of a communication network system architecture provided by an embodiment of the present application;

[0051] Fig. 3 is a schematic diagram of a hardware structure of a controller 140 provided by the present application;

[0052] Fig. 4 is a schematic diagram of a hardware structure of a network node 150 provided by the present application;

[0053] Fig. 5 is a schematic diagram of a flow of an image processing method according to a first embodiment;

[0054] Fig. 6 is a schematic diagram of a data flow when a processing device is an encoder provided by the present application;

[0055] Fig. 7 is a schematic diagram of a data flow when a processing device is a decoder provided by the present application;

[0056] Fig. 8 is a schematic diagram of an angle distribution provided by the first embodiment;

[0057] Fig. 9 is a schematic diagram of four offsets corresponding to an angle distribution provided by the first embodiment;

[0058] Fig. 10 is a schematic diagram of a division mode provided by the first embodiment;

[0059] Fig. 11 is a schematic diagram of an index selection probability distribution of a first candidate indication information list shown in a third embodiment;

[0060] Fig. 12 is a schematic diagram of an index selection probability distribution of a second candidate indication information list shown in the third embodiment;

[0061] Fig. 13 is a schematic diagram of an index selection probability distribution of a third candidate indication information list shown in the third embodiment;

[0062] Fig. 14 is a schematic diagram of an index selection probability distribution of an indication information list provided by the present application;

[0063] Fig. 15 is a schematic diagram of a division mode of a Tile and column boundaries and row boundaries shown in a fourth embodiment;

[0064] Fig. 16 is a schematic diagram of a plurality of preset angle directions in the fourth embodiment;

[0065] Fig. 17 is a schematic diagram of a composition of an image being divided into a plurality of Slices or Tiles in the fourth embodiment;

[0066] ​FIG. 18 is a diagram illustrating a hierarchical relationship between a slice, a CTU, and a CU in a fourth embodiment.

[0067] The implementation, functional features and advantages of the present application will be further described with reference to the embodiments in conjunction with the accompanying drawings. The above-described drawings have shown the specific embodiments of the present application, and will be described in more detail hereinafter. These drawings and the written description are not intended to restrict the scope of the present application by any means, but to explain the concept of the present application to those skilled in the art by referring to the specific embodiments. DETAILED DESCRIPTION

[0068] Referring to FIG. 1, a hardware structure of a mobile terminal to implement various embodiments of the present application can include an RF (Radio Frequency) unit 101, a WiFi module 102, an audio output unit 103, an A / V (audio / video) input unit 104, a sensor 105, a display unit 106, a user input unit 107, an interface unit 108, a memory 109, a processor 110, and a power supply 111, etc. Those skilled in the art will appreciate that the mobile terminal structure shown in FIG. 1 does not constitute a limitation on the mobile terminal, and the mobile terminal can include more or less components than those shown, or some components can be combined, or different components can be arranged in different positions.

[0069] The components of the mobile terminal will be described in detail with reference to FIG. 1 as follows:

[0070] The radio frequency unit 101 can be used for receiving and transmitting signals in the process of transmitting or receiving information or a call. Specifically, the radio frequency unit 101 receives downlink information from a base station and provides the received information to the processor 110 for processing, and / or transmits uplink data to the base station. Generally, the radio frequency unit 101 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, etc. In addition, the radio frequency unit 101 can communicate with a network and other devices through wireless communications. The wireless communications can use any communication standard or protocol, including but not limited to GSM (Global System for Mobile communication), GPRS (General Packet Radio Service), CDMA2000 (Code Division Multiple Access 2000), WCDMA (Wideband Code Division Multiple Access), TD-SCDMA (Time Division-Synchronous Code Division Multiple Access), FDD-LTE (Frequency Division Duplexing-Long Term Evolution), TDD-LTE (Time Division Duplexing-Long Term Evolution), 5G, 6G, etc.

[0071] WiFi is a short-range wireless transmission technology. The WiFi module 102 can help the user to send and receive e-mails, browse web pages, and access streaming media, etc. It provides the user with wireless broadband Internet access. Although the WiFi module 102 is shown in FIG. 1, it is understood that it is not a necessary component of the mobile terminal, and can be omitted without changing the essence of the application.

[0072] The audio output unit 103 can convert audio data, which is received by the radio frequency unit 101 or the WiFi module 102 or stored in the memory 109, into an audio signal and output the audio signal as sound when the mobile terminal 100 is in a call signal reception mode, a call mode, a recording mode, a voice recognition mode, a broadcast reception mode, etc. Also, the audio output unit 103 can provide audio output related to a particular function performed by the mobile terminal 100 (e.g., a call signal reception sound, a message reception sound, etc.). The audio output unit 103 can include a speaker, a buzzer, etc.

[0073] The A / V input unit 104 is configured to receive audio or video signals. The A / V input unit 104 can include a graphics processor (GPU) 1041 and a microphone 1042. The graphics processor 1041 processes image data of a still picture or a video obtained by an image capture device (e.g., a camera) in a video capture mode or an image capture mode. Processed image frames can be displayed on the display unit 106. Processed image frames can be stored in the memory 109 (or other storage medium) or transmitted via the radio frequency unit 101 or the WiFi module 102. The microphone 1042 can receive sound (audio data) via the microphone 1042 in a telephone call mode, a recording mode, a voice recognition mode, or the like, and can process such sound into audio data. Processed audio (voice) data can be converted into a format that can be transmitted to a mobile communication base station via the radio frequency unit 101 in the case of the telephone call mode. The microphone 1042 can implement various types of noise cancellation (or suppression) algorithms to cancel (or suppress) noise or interference generated in the process of receiving and transmitting audio signals.

[0074] The mobile terminal 100 also includes at least one sensor 105, such as a light sensor, a motion sensor, and other sensors. The light sensor includes an ambient light sensor and a proximity sensor, which can optionally adjust the brightness of the display panel 1061 according to the brightness of ambient light, and turn off the display panel 1061 and / or the backlight when the mobile terminal 100 is moved to the ear. As one of the motion sensors, the accelerometer sensor can detect the magnitude of acceleration in each direction (generally, three axes), and detect the magnitude and direction of gravity when at rest, which can be used for applications that recognize the posture of the mobile terminal (such as switching between landscape and portrait screens, related games, magnetometer posture calibration), vibration recognition related functions (such as a pedometer, a knock), and the like. The mobile terminal can also be configured with a fingerprint sensor, a pressure sensor, an iris sensor, a molecular sensor, a gyroscope, a barometer, a hygrometer, a thermometer, an infrared sensor, and other sensors, which are not described herein.

[0075] The display unit 106 is configured to display information input by a user or information provided to the user. The display unit 106 can include a display panel 1061, which can be configured in the form of a liquid crystal display (LCD), an organic light-emitting diode (OLED), or the like.

[0076] The user input unit 107 can be used to receive input numerals or character information, and to generate key signal inputs related to user settings of the mobile terminal and control of functions. Optionally, the user input unit 107 can include a touch panel 1071 and other input devices 1072. The touch panel 1071, also called a touch screen, can collect touch operations of a user on or proximity thereto (such as operations of the user using a finger, a stylus, or any suitable object or accessory on or in proximity to the touch panel 1071), and drive corresponding connection devices according to a pre-set program. The touch panel 1071 can include two parts, a touch detecting device and a touch controller. The touch detecting device detects the user's touch position and detects signals resulting from touch operations, and transmits the signals to the touch controller; the touch controller receives touch information from the touch detecting device, and converts it into touch coordinates, and sends it to the processor 110, and can receive commands from the processor 110 and execute them. In addition, the touch panel 1071 can be implemented in various types such as a resistive type, a capacitive type, an infrared type, and a surface acoustic wave type. In addition to the touch panel 1071, the user input unit 107 can include other input devices 1072. Optionally, the other input devices 1072 can include one or more of, but are not limited to, a physical keyboard, function keys (such as volume control buttons, switch buttons, etc.), a trackball, a mouse, a joystick, etc.

[0077] Optionally, the touch panel 1071 can cover the display panel 1061, and when the touch panel 1071 detects a touch operation on or in proximity thereto, it transmits to the processor 110 to determine the type of touch event, and then the processor 110 provides corresponding visual output on the display panel 1061 according to the type of touch event. Although in FIG. 1, the touch panel 1071 and the display panel 1061 are implemented as two independent components to realize the input and output functions of the mobile terminal, in some embodiments, the touch panel 1071 and the display panel 1061 can be integrated to realize the input and output functions of the mobile terminal, without being limited specifically herein.

[0078] The interface unit 108 serves as an interface through which at least one external device can be connected with the mobile terminal 100; for example, the external device can include a wired or wireless headset port, an external power supply (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device having an identification module, an audio input / output (I / O) port, a video I / O port, an earphone port, and the like. The interface unit 108 can be used to receive input (for example, data information, power, and the like) from an external device and to transmit the received input to one or more elements within the mobile terminal 100, or can be used to transmit data between the mobile terminal 100 and the external device.

[0079] The memory 109 can be used to store software programs and various data. The memory 109 can mainly include a program storage area and a data storage area, and the program storage area can store an operating system, application programs required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; and the data storage area can store data created according to the use of the mobile phone (such as audio data, a phone book, etc.), and the like. In addition, the memory 109 can include a high-speed random access memory, and can also include a nonvolatile memory, such as at least one magnetic disk storage device, a flash memory device, or other volatile solid-state memory device.

[0080] The processor 110 is a control center of the mobile terminal, connects all parts of the mobile terminal through various interfaces and lines, executes various functions of the mobile terminal and processes data by running or executing software programs and / or modules stored in the memory 109 and calling data stored in the memory 109, and thus performs overall monitoring on the mobile terminal. The processor 110 can include one or more processing units; preferably, the processor 110 can integrate an application processor and a modem processor, and the application processor can mainly process an operating system, a user interface, and application programs, and the like, and the modem processor can mainly process wireless communication. It can be understood that the above-mentioned modem processor can also not be integrated into the processor 110.

[0081] The mobile terminal 100 can also include a power supply 111 (such as a battery) for supplying power to various components; preferably, the power supply 111 can be logically connected to the processor 110 through a power management system, so as to realize functions such as management of charging, discharging, and power consumption management through the power management system.

[0082] Although not shown in FIG. 1, the mobile terminal 100 can also include a Bluetooth module, and the like, which will not be described here.

[0083] In order to facilitate understanding of the embodiments of the present application, the communication network system based on the mobile terminal of the present application is described below.

[0084] Referring to FIG. 2, FIG. 2 is a communication network system architecture diagram provided by an embodiment of the present application, and the communication network system is an LTE system of a general mobile communication technology, which includes a UE (User Equipment) 201, an E-UTRAN (Evolved UMTS Terrestrial Radio Access Network) 202, an EPC (Evolved Packet Core) 203, and an operator's IP service 204 which are sequentially connected in communication.

[0085] Optionally, the UE 201 can be the terminal 100 described above, which will not be repeated here.

[0086] The E-UTRAN 202 includes eNode Bs 2021 and other eNode Bs 2022. Optionally, the eNode B 2021 can be connected to the other eNode B 2022 through backhaul (for example, an X2 interface), the eNode B 2021 is connected to the EPC 203, and the eNode B 2021 can provide access for the UE 201 to the EPC 203.

[0087] The EPC 203 can include a MME (Mobility Management Entity) 2031, a HSS (Home Subscriber Server) 2032, other MMEs 2033, a SGW (Serving Gate Way) 2034, a PGW (PDN Gate Way) 2035, and a PCRF (Policy and Charging Rules Function) 2036. Optionally, the MME 2031 is a control node that processes signaling between the UE 201 and the EPC 203, and provides bearer and connection management. The HSS 2032 is used to provide some registers to manage functions such as a home location register (not shown in the figure), and to save some user-specific information about service features, data rates, etc. All user data can be transmitted through the SGW 2034, the PGW 2035 can provide IP address allocation and other functions for the UE 201, and the PCRF 2036 is a policy and charging control policy decision point for service data flow and IP bearer resources, which selects and provides available policy and charging control decisions for policy and charging enforcement function elements (not shown in the figure).

[0088] The IP service 204 can include the Internet, an intranet, an IMS (IP Multimedia Subsystem), or other IP services.

[0089] Although the above describes the LTE system as an example, those skilled in the art should know that the present application is not only applicable to the LTE system, but also applicable to other wireless communication systems, such as GSM, CDMA2000, WCDMA, TD-SCDMA, 5G, and future new network systems (such as 6G), etc., which are not limited here.

[0090] Figure 3 is a schematic diagram of a hardware structure of a controller 140 according to an embodiment of the present application. The controller 140 comprises a memory 1401 and a processor 1402. The memory 1401 is configured to store program instructions. The processor 1402 is configured to invoke the program instructions stored in the memory 1401 to perform the steps executed by the controller in the method embodiment one. The implementation principle and the beneficial effects are similar, and thus are not described here in detail.

[0091] Optionally, the controller further comprises a communication interface 1403. The communication interface 1403 can be connected with the processor 1402 through the bus 1404. The processor 1402 can control the communication interface 1403 to realize the receiving and sending functions of the controller 140.

[0092] Figure 4 is a schematic diagram of a hardware structure of a network node 150 according to an embodiment of the present application. The network node 150 comprises a memory 1501 and a processor 1502. The memory 1501 is configured to store program instructions. The processor 1502 is configured to invoke the program instructions stored in the memory 1501 to perform the steps executed by the first node in the method embodiment one. The implementation principle and the beneficial effects are similar, and thus are not described here in detail.

[0093] Optionally, the controller further comprises a communication interface 1503. The communication interface 1503 can be connected with the processor 1502 through the bus 1504. The processor 1502 can control the communication interface 1503 to realize the receiving and sending functions of the network node 150.

[0094] The integrated modules implemented in the form of software function modules can be stored in a computer readable storage medium. The software function modules are stored in a storage medium, and include a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) or a processor (English: processor) to execute part of the steps of the method embodiments of the present application.

[0095] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions according to the embodiments of the present application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network or other programmable device. The computer instructions can be stored in a storage medium or transferred from one storage medium to another, for example, the computer instructions can be transferred from one website, computer, server or data center to another website, computer, server or data center through wired (such as coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) mode. The storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. containing one or more available media sets. The available medium can be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)) and the like.

[0096] First embodiment

[0097] Referring to FIG. 5, FIG. 5 is a flowchart of a processing method according to the first embodiment, the image processing method of the embodiments of the present application can be applied to a processing device, including step S10:

[0098] In step S10, the indication information is determined or obtained according to the candidate indication information list.

[0099] In the present embodiment, the processing device can be a smart terminal such as a mobile phone, a computer, etc., or a server such as a local server or a cloud server. In the present embodiment and the present application, the processing device is mainly illustrated as a smart terminal.

[0100] Optionally, the candidate indication information list can include at least one candidate indication information list, and the indication information includes information for indicating image prediction according to the prediction mode, and in the process of image coding, an optimal indication information list is selected from the at least one candidate indication information list to encode the index corresponding to the prediction mode, to obtain the corresponding indication information.

[0101] Optionally, the technical solutions of the present embodiment can be applied to the fields of image coding, video coding, hardware video coding, special circuit video coding, real-time video coding, etc.

[0102] Optionally, referring to FIG. 6, when the processing device is an encoder at the encoding side, the encoder can receive video source input video data, such as the encoder receiving video pictures from a video source, determine a to-be-predicted picture in the video pictures, divide the to-be-predicted picture into at least one image block, perform prediction processing on each of the at least one image block by using temporal and / or spatial correlation between the video pictures, including intra-prediction processing and / or inter-prediction processing, and the intra-prediction processing and / or the inter-prediction processing includes derivation of at least one prediction mode and / or at least one prediction mode, for the prediction mode, the encoder determines a prediction mode finally adopted by each of the at least one image block by using, for example, rate-distortion cost, such as calculating rate-distortion cost corresponding to each prediction mode or rate-distortion cost in a manner of combining several prediction modes, to determine a minimum rate-distortion cost from the at least one rate-distortion cost, and the prediction mode or combination of prediction modes corresponding to the minimum rate-distortion cost is the prediction mode finally adopted by the image block. In this process, the division manner of the image block can be determined, and a target image block, i.e., a prediction block, is determined or obtained according to the prediction mode finally adopted and / or the division manner.

[0103] Optionally, the indication information is determined or obtained according to the candidate indication information list.

[0104] Optionally, the indication information is indication information corresponding to the prediction mode and / or the division manner.

[0105] Optionally, the indication information includes at least one of the following:

[0106] an index corresponding to the first mode;

[0107] a code word of the index corresponding to the first mode;

[0108] an index of an index group to which the index corresponding to the first mode belongs;

[0109] a code word related to the index of the index group to which the index corresponding to the first mode belongs;

[0110] an index of the first mode in the index group;

[0111] a code word related to the index of the first mode in the index group;

[0112] information for indicating the first mode;

[0113] information for indicating a sub-mode of the first mode;

[0114] information for indicating the first mode in a first mode list;

[0115] a syntax element related to the first mode and / or the image block.

[0116] Optionally, a residual block between the prediction block and the current block can be calculated, the residual block can be processed by a transform and quantization, and then encoded by an entropy encoder to form an encoded bitstream.

[0117] Optionally, the prediction parameters corresponding to the determined prediction mode and / or related side information can be included in the encoded bitstream.

[0118] Optionally, the prediction parameters (e.g., the indication information) are packed into the encoded bitstream after being entropy encoded.

[0119] Optionally, the prediction parameters at least include the indication information of the prediction mode.

[0120] Optionally, the transformed and quantized residual block can be added to the corresponding prediction data (e.g., the prediction block) obtained by using the prediction mode after being inverse quantized and inverse transformed to obtain a reconstructed block. After obtaining the reconstructed block, a loop filter module performs loop filtering processing on the reconstructed block according to filter control parameters to reduce distortion.

[0121] Optionally, the reconstructed block after the loop filtering processing is stored in a coded picture buffer.

[0122] In the embodiment, by using the above image processing method applied to the encoder, the encoder can perform efficient image prediction processing on the received video data, determine the best prediction mode, encode the prediction parameters and indication information of the prediction mode to form a bitstream and send it to the decoder, complete the transmission of the indication information, and decode the target image block at the decoding end.

[0123] Optionally, referring to FIG. 7, when the processing device is a decoder at the decoding side, after receiving the encoded bitstream, an entropy decoding unit of the decoder parses and decodes the encoded bitstream to obtain transform coefficients. An inverse transform unit and an inverse quantization unit of the decoder perform inverse transform and inverse quantization processing on the transform coefficients to obtain a residual block.

[0124] Optionally, the entropy decoding unit of the decoder parses and decodes the encoded bitstream to obtain prediction data, such as prediction parameters (e.g., the indication information) and / or related side information.

[0125] Optionally, the decoder determines or obtains the indication information according to the candidate indication information list.

[0126] Optionally, a prediction processing unit of the decoder performs prediction processing by using the prediction parameters to determine a prediction block corresponding to the residual block.

[0127] Optionally, the prediction processing with the prediction parameter comprises: determining or obtaining the target image block, i.e., the prediction block, according to the first mode corresponding to the indication information.

[0128] Optionally, the first mode comprises a prediction mode and / or a partition mode.

[0129] Optionally, the prediction processing comprises intra prediction processing and / or inter prediction processing, and the intra prediction processing and / or the inter prediction processing comprises at least one derivation mode and / or a combination of at least one prediction mode.

[0130] Optionally, the processing method comprises: determining or obtaining the target image block, i.e., the prediction block, according to the first mode (e.g., a prediction mode and / or a partition mode) corresponding to the indication information.

[0131] Optionally, the obtained residual block and the corresponding prediction block (including a predicted luma block and a predicted chroma block) are added to obtain a reconstructed block, and a loop filter unit of the decoder performs loop filtering processing on the reconstructed block to reduce distortion and improve video quality.

[0132] Optionally, the processing method further comprises: the reconstructed block after the loop filtering processing is further combined into a decoded image and stored in a decoded image buffer or output as a decoded video signal.

[0133] Optionally, when the processing device is an encoder, the initially obtained prediction value can be a prediction value obtained in a corresponding prediction mode, which can be directly used in a rate-distortion cost process.

[0134] Optionally, when the processing device is a decoder, the initially obtained prediction value can be a prediction value obtained in a prediction mode corresponding to a to-be-predicted block (i.e., an image block located at the decoding end) indicated by a syntax element parsed in a bitstream.

[0135] Optionally, the prediction block can be taken as the target image block, a residual block between the target image block and the current block can be calculated, and then the residual block can be processed by transformation and quantization and encoded by an entropy encoder to form an encoded bitstream. Alternatively, the prediction block can be processed by other models, the image block processed by the other models can be taken as the target image block, and the step of calculating the residual block between the target image block and the current block can be performed.

[0136] In the embodiment, by using the image processing method applied to the decoder end, the encoder can perform decoding processing on the received code stream, obtain corresponding indication information and the best prediction mode, perform image prediction according to the prediction mode, obtain a corresponding prediction image block, and then determine a target image block, complete the whole image processing process, and improve the image quality.

[0137] Optionally, the processing device can obtain video image data from a video source, divide each frame of the video image data to obtain at least one image block, and determine an image block for which prediction is to be performed at a current time as a current block.

[0138] Optionally, in the intra prediction, the prediction mode can include at least one angle prediction mode (for example, the angle prediction mode shown in FIG. 13), at least one non-angle prediction mode, and a prediction mode determined or obtained by using at least one derivation mode.

[0139] Optionally, the division mode can include a sub-mode of the division mode prediction mode in the GPM mode.

[0140] Optionally, the derivation mode is a derivation mode for deriving an intra prediction mode.

[0141] Optionally, the angle prediction mode is a technique for predicting a current pixel block by propagating the values of neighboring pixels along a specific direction to generate a prediction block, which is mainly used to handle directional textures in images, can effectively reduce spatial redundancy and improve compression efficiency, in the H.265 / HEVC (High Efficiency Video Coding) standard, there are 33 angle prediction modes in the intra prediction mode, which cover different angles from horizontal to vertical, ensuring accurate prediction of various texture directions, in the H.266 / VVC (Versatile Video Coding) standard, the angle mode is expanded to 65, and new directions are more intensive to more accurately capture edges in natural video.

[0142] Optionally, the non-angle prediction mode can be a prediction mode other than the angle prediction mode, for example, the non-angle prediction mode includes at least one of the following: DC mode (direct current mode), Planar mode (planar mode), and neural network-based prediction mode.

[0143] Optionally, the derivation mode is a mode for determining or obtaining a prediction mode and / or a candidate mode, the derivation mode is a method for deriving a prediction mode matched by a current block by analyzing related information of the current block, for example, the derivation mode includes at least one of the following: Decoder side intra mode derivation (DIMD) mode, Occurrence-based Intra Coding (OBIC) mode, and template-based intra mode derivation (TIMD) mode.

[0144] Optionally, the indication information is information for indicating a prediction mode, to indicate which prediction mode needs to be taken by the processing device when processing the current image block.

[0145] Optionally, the prediction mode can include one of the following modes: an intra prediction mode, an inter prediction mode, a sub mode of the intra prediction mode, a sub mode of the inter prediction mode, a geometric partition mode, a most probable mode, a non-most probable mode, a TIMD mode, a DIMD mode, an OBIC mode, a CCP (Cross-Component Prediction) mode, a neural network based prediction mode, and at least one of the prediction modes in a prediction mode list.

[0146] Optionally, the indication information includes an index corresponding to the prediction mode and / or the partition mode, and the index corresponding to the prediction mode refers to a serial number for representing the prediction mode.

[0147] Optionally, the indication information can be located in an indication information list, the indication information list includes the prediction mode and an index corresponding to the prediction mode, the index can be arranged in ascending order, and the index number can include natural numbers between 0 and N0.

[0148] Optionally, the indication information can be located in an indication information list, the indication information list includes the partition mode and an index corresponding to the partition mode, the index can be arranged in ascending order, and the index number can include natural numbers between 0 and N1.

[0149] Optionally, N0 and N1 are 31, 64, or other natural numbers.

[0150] Optionally, the indication information includes a code word of an index corresponding to the prediction mode and / or the partition mode, and the code word corresponding to the index refers to that the encoding end encodes the index when sending the indication information to the decoding end, to transmit it to the decoding end in the form of binary coding, and the decoding end decodes it to restore the index from the binary coding.

[0151] Optionally, the indication information includes an index of an index group corresponding to the prediction mode and / or the partition mode, and the indication information can exist in the form of a group in an indication information list, that is, the indication information and the indexes are grouped according to the ordering relationship of the serial numbers of the indexes corresponding to the indication information, and the index of each index group is determined, and the index of the index group can be re-encoded, for example, indexes 0-3 correspond to an index group, the index of the index group is 0, and indexes 4-7 correspond to an index group, the index of the index group is 1.

[0152] Optionally, the indication information includes a code word related to the index of the index group corresponding to the prediction mode and / or the partition mode.

[0153] Optionally, the index-related code word refers to the encoding corresponding to the index in the index grouping when the encoding end sends the indication information to the decoding end, for example, converting the index in the index grouping in natural number form into binary encoding form to obtain the index encoding.

[0154] Optionally, the indication information includes the index of the prediction mode and / or the partition mode in the index grouping, and each piece of indication information in the same index grouping can be assigned an additional index, for example, including indexes 4-7 in an index grouping, and within the index grouping, indexes 0-3 can be assigned to represent the positions of these indexes within the index grouping.

[0155] Optionally, as shown in Table 1 below, the index Index is divided into at least one index grouping 0-3, 4-7, 8-11, and optionally, in index grouping 1, indexes 0-3 are assigned indexes 0-3, in index grouping 2, indexes 4-7 are assigned indexes 0-3, and in index grouping 3, indexes 8-11 are assigned indexes 0-3.

[0156] Table 1

[0157] Optionally, the indication information includes an index-related code word of the prediction mode and / or the partition mode in the index grouping.

[0158] Optionally, the index-related code word in the index grouping refers to the encoding corresponding to the index in the index grouping when the encoding end sends the indication information to the decoding end, for example, converting the index in the index grouping in natural number form into binary encoding form to obtain the corresponding encoding.

[0159] Optionally, the indication information includes information for indicating the prediction mode and / or the partition mode.

[0160] Optionally, the information of the prediction mode represents which prediction mode it is, for example, the information of the prediction mode can include at least one of the following prediction modes: an intra prediction mode, an inter prediction mode, a sub-mode of the intra prediction mode, a sub-mode of the inter prediction mode, a geometric partition mode, a most probable mode, a non-most probable mode, a TIMD mode, a DIMD mode, an OBIC mode, a CCP mode, a prediction mode based on a neural network, and a prediction mode in a prediction mode list.

[0161] Optionally, the information of the partition mode represents which partition mode it is, for example, the information of the partition mode can include at least one of the 64 partition modes in the GPM mode.

[0162] Optionally, the indication information includes information for indicating a sub-mode of the prediction mode, the prediction mode can further include a sub-mode, for example, a GPM (Geometric Partitioning Mode), the GPM model can further include 64 different sub-modes (for example, partition modes), and different sub-modes correspond to different partition positions and partition angles.

[0163] Optionally, referring to FIG. 8, FIG. 9, and FIG. 10, FIG. 8 is an angle distribution diagram, it can be found that each partition line corresponds to different angles, and the angles are marked as (i = 1, i ~ 24), FIG. 8 does not completely show all angles. There are at most 4 offsets under each angle, as shown in FIG. 9, which is a diagram of 4 offsets corresponding to an angle under an angle provided in an embodiment of the present application. The offsets are marked as ρ (j = 0, j ~ 3), and 64 partition modes can be combined, as shown in FIG. 10, which is a diagram of a partition mode provided in an embodiment of the present application, the partition mode includes at least one partition mode composed of different angles and offset combinations. It can be found that the positions of the partition lines are different under different partition angles and different offsets, and the number of partition lines that can be used by the image block is also different. Any one of the partition lines is an implementation of the GPM mode applied to the image block.

[0164] Optionally, the offset ρ j and the angle

[0165] Optionally, the indication information includes information for indicating a prediction mode in the prediction mode list.

[0166] Optionally, the information of the prediction mode in the prediction mode list is used to indicate which prediction mode should be used for prediction when the current image block is processed by the decoding end.

[0167] Optionally, the information of the prediction mode includes one or more of the following information: the name of the prediction mode, the index of the prediction mode, the code word of the prediction mode, and the like.

[0168] Optionally, the indication information includes information for indicating a partition mode in the partition mode list.

[0169] Optionally, the information of the partition mode in the partition mode list is used to indicate which partition mode in the GPM partition mode should be used for prediction when the current image block is processed by the decoding end.

[0170] Optionally, the information of the partition mode includes one or more of the following information: the index of the partition mode, the code word of the partition mode, and the like.

[0171] Optionally, the indication information includes a syntax element related to the prediction mode, the partition mode, and / or the image block.

[0172] Optionally, the syntax element is a basic data structure of a coded video bitstream, and is a data structure used to describe the organization mode, coding parameters, and actual content of the video data.

[0173] Optionally, the syntax element can be in various forms such as a number, English, a number, and / or a binary code.

[0174] Optionally, the indication information in the indication information list is coded or decoded according to the indication information corresponding to the prediction mode and / or the partition mode, the indication information list includes an index corresponding to each prediction mode and / or partition mode and a corresponding relationship between the code word, and the corresponding code word can be directly determined according to the index of the prediction mode and / or the partition mode during coding or decoding.

[0175] Second embodiment

[0176] Based on the first embodiment, the second embodiment is proposed.

[0177] In the embodiment of the present application, the image processing method further includes: determining or obtaining the target image block according to the first mode corresponding to the indication information.

[0178] In the embodiment of the present application, the image processing method further includes at least one of steps S11 to S13:

[0179] Step S11, determining the code word of the index corresponding to the first mode according to the selection probability of the first mode corresponding to the index;

[0180] Optionally, the first mode includes the prediction mode and / or the partition mode.

[0181] Optionally, in the image processing method of the embodiment of the present application, the code word of the index corresponding to the first mode is determined according to the selection probability of the first mode corresponding to the index, and the selection probability of the first mode refers to the TM cost corresponding to the first mode, and the smaller the TM cost is, the greater the corresponding selection probability is.

[0182] Optionally, according to the TM cost corresponding to the first mode, a target indication information list is determined from at least one candidate indication information list, and the code word of the index corresponding to the first mode is determined according to the target indication information list.

[0183] Optionally, according to at least one of the within-group variance corresponding to the grouping result of the first mode corresponding to the TM cost under the grouping scheme of at least one candidate indication information list, the range difference of the within-group selection probability average, the square error of the within-group selection probability average, and the selection probability of at least one indication information corresponding to the within-group, the target indication information list is determined or obtained.

[0184] Optionally, the embodiment of the present application provides an encoding strategy based on the selected probability distribution characteristics, and the code word is allocated according to the probability distribution characteristics of the first mode corresponding to the index in the encoding stage.

[0185] Optionally, the selected probability of the first mode is used to determine the index occurrence frequency of each stage in the first mode selection process, and a variable length encoding method capable of reducing the average code length is designed in combination with the coding characteristics of the interval and the stage position, which balances the code stream saving and real-time performance while maintaining the compression rate and considering the decoding complexity.

[0186] Optionally, before the code word of the index corresponding to the first mode is determined according to the selected probability of the first mode corresponding to the index, the real distribution characteristics of each index are analyzed, and the use of the GPM division mode on the encoder side is sampled and counted, including: running the ECM16 (Exploration of Coding Model) reference software on all available configurations on the test sequence, recording the GPM division mode index finally selected after sorting in each CU (Coding Unit); cumulative statistics of the selected frequency of each index (0-31).

[0187] Optionally, before the selected probability of each index is obtained, the decoder code of the standard ECM16 software needs to be modified, and the pu.geoSplitDir of each CU is obtained in the InterPrediction: deriveGpmSplitMode function, which is the GPM division mode index selected by the encoder after sorting, and is output to the csv (Comma-Separated Values) file. Run the encoder on the official standard test set of Class A, Class B, Class C, Class D, and Class F configured as RA (Random Access), and then run the modified decoder to obtain the original data, use Python (a high-level programming language) to count the frequency of the occurrence of 32 indexes from 0 to 31, generate the probability of occurrence, and finally calculate the average code length according to the formula Average Length =.

[0188] In the embodiment of the present application, the code word of the corresponding index is determined according to the selected probability of the index, which can flexibly encode the index according to the selected probability of the index, overcome the defects of the fixed encoding strategy of the prior art, determine the code word of the index according to the actual application scene, and reduce the average code length.

[0189] Step S12, determining the index-related code word of the index group of the first mode corresponding to the index group according to the selected probability of the index group of the first mode corresponding to the index group;

[0190] Optionally, the first mode comprises a prediction mode and / or a partition mode.

[0191] Optionally, the index of the index group corresponding to the prediction mode and / or the partition mode is determined according to the selected probability, and in order to reduce the average code length, the code length is determined according to the selected probability of the index group, and the higher the selected probability, the shorter the code length.

[0192] Optionally, the selected probability of the index group of the first mode is determined or obtained according to the TM cost corresponding to at least one third mode, for example, the selected probability of the index group of the first mode is the sum of the TM cost corresponding to at least one third mode in the same index group, and the at least one third mode comprises the first mode, for example, the at least one third mode comprises mode 0~mode N, and the first mode is mode 0.

[0193] Optionally, according to the sum of the TM cost corresponding to at least one third mode in the same index group, the target indication information list is determined from the at least one candidate indication information list, and the index of the index group corresponding to the first mode is determined according to the target indication information list.

[0194] Optionally, each of the at least one candidate indication information list comprises a preset selected probability of the index group, and according to the absolute value difference between the sum of the TM cost of each index group (for example, the sum of the TM cost corresponding to at least one third mode in each index group) and the preset selected probability of the index group, the sum of the absolute value difference of the index group is determined or obtained, and the target indication information list is determined from the at least one candidate indication information list according to the sum of the absolute value difference of the index group corresponding to each candidate indication information list (for example, the candidate indication information list with the minimum sum of the absolute value difference of the index group is the target indication information list).

[0195] In the embodiment of the present application, the index-related code word is determined from the perspective of the selected probability of the index group, the index is grouped, which is more conducive to exploring the grouping distribution rule of the selected probability of the index, facilitating the allocation of the same prefix to the index of the same index group, and the code word structure keeps the prefix unique, which is more suitable for the table structure of the entropy decoder.

[0196] Step S13, determining the index-related code word of the first mode in the index group according to the selected probability of the index in the index group.

[0197] Optionally, the first mode comprises a prediction mode and / or a partition mode.

[0198] Optionally, the code word of the index in the index group is determined according to the selection probability of the index in the index group, and the code word length is determined according to the selection probability of the index in the index group, and the higher the selection probability is, the shorter the code length is.

[0199] Optionally, the indication information list comprises an index list, the index list comprises index groups, and the index groups are prefixes of the indexes.

[0200] Optionally, the selection probability of the index in the index group is determined or obtained according to the selection probability of the index group of the first mode and the TM cost corresponding to the third mode, for example, the selection probability of the index group of the first mode is the sum of the TM costs corresponding to at least one third mode in the same index group, the selection probability of the index in the index group of the first mode is the ratio of the TM cost corresponding to the third mode to the selection probability of the index group of the first mode, and the at least one third mode comprises the first mode, for example, the at least one third mode comprises modes 0 to N, and the first mode is mode 0.

[0201] Optionally, according to the selection probability of the index in the index group, the target indication information list is determined from the at least one candidate indication information list, and the code word of the index in the index group of the first mode is determined according to the target indication information list.

[0202] Each of the at least one candidate indication information list comprises preset selection probabilities of the indexes in the index group, the sum of the absolute value differences of the indexes in the index group is determined or obtained according to the absolute value differences between the preset selection probabilities of the indexes in the index group (for example, the ratio of the TM cost corresponding to the third mode to the selection probability of the index group of the first mode) and the preset selection probabilities of the indexes in the index group, and the target indication information list is determined from the at least one candidate indication information list according to the sum of the absolute value differences of the indexes in the index group corresponding to each candidate indication information list (for example, the candidate indication information list with the minimum sum of the absolute value differences of the indexes in the index group is the target indication information list).

[0203] In the embodiment of the present application, the code word of the index in the index group of the first mode is determined from the dimension of the selection probability of the index in the index group, which is more conducive to exploring the grouping distribution rule of the selection probability of the index in the index group and can better support the fast adaptation of the entropy decoder table structure.

[0204] Optionally, in the embodiment of the present application, the indication information can be determined or obtained by at least one of the following modes 1 to 8:

[0205] The indication information is determined or obtained from a code stream;

[0206] Optionally, the indication information is determined or obtained from a code stream, the code stream refers to an information code stream sent by an encoding end to a decoding end in an image processing process, and the decoding end can obtain the indication information sent by the encoding end from the code stream to determine the prediction mode and / or the partition mode.

[0207] In the embodiments of the present application, the decoder can directly obtain the indication information from the code stream, and then perform subsequent decoding and image prediction processes to obtain a high-quality target image block.

[0208] The indication information is determined or obtained according to a rate-distortion optimization process;

[0209] Optionally, the indication information is determined or obtained according to a rate-distortion optimization process, the rate-distortion optimization (RDO) is a core technology for balancing the compression rate (Rate) and the reconstruction distortion (Distortion) through mathematical modeling. The goal is to minimize the distortion under the given code rate constraint, or to minimize the code rate under the limited distortion, so as to optimize the compression efficiency. In the rate-distortion optimization process, it can be determined that which prediction mode and / or partition mode needs to be used for image prediction, so as to obtain the indication information corresponding to the prediction mode and / or the partition mode.

[0210] In the embodiments of the present application, the prediction mode and / or the partition mode are determined through the rate-distortion process, which essentially trades off the algorithm complexity for the compression performance breakthrough, dynamically balances the code rate and distortion in the efficiency level, saves 30% to 50% of the code rate (HEVC vs. H.264) compared with the fixed mode, and suppresses the subjective distortion in combination with the HVS (Human Visual System, human eye visual characteristics) in the quality level, so that the PSNR (Peak Signal-to-Noise Ratio, peak signal-to-noise ratio) is improved by 0.5 to 2 dB under the same code rate.

[0211] The indication information is determined or obtained through a selected probability and a candidate indication information list;

[0212] Optionally, the indication information is determined or obtained through a selected probability and a candidate indication information list, including that the indication information is determined or obtained from a certain indication information list in at least one candidate indication information list through a selected probability of the indication information.

[0213] Optionally, the at least one candidate indication information list includes at least one preset indication information list, and the indication information in each prediction indication information list is different.

[0214] Optionally, the preset indication information list comprises at least one indication information list preset in the encoder or the decoder.

[0215] Optionally, the at least one preset indication information list comprises at least one of an index corresponding to a prediction mode and / or a partition mode, a code word of the index corresponding to the prediction mode and / or the partition mode, an index of an index group of the index corresponding to the prediction mode and / or the partition mode, a code word related to the index of the index group of the index corresponding to the prediction mode and / or the partition mode, an index of the prediction mode and / or the partition mode in the index group, and a code word related to the index of the prediction mode and / or the partition mode in the index group.

[0216] Optionally, at least one of the index corresponding to the prediction mode and / or the partition mode, the code word of the index corresponding to the prediction mode and / or the partition mode, the index of the index group of the index corresponding to the prediction mode and / or the partition mode, the code word related to the index of the index group of the index corresponding to the prediction mode and / or the partition mode, the index of the prediction mode and / or the partition mode in the index group, and the code word related to the index of the prediction mode and / or the partition mode in the index group is different in different preset indication information lists.

[0217] In the embodiments of the present application, the indication information in the indication information list determined or obtained from the candidate indication information list according to the selection probability of the indication information (for example, the index) can be used to select the indication information corresponding to the prediction mode and / or the partition mode most suitable for the current block in real time, so that the data amount of the indication information in the code stream can be reduced, and the purpose of improving the signaling coding efficiency can be achieved.

[0218] Optionally, the indication information is located in the code stream.

[0219] Optionally, the indication information is located in the code stream, and the code stream can be a code stream transmitted from the encoding end to the decoding end. The decoder can obtain the code word of the indication information from the code stream, and obtain the corresponding indication information through decoding operation.

[0220] In the embodiments of the present application, the encoding end transmits the indication information into the code stream after encoding, so that the decoding end can perform decoding processing. For example, the decoding end can obtain a high-quality target image block according to the indication information and the corresponding prediction mode and / or partition mode determined from the code stream.

[0221] In the embodiments of the present application, the indication information corresponding to the first mode can be placed in the code stream. Since the indication information can be determined according to the selection probability, the data amount of the indication information obtained by the decoding end can be adjusted in real time, so that the indication information with higher selection probability and higher frequency corresponds to shorter code word. In this way, the average code length can be reduced without increasing the implementation complexity, and the purpose of improving the signaling compression efficiency can be achieved.

[0222] In a fifth mode, the indication information is determined according to a target indication information list from the at least one candidate indication information list.

[0223] Optionally, before determining the target indication information list, a best target indication information list is selected from the at least one candidate indication information list, and then the indication information (for example, an index) of the prediction mode and / or the partition mode corresponding to the image block is encoded according to the target indication information list to obtain encoded indication information, and the encoded indication information is transmitted to the code stream to be transmitted to the decoding end, the decoding end is decoded according to the target indication information list to obtain decoded indication information, so as to determine the corresponding prediction mode and / or partition mode.

[0224] In the embodiments of the present application, the indication information is determined from the best target indication information list in the at least one candidate indication information list, so that the indication information can be transmitted with a relatively shortest code length in the process of being transmitted through the code stream, code length redundancy is avoided, and the signaling encoding and decoding efficiency is improved.

[0225] In a sixth mode, the indication information is contained in an indication information group of the target indication information list.

[0226] Optionally, the target indication information list includes one or more indication information groups, and the indication information group includes at least one piece of indication information.

[0227] Optionally, the indication information in the indication information group includes at least one of an index corresponding to the first mode, a code word of the index corresponding to the first mode, an index of an index group of the index corresponding to the first mode, a code word related to the index of the index group of the index corresponding to the first mode, an index of the first mode in the index group, and a code word related to the index of the first mode in the index group.

[0228] Optionally, the indication information list includes at least one indication information group, and in the grouping process of the indication information in the indication information list, the indication information can be grouped into at least one indication information group, and the number of the indication information groups is determined by the distribution of the selected probability of the indication information (for example, an index) of each candidate prediction mode and / or candidate partition mode in the indication information list, for example, the indication information (for example, an index) with similar selected probability can be allocated in the same indication information group, and the similar selected probability can be determined by setting a difference threshold, for example, different difference thresholds of 4%, 2%, 1%, etc. are set according to the positions of the indication information, and if the difference between the selected probabilities of two indexes is less than the difference threshold, it can be considered as similar.

[0229] In the embodiments of the present application, the indication information list is embodied in the form of indication information groups, and the selection probabilities of different indication information groups are similar, and the indication information (for example, index) in each indication information group can be assigned a code word of a corresponding code length, so that the grouping jump can be effectively avoided.

[0230] In a seventh aspect, the indication information list corresponds to at least one first candidate mode.

[0231] Optionally, the first mode includes a prediction mode and / or a partition mode.

[0232] Optionally, the indication information list corresponds to at least one candidate prediction mode and / or candidate partition mode, and the indication information list can include indication information corresponding to one candidate prediction mode and / or candidate partition mode. In the process of encoding the at least one candidate prediction mode and / or candidate partition mode, the indication information of the selected candidate prediction mode and / or candidate partition mode is encoded to obtain the encoded indication information (for example, the encoded code word corresponding to the index of the selected candidate prediction mode and / or candidate partition mode), and then the encoded indication information is transmitted to the decoding end. The decoding end decodes the encoded indication information to obtain the decoded indication information (for example, the code word corresponding to the index of the selected candidate prediction mode and / or candidate partition mode), so as to determine the corresponding candidate prediction mode and / or candidate partition mode, and apply the candidate prediction mode and / or candidate partition mode to the processing process of the image block for inter-frame / intra-frame prediction.

[0233] Optionally, the at least one candidate prediction mode and / or candidate partition mode corresponding to the indication information list is determined by the matching cost of at least one second mode (for example, a second prediction mode and / or a second partition mode). The second mode refers to all modes to be screened. For example, in the GPM mode, there are M second modes (that is, M GPM partition modes). When the candidate prediction mode and / or candidate partition mode is screened from the at least one prediction mode and / or partition mode, the screening can be performed according to the matching cost. The matching cost can be a TM (Template Matching, template matching) cost. The TM cost of each of the M second modes is calculated. The GPM partition modes are reordered in ascending order according to the TM cost, and the optimal N models are determined as the candidate prediction mode and / or candidate partition mode.

[0234] Optionally, N is 32, 29 or 36, and M is 64.

[0235] Optionally, the TM cost of the prediction mode and / or partition mode is approximately the probability of being selected. The smaller the TM cost is, the greater the corresponding selection probability is, and the easier the first candidate mode is selected.

[0236] In the embodiments of the present application, the TM cost of the prediction mode and / or partition mode according to the prediction mode and / or partition mode approximately corresponds to the probability of being selected, and finally the best at least one candidate prediction mode and / or candidate partition mode is selected to form the indication information list, and the candidate mode with too large TM cost or too low probability of being selected is discarded.

[0237] Optionally, the indication information list includes the first indication information with the same index and different code words.

[0238] Optionally, the indication information list includes the first indication information, and the first indication information has the same index as the other indication information list and different code words corresponding to the same index.

[0239] Optionally, the index in different indication information lists has the same order, for example, the index in each indication information list is 0-32, but the code word related to each index in different indication information lists is different, and the corresponding probability of being selected is also not necessarily the same.

[0240] Optionally, the indication information grouping includes index grouping, which is a strategy of grouping the index, for example, in Table 2 below, the index is grouped into 0-3, 4-7, 8-11, 38-31, etc.

[0241] Table 2

[0242] Optionally, the number of indication information in at least one indication information grouping corresponds to at least one predetermined probability range of being selected.

[0243] In the embodiments of the present application, the probability of being selected corresponding to the index of the indication information in different indication information groupings is within a certain predetermined probability range, so as to reflect the distribution of the probability of being selected of each index through the indication information grouping, and the predetermined probability range is the probability of being selected set in advance, for example, the range below 1% is a group, the range of 1%-2% is a group, the range of 2%-4% is a group, etc.

[0244] In the embodiments of the present application, by setting the indication index grouping in the indication information list and the indication information included in the index grouping, the indication information with different probability distribution is grouped into the same group, so as to determine the unified prefix and different suffix in each group according to the index grouping.

[0245] Optionally, as shown in Table 3 below, the indication information list includes an index list, and the index list includes at least one index starting from 0, which can be represented in the form of serial number.

[0246] Table 3

[0247] Optionally, in addition to including the index Index, as shown in Table 8 above, the indication information list also includes a prefix Prefix, a suffix Suffix, a code word Code, a code length Len, a selection probability Rate, an average code length Avg, a total average length of all indexes Total / Average Length, and other information, more comprehensively displaying multi-dimensional indication information.

[0248] Optionally, the indication information list corresponds to at least one candidate prediction mode and / or candidate partition mode, and one or more candidate prediction modes and / or candidate partition modes can be included in the indication information list, which are used as references in the process of encoding the indexes of these candidate prediction modes and / or candidate partition modes, and then the code word is sent to the decoding end, which restores the code word to the index, thereby determining the corresponding candidate prediction mode and / or candidate partition mode, and applying the candidate prediction mode and / or candidate partition mode to the processing process of the image block for inter / intra prediction.

[0249] The selection probability corresponding to the indication information or indication information group at the first position in the indication information list is higher than the selection probability corresponding to the indication information or indication information group at the second position, and optionally, the first position is closer to the front than the second position, and when the indexes are sorted, they are arranged in order from large to small according to the selection probability, so in the indication information list, the earlier the position of the indication information or indication information group, the greater the corresponding selection probability.

[0250] Optionally, the information length of the indication information or indication information group at the first position in the indication information list is less than the information length of the indication information or indication information at the second position, and optionally, the first position is closer to the front than the second position, because when the indexes are sorted, they are arranged in order from large to small according to the selection probability, so in the indication information list, the earlier the position of the indication information or indication information group, the greater the corresponding selection probability, in order to reduce the average code length, the information length of the indication information of the index with a greater selection probability needs to be reduced, so in the indication information list, the earlier the position of the indication information or indication information group, the shorter the corresponding information length.

[0251] Optionally, the indication information list corresponding to the target image block is determined according to the selection probability of at least one index, and optionally, the indication information list of the target image block is determined according to the selection probability of at least one index, and the selection probability of at least one index reflects the distribution of the selection probability of at least one index, which determines the grouping in the indication information list. The principle of grouping is to try to group indexes with more similar selection probabilities in the same group to avoid jumps in the selection probability of indexes in the group, so as to better allocate the code word length of each index group according to the group and reduce the average code length.

[0252] Third embodiment

[0253] Based on any of the above embodiments, a third embodiment is proposed.

[0254] In the embodiments of the present application, the image processing method further comprises at least one of steps S14 to S17:

[0255] In step S14, the target indication information list is determined or obtained by matching the selected probability corresponding to the index in the at least one candidate indication information list.

[0256] Optionally, the target indication information list is determined or obtained according to the matching result of whether the selected probability corresponding to the index matches in the at least one candidate indication information list.

[0257] Optionally, in the process of matching the target indication information list from the candidate indication information list, the selected probability of the index is mainly used as the basis, and in different candidate indication information lists, the selected probability of the index is mainly grouped according to the distribution. Therefore, when matching the target indication information list, the candidate indication information list with the closest distribution of the selected probability of the index can be matched and screened out according to the distribution of the selected probability of the index.

[0258] Optionally, the candidate indication information list can include at least one, such as Table 4 below:

[0259] Table 4

[0260] Optionally, as shown in Table 4 above, the indication information list further includes index Index, prefix Prefix, suffix Suffix, code word Code, code length Len, selected probability Rate, average code length Avg, total average code length Total / Average Length and other information, which more comprehensively displays multi-dimensional indication information.

[0261] Optionally, the difference between the suffix lengths of at least one indication information group adjacent to each other using fixed-length coding is greater than or equal to 1.

[0262] Optionally, the difference between the suffix lengths of at least one indication information group adjacent to each other using fixed-length coding is 2.

[0263] Optionally, the index binary coding rule and statistical characteristics of Table 4 above are shown in Figure 11 (the horizontal axis is the index, and the vertical axis is the code length), in the first candidate indication information table, indexes 0-3 are assigned as 3-bit code words, 4-7 are assigned as 4-bit code words, indexes 8-15 are uniformly assigned as 6-bit code words, indexes 16-31 are uniformly assigned as 7-bit code words, and only a boundary is set between 8-15 and 16-31. Therefore, this scheme is suitable for the case where the probabilities of the groups selected by the current CU in indexes 8-15 and 16-31 are very similar, and the probabilities between groups are significantly different.

[0264] Optionally, the candidate indication information table can also include Table 5:

[0265] Table 5

[0266] Optionally, as shown in Table 5 above, the indication information table also includes indexes Index, prefixes Prefix, suffixes Suffix, code words Code, code lengths Len, selected probabilities Rate, average code lengths Avg, total average code lengths Total / Average Length, and other information, more comprehensively displaying multi-dimensional indication information.

[0267] Optionally, the difference between the suffix lengths of at least one indication information group adjacent to each other and using fixed-length coding is greater than or equal to 1.

[0268] Optionally, the difference between the suffix lengths of at least one indication information group adjacent to each other and using fixed-length coding is 2.

[0269] Optionally, the index binary coding rule and statistical characteristics of Table 5 above are shown in Figure 12 (the horizontal axis is the index, and the vertical axis is the code length), in the second candidate indication information table, indexes 0-3 are assigned as 3-bit code words, 4-7 are assigned as 4-bit code words, indexes 8-11 are assigned as 5-bit code words, 12-15 are assigned as 6-bit code words, and 16-31 are all uniformly assigned as 8-bit code words. Therefore, this scheme is suitable for the case where the probabilities of the groups selected by the current CU in indexes 8-11, 12-15, and 16-31 are very similar, and the probabilities between groups are significantly different.

[0270] Optionally, the candidate indication information list further includes a third candidate indication information table of index binary coding rule and statistical characteristics as shown in FIG. 13 (the horizontal coordinate is index, and the vertical coordinate is code length), in which, indexes 0-3 are assigned as 3-bit code words, 4-7 are assigned as 4-bit code words, 8-11 are uniformly assigned as 5-bit code words, 12-15 are assigned as 6-bit code words, and 16-31 are all uniformly assigned as 6-bit code words. Therefore, the scheme is applicable to the case that the probabilities of the groups selected by the current CU are 0-3, 4-7, 8-11, 12-15, 16-31, and the probabilities of the groups are obviously different from each other.

[0271] Optionally, a feasible table of index binary coding rule and statistical characteristics of the candidate indication information list is shown in FIG. 14 (the horizontal coordinate is index, and the vertical coordinate is code length), in which, indexes 8-31 are further subdivided into 5 groups, and 5, 6, 7, 8, 9-bit code words are assigned. Therefore, the scheme is applicable to the case that the probabilities of the groups selected by the current CU are 8-11, 12-15, 16-19, 20-33, 24-31, and the probabilities of the groups are obviously different from each other, but the average code length of the table is too long. Therefore, the table corresponding to the index binary coding rule and statistical characteristics of the above table 4, table 5 or FIG. 11, FIG. 12, FIG. 13 is used as the candidate indication information list (the average code length of all indexes is lower than that of the traditional indication information list), which can effectively reduce the average code length and improve the coding efficiency of signaling.

[0272] In the embodiments of the present application, the advantages and disadvantages of the grouping schemes of the candidate indication information list are comprehensively evaluated from multiple angles by constructing the similarity indexes between various probability distributions and code length distributions. The concentration degree of the probabilities of the groups and the similarity of the probabilities of the groups are measured, the local consistency and the overall distinguishability are considered, finally, the grouping schemes are scored or compared according to the above criteria, and the candidate indication information list corresponding to the grouping scheme that best matches the actual distribution characteristics is selected as the target indication information list, so that the adaptability and efficiency of the code length design are optimized.

[0273] Optionally, the candidate indication information list can further include an indication information list in which the code length of the code word of the index in the indication information grouping is in the form of indefinite length.

[0274] Optionally, in at least one or at least one level indication information grouping included in the indication information list, the code length of the code word of the index in the indication information grouping in the front position is sequentially increased.

[0275] Optionally, in order to further reduce the average code length, the code word length of the index-related code word in the first indication information group at the front of the indication information list can be further reduced, because the selection probability of these indexes is much higher than that of the code word of the subsequent index, and reducing the code length of the code word can have the relatively best effect of reducing the code length.

[0276] Optionally, as shown in Table 6 below, the code word length of each index in the first indication information group is allocated 2, 3, 4, 5, 5, and in the table, the first indication information group includes 5 indexes of 0-4.

[0277] Optionally, the prefix of the first indication information group is 0.

[0278] Table 6

[0279] Optionally, as shown in Table 6 above, the length of the code word of the index in the first indication information group at the front is not fixed, the second indication information group includes 8 indexes, and the code word length is fixed as 5 (prefix length 2, suffix length 3), the third indication information group includes 16 indexes, and the code word length is fixed as 6 (prefix length 2, suffix length 4), and the difference between the third indication information group and the second indication information group is that the prefix is different.

[0280] Optionally, as shown in Table 6 above, the length of the suffix in each indication information group can be the same or different, and in the same indication information group and / or the same indication information, the length of the suffix is greater than the length of the prefix.

[0281] Optionally, in the indication information list, the suffix of the index code word can be variable-length coding or fixed-length coding, as shown in Table 6 above, the suffix of the first indication information group at the front is variable-length coding, and the suffix of the other indication information group is fixed-length coding.

[0282] Optionally, in the indication information list, the suffix of each indication information group increases with the index of the index group, and the length of the fixed-length coding form of the suffix does not change or increases by 1.

[0283] Optionally, compared with the number of indexes 32 in the traditional indication information list, the number of indexes of the indication information list is 29.

[0284] Optionally, another feasible indication information list is shown in Table 7 below, the code word length of each index in the first indication information group at the front is 2, 3, 4, 4, and in the table, the first indication information group includes 4 indexes of 0-3.

[0285] Table 7

[0286] Optionally, in the above Table 7, the length of the codeword of the index in the first indication information group at the top is not fixed, the second indication information group includes 4 indexes, and the length of the codeword is fixed as 4 (prefix length 2, suffix length 2); the third indication information group includes 8 indexes, and the length of the codeword is fixed as 6 (prefix length 3, suffix length 3); and the fourth indication information group includes 16 indexes, and the length of the codeword is fixed as 7 (prefix length 3, suffix length 4).

[0287] Optionally, in the indication information list, the length of the codeword of the fixed-length coding of different indication information groups is different.

[0288] Optionally, in the indication information list, the length of the suffix of each indication information group increases by 1 with the increase of the index of the index group.

[0289] Optionally, the difference between the lengths of the suffixes of the indication information groups adjacent to each other using the fixed-length coding is 1.

[0290] Optionally, another feasible indication information list is shown in Table 8 below, the length of the codeword of each index in the first indication information group at the top is 2, 3, 4, and 4, and in the table, the first indication information group includes 4 indexes 0-3.

[0291] Table 8

[0292] Optionally, in the above Table 8, the length of the codeword of the index in the first indication information group at the top is not fixed, the second indication information group includes 8 indexes, and the length of the codeword is fixed as 5 (prefix length 2, suffix length 3); the third indication information group includes 8 indexes, and the length of the codeword is fixed as 6 (prefix length 3, suffix length 3); and the fourth indication information group includes 16 indexes, and the length of the codeword is fixed as 7 (prefix length 3, suffix length 4).

[0293] In the embodiments of the present application, a method for flexibly determining the length of the prefix and the length of the suffix in each indication information group is provided, especially in the first indication information group, the indexes with relatively high selection probability are assigned with the suffix of variable-length coding, and the total number of indexes in the indication information list is not limited to 32, and can be reduced or increased according to actual conditions, so as to reduce the average code length of the codeword of the index to the maximum extent.

[0294] In step S15, the target indication information list is determined or obtained by matching the index group corresponding to the selection probability in at least one candidate indication information list.

[0295] Optionally, the target indication information list is determined or obtained according to a matching result of whether the selected probability corresponding to the index group matches in the at least one candidate indication information list.

[0296] Optionally, when the index group is included in the indication information group, the selected probability corresponding to the index group can be matched in the candidate indication information list, and the candidate indication information list with the selected probability of the index group most similar to the selected probability distribution in the candidate indication information list is selected as the target indication information list.

[0297] Optionally, the indication information list includes the index binary coding rule and the corresponding table of statistical characteristics shown in Table 4, Table 5, and also can include the index binary coding rule and the corresponding table of statistical characteristics shown in FIG. 11, FIG. 12, and FIG. 13.

[0298] In the embodiment of the present application, the target indication information list is determined or obtained according to the matching of the selected probability corresponding to the index group in the at least one candidate indication information list, and the target indication information list determined or obtained can be more suitable for the current coding scene because the selected probability distribution of the index group is considered.

[0299] In step S16, the target indication information list is determined or obtained according to the selected probability distribution of the selected probability corresponding to the at least one index group obtained by grouping according to the grouping scheme of the at least one candidate indication information list;

[0300] Optionally, in order to directly determine which candidate indication information list is closest to the selected probability of each index that has been counted, the selected probability of each index is grouped according to the grouping scheme of each candidate indication information list, and the grouping result includes at least one index group, each index group includes one or more indexes, and each index corresponds to a probability.

[0301] Optionally, taking three candidate indication information lists as an example, after the selected probability of at least one index is grouped according to the grouping scheme of the three candidate indication information lists, three grouping results are obtained, and the three grouping results correspond to the three candidate indication information lists. In each index group of each grouping result, the closer the probability distribution in the group is, the higher the matching degree of the grouping result and the corresponding candidate indication information list is. Finally, the matching degrees of the grouping results corresponding to the three candidate indication information lists are determined, and the candidate indication information list with the highest matching degree is selected as the target indication information list.

[0302] In the embodiment of the present application, the selected probability of each index is grouped according to the grouping scheme of each candidate indication information list, and the matching degree between the selected probability distribution and the candidate indication information list is determined according to the obtained grouping result, so that the target indication information list can be obtained more intuitively and quickly.

[0303] Step S17, determining or obtaining the target indication information list according to at least one of the following: the intra-group variance corresponding to the grouping result of the at least one candidate indication information list under the grouping scheme, the range of the intra-group probability mean, the sum of square errors of the intra-group probability mean, and the probability of the at least one indication information in the group.

[0304] Optionally, the embodiments of the present application provide a method for screening the best target indication information list based on the plurality of parameters corresponding to the grouping result of the at least one candidate indication information list under the grouping scheme according to the probability corresponding to the index. The parameters such as the intra-group variance, the range of the intra-group probability mean, the sum of square errors of the intra-group probability mean, and the probability of the at least one indication information in the group are directly read or calculated from the grouping result under each grouping scheme.

[0305] Optionally, when the target indication information list is determined or obtained based on the intra-group variance and the range of the intra-group probability mean, the grouping similarity based on the intra-group variance and the inter-group mean difference is mainly used to match the target indication information list. For example, firstly, the probabilities of the 32 indexes are distributed according to the different grouping schemes of the candidate indication information lists to obtain a plurality of grouping results, and then the probability mean and the variance of each group in each grouping result are calculated. Then, the total sum of the variances of all groups (used to reflect the intra-group probability difference degree) and the range of the probability mean of each group (used to reflect the inter-group probability separation degree) are calculated. Finally, the score is calculated by using the following formula: Score = total sum of intra-group variances - λ x range of inter-group mean (λ is a weight parameter, which can be 1 according to experience), and the grouping scheme with the lowest score is selected as the current optimal grouping scheme, and the candidate indication information list corresponding to the current optimal grouping scheme is taken as the target indication information list.

[0306] In the embodiments of the present application, the target indication information list is screened based on the intra-group variance and the intra-group probability mean, which not only takes into account the uniformity of the intra-group probability, but also ensures the separation degree of the inter-group probability, and can ensure that the finally selected candidate indication information list is most matched with the actual probability distribution.

[0307] Optionally, when the target indication information list is determined or obtained based on the sum of square errors of the intra-group probability mean, the minimum segmentation error is mainly considered. For each grouping result, the current probability distribution is fitted into a constant value in each group (i.e., each group is approximated by the group mean), and then the sum of square errors between the actual value of the probability of the 32 indexes and the group mean is calculated. Finally, the candidate indication information list corresponding to the grouping scheme with the minimum error is selected as the target indication information list.

[0308] The embodiment of the present application is actually equivalent to minimizing the dispersion of the probability within the group, and can effectively reflect the adaptability of the grouping scheme to the actual probability distribution, and help to select the optimal code length allocation rule to obtain the target indication information list with relatively high matching degree.

[0309] Optionally, when the target indication information list is determined or obtained based on the selected probability corresponding to at least one indication information within the group, the matching is mainly based on the boundary characteristics of the first index probability of each group. For the grouping result of each grouping scheme, the probability value of the first index (i.e., the grouping boundary point) of each group is recorded, and then the boundary point probabilities of the grouping schemes are compared. For example, the scheme in which the grouping boundary point falls exactly at a position with a large probability mutation is preferentially selected, i.e., there is a significant difference between the first probability value of a group and the last probability value of the previous group. In the quantitative calculation, the "maximum boundary jump method" can be used, i.e., the probability difference of all group boundary points of each scheme is counted, and the candidate indication information list corresponding to the scheme with the maximum group boundary probability difference or the maximum total group boundary probability difference is selected as the target indication information list that best matches the current probability distribution.

[0310] In the embodiment of the present application, the best candidate indication information list is selected according to the difference of the grouping boundary, and the difference of the grouping boundary reflects the degree of differentiation between groups and helps to select the optimal code length allocation rule to obtain the target indication information list with relatively high matching degree.

[0311] Optionally, in the case of comprehensively considering the indexes of the three dimensions of the consistency within the group, the separation between groups, and the boundary sensitivity, a scoring function can be further constructed: Score = α × total sum of probability variance within the group - β × range of mean values between groups - γ × boundary jump intensity of grouping. Optionally, the variance within the group measures the uniformity of the index probability in the same group, the range of mean values between groups reflects the separation degree between groups, and the boundary jump is used to capture the alignment degree of the probability mutation point and the grouping boundary. Finally, the scoring value of the candidate indication information list corresponding to the grouping result is calculated according to the above formula, and the one with the lowest score is selected as the target indication information list.

[0312] In the embodiment of the present application, the target indication information list is selected by combining multiple evaluation indexes, which combines the advantages of the three indexes mentioned above, avoids contingency, improves the stability of the matching degree of the target indication information list selected, and has strong robustness.

[0313] Optionally, in the implementation method of integrating the technical solutions of the embodiments of the present application into the VVC (Versatile Video Coding, multi-functional video coding) codec process, the following is performed: in the GPM mode ordering stage of each CU (after TM cost ordering), a self-adaptive selection module is called to select the most suitable code word rule according to the TM cost distribution characteristics and the designed selection rule, and output the code word, and the encoding result is directly written into the code stream without the need of additional indicators or flag bits; the integration process on the decoder side includes: before parsing the code stream of the GPM division mode, the decoder first completes the TM cost calculation of the 64 division modes of the CU, selects the top 32 items for ordering to generate ordering indexes and the corresponding TM costs, and finally selects the most suitable code word rule according to the TM cost distribution characteristics and the designed selection rule.

[0314] The embodiments of the present application correspond to introducing a self-adaptive encoding scheme selection mechanism based on prediction mode and / or division mode cost distribution. The encoding end performs statistics on the costs of 32 indexes, observes the ladder-shaped distribution characteristics, matches the distribution with one of the preset multiple candidate indicator information lists, selects the closest encoding strategy to encode the selected TM index and output the code stream, and the process is adaptively adjusted according to the concentration degree of the cost, the tail probability attenuation and the distribution width, thereby improving the overall encoding efficiency. The decoding end adopts a completely symmetrical strategy, i.e., first reconstructs 32 TM costs and analyzes the distribution form, and then selects the same strategy as the encoding end to decode the code stream, thereby ensuring the consistency and correctness of the encoding and decoding. The adaptive selection encoding scheme strategy of the embodiments of the present application does not require additional signaling overhead, can automatically select the optimal scheme according to the actual distribution, and has flexibility and robustness.

[0315] Fourth embodiment

[0316] Based on any of the above embodiments, a fourth embodiment is proposed.

[0317] The image processing method of the embodiments of the present application further includes step S21:

[0318] S21, according to the indication information of the first image block, determining or obtaining the indication information of the second image block.

[0319] Optionally, the first image block is an image block that has completed image processing by the processing device in the image processing process, and the second image block is an image block being processed by the processing device in the image processing process.

[0320] Optionally, the second image block is the target image block in the first embodiment.

[0321] Optionally, according to the selection probability of the indication information, it is determined whether the indication information of the second image block is determined or obtained according to the candidate indication information list or is determined or obtained according to the indication information of the first image block.

[0322] Optionally, if the selection probability of the indication information matches the candidate indication information list, the indication information of the second image block is determined or obtained according to the candidate indication information list; and / or, if the selection probability of the indication information does not match the candidate indication information list, the indication information of the second image block is determined or obtained according to the indication information of the first image block.

[0323] Optionally, the selection probability of the indication information (for example, the index) includes TM cost determination or obtaining of the prediction mode and / or the partition mode.

[0324] Optionally, according to at least one of the following: the intra-group variance corresponding to the grouping result of the at least one candidate indication information list under the grouping scheme, the range of the mean of the selection probability in the group, the square error of the mean of the selection probability in the group, and the selection probability corresponding to the at least one indication information in the group, it is determined whether the selection probability of the indication information matches the candidate indication information list.

[0325] Optionally, if the selection probability corresponding to the index does not match all the candidate indication information lists, the indication information of the second image block is determined or obtained according to the indication information of the first image block.

[0326] In the embodiments of the present application, the indication information can be determined according to the actual situation of the encoded image block, thereby supporting the improvement of the signaling encoding efficiency and / or flexibility.

[0327] Optionally, in the embodiments of the present application, the image processing method further includes at least one of steps S22 to S27:

[0328] Step S22, the indication information of the second image block is determined or obtained according to the indication information list;

[0329] Optionally, the indication information of the second image block is determined or obtained according to the indication information list, and the second image block is an image block currently processed and / or predicted by the processing device, which can be a coding tree unit (CTU) or a coding unit (CU). In the processing process, the corresponding indication information needs to be obtained to determine the prediction mode and / or partition mode corresponding to the indication information, so as to facilitate the prediction of the second image block to obtain a predicted image block and further determine a target image block. Optionally, at the decoding end, the encoded first indication information (for example, the encoded version of the binary codeword in Table 3) is determined or obtained from the code stream, and the decoded first indication information (for example, the binary codeword in Table 3) is determined or obtained through entropy decoding processing. According to the decoded first indication information and the indication information list (for example, the indication information list shown in Table 3), the second indication information (for example, the index shown in Table 3) of the second image is determined or obtained. According to the second indication information, the prediction mode and / or partition mode (for example, the prediction mode and / or partition mode corresponding to the index in Table 3) of the target image block is determined or obtained.

[0330] In the embodiments of the present application, when the second image block is predicted, the prediction mode and / or partition mode corresponding to the indication information can be directly determined by decoding the received codeword according to the indication information list, so that the decoding end can perform image prediction according to the prediction mode and / or partition mode to obtain a high-quality target image block.

[0331] In the embodiments of the present application, when the second image block is predicted, the prediction mode and / or partition mode corresponding to the indication information can be directly determined by decoding the received codeword according to the indication information list, so that the decoding end can perform image prediction according to the prediction mode and / or partition mode to obtain a high-quality target image block.

[0332] Optionally, the indication information list is determined or obtained according to the indication information of the first image block, and the indication information list includes the indication information list for the second image block.

[0333] Optionally, the first image block includes at least one other encoded image block related to the second image block, and the first image blocks correspond to a prediction mode and / or partition mode. Each prediction mode and / or partition mode corresponds to an index. The indication information list is adaptively determined or generated according to the selection probability of each index.

[0334] In the embodiments of the present application, the indication information list corresponding to the second image block is adaptively changed according to the selection of the indication information of the processed first image block, so as to realize the real-time update of the indication information list of the second image block.

[0335] Optionally, if there is at least one indication information list, before determining the indication information list of the second image block, the frequency of occurrence of the indication information (e.g. index) of the prediction mode and / or the partition mode corresponding to each first image block is counted, and the selected probability corresponding to each indication information (e.g. index) is calculated through the frequency, so as to determine the best indication information list from the at least one indication information list according to the selected probability.

[0336] In the embodiments of the present application, the indication information list of the second image block is determined or obtained according to the indication information of the first image block, so that the determined indication information list is more suitable for the current situation of the second image block, and the code word of the index corresponding to the prediction mode and / or the partition mode in the indication information is not limited to the fixed indication information list, thereby improving the coding flexibility.

[0337] Optionally, before determining the indication information list of the second image block, the frequency of occurrence of the indication information (e.g. index) of the prediction mode and / or the partition mode corresponding to each first image block is counted, and the selected probability corresponding to each indication information (e.g. index) is calculated through the frequency, so as to adjust the indication information list of the first image block according to the selected probability, and obtain the indication information list of the second image block.

[0338] Optionally, before determining the indication information list of the second image block, the first indication information list is determined or obtained according to the Columbus-Lempel coding mode, and the frequency of occurrence of the indication information (e.g. index) of the prediction mode and / or the partition mode corresponding to each first image block is counted, and the selected probability corresponding to each indication information (e.g. index) is calculated through the frequency, so as to adjust the first indication information list according to the selected probability, and determine or obtain the indication information list of the second image block.

[0339] Optionally, for different image blocks, the same prediction mode and / or partition mode corresponds to different indication information.

[0340] Optionally, the image block A and the image block B both use the prediction mode A, the prediction mode A corresponding to the image block A is represented by the indication information A, the prediction mode corresponding to the image block B is represented by the indication information B, and the indication information A and the indication information B are different.

[0341] Optionally, the image block A and the image block B both use the prediction mode A, the prediction mode A corresponding to the image block A is represented by the index A, the prediction mode corresponding to the image block B is represented by the index B, the index A and the index B are different, and the code word corresponding to the index A and the index B is different.

[0342] Optionally, in the GPM mode, the image block A and the image block B both adopt the partition mode A, the prediction mode A corresponding to the image block A is represented by the indication information A, the prediction mode corresponding to the image block B is represented by the indication information B, and the indication information A and the indication information B are different.

[0343] Optionally, the image block A and the image block B both adopt the partition mode A, the prediction mode A corresponding to the image block A is represented by the index A, the partition mode corresponding to the image block B is represented by the index B, the index A and the index B are different, and the code words corresponding to the index A and the index B are different.

[0344] In the embodiment of the present application, when the candidate prediction modes are selected from the at least one prediction mode for each image block, the selection can be performed according to the matching cost, the matching cost can be a TM (Template Matching) cost, the at least one prediction mode is reordered in ascending order according to the TM cost, and the N prediction modes are determined as the candidate prediction modes. Since the TM costs are different when the different image blocks are selected, the ordering results of the prediction modes are different. In this way, when the indication information list is mapped by the ordering result of the prediction mode, for the same image block, different prediction modes correspond to different indication information, and for different image blocks, even if the same prediction mode is used, the corresponding indication information can be different.

[0345] In the embodiment of the present application, when the candidate partition modes are selected from the at least one partition mode for each image block, the selection can be performed according to the matching cost, the matching cost can be a TM (Template Matching) cost, the at least one partition mode is reordered in ascending order according to the TM cost, and the N partition modes are determined as the candidate partition modes. Since the TM costs are different when the different image blocks are selected, the ordering results of the partition modes are different. In this way, when the indication information list is mapped by the ordering result of the partition mode, for the same image block, different partition modes correspond to different indication information, and for different image blocks, even if the same partition mode is used, the corresponding indication information can be different.

[0346] In the embodiment of the present application, the first indication information list is adjusted according to the indication information of the first image block, the indication information list of the second image block is determined or obtained, so that the determined indication information list is more suitable for the current situation of the second image block, and the code words of the indexes corresponding to the prediction mode and / or the partition mode in the indication information are not limited to the fixed indication information list, and the coding flexibility is improved.

[0347] In step S24, the update timing of the indication information list is determined according to the predetermined update position.

[0348] Optionally, the update timing of the indication information list is determined according to a predetermined update position, and during processing of the first image block, periodic updating can be performed. Specifically, when the processing device processes an image, the image is first divided into a plurality of Slices or Tiles, each Slice or Tile being an independently decodable unit, each Tile including a plurality of CTUs, each CTU including a plurality of CUs, and the predetermined update position determines the update timing, which can be one or more of performing an update action every preset number of CTUs, performing an update action every preset number of CUs, and performing an update action at a fixed position CU in each CTU.

[0349] Optionally, the preset number is 20.

[0350] Optionally, FIG. 15 shows a division manner of the Tile, in which the entire image is divided into 9 Tiles, each Tile being a rectangle. During encoding, all the Tiles in the image are processed in a scanning order, and the CTUs in each Tile are encoded in a raster scan order. The raster scan of the CTU means that scanning is performed from left to right and from top to bottom, and a row is scanned first and then the scanning is continued at the start position of the next row. Therefore, for each second image block, the image blocks on the left and above thereof are already encoded image blocks and can be used as the first image block.

[0351] Optionally, the indication information list includes an update indication information list, and in order to reduce the indication information of the second image block as much as possible during transmission, the indication information list needs to be updated in real time / periodically, and the update indication information list can be adaptively updated according to the actual situation of the processing node of the first image block.

[0352] In the embodiments of the present application, the indication information list updated according to the predetermined update position is more in line with the current situation of the second image block, and when the code word of the index corresponding to the prediction mode and / or the division mode in the indication information is transmitted, the indication information list is not limited to a fixed indication information list, and the coding flexibility of the index is improved.

[0353] In step S25, the update timing of the indication information list is determined according to the difference between the indication information list before updating and the indication information list after updating.

[0354] Optionally, the update timing of the indication information list is determined according to the difference between the indication information list before updating and the indication information list after updating.

[0355] Optionally, the second indication information list is determined or obtained according to step S23, and the second indication information list is an updated indication information list. The update timing of the indication information list is determined according to the difference between the indication information list before the update and the second indication information list.

[0356] Optionally, the difference between the indication information list before the update and the updated indication information list can be determined by subtracting the indication information list before the update from the updated indication information list. The greater the difference between the two, the more necessary the update. In the process of subtracting the indication information list before the update from the updated indication information list, the codewords of each index in the indication information list are subtracted. The difference value obtained includes a sequence formed by the difference values corresponding to at least one index. The greater the sum or average of the absolute values of each item in the sequence, the greater the difference between the indication information list before the update and the updated indication information list. The worse the matching degree between the indication information list before the update and the first image block currently being processed, the more necessary the update of the indication information list.

[0357] Optionally, when the difference between the indication information list before the update and the updated indication information list is determined, a difference threshold can be set in advance. When the obtained difference value is greater than the difference threshold, it can be determined that the update timing of the indication information list is triggered. When the obtained difference value is less than the difference threshold, it can be determined that the update timing of the indication information list is not triggered.

[0358] In the embodiments of the present application, the update timing of the indication information list is determined according to the difference between the indication information list before the update and the updated indication information list. The indication information list can be updated adaptively in the case of large difference, avoiding the encoding length redundancy caused by the non-adaptation of the indication information list to the encoding scene of the current second image block, and reducing the average code length.

[0359] In step S26, the updated indication information list is determined or obtained through the index of the first image block in the at least one first image unit group associated with the second image block.

[0360] Optionally, the updated indication information list is determined or obtained through the index of the first image block in the at least one first image unit group associated with the second image block. Optionally, the at least one first image unit group associated with the second image block refers to the image unit group associated with the second image block through a preset rule. The preset rule can reflect the association between the first image unit group and the second image block.

[0361] Optionally, the first image unit group can be obtained by combining one or more of the following image blocks: image blocks in a coding tree unit where the second image block is located, image blocks in a coding tree unit adjacent to the coding tree unit where the second image block is located, image blocks in a slice where the second image block unit is located, image blocks in a slice adjacent to the slice where the second image block unit is located, image blocks in a tile where the second image block unit is located, and image blocks in a tile adjacent to the tile where the second image block unit is located.

[0362] Optionally, the first image unit group can be obtained by combining one or more of the following coding units, coding tree units, slices, and tiles: a coding unit where the second image block is located, a coding tree unit adjacent to the coding tree unit where the second image block is located, a slice where the second image block unit is located, a slice adjacent to the slice where the second image block unit is located, a tile where the second image block unit is located, and a tile adjacent to the tile where the second image block unit is located.

[0363] Optionally, the determining the image unit group associated with the second image block according to the preset rule comprises at least one of the following:

[0364] determining image blocks, coding units, coding tree units, slices, and / or tiles associated with the second image block;

[0365] combining the associated image blocks, coding units, coding tree units, slices, and / or tiles to determine or obtain at least one image unit group;

[0366] determining the at least one image unit group as the first image unit group.

[0367] The determining the associated image blocks, coding units, coding tree units, slices, and / or tiles comprises:

[0368] determining image blocks in a coding unit where the second image block is located as the image blocks associated with the second image block;

[0369] determining image blocks in an adjacent coding tree unit of the coding unit where the second image block is located as the image blocks associated with the second image block;

[0370] determining image blocks in a slice where the second image block is located as the image blocks associated with the second image block;

[0371] determining image blocks in a slice adjacent to the slice where the second image block unit is located as the image blocks associated with the second image block;

[0372] determining the coding unit where the second image block is located as the coding unit associated with the second image block;

[0373] a neighboring coding tree unit of the coding unit in which the second image block is located is taken as the coding tree unit associated with the second image block;

[0374] a Slice in which the second image block unit is located is taken as the Slice associated with the second image block;

[0375] a Slice neighboring the Slice in which the second image block unit is located is taken as the Slice associated with the second image block;

[0376] a Tile in which the second image block unit is located is taken as the Tile associated with the second image block;

[0377] a Tile neighboring the Tile in which the second image block unit is located is taken as the Tile associated with the second image block.

[0378] Optionally, the coding tree unit neighboring the coding tree unit in which the second image block is located can be a coding tree unit located on the left and / or top side of the coding tree unit in which the second image block is located, and the Slice neighboring the Slice in which the second image block unit is located can be a Slice located on the left and / or top side of the coding tree unit in which the second image block unit is located.

[0379] In the embodiments of the present application, the updated indication information list is determined or obtained through the indexes of the first image blocks in the associated first image unit group, so that the updated indication information list can better reflect the distribution of the selection probability of the indexes of the first image blocks in at least one first image unit group associated with the second image block, and the first image unit group associated with the second image block is more suitable for the index coding scene of the prediction mode and / or the partition mode of the second image block, thereby further improving the flexibility of the statistical range of the selection probability of the indexes.

[0380] In step S27, the updated indication information list is determined or obtained through the indexes of the first image blocks in at least one first image unit group within a predetermined range in which the second image block is located.

[0381] Optionally, the updated indication information list is determined or obtained through the indexes of the first image blocks in at least one first image unit group within a predetermined range in which the second image block is located, the indexes of the first image blocks in the first image unit group correspond to a prediction mode and / or a partition mode, the updated indication information list is determined according to the selection probability of the indexes by counting the frequency of the indexes of the prediction mode and / or the partition mode corresponding to each first image block included in each first image unit group.

[0382] Optionally, in an actual application scenario, at most M prediction modes and / or M partition modes are involved when counting the frequency of the indexes of the prediction mode corresponding to each first image block included in each first image unit group.

[0383] Optionally, N is 32, 29 or 36, and M is 64.

[0384] Optionally, the predetermined range can be adaptively set according to actual conditions, and can reflect the frequency distribution of various candidate prediction modes and / or candidate partition modes when the second image block is encoded in the image prediction mode and / or the partition mode.

[0385] Optionally, the predetermined range is an L times distance of the width and / or height of the second image block.

[0386] Optionally, L is 4-10.

[0387] In the embodiments of the present application, the index of the first image block in at least one first image unit group in the predetermined range where the second image block is located is determined or obtained to update and determine the indication information list for the index of the prediction mode and / or the partition mode of the first image block, so that the average code length of the coded index of the prediction mode and / or the partition mode is shorter, and the signaling encoding and decoding efficiency is improved.

[0388] Optionally, the first image unit group associated with the first image block in step S26 includes the coded image unit group located in at least one predetermined angle direction and a predetermined step length of the image unit group where the first image block is located. The predetermined angle direction can include at least one, and the predetermined step length can be represented by a natural number, for example, the predetermined angle direction can include 0°, 15°, 270° and 315°, and can be further refined into multiple angles, as shown in FIG. 16, the predetermined angle direction can include multiple directions from-14 to 80, and the predetermined step length can be understood as the number of adjacent image unit groups (such as CTU), such as the step length of the image unit group directly adjacent to the image unit group where the first image block is located is 1, and the step length of the image unit group adjacent to the image unit group directly adjacent to the image unit group where the first image block is located is 2, and so on.

[0389] Optionally, the predetermined step length is 1-20.

[0390] Optionally, in step S27, the first image unit group in the predetermined range where the first image block is located includes the coded image unit group in the same slice and / or the same matrix coding unit as the first image block. Optionally, the same slice means the same Slice, and the same matrix coding unit means the same Tile.

[0391] Optionally, as shown in FIG. 17, an image can be divided into several Slices or Tiles, each of which is an independently decodable unit, as shown in FIG. 18, each Slice includes one or more Tiles and one or more CTUs (such as CTU0, CTU1, CTU2, and CTU3), and each CTU includes a plurality of CUs.

[0392] Optionally, a division manner of the Tile is given in FIG. 15, and the entire image is divided into nine Tiles by column boundaries and row boundaries, each of which is rectangular, and in the encoding, all the Tiles in the image are processed in the scanning order, and the CTUs in each Tile are encoded in the Raster Scan order, which means that the scanning is performed from left to right and from top to bottom, and each row is scanned first and then the scanning is continued from the start position of the next row.

[0393] Optionally, since there can be a case that one Slice includes multiple Tiles or one Tile includes multiple Slices, the predetermined range can include all the CTUs (coding tree units) that have been completely encoded in the contained unit in the Slice or Tile where the current CU is located.

[0394] Optionally, the updating of the indication information list is determined or obtained by the frequency of the index of the first image block in the at least one first image unit group, and after the predetermined range is determined, the CUs in the range that select the prediction mode and / or the division mode as the best mode for encoding are counted, the number of occurrences of 0-31 indexes is accumulated, and the selected probability is calculated.

[0395] In the embodiments of the present application, the selected probability is determined by the frequency of the index corresponding to the prediction mode and / or the division mode of each CU in the predetermined range, which is more flexible than the traditional fixed statistical range, can adaptively update according to the CU being currently encoded, and is convenient for determining the best indication information list according to the latest selected probability distribution.

[0396] Optionally, the updating the indication information list is determined or obtained by a frequency of an index of a first image block in the at least one first image unit group, and a weighting processing of the frequency of the at least one index according to a distance between a second image block and the first image block in the at least one first image unit group; after a predetermined range is determined, a prediction mode indication information of a CU in the range is traversed to make statistics, a number of times each indication information in N prediction mode indication information appears is accumulated and a total number of times the N indication information appears is calculated, according to the number of times each indication information appears and the total number of times, a selected probability of each indication information is calculated, and when the number of times each indication information appears is accumulated, the number of times can be appropriately weighted according to a distance between a CU to be counted and the current CU, the number of times of the CU closer to the current CU is greater, that is, the information of the CU closer to the current CU is more reliable.

[0397] Optionally, the updating the indication information list is determined or obtained by a frequency of an index of a first image block in the at least one first image unit group, and a weighting processing of the frequency of the at least one index according to a distance between a second image block and the first image block in the at least one first image unit group; after a predetermined range is determined, a prediction mode indication information of a CU in the range is traversed to make statistics, a number of times each indication information in N prediction mode indication information appears is accumulated and a total number of times the N indication information appears is calculated, according to the number of times each indication information appears and the total number of times, a selected probability of each indication information is calculated, and when the number of times each indication information appears is accumulated, the number of times can be appropriately weighted according to a distance between a CU to be counted and the current CU, the number of times of the CU closer to the current CU is greater, that is, the information of the CU closer to the current CU is more reliable.

[0398] Optionally, the N indexes include indexes with indexes N0-N1, N0 is equal to 0, and N1 is equal to 1.

[0399] In the embodiment of the application, the credibility of the selected probability of each index in the statistics is further improved by further weighting processing of the index frequency according to the distance.

[0400] In the embodiment of the application, the updating the indication information list is determined by at least one of the following modes nine to eleven:

[0401] Mode nine, the updating the indication information list is determined or obtained by the selected probability of the at least one index;

[0402] Optionally, the indication information list is updated in the image encoding and / or decoding process according to the selection probability of the indication information in the indication information list, so that the indication information list can be more suitable for the prediction task of the image block currently being processed. The indication information list is updated in real time in the image encoding and / or decoding process. In the updating process, the indication information list is mainly updated based on the selection probability of the indication information, and / or the updated indication information list still follows the rule that the code word length is inversely proportional to the selection probability, so that the average code length is further reduced.

[0403] Optionally, after the indication information list is updated, the encoding rule of the coding index needs to be replaced synchronously at the encoding end and the decoding end.

[0404] Optionally, the rule corresponding to the original code word is replaced in the encoder and the decoder, which has the effect of introducing the updated indication information list, so as to realize a new index encoding mechanism. Specifically, at the encoding end, the encoder reads the corresponding code word from the pre-defined fixed code word mapping rule and writes it into the code stream according to the new code word rule in the GPM division mode index encoding process. At the decoding end, the decoder uses the same code word rule as the encoder, parses the code word bit by bit according to the same parsing rule, and quickly restores the corresponding division mode ordering index value. In the above entire process, the encoder and the decoder share the same code word rule, without the need to transmit any additional signaling to indicate the currently used encoding scheme, thereby ensuring the compactness of the encoding and the consistency of the implementation.

[0405] Optionally, in the process of updating the indication information list in the image encoding and / or decoding process according to the selection probability of the indication information in the indication information list, the indication information list is updated according to the selection probability of the index of the prediction mode and / or the division mode of the image block in a predetermined range. The predetermined range can be the adjacent coded image block of the image block currently being processed, or the coded image block in the same coding tree unit, rectangular coding unit or other optional coding unit as the current image block.

[0406] Optionally, the predetermined range is a distance of L times the width and / or height of the second image block.

[0407] Optionally, L is 4-10.

[0408] In the embodiments of the present application, the indication information list is updated in the image encoding and / or decoding process according to the selection probability of the indication information in the indication information list, which improves the real-time performance of the selection probability statistics and can update the latest indication information list according to the real-time selection probability.

[0409] The tenth mode is to determine or obtain the updated indication information list according to at least one index code length and code word.

[0410] Optionally, an optimization method such as bit permutation can be used to determine a set of theoretically optimal non-uniform code length allocation schemes. In this stage, only the optimal length of each index is concerned, and any grouping structure is completely ignored. The purpose is to find a code length allocation scheme that can minimize the average code length. After obtaining the ideal code length allocation, the code length of each index is grouped, and the code length of the indexes in each group is equal. Finally, the corresponding code word is allocated to each index.

[0411] Optionally, the code length of the indexes in each group is equal, and the prefix of the indexes in the same group is the same, and the length of the suffix is the same.

[0412] Optionally, the optimization method of bit permutation can also be understood as an iterative optimization method of code rate budget. The core idea is to find a path of "sacrifice A and subsidize B, and finally benefit the whole" through mathematical calculation on a benchmark scheme with no optimization space. Specifically, the specific goal of this method is to find a new code length {Li'} code length allocation scheme that satisfies the condition of "unique code word prefix" (i.e., Kraft inequality ∑2-Li≤1), so that the average code length ∑Pi×Li' reaches the minimum effect.

[0413] The eleventh mode is to determine or obtain the updated indication information list according to at least one candidate indication information list.

[0414] Optionally, the indication information list includes at least one indication information list, and the indication information list can also include at least one candidate indication information list. In the process of image coding, at least one candidate indication information list can be pre-set, and then a best indication information list can be selected from the candidate indication information list according to the distribution of the selected probability of the indication information, to encode the index of the prediction mode and / or the partition mode.

[0415] In the embodiments of the present application, a best indication information list can be determined through at least one candidate indication information list, which increases the flexibility of the indication information list selection.

[0416] Optionally, the technical solutions of the embodiments of the present application are integrated into the implementation method of the VVC (Versatile Video Coding, multi-functional video coding) codec process as follows: encoder side integration, first construct a CTU level syntax element Gpm_split_mode_coding_rule, then before each CTU's first coded CU attempts to test the GPM mode, call the adaptive generation coding scheme module, if the GPM mode is selected, generate the coding scheme according to the generated coding scheme, and output the code word of the partition mode index, and finally write the coding result directly into the code stream without additional indicators or flag bits; the decoder side integration process includes: the decoder first completes the statistics of the GPU partition index information of the generated block before starting the decoding of the current new CTU, and adaptively generates the same coding scheme according to the consistent rules with the encoding end, and finally parses the code word according to the generated coding table and restores the ordering index, and then restores the GPM partition mode.

[0417] Optionally, the step of adding the adaptive generation coding scheme mechanism to the codec can include: first, clearly define the data acquisition range, obtain the syntax elements related to the Tile and Slice where the current CTU is located, including the starting position and size to determine which is the smallest unit, and when the Tile is the smallest unit, for example: traverse all CUs in the CTUs other than the current CTU in the Tile, if the coding mode selected by the checked CU is the traditional GPM mode, there will be an effective GPM partition mode index, collect this index and the position of the checked CU into a syntax element Gpm_Split_Mode_Set of the CTU.

[0418] Optionally, considering that the closer the checked CU to the current CTU, the higher the relevance of the information, so it should be given a greater weight, therefore, different values are used for cumulative counting according to the position, for example, the indexes of the CUs in the closest one circle above, left, upper right and lower left of the current CTU are cumulatively counted using a first cumulative value, the second circle outward is cumulatively counted using a second cumulative value, and the third circle outward is cumulatively counted using a third cumulative value, and finally normalized to generate the selection probability of each index from 0 to 32.

[0419] Optionally, considering that the closer the checked CU to the current CU, the higher the relevance of the information, so it should be given a greater weight, therefore, different values are used for cumulative counting according to the position, for example, the indexes of the CUs in the closest one circle above, left, upper right and lower left of the current CU are cumulatively counted using a first cumulative value, the second circle outward is cumulatively counted using a second cumulative value, and the third circle outward is cumulatively counted using a third cumulative value, and finally normalized to generate the selection probability of each index from 0 to 32.

[0420] Optionally, the first accumulated value is 5, the second accumulated value is 3, and the third accumulated value is 1, that is, the index of the CU closest to the current CTU or CU is counted once, and the index of the second closest CU is counted once, and the index of the third closest CU is counted once, and then the normalized probability of 0-32 is generated.

[0421] Optionally, the distance between the first circle, the second circle, and the third circle is L times the width or height of the current block.

[0422] Optionally, L is 1-3.

[0423] Optionally, in order to ensure the statistical effect, an update threshold is set, and the adaptive encoding scheme can be used only when the number of effective GPM partition mode indexes of the checked CUs exceeds the update threshold, otherwise the original encoding scheme is retained.

[0424] Optionally, the method of automatically traversing the update indication information list in the embodiment includes: trying the original encoding scheme, trying the improved encoding scheme, and trying to merge similar probability groups, and saving the one with the shortest average code length as the GPM partition mode index encoding scheme of the CTU. Since the traversal method may be more, in order to properly reduce the encoding and decoding complexity, an early stopping mechanism can be introduced: taking the average code length of the original encoding scheme as the benchmark, when the average code length is reduced by 0.1 (or other threshold) of the benchmark, stop traversing other generation methods.

[0425] Optionally, in the process of modifying the code, a syntax element Gpm_Split_Mode_Set is added at the CTU level to store the GPM partition mode index and the CU position of the effective checked CUs. Before processing the new CTU, the code is added, and the encoding end adds the code for traversing the statistical code of the related CU and the code for traversing the fixed code table generation method in xCheckRDCostMergeGeoComb2Nx2N, and generates the best index encoding scheme of the CTU here. Since the function is used to process the CU, only the first CU in the CTU that is suitable for the GPM mode needs to perform this step, that is, a CTU-level syntax element is used to mark whether the index encoding scheme adaptive generation has been completed. The decoding end adds the same processing code in xdecompressCTU, and finally the sending code stream code in the CABACWriter::geoModeIdx function of the encoder and the (CABACReader::geoModeIdx) function of the decoding end is modified.

[0426] The embodiment of the present application provides a mechanism capable of synchronizing at an encoding end and a decoding end, automatically and in real time generating an optimal encoding scheme. Specifically, in the encoding process, the encoding end dynamically and in real time statistically analyzes the actual selection probability distribution of each index based on the statistical information of the GPM division index in the current and historical encoded blocks (CTU / CU), and the encoding end adaptively adjusts the encoding scheme of the index by using the probability distribution, so as to maximize the approximation of the statistical characteristics of the current video content, effectively reduce the average code length, and improve the compression efficiency.

[0427] The embodiment of the present application further provides a processing device, including a memory and a processor, and the memory stores an image processing program, and the image processing program is executed by the processor to realize the steps of the image processing method in any of the above embodiments.

[0428] The embodiment of the present application further provides a storage medium, and the storage medium stores an image processing program, and the image processing program is executed by the processor to realize the steps of the image processing method in any of the above embodiments.

[0429] In the embodiment of the processing device and the storage medium provided by the present application, all the technical features of any of the above processing method embodiments can be included, and the description and explanation contents are basically the same as those of the above method embodiments, which will not be repeated here.

[0430] The embodiment of the present application further provides a computer program product, which comprises computer program code, and when the computer program code runs on a computer, the computer executes the method in various possible embodiments.

[0431] The embodiment of the present application further provides a chip, including a memory and a processor, the memory is used for storing a computer program, and the processor is used for calling and running the computer program from the memory, so that the device installed with the chip executes the method in various possible embodiments.

[0432] It can be understood that the above scenarios are only examples and do not constitute a limitation on the application scenarios of the technical solutions provided by the embodiments of the present application. The technical solutions provided by the embodiments of the present application can also be applied to other scenarios. For example, those skilled in the art can know that, with the evolution of system architecture and the appearance of new business scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

[0433] The serial numbers of the above embodiments of the present application are only for description, and do not represent the advantages and disadvantages of the embodiments.

[0434] The steps in the method of the embodiments of the present application can be adjusted, combined and deleted in sequence according to actual needs.

[0435] The units in the device of the embodiments of the present application can be combined, divided and deleted according to actual needs.

[0436] In the present application, for the same or similar term concept, technical scheme and / or application scene description, generally only detailed description is made at the first occurrence, and for the sake of brevity, the repeated description is generally not repeated, and for the understanding of the technical scheme of the present application, the same or similar term concept, technical scheme and / or application scene description which is not described in detail afterwards can refer to the relevant description before.

[0437] In the present application, the description of each embodiment has its own focus, and the part not described or recorded in a certain embodiment can refer to the relevant description of other embodiments.

[0438] The technical features of the technical scheme of the present application can be combined arbitrarily, in order to make the description simple, the above-mentioned technical features of each embodiment are not described all possible combinations, however, as long as the combination of these technical features does not exist contradictory, should be considered as the range recorded in the present application.

[0439] Through the description of the above embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment method can be realized by software and necessary general hardware platform, of course, it can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical scheme of the present application can be embodied in the form of software product, and the computer software product is stored in the above-mentioned storage medium (such as ROM / RAM, magnetic disc, optical disc), including a plurality of instructions for making a terminal device (which can be a mobile phone, computer, server, controlled terminal, or network device, etc.) execute the method of each embodiment of the present application.

[0440] In the above embodiments, all or part of the embodiments can be implemented by software, hardware, firmware or any combination thereof. When implemented by software, all or part of the embodiments can be implemented in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions according to the embodiments of the present application are generated. The computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions can be stored in a storage medium or transferred from one storage medium to another storage medium, for example, the computer instructions can be transferred from one website, computer, server or data center to another website, computer, server or data center through wired (such as coaxial cable, optical fiber, digital subscriber line) or wireless (such as infrared, wireless, microwave, etc.) mode. The storage medium can be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. integrated with one or more available media. The available media can be magnetic media (such as floppy disk, storage disk, magnetic tape), optical media (such as DVD), or semiconductor media (such as solid state disk (SSD)) and the like.

[0441] The above is only the preferred embodiment of the present application, and does not limit the patent scope of the present application, and any equivalent structure or equivalent process transformation using the content of the specification and drawings of the present application, or direct or indirect application in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. An image processing method, wherein, The method comprises the following steps: According to the candidate indication information list, the indication information is determined or obtained.

2. The image processing method of claim 1, wherein, The indication information comprises at least one of the following: The index corresponding to the first mode; The code word corresponding to the index of the first mode; The index of the index group corresponding to the first mode; The code word related to the index of the index group corresponding to the first mode; The index of the first mode in the index group; The code word related to the index of the first mode in the index group Information for indicating the first mode; Information for indicating the sub-mode of the first mode; Information for indicating the first mode in the first mode list; The syntax element related to the first mode and / or the image block.

3. The image processing method of claim 2, wherein, Further comprising at least one of the following: The code word of the index corresponding to the first mode is determined according to the selection probability of the first mode corresponding to the index; The code word related to the index of the index group corresponding to the first mode is determined according to the selection probability of the index group corresponding to the first mode; The code word related to the index of the first mode in the index group is determined according to the selection probability of the index in the index group; The length of the code word is inversely proportional to the size of the selection probability.

4. The image processing method of claim 1, wherein, Further comprising at least one of the following: The indication information is determined or obtained from the code stream, The indication information is determined or obtained according to the rate-distortion optimization process; The indication information is determined or obtained according to the selection probability and the candidate indication information list; The indication information is located in the code stream.

5. The image processing method of claim 4, wherein, Further comprising at least one of the following: The indication information is determined according to a target indication information list in the at least one candidate indication information list; The indication information is contained in an indication information group in the target indication information list; The indication information list corresponds to at least one candidate first mode; The indication information list comprises first indication information with the same index and different code words related to the index.

6. The image processing method of claim 5, wherein, The indication information group comprises an index group; and / or, the indication information list comprises an index list.

7. The image processing method of claim 5, wherein, Further comprising at least one of the following: The selection probability corresponding to the indication information or the indication information group at the first position in the indication information list is higher than the selection probability corresponding to the indication information or the indication information group at the second position; The information length of the indication information or the indication information group at the first position in the indication information list is smaller than the information length of the indication information or the indication information at the second position; The grouping scheme of the candidate indication information list comprises the number of indication information groups and the number of indication information of at least one indication information group.

8. The image processing method of claim 5, wherein, The target indication information list is determined or obtained by at least one of the following: Matching according to the selection probability corresponding to the index in the at least one candidate indication information list; Matching according to the selection probability corresponding to the index group in the at least one candidate indication information list; The selection probability distribution obtained by grouping the selection probability corresponding to at least one index according to the grouping scheme of the at least one candidate indication information list; At least one of the following according to the selection probability corresponding to at least one index: the intra-group variance corresponding to the grouping result under the grouping scheme of the at least one candidate indication information list, the range of the mean of the intra-group selection probability, the square error of the mean of the intra-group selection probability, and the selection probability corresponding to at least one indication information in the group.

9. A processing device, wherein, The method comprises the following steps: A memory and a processor, the memory stores an image processing program, and the image processing program is executed by the processor to realize the steps of the image processing method in claim 1.

10. A storage medium, wherein, The storage medium has stored thereon a computer program which, when executed by a processor, implements the steps of the image processing method according to claim 1.

Citation Information

Patent Citations

  • Encoding method, decoding method, encoder, decoder and storage medium

    CN113261285A

  • Image prediction method and device

    CN116527889A

  • Processing method, processing equipment and storage medium

    CN117176959A

  • Video decoding method and device, video coding method and device, storage medium and code stream storage method

    CN118233642A

  • Processing method, processing equipment and storage medium

    CN119865624A