WO2024215643A1 - Modification de région de recherche pour prédiction de mise en correspondance de modèle intra - Google Patents

Modification de région de recherche pour prédiction de mise en correspondance de modèle intra Download PDF

Info

Publication number
WO2024215643A1
WO2024215643A1 PCT/US2024/023677 US2024023677W WO2024215643A1 WO 2024215643 A1 WO2024215643 A1 WO 2024215643A1 US 2024023677 W US2024023677 W US 2024023677W WO 2024215643 A1 WO2024215643 A1 WO 2024215643A1
Authority
WO
WIPO (PCT)
Prior art keywords
region
block
video
determining
candidate
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/US2024/023677
Other languages
English (en)
Inventor
Xianglin Wang
Xiaoyu XIU
Hong-Jheng Jhu
Changyue MA
Ning Yan
Che-Wei Kuo
Wei Chen
Bing Yu
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.)
Beijing Dajia Internet Information Technology Co Ltd
Original Assignee
Beijing Dajia Internet Information Technology 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 Beijing Dajia Internet Information Technology Co Ltd filed Critical Beijing Dajia Internet Information Technology Co Ltd
Priority to CN202480024780.5A priority Critical patent/CN120958793A/zh
Priority to CN202480023515.5A priority patent/CN120982085A/zh
Priority to PCT/US2024/024755 priority patent/WO2024220405A1/fr
Priority to EP24793316.1A priority patent/EP4699310A1/fr
Priority to CN202480029298.0A priority patent/CN121040047A/zh
Priority to PCT/US2024/033023 priority patent/WO2024254460A1/fr
Publication of WO2024215643A1 publication Critical patent/WO2024215643A1/fr
Priority to US19/355,184 priority patent/US20260039865A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques

