Processing method, processing device, and storage medium

Abstract

Provided in the present application are a processing method, a processing device, and a storage medium. The processing method comprises: on the basis of division information, determining a candidate division information list and / or prediction of the division information; and dividing a current block on the basis of the candidate division information list and / or the prediction of the division information. The present application can reduce signaling overheads for block division, thereby improving the efficiency of video coding and decoding.

Description

Processing method, processing device and storage medium This application claims the priority of the Chinese patent application filed with the China Patent Office on November 2, 2023, with application number 202311445633.9 and invention name “Processing method, processing device and storage medium”, all contents of which are incorporated by reference in the application. Technical Field The present application relates to the technical field of image processing, and in particular to a processing method, a processing device and a storage medium. Background Art The existing high-efficiency video coding standard protocol (H.266 / VVC) proposes a video frame encoding technology, which specifically includes that when encoding and decoding the video frame, the protocol divides each frame into different blocks, performs prediction processing, and then performs encoding and decoding processing. In the process of conceiving and implementing the present application, the inventors found that there are at least the following problems: when performing block division processing, since each CTU (Coding Tree Unit) is divided into multiple CUs (Coding Units), the division method of each CU requires a separate division signaling representation, resulting in large signaling overhead for block division, which in turn limits the efficiency of video encoding and decoding. The preceding description is intended to provide general background information and does not necessarily constitute prior art. Technical Solutions In response to the above technical problems, the present application provides a processing method, a processing device and a storage medium, aiming to solve the technical problem of how to reduce the signaling overhead of block division and thereby improve the efficiency of video encoding and decoding. The present application provides a processing method, which can be applied to a processing device, comprising the steps of: S10, determining a candidate partition information list and / or a prediction of the partition information according to the partition information; S20, dividing the current block according to the candidate partition information list and / or the prediction of the partition information. Optionally, the step S10 includes at least one of the following: Determine at least one partition information according to at least one of the partition information of the neighbor block, the partition information of the non-neighbor block, the default partition information, the partition information of the selected block, the pixel and the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Determine at least one type of partition information according to the frequency of the partition information of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one type of partition information; Determine at least one partition information according to the partition information, pixels and coding parameters of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate or sort according to the block partition information, pixels and coding parameters, determine at least one partition information after calculation or sorting, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate a cost value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the cost value; Calculate a first generation value and a second generation value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the first generation value and the second generation value; Calculate a SAD value and / or a SATD value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to at least one type of partition information determined by the SAD value and / or the SATD value corresponding to the at least one type of partition information; According to the first component partition information of the neighbor block and / or the first component partition information of the non-neighbor block, a candidate partition information list and / or a prediction of the partition information of the second component of the current block is determined or obtained. Optionally, determining or obtaining a candidate partition information list and / or a prediction of the partition information according to at least one partition information includes at least one of the following: Determine or obtain a candidate partition information list and / or a prediction of the partition information according to the partition information list to which at least one partition information is added; Sorting the determined at least one type of division information, and determining or obtaining a candidate division information list and / or a prediction of the division information according to the sorted at least one type of division information; Determine or obtain a candidate partition information list and / or a prediction of the partition information according to a cost of at least one partition information; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a neural network to obtain an output result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the output result; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a query table for querying, obtaining a query result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the query result; Matching is performed according to at least one type of partition information, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the matched at least one type of partition information; At least one of the at least one partition information, pixel and encoding / decoding parameter is input into a mathematical model, and a candidate partition information list and / or a prediction of the partition information is determined or obtained according to an output result of the mathematical model. Optionally, the processing method further includes at least one of the following: The partition information includes a block partition mode and / or a block partition depth; The candidate partition information list includes at least one of the following: A list of first-level candidate partitioning methods; A list of second-level candidate partitioning methods; First level candidate partition depth list; Second level candidate partition depth list. Optionally, determining or obtaining a candidate partition information list according to at least one partition information comprises at least one of the following: Creating or updating a first-level candidate partitioning method list according to at least one partitioning information, and determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning method list; Creating or updating a first-level candidate partition depth list according to at least one partition information, and determining or obtaining a second-level candidate partition depth list according to the first-level candidate partition depth list; According to at least one type of partitioning information, a first-level candidate partitioning method list is created or updated, and according to the first-level candidate partitioning method list, a first-level candidate partitioning method list is determined or obtained. A first-level candidate partition depth list, determining or obtaining a second-level candidate partition method list based on the first-level candidate partition depth list, and determining or obtaining a second-level candidate partition depth list based on the second-level candidate partition method list; Based on at least one kind of division information, create or update a first-level candidate division depth list; based on the first-level candidate division depth list, determine or obtain a first-level candidate division method list; based on the first-level candidate division method list, determine or obtain a second-level candidate division depth list; based on the second-level candidate division depth list, determine or obtain a second-level candidate division method list. Optionally, the step S20 comprises the steps of: S21, determining at least one type of partition information of the current block according to the candidate partition information list and / or the prediction of the partition information; S22, dividing the current block according to at least one type of division information of the current block. Optionally, the step S21 includes at least one of the following: Determine at least one type of partition information of the current block according to the index obtained from the bitstream and the candidate partition information list; Determine at least one type of partition information of the current block according to the non-list partition information index obtained from the bitstream and the non-list partition information except the candidate partition information list; At least one partition information of the current block is determined according to the block partition syntax elements in the bitstream, the prediction of the partition information and the inverse processing rule. Optionally, the processing method further includes at least one of the following: Determine or obtain an index according to the partition information of the encoded block, the search rule and the candidate partition information list, and encode the index; According to the division information of the coded block, the processing rule and the prediction of the division information, the division information to be coded is determined, and the division information to be coded is coded. The present application also provides a processing device, comprising: A processing module is used to determine a candidate partition information list and / or a prediction of the partition information based on the partition information; and to partition the current block based on the candidate partition information list and / or the prediction of the partition information. The present application also provides a processing device, including: a memory and a processor, wherein a processing program is stored in the memory, and when the processing program is executed by the processor, the steps of any of the above processing methods are implemented. The processing device in this application can be a smart terminal or a server. The present application also provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the steps of any of the processing methods described above are implemented. As described above, the processing method of the present application can be applied to a processing device, including: determining a candidate partition information list and / or a prediction of the partition information based on the partition information, and partitioning the current block based on the candidate partition information list and / or the prediction of the partition information. Through the above technical solution, it is possible to avoid the need to use separate partition signaling representations for all partitioning methods during the partition processing, which leads to a large signaling overhead. By first determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the partition information, the partition information that may be used by the current block can be reasonably planned into the candidate partition information list, or the prediction of the partition information corresponding to the partition information that may be used by the current block can be determined. Then, when the current block is partitioned based on the candidate partition information list and / or the prediction of the partition information, the hit rate of the partition information is improved, the signaling representation of the partition information is reduced, and the signaling overhead of the block partition is reduced, thereby reducing the partition cost of the current block partition and improving the efficiency of video encoding and decoding. BRIEF DESCRIPTION OF THE DRAWINGS The drawings herein are incorporated into the specification and constitute a part of the specification, illustrate embodiments consistent with the present application, and are used together with the specification to explain the principles of the present application. In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments are briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative labor. FIG1 is a schematic diagram of the hardware structure of a mobile terminal for implementing various embodiments of the present application; FIG2 is a diagram of a communication network system architecture provided in an embodiment of the present application; FIG3 is a schematic flow chart of a processing method according to the first embodiment; FIG4 is a schematic diagram of a polytype tree partitioning method according to the first embodiment; FIG5 is a schematic diagram of CTU division according to the first embodiment; FIG6 is another schematic diagram showing the division of a CTU according to the first embodiment; FIG7 is a schematic diagram of blocks of other frames and the current frame according to the first embodiment; FIG8 is a schematic diagram of a processing method based on SAD calculation according to the first embodiment; 9 is a schematic diagram of creating and encoding a multi-level division information list according to the first embodiment; 10 is a schematic diagram of decoding a multi-level division information list according to the first embodiment; FIG11 is a schematic diagram of prediction and encoding of block partition information according to the first embodiment; FIG12 is a schematic diagram of prediction and decoding of block partition information according to the first embodiment; FIG13 is a schematic diagram showing generation of a candidate partitioning method list based on a neural network according to the second embodiment; FIG14 is another schematic diagram showing generation of a candidate partitioning method list based on a neural network according to the second embodiment; FIG15 is a schematic flow chart of a processing method according to a fourth embodiment; FIG16 is a schematic diagram of a block division method in a frame of image according to a fourth embodiment; FIG17 is a schematic diagram of a first frame block division method according to a fourth embodiment; FIG18 is a schematic diagram of first frame block division depth according to the fourth embodiment; FIG19 is a schematic diagram showing eight block division methods according to the fourth embodiment; FIG20 is a schematic diagram showing a further division of the upper half of the division 1 in FIG19 according to the fourth embodiment; FIG21 is a schematic diagram of depth-division decoding according to a fourth embodiment; FIG. 22 is a schematic diagram of a module according to a processing device in an embodiment of the present application. The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with the embodiments and with reference to the accompanying drawings. The embodiments of the present invention will be described in more detail later. These drawings and text descriptions are not intended to limit the scope of the present invention in any way, but to illustrate the concept of the present invention for those skilled in the art by referring to specific embodiments. Implementation Methods of the Application Exemplary embodiments will be described in detail herein, examples of which are shown in the accompanying drawings. When the following description refers to the drawings, the same numbers in different drawings represent the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the appended claims. It should be noted that, in this article, the terms "include", "comprises" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "includes a ..." does not exclude the existence of other identical elements in the process, method, article or device including the element. Optionally, components, features, and elements with the same name in different embodiments of the present application may have the same meaning or different meanings, and their specific meanings need to be determined by their explanation in the specific embodiment or further combined with the context in the specific embodiment. It should be understood that, although the terms first, second, third, etc. may be used to describe various information in this article, these information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of this article, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein can be interpreted as "at the time of" or "when" or "in response to determination". Furthermore, as used in this article, the singular forms "one", "one" and "the" are intended to also include plural forms, unless there is an opposite indication in the context. It should be further understood that the terms "comprising" and "including" indicate that there are the described features, steps, operations, elements, components, projects, kinds, and / or groups, but do not exclude the existence, occurrence or addition of one or more other features, steps, operations, elements, components, projects, kinds, and / or groups. The terms "or", "and / or", "including at least one of the following" etc. used in this application can be interpreted as inclusive, or mean any one or any combination. For example, “comprising at least one of the following: A, B, C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”, and for another example, “A, B or C” or “A, B and / or C” means “any of the following: A; B; C; A and B; A and C; B and C; A and B and C”. An exception to this definition will only occur when a combination of elements, functions, steps or operations are inherently mutually exclusive in some manner. It should be understood that, although the various steps in the flowchart in the embodiment of the present application are displayed in sequence according to the indication of the arrows, these steps are not necessarily performed in sequence according to the order indicated by the arrows. Unless there is a clear explanation in this article, the execution of these steps does not have a strict order restriction, and it can be performed in other orders. Moreover, some steps in the figure may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily performed at the same time, but can be performed at different times, and their execution order is not necessarily performed in sequence, but can be performed in turn or alternately with other steps or sub-steps of other steps or parts of stages. As used herein, the words "if" and "if" may be interpreted as "at the time of" or "when" or "in response to determining" or "in response to detecting", depending on the context. Similarly, the phrases "if it is determined" or "if (stated condition or event) is detected" may be interpreted as "when it is determined" or "in response to determining" or "when detecting (stated condition or event)" or "in response to detecting (stated condition or event)", depending on the context. It should be noted that in this article, step codes such as S10 and S20 are used for the purpose of expressing the corresponding content more clearly and concisely, and do not constitute a substantial limitation on the sequence. When implementing the step, those skilled in the art may execute S20 first and then S10, etc., but these should all be within the scope of protection of this application. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application. In the subsequent description, the suffixes such as "module", "component" or "unit" used to represent elements are only used to facilitate the description of the present application, and have no specific meanings. Therefore, "module", "component" or "unit" can be used in a mixed manner. The processing device in this application may be a smart terminal or a server. The smart terminal may be implemented in various forms. For example, the smart terminal described in this application may include smart terminals such as mobile phones, tablet computers, laptop computers, PDAs, portable media players (PMPs), navigation devices, wearable devices, smart bracelets, pedometers, and fixed terminals such as digital TVs and desktop computers. The following description will be made by taking a mobile terminal as an example, and those skilled in the art will understand that, in addition to components specifically used for mobile purposes, the construction according to the embodiments of the present application can also be applied to fixed-type terminals. Please refer to FIG1, which is a schematic diagram of the hardware structure of a mobile terminal for implementing various embodiments of the present application. The mobile terminal 100 may 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. Those skilled in the art will appreciate that the mobile terminal structure shown in FIG1 does not constitute a limitation on the mobile terminal, and the mobile terminal may include more or fewer components than shown, or combine certain components, or arrange the components differently. The following is a detailed introduction to the various components of the mobile terminal in conjunction with Figure 1: The radio frequency unit 101 can be used for receiving and sending signals during information transmission or calls. Specifically, after receiving the downlink information of the base station, it is sent to the processor 110 for processing; in addition, the uplink data is sent 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. Optionally, the radio frequency unit 101 can also communicate with the network and other devices through wireless communication. The above-mentioned wireless communications can use any communication standard or protocol, including but not limited to GSM (Global System of 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 and 6G, etc. WiFi is a short-range wireless transmission technology. The mobile terminal can help users send and receive emails, browse web pages, and access streaming media through the WiFi module 102, which provides users with wireless broadband Internet access. Although FIG1 shows the WiFi module 102, it is understandable that it is not a necessary component of the mobile terminal and can be omitted as needed without changing the essence of the invention. The audio output unit 103 can be used when the mobile terminal 100 is in a call signal receiving mode, a conversation mode, a recording mode, a speech recognition mode, a broadcast receiving mode, or a voice recognition mode. When in the mobile terminal 100 mode, the audio data received by the RF unit 101 or the WiFi module 102 or stored in the memory 109 is converted into an audio signal and output as sound. Moreover, the audio output unit 103 can also provide audio output related to a specific function performed by the mobile terminal 100 (for example, a call signal reception sound, a message reception sound, etc.). The audio output unit 103 may include a speaker, a buzzer, etc. The A / V input unit 104 is used to receive audio or video signals. The A / V input unit 104 may include a graphics processor (GPU) 1041 and a microphone 1042, and the graphics processor 1041 processes the image data of a static picture or video obtained by an image capture device (such as a camera) in a video capture mode or an image capture mode. The processed image frame can be displayed on the display unit 106. The image frame processed by the graphics processor 1041 can be stored in the memory 109 (or other storage medium) or sent 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, and other operating modes, and can process such sound into audio data. The processed audio (voice) data can be converted into a format output that can be sent to a mobile communication base station via the radio frequency unit 101 in the case of a telephone call mode. The microphone 1042 can implement various types of noise elimination (or suppression) algorithms to eliminate (or suppress) noise or interference generated in the process of receiving and sending audio signals. The mobile terminal 100 also includes at least one sensor 105, such as a light sensor, a motion sensor, and other sensors. Optionally, the light sensor includes an ambient light sensor and a proximity sensor. Optionally, the ambient light sensor can adjust the brightness of the display panel 1061 according to the brightness of the ambient light, and the proximity sensor can turn off the display panel 1061 and / or the backlight when the mobile terminal 100 is moved to the ear. As a type of motion sensor, the accelerometer sensor can detect the magnitude of acceleration in all directions (generally three axes), and can detect the magnitude and direction of gravity when stationary. It can be used for applications that identify the posture of the mobile phone (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), vibration recognition related functions (such as pedometer, tapping), etc.; as for other sensors that can be configured on the mobile phone, such as fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc., they will not be repeated here. The display unit 106 is used to display information input by the user or information provided to the user. The display unit 106 may include a display panel 1061, which may be configured in the form of a liquid crystal display (LCD), an organic light-emitting diode (OLED), or the like. The user input unit 107 can be used to receive input digital or character information, and to generate key signal input related to the user settings and function control of the mobile terminal. Optionally, the user input unit 107 may include a touch panel 1071 and other input devices 1072. The touch panel 1071, also known as a touch screen, can collect the user's touch operation on or near it (such as the user's operation on the touch panel 1071 or near the touch panel 1071 using any suitable object or accessory such as a finger, stylus, etc.), and drive the corresponding connection device according to a pre-set program. The touch panel 1071 may include two parts: a touch detection device and a touch controller. Optionally, the touch detection device detects the user's touch orientation, detects the signal brought by the touch operation, and transmits the signal to the touch controller; the touch controller receives the touch information from the touch detection device, converts it into the touch point coordinates, and then sends it to the processor 110, and can receive and execute the command sent by the processor 110. Optionally, the touch panel 1071 can be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. In addition to the touch panel 1071, the user input unit 107 may further include other input devices 1072. Optionally, the other input devices 1072 may include, but are not limited to, one or more of a physical keyboard, a function key (such as a volume control key, a switch key, etc.), a trackball, a mouse, a joystick, etc., which are not specifically limited here. Optionally, the touch panel 1071 may cover the display panel 1061. When the touch panel 1071 detects a touch operation on or near it, it is transmitted to the processor 110 to determine the type of the touch event, and then the processor 110 provides a corresponding visual output on the display panel 1061 according to the type of the touch event. Although in FIG. 1 , the touch panel 1071 and the display panel 1061 are used as two independent components to implement 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 implement the input and output functions of the mobile terminal, which is not limited to the specifics herein. The interface unit 108 serves as an interface through which at least one external device can be connected to the mobile terminal 100. For example, the external device may 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 with an identification module, an audio input / output (I / O) port, a video I / O port, a headphone port, etc. The interface unit 108 may be used to receive input (e.g., data information, power, etc.) from an external device and transmit the received input to one or more elements within the mobile terminal 100 or may be used to transmit data between the mobile terminal 100 and an external device. 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. Optionally, the program storage area can store an operating system, an application required for at least one function (such as a sound playback function, an image playback function, etc.), etc.; the data storage area can store data created according to the use of the mobile phone (such as audio data, a phone book, etc.), etc. Optionally, the memory 109 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage devices. The processor 110 is the control center of the mobile terminal, which uses various interfaces and lines to connect various parts of the entire mobile terminal, and 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, thereby monitoring the mobile terminal as a whole. The processor 110 may include one or more processing units; preferably, the processor 110 may integrate an application processor and a modem processor. Optionally, the application processor mainly processes the operating system, the user interface and the application program, etc., and the modem processor mainly processes wireless communication. It is understandable that the above-mentioned modem processor may not be integrated into the processor 110. The mobile terminal 100 may also include a power supply 111 (such as a battery) for supplying power to various components. Preferably, the power supply 111 may be logically connected to the processor 110 through a power management system, so as to implement functions such as charging, discharging, and power consumption management through the power management system. Although not shown in FIG. 1 , the mobile terminal 100 may further include a Bluetooth module, etc., which will not be described in detail herein. In order to facilitate understanding of the embodiments of the present application, the communication network system on which the mobile terminal of the present application is based is described below. Please refer to Figure 2, which is a communication network system architecture diagram provided in an embodiment of the present application. The communication network system is an LTE system of universal mobile communication technology. The LTE system 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 that are connected in sequence. Optionally, UE201 may be the above-mentioned terminal 100, which will not be described in detail here. E-UTRAN 202 includes eNodeB 2021 and other eNodeBs 2022 , etc. Optionally, eNodeB 2021 may be connected to other eNodeBs 2022 via a backhaul (eg, an X2 interface), and eNodeB 2021 is connected to EPC 203 , and eNodeB 2021 may provide UE 201 with access to EPC 203 . EPC 203 may include MME (Mobility Management Entity) 2031, HSS (Home Subscriber Server) 2032, other MME 2033, SGW (Serving Gate Way) 2034, PGW (PDN Gate Way) 2035 and PCRF (Policy and Charging Rules Function) 2036. Optionally, MME 2031 It is the control node that processes the signaling between UE201 and EPC203, and provides bearer and connection management. HSS2032 is used to provide some registers to manage functions such as the home location register (not shown in the figure), and save some user-specific information such as service characteristics and data rates. All user data can be sent through SGW2034. PGW2035 can provide IP address allocation and other functions for UE 201. PCRF2036 is the policy and charging control policy decision point for service data flow and IP bearer resources. It selects and provides available policy and charging control decisions for the policy and charging execution function unit (not shown in the figure). IP service 204 may include the Internet, intranet, IMS (IP Multimedia Subsystem) or other IP services. Although the above introduction takes 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 to other wireless communication systems, such as GSM, CDMA2000, WCDMA, TD-SCDMA, 5G and future new network systems (such as 6G), etc., without limitation here. Based on the above-mentioned mobile terminal hardware structure and communication network system, various embodiments of the present application are proposed. First embodiment Referring to FIG. 3 , FIG. 3 is a schematic flow chart of a processing method according to a first embodiment. The processing method of the embodiment of the present application can be applied to a processing device, and includes the following steps: S10, determining a candidate partition information list and / or a prediction of the partition information according to the partition information; S20, dividing the current block according to the candidate partition information list and / or the prediction of the partition information. In this embodiment, the processing device may 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 this embodiment and this application, the processing device is mainly described as a smart terminal. The current block may be a block being encoded or decoded at the current moment, may be a frame of image, or may be an image block obtained by cutting a frame of image, which is not limited here. Optionally, the intelligent terminal can store various images and videos in advance, and can select a frame of image to be predicted from various images as the current block, or cut the selected image and use the cut image block as the current block. Alternatively, a frame of image can be extracted from the video sequence of the video as the current block, or the extracted frame of image can be cut and the obtained image block can be used as the current block. Alternatively, the processing device receives an input image or video, and extracts a frame of image from the image or video as the current block, or performs a segmentation process on the extracted frame of image, and obtains an image block as the current block. Alternatively, the processing device receives an image or video sent by other network devices, and extracts a frame of image from the image or video as the current block, or cuts and processes the extracted frame of image, and the obtained image block is used as the current block. At this time, the processing device establishes a communication connection with the network device on the network side of the mobile communication system in advance, so that the network device can send the image or video to the terminal device through the communication connection, and the terminal device receives the image or video. Optionally, before encoding the current block, block division is required. For example, in the H.266 / VVC protocol, a video frame may be divided into no less than one slice, and each slice is further divided into multiple maximum coding tree units (CTU). Each CTU can be up to 128×128, and the minimum CTU can support 32×32. A CTU is first divided once in a quadtree manner, and each leaf node of the quadtree can be further divided in a multi-type tree manner. As shown in FIG4 , there are four types of multi-type tree partitioning methods: horizontal binary tree partitioning (SPLIT_BT_HOR), vertical binary tree partitioning (SPLIT_BT_VER), horizontal ternary tree partitioning (SPLIT_TT_HOR), and vertical ternary tree partitioning (SPLIT_TT_VER). A specific example of CTU division is shown in FIG5 , where a CTU is finally divided into a plurality of coding units (CUs). Optionally, the CU is a rectangle. For another example, as shown in FIG6 , a CTU (128×128) is divided into two parts with a tree depth of 2. The division signaling includes: first layer: [split_cu_flag=1, split_qt_flag=1]; second layer: upper left [split_cu_flag=1, split_qt_flag=1, split_cu_flag=0000]; upper right [split_cu_flag=1, split_qt_flag=0, mtt_split_cu_vertical_flag=0, mtt_split_cu_binary_flag=1, split_cu_flag=00]; lower left [split_cu_flag=0]; lower right [split_cu_flag=1, split_qt_flag=0, mtt_split_cu_vertical_flag=0, mtt_split_cu_binary_flag=0, split_cu_flag=00]. Therefore, a total of 21 bits of signaling are required to divide the right CTU. The greater the signaling overhead / cost, the lower the coding efficiency. Based on this, in this embodiment, the current block is divided by determining a candidate partition information list and / or a prediction of the partition information, thereby reducing the partition signaling overhead in the CTU tree partition structure and improving the encoding and decoding efficiency. For example, if there are 32 ways of partitioning, if each way of partitioning is encoded, each way of partitioning requires log2(32)=5 bits to represent. If a list method is used, assuming that the list has four elements, when the hit rate of the list is 100%, the average representation cost of each way of partitioning is 2 bits. If a list method is used, assuming that the list has four elements, when the hit probability of the list is 60% (i.e., 60% for the four ways in the list and 40% for the non-list methods), according to the entropy coding principle, the average representation cost of the timely partition method is 0.6*2+0.4*log2(28)=3.12294196882. For another example, assume that the size range of the division depth is 0-7. If each division depth is probabilistically coded, each division depth requires 3 bits to represent. If the prediction block division depth method is adopted, assuming that the range of "prediction value-actual value" is 1-4, then the average representation cost of each division depth is log2(6)=2.58496250072 bits. If the prediction block division depth method is used, assuming that the range of "prediction value-actual value" is 1-1, then the average representation cost of each division depth is log2(3)=1.58496250072 bits. Based on this, it can be determined that by using a list method, improving the utilization rate of the list (i.e., the hit rate) can reduce the signaling overhead, and by using a method of encoding prediction errors, improving the prediction accuracy can reduce the signaling overhead. Optionally, the candidate partition information list may be a list, a table, or data in a preset format, which is not limited here. The prediction of the partition information may be a data value in a preset format, such as a partition information prediction value, or may be a pattern text in other forms used to represent the prediction of the partition information, or may be expressed in some manner without mathematical meaning. Optionally, after the intelligent terminal acquires the division information, it may further determine a candidate division information list and / or a prediction of the division information. Optionally, the partitioning method and / or partitioning depth of the current block can be predicted based on the partitioning information, for example, a list of candidate partitioning methods for the current block (i.e., one of the candidate partitioning information lists) can be determined based on the partitioning information, a list of candidate partitioning depths for the current block (i.e., one of the candidate partitioning information lists) can be determined based on the partitioning information, and a prediction of the partitioning information of the current block can be determined based on the partitioning information (including a prediction of the partitioning information corresponding to the block partitioning method and / or a prediction of the partitioning information corresponding to the partitioning depth). Optionally, a candidate partition information list (such as a block partition candidate list) is constructed based on the selected decoded blocks, and only the index of the candidate partition information list needs to be conveyed in the bitstream, thereby reducing the block partition signaling overhead. Optionally, the block division method is predicted based on the selected decoded block, and only the block division method difference or other deformations (such as patterns, numbers and text corresponding to the block division method difference) need to be conveyed in the code stream, thereby reducing the block division method signaling overhead. Optionally, a block partition depth list is constructed according to the selected decoded blocks, and only the index of the block partition depth list needs to be conveyed in the bitstream, thereby reducing the block partition depth signaling overhead. Optionally, the block division depth is predicted based on the selected decoded block, and only the block division depth difference or other deformations (such as patterns, numbers and text corresponding to the block division depth difference) need to be conveyed in the code stream, thereby reducing the block division depth signaling overhead. Optionally, the division information may be division information of a block. Optionally, the block may be at least one of a coding block, a decoding block, a current block, a neighbor block, a non-neighbor block, an adjacent block, a non-adjacent block, a block selected based on a preset rule, and the like. For example, as shown in FIG7 , if the current block to be encoded is u, the dotted line is the block dividing line. The neighboring blocks of u include TL, T, TR, L, BL, TL1, TL2, T1, TR1, TL3, L1 and BL1. Optionally, the same block u in other frames, such as the same bitmap, the previous frame of the current frame, etc. ′ The blocks are selected according to preset rules. Optionally, the partition information of the block may include at least one of the partition depth, partition mode, dimension, size, etc. Optionally, the number of the candidate partition information list may be at least one. Optionally, the predicted number of partition information may be one or more. Optionally, for step S10, determining the candidate partition information list and / or the prediction of the partition information according to the partition information may include at least one of the following methods: Mode 1: determining at least one partition information according to at least one of the partition information of neighbor blocks, the partition information of non-neighbor blocks, the default partition information, the partition information of selected blocks, pixels and coding parameters, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Optionally, the neighbor block may be a block adjacent to the current block, such as a block that is close to the current block, or a block that is separated by one or a preset number of blocks. A non-neighbor block may be a block that is far away from the current block. The division information of the neighbor block may be one or more, the division information of the non-neighbor block may be one or more, and the default division information may be one or more. Optionally, the selected block may be a block selected according to a preset rule, such as a block at the upper left corner of the current block, a block above the current block, etc. Alternatively, the block may be selected according to an instruction input by a user. No limitation is made here. Optionally, the partition information of the neighbor block may include a block partition mode or a block partition depth, or other relevant information for block partitioning, such as a partition mode, a partition depth, and the shape of the block after partitioning. The partition information of the non-neighbor block may include a block partition mode or a block partition depth, or other relevant information for block partitioning, such as a partition order, a partition handover, and the shape of the block after partitioning. The partition information of the selected block may include a block partition mode or a block partition depth, or other relevant information for block partitioning, such as a partition order, a partition handover, and the shape of the block after partitioning. The encoding and decoding parameters may be a bit rate, a QP (Quantization Parameter), or other parameters for block encoding and / or decoding. The pixel may be a pixel of a neighbor block, a pixel of a non-neighbor block, or a pixel of a selected block. Optionally, a block partition information list creation / update module may be provided, and at least one of neighbor block partition information, non-neighbor block partition information, default partition information, selected block partition information, pixels, and encoding / decoding parameters may be input into the block partition information list creation / update module, and a candidate partition information list that has been created or updated may be obtained as an output. Optionally, at least one partition information may be determined according to the block partition information list creation / update module, and a candidate partition information list may be determined or obtained according to the at least one partition information. Optionally, the first element of the candidate partition information list obtained by the output may be selected, or part or all of the partition information may be selected as a prediction of the determined or obtained partition information. Optionally, a block partition information prediction module may be provided, and at least one of the partition information of neighbor blocks, the partition information of non-neighbor blocks, the default partition information, the partition information of selected blocks, pixels and encoding and decoding parameters may be input into the block partition information prediction module, and the prediction of the partition information may be obtained by output. Optionally, at least one partition information may be determined according to the module for creating / updating the block partition information list, and the prediction of the partition information may be determined or obtained according to the at least one partition information. Optionally, part or all of the predictions of the partition information corresponding to each partition information obtained by outputting may be selected as the predictions of the determined or obtained partition information. Optionally, at least one of a neural network, a pattern matching rule, a mathematical pattern, and a query table may be set in the module for creating / updating the fast partition information list. Optionally, when updating the candidate partition information list, you can first obtain the constructed pattern list, and then you can update the pattern list through at least one of the neighbor block partition information, non-neighbor block partition information, default partition information, selected block partition information, pixels and encoding and decoding parameters to obtain an updated candidate partition information list. Optionally, a candidate partition information list and / or a prediction of the partition information may also be determined or obtained according to the partition information of the target block. Optionally, the target block may be a block in a neighboring frame of the frame where the current block is located. The neighboring frame may be an intra-frame coded frame or an intra-frame mixed coded frame. If the frame where the current block is located is a P frame (unidirectional prediction frame) or a B frame (bidirectional prediction frame), let the GOP (Group of picture) number be n, and the neighboring frame GOP number may be n-1, n-2, ..., n+1, n+2, etc., and may be an I frame (key frame, intra-frame coded frame), a P frame, or a B frame. Optionally, the target block may be a block that is a co-located block of the current block in a reference frame or a collocated frame. Optionally, if the current block is offset from the co-located block in the collocated frame, the offset co-located block may be obtained according to the corresponding motion vector, and the offset co-located block may be used as the target block. Optionally, it is only necessary to determine at least one of the neighbor block partition information, the non-neighbor block partition information and the default partition information to determine or obtain the candidate partition information list and / or the prediction of the partition information, thereby realizing the rapid creation of the candidate partition information list and / or the prediction of the partition information, and then quickly dividing the blocks, reducing the signaling overhead of block partitioning, and thereby improving the encoding and decoding efficiency. Optionally, in the scenario of the above-mentioned method 1, there is a scenario, such as method 2, in which a candidate partition information list and / or a prediction of the partition information is determined or obtained according to the partition information, pixels and encoding and decoding parameters of the neighboring blocks; For example, at least one division information that may be used to divide the current block can be determined based on the block division method, pixels and encoding and decoding parameters of the neighboring blocks, and at least one division information for dividing the current block can also be determined based on the block division depth, pixels and encoding and decoding parameters of the neighboring blocks. Optionally, the partition information of the neighboring blocks may be screened according to pixels and coding parameters to determine at least one partition information. Optionally, a module for determining or obtaining a candidate partition information list and / or a prediction of the partition information may be provided to calculate the block partitioning mode, Pixels and encoding and decoding parameters are input into the module, and at least one type of partition information is output. Optionally, a candidate partition information list may be constructed or updated based on the at least one partition information. Alternatively, a prediction value for predicting the partition information of the current block may be determined based on the block partitioning mode, pixels and coding parameters of the neighboring blocks, and a prediction of the partition information may be determined based on the prediction value, such as using the prediction value as the prediction of the partition information, or deforming the prediction value (such as difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation, etc.) to obtain a prediction of the partition information. Optionally, part or all of the candidate partition information list may be selected as a prediction value for determining or obtaining the partition information for predicting the current block. Optionally, the probability that each block partition information may be hit may be determined based on the block partition information, pixels and coding parameters of the neighboring blocks, and the prediction value for predicting the partition information of the current block may be determined based on the block partition information with the highest probability. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the partition information, pixels and encoding and decoding parameters of the neighboring blocks, it is possible to comprehensively consider the neighboring blocks to determine the candidate partition information list and / or the prediction of the partition information, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently divided, thereby reducing the signaling overhead of the block division, and thereby improving the efficiency of video encoding and decoding. Optionally, in the scenario of the above-mentioned method 1, there is a scenario, such as method 3, in which a candidate partition information list and / or a prediction of the partition information is determined or obtained according to the partition information, pixels and encoding and decoding parameters of the non-neighboring blocks; For example, at least one type of division information that may be used to divide the current block can be determined based on the block division method, pixels and encoding and decoding parameters of the non-neighboring blocks, and at least one type of division information for dividing the current block can also be determined based on the block division depth, pixels and encoding and decoding parameters of the non-neighboring blocks. Optionally, the partition information of the non-neighboring blocks may be screened according to pixels and coding parameters to determine at least one type of partition information. Optionally, a module for determining or obtaining a candidate partition information list and / or a prediction of partition information may be provided, and the block partitioning mode, pixels and encoding and decoding parameters of non-neighboring blocks are input into the module to output at least one partition information. Optionally, a candidate partition information list may be constructed or updated based on the at least one partition information. Alternatively, a prediction value for predicting the partition information of the current block may be determined based on the block partitioning mode, pixels and coding parameters of the non-neighboring blocks, and a prediction of the partition information may be determined based on the prediction value, such as using the prediction value as the prediction of the partition information, or deforming the prediction value (such as difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation, etc.) to obtain a prediction of the partition information. Optionally, part or all of the candidate partition information list may be selected as a prediction value for determining or obtaining the partition information for predicting the current block. Optionally, the probability that each block partition information may be hit may be determined based on the block partition information, pixels and encoding and decoding parameters of the non-neighboring blocks, and the prediction for predicting the partition information of the current block may be determined based on the block partition information with the highest probability. Optionally, the neighbor block includes an adjacent block and a non-adjacent block. The non-neighbor block includes a non-adjacent block. The adjacent block may be a block adjacent to the block to be divided into blocks, such as a block on the left, etc. The non-adjacent block may be a block not adjacent to the block to be divided into blocks. Optionally, based on the division information, pixels and coding parameters of the non-adjacent blocks, a candidate division information list and / or a prediction of the division information is determined or obtained. Optionally, based on the division information, pixels and coding parameters of the adjacent blocks, a candidate division information list and / or a prediction of the division information is determined or obtained. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the partition information, pixels and encoding and decoding parameters of the non-neighboring blocks, it is possible to comprehensively consider the non-neighboring blocks to determine the candidate partition information list and / or the prediction of the partition information, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently divided, thereby reducing the signaling overhead of the block division, and thereby improving the efficiency of video encoding and decoding. Optionally, in the scenario of the above-mentioned method 1, there is a scenario, such as method 4, in which a candidate partition information list and / or a prediction of the partition information is determined or obtained according to the partition information, pixels and coding parameters of the selected block; For example, at least one partitioning information that may be used to partition the current block can be determined based on the block partitioning method, pixels and encoding and decoding parameters of the selected block, and at least one partitioning information for partitioning the current block can also be determined based on the block partitioning depth, pixels and encoding and decoding parameters of the selected block. Optionally, the partition information of the selected block may be screened according to pixels and coding parameters to determine at least one partition information. Optionally, a module for determining or obtaining a candidate partition information list and / or a prediction of partition information may be provided, and the block partitioning mode, pixels and encoding and decoding parameters of the selected block are input into the module, and at least one partition information is output. Optionally, a candidate partition information list may be constructed or updated based on the at least one partition information. Alternatively, a prediction value for predicting the partition information of the current block is determined based on the block partitioning mode, pixels and coding parameters of the selected block, and a prediction of the partition information is determined based on the prediction value, such as using the prediction value as the prediction of the partition information, or deforming the prediction value (such as difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation, etc.) to obtain a prediction of the partition information. Optionally, part or all of the candidate partition information list may be selected as a prediction value for determining or obtaining the partition information for predicting the current block. Optionally, the probability that each block partition information may be hit may be determined based on the block partition information, pixels and coding parameters of the selected block, and the prediction value for predicting the partition information of the current block may be determined based on the block partition information with the highest probability. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the partition information, pixels and encoding and decoding parameters of the selected block, it is possible to comprehensively consider the selected block to determine the candidate partition information list and / or the prediction of the partition information, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently divided, thereby reducing the signaling overhead of block division, and thereby improving the efficiency of video encoding and decoding. Mode 5: determining at least one type of partition information according to the frequency of the partition information of the block, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the at least one type of partition information; Optionally, on the encoding side, the block may be an encoded block (hereinafter referred to as an encoded block), and the frequency of the block division information may be the frequency of the division information of the encoded block. On the decoding side, the block may be a decoded block (hereinafter referred to as a decoded block), and the frequency of the block division information may be the frequency of the division information of the decoded block. The block may be a frame of image, or an image block obtained by dividing a frame of image. Optionally, the frequency of the partition information of the block may be the frequency of the partition information of a block that is relatively close to the current block. Optionally, the frequency of the partition information may be the number of times the partition information is applied in the block. Optionally, the partitioning information of at least one block can be determined, and the frequency of the partitioning information of at least one block can be determined, and selection can be made based on the frequency, such as selecting the partitioning information with a high frequency to construct or update a candidate partitioning information list, such as creating an empty table, mapping the partitioning information with a high frequency to the empty table to obtain a candidate partitioning information list, or determining the predicted value corresponding to the partitioning information with a high frequency, and using it as the prediction of the partitioning information. Optionally, at the encoding side, at least one type of partition information is determined according to the frequency of the partition information of the encoded block, and according to the at least one type of partition information, a candidate partition information list and / or a prediction of the partition information is determined or obtained. Optionally, at the decoding side, at least one partition information is determined according to the frequency of the partition information of the decoded block, and at least one partition information is determined or obtained according to the at least one partition information. To a list of candidate partition information and / or a prediction of partition information. Optionally, by determining at least one kind of partition information based on the frequency of the partition information of the block, determining or obtaining a list of candidate partition information and / or a prediction of the partition information based on at least one kind of partition information, it is possible to comprehensively consider the frequency of the partition information of the block to determine the list of candidate partition information and / or a prediction of the partition information, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently partitioned, thereby reducing the signaling overhead of the block partition, and thereby improving the efficiency of video encoding and decoding. Mode six, determining at least one partition information according to the partition information, pixels and coding parameters of the block, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Optionally, the block may be at least one of a neighbor block, a non-neighbor block, a selected block, a co-located block, a block in the same frame, a block in a different frame, and a block determined based on a preset rule. Optionally, in some special scenarios, the block may also be the current block. The block division information may include a block division method or a block division depth, or other relevant information for block division, such as a division order, a division handover, and a shape of the divided block. The encoding and decoding parameters include encoding parameters and / or decoding parameters, and may be a bit rate, QP, or other parameters for block encoding and / or decoding. The pixel may be a pixel of a decoded block, or a pixel of a non-neighbor block. For example, at least one partitioning information that may be used to partition the current block can be determined based on the block partitioning method, pixels and encoding and decoding parameters of the block, and at least one partitioning information for partitioning the current block can also be determined based on the block partitioning depth, pixels and encoding and decoding parameters of the block. Optionally, the partition information of the block may be screened according to pixels and coding parameters to determine at least one partition information. Optionally, a module for determining or obtaining a candidate partition information list and / or a prediction of the partition information may be provided, and the block partitioning mode, pixels and encoding and decoding parameters of the block are input into the module, and at least one partition information is output. Optionally, a candidate partition information list may be constructed or updated based on the at least one partition information. Alternatively, a prediction value for predicting the partition information of the current block is determined based on the block partitioning mode, pixels and coding parameters of the block, and a prediction of the partition information is determined based on the prediction value, such as using the prediction value as the prediction of the partition information, or deforming the prediction value (such as difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation, etc.) to obtain a prediction of the partition information. Optionally, the block may be an encoded block and / or a decoded block. On the encoding side, at least one type of partition information is determined based on the partition information, pixels, and encoding / decoding parameters of the encoded block, and a candidate partition information list and / or a prediction of the partition information is determined or obtained based on the at least one type of partition information. On the decoding side, at least one type of partition information is determined based on the partition information, pixels, and encoding / decoding parameters of the decoded block, and a candidate partition information list and / or a prediction of the partition information is determined or obtained based on the at least one type of partition information. The specific implementation process may refer to the above-mentioned recorded process. Optionally, by determining at least one partition information based on the block partition information, pixels and encoding and decoding parameters, and determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the at least one partition information, it is possible to comprehensively consider the block partition information to determine the candidate partition information list and / or a prediction of the partition information, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently divided, thereby reducing the signaling overhead of the block partition, and thereby improving the efficiency of video encoding and decoding. Method seven, calculating or sorting according to the block partition information, pixels and encoding and decoding parameters, determining at least one partition information after calculation or sorting, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Optionally, the price or cost or index of at least one of the partition information of the block may be calculated according to the pixels and the coding and decoding parameters. Optionally, cost is used as an example in the following description. For example, the cost of each type of partition information in the partition information of the block is calculated according to a calculation rule. The calculation rule can be any calculation rule set in advance by the user, and is not limited here. Optionally, a cost of at least one type of partition information is determined in the partition information of the block, and at least one type of partition information in the partition information of the block is screened according to the cost, such as selecting partition information with a smaller cost, or selecting partition information corresponding to a cost smaller than a preset cost threshold, etc. A candidate partition information list and / or a prediction of the partition information is determined or obtained according to the screened partition information. Optionally, all the filtered division information is sorted to obtain a list and used as a candidate division information list, or a part of the division information is selected from all the filtered division information and added to a blank list to determine or obtain a candidate division information list and / or a prediction of the division information. Optionally, prediction calculation of the partition information may be performed on all the filtered partition information to obtain a prediction of at least one partition information in the partition information of the block. Optionally, for sorting according to the block partition information, pixels and coding parameters, determining or obtaining the candidate partition information list and / or the prediction of the partition information, it may be that the partition information of the decoded block is determined according to the pixels and coding parameters of the block, and at least one of the partition information of the block is sorted according to a preset sequence order. Optionally, the preset sequence order may be an order set in advance by the user, or may be determined according to the number of times the division information is used, for example, division information with a greater number of uses is placed before division information with a lesser number of uses. Optionally, the pixels of the block, the encoding and decoding parameters, and the division information of the block may be calculated and determined according to a preset rule. Optionally, the preset rule may be a neural network, pattern matching, a mathematical model, a lookup table, etc. Optionally, the block may be a coded block and / or a decoded block. On the encoding side, calculation or sorting is performed based on the partition information, pixels, and coding and decoding parameters (such as coding parameters) of the coded block to determine or obtain a candidate partition information list and / or a prediction of the partition information. On the decoding side, calculation or sorting may be performed based on the partition information, pixels, and coding and decoding parameters (such as decoding parameters) of the decoded block to determine or obtain a candidate partition information list and / or a prediction of the partition information. The specific implementation process may refer to the above implementation process. Optionally, by calculating or sorting according to the block division information, pixels and encoding and decoding parameters, a candidate division information list and / or a prediction of the division information is determined or obtained, thereby achieving that the division information corresponding to the division information in the candidate division information list and / or the prediction of the division information is not randomly selected and set, but is based on predetermined rules, thereby facilitating the subsequent division of the current block, improving the hit rate of the division information, thereby reducing the signaling overhead of the block division, and thereby improving the efficiency of video encoding and decoding. Mode 1, calculating a cost value corresponding to at least one type of partition information according to the partition information of the block and / or the pixel and / or the encoding and decoding parameter, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the cost value; Optionally, the block division information, pixels, and encoding and decoding parameters may refer to the above-mentioned method 1, which will not be elaborated here. Optionally, the partition information of each block can be determined, and the cost value corresponding to at least one partition information can be calculated. For example, the partition information of the neighboring block can be determined, the partition information of the non-neighboring block can be determined, the partition information of the selected block can be determined, and at least one partition information can be selected from the determined block partition information to calculate the cost value. Calculate. Optionally, when determining the partition information of the block, the partition information of the block may be screened according to the pixel and / or codec parameter to determine at least one partition information, such as screening the partition information of the non-neighboring block to obtain at least one partition information. Optionally, the probability of being hit in the partition information of each block may also be determined according to the pixel and / or codec parameter, and at least one partition information with a larger probability is selected as the determined partition information, and then the cost value corresponding to the at least one partition information is calculated. Optionally, when calculating the cost value, it can be calculated according to different cost functions, such as SAD (Sum of Absolute Differences), SATD (Sum of Transformed Absolute Differences), MRSAD (Mean Removal SAD), MRSATD (Mean-Removed Sum of Absolute Transformed Differences), etc. Optionally, after calculating the cost value corresponding to at least one type of segmentation information, a candidate segmentation information list may be constructed or updated based on the cost value corresponding to at least one type of segmentation information. For example, segmentation information corresponding to a cost value less than a preset cost threshold is selected, and it is updated to a candidate segmentation information list set in advance to obtain an updated candidate segmentation information list. For example, segmentation information corresponding to a cost value greater than a preset cost threshold is selected, and the candidate segmentation information list is obtained by aggregating in a table form. Optionally, after calculating the cost value corresponding to at least one type of partition information, the partition information may be predicted based on the cost value, for example, the partition information with the smallest cost value may be selected as the predicted partition information, so as to partition the current block based on the predicted partition information. Optionally, by calculating the cost value corresponding to at least one type of partition information based on the block partition information, and / or pixels and / or encoding and decoding parameters, a candidate partition information list and / or a prediction of the partition information can be determined or obtained, thereby quickly determining or obtaining the candidate partition information list and / or a prediction of the partition information, and then quickly dividing the block, reducing the signaling overhead of block partitioning, and thereby improving encoding and decoding efficiency. Mode 2, calculating a first generation value and a second generation value corresponding to at least one type of partition information according to the partition information of the block and / or the pixel and / or the encoding and decoding parameter, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the first generation value and the second generation value; Optionally, the block division information, pixels, and encoding and decoding parameters may refer to the above-mentioned method 1, which will not be elaborated here. Optionally, the partition information of each block may be determined, and the cost value corresponding to at least one partition information may be calculated. For example, the partition information of the neighboring block may be determined, the partition information of the non-neighboring block may be determined, the partition information of the selected block may be determined, etc. At least one partition information may be selected from the determined partition information of the block to calculate the cost value. Optionally, when determining the partition information of the block, the partition information of the block may be screened according to the pixel and / or codec parameter to determine at least one partition information, such as screening the partition information of the non-neighboring block to obtain at least one partition information. Optionally, the probability of being hit in the partition information of each block may also be determined according to the pixel and / or codec parameter, and at least one partition information with a larger probability is selected as the determined partition information, and then the cost value corresponding to the at least one partition information is calculated. Optionally, when calculating the cost value, for each type of partition information, two cost values, namely, the first generation value and the second generation value, can be calculated using two different cost functions. For example, the first generation value is calculated using SAD, and the second generation value is calculated using SATD. Optionally, for each type of partition information, after the first generation value and the second generation value are calculated, the total cost value can be determined based on the first generation value and the second generation value. For example, the maximum or minimum cost value between the first generation value and the second generation value is selected as the total cost value. For example, the mean between the first generation value and the second generation value is taken as the total cost value. Optionally, a candidate partition information list and / or a prediction of the partition information may be determined or obtained based on a total cost value of at least one type of partition information. Optionally, for example, the partition information corresponding to the total cost value less than the preset cost threshold is selected, and it is updated to the candidate partition information list set in advance to obtain an updated candidate partition information list. For example, the partition information corresponding to the total cost value greater than the preset cost threshold is selected, and the candidate partition information list is obtained by aggregating in the form of a table. Optionally, for example, the partition information with the smallest total cost value is selected as the predicted partition information, so as to partition the current block according to the predicted partition information. Optionally, by calculating the first generation value and the second generation value corresponding to at least one type of division information according to the division information of the block, and / or the pixels and / or the encoding and decoding parameters, the candidate division information list and / or the prediction of the division information can be determined or obtained, thereby quickly determining or obtaining the candidate division information list and / or the prediction of the division information, and then quickly dividing the block, reducing the signaling overhead of block division, and thereby improving the encoding and decoding efficiency. Mode 3, calculating a SAD value and / or a SATD value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to at least one type of partition information determined by the SAD value and / or the SATD value corresponding to the at least one type of partition information; Optionally, the block division information, pixels, and encoding and decoding parameters may refer to the above-mentioned method 1, which will not be elaborated here. Optionally, the partition information of each block may be determined, and the cost value corresponding to at least one partition information may be calculated. For example, the partition information of the neighboring block may be determined, the partition information of the non-neighboring block may be determined, the partition information of the selected block may be determined, etc. At least one partition information may be selected from the determined partition information of the block to calculate the cost value. Optionally, when determining the partition information of the block, the partition information of the block may be screened according to the pixel and / or codec parameter to determine at least one partition information, such as screening the partition information of the non-neighboring block to obtain at least one partition information. Optionally, the probability of being hit in the partition information of each block may also be determined according to the pixel and / or codec parameter, and at least one partition information with a larger probability is selected as the determined partition information, and then the cost value corresponding to the at least one partition information is calculated. Optionally, when calculating the cost value, a SAD value corresponding to at least one type of division information may be calculated in a SAD manner, and a SATD value corresponding to at least one type of division information may be calculated in a SATD manner. Optionally, the segmentation information with the smallest SAD value or SATD value can be determined from the SAD value and / or SATD value corresponding to at least one segmentation information as the determined at least one segmentation information. Optionally, for each segmentation information, the maximum or minimum value of the SAD value and SATD value corresponding to at least one segmentation information can be determined, and at least one segmentation information can be selected as the determined at least one segmentation information based on the maximum or minimum value corresponding to at least one segmentation information. For example, the segmentation information less than a certain threshold is selected as the determined segmentation information. Optionally, a candidate partition information list and / or a prediction of the partition information may be determined or obtained based on at least one partition information determined or obtained. For example, the determined or obtained at least one partition information is aggregated to obtain a candidate partition information list, or the determined or obtained at least one partition information is updated to a preset partition information list to obtain a candidate partition information list. For example, a random selection is made from the determined or obtained at least one partition information as a prediction of the partition information, and the current block is partitioned according to the predicted partition information. Or at least one is selected from the determined or obtained at least one partition information based on a certain rule as a partition information. Prediction of information in order to partition the current block. Optionally, by calculating the SAD value and / or SATD value corresponding to at least one type of division information based on the block division information, and / or pixels and / or encoding and decoding parameters, and determining at least one type of division information based on the SAD value and / or SATD value corresponding to at least one type of division information, a candidate division information list and / or a prediction of the division information is determined or obtained, thereby quickly determining or obtaining the candidate division information list and / or a prediction of the division information, and then quickly dividing the block, reducing the signaling overhead of block division, and thereby improving the encoding and decoding efficiency. Optionally, method 3 includes method eight. Mode eight, calculating the SAD value corresponding to each type of division information according to the pixel and the encoding and decoding parameter, determining at least one type of division information according to the SAD value, and determining or obtaining a candidate division information list and / or a prediction of the division information according to the at least one type of division information; Optionally, the pixel may be a pixel of a block. The block may be a decoding block or a coding block. SAD may be the sum of the absolute values ​​of the differences between the values ​​corresponding to each pixel, based on which the similarity between two image blocks is judged. Therefore, when calculating the SAD value corresponding to each division information, the pixel value comparison between the neighboring block or non-neighboring block using the division information before and after prediction may be calculated based on the pixel and the encoding and decoding parameters to determine the SAD value corresponding to the division information. Optionally, when calculating the SAD of the current block using various partitioning information, SAD = Sum|Org-Pred| can be used for calculation, where Pred is the predicted block, Org is the original block, and Sum|| is the sum of the absolute values ​​of all values. For example, the absolute value of the difference between the pixel values ​​at the same position in the original block and the predicted block is first determined, and then the sum of the absolute values ​​corresponding to all positions of the original block and the predicted block is calculated. Optionally, at the decoding side, the SAD value of the left block and / or the upper neighboring pixel block of the current block under the partition information is used for approximate calculation to obtain the SAD value. Optionally, after calculating the SAD value corresponding to each division information, the division information can be selected based on the SAD value to determine at least one division information, such as selecting at least one division information corresponding to a SAD value less than a preset SAD threshold, adding it to the preset list, and obtaining a candidate division information list. Optionally, the segmentation information corresponding to the SAD value may be screened according to a preset rule (such as the SAD value is less than a certain value, or a certain number of segmentation information corresponding to the SAD value is randomly selected, etc.) Then, a prediction calculation of the segmentation information is performed on at least one segmentation information corresponding to the screened SAD value to obtain a prediction of the segmentation information. Optionally, the generation of the candidate partition information list based on SAD sorting can be performed according to the process described in Figure 8. Figure 8 only takes the candidate partition information list as a candidate partition method list for example. Other types of candidate partition information lists can be generated based on this process, such as a candidate partition depth list. Optionally, in FIG8 , the horizontal line n=3, the vertical line m=3, there are 6 division lines, the division mode encoding can be in a 6-bit mode, and there can be a maximum of 64 division modes. Optionally, as shown in FIG8 , the partitioning mode of the encoded block is obtained, and there are three partitioning modes for neighbor blocks: 101000, 010010, and 111000. There are five partitioning modes for other blocks (such as non-neighbor blocks or blocks in the same image): 010000, 000000, 000010, 101000, and 111111. Optionally, 000000 may be set as the default partitioning method. As shown in FIG8 , 7 candidate partitioning methods may be obtained for the current block. Optionally, for the seven candidate partitioning methods, the SAD (Sum of Absolute Differences) cost is calculated. Optionally, since the current block u at the decoding end does not exist, there are the following optional implementations: 1. Here, the calculation of the SAD of the current block u can be replaced by the calculation of the SAD of a neighboring block of the current block u. 2. For any block, when calculating SAD, replace it with the L-shaped template composed of the left and upper pixels of the block. The 7 SAD values ​​for the 7 partitioning methods are obtained as shown in Figure 8. That is: (000000) = 23043, (010000) = 132454, (101000) = 13232, (000010) = 433433, (010010) = 54545, (111000) = 75973, (111111) = 102366. The above 7 SAD values ​​are sorted from small to large, and the first 5 partitioning methods are taken to obtain a candidate partitioning method list of [101000, 000000, 010010, 111000, 111111], and the above candidate partitioning method list is output, including: 101000, 000000, 010010, 111000, 111111. Optionally, by determining or obtaining at least one partition information based on the SAD value corresponding to each partition information, and determining a candidate partition information list and / or a prediction of the partition information based on at least one partition information, the effectiveness of the determined candidate partition information list and / or the prediction of the partition information is improved, rather than randomly selecting the partition information, so as to improve the hit rate of the partition information when the current block is subsequently divided, thereby reducing the signaling overhead of the block division, and thereby improving the efficiency of video encoding and decoding. Mode nine: determining or obtaining a candidate partition information list and / or a prediction of the partition information of the second component of the current block according to the first component partition information of the neighboring block and / or the first component partition information of the non-neighboring block. Optionally, the first component may be the same as or different from the second component. Optionally, the first component may be any one of the YUV components, and the second component may be any one of the YUV components. Optionally, the first component may be any one of the RGB components, and the second component may be any one of the RGB components. Optionally, the first component division information may be division information (such as division depth, division method, size, etc.) for dividing the block under the first component. Optionally, when the first component and the second component are the same, the determined or obtained candidate partition information list may be a same-component candidate partition information list. When the first component and the second component are different, the determined or obtained candidate partition information list may be a cross-component candidate partition information list. Similarly, the prediction of the partition information may also include two categories, namely, the prediction of the same-component partition information and the prediction of the cross-component partition information. Optionally, the first component partitioning information of the neighboring blocks and / or non-neighboring blocks is added to a preset candidate partitioning information list to determine or obtain a candidate partitioning information list having the first component partitioning information, and use it as the candidate partitioning information list for the second component of the current block. Optionally, the second component partitioning information of the neighboring blocks and / or non-neighboring blocks is added to a preset candidate partitioning information list to determine or obtain a candidate partitioning information list having the second component partitioning information, and use it as the candidate partitioning information list for the second component of the current block. Optionally, the first component partition information of the neighbor block and the second component partition information of the non-neighbor block are added to a preset candidate partition information list, so as to determine the candidate partition information list of the second component of the current block. Optionally, the second component partition information of the neighbor block and the first component partition information of the non-neighbor block are added to a preset candidate partition information list, so as to determine the candidate partition information list of the second component of the current block. Optionally, the SAD value and / or probability value (ie, the probability of being hit) corresponding to the first component division information of the neighbor block and / or the non-neighbor block may be calculated. The SAD value and / or probability value (i.e., the probability of being hit) corresponding to the first component partition information of the block, and / or the SAD value and / or probability value (i.e., the probability of being hit) corresponding to the second component partition information of the neighboring block, and / or the SAD value and / or probability value (i.e., the probability of being hit) corresponding to the second component partition information of the non-neighboring block, and the various partition information (such as the first component partition information, the second component partition information, etc.) can be sorted according to the determined SAD value and / or probability value, and the prediction of the partition information of the second component of the current block is determined according to the sorting result. For example, the partition information with the largest probability value is determined according to the sorting result, and the prediction of the partition information of the second component of the current block is determined according to the partition information with the largest probability value. Optionally, part or all of the sorted partition information is selected as the prediction of the partition information of the second component of the current block according to a predetermined rule. Optionally, the predetermined rule can be set in advance by the user, such as random selection, or selecting the element with the smallest SAD value. Optionally, the element with the smallest SAD value or the largest probability in the sorted partition information can be selected as the prediction value and deformed, or part or all of the prediction values ​​selected in the sorted partition information are deformed, and the deformed prediction value is used as the prediction of the partition information of the second component of the current block. The deformation rule can be difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation (inverse algorithm at the encoding end), bit operation, etc. Optionally, a candidate partition information list and / or a prediction of the partition information of the second component of the current block can be determined or obtained based on a partition information list that adds at least one first component partition information of a neighboring block and / or first component partition information of a non-neighboring block. The determined first component partition information of at least one neighboring block and / or first component partition information of a non-neighboring block is sorted to determine or obtain a candidate partition information list and / or a prediction of the partition information. Optionally, a candidate partition information list and / or a prediction of the partition information of the second component of the current block is determined or obtained based on a cost of at least one first component partition information of a neighboring block and / or first component partition information of a non-neighboring block. Optionally, at least one of the first component partitioning information of a neighboring block and / or the first component partitioning information of a non-neighboring block, pixels and encoding and decoding parameters is input into a neural network to obtain an output result, and a candidate partitioning information list and / or a prediction of the partitioning information of the second component of the current block is determined or obtained based on the output result. Optionally, at least one of the first component partitioning information of a neighboring block and / or the first component partitioning information of a non-neighboring block, pixels, and encoding and decoding parameters is input into a query table to obtain a query result, and a candidate partitioning information list and / or a prediction of the partitioning information of the second component of the current block is determined or obtained based on the query result. Optionally, matching is performed based on first component partition information of at least one neighboring block and / or first component partition information of a non-neighboring block, and a candidate partition information list and / or a prediction of the partition information of the second component of the current block is determined or obtained based on the matching result. Optionally, at least one of the first component partitioning information of at least one neighboring block and / or the first component partitioning information of a non-neighboring block, pixels and encoding and decoding parameters is input into a mathematical model, and a candidate partitioning information list and / or a prediction of the partitioning information of the second component of the current block is determined or obtained based on an output result of the mathematical model. Optionally, based on the first component partition information of the neighboring block and / or the first component partition information of the non-neighboring block, a candidate partition information list and / or a prediction of the partition information of the current block is determined or obtained, thereby realizing the collection of cross-component partition information before the partition information is determined, improving the effectiveness of the determined candidate partition information list and / or the prediction of the partition information, facilitating the subsequent partitioning of the current block, improving the hit rate of the partition information, thereby reducing the signaling overhead of block partitioning, and improving the efficiency of video encoding and decoding. Optionally, for step S20, the current block is divided according to the candidate division information list and / or the prediction of the division information. Optionally, after determining or obtaining the candidate partition information list, all the partition information in the candidate partition information list may be screened to determine the target partition information, and then the current block may be partitioned according to the target partition information. Optionally, the number of target partition information may be one or more, and the current block may be partitioned at least once according to at least one target partition information. Optionally, after determining or obtaining the prediction of the partition information, the partition information (such as the partition depth, the partition method, etc.) corresponding to the prediction of the partition information is determined, and then the current block is partitioned according to the partition information corresponding to the prediction of the partition information. Optionally, the prediction of the partition information may correspond to multiple partition information or one partition information. The current block may be partitioned at least once according to the partition information corresponding to the prediction of the partition information. Optionally, the partition information hit in the candidate partition information list, ie, the target partition information, may be determined, and the partition information corresponding to the prediction of the partition information may be determined. The current block may be partitioned according to the target partition information and the partition information corresponding to the prediction of the partition information. Optionally, the blocks obtained by dividing the current block may be rectangular blocks or non-rectangular blocks. Optionally, steps S10 to S20 in this embodiment may be performed on the encoding side or on the decoding side. Optionally, at the encoding end (i.e., encoding side), for example, as shown in FIG9 , after determining that the current block is u, a block set B consisting of neighbor blocks of u and blocks selected according to a preset rule can be obtained through a block selection module. Optionally, the neighbor blocks may include blocks at the upper left, left, lower left, upper right, and above the current block (these blocks have all been encoded and decoded before the current block). Optionally, the blocks selected according to the preset rules may include but are not limited to: non-neighboring blocks that have completed encoding and decoding in the spatial domain, blocks in the time domain, and co-located blocks in the co-located image. The blocks in the time domain may be derived from frames different from the current frame or time, such as co-located blocks, neighboring blocks, and non-neighboring blocks of the current block in a reference frame or a collocated frame. The blocks in the time domain may be derived from neighboring frames of the frame where the current block is located, and the neighboring frames may be intra-frame coded frames, inter-frame coded frames, or intra-frame and inter-frame mixed coded frames. For example, if the frame where the current block is located is a P frame (unidirectional prediction frame) or a B frame (bidirectional prediction frame), and the GOP (Group of picture) number is n, the neighboring frame GOP number may be n-1, n-2, ..., n+1, n+2, etc., and may be an I frame (key frame, intra-frame coded frame), a P frame, or a B frame. For example, if the current block is offset from the co-located block in the collocated frame, the offset target block (ie, the offset co-located block) may be obtained according to the corresponding motion vector, and the target block may be used as the block in the time domain. Optionally, as shown in FIG9 , for the determined block set B, the partition information of these blocks can be obtained, such as the partition mode, partition depth, pixel, encoding and decoding parameters (such as quantization parameter QP), etc. Then, the "create / update partition information list" module creates an update list based on all known information (such as the first-level list, the second-level list, the partition information (mode / depth), pixel, encoding parameter), using preset calculation rules such as neural network, pattern matching, mathematical model, query table, etc., to obtain a new first-level list L1 and a new second-level list L2. Optionally, the new first-level list L1 and the new second-level list L2 may be candidate partition information lists. Optionally, the encoding side and the decoding side may create or update the candidate partition information list in the same manner. Optionally, when using the candidate partition information list, the new first-level list L1, the new second-level list L2 and the partition information p (p∈S) from other modules can be input into the retrieval module to obtain the first-level index and the second-level index. Finally, the entropy coding performs entropy coding on the first-level index and the second-level index to generate a bit stream b. Optionally, at the decoding end (i.e., the decoding side), as shown in FIG10 , the first-level list flag is obtained from the bitstream, and it is determined whether the first-level list is used. If it is determined to use the first-level list (yes), the first-level list is generated, and the first-level index is obtained from the bitstream, and the partition information of the current block is obtained according to the first-level list and the first-level index, and the partition information of the current block is returned. Optionally, if it is determined that the first-level list is not adopted (No), the second-level list flag is obtained from the code stream, and it is determined whether the second-level list is adopted. If it is determined that the second-level list is adopted (Yes), a second-level list is generated, and a secondary index is obtained from the code stream, and the partition information of the current block is obtained according to the generated second-level list and the secondary index, and the partition information of the current block is returned. And / or, if it is determined that the second-level list is not adopted (No), a non-list index is obtained from the code stream, and the partition information of the current block is obtained according to the non-list information set S-L1-L2 and the non-list index, and the partition information of the current block is returned. Optionally, the non-list partitioning information set includes all other partitioning information except the first-level list and the second-level list. Optionally, at the encoding end (i.e., encoding side), for example, as shown in FIG11, after determining that the current block is u, a block set B consisting of neighbor blocks of u and blocks selected according to a preset rule can be obtained through a block selection module. Optionally, the neighbor blocks may include blocks at the upper left, left, lower left, upper right, and above the current block (these blocks have all been encoded and decoded before the current block). Optionally, the blocks selected according to the preset rules may include but are not limited to: non-neighboring blocks that have completed encoding and decoding in the spatial domain, blocks in the time domain, and co-located blocks in the co-located image. The blocks in the time domain may be derived from frames different from the current frame or time, such as co-located blocks, neighboring blocks, and non-neighboring blocks of the current block in a reference frame or a collocated frame. The blocks in the time domain may be derived from neighboring frames of the frame where the current block is located, and the neighboring frames may be intra-frame coded frames, inter-frame coded frames, or intra-frame and inter-frame mixed coded frames. For example, if the frame where the current block is located is a P frame (unidirectional prediction frame) or a B frame (bidirectional prediction frame), and the GOP (Group of picture) number is n, the neighboring frame GOP number may be n-1, n-2, ..., n+1, n+2, etc., and may be an I frame (key frame, intra-frame coded frame), a P frame, or a B frame. For example, if the current block is offset from the co-located block in the collocated frame, the offset target block (ie, the offset co-located block) may be obtained according to the corresponding motion vector, and the target block may be used as the block in the time domain. Optionally, as shown in FIG11 , for a determined block set B, the partition information of these blocks can be obtained, such as the partition mode, partition depth, pixel, encoding and decoding parameters (such as quantization parameter QP), etc. Then, the "prediction block partition information" module obtains the block partition information (prediction value) p' based on all known information (such as partition information (mode / depth), pixel, encoding parameter (such as quantization parameter QP), etc.), using preset calculation rules such as neural network, pattern matching, mathematical model, query table, etc., and the prediction process is completed. Optionally, the encoding side and the decoding side can be performed in the same manner. Optionally, the block partition information (prediction value) p' and the partition information p (p∈S) from other modules are input into the "preprocessing" module. The preprocessing module uses methods such as difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation, bit operation, etc. to obtain the "partition information to be encoded". Optionally, if difference calculation is used, the partition information to be encoded can be pp'. Finally, entropy coding performs entropy coding on the "partition information to be encoded" to generate a bit stream b. Optionally, at the decoding end (ie, decoding side), as shown in FIG12 , after determining that the current block is u, a block set B consisting of neighboring blocks of u and blocks selected according to preset rules can be obtained through a block selection module. Optionally, the neighboring blocks may include blocks at the upper left, left, lower left, upper right, and above the current block (all of these blocks have been encoded and decoded before the current block). Optionally, the blocks selected according to the preset rules may include but are not limited to: non-neighboring blocks that have completed encoding and decoding in the spatial domain, blocks in the time domain, and co-located blocks in the co-located image. The blocks in the time domain may be derived from frames different from the current frame or time, such as co-located blocks, neighboring blocks, and non-neighboring blocks of the current block in a reference frame or a collocated frame. The blocks in the time domain may be derived from neighboring frames of the frame where the current block is located, and the neighboring frames may be intra-frame coded frames, inter-frame coded frames, or intra-frame and inter-frame mixed coded frames. For example, if the frame where the current block is located is a P frame (unidirectional prediction frame) or a B frame (bidirectional prediction frame), and the GOP (Group of picture) number is n, the neighboring frame GOP number may be n-1, n-2, ..., n+1, n+2, etc., and may be an I frame (key frame, intra-frame coded frame), a P frame, or a B frame. For example, if the current block is offset from the co-located block in the collocated frame, the offset target block (ie, the offset co-located block) may be obtained according to the corresponding motion vector, and the target block may be used as the block in the time domain. Optionally, as shown in FIG12 , for a determined block set B, the partition information of these blocks may be obtained, such as the partition mode, partition depth, pixel, encoding and decoding parameters (such as quantization parameter QP), etc. Then, the "prediction block partition information" module obtains the block partition information (prediction value) p′ based on all known information (such as partition information (mode / depth), pixel, encoding parameter (such as quantization parameter QP), etc.) by using preset calculation rules such as neural network, pattern matching, mathematical model, query table, etc., and the prediction process is now completed. Optionally, as shown in FIG12 , during the decoding process of the block partition information, the entropy decoder parses the bit stream b to obtain the “partition information to be restored”. The post-processing module obtains the partition information p based on the input block partition information (prediction value) p′ and the partition information to be restored, and uses difference calculation, absolute value calculation, addition and subtraction of offset, logarithmic calculation (inverse algorithm at the encoding end), bit operation, etc., and outputs it to other modules. Optionally, if difference calculation is adopted, the partition information p may be the partition information to be restored+p′. Optionally, u in Figures 9 to 12 can be the current codec unit / block, corresponding to the CU in H.266 / VVC. B can be a block set consisting of neighboring blocks of the current codec block and blocks selected according to preset rules. S can be a set of all allowed / possible block partition information, that is, given a codec unit u, all possible ways of being divided. p∈B, the partition information of u finally adopted by the codec end, is the partition mode / partition depth. Optionally, p may be determined by the codec according to a specific selection algorithm from all possible partitioning modes and / or partitioning depths. Optionally, p′, p′∈B, the partition information of u predicted by the codec is the partition mode / partition depth. L can be a list of candidate partition information, that is, a list of the most likely partition information generated for a given coding unit u. The length or number of elements of L can be fixed length or variable length. For example, the fixed length value is 5, 6. b can be the generated coded bitstream. In this embodiment, by determining a candidate partition information list and / or a prediction of the partition information based on the partition information, the current block is partitioned based on the candidate partition information list and / or the prediction of the partition information. Through the above technical solution, it is possible to avoid the need to use separate partition signaling representations for all partitioning methods during the partitioning process, which leads to a large signaling overhead. By first determining or obtaining a candidate partition information list and / or a prediction of the partition information based on the partition information, the partition information that may be used by the current block can be reasonably planned into the candidate partition information list, or the prediction of the partition information corresponding to the partition information that may be used by the current block can be determined. Then, when the current block is partitioned based on the candidate partition information list and / or the prediction of the partition information, the hit rate of the partition information is improved, the signaling representation of the partition information is reduced, and the signaling overhead of the block partitioning is reduced, thereby reducing the partitioning cost of the current block partitioning and improving the efficiency of video encoding and decoding. Second embodiment Based on the above first embodiment, a second embodiment is proposed. In this embodiment, determining or obtaining a candidate partition information list and / or a prediction of the partition information according to at least one partition information includes at least one of the following: Method 10, determining or obtaining a candidate partition information list and / or a prediction of the partition information according to a partition information list to which at least one partition information is added; Optionally, at least one type of division information is added to the division information list, and based on the division information list to which the at least one type of division information is added, a candidate division information list and / or a prediction of the division information is determined or obtained. Optionally, a segmentation information list having at least one segmentation information may be used as a candidate segmentation information list, and a prediction value corresponding to at least one segmentation information in the segmentation information list may be determined and used as a prediction of the segmentation information. Alternatively, an empty table may be created as a division information list, or a list having partial division information may be created as a division information list. Optionally, the partition information list may be a list, a table, an array, etc., or may be data in a preset format, which is not limited here. Optionally, if it is necessary to construct at least one level of candidate partition information lists, at least one partition information list may be constructed, and at least one partition information may be added to each partition information list to obtain a candidate partition information list. Optionally, part or all of the partition information may be selected from at least one level of candidate partition information list, and a corresponding prediction value may be determined and calculated to be used as the prediction of the partition information. Optionally, the candidate partition information list may be updated, for example, by adding at least one partition information to the candidate partition information list to update the candidate partition information list. Optionally, when updating the candidate partition information list, at least one partition information may be inserted into a specific position in the candidate partition information list, and operations such as replacement, deletion and modification may be performed on the existing partition information in the candidate partition information list. Optionally, by adding at least one partition information list to the partition information list, a candidate partition information list and / or a prediction of the partition information is determined or obtained, thereby ensuring the validity of the determined candidate partition information list and / or the prediction of the partition information. Method eleven, sorting the determined at least one type of division information, and determining or obtaining a candidate division information list and / or a prediction of the division information according to the sorted at least one type of division information; Optionally, the determined at least one type of division information is sorted, and candidate division information and / or a prediction of the division information is determined or obtained according to the sorted at least one type of division information. Optionally, the determined at least one type of division information may be sorted according to a preset sequence order to obtain a division sequence corresponding to each type of division information. Optionally, the partition sequence may be added to the list to obtain a candidate partition information list. Optionally, part or all of the partition sequence may be selected and added to the list to obtain a candidate partition information list. Optionally, part or all of the partitioning sequences may be selected from the determined partitioning sequences, and prediction values ​​corresponding to the part or all of the partitioning sequences may be calculated and used as the prediction of the partitioning information. Optionally, the preset sequence order may be an order set in advance by a user. It may be determined based on the number of times the neighbor block or non-neighbor block uses the partition information (e.g., the higher the number of times used, the higher the order). It may also be set based on a preset rule, such as random selection. Optionally, the determined at least one type of division information is sorted, and part or all of the division information is selected according to the sorting result to perform prediction value calculation, so as to obtain a prediction value of at least one type of division information and use it as the prediction of the division information. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on at least one sorted partition information, it is possible to improve the hit rate of the determined partition information when subsequently determining the partition information of the current block based on the candidate partition information list and / or the prediction of the partition information. Mode 12, determining or obtaining a candidate partition information list and / or a prediction of the partition information according to a cost of at least one partition information; Optionally, the cost of at least one type of partitioning information may be calculated according to a calculation rule, and the cost may include parameters such as cost or index. Optionally, the calculation rule may be any calculation rule set in advance by the user, which is not limited here. Optionally, after determining the cost of at least one type of segmentation information, the at least one type of segmentation information may be screened according to the cost, such as selecting segmentation information with a smaller cost, or selecting segmentation information corresponding to a cost less than a preset cost threshold, etc. A list of candidate segmentation information and / or a prediction of the segmentation information may be determined or obtained based on the screened segmentation information. For example, a corresponding prediction value may be calculated for the screened segmentation information, and used as the prediction of the segmentation information. For example, the screened segmentation information may be added to a preset list to determine or obtain a list of candidate segmentation information. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information according to a cost of at least one type of partition information, the validity of the candidate partition information list and / or the prediction of the partition information can be ensured. Method 13, inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a neural network to obtain an output result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the output result; Optionally, at least one partition information may be the processed partition information as in the first embodiment described above, or may be the original partition information, such as the partition information of the neighbor block, the partition information of the non-neighbor block, the default partition information, the partition information of the selected block, etc. Optionally, for example, if the partition information of the neighbor block is 10. If at least one partition information is determined to be 10 according to the first method, 10 and pixels, as well as encoding and decoding parameters, may be directly input into a neural network, or a query table, or a mathematical model to output a candidate partition information list and / or a prediction of the partition information. Optionally, if at least one partition information is determined to be 10 according to the first method, as well as the similar partition information 9 and 11, 9, 10, 11 and pixels, as well as encoding and decoding parameters, may be directly input into a neural network, or a query table, or a mathematical model to output a candidate partition information list and / or a prediction of the partition information. Optionally, after determining at least one type of division information, at least one type of division information and at least one of the pixels and encoding and decoding parameters (including encoding parameters and / or decoding parameters) of the block are input into the neural network to obtain an output result, and the corresponding division information is determined based on the output result, and then a list of candidate division information is constructed, or a prediction of the corresponding division information is calculated. Optionally, the neural network can be a nonlinear algorithm or module, such as matrix weighted intra prediction technology (Matrix Weighted Intra Prediction, MIP), and the target neural network can include at least one of the following neural networks, such as: Convolutional Neural Network (CNN), Residual neural network (ResNet), Long Short-Term Memory Artificial Neural Network (LSTM), Recurrent Neural Network (RNN), three-dimensional convolutional neural network (3D-CNN), fully connected neural network (FCNN), etc. Optionally, the candidate partition information list generation based on the neural network can be performed according to the process described in FIG13. The list is an example of a candidate partitioning method list. Other types of candidate partitioning information lists can be generated based on this process, such as a candidate partitioning depth list. Optionally, in FIG13 , pixels may be obtained from a coded neighbor block. Optionally, assuming there are 15 division methods in total, the division method index numbers may be 1-15. Optionally, for the current block u block as shown in FIG13 , a total of 12 blocks of pixels can be obtained as an input of the neural network. Optionally, the pixels of these 12 blocks are integrated and stored in a regular matrix to form a data form recognizable by a convolutional neural network. Optionally, for non-existent pixels (matrix elements), that is, the blocks where they are located have not been encoded or decoded, a Padding operation (such as a zero-filling operation) is performed to obtain a neighbor pixel matrix as shown in FIG13 . Optionally, the neighbor pixel matrix and the encoding parameters (such as QP) can be input into the neural network together. Optionally, the number of layers in the neural network can be set to 12 layers, that is, 6 CNN layers (convolution kernel size is 1x1 or 3x3, output channels are 32 or 64 or 128), 3 pooling layers (Pooling), 3 fully connected layers (Full Connected Layers, FC), and the final output is 15 unnormalized probabilities p1-p15 (that is, representing the probabilities of using 15 candidate partitioning methods). Sort these 15 probabilities p1-p15 from large to small, take out the top 5 probabilities, and obtain the candidate partitioning list [101000, 000000, 010010, 111000, 111111] as shown in Figure 13, and output the above candidate partitioning list, including: 101000, 000000, 010010, 111000, 111111. Optionally, when performing neural network-based partition depth prediction, as shown in Figure 14, pixels are obtained from encoded and decoded neighbor blocks (such as neighbor blocks of encoded blocks and / or neighbor blocks of decoded blocks). Assuming that there are 7 partition depths (including non-division method 0), mode index numbers 0-7, then for the current block u block in Figure 14, a total of 12 blocks of pixels are obtained as an input to the neural network. Optionally, the pixels of these 12 blocks are integrated and stored in a regular matrix to form a data form recognizable by a convolutional neural network. Optionally, for non-existent pixels (matrix elements), that is, the blocks where they are located have not been encoded or decoded, a Padding operation (such as a zero-filling operation) is performed to obtain a neighbor pixel matrix as shown in FIG14 . Optionally, the neighbor pixel matrix and encoding parameters (such as QP) can be input into the neural network together. Optionally, the number of layers in the neural network can be set to 12 layers, that is, 6 CNN layers (convolution kernel size is 1x1 or 3x3, output channels are 32 or 64 or 128), 3 pooling layers (Pooling), 3 fully connected layers (Full Connected Layers, FC), and the final output is 7 unnormalized probabilities d0-d6 (that is, representing the probabilities of using 7 candidate partition depths). Sort these 7 probabilities d0-d6 from large to small, take out the depth value corresponding to the largest probability, and obtain the partition depth dx (prediction value) shown in Figure 14. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on a neural network, the validity of the obtained candidate partition information list and / or the prediction of the partition information can be ensured. Method 14: input at least one of the at least one partition information, pixel and encoding / decoding parameter into a query table for query, obtain a query result, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the query result; Optionally, the query table may be a table, a list, an array, etc. pre-stored in the system. Optionally, at least one type of division information can be preprocessed, such as sorting, deleting, etc., and then the processed division information can be input into a query table, and the processed division information can be matched with each division information in the query table to obtain matching division information, and a candidate division information list can be determined or obtained based on the matching division information, such as adding the matching division information to the list to obtain a candidate division information list. Optionally, a prediction value corresponding to the matched segmentation information may be calculated and used as the prediction of the segmentation information. Optionally, at least one of the at least one division information, pixel and coding parameter (including coding parameter and / or decoding parameter) can be input into a query table to determine the division information in the query table that matches at least one of the at least one division information, pixel and coding parameter (including coding parameter and / or decoding parameter), and determine or obtain a candidate division information list based on the matching division information, such as adding the matching division information to the list to obtain a candidate division information list. Optionally, a prediction value corresponding to the matched segmentation information may be calculated and used as the prediction of the segmentation information. Optionally, the candidate partition information list and / or the prediction of the partition information is determined or obtained by querying the query table based on the query result, thereby ensuring the validity of the obtained candidate partition information list and / or the prediction of the partition information. Mode 15, matching according to at least one type of segmentation information, and determining or obtaining a candidate segmentation information list and / or a prediction of the segmentation information according to the matched at least one type of segmentation information; Optionally, a partition matching rule can be determined, and at least one partition information can be matched with the partition matching rule to determine the matching partition information, and a candidate partition information list can be determined or obtained based on the matching partition information, such as adding the matching partition information to the list to obtain a candidate partition information list. Optionally, the prediction value corresponding to the matched partition information may be calculated and used as the prediction of the partition information. Optionally, the partition matching rule may be a matching rule set in advance by the user. For example, the sequence index corresponding to each partition information can be determined, such as 1, 2, 3, 4, etc. If the partition matching rule includes [1, xxx, 4], xxx represents the sequence index corresponding to any partition information. If the sequence index is determined to be [1, 2, 3, 4] according to at least one partition information, it can be determined that at least one partition information matches the partition matching rule, and then the matching partition information is obtained. If the partition matching rule includes [*, 10, *, 40, *], * represents the sequence index corresponding to any partition information. If at least one partition information includes a sequence index of

