Video coding method, apparatus, and computer program
Template matching in intra-block copy mode for video coding refines block vectors, addressing inefficiencies in existing techniques and improving compression and decoding accuracy.
Patent Information
- Application Number
- JP2023527784
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2022-08-29
- Filing Date
- 2022-08-30
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2042-08-30
AI Technical Summary
Existing video coding techniques face inefficiencies in intra-prediction and inter-prediction processes, particularly in handling block vectors and motion vectors, which affect compression ratios and decoding accuracy.
The implementation of template matching based on initial block vectors for intra-block copy (IBC) mode to refine block vectors, using IBC merge candidates and template matching to enhance precision and efficiency in video encoding and decoding processes.
Improves video compression efficiency by optimizing block vector determination through refined block vectors, reducing redundancy and enhancing decoding accuracy.
Smart Images

Figure 0007594106000001 
Figure 0007594106000002 
Figure 0007594106000003
Abstract
Description
[Technical field]
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This application claims benefit of priority to U.S. Provisional Application No. 63 / 239,767, entitled "TEMPLATE MATCHING ON IBC MERGE CANDIDATES," filed on September 1, 2021, which claims benefit of priority to U.S. Provisional Application No. 17 / 898,454, entitled "TEMPLATE MATCHING ON IBC MERGE CANDIDATES," filed on August 29, 2022. The disclosures of the prior applications are incorporated herein by reference in their entireties.
[0002] This disclosure describes embodiments related generally to video coding. [Background technology]
[0003] The background discussion provided herein is intended to provide a general context for the present disclosure. The inventors' work, to the extent that it is described in this background section, and aspects of the description that may not be admitted as prior art at the time of filing, are not admitted expressly or impliedly as prior art to the present disclosure.
[0004] Uncompressed digital video may include a sequence of pictures, each with spatial dimensions of, for example, 1920x1080 luma samples and associated chroma samples. The sequence of pictures may have a fixed or variable (informally also known as frame rate) picture rate of, for example, 60 pictures per second or 60 Hz. Uncompressed video has specific bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luma sample resolution at 60 Hz frame rate) at 8 bits per sample requires a bandwidth approaching 1.5 Gbit / s. One hour of such video requires more than 600 gigabytes of storage space.
[0005] One objective of video coding and decoding may be the reduction of redundancy in the input video signal through compression. Compression may help reduce the aforementioned bandwidth and / or storage space requirements, in some cases, by more than two orders of magnitude. Both lossless and lossy compression may be employed, as well as combinations thereof. Lossless compression refers to techniques that can reconstruct an exact copy of the original signal from the compressed original signal. With lossy compression, the reconstructed signal may not be identical to the original signal, but the distortion between the original and reconstructed signals is small enough to make the reconstructed signal useful for the intended application. For video, lossy compression is widely adopted. The amount of acceptable distortion depends on the application, e.g., a user of a particular consumer streaming application may tolerate higher distortion than a user of a television distribution application. The achievable compression ratio may reflect that a higher acceptable / tolerable distortion may result in a higher compression ratio.
[0006] Video encoders and decoders may utilize techniques from a number of broad categories, including, for example, motion compensation, transform, quantization, and entropy coding.
[0007] Video codec techniques can include a technique known as intra-coding. In intra-coding, sample values are represented without reference to samples or other data from previously reconstructed reference pictures. In some video codecs, a picture is spatially subdivided into blocks of samples. When all blocks of samples are coded in intra mode, the picture may be an intra picture. Intra pictures, and their derivatives, such as independent decoder refresh pictures, can be used to reset the decoder state, and therefore may be used as the first picture in a coded video bitstream and video session, or as still images. Samples of an intra block may be subjected to a transform, and the transform coefficients may be quantized before entropy coding. Intra prediction may be a technique that minimizes sample values in the pre-transform domain. In some cases, the smaller the DC value after the transform and the smaller the AC coefficients, the fewer bits are needed at a given quantization step size to represent the block after entropy coding.
[0008] Conventional intra-coding, for example as known from MPEG-2 generation coding techniques, does not use intra-prediction. However, some newer video compression techniques include techniques that attempt to predict from surrounding sample data and / or metadata obtained during encoding and / or decoding of a data block that is, for example, spatially adjacent and preceding in decoding order. Such techniques are hereafter referred to as "intra-prediction" techniques. It should be noted that, at least in some cases, intra-prediction uses only reference data from the current picture being reconstructed, and not from a reference picture.
[0009] There may be many different forms of intra-prediction. When two or more of such techniques may be used in a given video coding technique, the technique in use may be coded in an intra-prediction mode. In certain cases, a mode may have sub-modes and / or parameters that may be coded separately or included in the codeword of the mode. Which codeword is used for a given mode, sub-mode, and / or parameter combination may affect the coding efficiency gains via intra-prediction, and thus may also affect the entropy coding technique used to convert the codeword into a bitstream.
[0010] A specific mode of intra prediction was introduced in H.264, improved in H.265, and further improved in newer coding techniques such as the joint exploration model (JEM), versatile video coding (VVC), and benchmark sets (BMS). A predictor block may be formed using neighboring sample values belonging to already available samples. The sample values of the neighboring samples are copied to the predictor block according to the direction. The reference to the direction in use may be coded in the bitstream or may itself be predicted.
[0011] Referring to FIG. 1A, shown at the bottom right is a subset of 9 predictor directions known from the 33 possible predictor directions (corresponding to the 33 angle modes of the 35 intra modes) of H.265. The point (101) where the arrows converge represents the sample being predicted. The arrows represent the direction from which the sample is predicted. For example, arrow (102) indicates that sample (101) is predicted from one or more samples to the upper right at an angle of 45 degrees from the horizontal. Similarly, arrow (103) indicates that sample (101) is predicted from one or more samples to the lower left of sample (101) at an angle of 22.5 degrees from the horizontal.
[0012] 1A, at the top left is shown a square block (104) of 4×4 samples (indicated by a thick dashed line). The square block (104) contains 16 samples, each labeled with "S", its position in the Y dimension (e.g., row index), and its position in the X dimension (e.g., column index). For example, sample S21 is the second sample (from the top) in the Y dimension and the first sample (from the left) in the X dimension. Similarly, sample S44 is the fourth sample in both the Y and X dimensions in the block (104). Since the block is 4×4 samples in size, S44 is at the bottom right. Also shown are reference samples that follow a similar numbering scheme. The reference samples are labeled with R, their Y position (e.g., row index), and X position (column index) relative to the block (104). In both H.264 and H.265, the predicted samples are adjacent to the block being reconstructed, so negative values do not need to be used.
[0013] Intra-picture prediction may work by copying reference sample values from adjacent samples as assigned by the signaled prediction direction. For example, assume that the coded video bitstream includes signaling indicating a prediction direction that coincides with the arrow (102) for this block, i.e., the sample is predicted from one or more prediction samples located at an angle of 45 degrees from the horizontal and to the upper right. In that case, samples S41, S32, S23, and S14 are predicted from the same reference sample R05. Then, sample S44 is predicted from reference sample R08.
[0014] In certain cases, especially when the orientation is not evenly divisible by 45 degrees, the values of multiple reference samples may be combined, for example by interpolation, to calculate the reference sample.
[0015] The number of possible directions has increased as video coding techniques have developed. In H.264 (2003), nine different directions could be represented. In H.265 (2013), this increased to 33, and at the time of this disclosure, JEM / VVC / BMS can support up to 65 directions. Experiments have been performed to identify the most likely directions, and certain techniques of entropy coding are used to represent those likely directions with a small number of bits, accepting a certain penalty for less likely directions. Furthermore, the direction itself may be predicted from neighboring directions used in adjacent already decoded blocks.
[0016] FIG. 1B shows a schematic diagram (110) illustrating 65 intra prediction directions with JEM to illustrate the increasing number of prediction directions over time.
[0017] The mapping of intra-prediction direction bits in a coded video bitstream that represent the direction may vary from one video coding technique to another, and can range, for example, from a simple direct mapping of prediction directions to intra-prediction modes, to complex adaptation schemes involving codewords, most likely modes, and similar techniques. In all cases, however, there may be certain directions that are statistically less likely to occur in the video content than certain other directions. Because the goal of video compression is redundancy reduction, these less likely directions are represented by a greater number of bits than more likely directions in well-performing video coding techniques.
[0018] Video coding and decoding may be performed using inter-picture prediction with motion compensation. Motion compensation may be a lossy compression technique and may refer to a technique in which blocks of sample data from a previously reconstructed picture or part thereof (reference picture) are spatially shifted in a direction indicated by a motion vector (hereafter MV) and then used to predict a newly reconstructed picture or part of a picture. In some cases, the reference picture may be the same as the picture currently being reconstructed. The MV may have two dimensions X and Y, or three dimensions, with the third dimension being an indication of the reference picture in use (the latter may indirectly be a temporal dimension).
[0019] In some video compression techniques, the MV applicable to a particular region of sample data may be predicted from other MVs, e.g., from an MV associated with another region of sample data that is spatially adjacent to the region being reconstructed and precedes that MV in decoding order. Doing so may significantly reduce the amount of data required to code the MV, thereby eliminating redundancy and increasing the compression ratio. For example, when coding an input video signal derived from a camera (known as natural video), MV prediction may work effectively because there is a statistical likelihood that regions larger than the region to which a single MV is applicable move in similar directions and therefore, in some cases, can be predicted using similar motion vectors derived from MVs of neighboring regions. As a result, the detected MV for a given region is similar or the same as the MV predicted from the surrounding MVs and, after entropy coding, can be represented with fewer bits than would be used when coding the MV directly. In some cases, MV prediction may be an example of lossless compression of a signal (i.e., MV) derived from the original signal (i.e., sample stream). In other cases, the MV prediction itself may be lossy, e.g., due to rounding errors when computing a predictor from several surrounding MVs.
[0020] Various MV prediction mechanisms are described in H.265 / HEVC (ITU-T Recommendation H.265, "High Efficiency Video Coding", December 2016). Among the many MV prediction mechanisms offered by H.265, the one described herein is a technique hereafter referred to as "spatial merging".
[0021] Referring to Figure 2, a current block (201) contains samples that the encoder found during the motion search process to be predictable from a previous block of the same size but spatially shifted. Instead of coding its MV directly, the MV can be derived from metadata associated with one or more reference pictures, e.g., the most recent reference picture (in decoding order), using MVs associated with any one of five surrounding samples, denoted A0, A1, and B0, B1, B2 (202-206, respectively). In H.265, MV prediction can use predictors from the same reference picture that neighboring blocks are using. Summary of the Invention [Means for solving the problem]
[0022] Aspects of the present disclosure provide a method and apparatus for video encoding / decoding. In some examples, the apparatus for video decoding includes a processing circuit. In response to the current block being predicted in an intra block copy (IBC) mode, the processing circuit determines an initial block vector for predicting a current block in a current coding tree unit (CTU). The processing circuit performs template matching based on the initial block vector to determine an improved block vector pointing to a reference block in the picture as the current block, and reconstructs the current block based on the reference block. In some examples, the processing circuit determines the initial block vector based on a merge index included in the coded video bitstream. The merge index indicates a block vector candidate in an IBC merge candidate list including multiple IBC candidates for the IBC merge mode.
[0023] In one example, the processing circuit parses a first flag from the coded video bitstream indicating an IBC merge mode, and parses a second flag from the coded video bitstream indicating whether template matching is applied to block vector candidates of multiple IBC candidates for the IBC merge mode indicated by the merge index.
[0024] In another example, the processing circuit parses a flag indicating an IBC merge mode from the coded video bitstream, and template matching is applied to candidate block vectors for each block in the CTU that is predicted in the IBC merge mode.
[0025] In some examples, the processing circuit constructs an IBC merge candidate list that includes at least a first block vector candidate that points to a first location that is outside the IBC reference region.
[0026] In one example, in response to the merge index indicating the first block vector candidate, the processing circuit determines a position within the IBC reference region that is closest to the first position, and determines an initial block vector that points to the closest position.
[0027] In one example, to construct the IBC merge candidate list, the processing circuit inserts a first block vector candidate into the IBC merge candidate list in response to determining that a template matching search region of the first block vector candidate at least partially overlaps with the IBC reference region.
[0028] In some examples, the IBC reference region includes a reconstructed portion of the current CTU and a region of the left CTU that is cached in a memory space sized to store the CTU.
[0029] In some examples, the processing circuit excludes from template matching a portion of the template matching search region that is outside the IBC reference region.
[0030] Aspects of the present disclosure also provide a non-transitory computer-readable medium storing instructions that, when executed by a computer, cause the computer to perform a method for video decoding.
[0031] Further features, nature and various advantages of the disclosed subject matter will become more apparent from the following detailed description and the accompanying drawings. [Brief description of the drawings]
[0032] [Figure 1A] FIG. 2 is a schematic diagram of an example subset of intra-prediction modes. [Figure 1B] FIG. 2 is a diagram of an example intra-prediction direction. [Diagram 2] FIG. 2 is a schematic diagram of a current block and its surrounding spatial merge candidates in one example. [Diagram 3] 1 is a schematic diagram of a simplified block diagram of a communication system (300), according to one embodiment. [Figure 4] FIG. 4 is a schematic diagram of a simplified block diagram of a communication system (400) according to one embodiment. [Diagram 5] FIG. 2 is a schematic diagram of a simplified block diagram of a decoder according to one embodiment. [Figure 6] FIG. 2 is a schematic diagram of a simplified block diagram of an encoder according to one embodiment. [Figure 7] FIG. 4 is a block diagram of an encoder according to another embodiment. [Figure 8] FIG. 4 is a block diagram of a decoder according to another embodiment. [Figure 9] FIG. 2 illustrates an example of intra block copy according to one embodiment of the present disclosure. [Figure 10] FIG. 2 illustrates an example of intra block copy according to one embodiment of the present disclosure. [Figure 11] FIG. 2 illustrates an example of intra block copy according to one embodiment of the present disclosure. [Figure 12A] FIG. 2 illustrates an example of intra block copy according to one embodiment of the present disclosure. [Figure 12B] FIG. 13 illustrates another example of intra block copy according to an embodiment of the present disclosure. [Figure 12C] FIG. 13 illustrates yet another example of intra block copy according to an embodiment of the present disclosure. [Figure 12D] FIG. 13 illustrates yet another example of intra block copy according to an embodiment of the present disclosure. [Figure 13] FIG. 1 illustrates an example of a template matching search in some embodiments. [Figure 14] 1 is a table of adaptive motion vector resolution (AMVR) and merge mode search patterns in some examples. [Figure 15] FIG. 2 illustrates an example of pseudocode for template matching in some embodiments. [Figure 16] FIG. 13 is a diagram illustrating an example of prediction in an intra block copy mode according to an embodiment of the present disclosure. [Figure 17] 1 is a flowchart outlining a process according to some embodiments of the present disclosure. [Figure 18] 1 is a flowchart outlining another process in accordance with some embodiments of the present disclosure. [Figure 19] FIG. 1 is a schematic diagram of a computer system according to one embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0033] FIG. 3 illustrates a simplified block diagram of a communication system (300) according to one embodiment of the present disclosure. The communication system (300) includes a plurality of terminal devices that can communicate with each other via a network (350), for example. For example, the communication system (300) includes a first pair of terminal devices (310) and (320) interconnected via the network (350). In the example of FIG. 3, the first pair of terminal devices (310) and (320) perform unidirectional transmission of data. For example, the terminal device (310) may code video data (e.g., a stream of video pictures captured by the terminal device (310)) for transmission to another terminal device (320) via the network (350). The encoded video data may be transmitted in the form of one or more coded video bitstreams. The terminal device (320) may receive the coded video data from the network (350), decode the coded video data to reconstruct the video pictures, and display the video pictures according to the reconstructed video data. Unidirectional data transmission may be common, such as in media serving applications.
[0034] In another example, the communication system (300) includes a second pair of terminal devices (330) and (340) performing bidirectional transmission of coded video data, such as may occur during a video conference. In the case of bidirectional transmission of data, in one example, each of the terminal devices (330) and (340) may code video data (e.g., a stream of video pictures captured by the terminal device) for transmission to the other of the terminal devices (330) and (340) over the network (350). Each of the terminal devices (330) and (340) may also receive coded video data transmitted by the other of the terminal devices (330) and (340), decode the coded video data to recover the video pictures, and display the video pictures on an accessible display device according to the recovered video data.
[0035] In the example of FIG. 3, the terminal devices (310), (320), (330), and (340) may be depicted as a server, a personal computer, and a smartphone, although the principles of the present disclosure may not be so limited. Embodiments of the present disclosure find application with laptop computers, tablet computers, media players, and / or dedicated video conferencing equipment. The network (350) represents any number of networks that convey coded video data between the terminal devices (310), (320), (330), and (340), including, for example, wired and / or wireless communication networks. The communication network (350) may exchange data over circuit-switched and / or packet-switched channels. Representative networks include telecommunications networks, local area networks, wide area networks, and / or the Internet. For purposes of this description, the architecture and topology of the network (350) may not be important to the operation of the present disclosure, unless otherwise described herein below.
[0036] 4 shows an arrangement of a video encoder and a video decoder in a streaming environment as one example for application of the disclosed subject matter. The disclosed subject matter may be equally applicable to other video-enabled applications including, for example, video conferencing, digital television, storage of compressed video on digital media including CDs, DVDs, memory sticks, etc.
[0037] The streaming system may include a video source (401), which may include, for example, a digital camera, that creates a stream of uncompressed video pictures (402). In one example, the stream of video pictures (402) includes samples taken by a digital camera. The stream of video pictures (402), shown as a thick line to emphasize the large amount of data when compared to the encoded video data (404) (or coded video bitstream), may be processed by an electronic device (420) that includes a video encoder (403) coupled to the video source (401). The video encoder (403) may include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter, as described in more detail below. The encoded video data (404) (or encoded video bitstream (404)), shown as a thin line to emphasize the small amount of data when compared to the stream of video pictures (402), may be stored in a streaming server (405) for future use. One or more streaming client subsystems, such as the client subsystems (406) and (408) of FIG. 4, can access the streaming server (405) to retrieve copies (407) and (409) of the encoded video data (404). The client subsystem (406) can include, for example, a video decoder (410) in an electronic device (430). The video decoder (410) decodes an input copy (407) of the encoded video data and creates an output stream (411) of video pictures that can be rendered on a display (412) (e.g., a display screen) or other rendering device (not shown). In some streaming systems, the encoded video data (404), (407), and (409) (e.g., a video bitstream) may be encoded according to a particular video coding / compression standard.Examples of such standards include ITU-T Recommendation H.265. In one example, a video coding standard under development is informally known as Versatile Video Coding (VVC). The disclosed subject matter may be used in the context of VVC.
[0038] It should be noted that the electronic devices (420) and (430) may include other components (not shown). For example, the electronic device (420) may include a video decoder (not shown), and the electronic device (430) may also include a video encoder (not shown).
[0039] 5 shows a block diagram of a video decoder (510) according to one embodiment of the present disclosure. The video decoder (510) may be included in an electronic device (530). The electronic device (530) may include a receiver (531) (e.g., a receiving circuit). The video decoder (510) may be used in place of the video decoder (410) of the example of FIG. 4.
[0040] The receiver (531) may receive one or more coded video sequences to be decoded by the video decoder (510), one coded video sequence at a time in the same or another embodiment, with the decoding of each coded video sequence being independent of the other coded video sequences. The coded video sequences may be received from a channel (501), which may be a hardware / software link to a storage device that stores the encoded video data. The receiver (531) may receive the encoded video data along with other data, e.g., coded audio data and / or auxiliary data streams, that may be forwarded to their respective use entities (not shown). The receiver (531) may separate the coded video sequences from the other data. To combat network jitter, a buffer memory (515) may be coupled between the receiver (531) and the entropy decoder / parser (520) (hereinafter "parser (520)"). In certain applications, the buffer memory (515) is part of the video decoder (510). In other applications, it may be outside the video decoder (510) (not shown). In still other applications, there may be a buffer memory (not shown) outside the video decoder (510), e.g., to combat network jitter, plus another buffer memory (515) inside the video decoder (510), e.g., to handle playout timing. When the receiver (531) is receiving data from a store / forward device of sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (515) may not be needed or may be small.For use in a best effort packet network such as the Internet, the buffer memory (515) may be required and may be relatively large, advantageously may be of adaptive size, and may be implemented at least in part in an operating system or similar element (not shown) outside the video decoder (510).
[0041] The video decoder (510) may include a parser (520) to reconstruct symbols (521) from the coded video sequence. These categories of symbols include information used to manage the operation of the video decoder (510) and potentially information for controlling a rendering device such as a render device (512) (e.g., a display screen) that is not an integral part of the electronic device (530) but may be coupled to the electronic device (530) as shown in FIG. 5. The control information for the rendering device(s) may be in the form of a supplemental enhancement information (SEI message) or a video usability information (VUI) parameter set fragment (not shown). The parser (520) may parse / entropy decode the received coded video sequence. The coding of the coded video sequence may follow a video coding technique or standard and may follow various principles including variable length coding, Huffman coding, arithmetic coding, etc., with or without context sensitivity. The parser (520) may extract a set of subgroup parameters for at least one of the subgroups of pixels in the video decoder from the coded video sequence based on at least one parameter corresponding to the group. The subgroups may include groups of pictures (GOPs), pictures, tiles, slices, macroblocks, coding units (CUs), blocks, transform units (TUs), prediction units (PUs), etc. The parser (520) may also extract information from the coded video sequence, such as transform coefficients, quantizer parameter values, motion vectors, etc.
[0042] The parser (520) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (515) to create symbols (521).
[0043] The reconstruction of the symbols (521) may involve a number of different units, depending on the type of coded video picture or part thereof (such as inter-picture and intra-picture, inter-block and intra-block, etc.), as well as other factors. Which units are involved and how may be controlled by subgroup control information parsed from the coded video sequence by the parser (520). The flow of such subgroup control information between the parser (520) and the following units is not shown for clarity.
[0044] In addition to the functional blocks already mentioned, the video decoder (510) may be conceptually subdivided into several functional units, as described below. In an actual implementation operating under commercial constraints, many of these units may interact closely with each other and may be at least partially integrated with each other. However, for purposes of describing the disclosure, a conceptual subdivision into the following functional units is appropriate:
[0045] The first unit is a scalar / inverse transform unit (551). The scalar / inverse transform unit (551) receives quantized transform coefficients as well as control information including which transform to use, block size, quantization coefficients, quantization scaling matrices, etc. as symbol(s) (521) from the parser (520). The scalar / inverse transform unit (551) can output blocks containing sample values that can be input to an aggregator (555).
[0046] In some cases, the output samples of the scaler / inverse transform (551) may relate to intra-coded blocks, i.e., blocks that do not use prediction information from a previously reconstructed picture, but can use prediction information from a previously reconstructed portion of the current picture. Such prediction information may be provided by an intra-picture prediction unit (552). In some cases, the intra-picture prediction unit (552) generates a block of the same size and shape as the block being reconstructed using surrounding already reconstructed information fetched from a current picture buffer (558). The current picture buffer (558) buffers, for example, a partially reconstructed current picture and / or a fully reconstructed current picture. The aggregator (555) adds, possibly on a sample-by-sample basis, the prediction information generated by the intra-prediction unit (552) to the output sample information provided by the scaler / inverse transform unit (551).
[0047] In other cases, the output samples of the scalar / inverse transform unit (551) may relate to an inter-coded, potentially motion-compensated block. In such cases, the motion compensated prediction unit (553) may access the reference picture memory (557) to fetch samples used for prediction. After motion compensating the fetched samples according to the symbols (521) related to the block, these samples may be added by the aggregator (555) to the output of the scalar / inverse transform unit (551) to generate output sample information (in this case referred to as residual samples or residual signals). The addresses in the reference picture memory (557) from which the motion compensated prediction unit (553) fetches the prediction samples may be controlled by motion vectors available to the motion compensated prediction unit (553) in the form of symbols (521), which may have, for example, X, Y, and reference picture components. Motion compensation may also include interpolation of sample values fetched from the reference picture memory (557) when sub-sample accurate motion vectors are used, motion vector prediction mechanisms, etc.
[0048] The output samples of the aggregator (555) can be subjected to various loop filtering techniques in the loop filter unit (556). Video compression techniques can include in-loop filter techniques that are controlled by parameters contained in the coded video sequence (also called the coded video bitstream) and made available to the loop filter unit (556) as symbols (521) from the parser (520), but can also be responsive to previously reconstructed and loop filtered sample values as well as to meta-information obtained during decoding of a coded picture or previous part (in decoding order) of the coded video sequence.
[0049] The output of the loop filter unit (556) may be a sample stream that can be stored in a reference picture memory (557) for use in future inter-picture prediction as well as being output to the render device (512).
[0050] Once fully reconstructed, a particular coded picture may be used as a reference picture for future prediction. For example, once a coded picture corresponding to a current picture is fully reconstructed and the coded picture is identified (e.g., by the parser (520)) as a reference picture, the current picture buffer (558) may become part of the reference picture memory (557), and any unused current picture buffer may be reallocated before beginning reconstruction of the next coded picture.
[0051] The video decoder (510) may perform decoding operations according to a given video compression technique in a standard, such as ITU-T Recommendation H.265. The coded video sequence may conform to the syntax specified by the video compression technique or standard being used, in the sense that the coded video sequence adheres to both the syntax of the video compression technique or standard and the profile documented in the video compression technique or standard. Specifically, a profile may select a specific tool from all tools available in the video compression technique or standard as the only tool available in that profile. Also, what is required for compliance may be that the complexity of the coded video sequence is within a range defined by the level of the video compression technique or standard. In some cases, the level limits the maximum picture size, maximum frame rate, maximum reconstruction sample rate (e.g., measured in megasamples per second), maximum reference picture size, etc. The limits set by the level may be further limited in some cases by the specification of a hypothetical reference decoder (HRD) and metadata for HRD buffer management signaled within the coded video sequence.
[0052] In one embodiment, the receiver (531) may receive additional (redundant) data along with the encoded video. The additional data may be included as part of the coded video sequence. The additional data may be used by the video decoder (510) to properly decode the data and / or to more accurately reconstruct the original video data. The additional data may be in the form of, for example, temporal, spatial, or signal noise ratio (SNR) enhancement layers, redundant slices, redundant pictures, forward error correction codes, etc.
[0053] 6 shows a block diagram of a video encoder (603) according to one embodiment of the present disclosure. The video encoder (603) is included in an electronic device (620). The electronic device (620) includes a transmitter (640) (e.g., a transmission circuit). The video encoder (603) may be used in place of the video encoder (403) of the example of FIG.
[0054] The video encoder (603) may receive video samples from a video source (601) (which is not part of the electronic device (620) in the example of FIG. 6) that may capture video images to be coded by the video encoder (603). In another example, the video source (601) is part of the electronic device (620).
[0055] The video source (601) may provide a source video sequence to be coded by the video encoder (603) in the form of a digital video sample stream that may be of any suitable bit depth (e.g., 8-bit, 10-bit, 12-bit, ...), any color space (e.g., BT.601 Y CrCB, RGB, ...), and any suitable sampling structure (e.g., Y CrCb 4:2:0, Y CrCb 4:4:4). In a media serving system, the video source (601) may be a storage device that stores previously prepared video. In a video conferencing system, the video source (601) may be a camera that captures local image information as a video sequence. The video data may be provided as multiple individual pictures that convey motion when viewed in sequence. The pictures themselves may be organized as a spatial array of pixels, each of which may contain one or more samples depending on the sampling structure, color space, etc. in use. Those skilled in the art can easily understand the relationship between pixels and samples. The following description focuses on samples.
[0056] According to one embodiment, the video encoder (603) may code and compress pictures of a source video sequence into a coded video sequence (643) in real-time or under any other time constraint required by the application. Enforcing an appropriate coding rate is one function of the controller (650). In some embodiments, the controller (650) controls and is operatively coupled to other functional units described below. For clarity, coupling is not shown. Parameters set by the controller (650) may include rate control related parameters (picture skip, quantizer, lambda value for rate distortion optimization techniques, ...), picture size, group of pictures (GOP) layout, maximum motion vector search range, etc. The controller (650) may be configured with other appropriate functions associated with the video encoder (603) optimized for a particular system design.
[0057] In some embodiments, the video encoder (603) is configured to operate in a coding loop. As an oversimplified explanation, in one example, the coding loop may include a source coder (630) (e.g., responsible for generating symbols, such as a symbol stream, based on an input picture to be coded and a reference picture) and a (local) decoder (633) embedded in the video encoder (603). The decoder (633) reconstructs the symbols to create sample data in a manner similar to that which a (remote) decoder also does (since any compression between the symbols and the coded video bitstream is lossless in the video compression techniques contemplated in the disclosed subject matter). The reconstructed sample stream (sample data) is input to a reference picture memory (634). Since decoding of the symbol stream leads to a bit-exact result regardless of the location of the decoder (local or remote), the content in the reference picture memory (634) is also bit-exact between the local and remote encoders. In other words, the prediction part of the encoder "sees" exactly the same sample values as the reference picture samples that the decoder "sees" when using prediction during decoding. This basic principle of reference picture synchrony (and the resulting drift when synchrony cannot be maintained, e.g., due to channel errors) is also used in several related technologies.
[0058] The operation of the "local" decoder (633) may be the same as the operation of a "remote" decoder, such as the video decoder (510), already described in detail above in conjunction with Figure 5. However, and with brief reference to Figure 5, because symbols are available and the encoding / decoding of symbols into a coded video sequence by the entropy coder (645) and parser (520) may be lossless, the entropy decoding portion of the video decoder (510), including the buffer memory (515), and the parser (520), may not be fully implemented in the local decoder (633).
[0059] An observation that can be made at this point is that any decoder technology, except for parsing / entropy decoding, that is present in the decoder must also be present in substantially identical functional form in the corresponding encoder. For this reason, the disclosed subject matter focuses on the operation of the decoder. A description of the encoder technology may be omitted, since it is the inverse of the decoder technology described generically. Only in certain areas is more detailed description required and is provided below.
[0060] In operation, in some examples, the source coder (630) may perform motion-compensated predictive coding, which predictively codes an input picture with reference to one or more previously coded pictures from a video sequence designated as “reference pictures.” In this manner, the coding engine (632) codes differences between pixel blocks of the input picture and pixel blocks of reference pictures that may be selected as predictive references to the input picture.
[0061] The local video decoder (633) may decode the coded video data of pictures that may be designated as reference pictures based on the symbols created by the source coder (630). The operation of the coding engine (632) may advantageously be a lossy process. When the coded video data may be decoded in a video decoder (not shown in FIG. 6), the reconstructed video sequence may be a replica of the source video sequence, usually with some errors. The local video decoder (633) may replicate the decoding process that may be performed by the video decoder on the reference pictures, such that the reconstructed reference pictures are stored in a reference picture cache (634). In this way, the video encoder (603) may locally store copies of reconstructed reference pictures that have common content as reconstructed reference pictures obtained by a far-end video decoder (without transmission errors).
[0062] The predictor (635) may perform a prediction search for the coding engine (632). That is, for a new picture to be coded, the predictor (635) may search the reference picture memory (634) for sample data (as candidate reference pixel blocks) or specific metadata such as reference picture motion vectors, block shapes, etc., that may serve as suitable prediction references for the new picture. The predictor (635) may operate on sample blocks by pixel blocks to find suitable prediction references. In some cases, as determined by the search results obtained by the predictor (635), the input picture may have prediction references drawn from multiple reference pictures stored in the reference picture memory (634).
[0063] The controller (650) may manage the coding operations of the source coder (630), including, for example, setting the parameters and subgroup parameters used to encode the video data.
[0064] The output of all the aforementioned functional units may undergo entropy coding in an entropy coder (645), which converts the symbols produced by the various functional units into a coded video sequence by losslessly compressing the symbols according to techniques such as Huffman coding, variable length coding, arithmetic coding, etc.
[0065] The transmitter (640) may buffer the coded video sequence created by the entropy coder (645) and prepare it for transmission over a communication channel (660), which may be a hardware / software link to a storage device that stores the encoded video data. The transmitter (640) may merge the coded video data from the video coder (603) with other data to be transmitted, such as coded audio data and / or auxiliary data streams (sources not shown).
[0066] The controller (650) may manage the operation of the video encoder (603). During coding, the controller (650) may assign a particular coded picture type to each coded picture, which may affect the coding technique that may be applied to the respective picture. For example, pictures may often be assigned as any of the following picture types:
[0067] An intra picture (I-picture) may be one that can be coded and decoded without using other pictures in a sequence as a source of prediction. Some video codecs allow various types of intra pictures, including, for example, independent decoder refresh ("IDR") pictures. Those skilled in the art are aware of variations of I-pictures and their respective uses and functions.
[0068] A predictive picture (P picture) may be a picture that can be coded and decoded using intra- or inter-prediction, which uses at most one motion vector and reference index to predict sample values for each block.
[0069] A bidirectionally predicted picture (B-picture) may be a picture that can be coded and decoded using intra- or inter-prediction that uses up to two motion vectors and reference indices to predict the sample values of each block. Similarly, a multi-predicted picture may use more than two reference pictures and associated metadata for the reconstruction of a single block.
[0070] A source picture may generally be spatially subdivided into multiple sample blocks (e.g., blocks of 4x4, 8x8, 4x8, or 16x16 samples each) and coded block by block. Blocks may be predictively coded with reference to other (already coded) blocks as determined by a coding assignment applied to the respective picture of the block. For example, blocks of an I picture may be non-predictively coded, or they may be predictively coded with reference to already coded blocks of the same picture (spatial or intra prediction). Pixel blocks of a P picture may be predictively coded via spatial prediction or via temporal prediction with reference to one previously coded reference picture. Blocks of a B picture may be predictively coded via spatial prediction or via temporal prediction with reference to one or two previously coded reference pictures.
[0071] The video encoder (603) may perform coding operations in accordance with a given video coding technique or standard, such as ITU-T Recommendation H.265. In its operations, the video encoder (603) may perform various compression operations, including predictive coding operations that exploit temporal and spatial redundancy in the input video sequence. Thus, the coded video data may conform to a syntax specified by the video coding technique or standard being used.
[0072] In one embodiment, the transmitter (640) may transmit additional data along with the encoded video. The source coder (630) may include such data as part of the coded video sequence. The additional data may include temporal / spatial / SNR enhancement layers, other forms of redundant data such as redundant pictures and slices, SEI messages, VUI parameter set fragments, etc.
[0073] Video may be captured as multiple source pictures (video pictures) in a time sequence. Intra-picture prediction (often abbreviated as intra-prediction) exploits spatial correlation within a given picture, while inter-picture prediction exploits correlation (temporal or other) between pictures. In one example, a particular picture being encoded / decoded, called the current picture, is divided into blocks. When a block in the current picture is similar to a reference block in a reference picture that was previously coded and is still buffered in the video, the block in the current picture may be coded by a vector called a motion vector. A motion vector points to a reference block in a reference picture and may have a third dimension that identifies the reference picture if multiple reference pictures are used.
[0074] In some embodiments, inter-picture prediction may use a bi-prediction technique. According to the bi-prediction technique, two reference pictures, such as a first reference picture and a second reference picture, both of which are earlier in decoding order than the current picture in the video (but may be past and future in display order, respectively), are used. A block in the current picture may be coded by a first motion vector that points to a first reference block in the first reference picture and a second motion vector that points to a second reference block in the second reference picture. A block may be predicted by a combination of the first reference block and the second reference block.
[0075] Furthermore, merge mode techniques can be used in inter-picture prediction to improve coding efficiency.
[0076] According to some embodiments of the present disclosure, predictions such as inter-picture prediction and intra-picture prediction are performed on a block-by-block basis. For example, according to the HEVC standard, a picture in a sequence of video pictures is divided into coding tree units (CTUs) for compression, and the CTUs in a picture have the same size, such as 64×64 pixels, 32×32 pixels, or 16×16 pixels. In general, a CTU includes three coding tree blocks (CTBs), which are one luma CTB and two chroma CTBs. Each CTU may be recursively quadtree partitioned into one or more coding units (CUs). For example, a 64×64 pixel CTU may be partitioned into one 64×64 pixel CU, or four 32×32 pixel CUs, or sixteen 16×16 pixel CUs. In one example, each CU is analyzed to determine the prediction type of the CU, such as an inter prediction type or an intra prediction type. The CU is partitioned into one or more prediction units (PUs) depending on the temporal and / or spatial predictability. In general, each PU includes one luma prediction block (PB) and two chroma PBs. In one embodiment, prediction operations in coding (encoding / decoding) are performed in units of prediction blocks. Taking a luma prediction block as an example of a prediction block, the prediction block includes a matrix of pixel values (e.g., luma values) of 8×8 pixels, 16×16 pixels, 8×16 pixels, 16×8 pixels, etc.
[0077] 7 shows a diagram of a video encoder (703) according to another embodiment of the present disclosure. The video encoder (703) is configured to receive a processed block (e.g., a predictive block) of sample values in a current video picture in a sequence of video pictures and to encode the processed block into a coded picture that is part of a coded video sequence. In one example, the video encoder (703) is used in place of the video encoder (403) of the example of FIG. 4.
[0078] In an HEVC example, the video encoder (703) receives a matrix of sample values for a processing block, such as a predictive block of 8×8 samples. The video encoder (703) determines whether the processing block is best coded using intra mode, inter mode, or bi-predictive mode, e.g., using rate-distortion optimization. When the processing block is coded in intra mode, the video encoder (703) may encode the processing block into a coded picture using intra prediction techniques, and when the processing block is coded in inter mode or bi-predictive mode, the video encoder (703) may encode the processing block into a coded picture using inter prediction techniques or bi-predictive techniques, respectively. In certain video coding techniques, the merge mode may be an inter-picture prediction sub-mode in which motion vectors are derived from one or more motion vector predictors without the benefit of coded motion vector components outside the predictors. In certain other video coding techniques, there may be motion vector components applicable to the current block. In one example, the video encoder (703) includes other components, such as a mode decision module (not shown), to determine the mode of the processing block.
[0079] In the example of FIG. 7, the video encoder (703) includes an inter-encoder (730), an intra-encoder (722), a residual calculator (723), a switch (726), a residual encoder (724), a general controller (721), and an entropy encoder (725) coupled together as shown in FIG.
[0080] The inter-encoder (730) is configured to receive samples of a current block (e.g., a processing block), compare the block to one or more reference blocks in a reference picture (e.g., blocks in a previous picture and a subsequent picture), generate inter-prediction information (e.g., a description of redundancy information, motion vectors, merge mode information according to an inter-encoding technique), and calculate an inter-prediction result (e.g., a predictive block) based on the inter-prediction information using any suitable technique. In some examples, the reference picture is a decoded reference picture that is decoded based on the encoded video information.
[0081] The intra encoder (722) is configured to receive samples of a current block (e.g., a processing block), possibly compare the block with already coded blocks in the same picture, generate quantized coefficients after transformation, and possibly also generate intra prediction information (e.g., intra prediction direction information according to one or more intra encoding techniques). In one example, the intra encoder (722) also calculates intra prediction results (e.g., a prediction block) based on the intra prediction information and reference blocks in the same picture.
[0082] The generic controller (721) is configured to determine generic control data and control other components of the video encoder (703) based on the generic control data. In one example, the generic controller (721) determines the mode of the block and provides a control signal to the switch (726) based on the mode. For example, when the mode is an intra mode, the generic controller (721) controls the switch (726) to select an intra mode result for use by the residual calculator (723) and controls the entropy encoder (725) to select intra prediction information and include the intra prediction information in the bitstream, and when the mode is an inter mode, the generic controller (721) controls the switch (726) to select an inter prediction result for use by the residual calculator (723) and controls the entropy encoder (725) to select inter prediction information and include the inter prediction information in the bitstream.
[0083] The residual calculator (723) is configured to calculate a difference (residual data) between the received block and a prediction result selected from the intra-encoder (722) or the inter-encoder (730). The residual encoder (724) is configured to operate on the residual data to encode the residual data to generate transform coefficients. In one example, the residual encoder (724) is configured to transform the residual data from the spatial domain to the frequency domain to generate transform coefficients. The transform coefficients then undergo a quantization process to obtain quantized transform coefficients. In various embodiments, the video encoder (703) also includes a residual decoder (728). The residual decoder (728) is configured to perform an inverse transform and generate decoded residual data. The decoded residual data may be used by the intra-encoder (722) and the inter-encoder (730) as appropriate. For example, the inter-encoder (730) may generate decoded blocks based on the decoded residual data and the inter-prediction information, and the intra-encoder (722) may generate decoded blocks based on the decoded residual data and the intra-prediction information. In some examples, the decoded blocks are suitably processed to generate decoded pictures, which may be buffered in a memory circuit (not shown) and used as reference pictures.
[0084] The entropy encoder (725) is configured to format a bitstream to include the encoded block. The entropy encoder (725) is configured to include various information in accordance with an appropriate standard, such as the HEVC standard. In one example, the entropy encoder (725) is configured to include in the bitstream general control data, selected prediction information (e.g., intra-prediction information or inter-prediction information), residual information, and other appropriate information. It should be noted that, according to the disclosed subject matter, when coding a block in a merged sub-mode of either an inter mode or a bi-prediction mode, the residual information is not present.
[0085] 8 shows a diagram of a video decoder (810) according to another embodiment of the present disclosure. The video decoder (810) is configured to receive coded pictures that are part of a coded video sequence and to decode the coded pictures to generate reconstructed pictures. In one example, the video decoder (810) is used in place of the video decoder (410) of the example of FIG. 4.
[0086] In the example of FIG. 8, the video decoder (810) includes an entropy decoder (871), an inter decoder (880), a residual decoder (873), a reconstruction module (874), and an intra decoder (872) coupled together as shown in FIG.
[0087] The entropy decoder (871) may be configured to reconstruct from the coded picture certain symbols that represent syntax elements of which the coded picture is composed. Such symbols may include, for example, prediction information (e.g., intra prediction information or inter prediction information) that may identify the mode in which the block is coded (e.g., intra mode, inter mode, bi-predictive mode, merged sub-mode or another sub-mode, the latter two of which), certain samples or metadata used for prediction by the intra decoder (872) or the inter decoder (880), respectively, such as residual information in the form of quantized transform coefficients. In one example, when the prediction mode is an inter mode or a bi-predictive mode, the inter prediction information is provided to the inter decoder (880), and when the prediction type is an intra prediction type, the intra prediction information is provided to the intra decoder (872). The residual information may undergo inverse quantization and is provided to the residual decoder (873).
[0088] The inter decoder (880) is configured to receive the inter prediction information and to generate inter prediction results based on the inter prediction information.
[0089] The intra decoder (872) is configured to receive the intra prediction information and to generate a prediction result based on the intra prediction information.
[0090] The residual decoder (873) is configured to perform inverse quantization to extract inverse quantized transform coefficients, and process the inverse quantized transform coefficients to transform the residual from the frequency domain to the spatial domain. The residual decoder (873) may also require certain control information (to include quantizer parameters (QP)), which may be provided by the entropy decoder (871) (a data path is not shown as this may only be a small amount of control information).
[0091] The reconstruction module (874) is configured to combine, in the spatial domain, the residual output by the residual decoder (873) with a prediction result (possibly output by an inter-prediction module or an intra-prediction module) to form a reconstructed block that may be part of a reconstructed picture, which may be part of a reconstructed video. It should be noted that other suitable operations, such as a deblocking operation, may be performed to improve visual quality.
[0092] It should be noted that the video encoders (403), (603), and (703) and the video decoders (410), (510), and (810) may be implemented using any suitable technology. In one embodiment, the video encoders (403), (603), and (703) and the video decoders (410), (510), and (810) may be implemented using one or more integrated circuits. In another embodiment, the video encoders (403), (603), and (603) and the video decoders (410), (510), and (810) may be implemented using one or more processors executing software instructions.
[0093] Block-based compensation may be used for inter-prediction and intra-prediction. In the case of inter-prediction, block-based compensation from a different picture is known as motion compensation. Block-based compensation can also be done from a previously reconstructed area in the same picture, such as intra-prediction. Block-based compensation from a reconstructed area in the same picture is called intra-picture block compensation, current picture reference (CPR), or intra block copy (IBC). A displacement vector indicating the offset between a current block and a reference block (also called a predicted block) in the same picture is called a block vector (BV), and the current block may be encoded / decoded based on the reference block. Unlike the motion vector of motion compensation, which can take any value (positive or negative, in both x and y directions), BV has some constraints to ensure that the reference block is available and already reconstructed. Also, in some examples, some reference regions are excluded, which are tile boundaries, slice boundaries, or wavefront ladder shaped boundaries to allow for parallel processing.
[0094] In some examples, the IBC mode can be used to significantly improve the coding efficiency of screen content material. In general, the IBC mode can be implemented as a block-level coding mode. At the encoder side, the encoder can perform block matching (BM) to find the best block vector for each CU. In some examples, at the encoder side, a hash-based motion estimation (also called a hash-based search) is performed for the CU in the IBC mode. The encoder can perform a rate-distortion (RD) check for blocks with width or height of 16 luma samples or less. For non-merge modes, the block vector search is first performed using a hash-based search. If the hash search does not return a valid candidate, a block-matching-based local search can be performed.
[0095] In some examples, in the hash-based search, the hash key matching (32-bit CRC) between the current block and the reference block is extended to all allowed block sizes in the current picture. The hash key calculation for all positions in the current picture may be based on 4×4 sub-blocks. For a larger size current block, the hash key may be determined to match the hash key of the reference block if all the hash keys of all the 4×4 sub-blocks match the hash key of the corresponding reference position. If the hash keys of multiple reference blocks are found to match the hash key of the current block, a block vector cost for each of the matched reference blocks may be calculated, and then one matched reference block with the minimum cost is selected as the result of the hash-based search.
[0096] In some cases, the block matching search searches an area local to the current block, for example, the block matching search range is set to cover both the previous CTU and the current CTU.
[0097] In some embodiments, the resolution of the block vectors is limited to integer positions. In some other systems, the block vectors can point to fractional positions. In some examples, the luma block vectors of an IBC coded CU are integer precision. The chroma block vectors can also be rounded to integer precision. In some examples, the IBC mode can be combined with adaptive motion vector resolution (AMVR) to switch between 1 pixel (pel) and 4 pel motion vector precision. In some embodiments, the IBC mode is treated as a third prediction mode other than intra or inter prediction modes. The IBC mode is applicable to CUs with both width and height of 64 luma samples or less in some examples.
[0098] The coding of block vectors may be done explicitly or implicitly. In the explicit mode, the BV difference between the block vector and its predictor is signaled. In the implicit mode, the block vector is recovered from a predictor (called a block vector predictor) without using the BV difference in a manner similar to the motion vector in the merge mode. The explicit mode may be referred to as a non-merged BV prediction mode, or in some examples, an IBC AMVP mode. The implicit mode may be referred to as a merged BV prediction mode, an IBC merge mode, or an IBC skip mode in some examples.
[0099] There may be variations in the IBC mode. In one example, the IBC mode is treated as a third mode different from the intra-prediction mode and the inter-prediction mode. Thus, the BV prediction of the implicit mode (or IBC merge mode) and the explicit mode (IBC AMVP mode) is separated from the normal inter mode. In some examples, a separate merge candidate list may be defined for the IBC mode, and the entries in the separate merge candidate list are BVs. Similarly, in one example, the BV prediction candidate list of the IBC explicit mode (IBC AMVP mode) includes only BVs. The general rule that applies to the two lists (i.e., the separate merge candidate list for the IBC merge mode and the BV prediction candidate list for the IBC AMVP mode) is that the two lists may follow the same logic as the merge candidate list used in the normal merge mode (used in inter prediction) or the advanced motion vector prediction (AMVP) predictor list used in the normal AMVP mode (used in inter prediction) in terms of the candidate derivation process. For example, to derive a separate merge candidate list for the IBC merge mode, five spatially adjacent locations (e.g., A0, A1, and B0, B1, B2 in FIG. 2), e.g., HEVC or VVC mutual merge mode, are accessed for the IBC merge mode.
[0100] In one implementation example, for a CU, a block-level flag is used to signal whether IBC AMVP mode or IBC skip / merge mode is used. In one example, if the flag (e.g., denoted as merge_flag) is true, IBC skip / merge mode is used, and if the flag is false, IBC AMVP mode is used.
[0101] In some examples, for IBC skip / merge mode, a merge candidate index may be signaled to indicate which block vector in a merge candidate list from neighboring candidate IBC coded blocks is used as a BV predictor for predicting the current block. The merge candidate list may include spatial, history-based motion vector prediction (HMVP), and pair-wise candidates in some examples.
[0102] In some examples, for IBC AMVP mode, block vector differences are coded in the coded bitstream in the same way as motion vector differences. Block vector prediction in IBC AMVP mode can use two candidates as predictors, one from the left neighbor and one from the upper neighbor (if IBC coded). If any neighbor is unavailable, a default block vector can be used as the predictor. In one example, a flag is signaled in the coded bitstream to indicate the index of the BV predictor.
[0103] As mentioned before, the BV of the current block being reconstructed in the picture may have some constraints, and therefore the reference blocks of the current block are within the IBC reference region.
[0104] An IBC reference region refers to a portion of a picture from which a reference block can be selected. For example, an IBC reference region may be within a particular portion of a reconstructed area in a picture. The size, position, shape, etc. of the IBC reference region may be constrained. Alternatively, the BV may be constrained. In one example, the BV is a two-dimensional vector including x and y components, and at least one of the x and y components may be constrained. Constraints may be specified with respect to the BV, the IBC reference region, or a combination of the BV and the IBC reference region. In various examples, when some constraints are specified for the BV, the IBC reference region is constrained accordingly. Similarly, when certain constraints are specified for the IBC reference region, the BV is constrained accordingly.
[0105] FIG. 9 illustrates an example of intra block copy according to one embodiment of the present disclosure. A current picture (900) is reconstructed during decoding. The current picture (900) includes a reconstructed area (910) (gray area) and a to-be-decoded area (920) (white area). A current block (930) is being reconstructed by the decoder. The current block (930) may be reconstructed from a reference block (940) that is in the reconstructed area (910). The position offset between the reference block (940) and the current block (930) is called a block vector (950) (or BV (950)). In the example of FIG. 9, the IBC reference region (960) is in the reconstructed area (910), the reference block (940) is in the IBC reference region (960), and the block vector (950) is constrained to point to the reference block (940) in the IBC reference region (960).
[0106] Various constraints can be applied to the BV and / or IBC reference region. In one embodiment, the IBC reference region for the current block being reconstructed in the current CTB is constrained to be within the current CTB.
[0107] In one embodiment, the effective memory requirement for storing the reference samples used for intra block copy is one CTB size. In one example, the CTB size is 128×128 samples. The current CTB includes the current region being reconstructed. The current region has a size of 64×64 samples. The reference memory can store more reconstructed samples in the current region, so that the reference memory can store three more regions of 64×64 samples when the reference memory size is equal to the CTB size of 128×128 samples. Thus, the IBC reference region can include several parts of the previously reconstructed CTB, and the total memory requirement for storing the reference samples does not change (such as one CTB size of 128×128 samples, or a total of four reference samples of 64×64). In one example, the previously reconstructed CTB is next to the current CTB on the left, as shown in FIG. 10.
[0108] FIG. 10 illustrates an example of intra block copy according to an embodiment of the present disclosure. A current picture (1001) includes a current CTB (1015) being reconstructed and a previously reconstructed CTB (1010) immediately to the left of the current CTB (1015). The CTB in the current picture (1001) has a CTB size, such as 128×128 samples, and a CTB width, such as 128 samples. The current CTB (1015) includes four regions (1016)-(1019), and the current region (1016) is being reconstructed. The current region (1016) includes multiple coding blocks (1021)-(1029). Similarly, the previously reconstructed CTB (1010) also includes four regions (1011)-(1014). Coding blocks (1021)-(1025) have been reconstructed, current block (1026) is in the process of being reconstructed, and coding blocks (1026)-(1027) and regions (1017)-(1019) are yet to be reconstructed.
[0109] The current region (1016) has a juxtaposition region (i.e., region (1011) in the previously reconstructed CTB (1010)). The relative position of the juxtaposition region (1011) to the previously reconstructed CTB (1010) may be the same as the relative position of the current region (1016) to the current CTB (1015). In the example shown in FIG. 10, the current region (1016) is the top left region of the current CTB (1015), and therefore the juxtaposition region (1011) is also the top left region of the previously reconstructed CTB (1010). Because the position of the previously reconstructed CTB (1010) is offset from the position of the current CTB (1015) by the CTB width, the position of the juxtaposition region (1011) is offset from the position of the current region (1016) by the CTB width.
[0110] In one embodiment, the juxtaposition region of the current region (1016) is in a previously reconstructed CTB, whose position is offset by a CTB width or multiple from the position of the current CTB (1015), and thus the position of the juxtaposition region is also offset by a corresponding CTB width or multiple from the position of the current region (1016). The position of the juxtaposition region can be shifted left or up from the current region (1016).
[0111] As mentioned above, the size of the IBC reference region for the current block (1026) is constrained by the CTB size. In the example of FIG. 10, the IBC reference region may include regions (1012)-(1014) in the previously reconstructed CTB (1010) and parts of the current region (1016) already reconstructed, such as coding blocks (1021)-(1025). The collocation region (1011) may be excluded from the IBC reference region so that the size of the search range is within the CTB size. Referring to FIG. 10, the reference block (1091) is located in the region (1014) of the previously reconstructed CTB (1010). The block vector (1020) indicates the offset between the current block (1026) and the respective reference block (1091). The reference block (1091) is within the IBC reference region.
[0112] The example shown in FIG. 10 may be appropriately adapted to other situations where the current region is located at another position in the current CTB (1015). In one example, when the current block is in region (1017), the juxtaposition region of the current block is region (1012). Thus, the IBC reference region may include region (1013)-(1014), region (1016), and a part of the already reconstructed region (1017). Region (1011) and the juxtaposition region (1012) are further excluded from the search range so that the size of the IBC reference region is within the CTB size. In one example, when the current block is in region (1018), the juxtaposition region of the current block is region (1013). Thus, the IBC reference region may include region (1014), region (1016)-(1017), and a part of the already reconstructed region (1018). Further exclude regions (1011)-(1012) and juxtaposition region (1013) from the IBC reference region so that the size of the IBC reference region is within the CTB size. In one example, when the current block is in region (1019), the juxtaposition region of the current block is region (1014). Thus, the IBC reference region can include regions (1016)-(1018) and a part of the already reconstructed region (1019). Further exclude the previously reconstructed CTB (1010) from the IBC reference region so that the size of the IBC reference region is within the CTB size.
[0113] In the above description, the reference block may be in a previously reconstructed CTB (1010) or in the current CTB (1015).
[0114] In one embodiment, the IBC reference region may be specified as follows: In one example, the current picture is a luma picture and the current CTB is a luma CTB that includes multiple luma samples, and BV(mvL) satisfies the following bitstream compatibility constraints: In one example, BV(mvL) has a fractional resolution (e.g., 1 / 16pel resolution).
[0115] The constraint includes a first condition that the reference block of the current block has already been reconstructed. If the shape of the reference block is rectangular, an adjacent block availability check process (or a reference block availability check process) can be implemented to check whether the top-left sample and the bottom-right sample of the reference block have been reconstructed. If the top-left sample and the bottom-right sample of the reference block are both reconstructed, the reference block is determined to be reconstructed.
[0116] For example, if the reference block availability derivation process is called with the position (xCurr, yCurr) of the top-left sample of the current block set to (xCb, yCb) as input, and the position of the top-left sample of the reference block (xCb+(mvL[0]>>4),yCb+(mvL[1]>>4)), the output will be TRUE when the top-left sample of the reference block has been reconstructed and the block vector mvL is a two-dimensional vector with x-component mvL[0] and y-component mvL[1]. If BV(mvL) has a fractional resolution, such as 1 / 16pel resolution, then the x-component mvL[0] and y-component mvL[1] are shifted to have integer resolution, as indicated by mvL[0]>>4 and mvL[1]>>4, respectively.
[0117] Similarly, if the block availability derivation process is called with the position (xCurr,yCurr) of the top-left sample of the current block set to (xCb,yCb) as input, and the position of the bottom-right sample of the reference block (xCb+(mvL[0]>>4)+cbWidth-1,yCb+(mvL[1]>>4)+cbHeight-1), the output will be TRUE when the bottom-right sample of the reference block has been reconstructed. The parameters cbWidth and cbHeight represent the width and height of the reference block.
[0118] The constraint may also include at least one of the following second conditions: 1) the value (mvL[0] >> 4) + cbWidth is less than or equal to 0, indicating that the reference block is to the left of the current block and does not overlap the current block; 2) the value (mvL[1] >> 4) + cbHeight is less than or equal to 0, indicating that the reference block is above the current block and does not overlap the current block.
[0119] The constraints may also further include that a third condition is satisfied by the block vector mvL: (yCb+(mvL[1]>>4))>>CtbLog2SizeY=yCb>>CtbLog2SizeY (1) (yCb+(mvL[1]>>4+cbHeight-1)>>CtbLog2SizeY=yCb>>CtbLog2Size (2) (xCb+(mvL[0]>>4))>>CtbLog2SizeY>=(xCb>>CtbLog2SizeY)-1 (3) (xCb+(mvL[0]>>4)+cbWidth-1)>>CtbLog2SizeY<=(xCb>>CtbLog2SizeY) (4) Here, the parameter CtbLog2SizeY represents the CTB width in log2 format. For example, when the CTB width is 128 samples, CtbLog2SizeY is 7. Equations (1)-(2) indicate that the CTB containing the reference block is in the same CTB row as the current CTB (e.g., when the reference block is in the previously reconstructed CTB(1010), the previously reconstructed CTB(1010) is in the same row as the current CTB(1015)). Equations (3)-(4) indicate that the CTB containing the reference block is either in the left CTB column of the current CTB or in the same CTB column as the current CTB. The third condition described by equations (1)-(4) indicates that the CTB containing the reference block is either the current CTB, such as the current CTB(1015), or the left neighbor of the current CTB, such as the previously reconstructed CTB(1010), as described with reference to FIG. 10.
[0120] The constraint may further include a fourth condition, where the juxtaposition region of the reference block is not reconstructed (i.e., there are no reconstructed samples in the juxtaposition region) when the reference block is to the left of the current CTB. Also, the juxtaposition region of the reference block is within the current CTB. In the example of FIG. 10, the juxtaposition region of the reference block (1091) is the region (1019) offset by the CTB width from the region (1014) in which the reference block (1091) is located, and the region (1019) is not reconstructed. Therefore, the block vector (1020) and the reference block (1091) satisfy the fourth condition described above.
[0121] In one example, the fourth condition can be specified as follows: when (xCb+(mvL[0]>>4))>>CtbLog2SizeY is equal to (xCb>>CtbLog2SizeY)-1, the reference block availability derivation process is called with the current block position (xCurr, yCurr) set to (xCb, yCb) as input, and the position (((xCb+(mvL[0]>>4)+CtbSizeY)>>(CtbLog2SizeY-1))<<(CtbLog2SizeY-1),((yCb+(mvL[1]>>4))>>(CtbLog2SizeY-1))<<(CtbLog2SizeY-1)), and the output will be FALSE indicating that the juxtaposition region has not been reconstructed, as shown in FIG. 10.
[0122] The constraints on the IBC reference region and / or block vector may include any suitable combination of the first, second, third, and fourth conditions described above. In one example, the constraints include the first, second, third, and fourth conditions as shown in Figure 10. In one example, the first, second, third, and / or fourth conditions may be modified, and the constraints include the modified first, second, third, and / or fourth conditions.
[0123] According to the fourth condition, when one of the coding blocks (1022)-(1029) is the current block, the reference block cannot be in the region (1011), and therefore the region (1011) is excluded from the IBC reference region for one of the coding blocks (1022)-(1029). The reason for excluding the region (1011) is specified as follows: if the reference block were in the region (1011), the juxtaposition region for the reference block would be the region (1016), but at least the samples in the coding block (1021) have been reconstructed, thus violating the fourth condition. On the other hand, for the coding block that is reconstructed first in the current region, such as the coding block (1121) in the region (1116) in FIG. 11, the fourth condition does not prevent the reference block from being placed in the region (1111), since the juxtaposition region (1116) for the reference block has not yet been reconstructed.
[0124] FIG. 11 illustrates an example of intra block copy according to an embodiment of the present disclosure. A current picture (1101) includes a current CTB (1115) being reconstructed and a previously reconstructed CTB (1110) located to the left of the current CTB (1115). The CTBs in the current picture (1101) have a CTB size and a CTB width. The current CTB (1115) includes four regions (1116)-(1119), and the current region (1116) is being reconstructed. The current region (1116) includes multiple coding blocks (1121)-(1129). Similarly, the previously reconstructed CTB (1110) also includes four regions (1111)-(1114). The current block (1121) being reconstructed is first reconstructed in the current region (1116), and then the coding blocks (1122)-(1129) are reconstructed. In one example, the CTB size is 128x128 samples, and regions (1111)-(1114) and (1116)-(1119) are each 64x64 samples. The reference memory size is 128x128 samples, which is equal to the CTB size, so the IBC reference region, when bounded by the reference memory size, includes three regions and a portion of the additional region.
[0125] Similarly, as described with reference to FIG. 10, the current region (1116) has a collocation region (i.e., region (1111) in the previously reconstructed CTB (1110)). According to the fourth condition described above, the reference block (1121) of the current block may be in region (1111), and thus the IBC reference region may include regions (1111) to (1114). For example, when the reference block is in region (1111), the collocation region of the reference block is region (1116), and there are no samples in region (1116) that have been reconstructed before the current block (1121) is reconstructed. However, as described with reference to FIG. 10 and the fourth condition, for example, after the coding block (1121) is reconstructed, the region (1111) cannot be included in the IBC reference region to reconstruct the coding block (1122). Therefore, strict synchronization and timing control of the reference memory buffer is used, which may be difficult.
[0126] According to some embodiments, when the current block is first reconstructed in the current region of the current CTB, the collocation region of the current region in the previously reconstructed CTB can be excluded from the IBC reference region, and the current CTB and the previously reconstructed CTB are in the same current picture. The block vector can be determined such that the reference block is in the IBC reference region excluding the collocation region in the previously reconstructed CTB. In one embodiment, the IBC reference region includes the coding block reconstructed in decoding order after the collocation region and before the current block.
[0127] In the following description, the CTB size can be changed and the maximum CTB size is set to be the same as the reference memory size. In one example, the reference memory size or the maximum CTB size is 128×128 samples. The description can be appropriately adapted to other reference memory sizes or maximum CTB sizes.
[0128] In one embodiment, the CTB size is equal to the reference memory size, the previously reconstructed CTB is to the left of the current CTB, the position of the juxtaposition region is offset from the position of the current region by the CTB width, and the coding blocks in the IBC reference region are in at least one of the current CTB and the previously reconstructed CTB.
[0129] 12A-12D show an example of intra block copy according to an embodiment of the present disclosure. Referring to FIG. 12A-12D, a current picture (1201) includes a current CTB (1215) being reconstructed and a previously reconstructed CTB (1210) located to the left of the current CTB (1215). The CTB in the current picture (1201) has a CTB size and a CTB width. The current CTB (1215) includes four regions (1216)-(1219). Similarly, the previously reconstructed CTB (1210) also includes four regions (1211)-(1214). In one embodiment, the CTB size is the maximum CTB size and is equal to the reference memory size. In one example, the CTB size and reference memory size are 128×128 samples, and therefore each of the regions (1211)-(1214) and (1216)-(1219) has a size of 64×64 samples.
[0130] In the example shown in Figures 12A-12D, the current CTB (1215) includes an upper left region, an upper right region, a lower left region, and a lower right region, which correspond to regions (1216)-(1219), respectively. The previously reconstructed CTB (1210) includes an upper left region, an upper right region, a lower left region, and a lower right region, which correspond to regions (1211)-(1214), respectively.
[0131] Referring to FIG. 12A, a current region (1216) is being reconstructed. The current region (1216) may include multiple coding blocks (1221)-(1229). The current region (1216) has a juxtaposition region, i.e., a region (1211) in a previously reconstructed CTB (1210). The juxtaposition region (1211) may be excluded from the IBC reference region of one of the coding blocks (1221)-(1229) to be reconstructed. The IBC reference region may include regions (1212)-(1214) of the previously reconstructed CTB (1210) that were reconstructed after the juxtaposition region (1211) and before the current region (1216) in decoding order.
[0132] 12A, the position of the juxtaposition region (1211) is offset from the position of the current region (1216) by a CTB width, such as 128 samples. For example, the position of the juxtaposition region (1211) is shifted left by 128 samples from the position of the current region (1216).
[0133] Referring again to FIG. 12A, when the current region (1216) is in the upper left region of the current CTB (1215), the juxtaposition region (1211) is in the upper left region of the previously reconstructed CTB (1210), excluding the upper left region of the previously reconstructed CTB from the search region.
[0134] As shown in FIG. 12A, the current block is classified as the top left 64×64 block (e.g., current region (1216)) of the current CTU (e.g., denoted by CTB (1215)), and then, in addition to the already reconstructed samples in the current CTU (denoted by CTB (1215)), the samples in the bottom right 64×64 block (e.g., denoted by (1214)) of the left CTU (e.g., denoted by CTB (1210)) can be referred to as reference samples, for example, using a current picture reference (CPR) mode. The current block can also reference samples in the bottom left 64×64 block (e.g., denoted by (1213)) of the left CTU (e.g., denoted by CTB (1210)) and samples in the top right 64×64 block (e.g., denoted by (1212)) of the left CTU (e.g., denoted by CTB (1210)) using the CPR mode.
[0135] Referring to FIG. 12B, a current region (1217) is being reconstructed. The current region (1217) may include a plurality of coding blocks (1241)-(1249). The current region (1217) has a juxtaposition region (i.e., a region (1212) in the previously reconstructed CTB (1210). The juxtaposition region (1212) may be excluded from an IBC reference region of one of the plurality of coding blocks (1241)-(1249). The IBC reference region includes regions (1213)-(1214) in the previously reconstructed CTB (1210) and a region (1216) in the current CTB (1215) that is reconstructed after the juxtaposition region (1212) and before the current region (1217). Due to the constraint of the reference memory size (i.e., one CTB size), a region (1211) is further excluded from the IBC reference region. Similarly, the position of the juxtaposition region (1212) is offset from the position of the current region (1217) by a CTB width, such as 128 samples.
[0136] In the example of Figure 12B, the current region (1217) is in the upper right region of the current CTB (1215), and the juxtaposition region (1212) is also in the upper right region of the previously reconstructed CTB (1210), excluding the upper right region of the previously reconstructed CTB (1210) from the search region.
[0137] As shown in FIG. 12B, if the current block is classified as the top right 64x64 block (e.g., shown as (1217)) of the current CTU (e.g., shown as CTB (1215)), in addition to the already reconstructed samples (e.g., shown as (1216)) in the current CTU, if the luma position (0,64) for the current CTU has not yet been reconstructed, the current block can also reference samples in the bottom left 64x64 block (e.g., shown as (1213)) and bottom right 64x64 block (e.g., shown as (1214)) of the left CTU using the CPR mode, otherwise the current block can also reference reference samples in the bottom right 64x64 block (e.g., shown as (1214)) of the left CTU.
[0138] Referring to FIG. 12C, a current region (1218) is being reconstructed. The current region (1218) may include a plurality of coding blocks (1261)-(1269). The current region (1218) has a juxtaposition region (i.e., region (1213)) in a previously reconstructed CTB (1210). The juxtaposition region (1213) may be excluded from an IBC reference region of one of the plurality of coding blocks (1261)-(1269). The IBC reference region includes a region (1214) in the previously reconstructed CTB (1210) and regions (1216)-(1217) in the current CTB (1215) that are reconstructed after the juxtaposition region (1213) and before the current region (1218). Similarly, regions (1211)-(1212) are further excluded from the IBC reference region due to the reference memory size constraint. The location of the juxtaposition region (1213) is offset from the location of the current region (1218) by a CTB width, such as 128 samples. In the example of Figure 12C, when the current region (1218) is in the lower left region of the current CTB (1215), the juxtaposition region (1213) is also in the lower left region of the previously reconstructed CTB (1210), excluding the lower left region of the previously reconstructed CTB (1210) from the search region.
[0139] As shown in FIG. 12C, if the current block is classified as the bottom left 64x64 block (e.g., as shown by (1218)) of the current CTU (e.g., as shown by CTB (1215)), in addition to the already reconstructed samples (e.g., (1216) and (1217)) in the current CTU, if the luma position (64,0) for the current CTU has not yet been reconstructed, the current block can also reference samples in the bottom right 64x64 block (e.g., as shown by (1214)) of the left CTU using CPR mode.
[0140] Referring to FIG. 12D, a current region (1219) is being reconstructed. The current region (1219) may include a plurality of coding blocks (1281)-(1289). The current region (1219) has a juxtaposed region (i.e., region (1214)) in a previously reconstructed CTB (1210). The juxtaposed region (1214) may be excluded from an IBC reference region of one of the plurality of coding blocks (1281)-(1289). The IBC reference region includes regions (1216)-(1218) in a current CTB (1215) that are reconstructed after the juxtaposed region (1214) and before the current region (1219) in decoding order. Due to reference memory size constraints, regions (1211)-(1213) are excluded from the IBC reference region, and thus the previously reconstructed CTB (1210) is excluded from the IBC reference region. Similarly, the location of the juxtaposition region (1214) is offset from the location of the current region (1219) by a CTB width, such as 128 samples. In the example of Figure 12D, when the current region (1219) is in the lower right region of the current CTB (1215), the juxtaposition region (1214) is also in the lower right region of the previously reconstructed CTB (1210), excluding the lower right region of the previously reconstructed CTB (1210) from the search region.
[0141] In FIG. 12D, the current block falls into the bottom right 64×64 block of the current CTU (denoted by (1219)), which can only reference already reconstructed samples in the current CTU (e.g., (1216), (1217) and (1218)) using CPR mode.
[0142] Using the restrictions shown in FIGS. 12A-12D, the IBC mode can be implemented using local on-chip memory for hardware implementation in some examples.
[0143] According to one aspect of the present disclosure, template matching (TM) search refers to a decoder-side MV derivation technique that refines the motion information of a current CU by finding the closest match between a template in the current picture (i.e., the neighboring blocks above and / or to the left of the current CU) and a block in a reference picture (i.e., the same size as the template, called the reference template).
[0144] Figure 13 shows an example of a template matching search in some embodiments. In the example of Figure 13, a current picture (1310) includes a current CU being reconstructed, and a current template of the current CU includes a block above and a block to the left that are adjacent to the current CU. The block above and the block to the left form a current template of the current CU. In a reference picture (1320) of the current picture (1310), an initial motion vector (MV) points to a reference position, and a search region (1350) is defined as a region within [-8pel, +8pel] of the reference position in the X and Y directions.
[0145] In one example, a template matching search is used to search for a better MV in the search area (1350) that has the closest match between the reference template and the current template. In some examples, the template matching technique can use a search step size determined based on the AMVR mode, and the template matching search can be cascaded with the bilateral matching process of the merge mode.
[0146] In some examples, in AMVP mode, a motion vector predictor (MVP) candidate is selected from a list of candidates based on a template error calculation, which may select an MVP candidate with the smallest difference between the current template and the reference template. Then, a template matching search is performed based on the particular MVP candidate for this MV refinement. In some examples, the template matching search refines this MVP candidate starting with a full-pel motion vector difference (MVD) accuracy (or 4 pel for 4 pel AMVR mode) in a [-8, +8] pel search range by using a repeated diamond search pattern. The AMVP candidate may be further refined by using a full-pel MVD accuracy (or 4 pel for 4 pel AMVR mode) traversal search pattern, followed by a half-pel traversal search pattern and a quarter-pel traversal search pattern sequentially depending on the AMVR mode. This search process ensures that the MVP candidate maintains the same MV accuracy as indicated by the AMVR mode after the TM search process.
[0147] FIG. 14 shows a table (1400) of search patterns for AMVR and merge modes in some examples.
[0148] In some examples, in the merge mode, a similar search method is applied to the merge candidates indicated by the merge index. As shown in the table of FIG. 14, the TM search may be performed up to 1 / 8-pel MVD accuracy or skip over half-pel MVD accuracy depending on whether an alternative interpolation filter (used when AMVR is in half-pel mode) is used according to the merged motion information. For example, a variable AltIF of 0 indicates that an alternative interpolation filter is not used and the TM search may be performed up to 1 / 8-pel MVD accuracy, and a variable AltIF of 1 indicates that an alternative interpolation filter is used and the TM search may be performed up to half-pel accuracy. Furthermore, when the TM mode is enabled, the template matching may function as an independent process or an additional MV refinement process between the block-based and sub-block-based bilateral matching methods depending on whether bilateral matching can be enabled according to the enablement condition check.
[0149] According to some aspects of the present disclosure, a template matching technique can be used in IBC mode to perform a template matching search based on the IBC merging candidates to achieve block vector refinement.
[0150] According to one aspect of the present disclosure, for the merge candidate list of IBC mode, only a certain number of candidates can be present on the merge candidate list, and the merge index is signaled to indicate one in the merge candidate list. However, using a template matching method, the decoder may be able to derive the best block vector by searching for nearby block vectors based on the template. Furthermore, while constructing the IBC merge candidate list, the candidate BVs that are outside the IBC reference region are considered invalid, and the invalid candidate BVs are removed from the merge candidate list. However, the best BV may be obtained from these invalid candidate BVs.
[0151] Some aspects of the present disclosure provide techniques to allow for invalid BVs in a merge candidate list and perform a template matching search based on the invalid BVs to achieve better BVs (e.g., less template error) in IBC mode.
[0152] In one embodiment, a flag may be used to indicate whether template matching is applied to IBC merge candidates.
[0153] FIG. 15 shows an example of pseudocode (1500) for template matching in some embodiments.
[0154] In the example of FIG. 15, when the current block (PU) is in IBC mode, a first flag (e.g., represented by merge_flag) is signaled in the coded bitstream to indicate whether the current block is coded in IBC AMVP mode or IBC merge mode. The first flag can be parsed from the bitstream as shown by (1501) in FIG. 15. When the first flag (merge_flag) is equal to 1, the current block is coded using IBC merge mode. When the current block is in IBC merge mode, a second flag (e.g., represented by template_matching_ibc_merge_flag) and a merge index (e.g., represented by merge_idx) are signaled in the coded bitstream. The second flag can be parsed from the coded bitstream as shown by (1502) in FIG. 15, and the merge index can be parsed from the coded bitstream as shown by (1503) in FIG. 15.
[0155] The merge index indicates a candidate BV in the IBC merge candidate list. When the second flag (e.g., template_matching_ibc_merge_flag) is equal to 1, the template matching search can be performed with the candidate BV indicated by the merge index in the IBC merge candidate list as the initial BV. When the second flag (template_matching_ibc_merge_flag) is equal to 0, in one example, the template matching search is disabled, and the candidate BV indicated by the merge index is used as a block vector pointing to a reference block to reconstruct the current block (current PU).
[0156] In some embodiments, the template matching search is coupled with the IBC merge mode. Thus, the template matching search may be applied in the IBC merge mode without signaling a second flag (e.g., template_matching_ibc_merge_flag). The merge index may be signaled to indicate a candidate BV from the IBC merge candidate list to be used as the initial BV for template matching.
[0157] According to another aspect of the present disclosure, during construction of an IBC merging candidate list, in the process of checking the validity of each IBC merging candidate, instead of using only the IBC reference region, a template matching search range (Sr) is considered along with the IBC reference region.
[0158] FIG. 16 illustrates an example of an IBC according to an embodiment of the present disclosure. In FIG. 16, a current picture (1601) includes a current CTB (1615) being reconstructed and a previously reconstructed CTB (1610) immediately to the left of the current CTB (1615). The current CTB (1615) includes four regions (1616)-(1619). Similarly, the previously reconstructed CTB (1610) also includes four regions (1611)-(1614). In one embodiment, the CTB size is the maximum CTB size and is equal to the reference memory size. In one example, the CTB size and the reference memory size are 128×128 samples, and therefore each region (1611)-(1614) and (1616)-(1619) has a size of 64×64 samples.
[0159] In the example of Figure 16, a current region (1616) is being reconstructed. The current region (1616) has a juxtaposition region, i.e., a region (1611) in the previously reconstructed CTB (1610). The juxtaposition region (1611) may be excluded from the IBC reference region for the current block (1650) being reconstructed. The IBC reference region may include regions (1612)-(1614) of the previously reconstructed CTB (1610) that were reconstructed after the juxtaposition region (1611) and before the current region (1616) in decoding order.
[0160] In the example of FIG. 16, an arrow (1651) indicates a candidate BV in the IBC merge candidate list. The candidate BV points to location A. A rectangular box (1652) around location A is a template matching search range that can be expressed as Sr. In one example, location A has two-dimensional coordinates (x0, y0). The rectangular box (1652) can then be defined by its four corners: (x0-Sr, y0-Sr), (x0+Sr, y0-Sr), (x0-Sr, y0+Sr), and (x0+Sr, y0+Sr). In some related examples, the candidate BV (1651) is considered invalid and is not included in the IBC merge candidate list because location A is outside the IBC reference region (region (1611) is excluded from the IBC reference region).
[0161] In some embodiments, an invalid merge candidate such as candidate BV (1651) may be inserted into the IBC merge candidate list. To perform a template matching search based on candidate BV (1651), position A (pointed to by candidate BV (1651)) is moved within the IBC reference range, e.g., to position C, which is the closest position within the valid IBC reference range to position A. The template matching search may then start further searching and refinement within the template matching search range from position C. In the example of FIG. 16, if the top left corner B of region (1612) has 2D coordinates of (x1, y1), position C may have 2D coordinates of (x1, y0) in the example.
[0162] In some embodiments, during the validation check of an IBC merge candidate, if the template matching search range of the BV is partially or completely aligned with the IBC reference region, the candidate BV is considered valid. In the example of FIG. 16, the template matching search region (1652) for the candidate BV (1651) partially overlaps with the IBC reference region (including region (1612), region (1613), and region (1614)), so the candidate BV (1651) can be considered valid and put into the IBC merge candidate list. In another example, if x0+Sr>x1, the candidate BV (1651) is valid. Similarly, if y0+Sr>y1, the candidate BV (1651) is valid.
[0163] In addition, according to one aspect of the present disclosure, during a template matching search, if an intermediate block vector is outside the IBC reference region, the intermediate block vector is not considered, and template matching calculations for the intermediate block vector (e.g., difference calculations between the current template and the reference template pointed to by the intermediate block vector) can be skipped.
[0164] FIG. 17 shows a flow chart outlining a process (1700) according to one embodiment of the present disclosure. The process (1700) may be used in a video encoder. In various embodiments, the process (1700) is performed by a processing circuit, such as the processing circuit of the terminal devices (310), (320), (330), and (340), a processing circuit performing the function of the video encoder (403), a processing circuit performing the function of the video encoder (603), a processing circuit performing the function of the video encoder (703), etc. In some embodiments, the process (1700) is implemented in software instructions, and thus, the processing circuit performs the process (1700) when the processing circuit executes the software instructions. The process starts at (S17301) and proceeds to (S1710).
[0165] At (S1710), an initial block vector for predicting a current block in a current coding tree unit (CTU) is determined when the current block is in an IBC mode.
[0166] At (S1720), a template matching search is performed based on the initial block vector to determine a refined block vector that points to a reference block in the same picture as the current block.
[0167] At (S1730), a reconstructed current block is generated based on the reference block.
[0168] At (S1740), a coded video bitstream carrying the picture is encoded to include information indicating an initial block vector.
[0169] In some examples, a merge index indicating a block vector candidate from the merge candidate list is encoded in the coded video bitstream, and the initial block vector is determined based on the block vector candidate. In some examples, the block vector candidate is determined by the encoder using at least one of block matching or hash-based motion estimation.
[0170] In one example, a first flag indicating an IBC merge mode is encoded in the coded video bitstream, and a second flag indicating to perform a template matching search is encoded in the coded video bitstream.
[0171] In another example, a first flag to indicate an IBC merge mode and to perform template matching search encoding is encoded in the coded video bitstream.
[0172] In some embodiments, the merge candidate list is configured to include at least a first block vector candidate pointing to a first position outside the IBC reference region. In one example, to determine an initial block vector based on the first block vector candidate, a closest position to the first position within the IBC reference region is determined, and the initial block vector is determined to point to the closest position.
[0173] In some embodiments, to construct the merging candidate list, in response to determining that the template matching search region of the first block vector candidate overlaps with the IBC reference region, the first block vector candidate is inserted into the merging candidate list.
[0174] In some examples, the IBC reference region includes a reconstructed portion of the current CTU and a region of the left CTU that is cached in a memory space sized to store the CTU.
[0175] In some examples, to perform a template matching search, a portion of the template matching search region that is outside the IBC reference region is excluded from the template matching search.
[0176] The process then proceeds to step (S1799) and ends.
[0177] Process (1700) may be adapted as appropriate. Step(s) of process (1700) may be modified and / or omitted. Additional step(s) may be added. Any suitable order of performance may be used.
[0178] FIG. 18 shows a flow chart outlining a process (1800) according to one embodiment of the present disclosure. The process (1800) may be used in a video decoder. In various embodiments, the process (1800) is performed by a processing circuit, such as the processing circuits of the terminal devices (310), (320), (330), and (340), the processing circuit performing the functions of the video decoder (410), the processing circuit performing the functions of the video decoder (510), etc. In some embodiments, the process (1800) is implemented in software instructions, and thus the processing circuit performs the process (1800) when the processing circuit executes the software instructions. The process starts at (S1801) and proceeds to (S1810).
[0179] At (S1810), an initial block vector for predicting a current block in a current coding tree unit (CTU) is determined when the current block is in an IBC mode.
[0180] At (S1820), a template matching search is performed based on the initial block vector to determine a refined block vector that points to a reference block in the same picture as the current block.
[0181] At (S1830), a reconstructed current block is generated based on the reference block.
[0182] In some examples, the initial block vector is determined from a coded video bitstream carrying the picture based on a merge index, which indicates a block vector candidate from a merge candidate list.
[0183] In one example, a first flag indicating an IBC merge mode is parsed from the coded video bitstream, and then a second flag indicating to perform a template matching search is parsed from the coded video bitstream.
[0184] In another example, a flag is parsed from a coded video bitstream carrying a picture to indicate an IBC merge mode and to perform a template matching search.
[0185] In some examples, the merge candidate list is constructed to include at least a first block vector candidate pointing to a first location outside the IBC reference region, and in response to the merge index indicating the first block vector candidate, a closest location to the first location within the IBC reference region is determined, and an initial block vector is determined to point to the closest location.
[0186] In some examples, to construct the merge candidate list, in response to determining that the template matching search region of the first block vector candidate overlaps with the IBC reference region, the first block vector candidate is inserted into the merge candidate list.
[0187] In some examples, to perform a template matching search, a portion of the template matching search region that is outside the IBC reference region is excluded from the template matching search.
[0188] In some examples, the IBC reference region includes a reconstructed portion of the current CTU and a region of the left CTU that is cached in a memory space sized to store the CTU.
[0189] The process then proceeds to (S1899) and ends.
[0190] Process (1800) may be adapted as appropriate. Step(s) of process (1800) may be modified and / or omitted. Additional step(s) may be added. Any suitable order of performance may be used.
[0191] The techniques described above may be implemented as computer software using computer-readable instructions and physically stored on one or more computer-readable media. For example, Figure 19 illustrates a computer system (1900) suitable for implementing certain embodiments of the disclosed subject matter.
[0192] The computer software may be coded using any suitable machine code or computer language that may undergo assembly, compilation, linking, or similar mechanisms to generate code including instructions that may be executed directly, or via interpretation and execution of microcode, such as by one or more computer central processing units (CPUs) and / or graphics processing units (GPUs).
[0193] The instructions may be executed on various types of computers or components thereof including, for example, personal computers, tablet computers, servers, smart phones, gaming devices, Internet of Things devices, and the like.
[0194] 19 with respect to the computer system (1900) are exemplary in nature and are not intended to suggest any limitation as to the scope of use or functionality of the computer software implementing the embodiments of the present disclosure. The arrangement of components should not be interpreted as having any dependency or requirement regarding any one or combination of components illustrated in the exemplary embodiment of the computer system (1900).
[0195] The computer system (1900) may include certain human interface input devices. Such human interface input devices may be responsive to input by one or more human users, for example, via tactile input (e.g., keystrokes, swipes, data glove movements), audio input (e.g., voice, clapping), visual input (e.g., gestures), olfactory input (not shown). The human interface devices may be used to capture certain media that are not necessarily directly related to conscious human input, such as audio (speech, music, ambient sounds, etc.), images (scanned images, photographic images obtained from a still image camera, etc.), video (two-dimensional video, three-dimensional video including stereoscopic video, etc.).
[0196] The input human interface devices may include one or more (only one of each is shown) of a keyboard (1901), a mouse (1902), a trackpad (1903), a touch screen (1910), a data glove (not shown), a joystick (1905), a microphone (1906), a scanner (1907), and a camera (1908).
[0197] The computer system (1900) may also include certain human interface output devices. Such human interface output devices may stimulate one or more of the human user's senses, for example, by haptic output, sound, light, and smell / taste. Such human interface output devices may include haptic output devices (e.g., haptic feedback via a touch screen (1910), data gloves (not shown), or joystick (1905), although some haptic feedback devices may not function as input devices), audio output devices (speakers (1909), headphones (not shown), etc.), visual output devices (screens (1910), including CRT screens, LCD screens, plasma screens, OLED screens, etc., each with or without touch screen input capability, each with or without haptic feedback capability, some of which may output two-dimensional visual output or three or more dimensional output by means of stereographic output, virtual reality glasses (not shown), holographic displays, and smoke tanks (not shown), etc.), and printers (not shown).
[0198] The computer system (1900) may also include human accessible storage devices and associated media, such as optical media, including CD / DVD ROM / RW (1920) with associated media (1921) such as CDs / DVDs, thumb drives (1922), removable hard drives or solid state drives (1923), legacy magnetic media such as tapes and floppy disks (not shown), and dedicated ROM / ASIC / PLD based devices such as security dongles (not shown).
[0199] Those skilled in the art should also understand that the term "computer-readable medium" as used in connection with the presently disclosed subject matter does not encompass transmission media, carrier waves, or other transitory signals.
[0200] The computer system (1900) may also include an interface (1954) to one or more communication networks (1955). The networks may be, for example, wireless, wired, optical. The networks may further be local, wide area, metropolitan, vehicular and industrial, real-time, delay tolerant, etc. Examples of networks include local area networks such as Ethernet, cellular networks including wireless LAN, GSM, 3G, 4G, 5G, LTE, etc., television wired or wireless wide area digital networks including cable television, satellite television and terrestrial television, vehicular and industrial including CANBus, etc. Certain networks typically require an external network interface adapter that connects to a specific general-purpose data port or peripheral bus (1949) (e.g., a USB port on the computer system (1900)), while others are typically integrated into the core of the computer system (1900) by connection to a system bus as described below (e.g., an Ethernet interface to a PC computer system or a cellular network interface to a smartphone computer system). Using any of these networks, the computer system (1900) may communicate with other entities. Such communications may be unidirectional, receive only (e.g., broadcast TV), unidirectional transmit only (e.g., CANbus to a particular CANbus device), or bidirectional, for example to other computer systems using local or wide area digital networks. Specific protocols and protocol stacks may be used in each of these networks and network interfaces, as described above.
[0201] The aforementioned human interface devices, human accessible storage devices, and network interfaces may be connected to a core (1940) of the computer system (1900).
[0202] The cores (1940) may include one or more central processing units (CPUs) (1941), graphics processing units (GPUs) (1942), dedicated programmable processing units in the form of field programmable gate areas (FPGAs) (1943), hardware accelerators for specific tasks (1944), and graphics adapters (1950), etc. These devices may be connected via a system bus (1948), along with read only memory (ROM) (1945), random access memory (1946), internal mass storage devices (1947) such as internal hard drives, SSDs, etc. that are not accessible to the user. In some computer systems, the system bus (1948) may be accessible in the form of one or more physical plugs to allow expansion with additional CPUs, GPUs, etc. Peripherals may be attached directly to the core's system bus (1948) or via a peripheral bus (1949). In one example, a screen (1910) may be connected to the graphics adapter (1950). Peripheral bus architectures include PCI, USB, and the like.
[0203] The CPU (1941), GPU (1942), FPGA (1943), and accelerator (1944) can execute certain instructions that, in combination, can constitute the aforementioned computer code. The computer code can be stored in ROM (1945) or RAM (1946). Persistent data can be stored, for example, in internal mass storage (1947), while transient data can also be stored in RAM (1946). The use of cache memory, which can be closely associated with one or more CPUs (1941), GPUs (1942), mass storage (1947), ROM (1945), RAM (1946), etc., allows for fast storage and retrieval from any memory device.
[0204] The computer-readable medium can bear computer code for performing various computer-implemented operations. The medium and computer code can be those specially designed and constructed for the purposes of the present disclosure, or they can be of the kind well known and available to those skilled in the computer software arts.
[0205] By way of example and not limitation, a computer system (1900) having an architecture, and in particular a core (1940), may provide functionality as a result of a processor (including CPU, GPU, FPGA, accelerator, etc.) executing software embodied in one or more tangible computer-readable media. Such computer-readable media may be the user-accessible mass storage devices introduced above, as well as media associated with specific storage of the core (1940) that is non-transitory in nature, such as the core internal mass storage (1947) or ROM (1945). Software implementing various embodiments of the present disclosure may be stored in such devices and executed by the core (1940). The computer-readable media may include one or more memory devices or chips according to specific needs. The software may cause the core (1940), and in particular the processor therein (including CPU, GPU, FPGA, etc.) to perform certain processes or certain portions of certain processes described herein, including defining data structures stored in RAM (1946) and modifying such data structures according to the software-defined processes. Additionally or alternatively, a computer system may provide functionality as a result of logic embedded or otherwise embodied in circuitry (e.g., an accelerator (1944)) that may operate in place of or together with software to perform certain processes or certain portions of certain processes described herein. Where appropriate, references to software may encompass logic and vice versa. Where appropriate, references to computer-readable media may encompass circuitry (such as an integrated circuit (IC)) that stores software for execution, circuitry that embodies logic for execution, or both. The present disclosure encompasses any suitable combination of hardware and software.
[0206] Appendix A: Acronyms JEM: Collaborative Search Model VVC: Versatile Video Coding BMS: Benchmark Set MV: Motion Vector HEVC: High Efficiency Video Coding SEI: Supplemental Extended Information VUI: Video Usability Information GOPs: Group of Pictures TUs: conversion units PUs: Prediction Units CTUs: Coding Tree Units CTBs: coding tree blocks PBs: Predicted blocks HRD: Hypothetical Reference Decoder SNR: Signal to Noise Ratio CPUs: Central Processing Units GPUs: Graphics Processing Units CRT: cathode ray tube LCD: Liquid crystal display OLED: Organic Light Emitting Diode CD:Compact Disc DVD: Digital Video Disc ROM: Read-Only Memory RAM: Random Access Memory ASIC: Application Specific Integrated Circuit PLD: Programmable Logic Device LAN: Local Area Network GSM: Global System for Mobile Communications LTE: Long Term Evolution CANBus: Controller Area Network Bus USB: Universal Serial Bus PCI: Peripheral Component Interconnect FPGA: Field Programmable Gate Area SSD: Solid State Drive IC: Integrated Circuit CU: coding unit
[0207] While this disclosure has described several exemplary embodiments, there are modifications, substitutions, and various substitute equivalents which are within the scope of this disclosure. It will thus be appreciated that those skilled in the art will be able to devise numerous systems and methods which, although not explicitly shown or described herein, embody the principles of the present disclosure and are therefore within its spirit and scope. [Explanation of symbols]
[0208] 101 Point where the arrows converge, sample 102 Arrow 103 Arrow 104 Square Block 110 Schematic diagram 201 Block 300 Communication Systems 310 Terminal Devices 320 Terminal Devices 330 Terminal Devices 340 Terminal Devices 350 Communication Network 400 Communication Systems 401 Video Source 402 Video Picture Stream 403 Video Encoder 404 Video data, bitstream 405 Streaming Server 406 Client Subsystem 407 Copy video data 408 Client Subsystem 409 Copy of video data 410 Video Decoder 411 Output Stream 412 Display 413 Capture Subsystem 420 Electronic Devices 430 Electronic Devices 501 Channel 510 Video Decoder 512 Render Device 515 Buffer Memory 520 Entropy Decoder / Parser 521 Symbols 530 Electronic Devices 531 Receiver 551 Scaler / Descaler Unit 552 Intra prediction unit, intra picture prediction unit 553 Motion Compensation Prediction Unit 555 Aggregator 556 Loop Filter Unit 557 Reference Picture Memory 558 Picture Buffer 601 Video Sources 603 Video Encoder, Video Coder 620 Electronic Devices 630 Source Coder 632 Coding Engine 633 local decoder, local video decoder 634 Reference Picture Memory, Reference Picture Cache 635 Predictor 640 Transmitter 643 Video Sequences 645 Entropy Coder 650 Controller 660 Communication Channels 703 Video Encoder 721 General-purpose controller 722 Intra Encoder 723 Residual Calculator 724 Residual Encoder 725 Entropy Encoder 726 Switch 728 Residual Decoder 730 InterEncoder 810 Video Decoder 871 Entropy Decoder 872 Intra Decoder 873 Residual Decoder 874 Reconstruction Module 880 Interdecoder 900 Pictures 910 Reconstructed Area 920 Decoding target area 930 Block 940 Reference Block 950 Block Vector 960 IBC Reference Area 1001 Pictures 1010 Rebuilt CTB 1011 juxtaposed area 1012 juxtaposed area 1013 juxtaposed area 1014 area 1015 CTB 1016 area 1017 area 1018 area 1019 area 1020 Block Vector 1021 Coding block, reference block 1022 coding block 1023 coding block 1024 coding blocks 1025 coding block 1026 coding block 1027 coding block 1028 coding block 1029 Coding Block 1091 Reference Block 1101 Picture 1110 Rebuilt CTB 1111 area 1112 area 1113 area 1114 area 1115 CTB 1116 juxtaposed area 1117 area 1118 area 1119 area 1121 Coding block, reference block 1122 Coding Block 1123 Coding Block 1124 Coding Block 1125 Coding Block 1126 Coding Block 1127 Coding Block 1128 Coding Block 1129 Coding Block 1201 Pictures 1210 Rebuilt CTB 1211 juxtaposed area 1212 juxtaposed area 1213 juxtaposed area 1214 juxtaposed area 1215 CTB 1216 area 1217 area 1218 area 1219 area, 64x64 blocks 1221 Coding Block 1222 Coding Block 1223 Coding Block 1224 Coding Block 1225 Coding Block 1226 Coding Block 1227 Coding Block 1228 Coding Block 1229 Coding Block 1241 Coding Block 1242 Coding Block 1243 Coding Block 1244 coding block 1245 coding block 1246 Coding Block 1247 Coding Block 1248 Coding Blocks 1249 Coding Block 1261 Coding Blocks 1262 Coding Blocks 1263 Coding Block 1264 coding block 1265 Coding Block 1266 Coding Blocks 1267 Coding Block 1268 Coding Blocks 1269 Coding Block 1281 Coding Blocks 1282 coding block 1283 Coding Block 1284 coding block 1285 coding block 1286 coding block 1287 Coding Block 1288 coding block 1289 Coding Block 1310 Pictures 1320 Reference Picture 1350 Search Area 1500 Pseudocode for template matching 1601 Pictures 1610 Rebuilt CTB 1611 juxtaposed area 1612 IBC Reference Area 1613 area 1614 area 1615 CTB 1616 area 1617 area 1618 area 1619 area 1650 Block 1651 Arrow, Candidate BV 1652 Rectangular box, template matching search area 1700 Process 1800 Processes 1900 Computer Systems 1901 Keyboard 1902 Mouse 1903 Trackpad 1905 Joystick 1906 Microphone 1907 Scanner 1908 Camera 1909 Audio output device speaker 1910 Touch Screen 1920 CD / DVD ROM / RW 1921 CD / DVD and other media 1922 Thumb Drive 1923 Removable Hard Drive or Solid State Drive 1940 Core 1941 Central Processing Unit (CPU) 1942 Graphics Processing Unit (GPU) 1943 Field Programmable Gate Area (FPGA) 1944 Hardware Accelerator 1945 Read-Only Memory (ROM) 1946 Random Access Memory (RAM) 1947 Core Internal Mass Storage 1948 System Bus 1949 Peripheral Bus 1950 Graphics Adapter 1954 Interface 1955 Communication Network
Claims
1. 1. A method of video processing in a decoder, comprising the steps of: determining, in response to a current block in a current coding tree unit (CTU) being predicted in an intra block copy (IBC) mode, an initial block vector for predicting the current block; performing, by the processor, template matching based on the initial block vector to determine as the current block an improved block vector pointing to a reference block in a picture; reconstructing, by the processor, the current block based on the reference block; determining the initial block vector based on a merge index included in a coded video bitstream, the merge index indicating a block vector candidate in an IBC merge candidate list including a plurality of IBC candidates for an IBC merge mode; constructing the IBC merge candidate list including at least a first candidate block vector pointing to a first location outside an IBC reference region; Including, said step of constructing said IBC merge candidate list further comprising: and inserting the first block vector candidate into the IBC merge candidate list in response to determining that a template matching search region of the first block vector candidate at least partially overlaps with the IBC reference region. method.
2. parsing a first flag from the coded video bitstream, the first flag indicating the IBC merge mode; parsing, from the coded video bitstream, a second flag indicating whether the template matching is applied to the block vector candidates of the plurality of IBC candidates of the IBC merge mode indicated by the merge index; The method of claim 1 further comprising:
3. parsing a flag indicating the IBC merge mode from the coded video bitstream, wherein the template matching is applied to candidate block vectors for each block in the CTU that is predicted in the IBC merge mode; The method of claim 1 further comprising:
4. determining the initial block vector based on the merge index, determining a location within the IBC reference region that is closest to the first location in response to the merge index indicating the first candidate block vector; determining the initial block vector that points to the closest position; The method of claim 1 further comprising:
5. 2. The method of claim 1, wherein the IBC reference region includes a reconstructed portion of the current CTU and a region of a left CTU that is cached in a memory space sized to store a CTU.
6. the step of performing template matching further comprising: The method of claim 1 , further comprising excluding portions of the template matching search area that are outside the IBC reference area from the template matching.
7. Apparatus configured to perform the method of any one of claims 1 to 6.
8. A computer program comprising instructions which, when executed by at least one processor, cause said at least one processor to perform the method according to any one of claims 1 to 6.
Citation Information
Patent Citations
Method and apparatus for video encoding
JP2022521198A
Partial reconstruction based template matching for motion vector derivation
US20190014342A1
Method and apparatus for video coding
US20190246113A1
Method and apparatus for video coding
US20200029072A1
Method and apparatus for processing video signal
US20200045306A1