Definitions

  • This application is related to video coding and compression. More specifically, this application relates to video processing apparatuses and methods for intra template matching prediction (TMP).
  • TMP intra template matching prediction
  • Digital video is supported by a variety of electronic devices, such as digital televisions, laptop or desktop computers, tablet computers, digital cameras, digital recording devices, digital media players, video gaming consoles, smart phones, video teleconferencing devices, video streaming devices, etc.
  • the electronic devices transmit and receive or otherwise communicate digital video data across a communication network, and/or store the digital video data on a storage device. Due to a limited bandwidth capacity of the communication network and limited memory resources of the storage device, video coding may be used to compress the video data according to one or more video coding standards before it is communicated or stored.
  • video coding standards include Versatile Video Coding (VVC), Joint Exploration test Model (JEM), High-Efficiency Video Coding (HEVC/H.265), Advanced Video Coding (AVC/H.264), Moving Picture Expert Group (MPEG) coding, or the like.
  • VVC Versatile Video Coding
  • JEM Joint Exploration test Model
  • HEVC/H.265 High-Efficiency Video Coding
  • AVC/H.264 Advanced Video Coding
  • MPEG Moving Picture Expert Group
  • Video coding generally utilizes prediction methods (e.g., inter-prediction, intra-prediction, or the like) that take advantage of redundancy inherent in the video data.
  • Video coding aims to compress video data into a form that uses a lower bit rate, while avoiding or minimizing degradations to video quality.
  • Implementations of the present disclosure provide a method for video decoding.
  • the method may include determining, by a processor, a search region for a video block from a video frame of a video.
  • the search region includes a first region a first distance away from the video block in a first direction and a second distance away from the video block in a second direction perpendicular to the first direction, a second region adjacent the first region in the first direction and the second distance away from the video block in the second direction, and a third region adjacent the first region in the second direction and the first distance away from the video block in the first direction.
  • the method may further include determining, by the processor, a reference block from the search region. A template of the reference block matches a template of the video block.
  • the method may further include determining, by the processor, prediction samples for the video block based on the reference block.
  • Implementations of the present disclosure provide a method for video encoding.
  • the method may include determining, by a processor, a search region for a video block from a video frame of a video.
  • the search region includes a first region a first distance away from the video block in a first direction and a second distance away from the video block in a second direction perpendicular to the first direction, a second region adjacent the first region in the first direction and the second distance away from the video block in the second direction, and a third region adjacent the first region in the second direction and the first distance away from the video block in the first direction.
  • the method may further include determining, by the processor, a reference block from the search region. A template of the reference block matches a template of the video block.
  • the method may further include determining, by the processor, prediction samples for the video block based on the reference block.
  • Implementations of the present disclosure also provide an apparatus for video decoding.
  • the apparatus may include a memory configured to store a bitstream and a processor coupled to the memory.
  • the processor may be configured to perform a method for video decoding disclosed herein.
  • a prediction block includes the prediction samples for the video block.
  • the bitstream includes encoded data associated with a difference between the video block and the prediction block and an indication indicating that an intra prediction mode is intra template matching prediction (TMP).
  • TMP intra template matching prediction
  • Implementations of the present disclosure also provide an apparatus for video encoding.
  • the apparatus may include a memory configured to store a bitstream and a processor coupled to the memory.
  • the processor may be configured to perform a method for video encoding disclosed herein.
  • a prediction block includes the prediction samples for the video block.
  • the bitstream includes encoded data associated with a difference between the video block and the prediction block and an indication indicating that an intra prediction mode is intra TMP.
  • Implementations of the present disclosure also provide a non-transitory computer- readable storage medium having stored therein a bitstream and instructions which, when executed by a processor, cause the processor to perform a method for video decoding disclosed herein.
  • a prediction block includes the prediction samples for the video block.
  • the bitstream includes encoded data associated with a difference between the video block and the prediction block and an indication indicating that an intra prediction mode is the intra TMP.
  • Implementations of the present disclosure also provide a non-transitory computer- readable storage medium having stored therein a bitstream and instructions which, when executed by a processor, cause the processor to perform a method for video encoding disclosed herein.
  • a prediction block includes the prediction samples for the video block.
  • the bitstream includes encoded data associated with a difference between the video block and the prediction block and an indication indicating that an intra prediction mode is the intra TMP.
  • FIG. 1 is a block diagram illustrating an exemplary system for encoding and decoding video blocks in accordance with some implementations of the present disclosure.
  • FIG. 2 is a block diagram illustrating an exemplary video encoder in accordance with some implementations of the present disclosure.
  • FIG. 3 is a block diagram illustrating an exemplary video decoder in accordance with some implementations of the present disclosure.
  • FIGS. 4A through 4E are block diagrams illustrating how a frame is recursively partitioned into multiple video blocks of different sizes and shapes in accordance with some implementations of the present disclosure.
  • FIG. 5A is an illustration of a search region of an intra TMP mode in Enhanced Compression Model (ECM) in accordance with some examples.
  • ECM Enhanced Compression Model
  • FIG. 5B is a block diagram illustrating a reference block in a search region in accordance with some implementations of the present disclosure.
  • FIG. 6 is a flow chart of an exemplary method for intra TMP on a video frame of a video in accordance with some implementations of the present disclosure.
  • FIG. 7A is an illustration of a modified search region of an intra TMP mode in accordance with some implementations of the present disclosure.
  • FIG. 7B is another illustration of a modified search region of an intra TMP mode in accordance with some implementations of the present disclosure.
  • FIGs. 8A-8C illustrate methods of generating sample values for unreconstructed samples in accordance with some implementations of the present disclosure.
  • FIGs. 9A-9B illustrate performing an iterative search method on a search region with a scaling factor in accordance with some implementations of the present disclosure.
  • FIG. 10 is a diagram illustrating a computing environment coupled with a user interface, according to some implementations of the present disclosure.
  • FIG. 1 is a block diagram illustrating an exemplary system 10 for encoding and decoding video blocks in parallel in accordance with some implementations of the present disclosure.
  • the system 10 includes a source device 12 that generates and encodes video data to be decoded at a later time by a destination device 14.
  • the source device 12 and the destination device 14 may comprise any of a wide variety of electronic devices, including desktop or laptop computers, tablet computers, smart phones, set-top boxes, digital televisions, cameras, display devices, digital media players, video gaming consoles, video streaming device, or the like.
  • the source device 12 and the destination device 14 are equipped with wireless communication capabilities.
  • the destination device 14 may receive the encoded video data to be decoded via a link 16.
  • the link 16 may comprise any type of communication medium or device capable of moving the encoded video data from the source device 12 to the destination device 14.
  • the link 16 may comprise a communication medium to enable the source device 12 to transmit the encoded video data directly to the destination device 14 in real time.
  • the encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device 14.
  • the communication medium may comprise any wireless or wired communication medium, such as a Radio Frequency (RF) spectrum or one or more physical transmission lines.
  • RF Radio Frequency
  • the communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet.
  • the communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from the source device 12 to the destination device 14.
  • the encoded video data may be transmitted from an output interface 22 to a storage device 32. Subsequently, the encoded video data in the storage device 32 may be accessed by the destination device 14 via an input interface 28.
  • the storage device 32 may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, Digital Versatile Disks (DVDs), Compact Disc Read-Only Memories (CD-ROMs), flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing the encoded video data.
  • the storage device 32 may correspond to a file server or another intermediate storage device that may hold the encoded video data generated by the source device 12.
  • the destination device 14 may access the stored video data from the storage device 32 via streaming or downloading.
  • the file server may be any type of computer capable of storing the encoded video data and transmitting the encoded video data to the destination device 14.
  • Exemplary file servers include a web server (e.g., for a website), a File Transfer Protocol (FTP) server, Network Attached Storage (NAS) devices, or a local disk drive.
  • the destination device 14 may access the encoded video data through any standard data connection, including a wireless channel (e.g., a Wireless Fidelity (Wi-Fi) connection), a wired connection (e.g., Digital Subscriber Line (DSL), cable modem, etc.), or a combination of both that is suitable for accessing encoded video data stored on a file server.
  • the transmission of the encoded video data from the storage device 32 may be a streaming transmission, a download transmission, or a combination of both.
  • the source device 12 includes a video source 18, a video encoder 20 and the output interface 22.
  • the video source 18 may include a source such as a video capturing device, e.g., a video camera, a video archive containing previously captured video, a video feeding interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources.
  • a video capturing device e.g., a video camera, a video archive containing previously captured video, a video feeding interface to receive video from a video content provider, and/or a computer graphics system for generating computer graphics data as the source video, or a combination of such sources.
  • the source device 12 and the destination device 14 may form camera phones or video phones.
  • the implementations described in the present application may be applicable to video coding in general, and may be applied to wireless and/or wired applications.
  • the captured, pre-captured, or computer-generated video may be encoded by the video encoder 20.
  • the encoded video data may be transmitted directly to the destination device 14 via the output interface 22 of the source device 12.
  • the encoded video data may also (or alternatively) be stored onto the storage device 32 for later access by the destination device 14 or other devices, for decoding and/or playback.
  • the output interface 22 may further include a modem and/or a transmitter.
  • the destination device 14 includes the input interface 28, a video decoder 30, and a display device 34.
  • the input interface 28 may include a receiver and/or a modem and receive the encoded video data over the link 16.
  • the encoded video data communicated over the link 16, or provided on the storage device 32 may include a variety of syntax elements generated by the video encoder 20 for use by the video decoder 30 in decoding the video data. Such syntax elements may be included within the encoded video data transmitted on a communication medium, stored on a storage medium, or stored on a file server.
  • the destination device 14 may include the display device 34, which can be an integrated display device and an external display device that is configured to communicate with the destination device 14.
  • the display device 34 displays the decoded video data to a user, and may comprise any of a variety of display devices such as a Liquid Crystal Display (LCD), a plasma display, an Organic Light Emitting Diode (OLED) display, or another type of display device.
  • LCD Liquid Crystal Display
  • OLED Organic Light Emitting Diode
  • the video encoder 20 and the video decoder 30 may operate according to proprietary or industry standards, such as VVC, HEVC, MPEG-4, Part 10, AVC, or extensions of such standards. It should be understood that the present application is not limited to a specific video encoding/decoding standard and may be applicable to other video encoding/decoding standards. It is generally contemplated that the video encoder 20 of the source device 12 may be configured to encode video data according to any of these current or future standards. Similarly, it is also generally contemplated that the video decoder 30 of the destination device 14 may be configured to decode video data according to any of these current or future standards.
  • the video encoder 20 and the video decoder 30 each may be implemented as any of a variety of suitable encoder and/or decoder circuitry, such as one or more microprocessors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs), Field Programmable Gate Arrays (FPGAs), discrete logic, software, hardware, firmware or any combinations thereof.
  • DSPs Digital Signal Processors
  • ASICs Application Specific Integrated Circuits
  • FPGAs Field Programmable Gate Arrays
  • an electronic device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the video encoding/decoding operations disclosed in the present disclosure.
  • Each of the video encoder 20 and the video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.
  • CODEC combined encoder/decoder
  • FIG. 2 is a block diagram illustrating an exemplary video encoder 20 in accordance with some implementations described in the present application.
  • the video encoder 20 may perform intra and inter predictive coding of video blocks within video frames.
  • Intra predictive coding relies on spatial prediction to reduce or remove spatial redundancy in video data within a given video frame or picture.
  • Inter predictive coding relies on temporal prediction to reduce or remove temporal redundancy in video data within adjacent video frames or pictures of a video sequence.
  • the term “frame” may be used as synonyms for the term “image” or “picture” in the field of video coding.
  • the video encoder 20 includes a video data memory 40, a prediction processing unit 41, a Decoded Picture Buffer (DPB) 64, a summer 50, a transform processing unit 52, a quantization unit 54, and an entropy encoding unit 56.
  • the prediction processing unit 41 further includes a motion estimation unit 42, a motion compensation unit 44, a partition unit 45, an intra prediction processing unit 46, and an intra Block Copy (BC) unit 48.
  • the video encoder 20 also includes an inverse quantization unit 58, an inverse transform processing unit 60, and a summer 62 for video block reconstruction.
  • An in-loop filter 63 such as a deblocking filter, may be positioned between the summer 62 and the DPB 64 to filter block boundaries to remove blockiness artifacts from reconstructed video.
  • Another in-loop filter such as Sample Adaptive Offset (SAO) filter, Cross Component Sample Adaptive Offset (CCSAO) filter and/or Adaptive in-Loop Filter (ALF), may also be used in addition to the deblocking filter to filter an output of the summer 62.
  • SAO Sample Adaptive Offset
  • CCSAO Cross Component Sample Adaptive Offset
  • ALF Adaptive in-Loop Filter
  • the present application is not limited to the embodiments described herein, and instead, the application may be applied to a situation where an offset is selected for any of a luma component, a Cb chroma component and a Cr chroma component according to any other of the luma component, the Cb chroma component and the Cr chroma component to modify said any component based on the selected offset.
  • a first component mentioned herein may be any of the luma component, the Cb chroma component and the Cr chroma component
  • a second component mentioned herein may be any other of the luma component, the Cb chroma component and the Cr chroma component
  • a third component mentioned herein may be a remaining one of the luma component, the Cb chroma component and the Cr chroma component.
  • the in-loop filters may be omitted, and the decoded video block may be directly provided by the summer 62 to the DPB 64.
  • the video encoder 20 may take the form of a fixed or programmable hardware unit or may be divided among one or more of the illustrated fixed or programmable hardware units.
  • the video data memory 40 may store video data to be encoded by the components of the video encoder 20.
  • the video data in the video data memory 40 may be obtained, for example, from the video source 18 as shown in FIG. 1.
  • the DPB 64 is a buffer that stores reference video data (for example, reference frames or pictures) for use in encoding video data by the video encoder 20 (e.g., in intra or inter predictive coding modes).
  • the video data memory 40 and the DPB 64 may be formed by any of a variety of memory devices.
  • the video data memory 40 may be on-chip with other components of the video encoder 20, or off-chip relative to those components.
  • the partition unit 45 within the prediction processing unit 41 partitions the video data into video blocks.
  • This partitioning may also include partitioning a video frame into slices, tiles (for example, sets of video blocks), or other larger Coding Units (CUs) according to predefined splitting structures such as a Quad- Tree (QT) structure associated with the video data.
  • the video frame is or may be regarded as a two-dimensional array or matrix of samples with sample values.
  • a sample in the array may also be referred to as a pixel or a pel.
  • a number of samples in horizontal and vertical directions (or axes) of the array or picture define a size and/or a resolution of the video frame.
  • the video frame may be divided into multiple video blocks by, for example, using QT partitioning.
  • the video block again is or may be regarded as a two-dimensional array or matrix of samples with sample values, although of smaller dimension than the video frame.
  • a number of samples in horizontal and vertical directions (or axes) of the video block define a size of the video block.
  • the video block may further be partitioned into one or more block partitions or sub-blocks (which may form again blocks) by, for example, iteratively using QT partitioning, Binary-Tree (BT) partitioning or Triple-Tree (TT) partitioning or any combination thereof.
  • BT Binary-Tree
  • TT Triple-Tree
  • block or video block may be a portion, in particular a rectangular (square or non- square) portion, of a frame or a picture.
  • the block or video block may be or correspond to a Coding Tree Unit (CTU), a CU, a Prediction Unit (PU) or a Transform Unit (TU) and/or may be or correspond to a corresponding block, e.g. a Coding Tree Block (CTB), a Coding Block (CB), a Prediction Block (PB) or a Transform Block (TB) and/or to a sub-block.
  • CTU Coding Tree Unit
  • PU Prediction Unit
  • TU Transform Unit
  • a corresponding block e.g. a Coding Tree Block (CTB), a Coding Block (CB), a Prediction Block (PB) or a Transform Block (TB) and/or to a sub-block.
  • CTB Coding Tree Block
  • PB Prediction Block
  • TB Transform Block
  • the prediction processing unit 41 may select one of a plurality of possible predictive coding modes, such as one of a plurality of intra predictive coding modes or one of a plurality of inter predictive coding modes, for the current video block based on error results (e.g., coding rate and the level of distortion).
  • the prediction processing unit 41 may provide the resulting intra or inter prediction coded block to the summer 50 to generate a residual block and to the summer 62 to reconstruct the encoded block for use as part of a reference frame subsequently.
  • the prediction processing unit 41 also provides syntax elements, such as motion vectors, intramode indicators, partition information, and other such syntax information, to the entropy encoding unit 56.
  • the intra prediction processing unit 46 within the prediction processing unit 41 may perform intra predictive coding of the current video block relative to one or more neighbor blocks in the same frame as the current block to be coded to provide spatial prediction.
  • the motion estimation unit 42 and the motion compensation unit 44 within the prediction processing unit 41 perform inter predictive coding of the current video block relative to one or more predictive blocks in one or more reference frames to provide temporal prediction.
  • the video encoder 20 may perform multiple coding passes, e.g., to select an appropriate coding mode for each block of video data.
  • the motion estimation unit 42 determines the inter prediction mode for a current video frame by generating a motion vector, which indicates the displacement of a video block within the current video frame relative to a predictive block within a reference video frame, according to a predetermined pattern within a sequence of video frames.
  • Motion estimation performed by the motion estimation unit 42, is the process of generating motion vectors, which estimate motion for video blocks.
  • a motion vector for example, may indicate the displacement of a video block within a current video frame or picture relative to a predictive block within a reference frame relative to the current block being coded within the current frame.
  • the predetermined pattern may designate video frames in the sequence as P frames or B frames.
  • the intra BC unit 48 may determine vectors, e.g., block vectors, for intra BC coding in a manner similar to the determination of motion vectors by the motion estimation unit 42 for inter prediction, or may utilize the motion estimation unit 42 to determine the block vector.
  • a predictive block for the video block may be or may correspond to a block or a reference block of a reference frame that is deemed as closely matching the video block to be coded in terms of pixel difference, which may be determined by Sum of Absolute Difference (SAD), Sum of Square Difference (SSD), or other difference metrics.
  • the video encoder 20 may calculate values for sub-integer pixel positions of reference frames stored in the DPB 64. For example, the video encoder 20 may interpolate values of one-quarter pixel positions, one-eighth pixel positions, or other fractional pixel positions of the reference frame. Therefore, the motion estimation unit 42 may perform a motion search relative to the full pixel positions and fractional pixel positions and output a motion vector with fractional pixel precision.
  • the motion estimation unit 42 calculates a motion vector for a video block in an inter prediction coded frame by comparing the position of the video block to the position of a predictive block of a reference frame selected from a first reference frame list (List 0) or a second reference frame list (List 1), each of which identifies one or more reference frames stored in the DPB 64.
  • the motion estimation unit 42 sends the calculated motion vector to the motion compensation unit 44 and then to the entropy encoding unit 56.
  • Motion compensation performed by the motion compensation unit 44, may involve fetching or generating the predictive block based on the motion vector determined by the motion estimation unit 42.
  • the motion compensation unit 44 may locate a predictive block to which the motion vector points in one of the reference frame lists, retrieve the predictive block from the DPB 64, and forward the predictive block to the summer 50.
  • the summer 50 then forms a residual video block of pixel difference values by subtracting pixel values of the predictive block provided by the motion compensation unit 44 from the pixel values of the current video block being coded.
  • the pixel difference values forming the residual video block may include luma or chroma component differences or both.
  • the motion compensation unit 44 may also generate syntax elements associated with the video blocks of a video frame for use by the video decoder 30 in decoding the video blocks of the video frame.
  • the syntax elements may include, for example, syntax elements defining the motion vector used to identify the predictive block, any flags indicating the prediction mode, or any other syntax information described herein. Note that the motion estimation unit 42 and the motion compensation unit 44 may be highly integrated, but are illustrated separately for conceptual purposes.
  • the intra BC unit 48 may generate vectors and fetch predictive blocks in a manner similar to that described above in connection with the motion estimation unit 42 and the motion compensation unit 44, but with the predictive blocks being in the same frame as the current block being coded and with the vectors being referred to as block vectors as opposed to motion vectors.
  • the intra BC unit 48 may determine an intra-prediction mode to use to encode a current block.
  • the intra BC unit 48 may encode a current block using various intra-prediction modes, e.g., during separate encoding passes, and test their performance through rate-distortion analysis.
  • the intra BC unit 48 may select, among the various tested intra-prediction modes, an appropriate intraprediction mode to use and generate an intra-mode indicator accordingly. For example, the intra BC unit 48 may calculate rate-distortion values using a rate-distortion analysis for the various tested intra-prediction modes, and select the intra-prediction mode having the best ratedistortion characteristics among the tested modes as the appropriate intra-prediction mode to use. Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block that was encoded to produce the encoded block, as well as a bitrate (i.e., a number of bits) used to produce the encoded block. Intra BC unit 48 may calculate ratios from the distortions and rates for the various encoded blocks to determine which intra-prediction mode exhibits the best rate-distortion value for the block.
  • Rate-distortion analysis generally determines an amount of distortion (or error) between an encoded block and an original, unencoded block that was
  • the intra BC unit 48 may use the motion estimation unit 42 and the motion compensation unit 44, in whole or in part, to perform such functions for Intra BC prediction according to the implementations described herein.
  • a predictive block may be a block that is deemed as closely matching the block to be coded, in terms of pixel difference, which may be determined by SAD, SSD, or other difference metrics, and identification of the predictive block may include calculation of values for subinteger pixel positions.
  • the video encoder 20 may form a residual video block by subtracting pixel values of the predictive block from the pixel values of the current video block being coded, forming pixel difference values.
  • the pixel difference values forming the residual video block may include both luma and chroma component differences.
  • the intra prediction processing unit 46 may intra-predict a current video block, as an alternative to the inter-prediction performed by the motion estimation unit 42 and the motion compensation unit 44, or the intra block copy prediction performed by the intra BC unit 48, as described above.
  • the intra prediction processing unit 46 may determine an intra prediction mode to use to encode a current block. To do so, the intra prediction processing unit 46 may encode a current block using various intra prediction modes, e.g., during separate encoding passes, and the intra prediction processing unit 46 (or a mode selection unit, in some examples) may select an appropriate intra prediction mode to use from the tested intra prediction modes.
  • the intra prediction processing unit 46 may provide information indicative of the selected intra-prediction mode for the block to the entropy encoding unit 56.
  • the entropy encoding unit 56 may encode the information indicating the selected intra-prediction mode in the bitstream.
  • the summer 50 forms a residual video block by subtracting the predictive block from the current video block.
  • the residual video data in the residual block may be included in one or more TUs and is provided to the transform processing unit 52.
  • the transform processing unit 52 transforms the residual video data into residual transform coefficients using a transform, such as a Discrete Cosine Transform (DCT) or a conceptually similar transform.
  • DCT Discrete Cosine Transform
  • the transform processing unit 52 may send the resulting transform coefficients to the quantization unit 54.
  • the quantization unit 54 quantizes the transform coefficients to further reduce the bit rate.
  • the quantization process may also reduce the bit depth associated with some or all of the coefficients.
  • the degree of quantization may be modified by adjusting a quantization parameter.
  • the quantization unit 54 may then perform a scan of a matrix including the quantized transform coefficients.
  • the entropy encoding unit 56 may perform the scan.
  • the entropy encoding unit 56 entropy encodes the quantized transform coefficients into a video bitstream using, e.g., Context Adaptive Variable Length Coding (CAVLC), Context Adaptive Binary Arithmetic Coding (CABAC), Syntax-based context-adaptive Binary Arithmetic Coding (SBAC), Probability Interval Partitioning Entropy (PIPE) coding or another entropy encoding methodology or technique.
  • CAVLC Context Adaptive Variable Length Coding
  • CABAC Context Adaptive Binary Arithmetic Coding
  • SBAC Syntax-based context-adaptive Binary Arithmetic Coding
  • PIPE Probability Interval Partitioning Entropy
  • the encoded bitstream may then be transmitted to the video decoder 30 as shown in FIG. 1, or archived in the storage device 32 as shown in FIG. 1 for later transmission to or retrieval by the video decoder 30.
  • the entropy encoding unit 56 may also entropy encode the motion vectors and the other syntax elements for the current video frame being coded.
  • the inverse quantization unit 58 and the inverse transform processing unit 60 apply inverse quantization and inverse transformation, respectively, to reconstruct the residual video block in the pixel domain for generating a reference block for prediction of other video blocks.
  • the motion compensation unit 44 may generate a motion compensated predictive block from one or more reference blocks of the frames stored in the DPB 64.
  • the motion compensation unit 44 may also apply one or more interpolation filters to the predictive block to calculate sub-integer pixel values for use in motion estimation.
  • the summer 62 adds the reconstructed residual block to the motion compensated predictive block produced by the motion compensation unit 44 to produce a reference block for storage in the DPB 64.
  • the reference block may then be used by the intra BC unit 48, the motion estimation unit 42 and the motion compensation unit 44 as a predictive block to inter predict another video block in a subsequent video frame.
  • FIG. 3 is a block diagram illustrating an exemplary video decoder 30 in accordance with some implementations of the present application.
  • the video decoder 30 includes a video data memory 79, an entropy decoding unit 80, a prediction processing unit 81, an inverse quantization unit 86, an inverse transform processing unit 88, a summer 90, and a DPB 92.
  • the prediction processing unit 81 further includes a motion compensation unit 82, an intra prediction unit 84, and an intra BC unit 85.
  • the video decoder 30 may perform a decoding process generally reciprocal to the encoding process described above with respect to the video encoder 20 in connection with FIG. 2.
  • the motion compensation unit 82 may generate prediction data based on motion vectors received from the entropy decoding unit 80, while the intra-prediction unit 84 may generate prediction data based on intra-prediction mode indicators received from the entropy decoding unit 80.
  • a unit of the video decoder 30 may be tasked to perform the implementations of the present application. Also, in some examples, the implementations of the present disclosure may be divided among one or more of the units of the video decoder 30.
  • the intra BC unit 85 may perform the implementations of the present application, alone, or in combination with other units of the video decoder 30, such as the motion compensation unit 82, the intra prediction unit 84, and the entropy decoding unit 80.
  • the video decoder 30 may not include the intra BC unit 85 and the functionality of intra BC unit 85 may be performed by other components of the prediction processing unit 81, such as the motion compensation unit 82.
  • the video data memory 79 may store video data, such as an encoded video bitstream, to be decoded by the other components of the video decoder 30.
  • the video data stored in the video data memory 79 may be obtained, for example, from the storage device 32, from a local video source, such as a camera, via wired or wireless network communication of video data, or by accessing physical data storage media (e.g., a flash drive or hard disk).
  • the video data memory 79 may include a Coded Picture Buffer (CPB) that stores encoded video data from an encoded video bitstream.
  • the DPB 92 of the video decoder 30 stores reference video data for use in decoding video data by the video decoder 30 (e.g., in intra or inter predictive coding modes).
  • the video data memory 79 and the DPB 92 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including Synchronous DRAM (SDRAM), Magneto-resistive RAM (MRAM), Resistive RAM (RRAM), or other types of memory devices.
  • DRAM dynamic random access memory
  • SDRAM Synchronous DRAM
  • MRAM Magneto-resistive RAM
  • RRAM Resistive RAM
  • the video data memory 79 and the DPB 92 are depicted as two distinct components of the video decoder 30 in FIG. 3. But it will be apparent to one skilled in the art that the video data memory 79 and the DPB 92 may be provided by the same memory device or separate memory devices.
  • the video data memory 79 may be on-chip with other components of the video decoder 30, or off-chip relative to those components.
  • the video decoder 30 receives an encoded video bitstream that represents video blocks of an encoded video frame and associated syntax elements.
  • the video decoder 30 may receive the syntax elements at the video frame level and/or the video block level.
  • the entropy decoding unit 80 of the video decoder 30 entropy decodes the bitstream to generate quantized coefficients, motion vectors or intra-prediction mode indicators, and other syntax elements.
  • the entropy decoding unit 80 then forwards the motion vectors or intra-prediction mode indicators and other syntax elements to the prediction processing unit 81.
  • the intra prediction unit 84 of the prediction processing unit 81 may generate prediction data for a video block of the current video frame based on a signaled intra prediction mode and reference data from previously decoded blocks of the current frame.
  • the motion compensation unit 82 of the prediction processing unit 81 produces one or more predictive blocks for a video block of the current video frame based on the motion vectors and other syntax elements received from the entropy decoding unit 80.
  • Each of the predictive blocks may be produced from a reference frame within one of the reference frame lists.
  • the video decoder 30 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference frames stored in the DPB 92.
  • the intra BC unit 85 of the prediction processing unit 81 produces predictive blocks for the current video block based on block vectors and other syntax elements received from the entropy decoding unit 80.
  • the predictive blocks may be within a reconstructed region of the same picture as the current video block defined by the video encoder 20.
  • the motion compensation unit 82 and/or the intra BC unit 85 determines prediction information for a video block of the current video frame by parsing the motion vectors and other syntax elements, and then uses the prediction information to produce the predictive blocks for the current video block being decoded. For example, the motion compensation unit 82 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code video blocks of the video frame, an inter prediction frame type (e.g., B or P), construction information for one or more of the reference frame lists for the frame, motion vectors for each inter predictive encoded video block of the frame, inter prediction status for each inter predictive coded video block of the frame, and other information to decode the video blocks in the current video frame.
  • a prediction mode e.g., intra or inter prediction
  • an inter prediction frame type e.g., B or P
  • the intra BC unit 85 may use some of the received syntax elements, e.g., a flag, to determine that the current video block was predicted using the intra BC mode, construction information of which video blocks of the frame are within the reconstructed region and should be stored in the DPB 92, block vectors for each intra BC predicted video block of the frame, intra BC prediction status for each intra BC predicted video block of the frame, and other information to decode the video blocks in the current video frame.
  • a flag e.g., a flag
  • the motion compensation unit 82 may also perform interpolation using the interpolation filters as used by the video encoder 20 during encoding of the video blocks to calculate interpolated values for sub-integer pixels of reference blocks. In this case, the motion compensation unit 82 may determine the interpolation filters used by the video encoder 20 from the received syntax elements and use the interpolation filters to produce predictive blocks. [0064] The inverse quantization unit 86 inverse quantizes the quantized transform coefficients provided in the bitstream and entropy decoded by the entropy decoding unit 80 using the same quantization parameter calculated by the video encoder 20 for each video block in the video frame to determine a degree of quantization.
  • the inverse transform processing unit 88 applies an inverse transform, e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process, to the transform coefficients in order to reconstruct the residual blocks in the pixel domain.
  • an inverse transform e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process
  • the summer 90 reconstructs decoded video block for the current video block by summing the residual block from the inverse transform processing unit 88 and a corresponding predictive block generated by the motion compensation unit 82 and the intra BC unit 85.
  • An in-loop filter 91 such as deblocking filter, SAO filter, CCSAO filter and/or ALF may be positioned between the summer 90 and the DPB 92 to further process the decoded video block.
  • the in-loop filter 91 may be omitted, and the decoded video block may be directly provided by the summer 90 to the DPB 92.
  • the decoded video blocks in a given frame are then stored in the DPB 92, which stores reference frames used for subsequent motion compensation of next video blocks.
  • the DPB 92, or a memory device separate from the DPB 92 may also store decoded video for later presentation on a display device, such as the display device 34 of FIG. 1.
  • a video sequence typically includes an ordered set of frames or pictures.
  • Each frame may include three sample arrays, denoted SL, SCb, and SCr.
  • SL is a two-dimensional array of luma samples.
  • SCb is a two-dimensional array of Cb chroma samples.
  • SCr is a two-dimensional array of Cr chroma samples.
  • a frame may be monochrome and therefore includes only one two-dimensional array of luma samples.
  • the video encoder 20 (or more specifically the partition unit 45) generates an encoded representation of a frame by first partitioning the frame into a set of CTUs.
  • a video frame may include an integer number of CTUs ordered consecutively in a raster scan order from left to right and from top to bottom.
  • Each CTU is a largest logical coding unit and the width and height of the CTU are signaled by the video encoder 20 in a sequence parameter set, such that all the CTUs in a video sequence have the same size being one of 128x 128, 64x64, 32x32, and 16x 16. But it should be noted that the present application is not necessarily limited to a particular size. As shown in FIG.
  • each CTU may comprise one CTB of luma samples, two corresponding coding tree blocks of chroma samples, and syntax elements used to code the samples of the coding tree blocks.
  • the syntax elements describe properties of different types of units of a coded block of pixels and how the video sequence can be reconstructed at the video decoder 30, including inter or intra prediction, intra prediction mode, motion vectors, and other parameters.
  • a CTU may comprise a single coding tree block and syntax elements used to code the samples of the coding tree block.
  • a coding tree block may be an NxN block of samples.
  • the video encoder 20 may recursively perform tree partitioning such as binary -tree partitioning, ternary -tree partitioning, quad-tree partitioning or a combination thereof on the coding tree blocks of the CTU and divide the CTU into smaller CUs.
  • tree partitioning such as binary -tree partitioning, ternary -tree partitioning, quad-tree partitioning or a combination thereof on the coding tree blocks of the CTU and divide the CTU into smaller CUs.
  • the 64x64 CTU 400 is first divided into four smaller CUs, each having a block size of 32x32.
  • CU 410 and CU 420 are each divided into four CUs of 16x16 by block size.
  • the two 16x16 CUs 430 and 440 are each further divided into four CUs of 8x8 by block size.
  • each leaf node of the quad-tree corresponding to one CU of a respective size ranging from 32x32 to 8x8.
  • each CU may comprise a CB of luma samples and two corresponding coding blocks of chroma samples of a frame of the same size, and syntax elements used to code the samples of the coding blocks.
  • a CU may comprise a single coding block and syntax structures used to code the samples of the coding block.
  • 4C and 4D is only for illustrative purposes and one CTU can be split into CUs to adapt to varying local characteristics based on quad/ternary/binary-tree partitions.
  • one CTU is partitioned by a quad-tree structure and each quad-tree leaf CU can be further partitioned by a binary and ternary tree structure.
  • FIG. 4E there are five possible partitioning types of a coding block having a width W and a height H, i.e., quaternary partitioning, horizontal binary partitioning, vertical binary partitioning, horizontal ternary partitioning, and vertical ternary partitioning.
  • the video encoder 20 may further partition a coding block of a CU into one or more MxN PBs.
  • a PB is a rectangular (square or non-square) block of samples on which the same prediction, inter or intra, is applied.
  • APU of a CU may comprise a PB of luma samples, two corresponding PBs of chroma samples, and syntax elements used to predict the PBs.
  • a PU may comprise a single PB and syntax structures used to predict the PB.
  • the video encoder 20 may generate predictive luma, Cb, and Cr blocks for luma, Cb, and Cr PBs of each PU of the CU.
  • the video encoder 20 may use intra prediction or inter prediction to generate the predictive blocks for a PU. If the video encoder 20 uses intra prediction to generate the predictive blocks of a PU, the video encoder 20 may generate the predictive blocks of the PU based on decoded samples of the frame associated with the PU. If the video encoder 20 uses inter prediction to generate the predictive blocks of a PU, the video encoder 20 may generate the predictive blocks of the PU based on decoded samples of one or more frames other than the frame associated with the PU.
  • the video encoder 20 may generate a luma residual block for the CU by subtracting the CU’s predictive luma blocks from its original luma coding block such that each sample in the CU’s luma residual block indicates a difference between a luma sample in one of the CU's predictive luma blocks and a corresponding sample in the CU's original luma coding block.
  • the video encoder 20 may generate a Cb residual block and a Cr residual block for the CU, respectively, such that each sample in the CU's Cb residual block indicates a difference between a Cb sample in one of the CU's predictive Cb blocks and a corresponding sample in the CU's original Cb coding block and each sample in the CU's Cr residual block may indicate a difference between a Cr sample in one of the CU's predictive Cr blocks and a corresponding sample in the CU's original Cr coding block.
  • the video encoder 20 may use quad-tree partitioning to decompose the luma, Cb, and Cr residual blocks of a CU into one or more luma, Cb, and Cr transform blocks respectively.
  • a transform block is a rectangular (square or nonsquare) block of samples on which the same transform is applied.
  • ATU of a CU may comprise a transform block of luma samples, two corresponding transform blocks of chroma samples, and syntax elements used to transform the transform block samples.
  • each TU of a CU may be associated with a luma transform block, a Cb transform block, and a Cr transform block.
  • the luma transform block associated with the TU may be a sub-block of the CU's luma residual block.
  • the Cb transform block may be a sub-block of the CU's Cb residual block.
  • the Cr transform block may be a sub-block of the CU's Cr residual block.
  • a TU may comprise a single transform block and syntax structures used to transform the samples of the transform block.
  • the video encoder 20 may apply one or more transforms to a luma transform block of a TU to generate a luma coefficient block for the TU.
  • a coefficient block may be a two- dimensional array of transform coefficients.
  • a transform coefficient may be a scalar quantity.
  • the video encoder 20 may apply one or more transforms to a Cb transform block of a TU to generate a Cb coefficient block for the TU.
  • the video encoder 20 may apply one or more transforms to a Cr transform block of a TU to generate a Cr coefficient block for the TU.
  • the video encoder 20 may quantize the coefficient block. Quantization generally refers to a process in which transform coefficients are quantized to possibly reduce the amount of data used to represent the transform coefficients, providing further compression.
  • the video encoder 20 may entropy encode syntax elements indicating the quantized transform coefficients. For example, the video encoder 20 may perform CABAC on the syntax elements indicating the quantized transform coefficients.
  • the video encoder 20 may output a bitstream that includes a sequence of bits that forms a representation of coded frames and associated data, which is either saved in the storage device 32 or transmitted to the destination device 14.
  • the video decoder 30 may parse the bitstream to obtain syntax elements from the bitstream.
  • the video decoder 30 may reconstruct the frames of the video data based at least in part on the syntax elements obtained from the bitstream.
  • the process of reconstructing the video data is generally reciprocal to the encoding process performed by the video encoder 20.
  • the video decoder 30 may perform inverse transforms on the coefficient blocks associated with TUs of a current CU to reconstruct residual blocks associated with the TUs of the current CU.
  • the video decoder 30 also reconstructs the coding blocks of the current CU by adding the samples of the predictive blocks for PUs of the current CU to corresponding samples of the transform blocks of the TUs of the current CU. After reconstructing the coding blocks for each CU of a frame, video decoder 30 may reconstruct the frame.
  • video coding achieves video compression using primarily two modes, i.e., intra-frame prediction (or intra-prediction) and inter-frame prediction (or interprediction). It is noted that IBC could be regarded as either intra-frame prediction or a third mode. Between the two modes, inter-frame prediction contributes more to the coding efficiency than intra-frame prediction because of the use of motion vectors for predicting a current video block from a reference video block.
  • motion information of spatially neighboring CUs and/or temporally co-located CUs as an approximation of the motion information (e.g., motion vector) of a current CU by exploring their spatial and temporal correlation, which is also referred to as “Motion Vector Predictor (MVP)” of the current CU.
  • MVP Motion Vector Predictor
  • the motion vector predictor of the current CU is subtracted from the actual motion vector of the current CU to produce a Motion Vector Difference (MVD) for the current CU.
  • MVD Motion Vector Difference
  • a set of rules need to be adopted by both the video encoder 20 and the video decoder 30 for constructing a motion vector candidate list (also known as a “merge list”) for a current CU using those potential candidate motion vectors associated with spatially neighboring CUs and/or temporally co-located CUs of the current CU and then selecting one member from the motion vector candidate list as a motion vector predictor for the current CU.
  • a motion vector candidate list also known as a “merge list”
  • Intra TMP can be utilized to improve the compression efficiency of intra coding.
  • Intra TMP can be an intra prediction mode that generates prediction samples (or predictive samples) of a video block from a reference block in a reconstructed part of a current frame, where a template of the reference block matches a template of the video block.
  • the template of the video block can have an L shape and include causal neighboring samples of the video block in the L shape.
  • a template of the reference block can also have an L shape and include causal neighboring samples of the reference block in the L shape.
  • Example templates are illustrated below with reference to FIG. 5B.
  • video encoder 20 may search for a reference block having a template most similar to the current template of the video block in the reconstructed part of the current video frame, and may use the reference block having the most similar template as a prediction block.
  • the prediction block may include prediction samples of the video block.
  • Video encoder 20 may then signal the usage of this intra TMP mode. Subsequently, similar prediction operations may be performed at the decoder side to generate the prediction block at the decoder side.
  • FIG. 5 A illustrates an example search region of the intra TMP mode which delimits the area of the coordinate of the top-left comer of each candidate block (e.g., each potential reference block).
  • a video block 502 is shown in FIG. 5A, which is part of a CTU 504.
  • video block 504 can be a coding block.
  • the search region of FIG. 5 A may include four regions (e.g., Rl, R2, R3, and R4), where each region contains coordinates of top-left comers of candidate blocks.
  • currX and currY represent horizontal and vertical coordinates of the current video block 502 (e.g., a current coding block), respectively; W and H represent a width and a height of video block 502, respectively; and ctuY represents a vertical coordinate of CTU 504 that video block 502 belongs to.
  • (currX, currY) can be coordinates of a top-left comer of video block 502.
  • searchRange w SearchRange h
  • W block dimension
  • H block dimension
  • SearchRange_w a * W (3)
  • SearchRange h a * H (4)
  • a can be a constant that controls the tradeoff between the gain and the complexity. In one implementation, “a” can be equal to 5.
  • ctuH represents a height of CTU 504.
  • ctuX and ctuY represent a horizontal coordinate and a vertical coordinate of CTU 504, respectively.
  • (ctuX, ctuY) can be coordinates of a top-left comer of CTU 504.
  • CTU 506, 508, and 510 may be above CTU 504.
  • CTU 508 may be on top of and adjacent to CTU 504.
  • CTU 506 may be on the left of and adjacent to CTU 508.
  • CTU 510 may be on the right of and adjacent to CTU 508.
  • An additional CTU 512 may be on the left of and adjacent to CTU 504.
  • CTUs 506, 508, 510, 512, and 504 are in the same video frame.
  • the top region R1 may include a first portion in CTU 506, a second portion in CTU 508, and a third portion in CTU 510.
  • a width 526 of the top region R1 in a horizontal direction (e.g., the x direction) can be 2a*W.
  • a distance 518 between a top boundary of the top region R1 and video block 502 in a vertical direction (e.g., the y direction) can be a*H.
  • a distance 524 between the top region R1 and CTU 504 in the vertical direction can be H.
  • the left region R3 may be below and adjacent to the top region Rl, and may include a first portion in CTU 506 and a second portion in CTU 512.
  • a distance 522 between the left region R3 and CTU 504 in the horizontal direction can be W.
  • the bottom-left region R2 may be in CTU 512.
  • the bottom-left region R2 may be below and adjacent to the left region R3.
  • a distance 520 between a bottom boundary of the bottom-left region R2 and a bottom boundary of CTU 512 in the vertical direction can be H.
  • the bottom-left region R2 may have the same width as the left region R3 in the horizontal direction.
  • the top-left region R4 may include a first portion in CTU 506, a second portion in CTU 508, a third portion in CTU 512, and a fourth portion in CTU 504.
  • the top-left region R4 may be blow and adjacent to the top region Rl, and may be on the right of and adjacent to the left region R3.
  • the top-left region R4 may be away from video block 502 by a distance 516 of W in the horizontal direction and away from video block 502 by a distance 514 of H in the vertical direction.
  • a difference metric such as SAD can be used as a cost function to identify the reference block in the search region. For example, within the search region, video encoder 20 or video decoder 30 may search for a template that has the least SAD with respect to the template of the video block, and may select a candidate block corresponding to the template having the least SAD as a prediction block.
  • the intra TMP can be enabled for CUs with a size less than or equal to 64 in width and height. It is contemplated that the maximum CU size for intra TMP can be configurable. In some implementations, the intra TMP mode can be signaled at the CU level through an indication flag.
  • top is used for purpose of describing the relative positions of regions in a particular coordinate system, as illustrated in FIG. 5 A and additional figures below. They are not intended to limit the particular locations or orientations of the regions.
  • a first region described as at the top-left of a second region in the illustrated coordinate system may be viewed as positioned at one distance relative to the second region in a vertical direction and at another distance relative to the second region in a horizontal direction in the coordinate system.
  • FIG. 5B is a block diagram illustrating a reference block 554 in a search region 560 in accordance with some implementations of the present disclosure.
  • a template 556 of reference block 554 may match a template 552 of a video block 550 in the same video frame 561.
  • Each of template 556 and template 552 has an L shape.
  • Reference block 554 can be determined to be a prediction block for video block 550.
  • template 556 of reference block 554 may have the least SAD with respect to template 552 of video block 550.
  • prediction samples in the prediction block can be generated based on reference block 554.
  • samples of reference block 554 can be treated as prediction samples in the prediction block.
  • an improved intra TMP scheme is disclosed herein to provide significant improvement of intra coding efficiency of the ECM.
  • the improved intra TMP scheme disclosed herein may include methods and apparatus to improve and simplify the coding efficiency of an intra TMP tool by modifying a search region of reconstructed samples in the same video frame for the synthesis of a coding block.
  • the search region of the intra TMP mode may include reconstructed samples in four different regions Rl, R2, R3, and R4.
  • the four regions Rl, R2, R3 and R4 may include all the available reconstructed samples from the top CTU row (e.g., blocks 506, 508, 510) and the left CTU (e.g., block 512), but not all the available reconstructed samples in the same CTU (e.g., block 504) of the current coding block (e.g., video block 502).
  • candidate blocks whose locations are closer to the current coding block should be more correlated with the coding block, i.e., providing better intra prediction efficiency.
  • the improved TMP scheme disclosed herein extends the search region shown in FIG. 5A to include more available reconstructed samples within the current CTU as described below with reference to FIGs. 6 and 7A-7B.
  • FIG. 6 is a flow chart of an exemplary method 600 for intra TMP on a video frame of a video in accordance with some implementations of the present disclosure.
  • Method 600 may be implemented by a processor associated with video encoder 20 or video decoder 30, and may include steps 602-606 as described below. Some of the steps may be optional to perform the disclosure provided herein. Further, some of the steps may be performed simultaneously, or in a different order than shown in FIG. 6.
  • FIG. 7A is an illustration of a modified search region of an intra TMP mode in accordance with some implementations of the present disclosure.
  • FIG. 7B is another illustration of a modified search region of an intra TMP mode in accordance with some implementations of the present disclosure.
  • FIGs. 8A-8C illustrate methods of generating sample values for unreconstructed samples in accordance with some implementations of the present disclosure.
  • FIGs. 6, 7A-7B, and 8A-8C are described below together.
  • the processor may determine a search region for a video block from the video frame.
  • the video frame may include CTUs 706, 708, 710, 712, and 704, where a video block 702 is included in the current CTU 704.
  • a search region may include a first region (a top-left region R4) which is a first distance 714 away from video block 702 in a first direction (e.g., the vertical direction) and a second distance 716 away from video block 702 in a second direction (e.g., the horizontal direction) perpendicular to the first direction.
  • First distance 714 in the first direction can be equal to a height of video block 702 in the first direction.
  • Second distance 716 in the second direction can be equal to a width of video block 702 in the first direction.
  • the first region R4 in FIG. 7A may be like the top-left region R4 of FIG. 5 A, and the similar description will not be repeated herein.
  • the search region may also include a second region (a secondary left region R2’) adjacent the first region R4 in the first direction and the second distance 716 away from the video block in the second direction.
  • the second region R2’ may have a same width as the first region R4 in the second direction.
  • a height of the second region R2’ can be equal to the height of video block 702 in the first direction.
  • the search region may also include a third region (a secondary top-left region R4’) adjacent the first region R4 in the second direction and the first distance 714 away from the video block in the first direction.
  • the third region R4’ may have a same height as the first region R4 in the first direction.
  • a width of the third region R4’ is equal to the width of video block 702 in the second direction.
  • the improved intra TMP scheme disclosed herein can further include additional reconstructed samples (which are located on the top-left of the current video block 702) into the search region of the intra TMP mode. These additional top-left reconstructed samples are located on the right of the first region R4 or below the first region R4. Specifically, as shown in FIG. 7A, two new regions R2’ and R4’ can be included in the search region.
  • the search region may further include a fourth region (e.g., a secondary bottom-left region R2”) adjacent the second region R2’ in the first direction and the second distance 716 away from the video block in the second direction.
  • the fourth region R2 may have the same width as the first region R4 and the second region R2”.
  • the search region may further include a fifth region (e.g., a top-right region R4”) adjacent the third region R4’ in the second direction and the first distance 714 away from the video block in the first direction.
  • the fifth region R4” may have the same height as the first region R4 and the third region R4’ in the first direction.
  • a third distance 718 between the fifth region R4” and a right boundary of CTU 704 in the second direction is equal to the width of video block 702.
  • a fourth distance 720 between the fourth region R2”and a bottom boundary of CTU 704 in the first direction is equal to the height of video block 702.
  • the fourth region R2” is the second distance 716 away from video block 702 in the second direction.
  • the fifth region R4” is the first distance 714 away from video block 702 in the first direction.
  • the improved intra TMP scheme disclosed herein can further include reconstructed samples that are located on top-right or bottom-left positions relative to video block 702 into the search region of the intra TMP mode. Specifically, as shown in FIG. 7A, two additional regions R2” and R4” are included in the search region.
  • ctuW and ctuH represent a width and a height of CTU 704, respectively.
  • the width of the fourth region R2” and the width of the fifth region R4” can be constrained.
  • searchRange can be the maximum horizontal region size of R2” and R4” .
  • the search region may further include a sixth region R1 (a top region Rl), a seventh region R3 (e.g., a left region R3), and an eighth region R2 (a bottom left region R2).
  • the sixth region Rl may be adjacent to the first region, the third region, and the fifth region in the vertical direction.
  • a fifth distance between an upper boundary of the sixth region Rl and video block 702 in the vertical direction is equal to a product of the height of the video block and the constant a (e.g., a*H).
  • a sixth distance 724 between the sixth region Rl and CTU 704 in the vertical direction is equal to the height of the video block (e.g., H).
  • the seventh region R3 may be adjacent to the sixth region Rl in the vertical direction and adjacent to the first region R4 and the second region R2’ in the horizontal direction.
  • a height of the seventh region R3 is equal to a sum of a height of the first region R4 and a height of the second region R2’ .
  • a distance 722 between the seventh region R3 and CTU 704 in the horizontal direction is equal to the width of the video block (e.g., W).
  • the eighth region R2 may be adjacent to the seventh region R3 in the vertical direction and adjacent to the fourth region R2” in the horizontal direction.
  • a height of the eighth region R2 is equal to a height of the fourth region R2”
  • a width of the eighth region R2 is equal to a width of the seventh region R3.
  • a distance 720 between the eighth region R2 and a bottom-boundary of CTU 712 in the vertical direction is equal to the height of the video block (e.g., H).
  • the sixth region Rl, the seventh region R3, and the eighth region R2 may be like the top region Rl, the left region R3, and the bottom-left region R2 of FIG. 5A, respectively, and the similar description will not be repeated herein.
  • the first region R4, the second region R2’, and the seventh region R3 can be merged into a single region R5, as shown in FIG. 7B.
  • samples in the regions R2” and R4 may be obtained from search areas that are below or right to video block 702, which may not be reconstructed before the encoding/decoding of video block 702 is started. For example, both reconstructed samples and unreconstructed samples are included in the fourth region R2” and the fifth region R4”.
  • the availability check may be conducted to decide whether all the samples in the corresponding candidate blocks are already reconstructed or not, as described below in more detail.
  • the processor may determine a reference block from the search region, where a template of the reference block matches a template of the video block. Specifically, the processor may determine a plurality of candidate blocks from the search region, and determine a plurality of templates for the plurality of candidate blocks, respectively. The processor may determine, from the plurality of templates, a template that matches the template of the video block, and determine the reference block to be a first candidate block having the template that matches the template of the video block. [00119] In some implementations, the processor may determine that the plurality of candidate blocks may include one or more second candidate blocks from the fourth region R2” or the fifth region R4” . The one or more second candidate blocks from the fourth region R2” or the fifth region R4” may include unreconstructed samples. For each second candidate block, the processor may perform an availability check on the second candidate block.
  • the processor may determine whether the second candidate block includes at least an unreconstructed sample. Responsive to determining that the second candidate block includes at least an unreconstructed sample, the processor may determine that the second candidate block fails the availability check. Or, responsive to determining that the second candidate block includes no unreconstructed samples, the processor may determine that the second candidate block passes the availability check.
  • the processor may determine whether a sample at a bottom-right corner of the second candidate block is reconstructed or not. Responsive to the sample at the bottom-right comer of the second candidate block is unreconstructed, the processor may determine that the second candidate block fails the availability check. Or, responsive to the sample at the bottom-right corner of the second candidate block is reconstructed, the processor may determine that the second candidate block passes the availability check.
  • the processor may keep the second candidate block in the plurality of candidate blocks. Or, responsive to determining that the second candidate block fails the availability check, the processor may remove the second candidate block from the plurality of candidate blocks. For example, if all the samples in a candidate block from the fourth region R2” or the fifth region R4” are reconstructed (i.e., available), the candidate block is deemed as a valid intra TMP candidate block to predict the video block. Otherwise (i.e., at least one sample in the candidate block is not reconstructed yet), the candidate block is not allowed to be referenced in the prediction of the video block.
  • a candidate block in the regions R2” and R4” is allowed to be used as an intra TMP candidate block only if all the samples inside the candidate block are already reconstructed before the encoding/decoding of the video block.
  • Such constraint may reduce the total number of valid intra TMP candidate blocks from which the video block can be predicted and therefore limit the overall coding performance of the intra TMP mode.
  • the improved TMP scheme disclosed herein may further generate sample values for the unreconstructed samples (e.g., unavailable samples) from its neighboring available samples of the candidate block such that the candidate block can become a valid candidate block for the intra TMP mode.
  • the processor may determine unreconstructed samples in the second candidate block.
  • the processor may update the second candidate block by generating sample values for the unreconstructed samples, so that the updated second candidate block can be kept in the plurality of candidate blocks.
  • the sample values for the unreconstructed samples can be generated using at least one of a horizontal repetitive padding method, a vertical repetitive padding method, an adaptive repetitive method, or a collocated copying method, as described below in more detail.
  • the horizontal repetitive padding method can be applied to generate sample values for unreconstructed samples in a candidate block from the region R2” or the region R4”.
  • a sample value of each unreconstructed sample (each unavailable sample) in the candidate block can be generated by directly copying a sample value of the nearest reconstructed sample (the nearest available sample) in the horizontal direction.
  • a candidate block 802 from the region R2” or the region R4” may include reconstructed samples (e.g., available samples) a, b, c, d, e, f, g, h, i, and j.
  • Candidate block 802 may also include unreconstructed samples (e.g., unavailable samples) 804, 806, 808, 810, 812, and 814.
  • unreconstructed samples 804, 806, and 808 in a row the nearest reconstructed sample in the horizontal direction is the reconstructed sample i.
  • a sample value of each unreconstructed sample 804, 806, and 808 can be generated by directly copying a sample value of the nearest reconstructed sample i in the horizontal direction.
  • the nearest reconstructed sample in the horizontal direction is the reconstructed sample j.
  • a sample value of each unreconstructed sample 810, 812, and 814 can be generated by directly copying a sample value of the nearest reconstructed sample j in the horizontal direction.
  • the vertical repetitive padding method can be applied to generate sample values for unreconstructed samples in a candidate block from the region R2” or the region R4” .
  • a sample value of each unreconstructed sample in the candidate block can be generated by directly copying a sample value of the nearest reconstructed sample in the vertical direction.
  • the nearest reconstructed sample in the vertical direction is the reconstructed sample f.
  • a sample value of each unreconstructed sample 804 and 810 can be generated by directly copying a sample value of the nearest reconstructed sample f in the vertical direction.
  • the nearest reconstructed sample in the vertical direction is the reconstructed sample g.
  • a sample value of each unreconstructed sample 806 and 812 can be generated by directly copying a sample value of the nearest reconstructed sample g in the vertical direction.
  • the nearest reconstructed sample in the vertical direction is the reconstructed sample h.
  • a sample value of each unreconstructed sample 808 and 814 can be generated by directly copying a sample value of the nearest reconstructed sample h in the vertical direction.
  • the adaptive repetitive padding method may be applied where the unreconstructed samples can be generated by copying either a sample value of the nearest reconstructed sample in the horizontal direction (e.g., horizontal padding) or a sample value of the nearest reconstructed sample in the vertical direction (e.g., vertical padding) in the same candidate block.
  • the decision on whether to select the horizontal padding or the vertical padding can be decided based on different methods.
  • a gradient filter e.g., Sober filter
  • the horizontal repetitive padding method may be applied.
  • the vertical repetitive padding method may be applied.
  • the collocated copying method can be applied, where unreconstructed samples in an overlapped region between the candidate block and the video block are directly copied from the collocated samples in the candidate block.
  • the collocated samples in the candidate block may have the same sample positions in the candidate block as the unreconstructed samples in the video block.
  • candidate block 802 and a video block 832 may have an overlapped region 830 (a shaded area in FIG. 8C), which may include six unreconstructed samples 804, 806, 808, 810, 812, and 814.
  • the six sample positions at the bottom-right portion of candidate block 802 are overlapped with six sample positions at the top-left portion of video block 832.
  • the six bottom-right samples in candidate block 802 are located at the 6 top-left sample positions in video block 832.
  • the 6 unreconstructed bottom-right samples (804, 806, 808, 810, 812, 814) are generated by directly copying the 6 top-left samples (a, b, c, e, f, g) of candidate block 802.
  • the best intra TMP candidate block may be a candidate block having a template matching the template of the video block.
  • the samples in a region that is closer to the video block are more correlated with the samples in the video block, and therefore can be scanned earlier.
  • the regions Rl, R2, R3, R4, R2’, R4’, R2”, and R4 illustrated in FIG.
  • R7A can be scanned based on the order of R4” -> R4’ -> Rl -> R3 -> R4 -> R2’ -> R2” -> R2.
  • the corresponding order to scan the regions Rl, R2, R5, R2”, R4’, and R4” becomes R4” -> R4’ -> Rl -> R5 -> R2” - > R2.
  • the processor may perform an iterative search method on the search region with at least a scaling factor to identify a candidate block having a template which matches the template of the video block.
  • the candidate block having the template matching the template of the video block (also referred to as the best intra TMP candidate block) is determined as the reference block for the video block. That is, to further reduce the complexity, the iterative search method can be applied to iteratively identify the best intra TMP candidate block.
  • a region can be subsampled by a scaling factor scale to find one or more initial intra TMP candidate blocks.
  • a local refinement can be conducted with a gradually reduced search step to look for a refined intra TMP candidate block.
  • the current search step is reduced to be half of the previous search step.
  • the search step can be reduced to be scale/2, while in a second round of the local refinement, the search step can be reduced to be scaled, so on and so forth.
  • Such refinement can be continuously performed until the search step is reduced to be smaller than 1 or the refined intra TMP candidate block does not change in the refinement process.
  • a termination criterion may be applied to terminate the whole search process across all the regions or the search process in a specific region when a termination condition is satisfied. For instance, a distortion value of the refined intra TMP candidate block that is obtained during the search process so far can be used to determine the termination criterion. Specifically, when the distortion value is smaller than a predefined threshold, it is determined that the refined intra TMP candidate block is already good enough such that the search process can stop. Otherwise (i.e., the distortion value is equal to or larger than the predefined threshold), it is determined that the current refined intra TMP candidate needs to be further improved and thus the search process continues.
  • the above termination scheme can be used for jumping out (or terminating) the whole search process across all the regions.
  • the above termination scheme can be used independently for each region. For example, when the termination condition is met (e.g., when the distortion value is smaller than the predefined threshold), the search process on the samples in the current region can be terminated while the searching on the samples in the following regions may continue to be performed.
  • an adaptive refinement scheme may be applied in the search process, where different subsampling scaling factors may be applied to different regions. For example, a region that is closer to the video block can be more correlated with the video block and can be searched with a smaller scaling factor, while another region that is farther away from the video block can be less correlated with the video block can be searched with a larger scaling factor.
  • video encoder 20 may identify an optimal region from the search region, generate a bitstream to include an index of the optimal region, and transmit the bitstream to video decoder 30. Then, video decoder 30 may receive the bitstream including the index of the optimal region, and identify the optimal region from the search region based on the index. Video decoder 30 may determine the reference block from the optimal region.
  • the complexity of the intra TMP mode is proportional to the number of candidate blocks that are checked to identify the best intra TMP candidate block. To reduce the intra TMP complexity, an explicit region-based intra TMP mode can be used.
  • the total search region of the intra TMP mode is divided into multiple regions, e.g., the regions R4”, R4’, Rl, R5, R2”, and R2 as illustrated in FIG. 7B, such that each region can provide an independent intra TMP candidate (i.e., a candidate block with the smallest distortion metric within the region).
  • the multiple regions can be tested through ratedistortion-optimization (RDO) and the best region (the optimal region) is identified with an index of the region.
  • the index of the optimal region can be transmitted to video decoder 30 in a bitstream.
  • the intra TMP search process only needs to be carried out in a region corresponding to the index of the optimal region.
  • the processor may determine prediction samples for the video block based on the reference block. For example, prediction samples in a prediction block may be the same as corresponding samples in the reference block.
  • a bitstream may be generated to include encoded data associated with a difference between the video block and the prediction block, as described above with reference to FIG. 2.
  • the bitstream may also include an indication indicating that an intra prediction mode is the intra TMP.
  • FIGs. 9A-9B illustrate performing an iterative search method on a search region with a scaling factor in accordance with some implementations of the present disclosure.
  • a region 902 can be initially subsampled by a scaling factor a to find one or more initial candidate blocks.
  • a local refinement can be conducted with a gradually reduced search step to look for a refined candidate block.
  • Similar operations can be performed for other initial candidate blocks until the search process in region 902 terminates. For example, if a termination condition is satisfied (e.g., a distortion value of the refined candidate block that is obtained during the search process so far is smaller than a predefined threshold), it is determined that the refined candidate block is already good enough such that the search process can stop. Otherwise (i.e., the distortion value is equal to or larger than the predefined threshold), it is determined that the current refined candidate block needs to be further improved and thus the search process continues. If the whole region 902 has been searched, the search process may continue to be performed in other regions until the termination condition is satisfied.
  • a termination condition e.g., a distortion value of the refined candidate block that is obtained during the search process so far is smaller than a predefined threshold
  • FIG. 10 shows a computing environment 1010 coupled with a user interface 1050.
  • the computing environment 1010 can be part of a data processing server.
  • the computing environment 1010 includes a processor 1020, a memory 1030, and an Input/Output (I/O) interface 1040.
  • I/O Input/Output
  • the processor 1020 typically controls overall operations of the computing environment 1010, such as the operations associated with display, data acquisition, data communications, and image processing.
  • the processor 1020 may include one or more processors to execute instructions to perform all or some of the steps in the above-described methods.
  • the processor 1020 may include one or more modules that facilitate the interaction between the processor 1020 and other components.
  • the processor may be a Central Processing Unit (CPU), a microprocessor, a single chip machine, a Graphical Processing Unit (GPU), or the like.
  • the memory 1030 is configured to store various types of data to support the operation of the computing environment 1010.
  • the memory 1030 may include predetermined software 1032. Examples of such data includes instructions for any applications or methods operated on the computing environment 1010, video datasets, image data, etc.
  • the memory 1030 may be implemented by using any type of volatile or non-volatile memory devices, or a combination thereof, such as a Static Random Access Memory (SRAM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), an Erasable Programmable Read- Only Memory (EPROM), a Programmable Read-Only Memory (PROM), a Read-Only Memory (ROM), a magnetic memory, a flash memory, a magnetic or optical disk.
  • SRAM Static Random Access Memory
  • EEPROM Electrically Erasable Programmable Read-Only Memory
  • EPROM Erasable Programmable Read- Only Memory
  • PROM Programmable Read-Only Memory
  • ROM Read-Only Memory
  • the VO interface 1040 provides an interface between the processor 1020 and peripheral interface modules, such as a keyboard, a click wheel, buttons, and the like.
  • the buttons may include but are not limited to, a home button, a start scan button, and a stop scan button.
  • the VO interface 1040 can be coupled with an encoder and decoder.
  • a non-transitory computer-readable storage medium comprising a plurality of programs, for example, in the memory 1030, executable by the processor 1020 in the computing environment 1010, for performing the above-described methods.
  • the plurality of programs may be executed by the processor 1020 in the computing environment 1010 to receive (for example, from the video encoder 20 in FIG. 2) a bitstream or data stream including encoded video information (for example, video blocks representing encoded video frames, and/or associated one or more syntax elements, etc.), and may also be executed by the processor 1020 in the computing environment 1010 to perform the decoding method described above according to the received bitstream or data stream.
  • the plurality of programs may be executed by the processor 1020 in the computing environment 1010 to perform the encoding method described above to encode video information (for example, video blocks representing video frames, and/or associated one or more syntax elements, etc.) into a bitstream or data stream, and may also be executed by the processor 1020 in the computing environment 1010 to transmit the bitstream or data stream (for example, to the video decoder 30 in FIG. 3).
  • the non-transitory computer-readable storage medium may have stored therein a bitstream or a data stream comprising encoded video information (for example, video blocks representing encoded video frames, and/or associated one or more syntax elements etc.) generated by an encoder (for example, the video encoder 20 in FIG.
  • the non-transitory computer-readable storage medium may be, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disc, an optical data storage device or the like.
  • the is also provided a computing device comprising one or more processors (for example, the processor 1020); and the non-transitory computer-readable storage medium or the memory 1030 having stored therein a plurality of programs executable by the one or more processors, wherein the one or more processors, upon execution of the plurality of programs, are configured to perform the above-described methods.
  • processors for example, the processor 1020
  • non-transitory computer-readable storage medium or the memory 1030 having stored therein a plurality of programs executable by the one or more processors, wherein the one or more processors, upon execution of the plurality of programs, are configured to perform the above-described methods.
  • a computer program product comprising a plurality of programs, for example, in the memory 1030, executable by the processor 1020 in the computing environment 1010, for performing the above-described methods.
  • the computer program product may include the non-transitory computer-readable storage medium.
  • the computing environment 1010 may be implemented with one or more ASICs, DSPs, Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), FPGAs, GPUs, controllers, micro-controllers, microprocessors, or other electronic components, for performing the above methods.
  • ASICs application-specific integrated circuits
  • DSPs Digital Signal Processing Devices
  • PLDs Programmable Logic Devices
  • FPGAs field-programmable Logic Devices
  • GPUs GPUs
  • controllers micro-controllers
  • microprocessors microprocessors, or other electronic components, for performing the above methods.