[0010] If the partition information is matched, the partition information with the sequence index

[0010] can be determined as the matching partition information. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on at least one matching partition information, the validity of the obtained candidate partition information list and / or the prediction of the partition information can be ensured. Method 16: input at least one of the at least one partition information, pixel and encoding and decoding parameter into a mathematical model, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to an output result of the mathematical model. Optionally, a mathematical model may be set in advance, and at least one of the at least one partition information, pixels and encoding and decoding parameters may be input into the mathematical model set in advance to perform model training. Optionally, in the mathematical model, a cost value can be calculated for each partition information based on data, model parameters, and transformation rules, and the cost value can be used as an output result. The cost value of at least one partition information can be determined based on the output result, and the partition information can be sorted according to the size of the cost value, such as the partition information with the cost value can be sorted. The preface is in front. Optionally, part or all of the sorted division information is selected and added to a list to determine or obtain a candidate division information list. Optionally, part or all of the sorted division information is selected to calculate corresponding prediction values, and the corresponding prediction values ​​are used as the predictions of the division information. Optionally, the partition information with a higher ranking will be represented by using fewer bits, thereby improving the encoding efficiency or decoding efficiency. Optionally, by determining or obtaining a candidate partition information list and / or a prediction of the partition information based on an output result of a mathematical model, the validity of the obtained candidate partition information list and / or the prediction of the partition information can be ensured. Third embodiment Based on any of the above embodiments, a third embodiment is proposed. In this embodiment, the processing method further includes at least one of the following: The partition information includes a block partition mode and / or a block partition depth; The candidate partition information list includes at least one of the following: A list of first-level candidate partitioning methods; A list of second-level candidate partitioning methods; First level candidate partition depth list; Second level candidate partition depth list. Optionally, the partition information may include a block partition mode, and / or a block partition depth, and / or a partition signaling. Optionally, the division information may also include a division method, a division depth, etc. that can be directly or indirectly derived. Optionally, the partitioning information may include the size / dimensions of the blocks. Optionally, the block partitioning mode may be a partitioning mode of the block. The block partitioning depth may be a partitioning depth of the block. Optionally, the block may be a current block, a neighbor block, a block determined based on a preset rule, etc. The partition depth may be used to limit the number of partitioning methods, or to determine whether to terminate the partitioning. For example, when the partition depth is large, some partitioning methods may be excluded to avoid the phenomenon that too detailed partitioning may reduce performance. Optionally, the partition depth may be determined first, and then the candidate partitioning method list may be optimized according to the determined partition depth. For example, the partitioning method may be determined according to the partition depth, and then the candidate partitioning method list may be determined according to the partitioning method. Optionally, the partition depth may be determined according to a partitioning method, for example, a certain partitioning method corresponds to a fixed partition depth. Optionally, the candidate partition information list may include a candidate partition method list and / or a candidate partition depth list. Optionally, the candidate partitioning method list may be a multi-level list, that is, there are multiple candidate partitioning method lists, such as a first-level candidate partitioning method list and a second-level candidate partitioning method list. Optionally, the candidate partition depth list may be a multi-level list, that is, there are multiple candidate partition depth lists, such as a first-level candidate partition depth list and a second-level candidate partition depth list. Optionally, the candidate partition information list may be a cross-component candidate partition information list or a same-component candidate partition information list. Optionally, the first-level candidate partitioning method list, the second-level candidate partitioning method list, the first-level candidate partitioning depth list and / or the second-level candidate partitioning depth list can be a list, a table, an array, or data in a preset format, which is not limited here. Optionally, the partitioning methods in the first-level candidate partitioning method list may be different from the partitioning methods in the second-level candidate partitioning method list. The partitioning depths in the first-level candidate partitioning depth list may be different from the partitioning depths in the second-level candidate partitioning depth list. Optionally, determining or obtaining a candidate partition information list according to at least one partition information includes at least one of the following: Method 17: creating or updating a first-level candidate partitioning method list according to at least one type of partitioning information, and determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning method list; Optionally, when the division information includes division methods, a list can be constructed, and at least one division information can be added to the list to obtain a list of candidate division methods, and used as a first-level candidate division method list, or at least one division method with the closest distance can be selected from at least one division information and added to the list to obtain a first-level candidate division method list. Optionally, a partitioning method included in the first-level candidate partitioning method list is determined and used as the first partitioning method, and other partitioning methods other than the first partitioning method are determined based on all the determined partitioning information, and used as the second partitioning method. At least one partitioning method is determined in the second partitioning method, and a new list is recreated, and at least one partitioning method determined in the second partitioning method is added to the new list to determine or obtain the second-level candidate partitioning method list. Optionally, if the candidate partitioning method list includes not only the first-level candidate partitioning method list and the second-level candidate partitioning method list, but also includes multiple candidate partitioning method lists of other levels, such as the third-level candidate partitioning method list and the fourth-level candidate partitioning method list, the candidate partitioning method lists of other levels can be created in a manner similar to the creation of the second-level candidate partitioning method list. Optionally, after determining at least one division method, determine the created first-level candidate division method list, and determine whether the first-level candidate division method list needs to be updated. If updating is required, the first-level candidate method list is updated according to the determined at least one division method, such as adding at least one division method to the first-level candidate division method list. Optionally, after updating the first-level candidate partitioning method list, it can be detected whether the second-level candidate partitioning method list needs to be updated. If updating is required, the second-level candidate partitioning method list can be updated based on other candidate partitioning methods except the division methods in the updated first-level candidate partitioning method list. Optionally, when the division information includes division depth, the division method corresponding to the division depth can be determined first, and then a first-level candidate division method list is created or updated based on the division method, and a second-level candidate division method list is determined or obtained based on the first-level candidate division method list. Optionally, when the division information includes division signaling, block size / dimension and other information, the corresponding division method can be determined based on the division information, and then a first-level candidate division method list can be created or updated based on the division method, and a second-level candidate division method list can be determined or obtained based on the first-level candidate division method list. Mode 18: creating or updating a first-level candidate partition depth list according to at least one partition information, and based on the first-level candidate partition depth list, Determine or obtain a second level candidate partition depth list; Optionally, when the division information includes division depth, a list can be constructed, and at least one division information can be added to the list to obtain a candidate division depth list, and used as a first-level candidate division depth list, or at least one division depth with the closest distance can be selected from at least one division information and added to the list to obtain a first-level candidate division depth list. Optionally, a partition depth included in the first-level candidate partition depth list is determined and used as the first partition depth, and other partition depths other than the first partition depth are determined based on all the determined partition information and used as the second partition depth. At least one partition depth is determined in the second partition depth, and a new list is recreated, and at least one partition depth determined in the second partition depth is added to the new list to determine or obtain the second-level candidate partition depth list. Optionally, if the candidate partition depth list includes not only the first-level candidate partition depth list and the second-level candidate partition depth list, but also includes multiple candidate partition depth lists of other levels, such as the third-level candidate partition depth list and the fourth-level candidate partition depth list, the candidate partition depth lists of other levels can be created in a manner similar to that of creating the second-level candidate partition depth list. Optionally, after determining at least one division depth, determine the created first-level candidate division depth list, and determine whether the first-level candidate division depth list needs to be updated. If an update is required, the first-level candidate list is updated based on the determined at least one division depth, such as adding at least one division depth to the first-level candidate division depth list. Optionally, after updating the first-level candidate partition depth list, it can be detected whether the second-level candidate partition depth list needs to be updated. If updating is required, the second-level candidate partition depth list can be updated based on other candidate partition depths except the partition depths in the updated first-level candidate partition depth list. Optionally, when the division information includes a division method, the division depth corresponding to the division method can be determined first, and then a first-level candidate division depth list is created or updated based on the division depth, and a second-level candidate division depth list is determined or obtained based on the first-level candidate division depth list. Optionally, the division information includes division signaling, block size / dimension and other information, and the corresponding division depth can be determined based on the division information, and then the first-level candidate division depth list is created or updated based on the division depth, and the second-level candidate division depth list is determined or obtained based on the first-level candidate division depth list. Mode 19: creating or updating a first-level candidate partitioning method list according to at least one partitioning information, determining or obtaining a first-level candidate partitioning depth list according to the first-level candidate partitioning method list, determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning depth list, and determining or obtaining a second-level candidate partitioning depth list according to the second-level candidate partitioning method list; Optionally, when the division information includes a division method, a list may be constructed, and at least one division information may be added to the list to obtain a candidate division method list, and the list may be used as a first-level candidate division method list, or at least one division method with the closest distance may be selected from at least one division information and added to the list to obtain a first-level candidate division method list. When the division information includes other information other than the division method, such as the division depth, a division method corresponding to the other information may be determined (the corresponding relationship between the division method and the other information may be set in advance). The determined at least one division method may be added to the list to obtain a candidate division method list. Optionally, the division methods in the first-level candidate division method list may be updated (including but not limited to operations such as replacement, deletion, and addition) according to the division information. Optionally, after the first-level candidate partitioning method list is determined, the first-level candidate partitioning depth list may be created or updated according to all the partitioning methods in the first-level candidate partitioning method list. Optionally, the division depths corresponding to all division methods in the first-level candidate division method list may be determined. Optionally, the division depth corresponding to each type of division method may be set in advance, and the division depths corresponding to all division methods in the first-level candidate division method list are added to a preset list to generate a first-level candidate division depth list. Optionally, all the division depths in the first-level candidate division depth list may be updated (eg, deleted, replaced, added, modified, etc.) according to the division depths corresponding to all the division methods in the first-level candidate division method list. Optionally, after determining the first-level candidate partition depth list, the second-level candidate partition method list may be determined or obtained according to the first-level candidate partition depth list and / or the first-level candidate partition method list. Optionally, among all the determined partition methods, the partition methods other than the partition methods in the first-level candidate partition method list may be added to the list to determine or obtain the second-level candidate partition method list. Optionally, among all the determined division methods, division methods other than the division methods corresponding to the division depths in the first-level candidate division depth list may be added to the list to determine or obtain a second-level candidate division method list. Optionally, after determining the second-level candidate partitioning list, the second-level candidate partitioning depth list may be determined or obtained based on the second-level candidate partitioning list, and / or the first-level candidate partitioning depth list, and / or the first-level candidate partitioning list. Optionally, the split depths in the second-level candidate split depth list and the first-level candidate split depth list may be different. Optionally, after determining the first-level candidate partition depths, a second-level candidate partition depth list may be determined or obtained according to the first-level candidate partition depth list and / or the first-level candidate partition mode list. Optionally, the second-level candidate partitioning method list may be determined or obtained according to the second-level candidate partitioning depth list, and / or the first-level candidate partitioning method list, and / or the first-level candidate partitioning depth list. Method 20, based on at least one kind of division information, create or update a first-level candidate division depth list, determine or obtain a first-level candidate division method list based on the first-level candidate division depth list, determine or obtain a second-level candidate division depth list based on the first-level candidate division method list, and determine or obtain a second-level candidate division method list based on the second-level candidate division depth list. Optionally, when the division information includes division depth, a list may be constructed, at least one division information is added to the list, a candidate division depth list is obtained, and the list is used as the first-level candidate division depth list, or at least one division depth with the closest distance is selected from at least one division information and added to the list to obtain a first-level candidate division depth list. When the division information includes other information other than the division depth, such as the division method, the division depth corresponding to the other information is determined (the corresponding relationship between the division depth and the other information may be set in advance). The determined at least one division depth is added to the list to obtain a candidate division depth list. Optionally, the division depths in the first-level candidate division depth list may be updated (including but not limited to operations such as replacement, deletion, and addition) according to the division information. Optionally, after the first-level candidate partition depth list is determined, the first-level candidate partition method list may be created or updated according to all the partition depths in the first-level candidate partition depth list. Optionally, the partitioning modes corresponding to all the partitioning depths in the first-level candidate partitioning depth list may be determined. Optionally, the division method corresponding to each type of division depth may be set in advance, and the division methods corresponding to all division depths in the first-level candidate division depth list are added to a preset list to generate a first-level candidate division method list. Optionally, all the division modes in the first-level candidate division mode list may be updated (eg, deleted, replaced, added, modified, etc.) according to the division modes corresponding to all the division depths in the first-level candidate division depth list. Optionally, after determining the first-level candidate partitioning method list, the second-level candidate partitioning depth list may be determined or obtained according to the first-level candidate partitioning method list and / or the first-level candidate partitioning depth list. Optionally, among all the determined partitioning depths, the partitioning depths other than the partitioning depths in the first-level candidate partitioning depth list may be added to the list to determine or obtain the second-level candidate partitioning depth list. Optionally, among all the determined division depths, division depths other than the division depths corresponding to the division methods in the first-level candidate division method list may be added to the list to determine or obtain a second-level candidate division depth list. Optionally, after determining the second-level candidate partition depth list, the second-level candidate partition method list may be determined or obtained based on the second-level candidate partition depth list, and / or the first-level candidate partition depth list, and / or the first-level candidate partition method list. Optionally, the partitioning methods in the second-level candidate partitioning method list and the first-level candidate partitioning method list may be different. In this embodiment, when the division information includes a block division method and / or a block division depth, and the candidate division information list includes at least one of a first-level candidate division method list, a second-level candidate division method list, a first-level candidate division depth list, and a second-level candidate division depth list, a corresponding candidate division information list is created based on at least one division information, and then the current block can be divided through candidate division information lists of different levels to increase the probability of using the candidate division information list and reduce the signaling cost of block division. Fourth embodiment Based on any of the above embodiments, a fourth embodiment is proposed, please refer to FIG. 15 . In this embodiment, step S20 includes the following steps: S21, determining at least one type of partition information of the current block according to the candidate partition information list and / or the prediction of the partition information; S22, dividing the current block according to at least one type of division information of the current block. Optionally, after determining or obtaining the candidate partition information list and / or the prediction of the partition information, partition information selection may be performed in the candidate partition information list, and at least one selected partition information may be used as the partition information of the current block. Optionally, the partition information corresponding to the prediction of all the partition information may be determined, and the partition information may be selected from each of the partition information, and at least one of the selected partition information may be used as the partition information of the current block. Optionally, the partition information selection may be performed by selecting the partition information with the minimum cost or meeting the user's setting requirements. Optionally, after determining at least one type of division information of the current block, the current block may be divided according to at least one type of division information of the current block, such as dividing the current block according to at least one type of division method of the current block and / or at least one type of division depth of the current block. Optionally, when dividing the current block, if there are multiple division information, the division order corresponding to each division information can be determined, and the current block is divided according to the division order and each division information, that is, each division information is controlled according to the division order to divide the current block. Optionally, for example, as shown in FIGS. 16-18, FIG. 16 is an example of the first frame block division method of the 832x480_50 sequence (overlay display). The full name of the 832x480_50 sequence is BasketballDrill_832x480_50, with a resolution of 832x480 and a frame rate of 50. FIG. 17 is an example of the first frame block division method of the 832x480_50 sequence, and FIG. 18 is an example of the first frame block division depth of the 832x480_50 sequence, and different division depths can be displayed in different colors. Optionally, when the division information includes a division method or a division depth, the division may be performed as shown in FIG19, including 000, 010, 001, 011, 100, 110, 101, 111. When the horizontal line n=1 and the vertical lines m=2 in the figure, there are 8 division methods in total. Optionally, each block can have at most n horizontal lines and m vertical lines, so there are at most 2 m+n Optionally, m and n can be any natural numbers. Optionally, each dividing line may be represented by a bit 0 / to indicate its state, and the dividing line may be represented by three bits (horizontal 1 vertical 1 vertical 2). Optionally, any of the partitions in FIG. 19 can be a partition with a depth of 1, that is, only one partition is performed. As shown in FIG. 20, the 100 graph in FIG. 19 can be partitioned once more to obtain a partition with a depth of 2. Similarly, the partitioning can be recursively performed to increase the partitioning depth until the block cannot be partitioned. Optionally, when performing the partitioning, the width and height of each block can be 2. x Dimension. x can be any natural number. Optionally, step S21 includes at least one of the following: Mode 21, determining at least one type of partition information of the current block according to the index obtained from the bitstream and the candidate partition information list; Optionally, a flag bit can be first obtained from the bitstream, and whether to apply the candidate partition information list can be determined based on the flag bit. If so, the candidate partition information list can be determined or obtained, and the index in the bitstream can be obtained. At least one partition information in the candidate partition information list can be determined based on the index, and used as the partition information of the current block, and the current block can be divided according to the partition information of the current block. Optionally, when the candidate partition information list includes multiple levels of candidate partition information lists, such as a first-level candidate partition method list, a second-level candidate partition method list, a first-level candidate partition depth list, and a second-level candidate partition depth list, a flag bit in the bitstream can be obtained, and the candidate partition information list to be applied to the multiple levels of candidate partition information lists can be determined according to the flag bit. If it is necessary to apply to the second-level candidate partition method list, the index in the bitstream is obtained, and at least one partition method in the second-level candidate partition method list is determined, and it is used as the partition information of the current block, and the current block is partitioned according to the partition information of the current block. For example, if it is necessary to apply to the first-level candidate partition depth list, at least one partition depth in the first-level candidate partition depth list can be determined, and it is used as the partition information of the current block, and the current block is partitioned according to the partition information of the current block. Mode 22, determining at least one type of partition information of the current block according to the non-list partition information index obtained from the bitstream and the non-list partition information other than the candidate partition information list; Optionally, a flag bit may be first obtained from the bitstream, and whether to apply the candidate partition information list may be determined according to the flag bit. If not, that is, the candidate partition information list is not applied, the partition information other than all the partition information in the candidate partition information list is determined among all the partition information, and is used as the target partition information. Part or all of the partition information is selected as the partition information of the current block according to the non-list partition information index in at least one target partition information, and the current block is partitioned according to the partition information of the current block. Method 23, determining at least one partitioning information of the current block based on the block partitioning syntax elements in the bitstream, the prediction of the partitioning information and the inverse processing rules. Optionally, if there are block partitioning syntax elements, prediction of partitioning information, and inverse processing rules in the bitstream, the bitstream may be decoded to obtain the block partitioning syntax elements, prediction of partitioning information, and inverse processing rules in the bitstream. Optionally, the block partitioning syntax elements may be the partitioning information to be restored obtained by decoding the bitstream (such as entropy decoding), and may be embodied in the form of a value, text, list, etc. Optionally, the inverse processing rule may be a processing rule opposite to that on the encoding side, such as an addition calculation on the encoding side and a subtraction calculation on the decoding side. Optionally, the inverse processing rules may include difference calculation, absolute value calculation, addition and subtraction of offsets (such as addition calculation, subtraction calculation), logarithmic calculation (the inverse algorithm corresponding to the encoding side), bit operation, etc. Optionally, the prediction of the partitioning information is inversely processed according to the block partitioning syntax element and the inverse processing rule to obtain corresponding partitioning information, and the corresponding partitioning information is used as the partitioning information of the current block. Optionally, a post-processing module can be set on the decoding side, and the block partition syntax elements and the prediction of the partition information are input into the post-processing module on the decoding side for processing. The post-processing module on the decoding side restores the block partition syntax elements according to the prediction of the partition information and the inverse processing rules to obtain at least one partition information of the current block. Optionally, when performing partition depth decoding, the partition depth may be decoded according to the bitstream and the partition depth prediction value. Optionally, as shown in FIG21 , the predicted partition depth 4 is obtained from the neural network prediction module. The video binary code stream "101101011010......" is read in, and then the code stream depth encoding value -2 is obtained by the entropy decoder. Optionally, the predicted depth 4 and the depth difference -2 are added by an adder to obtain the actual partition depth 2 of the current block u (the partition depth adopted by the encoding end), and the partition depth 2 is output. In this embodiment, at least one type of partition information of the current block is determined based on an index and a candidate partition information list in a bitstream, or an index and non-list partition information in a bitstream, or a block partition syntax element in a bitstream, a prediction of the partition information, and an inverse processing rule, thereby improving the hit rate of the partition information of the determined current block on the decoding side, and partitioning the current block based on at least one type of partition information of the current block, thereby reducing the signaling overhead of block partitioning and improving decoding efficiency. Fifth embodiment Based on any of the above embodiments, a fifth embodiment is proposed. In this embodiment, the processing method further includes at least one of the following: Mode 24, determining or obtaining an index according to the division information of the encoded block, the search rule and the candidate division information list, and encoding the index; Optionally, the partition information of the encoded block is obtained, and the partition information can be obtained from other encoded blocks, such as obtaining the partition information of at least one encoded block from the blocks at the upper left, left, lower left, upper right and upper sides of the current block (such as the partition depth and partition method of the encoded block). Optionally, the retrieval rule can be to search in the candidate partition information list according to the partition information of the encoded block, determine or obtain the partition information that matches the candidate partition information list and the partition information of the encoded block, and use it as the matching partition information, and then obtain a pre-set comparison table with a mapping relationship between the partition information and the index, and determine the index corresponding to the matching partition information in the comparison table, and then encode the index. Optionally, the retrieval rules may also be other rules set by the user, such as selecting according to preset rules from the partition information of the encoded block and the list of candidate partition information to determine the partition information suitable for partitioning the current block, and use it as the matching partition information, and then determine the index corresponding to the matching partition information based on the comparison table, and then encode the index. Method 25, determining the division information to be encoded based on the division information of the encoded block, the processing rule and the prediction of the division information, and encoding the division information to be encoded. Optionally, the processing rules may include difference calculation, absolute value calculation, addition and subtraction of offset, logarithm calculation, bit operation, etc. For example, if the predicted value range of the original partition information is -5 to 5, by adding 5, the value range is shifted to 0 to 10. Optionally, the partition information of the encoded block is obtained, and the partition information can be obtained from other encoded blocks, such as obtaining the partition information of at least one encoded block from the blocks above the left, left, below the left, above the right and above the current block. Optionally, a post-processing module may be provided, and a processing rule may be provided in the post-processing module, the partition information of the encoded block and the prediction of at least one partition information of the determined current block may be input into the post-processing module, and the prediction of the partition information may be deformed in the post-processing module according to the processing rule and the encoded partition information, and the prediction of the partition information after the deformation may be used as the partition information to be encoded. For example, if the processing rule is a difference calculation, the prediction of the partition information may be subtracted from the prediction value in the partition information of the encoded block to obtain a corresponding difference, and the difference may be used as the partition information to be encoded, and then the partition information to be encoded may be encoded. In this embodiment, by determining the index based on the encoded partition information, the search rule and the candidate partition information list and then encoding, the security of the partition information on the encoding side can be guaranteed. By determining the partition information to be encoded based on the encoded partition information, the processing rule and the prediction of the partition information and then encoding, the effectiveness of the encoding process can be guaranteed. And when performing block partitioning, whether using the candidate partition information list or the prediction of the partition information, compared with the method of directly determining all the partition information in sequence, the hit rate of the partition information hitting the current block can be significantly improved, thereby reducing the signaling overhead of block partitioning and improving the encoding efficiency. The present application also provides a processing device, please refer to FIG. 22 , which is a schematic diagram of the functional modules of the processing device of the present application, which can be set in or is a processing device, and the processing device includes: The processing module A10 is used to determine a candidate partition information list and / or a prediction of the partition information according to the partition information; and to partition the current block according to the candidate partition information list and / or the prediction of the partition information. Optionally, the processing module A10 is used for at least one of the following: According to at least one of the partition information of the neighbor block, the partition information of the non-neighbor block, the default partition information, the partition information of the selected block, the pixel and the encoding and decoding parameter determining at least one type of partition information, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the at least one type of partition information; Determine at least one type of partition information according to the frequency of the partition information of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one type of partition information; Determine at least one partition information according to the partition information, pixels and coding parameters of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate or sort according to the block partition information, pixels and coding parameters, determine at least one partition information after calculation or sorting, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate a cost value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the cost value; Calculate a first generation value and a second generation value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the first generation value and the second generation value; Calculate a SAD value and / or a SATD value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to at least one type of partition information determined by the SAD value and / or the SATD value corresponding to the at least one type of partition information; According to the first component partition information of the neighbor block and / or the first component partition information of the non-neighbor block, a candidate partition information list and / or a prediction of the partition information of the second component of the current block is determined or obtained. Optionally, determining or obtaining a candidate partition information list and / or a prediction of the partition information according to at least one partition information includes at least one of the following: Determine or obtain a candidate partition information list and / or a prediction of the partition information according to the partition information list to which at least one partition information is added; Sorting the determined at least one type of division information, and determining or obtaining a candidate division information list and / or a prediction of the division information according to the sorted at least one type of division information; Determine or obtain a candidate partition information list and / or a prediction of the partition information according to a cost of at least one partition information; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a neural network to obtain an output result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the output result; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a query table for querying, obtaining a query result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the query result; Matching is performed according to at least one type of partition information, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the matched at least one type of partition information; At least one of the at least one partition information, pixel and encoding / decoding parameter is input into a mathematical model, and a candidate partition information list and / or a prediction of the partition information is determined or obtained according to an output result of the mathematical model. Optionally, the division information includes a block division mode and / or a block division depth; The candidate partition information list includes at least one of the following: A list of first-level candidate partitioning methods; A list of second-level candidate partitioning methods; First level candidate partition depth list; Second level candidate partition depth list. Optionally, determining or obtaining a candidate partition information list according to at least one partition information includes at least one of the following: Creating or updating a first-level candidate partitioning method list according to at least one partitioning information, and determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning method list; Creating or updating a first-level candidate partition depth list according to at least one partition information, and determining or obtaining a second-level candidate partition depth list according to the first-level candidate partition depth list; Creating or updating a first-level candidate partitioning method list according to at least one partitioning information, determining or obtaining a first-level candidate partitioning depth list according to the first-level candidate partitioning method list, determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning depth list, and determining or obtaining a second-level candidate partitioning depth list according to the second-level candidate partitioning method list; Based on at least one kind of division information, create or update a first-level candidate division depth list; based on the first-level candidate division depth list, determine or obtain a first-level candidate division method list; based on the first-level candidate division method list, determine or obtain a second-level candidate division depth list; based on the second-level candidate division depth list, determine or obtain a second-level candidate division method list. Optionally, the processing module A10 is used to: Determine at least one type of partition information of the current block according to the candidate partition information list and / or the prediction of the partition information; The current block is divided according to at least one type of division information of the current block. Optionally, the processing module A10 is used for at least one of the following: Determine at least one type of partition information of the current block according to the index obtained from the bitstream and the candidate partition information list; Determine at least one type of partition information of the current block according to the non-list partition information index obtained from the bitstream and the non-list partition information except the candidate partition information list; At least one partition information of the current block is determined according to the block partition syntax elements in the bitstream, the prediction of the partition information and the inverse processing rule. Optionally, the processing module A10 is used for at least one of the following: Determine or obtain an index according to the partition information of the encoded block, the search rule and the candidate partition information list, and encode the index; According to the division information of the coded block, the processing rule and the prediction of the division information, the division information to be coded is determined, and the division information to be coded is coded. An embodiment of the present application also provides a processing device, including a memory and a processor. A processing program is stored in the memory, and when the processing program is executed by the processor, the steps of the processing method in any of the above embodiments are implemented. The present application also provides a storage medium having a processing program stored thereon, and when the processing program is executed by a processor, the processing program can be implemented in any of the above embodiments. The steps of the processing method. In the embodiments of the processing device, processing equipment and storage medium provided in the present application, all technical features of any of the above-mentioned processing method embodiments may be included, and the expansion and explanation content of the specification are basically the same as those of the embodiments of the above-mentioned method, and will not be repeated here. The embodiment of the present application further provides a computer program product, which includes a computer program code. When the computer program code runs on a computer, the computer executes the methods in the above various possible implementation modes. An embodiment of the present application also provides a chip, including a memory and a processor, the memory is used to store a computer program, and the processor is used to call and run the computer program from the memory, so that a device equipped with the chip executes the methods in various possible implementation modes as described above. It is understood that the above scenarios are only examples and do not constitute a limitation on the application scenarios of the technical solutions provided in the embodiments of the present application. The technical solutions of the present application can also be applied to other scenarios. For example, it is known to those skilled in the art that with the evolution of the system architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems. The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments. The steps in the method of the embodiment of the present application can be adjusted in order, combined and deleted according to actual needs. The units in the device of the embodiment of the present application can be merged, divided and deleted according to actual needs. In the present application, the same or similar terminology concepts, technical solutions and / or application scenario descriptions are generally described in detail only the first time they appear. When they appear again later, they are generally not repeated for the sake of brevity. When understanding the technical solutions and other contents of the present application, for the same or similar terminology concepts, technical solutions and / or application scenario descriptions that are not described in detail later, reference can be made to the previous related detailed descriptions. In the present application, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments. The various technical features of the technical solution of the present application can be combined arbitrarily. In order to make the description concise, not all possible combinations of the various technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of the present application. Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) as above, and includes a number of instructions for a terminal device (which can be a mobile phone, a computer, a server, a controlled terminal, or a network device, etc.) to execute the method of each embodiment of the present application. In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loading and executing computer program instructions on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. Computer instructions can be stored in a storage medium, or transmitted from one storage medium to another storage medium. For example, computer instructions can be transmitted from a website site, computer, server or data center to another website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) mode. The storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integration. Available media can be magnetic media, (e.g., floppy disk, storage disk, tape), optical media (e.g., DVD), or semiconductor media (e.g., solid-state storage disk Solid State Disk (SSD)), etc. The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A processing method, wherein: Includes steps: S10, determining a candidate partition information list and / or a prediction of the partition information according to the partition information; S20, dividing the current block according to the candidate partition information list and / or the prediction of the partition information.

