WO2026001802A2 - Procédé de traitement, dispositif de traitement et support de stockage - Google Patents

Procédé de traitement, dispositif de traitement et support de stockage

Info

Publication number
WO2026001802A2
WO2026001802A2 PCT/CN2025/101884 CN2025101884W WO2026001802A2 WO 2026001802 A2 WO2026001802 A2 WO 2026001802A2 CN 2025101884 W CN2025101884 W CN 2025101884W WO 2026001802 A2 WO2026001802 A2 WO 2026001802A2
Authority
WO
WIPO (PCT)
Prior art keywords
gradient
current block
partition
reference region
optionally
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
PCT/CN2025/101884
Other languages
English (en)
Chinese (zh)
Other versions
WO2026001802A3 (fr
Inventor
刘雨田
霍永凯
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shenzhen Transsion Holdings Co Ltd
Original Assignee
Shenzhen Transsion Holdings Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shenzhen Transsion Holdings Co Ltd filed Critical Shenzhen Transsion Holdings Co Ltd
Priority to PCT/CN2025/101884 priority Critical patent/WO2026001802A2/fr
Publication of WO2026001802A2 publication Critical patent/WO2026001802A2/fr
Publication of WO2026001802A3 publication Critical patent/WO2026001802A3/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode

Definitions

  • This application relates to the field of image processing technology, specifically to a processing method, processing device, and storage medium.
  • the existing video coding standard (H.266/VVC) proposes a video frame coding technique. For example, when encoding and decoding video frames, the protocol divides each frame into different blocks and performs prediction processing and encoding/decoding processing.
  • the inventors discovered at least the following problems: the prediction effect for local regions of image blocks is not ideal during intra-frame prediction and/or inter-frame prediction, which in turn leads to poor encoding and decoding quality during video encoding and/or decoding.
  • this application provides a processing method, processing device, and storage medium that can match a suitable prediction pattern for at least one partition of the current block, thereby supporting the improvement of prediction accuracy for local areas of the current block (e.g., the area corresponding to the partition).
  • This application provides a processing method applicable to a processing device, comprising the following steps:
  • the prediction pattern for at least one partition is determined or obtained based on at least one of the following:
  • At least one gradient operator At least one gradient operator
  • At least one gradient histogram At least one gradient histogram.
  • processing method further includes at least one of the following:
  • the sub-reference region is associated with at least one partition of the current block
  • the sub-reference region is determined or obtained based on the current block's partitioning method
  • the first weight information corresponds to at least one partition and/or at least one reference region
  • the gradient histogram is determined or obtained based on at least one reference region of the current block
  • the first weight information is determined or obtained based on the current block partitioning method
  • Gradient information includes gradient information of pixels in the reference region, and/or overall gradient information of the reference region.
  • processing method further includes at least one of the following:
  • the current block is divided according to at least one geometric partitioning pattern and/or an index obtained from the bitstream;
  • the first weight information includes the weight of at least one pixel in at least one reference region
  • the gradient information of at least one reference region including gradient magnitude and/or gradient direction.
  • the weight of at least one pixel in at least one reference region included in the first weight information is determined or obtained based on the distance between the at least one pixel and the dividing line corresponding to the current block division method.
  • the gradient histogram is determined or obtained based on at least one of the following:
  • the gradient information and first weight information of at least one reference region of the current block are the gradient information and first weight information of at least one reference region of the current block
  • the current block has at least one reference region and at least one gradient operator.
  • processing method further includes at least one of the following:
  • At least one reference region is determined or obtained based on at least one of the following:
  • the pixel above the current block the non-adjacent pixel above the current block, the pixel to the left of the current block, the non-adjacent pixel to the left of the current block, the pixel above the left of the current block, and the non-adjacent pixel above the left of the current block;
  • the current block is selected from at least one of the following: neighboring block, non-neighboring block, sibling block, temporal block, and default block;
  • the current block's width, height, block size, and block area must be at least one of these.
  • the candidate motion vector or candidate block vector of the current block is determined or the candidate block is obtained;
  • the current block is divided in a specific way.
  • This application also provides a processing device, including: a memory and a processor, wherein the memory stores a processing program, and when the processing program is executed by the processor, it implements the steps of any of the processing methods described above.
  • This application also provides a storage medium storing a computer program that, when executed by a processor, implements the steps of any of the processing methods described above.
  • the processing method of this application can be applied to a processing device to determine or obtain a prediction pattern for at least one partition of the current block based on at least one reference region of the current block.
  • a suitable prediction pattern can be matched for at least one partition of the current block, thereby supporting the improvement of prediction accuracy for local regions of the current block (e.g., the region corresponding to the partition).
  • Figure 1 is a schematic diagram of the hardware structure of a mobile terminal implementing various embodiments of this application;
  • FIG. 2 is a communication network system architecture diagram provided in an embodiment of this application.
  • FIG. 3 is a schematic diagram of the hardware structure of a controller 140 provided in this application.
  • Figure 4 is a schematic diagram of the hardware structure of a network node 150 provided in this application.
  • Figure 5 is a flowchart illustrating the processing method according to the first embodiment
  • Figure 6 is a schematic diagram of a division method that is not applicable to the embodiments of this application, based on the first embodiment
  • Figure 7 is a schematic diagram of a division method applicable to embodiments of this application, based on the first embodiment
  • Figure 8 is a schematic diagram of the encoder's encoding process in the image processing method according to the first embodiment
  • Figure 9 is a schematic diagram of the decoding process of the decoder in the image processing method according to the first embodiment
  • Figure 10 is a schematic diagram illustrating the division of the reference region according to the second embodiment
  • Figure 11 is a schematic diagram of the first weight information corresponding to a partition according to the second embodiment
  • Figure 12 is a schematic diagram of the first weight information corresponding to another partition according to the second embodiment
  • Figure 13 is a schematic diagram of a reference area for the DIMD mode in the processing method according to the second embodiment
  • Figure 14 is a schematic diagram of the gradient magnitude in the processing method according to the second embodiment.
  • Figure 15 is a schematic diagram of the processing module of the processing device.
  • first, second, third, etc. may be used herein to describe various information, this information should not be limited to these terms. These terms are used only to distinguish information of the same type from one another; for example, without departing from the scope of this document, first information may also be referred to as second information, and similarly, second information may also be referred to as first information.
  • first information may also be referred to as second information
  • second information may also be referred to as first information.
  • the word “if,” as used herein can be interpreted as “when,” “when,” or “in response to determination.”
  • the singular forms "a,” “an,” and “the” are intended to also include the plural forms unless the context indicates otherwise.
  • “including at least one of the following: A, B, C” means “any one of the following: A; B; C; A and B; A and C; B and C; A and B and C”, or “A, B or C” or “A, B and/or C” means “any one of the following: A; B; C; A and B; A and C; B and C; A and B and C”. Exceptions to this definition will only occur if the combination of elements, functions, steps, or operations is inherently mutually exclusive in some way.
  • the words “if” or “suppose” as used here can be interpreted as “when” or “in response to determination” or “in response to detection.”
  • the phrases “if determination” or “if detection (of the stated condition or event)” can be interpreted as “when determination” or “in response to determination” or “when detection (of the stated condition or event)” or “in response to detection (of the stated condition or event).”
  • step designations such as S10 are used in this paper to more clearly and concisely describe the corresponding content, and do not constitute a substantial restriction on the order.
  • the processing device can be implemented in various forms.
  • the processing device described in this application may include processing devices such as mobile phones, servers, tablet computers, laptop computers, handheld computers, personal digital assistants (PDAs), portable media players (PMPs), navigation devices, wearable devices, smart bracelets, pedometers, and fixed terminals such as digital TVs and desktop computers.
  • processing devices such as mobile phones, servers, tablet computers, laptop computers, handheld computers, personal digital assistants (PDAs), portable media players (PMPs), navigation devices, wearable devices, smart bracelets, pedometers, and fixed terminals such as digital TVs and desktop computers.
  • PDAs personal digital assistants
  • PMPs portable media players
  • navigation devices wearable devices
  • smart bracelets smart bracelets
  • pedometers pedometers
  • fixed terminals such as digital TVs and desktop computers.
  • 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, etc.
  • RF Radio Frequency
  • WiFi Wireless Fidelity
  • the radio frequency unit 101 can be used for receiving and transmitting signals during information transmission or calls. Specifically, it receives downlink information from the base station and processes it with the processor 110; and/or transmits uplink data to the base station.
  • 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.
  • the radio frequency unit 101 can also communicate with networks and other devices wirelessly.
  • the aforementioned wireless communications may 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.
  • 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.
  • WiFi is a short-range wireless transmission technology.
  • Mobile terminals using WiFi module 102 can help users send and receive emails, browse web pages, and access streaming media, providing wireless broadband internet access.
  • Figure 1 shows WiFi module 102, it is understood that it is not an essential component of the mobile terminal and can be omitted as needed without altering the essence of the invention.
  • the audio output unit 103 can convert audio data received by the radio frequency unit 101 or the WiFi module 102 or stored in the memory 109 into audio signals and output them as sound when the mobile terminal 100 is in call signal receiving mode, call mode, recording mode, voice recognition mode, broadcast receiving mode, etc. Furthermore, the audio output unit 103 can also provide audio output related to specific functions performed by the mobile terminal 100 (e.g., call signal receiving sound, message receiving 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 processing unit (GPU) 1041 and a microphone 1042.
  • the GPU 1041 processes image data of still images or videos acquired by an image capture device (such as a camera) in video capture mode or image capture mode.
  • the processed image frames can be displayed on the display unit 106.
  • the image frames processed by the GPU 1041 can be stored in the memory 109 (or other storage medium) or transmitted via the radio frequency unit 101 or the WiFi module 102.
  • the microphone 1042 can receive sound (audio data) in operating modes such as telephone call mode, recording mode, and voice recognition mode, and can process such sound into audio data.
  • the processed audio (voice) data can be converted into a format that can be transmitted to a mobile communication base station via the radio frequency unit 101 in telephone call mode.
  • the microphone 1042 can implement various types of noise cancellation (or suppression) algorithms to eliminate (or suppress) noise or interference generated during the reception and transmission of audio signals.
  • the mobile terminal 100 also includes at least one sensor 105, such as a light sensor, a motion sensor, and other sensors.
  • the light sensor includes an ambient light sensor and a proximity sensor.
  • the ambient light sensor can adjust the brightness of the display panel 1061 according to the ambient light level, and the proximity sensor can turn off the display panel 1061 and/or backlight when the mobile terminal 100 is moved to the ear.
  • an accelerometer sensor can detect the magnitude of acceleration in various directions (generally three axes), and can detect the magnitude and direction of gravity when stationary. It can be used for applications that recognize the phone's posture (such as landscape/portrait switching, related games, magnetometer posture calibration), vibration recognition related functions (such as pedometer, tapping), etc.
  • sensors that may be configured in the phone, such as fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, and infrared sensors, will not be described in detail 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.
  • LCD liquid crystal display
  • OLED organic light-emitting diode
  • User input unit 107 can be used to receive input numerical or character information, and generate key signal inputs related to user settings and function control of the mobile terminal.
  • user input unit 107 may include touch panel 1071 and other input devices 1072.
  • Touch panel 1071 also known as a touch screen, can collect touch operations performed by the user on or near it (such as operations performed by the user using a finger, stylus, or any suitable object or accessory on or near touch panel 1071), and drive corresponding connection devices according to a pre-set program.
  • Touch panel 1071 may include a touch detection device and a touch controller.
  • the touch detection device detects the user's touch position and the signal generated by the touch operation, and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device, converts it into touch point coordinates, sends it to processor 110, and can receive and execute commands sent by processor 110.
  • touch panel 1071 can be implemented using various types such as resistive, capacitive, infrared, and surface acoustic wave.
  • the user input unit 107 may also include other input devices 1072.
  • other input devices 1072 may include, but are not limited to, one or more of the following: physical keyboard, function keys (such as volume control buttons, power buttons, etc.), trackball, mouse, joystick, etc., without being specifically limited here.
  • the touch panel 1071 may cover the display panel 1061.
  • the touch panel 1071 detects a touch operation on or near it, it transmits the information to the processor 110 to determine the type of touch event. Subsequently, the processor 110 provides corresponding visual output on the display panel 1061 according to the type of touch event.
  • the touch panel 1071 and the display panel 1061 are implemented as two independent components to realize the input and output functions of the mobile terminal, in some embodiments, the touch panel 1071 and the display panel 1061 can be integrated to realize the input and output functions of the mobile terminal. The specific implementation is not limited here.
  • Interface unit 108 serves as an interface through which at least one external device can connect to 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, and so on.
  • Interface unit 108 may be used to receive input from external devices (e.g., data information, power, etc.) and transmit the received input to one or more elements within mobile terminal 100, or it may be used to transmit data between mobile terminal 100 and external devices.
  • external devices e.g., data information, power, etc.
  • the memory 109 can be used to store software programs and various data.
  • the memory 109 may primarily include a program storage area and a data storage area.
  • the program storage area may store the operating system, applications required for at least one function (such as sound playback, image playback, etc.), etc.;
  • the data storage area may store data created based on the use of the mobile phone (such as audio data, phonebook, etc.).
  • the memory 109 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other volatile solid-state storage device.
  • the processor 110 is the control center of the mobile terminal. It connects various parts of the mobile terminal via various interfaces and lines. By running or executing software programs and/or modules stored in the memory 109, and by calling data stored in the memory 109, it performs various functions and processes data of the mobile terminal, thereby providing overall monitoring of the mobile terminal.
  • the processor 110 may include one or more processing units; preferably, the processor 110 may integrate an application processor and a modem processor.
  • the application processor mainly handles the operating system, user interface, and applications, while the modem processor mainly handles wireless communication. It is understood that the 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) that supplies power to various components.
  • a power supply 111 (such as a battery) that supplies power to various components.
  • the power supply 111 can be logically connected to the processor 110 through a power management system, thereby enabling functions such as charging, discharging, and power consumption management through the power management system.
  • the mobile terminal 100 may also include a Bluetooth module, etc., which will not be described in detail here.
  • the communication network system is an LTE system based on the 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 the operator's IP services 204, which are connected in sequence.
  • UE User Equipment
  • E-UTRAN Evolved UMTS Terrestrial Radio Access Network
  • EPC Evolved Packet Core
  • UE201 can be the aforementioned terminal 100, which will not be described in detail here.
  • E-UTRAN202 includes eNodeB2021 and other eNodeB2022, etc.
  • eNodeB2021 can connect to other eNodeB2022 via backhaul (e.g., X2 interface), and eNodeB2021 connects to EPC203, providing access from UE201 to EPC203.
  • backhaul e.g., X2 interface
  • EPC203 may include an MME (Mobility Management Entity) 2031, an HSS (Home Subscriber Server) 2032, other MMEs 2033, an SGW (Serving Gateway) 2034, a PGW (Packet Data Network Gateway) 2035, and a PCRF (Policy and Charging Rules Function) 2036, etc.
  • MME2031 is the control node that handles signaling between UE201 and EPC203, providing bearer and connection management.
  • HSS2032 is used to provide registers to manage functions such as the Home Location Register (not shown in the figure) and stores user-specific information such as service characteristics and data rates. All user data can be sent through SGW2034.
  • PGW2035 can provide UE 201 IP address allocation and other functions.
  • PCRF2036 is the policy and charging control 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 enforcement function unit (not shown in the figure).
  • IP service 204 may include the Internet, intranet, IMS (IP Multimedia Subsystem), or other IP services.
  • IMS IP Multimedia Subsystem
  • LTE Long Term Evolution
  • CDMA2000 Code Division Multiple Access 2000
  • WCDMA Wideband Code Division Multiple Access 2000
  • TD-SCDMA Time Division Multiple Access 2000
  • 5G Fifth Generation
  • future new network systems such as 6G
  • FIG 3 is a schematic diagram of the hardware structure of a controller 140 provided in this application.
  • the controller 140 includes a memory 1401 and a processor 1402.
  • the memory 1401 is used to store program instructions
  • the processor 1402 is used to call the program instructions in the memory 1401 to execute the steps performed by the controller in the first embodiment of the above method.
  • the implementation principle and beneficial effects are similar, and will not be described again here.
  • the controller further includes a communication interface 1403, which can be connected to the processor 1402 via a bus 1404.
  • the processor 1402 can control the communication interface 1403 to implement the receiving and sending functions of the controller 140.
  • FIG. 4 is a schematic diagram of the hardware structure of a network node 150 provided in this application.
  • the network node 150 includes a memory 1501 and a processor 1502.
  • the memory 1501 is used to store program instructions
  • the processor 1502 is used to call the program instructions in the memory 1501 to execute the steps performed by the first node in the above method embodiment.
  • the implementation principle and beneficial effects are similar, and will not be described again here.
  • the controller further includes a communication interface 1503, which can be connected to the processor 1502 via a bus 1504.
  • the processor 1502 can control the communication interface 1503 to implement the receiving and sending functions of the network node 150.
  • the integrated modules described above, implemented as software functional modules, can be stored in a computer-readable storage medium.
  • These software functional modules, stored in a storage medium include several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) or processor to execute some steps of the methods of the various embodiments of this application.
  • implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof.
  • software When implemented in software, it can be implemented, in whole or in part, as a computer program product.
  • a computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated.
  • the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a storage medium or transmitted from one storage medium to another.
  • computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means.
  • 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 integrates one or more available media.
  • the available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk, SSD), etc.
  • step S10 is a flowchart illustrating the processing method according to the first embodiment
  • Step S10 Determine or obtain the prediction pattern of at least one partition of the current block based on at least one reference region.
  • the processing device can be a smart terminal, such as a mobile phone or computer, or a server, such as a local server or a cloud server.
  • a smart terminal such as a mobile phone or computer
  • a server such as a local server or a cloud server.
  • This embodiment and this application primarily use a smart terminal as an example for illustration.
  • the technical solution of this embodiment can be applied to fields such as image encoding and decoding, video encoding and decoding, hardware video encoding and decoding, dedicated circuit video encoding and decoding, and real-time video encoding and decoding.
  • the processing device can acquire video image data from a video source, segment each frame of the video image data to obtain at least one image block, and determine the image block to be predicted in the at least one image block as the current block.
  • At least one partition of the current block can be determined or obtained, for example, by dividing the current block to determine or obtain at least one partition of the current block, the at least one partition including rectangular partitions and/or non-rectangular partitions.
  • At least one partition of the current block is determined or obtained based on the partitioning method of the current block.
  • the current block partitioning method is determined or obtained based on at least one geometric partitioning pattern and/or an index obtained from the bitstream.
  • the Geometric Partitioning mode is a prediction mode used by the next-generation video compression standard (Versatile Video Coding, VVC) for the boundary parts of moving objects in an image.
  • the GPM mode can perform more refined partitioning of the boundaries of moving objects in an image.
  • the edge coding unit of the moving object is divided into non-rectangular sub-coding units (e.g., partitions) for unidirectional prediction, thereby obtaining the predicted value of the entire coding unit.
  • At least one partition of the current block is determined or obtained according to at least one geometric partitioning pattern, wherein the at least one partition is a non-rectangular partition.
  • the number of partitions determined or obtained according to the current block division method can be 1, 2, 3, 4, etc., and the partitions can be the same or different in size.
  • the partitions determined or obtained according to the current block division method are all adjacent to the reference area and/or the sub-reference areas within the reference area.
  • the current block is divided into partitions A to D according to the dividing lines corresponding to the current block's partitioning method.
  • the reference area of the current block is divided into sub-reference areas A to C.
  • Partition A is adjacent to sub-reference area A
  • partition B is adjacent to sub-reference area B
  • partition C is adjacent to sub-reference area C.
  • partition D is not adjacent to either the reference area or the sub-reference areas. Therefore, the partitioning method shown in Figure 6 is not the partitioning method indicated in the embodiments of this application, but a partitioning method that is not applicable to the embodiments of this application.
  • the current block is divided into partitions A to D according to the dividing lines corresponding to the current block's partitioning method.
  • the reference area of the current block is divided into sub-reference areas A to C. Partition A is adjacent to sub-reference area A, partition B is adjacent to sub-reference area B, partition C is adjacent to sub-reference area C, and partition D is adjacent to sub-reference area D. Therefore, the partitioning method shown in Figure 7 is the partitioning method indicated in the embodiments of this application, that is, the partitioning method applicable to the embodiments of this application.
  • the reference region is a region that has a strong correlation with the current block and can be used for the prediction processing of the current block.
  • the partition is a part of the current block and inherits the position and some characteristics of the current block in the image. Therefore, the common correlation between the current block and its reference region and partition can be used to determine or obtain the prediction mode of at least one partition for the prediction processing of at least one partition. Since local regions of an image usually have similar characteristics, determining the prediction mode of a partition through the reference region of the current block can better utilize these local characteristics and obtain a prediction mode with higher fit to the partition, thereby improving the accuracy of the prediction.
  • the reference area includes at least one of the following: a reference pixel, a reference block, and a reference template.
  • the prediction mode of at least one partition determined or obtained includes at least one of the following: intra-frame prediction mode, inter-frame prediction mode, and intra-block copy prediction mode.
  • the prediction pattern for at least one partition can be one or more.
  • the prediction modes for each partition can be different or at least partially the same.
  • the intra-frame prediction mode uses the already encoded neighboring pixels within the same frame (e.g., the reconstructed pixels above, to the left, or to the upper left of the current block) to predict the pixel value of the current block, without relying on other frames.
  • the core idea of the intra-frame prediction mode is to deduce the texture or directional features of the current block from neighboring pixels through spatial correlation.
  • the intra-frame prediction mode includes at least one of the following: angle prediction mode, non-angle prediction mode, and derivation mode.
  • the inter-frame prediction mode uses regions in an encoded reference frame (e.g., the frame before or after the current frame to which the current block belongs) to predict the pixel value of the current block through motion compensation.
  • the core of the inter-frame prediction mode is to indicate the matching position of the current block in the reference frame through motion vectors (MV).
  • intra-block copying is a special form of prediction mode that allows pixel blocks to be copied from other decoded regions within the same frame (e.g., the reconstructed portion of the current frame to which the current block belongs) to predict the current block, similar to "intra-frame motion compensation".
  • angle prediction mode is a technique for predicting the current pixel block. It generates the predicted block by propagating the values of neighboring pixels along a specific direction.
  • Angle prediction mode is mainly used to process directional textures in images, which can effectively reduce spatial redundancy and improve compression efficiency.
  • the intra-frame prediction mode includes 33 angle prediction modes, which cover different angles from horizontal to vertical, ensuring accurate prediction of various texture directions.
  • the angle modes are expanded to 65, with more densely added directions to more accurately capture edges in natural video.
  • the non-angle prediction mode can be a prediction mode other than the angle prediction mode.
  • the non-angle prediction mode includes at least one of the following: DC mode, Planar mode, and neural network-based prediction mode.
  • the derivation mode is a mode used to derive an intra-prediction mode.
  • the derivation mode is a method of deriving the prediction mode matching the current block by analyzing the relevant information of the current block.
  • the derivation mode includes at least one of the following: Decoder-side intra-mode derivation (DIMD) mode, Occurrence-based Intra Coding (OBIC) mode, and template-based intra-mode derivation (TIMD) mode.
  • DIMD Decoder-side intra-mode derivation
  • OBIC Occurrence-based Intra Coding
  • TDD template-based intra-mode derivation
  • the processing method in this application embodiment can be an improved DIMD mode, which determines or obtains the gradient histogram of at least one partition of the current block based on the gradient information of at least one reference region, and determines or obtains the prediction mode of at least one partition based on the gradient histogram of at least one partition.
  • the processing method also includes the following methods A1 and/or A2:
  • Method A1 Determine or obtain the prediction result of the current block based on the prediction result of at least one partition
  • the prediction process is performed on at least one partition according to the prediction mode of at least one partition to determine or obtain the prediction result of at least one partition, and the prediction result of the current block is determined or obtained based on the prediction result of at least one partition.
  • a prediction process is performed on at least one partition according to at least one prediction mode of at least one partition to determine or obtain at least one prediction result of at least one partition, a target prediction result of at least one partition is determined or obtained according to at least one prediction result of at least one partition, and a prediction result of the current block is determined or obtained according to the target prediction result of at least one partition.
  • the target prediction result for at least one partition can be determined or obtained by fusing at least one prediction result for at least one partition.
  • the fusing process may include weighted fusing, which can combine the advantages of different prediction models to improve prediction accuracy.
  • the prediction result for at least one partition includes: the predicted value of the corresponding pixel of at least one partition.
  • the prediction result of at least one partition includes the predicted value of the corresponding pixel of at least one partition, which means that the prediction result of at least one partition only includes the pixel value that it actually covers, and the uncovered area can be invalid value (e.g., filled with 0 or undefined).
  • the prediction results of at least one partition can be directly spliced together to determine or obtain the prediction result of the current block.
  • the prediction results of at least one partition can be directly stitched together, and the boundary of the stitched part can be fused to determine or obtain the prediction result of the current block.
  • the prediction results of at least one partition can be fused by weighting according to the first fusion weight to determine or obtain the prediction result of the current block.
  • the first fusion weight may include at least one of the following: weight coefficients, weight vectors, and weight matrices.
  • the weight coefficient can be a scalar value, representing the weight of a single prediction result.
  • the weight vector can be a one-dimensional array containing multiple weight coefficients, each coefficient corresponding to the prediction result of a partition.
  • the prediction results of a partition include results P1 , P2 , and P3
  • the weight matrix can be a two-dimensional array, where each element represents the weight coefficient of a pixel at a specific location. It is typically the same size as the current block.
  • the prediction results for a partition include results P1 and P2 , both of which include the predicted values for each pixel in the current block.
  • c is a bias term, and optionally, c equals 0.
  • the value of k above is 1 to N, and the values of i and j above are integers greater than 0.
  • the first fusion weight can be determined or obtained by the current block partitioning method.
  • a first fusion weight for the current block can be pre-set in the storage unit of the encoder and/or decoder.
  • the first fusion weight corresponds to a pixel in at least one partition of the current block.
  • the weight value of the first fusion weight is set according to the distance between the pixel in the at least one partition and the dividing line adjacent to the at least one partition.
  • the first fusion weight includes a weight associated with the prediction results of at least one partition and/or at least one partition.
  • the first fusion weight includes a weight 1 associated with the prediction results of the first partition and/or the first partition, and a weight 2 associated with the prediction results of the second partition and/or the second partition.
  • the sum of weight 1 and weight 2 is a preset threshold, which is 1, 8, 16, or other numbers that are multiples of 2.
  • At least one partition is predicted based on a suitable prediction pattern matched for at least one partition of the current block, and the prediction result of at least one partition is determined or obtained to improve the prediction accuracy for local areas of the current block (e.g., the area corresponding to the partition). Then, based on the prediction result of at least one partition, the prediction result of the current block is determined or obtained, thereby supporting the improvement of the prediction accuracy of the current block.
  • Method A2 determines or obtains the prediction result of the current block based on the prediction mode of at least one partition and the partitioning method of the current block.
  • the current block is predicted according to the prediction mode of at least one partition to determine or obtain at least one first prediction result of the current block, and a second fusion weight is determined or obtained according to the partitioning method of the current block. Based on the at least one first prediction result and the second fusion weight, the prediction result of the current block is determined or obtained.
  • the second fusion weight may include at least one of the following: weight coefficients, weight vectors, and weight matrices.
  • the weight coefficient can be a scalar value that represents the weight of a single prediction result.
  • the first prediction result includes result Pa and result Pb
  • the weight coefficients corresponding to result Pa and result Pb are Wa and Wb , respectively.
  • the weight vector can be a one-dimensional array containing multiple weight coefficients, each corresponding to a first prediction result.
  • the predicted block P0 of the current block can then be represented as:
  • the weight matrix can be a two-dimensional array, where each element represents the weight coefficient of a pixel at a specific location. It is typically the same size as the current block.
  • the first prediction result includes result Pa and result Pb , both of which include the predicted value for each pixel in the current block.
  • c is a bias term, and optionally, c equals 0.
  • the value of k above is 1 to N, and the values of i and j above are integers greater than 0.
  • the second fusion weight is determined or obtained according to the current block division method, and the second fusion weight may be the same as or different from the first fusion weight.
  • the second fusion weight includes a weight associated with at least one first prediction result.
  • the first prediction result includes result A and result B.
  • the second fusion weight includes weight A associated with result A and weight B associated with result B.
  • the sum of weight A and weight B is a preset threshold, which can be 1, 8, 16, or other numbers that are multiples of 2.
  • the current block is predicted based on a suitable prediction pattern matched for at least one partition of the current block, and at least one first prediction result of the current block is determined or obtained. Since the accuracy of the at least one first prediction result is higher for the corresponding part of the partition associated with it in the current block, the at least one first prediction result can be fused by the second fusion weight determined or obtained by the partitioning method of the current block to determine or obtain the prediction result of the current block, thereby supporting the improvement of the prediction accuracy of the current block.
  • the encoder can receive video data input from a video source, such as receiving video images from the video source, determining the image to be predicted in the video images, dividing the image to be predicted into at least one image block, and using the temporal and/or spatial correlation between video images, performing prediction processing on each of the at least one image block, including intra-frame prediction processing and/or inter-frame prediction processing.
  • the intra-frame prediction processing and/or inter-frame prediction processing include at least one derivation mode of prediction mode and/or at least one prediction mode.
  • the encoder uses, for example, rate-distortion cost to determine the prediction mode finally adopted by each of the at least one image block.
  • the prediction mode or combination of prediction modes corresponding to the minimum rate-distortion cost is the prediction mode finally adopted by the image block.
  • the prediction mode of at least one partition of the current block can be determined or obtained based on at least one reference region.
  • prediction processing is performed on at least one partition and/or the current block using the at least one prediction mode to determine or obtain the prediction block (i.e., prediction result) of the image block to be predicted.
  • a residual block between the predicted block and the current block can be calculated.
  • the residual block can be transformed and quantized, and then encoded by an entropy encoder to form an encoded bit stream.
  • the encoded bitstream may include prediction parameters corresponding to a defined prediction mode and related side information.
  • the prediction parameters are entropy-encoded and then packed into the encoded bitstream.
  • the prediction parameters include indication information of the prediction mode.
  • the transformed and quantized residual block can be added to the corresponding prediction data (such as the prediction block) obtained using the prediction mode after inverse quantization and inverse transformation to obtain the reconstruction block.
  • the loop filtering module After obtaining the reconstruction block, the loop filtering module performs loop filtering on the reconstruction block according to the filter control parameters to reduce distortion.
  • the reconstructed block after loop filtering is stored according to the encoded image buffer.
  • the decoder's entropy decoding unit parses and decodes the encoded bitstream to obtain transform coefficients.
  • the decoder's inverse transform unit and inverse quantization unit perform inverse transform and inverse quantization processing on the transform coefficients to obtain residual blocks.
  • the decoder's entropy decoding unit parses and decodes the encoded bitstream to obtain prediction data, such as prediction parameters and related auxiliary information.
  • the decoder's prediction processing unit performs prediction processing using prediction parameters to determine the prediction block corresponding to the residual block.
  • the prediction processing includes intra-frame prediction processing and/or inter-frame prediction processing
  • the intra-frame prediction processing and/or inter-frame prediction processing includes a combination of at least one derivation mode and/or at least one prediction mode.
  • the processing method includes: determining or obtaining a prediction pattern for at least one partition of the current block based on at least one reference region.
  • prediction processing is performed on the image block to be predicted and/or at least one partition according to at least one prediction mode to determine or obtain the prediction block of the image block to be predicted.
  • the obtained residual block and the corresponding prediction block (including the predicted luminance block and the predicted chrominance block) are added together to obtain the reconstructed block.
  • the loop filtering unit of the decoder performs loop filtering processing on the reconstructed block to reduce distortion and improve video quality.
  • the processing method further includes: the reconstructed blocks after loop filtering are further combined into a decoded image and stored in a decoded image buffer or output as a decoded video signal.
  • the initially obtained prediction value can be the prediction value obtained in the corresponding prediction mode, which can be directly used in the rate-distortion cost process.
  • the initially obtained prediction value can be the prediction value obtained through the prediction mode corresponding to the block to be predicted (i.e., the image block located at the decoding end) indicated by the syntax elements parsed in the bitstream.
  • the predicted block can be used as the target image block, the residual block between the target image block and the current block can be calculated, and then encoded by an entropy encoder through transformation and quantization to form an encoded bitstream.
  • the predicted block can be processed accordingly, for example, by using other models, and the processed image block can be used as the target image block, and the step of calculating the residual block between the target image block and the current block can be performed.
  • a suitable prediction mode can be matched for at least one partition of the current block.
  • At least one partition can independently select the matching prediction mode, avoiding the limitations of the global unified mode of the current block, thereby supporting the improvement of the prediction accuracy for local regions of the current block (e.g., the region corresponding to the partition), thereby supporting the improvement of the prediction accuracy of the current block determined or obtained based on the prediction results of local regions.
  • the prediction mode of at least one partition is determined or obtained according to at least one of the following methods one to five:
  • step S10 includes: determining or obtaining the prediction mode of at least one partition based on the sub-reference area.
  • a prediction pattern for at least one partition is determined or obtained based on a sub-reference region within at least one reference region.
  • a sub-reference region is at least a portion of the reference regions of at least one reference region of the current block.
  • the sub-reference region is associated with at least one partition of the current block.
  • the current block includes partition A and partition B, and the corresponding reference regions of the current block include sub-reference region A and sub-reference region B.
  • Sub-reference region A is associated with partition A
  • sub-reference region B is associated with partition B.
  • At least one partition may be associated with one or more sub-reference areas.
  • the sub-reference regions associated with one partition of the current block do not overlap with or coincide with the sub-reference regions associated with other partitions of the current block.
  • the non-overlapping or non-coincidental regions can mean that the pixels contained in the sub-reference regions associated with one partition are completely different from the pixels contained in the sub-reference regions associated with other partitions, or that there are no identical pixels. For example, each pixel in the reference region of the current block is only classified into a single sub-reference region associated with a single partition.
  • the current block includes two partitions: partition A and partition B.
  • the sub-reference regions include one sub-reference region A and two sub-reference regions B.
  • Partition A is associated with sub-reference region A
  • partition B is associated with the two sub-reference regions B.
  • Sub-reference region A and the two sub-reference regions B do not overlap or coincide.
  • the sub-reference region can focus on local content in the reference region that is related to at least one partition, and/or remove background or interference regions in the reference region that are unrelated to at least one partition, so that the sub-reference region has a stronger correlation with the partition than the reference region of the current block, thereby matching a prediction pattern that is more suitable for at least one partition and improving the prediction accuracy for local regions of the current block.
  • the sub-reference region is determined or obtained based on the current block's partitioning method.
  • the current block's partitioning method is determined or obtained based on at least one geometric partitioning pattern and/or an index obtained from the bitstream.
  • the current block may have only one dividing line.
  • At least one reference region of the current block is partitioned to determine or obtain at least one sub-reference region.
  • the dividing line of the reference region is determined or obtained, and at least one reference region of the current block is partitioned based on the dividing line of the reference region to determine or obtain at least one sub-reference region.
  • the dividing line corresponding to the current block division method can be extended to determine or obtain the dividing line of the reference area.
  • At least one partition and at least one sub-reference region associated with the current block can be determined or obtained based on the current block division method.
  • pixels covering the dividing line do not belong to any sub-reference region of the reference region.
  • each of the two partitions and its associated sub-reference area are located on the same side of the dividing line corresponding to the partitioning method of the current block.
  • At least one partition may be associated with one or more sub-reference areas.
  • the current block includes two partitions, then at least one partition of each of the two partitions and one or more associated sub-reference regions are located on the same side of the dividing line corresponding to the partitioning method of the current block.
  • the sub-reference area corresponding to the first partition of at least one of the two partitions is located on one side of the dividing line corresponding to the partitioning method of the current block, and the sub-reference area corresponding to the second partition of at least one partition is located on the other side of the dividing line corresponding to the partitioning method of the current block.
  • the dividing line is determined or obtained according to the current block's partitioning method.
  • the current block is divided into two partitions according to the dividing line, including partition A and partition B.
  • the reference area of the current block is divided into multiple sub-reference areas according to the dividing line, including one sub-reference area A and two sub-reference areas B.
  • Partition A and its associated sub-reference area A are located on one side of the dividing line (e.g., the upper left of the dividing line), while partition B and its two associated sub-reference areas B are located on the other side of the dividing line (e.g., the lower right of the dividing line).
  • a partition gradient histogram corresponding to at least one partition is determined or obtained, and based on the partition gradient histogram, a prediction mode for at least one partition is determined or obtained.
  • a partition gradient histogram associated with at least one partition can be obtained.
  • the partition gradient histogram can reflect the texture directionality of the partition, thereby matching a suitable prediction pattern for the partition.
  • the gradient information includes gradient direction and/or gradient magnitude.
  • the gradient direction represents the direction in which the gray value changes the fastest at a pixel in the image (e.g., at least one reference region), i.e., the direction perpendicular to the edge.
  • the gradient magnitude represents the intensity of the gray value change at that pixel, i.e., the salience of the edge.
  • gradient information of a sub-reference region is determined or obtained based on at least one gradient operator and at least one partition-related sub-reference region.
  • a gradient operator is a tool and/or method for determining or obtaining at least one gradient information, capable of extracting gradient information from an image through convolution operations or other mathematical operations.
  • the gradient information includes: gradient direction and/or gradient magnitude.
  • At least one gradient operator includes at least one pair of mutually perpendicular gradient operators.
  • the first pair of mutually perpendicular gradient operators includes a 0° gradient operator and a 90° gradient operator.
  • the horizontal gradient Gx and vertical gradient Gy can be calculated using a 3 ⁇ 3 horizontal (0°) Sober operator and a vertical (90°) Sober operator.
  • the horizontal (0°) gradient Gx and vertical (90°) gradient Gy for a pixel x4 in a pixel line can be calculated according to the following formulas (I) and (II).
  • A can be a matrix consisting of 9 pixels centered at pixel x4, including the pixel x1 above it, the pixel x3 to its left, the pixel x7 below it, the pixel x5 to its right, the pixel x0 at its top left, the pixel x6 at its bottom left, the pixel x2 at its top right, and the pixel x8 at its bottom right, as shown in Formula (III) below:
  • the magnitude of gradient G is the sum of the absolute values of the horizontal and vertical gradients, and its calculation formula is shown in formula (iv):
  • the gradient direction of a pixel can be calculated using arctan(Gx/Gy) or arctan(Gy/Gx).
  • the gradient information of the sub-reference region includes: the gradient information of each pixel in the sub-reference region, wherein the gradient information of a pixel is the gradient direction and/or gradient magnitude calculated independently for each pixel in the reference region, reflecting the local change characteristics of that point.
  • the gradient information of the sub-reference region includes: the overall gradient information of the sub-reference region, which is the statistical and/or aggregated gradient information of all pixels in the sub-reference region, reflecting the global change trend of the region.
  • the gradient information of the sub-reference region includes: pixel gradient information and/or overall gradient information.
  • the gradient information of a pixel includes: a first pixel gradient component, a second pixel gradient component, a pixel gradient direction, and/or a pixel gradient magnitude.
  • gradient information of at least one pixel in the sub-reference region is determined or obtained based on at least one pair of mutually perpendicular gradient operators.
  • the pair of mutually perpendicular gradient operators includes a first gradient operator (e.g., a horizontal gradient operator Gx) and a second gradient operator (e.g., a vertical gradient operator Gy) corresponding to different directions.
  • the value determined or obtained based on the first gradient operator is the gradient component of the first pixel (e.g., the value of Gx), and the value determined or obtained based on the second gradient operator is the gradient component of the second pixel (e.g., the value of Gy).
  • the pixel gradient direction and/or pixel gradient magnitude can be determined or obtained based on the first pixel gradient component and the second pixel gradient component.
  • the gradient information includes: a first gradient component (e.g., a first pixel gradient component and/or a first global gradient component), a second gradient component (e.g., a second pixel gradient component and/or a second global gradient component), a gradient direction (e.g., a pixel gradient direction and/or a global gradient direction), and/or a gradient magnitude (e.g., a pixel gradient magnitude and/or a global gradient magnitude).
  • a first gradient component e.g., a first pixel gradient component and/or a first global gradient component
  • a second gradient component e.g., a second pixel gradient component and/or a second global gradient component
  • a gradient direction e.g., a pixel gradient direction and/or a global gradient direction
  • a gradient magnitude e.g., a pixel gradient magnitude and/or a global gradient magnitude
  • the overall gradient information includes: a first overall gradient component, a second overall gradient component, an overall gradient direction, and/or an overall gradient magnitude.
  • the determination or acquisition of the overall gradient information of the sub-reference region includes: determining or acquiring the gradient information of at least one pixel in the sub-reference region, wherein the gradient information of at least one pixel includes: a first pixel gradient component and a second pixel gradient component; determining or acquiring a first overall gradient component based on the sum of the first pixel gradient components corresponding to the sub-reference region; determining or acquiring a second overall gradient component based on the sum of the second pixel gradient components corresponding to the sub-reference region; determining or acquiring the overall gradient magnitude based on the sum of the absolute values of the first overall gradient component and the second overall gradient component; and determining or acquiring the overall gradient direction based on the first overall gradient component and the second overall gradient component.
  • the summation can be performed directly in the above manner to preserve the directional statistical properties, and the synthesized result can represent the overall gradient vector.
  • the gradient information of at least one pixel in the sub-reference region is determined or obtained, including: first pixel gradient components ( Gx1 , Gx2 , ..., Gxn ) and second pixel gradient components ( Gy1 , Gy2 , ..., Gyn ).
  • the overall gradient direction is calculated by arctan( Gxsum / Gysum ) or arctan( Gysum / Gxsum ).
  • the determination or acquisition of the overall gradient information of the sub-reference region includes: determining or acquiring the gradient information of at least one pixel in the sub-reference region, including: a first pixel gradient component, a second pixel gradient component, a pixel gradient direction, and a pixel gradient magnitude; determining or acquiring the overall gradient magnitude based on the sum of the absolute values of the first pixel gradient component and the second pixel gradient component corresponding to the sub-reference region, and/or, the sum of the absolute values of the first pixel gradient component and the second pixel gradient component corresponding to the sub-reference region, and the number of non-zero pixel gradient magnitudes corresponding to the pixel gradient direction in the sub-reference region; determining or acquiring the first overall gradient component based on the sum of the first pixel gradient components corresponding to the sub-reference region; determining or acquiring the second overall gradient component based on the sum of the second pixel gradient components corresponding to the sub-reference region; and determining or acquiring the overall gradient direction
  • the gradient information of at least one pixel in the sub-reference region is determined or obtained, including: the first pixel gradient components (Gx1, Gx2, ... Gxn) and the second pixel gradient components (Gy1, Gy2, ... Gyn), the pixel gradient direction, and the pixel gradient magnitude.
  • the overall gradient magnitude AMP sum (
  • n is the number of non-zero pixel gradient magnitudes in the pixel gradient directions of the sub-reference region. For example, if there are 10 non-zero pixel gradient magnitudes in the pixel gradient directions of the sub-reference region, then n is 10.
  • the first overall gradient component is determined or obtained, i.e., the first overall gradient component.
  • Gx sum Gx 1 + Gx 2 + ... + Gx n .
  • the overall gradient direction is calculated by arctan(Gx sum / Gy sum ) or arctan(Gy sum / Gx sum ).
  • the average absolute value can be obtained through the above method, which can resist directional interference and stably measure the gradient strength.
  • the overall gradient information of a sub-reference region is determined or obtained based on the sum of the absolute values of the first and second pixel gradient components corresponding to the sub-reference region
  • the overall gradient information is directly fused with the gradient information of the corresponding pixel in the sub-reference region
  • the overall gradient magnitude corresponding to the overall gradient information in the determined or obtained partition gradient histogram will be the maximum magnitude in the histogram, thereby interfering with the selection of the prediction mode for the partition.
  • the partition gradient histogram can be determined or obtained based on the overall gradient information, the weight information corresponding to the overall gradient magnitude, and the gradient information of at least one pixel in the sub-reference region, thereby ensuring fair competition of gradient information, balancing the consistency requirements of intensity and direction, and/or, the prediction mode corresponding to the overall gradient direction in the overall gradient information is determined as mode 1, the partition gradient histogram is determined or obtained based on the gradient information of at least one pixel in the sub-reference region, at least one mode 2 is determined or obtained based on the partition gradient histogram, and both mode 1 and at least one mode 2 are determined as the prediction modes for the partition.
  • the overall gradient information includes the overall gradient direction and the overall gradient magnitude.
  • a partition gradient histogram 1 is determined or obtained.
  • the gradient magnitude corresponding to the direction that is the same as the overall gradient direction in the partition gradient histogram 1 is replaced with the overall gradient magnitude to determine or obtain a partition gradient histogram 2.
  • at least one prediction mode is determined or obtained.
  • the prediction modes include: prediction modes corresponding to overall gradient information, prediction modes determined or obtained based on partitioned gradient histograms, and/or non-angular prediction modes.
  • the prediction mode determined or obtained based on the partitioned gradient histogram includes the prediction mode corresponding to the overall gradient information
  • the weight information corresponding to at least one prediction mode is determined or obtained based on the weight information corresponding to the prediction mode corresponding to the overall gradient information.
  • the prediction modes include: the prediction mode corresponding to the overall gradient information, the prediction mode determined or obtained based on the partitioned gradient histogram, and/or the non-angle prediction mode.
  • a prediction mode is determined to be a partitioned prediction mode
  • the weight information corresponding to it when it is used as a prediction mode can be determined or obtained based on the weight information corresponding to the prediction mode.
  • the weight information corresponding to the prediction mode is determined to be the weight information corresponding to the prediction mode when it is used as a prediction mode.
  • the weight information corresponding to the prediction mode may be the same as or different from the weight information corresponding to the prediction mode when it is determined as the prediction mode.
  • the predicted modes determined or obtained based on the gradient information of at least one pixel in the sub-reference region and the partitioned gradient histogram include: mode a1, mode a2, and mode a3.
  • the weights of each of modes a1, a2, and a3 can be determined based on the sum of their respective gradient magnitudes in the partitioned gradient histogram. For example, based on the sum of their respective gradient magnitudes in the partitioned gradient histogram, the weights of modes a1, a2, and a3 are 0.4, respectively.
  • Mode a1 is the predicted mode corresponding to the overall gradient information. Based on the weight of mode a1 (0.4), the weights of modes a2 and a3 are adjusted.
  • the weight value of mode a1 can be modified from the weight obtained by the sum of the gradient magnitudes of each corresponding mode in the partition gradient histogram to the fixed weight corresponding to the overall gradient information.
  • the value of the fixed weight is a preset value. Based on the fixed weight and the sum of the gradient magnitudes of mode a2 and mode a3 in the partition gradient histogram, the weights of mode a2 and mode a3 are determined.
  • the weight of mode a2 is 0.2 and the weight of mode a3 is 0.2.
  • the prediction mode includes: a prediction mode determined or obtained based on the partition gradient histogram and a planar mode.
  • the prediction mode determined or obtained based on the partition gradient histogram includes the prediction mode corresponding to the overall gradient information.
  • the prediction mode determined or obtained based on the gradient information of at least one pixel in the sub-reference region includes: mode a1, mode a2 and mode a3.
  • Mode a1 is the prediction mode corresponding to the overall gradient information.
  • a fixed weight is used for the prediction mode corresponding to the overall gradient information. For example, the fixed weight is equal to 0.2.
  • the planar mode uses a fixed weight of 0.3.
  • the weights of mode a2 and mode a3 are determined by the sum of the gradient magnitudes corresponding to mode a2 and mode a3 in the partition gradient histogram. If the sum of the gradient magnitudes of mode a2 is 20 and the sum of the gradient magnitudes of mode a3 is 30, the weight of mode a2 is 0.2 and the weight of mode a3 is 0.3.
  • Wa2 is the weight of pattern a2
  • Wa1 is the weight of pattern a1
  • AMP a2 is the sum of the gradient magnitudes of pattern a2
  • AMP a3 is the sum of the gradient magnitudes of pattern a3.
  • Wa2 is the weight of pattern a2
  • Wa1 is the weight of pattern a1
  • AMP a2 is the sum of the gradient magnitudes of pattern a2
  • AMP a3 is the sum of the gradient magnitudes of pattern a3.
  • the prediction mode includes: a prediction mode determined or obtained based on the partitioned gradient histogram and a planar mode.
  • the prediction mode determined or obtained based on the partitioned gradient histogram does not include the prediction mode corresponding to the overall gradient information.
  • a fixed weight is used for the prediction mode corresponding to the overall gradient information, for example, a fixed weight of 0.2.
  • a fixed weight of 0.3 is used for the planar mode. Based on this, the weights of mode a2 and mode a3 are determined by the sum of the gradient magnitudes corresponding to mode a2 and mode a3 in the partitioned gradient histogram.
  • the weight of mode a2 is 0.2 and the weight of mode a3 is 0.3.
  • the weights corresponding to mode a2 and mode a3 can be determined or obtained by the above formulas (v) and (vi).
  • the determined or obtained partition gradient histogram can take into account both local details and global structure.
  • at least one prediction mode determined or obtained based on the partition gradient histogram can match the content of the partition, thereby improving the prediction accuracy of the prediction mode determined or obtained based on the prediction mode for the partition.
  • a partition gradient histogram is built based on the gradient information of the sub-reference region associated with the first partition, and used to determine the intra-prediction mode of the first partition; and/or, if the second partition of the current block adopts the inter-prediction mode or the intra-block copy prediction mode, no partition gradient histogram is built.
  • the adjusted first gradient information of pixels in the sub-reference region is determined or obtained; based on the adjusted first gradient information of pixels in the sub-reference region, the gradient histogram of the sub-reference region related to at least one partition is determined or obtained; and based on the gradient histogram of the sub-reference region related to at least one partition, the prediction mode of at least one partition is determined or obtained.
  • the second weight information corresponds to the pixels in the sub-reference region.
  • the second weight information includes the weight corresponding to at least one pixel in the sub-reference region.
  • the second weight information is determined or obtained based on the distance between at least one pixel in the sub-reference region and the dividing line corresponding to the current block's division method.
  • the second weight information can be used to adjust the gradient magnitude in the gradient information, and optionally, the second weight information is ⁇ 1.
  • the second weight information and the distance between the pixel and the dividing line corresponding to the current block's division method are directly proportional and/or positively correlated. If the distance between the pixel in the sub-reference area and the dividing line corresponding to the current block's division method is closer, the weight value corresponding to that pixel is smaller; and/or, if the distance between the pixel in the sub-reference area and the dividing line corresponding to the current block's division method is farther, the weight value corresponding to that pixel is larger.
  • the second weight information can suppress boundary interference (e.g., pixels near the dividing line in the sub-reference region) and highlight the features inside the region, thereby supporting the improvement of the prediction accuracy of the prediction mode of the partition determined or obtained based on the adjusted first gradient information.
  • boundary interference e.g., pixels near the dividing line in the sub-reference region
  • the adjusted second gradient information of the sub-reference region is determined or obtained, and based on the adjusted second gradient information of the sub-reference region, the prediction mode of at least one partition is determined or obtained.
  • target gradient information of at least one sub-reference region related to the partition is determined, the target gradient information is adjusted according to the third weight information, the adjusted second gradient information of the sub-reference region is determined or obtained, and the prediction mode of at least one partition is determined or obtained based on the adjusted second gradient information of the sub-reference region.
  • the target gradient information is determined or obtained based on the gradient direction corresponding to the current block partitioning method and the gradient magnitude of that gradient direction, and/or the target gradient information is determined or obtained based on the gradient direction perpendicular to the gradient direction corresponding to the current block partitioning method and the gradient magnitude of that gradient direction.
  • the gradient direction and gradient magnitude corresponding to the current block partitioning method, and/or the gradient direction perpendicular to the current block partitioning method and the gradient magnitude of the perpendicular gradient direction are determined as target gradient information.
  • the third weight information is a preset value.
  • the adjusted second gradient information includes: gradient direction is 10°, and gradient magnitude is 55.
  • the gradient information of at least one partition-related sub-reference region includes at least one of the following: gradient information of pixels in at least one partition-related sub-reference region, and gradient information of the gradient histogram of at least one partition-related sub-reference region.
  • the gradient information of the sub-reference region related to at least one partition is the gradient information of the pixels in the sub-reference region related to at least one partition
  • the gradient histogram of the sub-reference region related to at least one partition is determined or obtained according to the adjusted second gradient information, and at least one prediction mode of the current block is determined or obtained according to the gradient histogram of the sub-reference region related to at least one partition.
  • the adjusted gradient histogram of the sub-reference region related to at least one partition is determined or obtained based on the adjusted gradient histogram of the sub-reference region related to at least one partition, and at least one prediction mode of the current block is determined or obtained based on the adjusted gradient histogram of the sub-reference region related to at least one partition.
  • the third weight information corresponds to the sub-reference region, and the third weight information includes the weight corresponding to at least one pixel in the sub-reference region.
  • the third weight information corresponds to the sub-reference region, and the third weight information includes the weight corresponding to at least one gradient direction in the gradient histogram of the sub-reference region.
  • At least one gradient direction includes: a first gradient direction corresponding to the current block partitioning method, a second gradient direction perpendicular to the gradient direction corresponding to the current block partitioning method, and a third gradient direction within an angle difference range from the first gradient direction and/or the second gradient direction.
  • At least one pixel includes: a pixel in the sub-reference region having a gradient direction corresponding to the partitioning method of the current block.
  • the number of gradient information for the sub-reference regions associated with at least one partition can be multiple.
  • the number of gradient information for the sub-reference regions related to at least one partition is multiple, then the number of third weight information is also multiple.
  • At least one third weighting information is determined or obtained based on the angle difference between the gradient direction of at least one pixel in the sub-reference region and the direction of the dividing line corresponding to the current block division method.
  • the angle difference corresponds to a preset angle.
  • the third weight information can be used to adjust the gradient magnitude in the gradient information.
  • the weight value corresponding to that pixel in the third weight information is set as weight value a. If the angle difference between the gradient direction of a pixel in the sub-reference region and the direction of the dividing line corresponding to the current block division method is not 0° (e.g., parallel) or 90° (e.g., perpendicular), then the weight value corresponding to that pixel in the third weight information is set as weight value b.
  • the weight value a and the weight value b may be the same or different.
  • both weight value a and weight value b are greater than 1.
  • weight a is 1.1 and weight b is 1.2.
  • the weight information of the third gradient direction which is within an angular difference range from the first gradient direction and/or the second gradient direction, is determined or obtained based on the angular difference between the third gradient direction and the first gradient direction and/or the second gradient direction.
  • the selected current block partitioning method is similar to the texture of the current block
  • the first gradient direction corresponding to the current block partitioning method, the second gradient direction perpendicular to the gradient direction corresponding to the current block partitioning method, and the third gradient direction similar to the first gradient direction and/or the second gradient direction have a relatively higher matching degree with the current block compared to other gradient directions. Therefore, the gradient magnitude corresponding to the first gradient direction, the second gradient direction, and/or the third gradient direction can be enhanced by the third weight information, thereby increasing the probability that the prediction mode corresponding to the above gradient directions is selected to perform prediction processing on the current block.
  • the third gradient direction includes a gradient direction that is within a preset angle difference range from the first gradient direction and/or the second gradient direction.
  • the preset angle difference range includes: [-5°, 5°].
  • the adjusted gradient information of the sub-reference region is determined or obtained based on the gradient information of the sub-reference region related to at least one partition, as well as the second weight information and/or the third weight information, and the prediction mode of at least one partition is determined or obtained based on the adjusted gradient information of the sub-reference region.
  • a partition gradient histogram is determined or obtained based on the adjusted gradient information, adjusted first gradient information and/or adjusted second gradient information of at least one partition-related sub-reference region, and the prediction mode of at least one partition is determined or obtained based on the partition gradient histogram.
  • the sub-reference region can focus on local content in the reference region that is related to at least one partition, and/or remove background or interference regions in the reference region that are unrelated to at least one partition, so that the sub-reference region has a stronger correlation with the partition than the reference region of the current block, thereby matching a prediction pattern that is more suitable for at least one partition and improving the prediction accuracy for local regions of the current block.
  • step S10 includes: determining or obtaining the prediction mode of at least one partition of the current block based on the first weight information and at least one reference region.
  • the first weight information corresponds to at least one partition and/or at least one reference region.
  • the first weight information includes the weight of at least one pixel in at least one reference region; alternatively, the first weight information includes the weight of each pixel in at least one reference region.
  • the first weight information can be used to adjust the gradient magnitude in the gradient information, for example, to adjust the gradient magnitude of at least one pixel in at least one reference region.
  • the sum of the first weight information corresponding to each partition included in the current block is a predetermined threshold, for example, the predetermined threshold is 1, 8, 16 or other numbers that are multiples of 2.
  • the sum of the weight values of the same pixel in the first weight information corresponding to each partition of the current block is a certain threshold.
  • the predetermined threshold is 1.
  • the current block includes partition A and partition B.
  • the weight value of pixel X in the first weight information corresponding to partition A is a
  • the weight value of pixel X in the first weight information corresponding to partition B is b
  • a+b 1.
  • the current block includes partition A and partition B.
  • Figure 11 shows the first weight information corresponding to partition A
  • Figure 12 shows the first weight information corresponding to partition B.
  • the first weight information includes the weight of each pixel in the reference region of the current block.
  • the weight value of pixel X in the first weight information corresponding to partition A is 1
  • the weight value of pixel X in the first weight information corresponding to partition B is 0.
  • the partition gradient histogram of at least one partition of the current block is determined or obtained, and the prediction mode of at least one partition of the current block is determined or obtained based on the partition gradient histogram of at least one partition.
  • the adjusted gradient information of at least one reference region associated with at least one partition is determined or obtained; based on the adjusted gradient information of at least one reference region associated with at least one partition, the partition gradient histogram of at least one partition of the current block is determined or obtained; and based on the partition gradient histogram of at least one partition, the prediction mode of at least one partition of the current block is determined or obtained.
  • the partition gradient histogram of at least one partition of the current block is determined or obtained.
  • the current block includes: partition A and partition B.
  • the first weight information includes: first weight information A corresponding to partition A and first weight information B corresponding to partition B.
  • the pre-adjustment gradient information of at least one reference region of the current block is determined or obtained.
  • the gradient magnitude in the pre-adjustment gradient information of the at least one reference region is adjusted to determine or obtain the post-adjustment gradient information A of the at least one reference region associated with partition A.
  • the gradient magnitude in the pre-adjustment gradient information of the at least one reference region is adjusted to determine or obtain the post-adjustment gradient information B of the at least one reference region associated with partition B.
  • the partition gradient histogram A is determined or obtained. Based on the post-adjustment gradient information B of the at least one reference region, the partition gradient histogram B is determined or obtained. Based on the gradient histogram A, the prediction mode of partition A is determined or obtained. Based on the gradient histogram B, the prediction mode of partition B is determined or obtained.
  • the first weight information is determined or obtained based on the current block partitioning method.
  • the current block partitioning method is determined or obtained based on at least one geometric partitioning pattern and/or an index obtained from the bitstream.
  • the first weight information includes the weight of at least one pixel in at least one reference region, and the weight of the at least one pixel is determined or obtained based on the distance between the at least one pixel and the dividing line corresponding to the current block division method.
  • the pixels on the same side of the dividing line corresponding to the partition in the current block division method have a weight that is directly proportional to and/or positively correlated with the distance between the pixel and the dividing line. For example, the closer the pixel is to the dividing line, the smaller the weight; and/or, the farther the pixel is from the dividing line, the larger the weight.
  • the weight of the pixel is inversely proportional to and/or negatively correlated with the distance between the pixel and the dividing line. For example, the closer the pixel is to the dividing line, the greater the weight; and/or, the farther the pixel is from the dividing line, the smaller the weight.
  • pixels in the first weight information corresponding to a partition whose distance from the dividing line corresponding to the current block's partitioning method is less than a preset distance threshold are assigned a weight of weight one (e.g., weight one is 0.5).
  • Pixels in the first weight information corresponding to a partition whose distance from the dividing line corresponding to the current block's partitioning method is greater than or equal to the preset distance threshold are assigned a weight of weight two (e.g., weight two is 1) if the pixel and the partition are on the same side of the dividing line, and a weight of weight three (e.g., weight three is 0) if the pixel and the partition are on different sides of the dividing line.
  • the current block includes partition A and partition B.
  • Figure 11 shows the first weight information corresponding to partition A
  • Figure 12 shows the first weight information corresponding to partition B.
  • the first weight information includes the weight of each pixel in the reference area of the current block.
  • pixels whose distance from the dividing line is less than a preset distance threshold have a weight of 0.5.
  • Pixels whose distance from the dividing line is greater than or equal to the preset threshold have a weight of 1 for pixels on the same side of the dividing line as partition A in Figure 11 and a weight of 0 for pixels on different sides.
  • pixels on the same side of the dividing line as partition B have a weight of 1 for pixels on different sides.
  • the gradient contribution of pixels in at least one reference region of the current block to different partitions can be adjusted, the gradient information of pixels with stronger correlation to the partition can be retained or enhanced, and the gradient information of pixels with weaker correlation to the partition can be weakened or eliminated, thereby matching a prediction mode that is more suitable for at least one partition and improving the prediction accuracy for the local region of the current block.
  • Method 3 Gradient information from at least one reference region
  • step S10 includes: determining or obtaining the prediction mode of at least one partition of the current block based on the gradient information of at least one reference region.
  • the prediction mode of at least one partition of the current block is determined or obtained based on the gradient information of at least one reference region determined or obtained by at least one gradient operator.
  • the gradient information of the reference region includes: the gradient information of each pixel in the reference region, wherein the gradient information of a pixel is the gradient direction and/or gradient magnitude calculated independently for each pixel in the reference region, reflecting the local change characteristics of that point.
  • the adjusted third gradient information is determined or obtained; based on the adjusted third gradient information, the partition gradient histogram of at least one partition is determined or obtained; and based on the partition gradient histogram of at least one partition, at least one prediction mode is determined or obtained.
  • At least one sub-reference region related to the partition is determined or obtained; based on at least one gradient operator, gradient information of the sub-reference region related to the partition is determined or obtained; based on the gradient information of the sub-reference region related to the partition, a partition gradient histogram of at least one partition is determined or obtained; and based on the partition gradient histogram of at least one partition, at least one prediction mode is determined or obtained.
  • a suitable prediction mode can be matched for at least one partition of the current block.
  • At least one partition can independently select the matching prediction mode, avoiding the limitations of the global unified mode of the current block, thereby supporting the improvement of the prediction accuracy for local regions of the current block (e.g., the region corresponding to the partition), thereby supporting the improvement of the prediction accuracy of the current block determined or obtained based on the prediction results of local regions.
  • Method 4 At least one gradient operator
  • step S10 includes: determining or obtaining at least one prediction mode for the current block based on at least one reference region and at least one gradient operator.
  • gradient information of at least one reference region is determined or obtained based on at least one reference region and at least one gradient operator, and prediction mode of at least one partition of the current block is determined or obtained based on the gradient information of at least one reference region.
  • At least one sub-reference region related to the partition is determined or obtained; based on at least one gradient operator, gradient information of at least one sub-reference region is determined or obtained; based on the gradient information of the sub-reference region related to the partition, a partition gradient histogram of at least one partition is determined or obtained; and based on the partition gradient histogram of at least one partition, at least one prediction mode is determined or obtained.
  • At least one gradient operator includes at least one pair of mutually perpendicular gradient operators.
  • the first pair of mutually perpendicular gradient operators includes a 0° gradient operator and a 90° gradient operator.
  • the horizontal gradient Gx and vertical gradient Gy can be calculated using a 3 ⁇ 3 horizontal (0°) Sober operator and a vertical (90°) Sober operator.
  • the horizontal (0°) gradient Gx and vertical (90°) gradient Gy for a pixel x4 in a pixel line can be calculated according to the following formulas (I) and (II).
  • A can be a matrix consisting of 9 pixels centered at pixel x4, including the pixel x1 above it, the pixel x3 to its left, the pixel x7 below it, the pixel x5 to its right, the pixel x0 at its top left, the pixel x6 at its bottom left, the pixel x2 at its top right, and the pixel x8 at its bottom right, as shown in Formula (III) below:
  • the magnitude of gradient G is the sum of the absolute values of the horizontal and vertical gradients, and its calculation formula is shown in formula (iv):
  • the gradient direction of a pixel can be calculated using arctan(Gx/Gy) or arctan(Gy/Gx).
  • a suitable prediction mode can be matched for at least one partition.
  • At least one partition can independently select the matching prediction mode, avoiding the limitations of the global unified mode of the current block, thereby supporting the improvement of the prediction accuracy for the local region of the current block (e.g., the region corresponding to the partition), thereby supporting the improvement of the prediction accuracy of the current block determined or obtained based on the prediction results of the local region.
  • Method 5 At least one gradient histogram.
  • step S10 includes: determining or obtaining at least one gradient histogram based on at least one reference region, and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one gradient histogram.
  • the gradient histogram is determined or obtained based on gradient information of at least one partition-related sub-reference region.
  • the gradient histogram is determined or obtained based on gradient information from at least one reference region of the current block and first weight information.
  • the gradient histogram is determined or obtained based on at least one reference region of the current block and at least one gradient operator.
  • gradient information of at least one reference region is determined or obtained based on at least one reference region and at least one gradient operator; at least one gradient histogram is determined or obtained based on the gradient information of at least one reference region; and prediction mode of at least one partition of the current block is determined or obtained based on the at least one gradient histogram.
  • At least one partition-related sub-reference region is determined or obtained; based on at least one gradient operator, gradient information of at least one partition-related sub-reference region is determined or obtained; based on the gradient information of at least one partition-related sub-reference region, at least one gradient histogram (i.e., partition gradient histogram) is determined or obtained; and based on the at least one partition gradient histogram, the prediction mode of at least one partition is determined or obtained.
  • at least one gradient histogram i.e., partition gradient histogram
  • At least one partition is determined or obtained; based on the first weight information corresponding to the at least one partition and the gradient information of at least one reference region, at least one partition gradient histogram is determined or obtained; based on the at least one partition gradient histogram, at least one partition prediction mode is determined or obtained.
  • a gradient histogram is a statistical tool used to describe the gradient magnitude distribution of the current block in different directions. It calculates the gradient magnitude value of each pixel in at least one reference region and/or sub-reference region in the direction corresponding to the prediction mode in each frame, and statistically analyzes the distribution of the gradient magnitude values to obtain a histogram containing the gradient magnitude values corresponding to each prediction direction.
  • different prediction modes correspond to different prediction directions.
  • the vertical mode corresponds to the vertical direction
  • the horizontal mode corresponds to the horizontal direction
  • the diagonal mode corresponds to the diagonal direction.
  • Each prediction mode has a specific direction to describe its prediction direction.
  • the sum of the gradient magnitude values of each pixel in at least one reference region of the current block in that direction is calculated. This sum reflects the overall gradient strength of the current block in that prediction direction, while the gradient histogram records the sum of the gradient magnitude values corresponding to each prediction direction.
  • At least one prediction mode is determined or obtained.
  • the first preset condition may be whether the sum of gradient magnitudes is one of the sums of the N largest gradient magnitude values in the gradient histogram.
  • at least one prediction mode may be determined or obtained based on whether the sum of gradient magnitude values related to at least one prediction direction corresponding to the prediction mode contained in at least one gradient histogram is one of the sums of the N largest gradient magnitude values in the gradient histogram.
  • the sum of each gradient magnitude value in the gradient histogram is sorted in ascending or descending order to determine or obtain the sum of the first N gradient magnitude values in ascending order or the sum of the last N gradient magnitude values in descending order.
  • the prediction modes corresponding to the prediction directions whose sum of gradient magnitude values is in the top 3 are determined as the prediction modes of at least one partition.
  • the gradient magnitude values in the gradient histogram are compared to determine or obtain the sum of the N gradient magnitude values with the largest gradient magnitude in the gradient histogram. Based on the prediction mode corresponding to the sum of the N gradient magnitude values with the largest gradient magnitude, the prediction mode of at least one partition is determined or obtained.
  • the gradient histogram of at least one reference region with respect to the intra-prediction direction can be determined or obtained based on the gradient magnitude and gradient direction of the pixels in at least one reference region of the current block, the corresponding intra-prediction direction can be determined based on the gradient histogram, and the prediction mode of at least one partition can be determined or obtained.
  • processing method in the embodiments of this application can be DIMD mode and/or improved DIMD mode.
  • the processing steps of the DIMD mode, the processing steps of the improved DIMD mode, and/or the determination or acquisition method of the gradient histogram include: determining a reference template adjacent to the block to be predicted (the current block) above and to the left of the block to be predicted, i.e., three pixel lines/pixel rows/pixel columns on the left and above the block to be predicted; then taking a pixel in the middle line (e.g., pixel A) as the pixel for calculating the gradient; by calculating the gradient direction of at least one pixel in the middle line, as well as the magnitude of the horizontal and vertical gradients, the gradient direction of at least one pixel and the gradient magnitude value corresponding to that gradient can be obtained.
  • a reference template adjacent to the block to be predicted the current block
  • the left of the block to be predicted i.e., three pixel lines/pixel rows/pixel columns on the left and above the block to be predicted
  • a pixel in the middle line e.g., pixel A
  • the gradient magnitude value is the sum of the absolute values of the horizontal gradient and the vertical gradient. If the gradient magnitude values with the same gradient direction in at least one pixel are added together, the sum of the gradient magnitude values corresponding to that gradient direction can be obtained.
  • a histogram of gradient magnitude values for different gradient directions of at least one pixel can be constructed, and the prediction direction perpendicular to the gradient direction of the maximum gradient magnitude value can be used as the prediction direction of the intra-prediction mode and/or the prediction direction of the candidate mode for the current block.
  • the horizontal gradient Gx and vertical gradient Gy can be calculated using the 3x3 horizontal Sober operator and the vertical Sober operator.
  • the horizontal gradient Gx and vertical gradient Gy of a pixel x 4 in a pixel line can be calculated according to the following formulas (I) and (II).
  • A can be a matrix consisting of 9 pixels centered at pixel x4, including the pixel x1 above it, the pixel x3 to its left, the pixel x7 below it, the pixel x5 to its right, the pixel x0 at its top left, the pixel x6 at its bottom left, the pixel x2 at its top right, and the pixel x8 at its bottom right, as shown in Formula (III) below:
  • the magnitude of gradient G is the sum of the absolute values of the horizontal and vertical gradients, and its calculation formula is shown in formula (iv):
  • the gradient direction of a pixel can be calculated using arctan(Gx/Gy) or arctan(Gy/Gx).
  • each gradient direction corresponds to a specific gradient direction range
  • each gradient direction range corresponds to the prediction direction of an intra-frame prediction mode
  • the gradient magnitude values with the same gradient direction range in at least one pixel can be added together to obtain the sum of the gradient magnitude values corresponding to the gradient direction range.
  • the sum of the gradient magnitude values of the prediction direction of the corresponding intra-frame prediction mode can also be obtained.
  • the gradient magnitude values corresponding to the prediction direction of each intra-prediction mode are included.
  • the final selected intra-prediction mode is mode 30.
  • At least one candidate mode is determined or obtained based on at least one gradient histogram, and a prediction mode for at least one partition is determined or obtained based on the matching information of the at least one candidate mode with at least one reference region and/or sub-reference region.
  • matching information refers to information used to evaluate the degree of matching between different prediction modes and reference regions and their corresponding current blocks and/or sub-reference regions and their corresponding partitions.
  • Matching information can be based on various indicators, such as the rate-distortion cost of prediction results, prediction error, texture similarity, etc., to indicate the degree of matching between different prediction modes and reference regions.
  • the matching information includes: SAD, SATD and/or MRSAD.
  • the matching information includes: the gradient magnitude value or the sum of the corresponding gradient magnitude values corresponding to the predicted pattern in the gradient histogram.
  • the matching information includes: confidence information, wherein the higher the confidence level, the higher the degree of matching; and/or, the lower the confidence level, the lower the degree of matching.
  • At least one candidate mode is determined or obtained based on the prediction mode corresponding to the prediction direction that satisfies the first prediction condition in at least one gradient histogram, and at least one prediction mode is determined from the at least one candidate mode based on the matching information related to at least one reference region.
  • the gradient histogram can accurately capture the dominant prediction direction (such as vertical, horizontal or diagonal) associated with at least one reference region, thereby matching a suitable prediction pattern for at least one partition of the current block.
  • the gradient information (e.g., gradient information of the reference region and/or gradient information of the sub-reference region) includes first gradient information and/or second gradient information.
  • the candidate modes corresponding to the first gradient information and the candidate modes corresponding to the second gradient information have adjacent mode indices.
  • adjacent pattern indices refer to patterns whose predicted pattern numbers are numerically consecutive or geometrically close.
  • adjacent pattern indices include left adjacent pattern indices and/or right adjacent pattern indices.
  • each pattern index i it includes the left adjacent index i-1 and/or the right adjacent index i+1.
  • some candidate patterns have only candidate patterns that are adjacent on one side.
  • At least one gradient histogram (e.g., a partitioned gradient histogram) is determined or obtained based on the gradient information of at least one reference region and/or the gradient information of a sub-reference region.
  • At least one candidate mode is determined or obtained based on the at least one gradient histogram. If there are candidate modes with adjacent mode indices among the at least one candidate modes, the gradient information corresponding to the candidate modes with adjacent mode indices is determined as the first gradient information and/or the second gradient information.
  • the candidate modes with adjacent mode indices are mode 1 and mode 2
  • the gradient information corresponding to mode 1 is determined as the first gradient information
  • the gradient information corresponding to mode 2 is determined as the second gradient information.
  • the candidate modes with adjacent mode indices are mode 1, mode 2 and mode 3
  • the gradient information corresponding to any mode (e.g. mode 1) among the candidate modes with adjacent mode indices is determined as the first gradient information
  • the gradient information corresponding to the remaining modes (e.g. mode 2 and mode 3) is determined as the second gradient information.
  • the gradient information of the candidate mode with the highest gradient magnitude among a group and/or a pair of adjacent candidate modes is determined as the first gradient information, and the gradient information of the remaining candidate modes is determined as the second gradient information.
  • step S10 includes: determining or obtaining the prediction mode of at least one partition based on the adjusted first gradient information and/or the adjusted second gradient information.
  • step S10 includes: determining or obtaining gradient information of at least one reference region based on at least one reference region and at least one gradient operator; determining or obtaining at least one gradient histogram based on the gradient information of at least one reference region; determining or obtaining at least one candidate mode based on the at least one gradient histogram; determining or obtaining adjusted first gradient information and/or adjusted second gradient information based on the at least one candidate mode; determining or obtaining at least one adjusted gradient histogram based on the adjusted first gradient information and/or adjusted second gradient information; and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one adjusted gradient histogram.
  • step S10 includes: determining or obtaining at least one sub-reference region related to a partition based on at least one reference region and the partitioning method of the current block; determining or obtaining gradient information of at least one sub-reference region related to a partition based on at least one gradient operator; determining or obtaining at least one gradient histogram (i.e., partition gradient histogram) based on the gradient information of at least one sub-reference region related to a partition; determining or obtaining at least one candidate mode based on the at least one partition gradient histogram; determining or obtaining adjusted first gradient information and/or adjusted second gradient information based on the at least one candidate mode; determining or obtaining at least one adjusted gradient histogram based on the adjusted first gradient information and/or adjusted second gradient information; and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one adjusted gradient histogram.
  • partition gradient histogram i.e., partition gradient histogram
  • the pattern with the largest gradient magnitude in the gradient histogram or several patterns with the highest gradient magnitude are usually identified as the prediction pattern.
  • the directions of the prediction patterns with the largest gradient magnitudes are similar (e.g., their pattern indices are adjacent)
  • the above method will ignore other potentially valid dissimilar direction patterns, resulting in a lack of diversity in pattern selection and potentially failing to adapt to complex and ever-changing image scenes. Therefore, in order to enrich the pattern selection, at least one of the determined or obtained prediction patterns can be changed by adjusting the first gradient information and/or the second gradient information to enrich the pattern selection and improve prediction accuracy.
  • the first gradient information can be adjusted based on the fourth weight information to determine or obtain the adjusted first gradient information.
  • the second gradient information can be adjusted based on the fifth weight information to determine or obtain the adjusted second gradient information.
  • the fourth weight information and/or the fifth weight information can be preset fixed values, and/or can be adaptively adjusted according to different scenarios.
  • the fourth weight information and/or the fifth weight information can be the same or different.
  • the fourth and/or fifth weight information includes: weights Wi and/or weights Wj, which are used to adjust the first and/or second gradient information to obtain the adjusted first and/or second gradient information.
  • the first gradient information and/or the second gradient information may be adjusted, including adjusting the gradient magnitudes of the first gradient information and the second gradient information.
  • weight Wj 1 - weight Wj.
  • the adjusted first gradient first gradient magnitude + Wi * second gradient magnitude
  • the adjusted second gradient magnitude Wj * second gradient magnitude.
  • the first gradient information and/or the second gradient information may be adjusted, including adjusting the gradient magnitude of the first gradient information and the gradient magnitude of the non-first gradient information.
  • the weight Wi is 0.3
  • the weight Wj is 1
  • the adjusted first gradient first gradient magnitude + Wi * second gradient magnitude, while the second gradient magnitude remains unchanged.
  • the first gradient information and/or the second gradient information may be adjusted, including adjusting the gradient magnitude of the second gradient information and the gradient magnitude of the non-first gradient information.
  • the weights Wi and Wj are both 0, the adjusted second gradient magnitude is 0, and the first gradient magnitude remains unchanged.
  • the gradient information corresponding to any one of the candidate modes (e.g., the mode with the highest gradient magnitude) among the adjacent candidate modes of a set of mode indices is determined as the first gradient information, and the gradient information corresponding to at least one of the remaining modes is determined as the second gradient information.
  • the candidate modes among the adjacent candidate modes of a set of mode indices include 2 or 3 candidate modes.
  • the gradient information corresponding to any one of the candidate modes (e.g., the mode with the highest gradient magnitude) among the adjacent candidate modes of a set of mode indices is determined as the second gradient information, and the gradient information corresponding to at least one of the remaining modes is determined as the first gradient information.
  • the candidate modes among the adjacent candidate modes of a set of mode indices include 2 or 3 candidate modes.
  • the adjusted second gradient information is determined or obtained. If the fifth weight is less than 1, the adjusted first gradient information is determined or obtained based on the fourth weight and the first gradient information. If the fourth weight is less than 1, the fifth weight and the fourth weight are different. Based on the adjusted first gradient information and the adjusted second gradient information, the prediction mode of at least one partition is determined or obtained. By reducing the gradient magnitude corresponding to at least some candidate modes to different degrees by the fourth weight and the fifth weight, the determined or obtained prediction mode can be changed, thereby improving the diversity of mode selection.
  • the adjusted second gradient information is determined or obtained.
  • the fifth weight is less than 1.
  • the prediction mode of at least one partition is determined or obtained.
  • the adjusted first gradient information is determined or obtained. If the fourth weight is less than 1, the prediction mode of at least one partition is determined or obtained based on the adjusted first gradient information.
  • the adjusted second gradient information is determined or obtained. If the fifth weight is less than 1, the adjusted first gradient information is determined or obtained based on the fourth weight and the first gradient information. If the fourth weight is greater than 1, the fifth weight and the fourth weight are different. Based on the adjusted first gradient information and the adjusted second gradient information, the prediction mode of at least one partition is determined or obtained. The gradient magnitude corresponding to at least some candidate modes is weakened by the fourth weight, and the gradient magnitude corresponding to at least some candidate modes is increased by the fifth weight. At least one set of candidate modes with adjacent indices can be obtained based on the initial gradient histogram. The fourth weight and/or fifth weight of each set of candidate modes with adjacent indices are the same or different. Therefore, the determined or obtained prediction mode can be changed, thereby increasing the diversity of mode selection.
  • the adjusted second gradient information is determined or obtained. If the fifth weight is greater than 1, the adjusted first gradient information is determined or obtained based on the fourth weight and the first gradient information. If the fourth weight is less than 1, the fifth weight and the fourth weight are different. Based on the adjusted first gradient information and the adjusted second gradient information, the prediction mode of at least one partition is determined or obtained.
  • the gradient information corresponding to the mode with the highest gradient magnitude among the candidate modes adjacent to a set of mode indices is determined as the first gradient information, and the gradient information corresponding to at least one remaining mode is determined as the second gradient information.
  • at least one adjusted gradient histogram is determined or obtained.
  • at least one prediction mode is determined or obtained.
  • the diversity of mode selection can be improved while retaining at least one originally selected prediction mode. Since at least one originally selected prediction mode is retained, and the difference between the prediction results of this prediction mode and its adjacent modes is small, weakening some similar modes through the fifth weight will not affect the coding quality.
  • the determined or obtained prediction mode can be changed based on the adjusted first gradient information and/or the adjusted second gradient information, thereby increasing the diversity of mode selection.
  • the reference area is determined or obtained according to at least one of the following methods B1 to B5:
  • Method B1 at least one of the following: the upper adjacent pixel, the upper non-adjacent pixel, the left adjacent pixel, the left non-adjacent pixel, the upper left adjacent pixel, and the upper left non-adjacent pixel;
  • the reference area includes: reference pixels, reference blocks, and/or reference templates.
  • the reference region of the current block can be determined or obtained based on at least one of the above adjacent pixels, above non-adjacent pixels, left adjacent pixels, left non-adjacent pixels, upper left adjacent pixels, and upper left non-adjacent pixels.
  • step S10 includes: determining or obtaining at least one reference region of the current block based on at least one of the above adjacent pixels, above non-adjacent pixels, left adjacent pixels, left non-adjacent pixels, upper left adjacent pixels, and upper left non-adjacent pixels; and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one reference region.
  • the upper adjacent pixel can be a pixel located above and adjacent to the current block in the same frame of the image.
  • the non-adjacent pixels above can be pixels in the same frame that are above the current block but not adjacent to it.
  • the left-adjacent pixel can be a pixel located to the left and adjacent to the current block in the same frame of the image.
  • the non-adjacent pixels on the left can be pixels located to the left of the current block in the same frame of the image, but not adjacent to the current block.
  • the upper left adjacent pixel can be a pixel located in the same frame image that is adjacent to the upper left of the current block.
  • the non-adjacent pixel in the upper left corner can be a pixel in the same frame that is located in the upper left corner of the current block, but is not adjacent to the current block.
  • At least one of the above adjacent pixel, above non-adjacent pixel, left adjacent pixel, left non-adjacent pixel, upper left adjacent pixel, and upper left non-adjacent pixel can be a reconstructed pixel or a predicted pixel.
  • the reference area can be used as the upper adjacent pixel, the upper non-adjacent pixel, the left adjacent pixel, the left non-adjacent pixel, the upper left adjacent pixel, and the upper left non-adjacent pixel.
  • the reference area can be derived or calculated from at least one obtained pixel.
  • the reference region of the current block can be obtained according to preset mapping/correspondence rules.
  • a reference region can be selected from the top adjacent pixels, top non-adjacent pixels, left adjacent pixels, left non-adjacent pixels, top left adjacent pixels, and top left non-adjacent pixels of the current block, based on the prediction model.
  • the current block since the current block usually has a high similarity to at least one of the above adjacent pixel, above non-adjacent pixel, left adjacent pixel, left non-adjacent pixel, upper left adjacent pixel, and upper left non-adjacent pixel, the prediction accuracy for the current block and/or its partitions can be improved based on the reference area determined by these adjacent pixels and/or non-adjacent pixels.
  • Method B2 requires at least one of the following: the neighboring block, the non-neighboring block, the sibling block, the temporal block, and the default block corresponding to the current block.
  • At least one of the following can be used as a reference region: the neighboring block, the non-neighboring block, the co-located block, the temporal block, and the default block corresponding to the current block.
  • At least one reference region can be determined or obtained based on image block information from at least one of the following: neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks, and default blocks corresponding to the current block.
  • step S10 includes: determining or obtaining at least one reference region of the current block based on at least one of the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks and default blocks corresponding to the current block; and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one reference region.
  • the image block information may include at least one of the following: block size, block area, image block attributes, and image block type.
  • the block size includes the block's width, height, scale, depth, area, resolution, and number of pixels, etc.
  • the image block attributes may include the block's position and/or image texture, and the image block type may include natural images or screen content images, etc.
  • At least one reference region can be determined or obtained based on at least one of the following: the upper adjacent pixel, the upper non-adjacent pixel, the left adjacent pixel, the left non-adjacent pixel, the upper left adjacent pixel, and the upper left non-adjacent pixel, among the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks, and default blocks corresponding to the current block.
  • At least one of the following can be used as a reference region: the upper adjacent pixel, the upper non-adjacent pixel, the left adjacent pixel, the left non-adjacent pixel, the upper left adjacent pixel, and the upper left non-adjacent pixel among the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks, and default blocks corresponding to the current block.
  • At least one reference region can be determined or obtained based on at least one of the width, height, block size, and block area of at least one of the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks, and default blocks corresponding to the current block.
  • a neighboring block can be a block adjacent to the current block, and can be a block that has already been predicted or reconstructed.
  • a non-neighbor block can be a block that is not adjacent to the current block, and can be a block that has already been predicted or reconstructed.
  • a co-location block can be an image block in a co-location image that has the same position and size as the current block.
  • the co-location image can be the image in the reference image that is temporally closest to the current image.
  • a temporal block can be a block distinguished in the time domain, such as an image block in other frames before or after the current frame. For example, if video data contains a first frame, a second frame, and a third frame played in the first, second, and third seconds, and the current block is a block divided from the second frame, then the temporal block corresponding to the current block can be determined to be the corresponding image block in other frames besides the second frame.
  • the default block can be a pre-set block, such as a block with typical pixel characteristics pre-set by the encoder and/or decoder.
  • At least one reference region is determined or obtained based on at least one of the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks, and default blocks corresponding to the current block. This ensures that the determined or obtained reference region is closely related to the current block and/or its partitions, thereby making the subsequent prediction results obtained based on the reference region more accurate.
  • Method B3 at least one of the following: width, height, block size, and block area of the current block;
  • step S10 includes: determining or obtaining at least one reference region of the current block based on at least one of the width, height, block size, and block area of the current block, and determining or obtaining a prediction pattern for at least one partition of the current block based on the at least one reference region.
  • At least one reference region can be determined or obtained based on the width, height, and first mapping table of the current block.
  • the first mapping table can be as shown in Table 1 below:
  • the height of at least one reference region is equal to the height of the current block by a first preset multiple
  • the width of at least one reference region is equal to the width of the current block by a second preset multiple
  • the reference area or the image area within the reference area can be an encoded area or a decoded area.
  • the encoded or decoded region can be determined by the position of the top-left pixel, the height and width of the encoded or decoded region.
  • the position of the top-left pixel can be the position of the image block at a height N (N is greater than 1) times above the top-left position of the current block and at a width N times to the left of the image block.
  • the width of the encoded or decoded region is an integer multiple of the width of the current block
  • the height of the encoded or decoded region is an integer multiple of the height of the current block.
  • the reference region can be determined based on the block size of the current block and the second mapping table.
  • the second mapping table can be as shown in Table 2 below:
  • the block size includes at least one of the block's width, height, aspect ratio, depth, area, resolution, and number of pixels.
  • X 4 to X 7 can be a preset threshold corresponding to at least one of the block size's width, height, aspect ratio, depth, area, resolution, and number of pixels.
  • a reference region can be determined based on the block area of the current block and a third mapping table.
  • the third mapping table can be as shown in Table 3 below:
  • the positions of the reference region, reference block, and/or reference pixels can be determined or obtained based on the upper adjacent pixels, left adjacent pixels, and upper left adjacent pixels of the current block, and the size of the reference region can be determined based on the width and height of the current block and the first mapping table.
  • the reference area of the current block includes: a first area adjacent to the top of the current block, a second area adjacent to the left of the current block, and a third area adjacent to the upper left of the current block.
  • the width of the first area is equal to twice the width of the current block
  • the height of the second area is equal to twice the height of the current block. If the width and height of the current block are both greater than or equal to 8, then the height of the first area is 8, the width of the second area is 8, and the width and height of the third area are both 8; or, if either the width or the height of the current block is less than 8, then the height of the first area is 4, the width of the second area is 4, and the width and height of the third area are both 4.
  • the reference region is closely related to the current block and/or its partitions, thereby making the subsequent prediction results obtained based on the reference region more accurate.
  • Method B4 The candidate motion vector or candidate block vector of the current block is determined or the candidate block is obtained;
  • step S10 includes: determining or obtaining a candidate block based on the candidate motion vector or candidate block vector of the current block; determining or obtaining at least one reference region of the current block; and determining or obtaining the prediction mode of at least one partition of the current block based on the at least one reference region.
  • a candidate block can be determined or obtained based on at least one candidate motion vector or at least one candidate block vector in the candidate list of the current block, and used as at least one reference region.
  • a candidate block can be determined or obtained based on the candidate motion vector or candidate block vector of the current block, and at least one reference region can be determined or obtained based on at least one of the above adjacent pixels, above non-adjacent pixels, left adjacent pixels, left non-adjacent pixels, upper left adjacent pixels, and upper left non-adjacent pixels of the candidate block.
  • a candidate block can be determined or obtained based on the candidate motion vector or candidate block vector of the current block, and at least one of the following: the upper adjacent pixel, the upper non-adjacent pixel, the left adjacent pixel, the left non-adjacent pixel, the upper left adjacent pixel, and the upper left non-adjacent pixel of the candidate block can be used as at least one reference region.
  • a candidate block can be determined or obtained based on the candidate motion vector or candidate block vector of the current block.
  • At least one reference region can be determined or obtained based on at least one of the width, height, block size, and block area of the candidate block.
  • the specific implementation process can refer to the scheme in method F above, that is, the current block in method F can be replaced with the candidate block, which will not be repeated here.
  • a candidate block can be determined or obtained based on the candidate motion vector or candidate block vector of the current block, and at least one reference region can be determined or obtained based on at least one of the neighboring blocks, non-neighboring blocks, co-located blocks, temporal blocks and default blocks corresponding to the candidate block.
  • a candidate block can be determined or obtained based on the candidate motion vector or candidate block vector of the current block, and at least one of the following can be used as a reference region: the neighboring block, non-neighboring block, co-located block, temporal block, and default block corresponding to the candidate block.
  • the candidate block determined or obtained based on the candidate motion vector or candidate block vector of the current block ensures that the determined or obtained reference area is closely related to the current block and/or its partitions, thereby making the subsequent prediction results obtained based on the reference area more accurate.
  • Method B5 The current block's partitioning method.
  • step S10 includes: determining or obtaining at least one reference region of the current block according to the current block division method, and determining or obtaining the prediction mode of at least one partition of the current block according to the at least one reference region.
  • the reference area includes a sub-reference area corresponding to at least one partition of the current block.
  • At least one partition and/or at least one sub-reference region of the current block can be determined or obtained based on the current block's partitioning method.
  • the current block partitioning method is determined or obtained based on at least one geometric partitioning pattern and/or an index obtained from the bitstream.
  • the current block may have only one dividing line.
  • At least one reference region of the current block is partitioned to determine or obtain at least one sub-reference region.
  • the dividing line of the reference region is determined or obtained, and at least one reference region of the current block is partitioned based on the dividing line of the reference region to determine or obtain at least one sub-reference region.
  • the dividing line corresponding to the current block division method can be extended to determine or obtain the dividing line of the reference area.
  • At least one partition and at least one sub-reference region associated with the current block are determined or obtained according to the current block division method.
  • the at least one partition and its associated sub-reference region are located on the same side of the dividing line corresponding to the current block division method.
  • At least one partition may be associated with one or more sub-reference areas.
  • At least one partition and one or more associated sub-reference regions are located on the same side of the dividing line corresponding to the current block's partitioning method.
  • the sub-reference regions corresponding to the first partition in at least one partition are all located on one side of the dividing line corresponding to the current block's partitioning method, and the sub-reference regions corresponding to the second partition in at least one partition are all located on the other side of the dividing line corresponding to the current block's partitioning method.
  • the sub-reference region corresponding to at least one partition of the current block can be determined or obtained by the current block division method.
  • the sub-reference region can focus on the local content in the reference region that is related to at least one partition, and/or remove the background or interference regions in the reference region that are unrelated to at least one partition. This makes the sub-reference region more correlated with the partition than the reference region of the current block, thereby matching a prediction pattern that is more suitable for at least one partition and improving the prediction accuracy for the local region of the current block.
  • This application embodiment also provides a processing device.
  • Figure 15 is a functional block diagram of the processing device of this application. It can be set in or is a processing device.
  • the processing device includes:
  • Processing module A10 is used to determine or obtain the prediction mode of at least one partition of the current block based on at least one reference region.
  • the prediction pattern for at least one partition is determined or obtained based on at least one of the following:
  • At least one gradient operator At least one gradient operator
  • At least one gradient histogram At least one gradient histogram.
  • the processing apparatus further includes at least one of the following:
  • the sub-reference region is associated with at least one partition of the current block
  • the sub-reference region is determined or obtained based on the current block's partitioning method
  • the first weight information corresponds to at least one partition and/or at least one reference region
  • the gradient histogram is determined or obtained based on at least one reference region of the current block
  • the first weight information is determined or obtained based on the current block partitioning method
  • Gradient information includes gradient information of pixels in the reference region, and/or overall gradient information of the reference region.
  • the processing apparatus further includes at least one of the following:
  • the current block is divided according to at least one geometric partitioning pattern and/or an index obtained from the bitstream;
  • the first weight information includes the weight of at least one pixel in at least one reference region
  • the gradient information of at least one reference region including gradient magnitude and/or gradient direction.
  • the weight of at least one pixel in at least one reference region included in the first weight information is determined or obtained based on the distance between the at least one pixel and the dividing line corresponding to the current block division method.
  • the gradient histogram is determined or obtained based on at least one of the following:
  • the gradient information and first weight information of at least one reference region of the current block are the gradient information and first weight information of at least one reference region of the current block
  • the current block has at least one reference region and at least one gradient operator.
  • the processing apparatus further includes at least one of the following:
  • At least one reference region is determined or obtained based on at least one of the following:
  • the pixel above the current block the non-adjacent pixel above the current block, the pixel to the left of the current block, the non-adjacent pixel to the left of the current block, the pixel above the left of the current block, and the non-adjacent pixel above the left of the current block;
  • the current block is selected from at least one of the following: neighboring block, non-neighboring block, sibling block, temporal block, and default block;
  • the current block's width, height, block size, and block area must be at least one of these.
  • the candidate motion vector or candidate block vector of the current block is determined or the candidate block is obtained;
  • the current block is divided in a specific way.
  • the processing device provided in this application embodiment is similar in implementation principle and beneficial effect to the technical solution shown in the corresponding method embodiment above, and will not be described again here.
  • This application also provides a processing device, including a memory and a processor.
  • the memory stores a processing program, and when the processing program is executed by the processor, it implements the steps of the processing method in any of the above embodiments.
  • This application also provides a storage medium storing a processing program, which, when executed by a processor, implements the steps of the processing method in any of the above embodiments.
  • This application also provides a computer program product, which includes computer program code.
  • the computer program code When the computer program code is run on a computer, it causes the computer to perform the methods described in the various possible implementations above.
  • This application also provides a chip, including a memory and a processor.
  • the memory is used to store a computer program
  • the processor is used to call and run the computer program from the memory, so that a device with the chip installed performs the methods described in the various possible implementations above.
  • sequence numbers of the embodiments in this application are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments.
  • the units in the device of this application embodiment can be merged, divided, and deleted according to actual needs.
  • implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof.
  • software When implemented in software, it can be implemented, in whole or in part, as a computer program product.
  • a computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the flow or function according to the embodiments of this application is generated.
  • the computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a storage medium or transmitted from one storage medium to another.
  • computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line) or wireless (e.g., infrared, wireless, microwave, etc.) means.
  • 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 integrates one or more available media.
  • the available medium can be a magnetic medium (e.g., floppy disk, storage disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk (SSD)).

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Measuring Or Testing Involving Enzymes Or Micro-Organisms (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

La présente demande concerne un procédé de traitement, un dispositif de traitement et un support de stockage. Le procédé de traitement peut être appliqué à un dispositif de traitement. Le procédé de traitement consiste à : déterminer ou obtenir un mode de prédiction d'au moins une partition du bloc actuel sur la base d'au moins une région de référence. Dans la solution technique de la présente demande, un mode de prédiction approprié peut être mis en correspondance pour au moins une partition du bloc actuel, ce qui permet de prendre en charge l'amélioration de la précision de prédiction d'une région locale du bloc actuel (par exemple, une région correspondant à la partition).
PCT/CN2025/101884 2025-06-18 2025-06-18 Procédé de traitement, dispositif de traitement et support de stockage Pending WO2026001802A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2025/101884 WO2026001802A2 (fr) 2025-06-18 2025-06-18 Procédé de traitement, dispositif de traitement et support de stockage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2025/101884 WO2026001802A2 (fr) 2025-06-18 2025-06-18 Procédé de traitement, dispositif de traitement et support de stockage

Publications (2)

Publication Number Publication Date
WO2026001802A2 true WO2026001802A2 (fr) 2026-01-02
WO2026001802A3 WO2026001802A3 (fr) 2026-04-16

Family

ID=98220812

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2025/101884 Pending WO2026001802A2 (fr) 2025-06-18 2025-06-18 Procédé de traitement, dispositif de traitement et support de stockage

Country Status (1)

Country Link
WO (1) WO2026001802A2 (fr)

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018056763A1 (fr) * 2016-09-23 2018-03-29 엘지전자(주) Procédé et appareil permettant la réalisation d'une prédiction à l'aide d'une pondération fondée sur un modèle
US12160562B2 (en) * 2021-09-15 2024-12-03 Tencent America LLC On propagating intra prediction mode information of IBC block by using block vector
CN114938449B (zh) * 2022-07-20 2023-10-27 浙江大华技术股份有限公司 帧内预测方法、图像编码方法、图像解码方法及装置
KR20240052698A (ko) * 2022-10-14 2024-04-23 현대자동차주식회사 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 기록 매체
CN120186338A (zh) * 2025-03-19 2025-06-20 深圳传音控股股份有限公司 处理方法、处理设备及存储介质

Also Published As

Publication number Publication date
WO2026001802A3 (fr) 2026-04-16

Similar Documents

Publication Publication Date Title
CN115002463B (zh) 图像处理方法、智能终端及存储介质
CN115988206B (zh) 图像处理方法、处理设备及存储介质
CN115834897B (zh) 处理方法、处理设备及存储介质
CN116847088B (zh) 图像处理方法、处理设备及存储介质
CN114598880B (zh) 图像处理方法、智能终端及存储介质
CN115379214B (zh) 图像处理方法、智能终端及存储介质
KR20260026540A (ko) 이미지 처리 방법, 이미지 처리 디바이스 및 저장 매체
US20260032276A1 (en) Image processing method, processing device and storage medium
CN120186338A (zh) 处理方法、处理设备及存储介质
WO2026001802A2 (fr) Procédé de traitement, dispositif de traitement et support de stockage
CN120186339B (en) Processing method, processing apparatus, and storage medium
WO2026085724A1 (fr) Procédé de traitement d'image, dispositif de traitement et support de stockage
WO2026001800A2 (fr) Procédé de traitement, dispositif de traitement et support de stockage
WO2026001799A2 (fr) Procédé de traitement, dispositif de traitement et support de stockage
WO2025153117A2 (fr) Procédé de traitement, dispositif de traitement, et support de stockage
CN120568059A (zh) 处理方法、处理设备及存储介质
WO2026001801A2 (fr) Procédé de traitement, dispositif de traitement et support de stockage
CN120186334A (zh) 处理方法、处理设备及存储介质
WO2026055974A1 (fr) Procédé de traitement d'images, dispositif de traitement et support de stockage
WO2025147920A1 (fr) Procédé de traitement, dispositif de traitement et support de stockage
CN120856899A (zh) 图像处理方法、处理设备及存储介质
WO2025256661A1 (fr) Procédé de traitement et dispositif de traitement d'image, et support de stockage
WO2025213305A1 (fr) Procédé de traitement, dispositif de traitement, et support de stockage
CN121217925A (zh) 处理方法、处理设备及存储介质
CN121357328A (zh) 图像处理方法、处理设备及存储介质

Legal Events

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

Ref document number: 25825571

Country of ref document: EP

Kind code of ref document: A2