Landscapes

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

Abstract

Sont proposés des appareils, un procédé de décodage vidéo et un procédé de codage vidéo. Une région de recherche est déterminée pour un bloc vidéo à partir de la trame vidéo. La région de recherche comprend une première région à une première distance du bloc vidéo dans une première direction et une seconde distance à l'opposé du bloc vidéo dans une seconde direction perpendiculaire à la première direction, une seconde région adjacente à la première région dans la première direction et la seconde distance à l'opposé du bloc vidéo dans la seconde direction, et une troisième région adjacente à la première région dans la seconde direction et la première distance à l'opposé du bloc vidéo dans la première direction. Un bloc de référence est déterminé à partir de la région de recherche. Un modèle du bloc de référence correspond à un modèle du bloc vidéo. Des échantillons de prédiction sont déterminés pour le bloc vidéo sur la base du bloc de référence.
PCT/US2024/023677 2023-04-10 2024-04-09 Modification de région de recherche pour prédiction de mise en correspondance de modèle intra Ceased WO2024215643A1 (fr)

Priority Applications (7)

Application Number Priority Date Filing Date Title
CN202480024780.5A CN120958793A (zh) 2023-04-10 2024-04-09 用于帧内模板匹配预测的搜索区域修改
CN202480023515.5A CN120982085A (zh) 2023-04-17 2024-04-16 用于帧内模板匹配预测的搜索区域修改
PCT/US2024/024755 WO2024220405A1 (fr) 2023-04-17 2024-04-16 Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
EP24793316.1A EP4699310A1 (fr) 2023-04-17 2024-04-16 Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
CN202480029298.0A CN121040047A (zh) 2023-06-08 2024-06-07 用于帧内模板匹配预测的搜索区域修改
PCT/US2024/033023 WO2024254460A1 (fr) 2023-06-08 2024-06-07 Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
US19/355,184 US20260039865A1 (en) 2023-04-10 2025-10-10 Search region modification for intra template matching prediction

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202363458419P 2023-04-10 2023-04-10
US63/458,419 2023-04-10

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US19/355,184 Continuation-In-Part US20260039865A1 (en) 2023-04-10 2025-10-10 Search region modification for intra template matching prediction