2. The processing method according to claim 1, wherein: The step S10 includes at least one of the following: Determine at least one partition information according to at least one of the partition information of the neighbor block, the partition information of the non-neighbor block, the default partition information, the partition information of the selected block, the pixel and the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Determine at least one type of partition information according to the frequency of the partition information of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one type of partition information; Determine at least one partition information according to the partition information, pixels and coding parameters of the block, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate or sort according to the block partition information, pixels and coding parameters, determine at least one partition information after calculation or sorting, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the at least one partition information; Calculate a cost value corresponding to at least one type of partition information according to the partition information of the block and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the cost value; Calculate a first generation value and a second generation value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to the first generation value and the second generation value; Calculate a SAD value and / or a SATD value corresponding to at least one type of partition information according to the partition information of the block, and / or the pixel and / or the encoding and decoding parameter, and determine or obtain a candidate partition information list and / or a prediction of the partition information according to at least one type of partition information determined by the SAD value and / or the SATD value corresponding to the at least one type of partition information; According to the first component partition information of the neighbor block and / or the first component partition information of the non-neighbor block, a candidate partition information list and / or a prediction of the partition information of the second component of the current block is determined or obtained.

3. The processing method according to claim 2, wherein: The determining or obtaining the candidate partition information list and / or the prediction of the partition information according to the at least one partition information comprises at least one of the following: Determine or obtain a candidate partition information list and / or a prediction of the partition information according to the partition information list to which at least one partition information is added; Sorting the determined at least one type of division information, and determining or obtaining a candidate division information list and / or a prediction of the division information according to the sorted at least one type of division information; Determine or obtain a candidate partition information list and / or a prediction of the partition information according to a cost of at least one partition information; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a neural network to obtain an output result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the output result; Inputting at least one of the at least one partition information, pixel and encoding / decoding parameter into a query table for querying, obtaining a query result, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the query result; Matching is performed according to at least one type of partition information, and determining or obtaining a candidate partition information list and / or a prediction of the partition information according to the matched at least one type of partition information; At least one of the at least one partition information, pixel and encoding / decoding parameter is input into a mathematical model, and a candidate partition information list and / or a prediction of the partition information is determined or obtained according to an output result of the mathematical model.