Publications (1)

Publication Number Publication Date
WO2024215643A1 true WO2024215643A1 (fr) 2024-10-17

Family

ID=93060034

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2024/023677 Ceased WO2024215643A1 (fr) 2023-04-10 2024-04-09 Modification de région de recherche pour prédiction de mise en correspondance de modèle intra

Country Status (2)

Country Link
CN (1) CN120958793A (fr)
WO (1) WO2024215643A1 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200036967A1 (en) * 2017-02-24 2020-01-30 Realnetworks, Inc. Motion vector selection and prediction in video coding systems and methods
US20220345692A1 (en) * 2021-04-26 2022-10-27 Tencent America LLC Template matching based intra prediction
US20230075788A1 (en) * 2021-09-01 2023-03-09 Tencent America LLC Template matching on ibc merge candidates
US20230098057A1 (en) * 2021-09-29 2023-03-30 Ofinno, Llc Template Matching Based Decoder Side Intra Mode Prediction

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20200036967A1 (en) * 2017-02-24 2020-01-30 Realnetworks, Inc. Motion vector selection and prediction in video coding systems and methods
US20220345692A1 (en) * 2021-04-26 2022-10-27 Tencent America LLC Template matching based intra prediction
US20230075788A1 (en) * 2021-09-01 2023-03-09 Tencent America LLC Template matching on ibc merge candidates
US20230098057A1 (en) * 2021-09-29 2023-03-30 Ofinno, Llc Template Matching Based Decoder Side Intra Mode Prediction

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KIM BUMYOON, JEON BYEUNGWOO: "Intra Coding Tools of Enhanced Compression beyond VVC Capability", JOURNAL OF BROADCAST ENGINEERING, KOREA, vol. 27, no. 7, 1 December 2022 (2022-12-01), Korea , pages 985 - 998, XP093222047, ISSN: 1226-7953, DOI: 10.5909/JBE.2022.27.7.985 *