4. The processing method according to claim 2, wherein: Also includes at least one of the following: The partition information includes a block partition mode and / or a block partition depth; The candidate partition information list includes at least one of the following: A list of first-level candidate partitioning methods; A list of second-level candidate partitioning methods; First level candidate partition depth list; Second level candidate partition depth list.

5. The processing method according to claim 4, wherein: The determining or obtaining the candidate partition information list according to at least one partition information includes at least one of the following: Creating or updating a first-level candidate partitioning method list according to at least one partitioning information, and determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning method list; Creating or updating a first-level candidate partition depth list according to at least one partition information, and determining or obtaining a second-level candidate partition depth list according to the first-level candidate partition depth list; Creating or updating a first-level candidate partitioning method list according to at least one partitioning information, determining or obtaining a first-level candidate partitioning depth list according to the first-level candidate partitioning method list, determining or obtaining a second-level candidate partitioning method list according to the first-level candidate partitioning depth list, and determining or obtaining a second-level candidate partitioning depth list according to the second-level candidate partitioning method list; Based on at least one kind of division information, create or update a first-level candidate division depth list; based on the first-level candidate division depth list, determine or obtain a first-level candidate division method list; based on the first-level candidate division method list, determine or obtain a second-level candidate division depth list; based on the second-level candidate division depth list, determine or obtain a second-level candidate division method list.

6. The processing method according to any one of claims 1 to 5, wherein: The step S20 comprises the following steps: S21, determining at least one type of partition information of the current block according to the candidate partition information list and / or the prediction of the partition information; S22, dividing the current block according to at least one type of division information of the current block.

7. The processing method according to claim 6, wherein: The step S21 includes at least one of the following: Determine at least one type of partition information of the current block according to the index obtained from the bitstream and the candidate partition information list; Determine at least one type of partition information of the current block according to the non-list partition information index obtained from the bitstream and the non-list partition information except the candidate partition information list; At least one partition information of the current block is determined according to the block partition syntax elements in the bitstream, the prediction of the partition information and the inverse processing rule.

8. The processing method according to any one of claims 1 to 5, wherein: The method further comprises at least one of the following: Determine or obtain an index according to the partition information of the encoded block, the search rule and the candidate partition information list, and encode the index; According to the division information of the coded block, the processing rule and the prediction of the division information, the division information to be coded is determined, and the division information to be coded is coded.

9. A processing device, wherein: include: A memory and a processor, wherein a processing program is stored in the memory, and when the processing program is executed by the processor, the steps of the processing method according to claim 1 are implemented.

10. A storage medium, wherein: The storage medium stores a computer program, and when the computer program is executed by the processor, the steps of the processing method according to claim 1 are implemented.

Images