Also Published As

Publication number Publication date
CN120958793A (zh) 2025-11-14

Similar Documents

Publication Publication Date Title
US12610043B2 (en) Intra prediction modes signaling
WO2023009459A1 (fr) Codage vidéo au moyen d'une prédiction intra multidirectionnelle
US20240129519A1 (en) Motion refinement with bilateral matching for affine motion compensation in video coding
US20240214580A1 (en) Intra prediction modes signaling
US12542898B2 (en) Methods and devices for decoder-side intra mode derivation
US20240195957A1 (en) Methods and devices for decoder-side intra mode derivation
US20250039437A1 (en) Methods and devices for multi-hypothesis-based prediction
WO2023283028A1 (fr) Partitionnement de géométrie pour prédiction à compensation de mouvement affine dans un codage vidéo
WO2022178433A1 (fr) Compensation d'éclairage local améliorée pour prédiction inter-composantes
WO2023034152A1 (fr) Procédés et dispositifs de dérivation de mode intra côté décodeur
US12526405B2 (en) Adaptive coding order for intra prediction in video coding
US20240187624A1 (en) Methods and devices for decoder-side intra mode derivation
WO2022271756A1 (fr) Codage vidéo utilisant une intra-prédiction multidirectionnelle
US20240214561A1 (en) Methods and devices for decoder-side intra mode derivation
CN120266472A (zh) 用于自适应环路滤波和跨分量自适应环路滤波器的方法和装置
US20260039865A1 (en) Search region modification for intra template matching prediction
WO2024215643A1 (fr) Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
WO2024254460A1 (fr) Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
WO2024220405A1 (fr) Modification de région de recherche pour prédiction de mise en correspondance de modèle intra
US20260082042A1 (en) Methods and devices for adaptive loop filter and cross-component adaptive loop filter
US20240146906A1 (en) On temporal motion vector prediction
US20250016368A1 (en) Intra prediction for video coding
WO2025076484A1 (fr) Procédés et dispositifs de copie de bloc intra
WO2024192287A1 (fr) Procédés et dispositifs pour filtre à boucle adaptatif et filtre à boucle adaptatif inter-composants
WO2024164022A1 (fr) Procédés et dispositifs pour filtre à boucle adaptatif et filtre à boucle adaptatif inter-composants

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE