Method, apparatus, and computer program for moving image decoding

Abstract

To provide methods and apparatuses for moving image coding / decoding, which reduce redundancy in input video signals through compression.SOLUTION: A decoding apparatus includes processing circuitry that stores reconstructed samples of a reconstructed block in a memory. In a decoding process, when a current sub-block in a current block is to be reconstructed using intra block copy (IBC) based on a reference sub-block in the reconstructed block, the processing circuitry determines whether the reconstructed samples of the reference sub-block stored in the memory are indicated as overwritten based on a position of the current sub-block, generates reconstructed samples of the current sub-block based on the reconstructed samples of the reference sub-block when the reconstructed samples of the reference sub-block stored in the memory are determined to be indicated as not overwritten, and overwrites the reconstructed samples of a collocated sub-block in the reconstructed block stored in the memory with the generated reconstructed samples of the current sub-block.SELECTED DRAWING: Figure 12

Description

[Technical field]

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS This disclosure claims the benefit of priority to U.S. patent application Ser. No. 16 / 419,235, entitled "METHOD AND APPARATUS FOR VIDEO CODING," filed May 22, 2019, which is a continuation of U.S. provisional patent application Ser. No. 62 / 735,002, entitled "Reference search method for video coding," filed Sep. 21, 2018. This application claims the benefit of priority to "Range Optimization for Intra Picture Block Compensation," the contents of which are incorporated by reference in their entireties.

[0002] This disclosure describes embodiments that relate generally to video coding. [Background technology]

[0003] The discussion of the background art provided herein is intended to generally provide a context for the present disclosure. Work by the inventors described in the present invention is not admitted, expressly or impliedly, as prior art to the present disclosure, to the extent that the work is described in this Background section, as well as aspects of the present disclosure that may not be considered prior art at the time of filing.

[0004] Video encoding and decoding can be performed using inter-image prediction with motion compensation. Uncompressed digital video can include a sequence of images, each having spatial dimensions of, for example, 1920x1080 luminance samples and associated chrominance samples. The sequence of images can have a fixed or variable image rate (also informally known as frame rate) of, for example, 60 images per second, or 60 Hz. Uncompressed video has significant bitrate requirements. For example, 1080p60 4:2:0 video (1920x1080 luminance sample resolution at a 60 Hz frame rate) with 8 bits per sample requires nearly 1.5 gigabits per second of bandwidth. One hour of such video requires more than 600 gigabytes of storage space.

[0005] Video encoding and decoding may aim at reducing redundancy in the input video signal through compression. Compression may help reduce the aforementioned bandwidth or storage space requirements, in some cases by a factor of 100 or more. Both lossless and lossy compression, as well as combinations of these, may be used. Lossless compression refers to techniques that allow a perfect copy of the original signal to be reconstructed 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 that the reconstructed signal is sufficiently useful for the intended application. For video, lossy compression is widely used. The amount of distortion is tolerable depending on the application, for example, users of some consumer streaming applications may tolerate higher order distortion than users of television distribution applications. The achievable compression ratio may reflect that the higher the possible / acceptable distortion, the higher the compression ratio.

[0006] Motion compensation may be a lossy compression technique and may refer to a technique in which blocks of sample data from a previously reconstructed image, or part of it (reference image), are used to predict a newly reconstructed image or image part after being spatially shifted in a direction indicated by a motion vector (hereafter MV). In some cases, the reference image may be the same as the image currently being reconstructed. The MV may have two dimensions, X and Y, or three dimensions, with the third dimension indicating the reference image being used (which may indirectly be a temporal dimension).

[0007] In some video compression techniques, the MV applicable to some regions of sample data can be predicted from other MVs, e.g., MVs for other regions of sample data that are spatially adjacent to the region being reconstructed, and that MV is prioritized in the decoding order. In that way, the amount of data required to encode the MVs can be substantially reduced, thereby removing redundancy and increasing the compression ratio. MV prediction can work efficiently because, for example, when encoding an input video signal obtained from a camera (known as natural video), there is a statistical likelihood that regions larger than the region to which one MV can be applied move in a similar direction, and therefore, in some cases, can be predicted using similar motion vectors derived from the MVs of neighboring regions. As a result, the MV found for a given region will be similar or the same as the MV predicted from the surrounding MVs, and after entropy encoding, it can be represented with fewer bits than would be used to directly encode the MVs. In some cases, MV prediction may be an example of lossless compression of a signal (i.e., MV) derived from a source 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.

[0008] Various MV prediction mechanisms are described in H.265 / HEVC (ITU-T Rec. H.265, “High Efficiency Video Coding”, December 2016). Among the many MV prediction mechanisms proposed by H.265, this specification describes a technique hereafter called “spatial merging”.

[0009] Referring to Fig. 1, a current block (101) contains spatially shifted samples that were found to be predictable from a previous block of the same size by the encoder during the motion search process. Instead of directly encoding its MV, the MV can be derived from metadata associated with one or more reference pictures, e.g., from the last reference picture (in decoding order), using MVs associated with any one of five surrounding samples, denoted A0, A1, and B0, B1, B2 (102-106, respectively). In H.265, MV prediction can use predictors from the same reference picture that neighboring blocks use. Summary of the Invention

[0010] Aspects of the present disclosure provide a method and apparatus for encoding / decoding moving images. In some examples, the apparatus includes a processing circuit that stores reconstructed samples of a reconstructed block of an image in a memory. The reconstructed samples of the reconstructed block are reconstructed according to an encoded video bitstream. When a current sub-block in a current block of the image is reconstructed based on a reference sub-block in the reconstructed block using intra block copy (IBC), the processing circuit determines whether the reconstructed sample of the reference sub-block stored in the memory indicates that it is overwritten based on a position of the current sub-block, and if it is determined that the reconstructed sample of the reference sub-block stored in the memory indicates that it is not overwritten, generates a reconstructed sample of the current sub-block to output based on the reconstructed sample of the reference sub-block, and overwrites the reconstructed sample of the collocated sub-block in the reconstructed block stored in the memory with the generated reconstructed sample of the current sub-block.

[0011] In some embodiments, the current block includes one or more non-overlapping partitions, the non-overlapping partitions including the current partition in which the current sub-block is located, and the reconstructed block includes one or more non-overlapping partitions that are respectively co-located with one or more partitions of the current block. In some embodiments, the processing circuit determines that a partition in the reconstructed block that includes the reference sub-block is co-located with one of the partitions in the current block that is not reconstructed indicates that the reconstructed sample of the reference sub-block stored in the memory has not been overwritten.

[0012] In some embodiments, the current block has a size of 128x128 luma samples, and the one or more non-overlapping partitions of the current block include four partitions each having a size of 64x64 luma samples.

[0013] In some embodiments, the one or more non-overlapping partitions of the current block include only one partition that is the size of the current block. In some embodiments, each of the one or more non-overlapping partitions of the current block has a size equal to or greater than the maximum reference sub-block size used in IBC.

[0014] In some embodiments, the current block includes an upper left, upper right, lower left, and lower right section, and the reconstructed block includes an upper left, upper right, lower left, and lower right section. In some embodiments, the processing circuit determines that the reconstructed sample of the reference sub-block stored in the memory indicates that it is not overwritten if the current sub-block is located in the upper left section of the current block and the reference sub-block is located in one of the upper right, lower left, and lower right sections in the reconstructed block. In some embodiments, the processing circuit determines that the reconstructed sample of the reference sub-block stored in the memory indicates that it is not overwritten if the current sub-block is located in one of the upper left, upper right, and lower left section of the current block and the reference sub-block is located in the lower right section of the reconstructed block.

[0015] Aspects of the present disclosure further provide a non-transitory computer-readable medium storing instructions that, when executed by a computer to decode video, cause the computer to perform a method of decoding video.

[0016] Further features, nature and various advantages of the subject matter of the present disclosure will become more apparent from the following detailed description and the accompanying drawings. [Brief description of the drawings]

[0017] [Figure 1] FIG. 2 is a schematic diagram of a current block and its surrounding spatial merge candidates in one example. [Diagram 2] 1 is a schematic diagram of a simplified block diagram of a communication system (200), according to an embodiment. [Diagram 3]1 is a schematic diagram of a simplified block diagram of a communication system (300), according to an embodiment. [Figure 4] FIG. 2 is a schematic diagram of a simplified block diagram of a decoder according to an embodiment; [Diagram 5] FIG. 2 is a schematic diagram of a simplified block diagram of an encoder according to an embodiment; [Figure 6] 4 shows a block diagram of an encoder according to another embodiment. [Figure 7] 4 shows a block diagram of a decoder according to another embodiment. [Figure 8] FIG. 2 is a schematic diagram of a current block in a current image that is coded using intra block copy (IBC) according to an embodiment. [Figure 9] 1 is a schematic diagram of a current block and neighboring blocks in a current image using IBC according to an embodiment. [Figure 10A] FIG. 1 is a schematic diagram illustrating how reconstructed samples in neighboring blocks are overwritten based on the position of a current sub-block encoded using IBC, according to one embodiment. [Figure 10B] FIG. 13 is a schematic diagram of how reconstructed samples in neighboring blocks are shown to be overwritten based on the position of a current sub-block encoded using IBC, according to another embodiment. [Figure 11] 1 is a schematic diagram of a current block, a first reference block, and a second reference block between the current block and the first reference block in a current image using IBC according to an embodiment. [Figure 12] 13 shows a flowchart outlining a decoding process (1300) according to an embodiment of the present disclosure. [Figure 13] 14 shows a flowchart outlining an encoding process (1400) according to an embodiment of the present disclosure. [Figure 14] FIG. 1 is a schematic diagram of a computer system, according to an embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0018] FIG. 2 illustrates a simplified block diagram of a communication system (200) according to an embodiment of the present disclosure. The communication system (200) includes a plurality of terminal devices that can communicate with each other, for example, via a network (250). For example, the communication system (200) includes a first pair of terminal devices (210) and (220) interconnected via the network (250). In the example of FIG. 2, the first pair of terminal devices (210) and (220) perform a unidirectional transmission of data. For example, the terminal device (210) may encode video data (e.g., a stream of video captured by the terminal device (210)) for transmission to the other terminal device (220) via the network (250). The encoded video data may be transmitted in the form of one or more encoded video bitstreams. The terminal device (220) may receive the encoded video data from the network (250), decode the encoded video data to recover the video, and display the video according to the recovered video data. One-way data transmission may be common, such as in media serving applications.

[0019] In another example, the communication system (200) includes a second pair of terminal devices (230) and (240) for bidirectional transmission of encoded video data, such as may occur during a video conference. In the example, in the case of bidirectional transmission of data, each of the terminal devices (230) and (240) may encode video data (e.g., a stream of video captured by the terminal device) for transmission to the other of the terminal devices (230) and (240) over the network (250). Each of the terminal devices (230) and (240) may receive the encoded video data transmitted by the other of the terminal devices (230) and (240), decode the encoded video data to recover the video, and display the video on an accessible display device in accordance with the recovered video data.

[0020] In the example of FIG. 2, the terminal devices (210), (220), (230), and (240) 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 also apply to laptops, tablet computers, media players, and / or dedicated video conferencing equipment. The network (250) represents any number of networks, including wired and / or wireless communication networks, that convey encoded video data between the terminal devices (210), (220), (230), and (240). The communication network (250) may exchange data over circuit-switched and / or packet-switched channels. Exemplary networks include telecommunications networks, local area networks, wide area networks, and / or the Internet. For purposes of this discussion, the architecture and topology of the network (250) may be irrelevant to the operation of the present disclosure, unless otherwise described below.

[0021] 3 shows an arrangement of video encoders and decoders in a streaming environment as an example application of the disclosed subject matter, which is equally applicable to other video uses including, for example, video conferencing, digital television, and storage of compressed video on digital media such as CDs, DVDs, memory sticks, etc.

[0022] The streaming system may include a capture subsystem (313), which may include, for example, a video source (301), such as a digital camera, that creates an uncompressed video stream (302). In an example, the video stream (302) includes samples captured by the digital camera. The video stream (302), shown in bold to emphasize its large amount of data compared to the encoded video data (304) (or encoded video bitstream), may be processed by an electronic device (320) that includes a video encoder (303) coupled to the video source (301). As described in more detail below, the video encoder (303) may include hardware, software, or a combination thereof to enable or implement aspects of the disclosed subject matter. The encoded video data (304) (or encoded video bitstream (304)), shown in thin to emphasize its small amount of data compared to the video stream (302), may be stored in a streaming server (305) for later use. One or more streaming client subsystems, such as client subsystems (306) and (308) of FIG. 3, can access the streaming server (305) to retrieve copies (307) and (309) of the encoded video data (304). The client subsystem (306) can include a video decoder (310), for example in an electronic device (330). The video decoder (310) decodes the incoming copy of the encoded video data (307) to generate an outgoing video stream (311) that can be displayed on a display device (312) (e.g., a display screen) or other display device (not shown). In some streaming systems, the encoded video data (304), (307), and (309) (e.g., a video bitstream) can be encoded according to a number of video encoding / compression standards. Examples of such standards include ITU-T Recommendation H.265. In an example, the video encoding standard under development is informally known as Versatile Video Coding (VVC).The disclosed subject matter can be used in connection with a VVC.

[0023] It should be noted that the electronics 320 and 330 may include other components (not shown). For example, the electronics 320 may include a video decoder (not shown), and the electronics 330 may similarly include a video encoder (not shown).

[0024] 4 shows a block diagram of a video decoder (410) according to an embodiment of the present disclosure. The video decoder (410) may be included in an electronic device (430). The electronic device (430) may include a receiver (431) (e.g., receiving circuitry). The video decoder (410) may be used in place of the video decoder (310) in the example of FIG. 3.

[0025] The receiver (431) may receive one or more coded video sequences to be decoded by the video decoder (410), or in the same or another embodiment, one coded video sequence at a time, 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 (401), which may be hardware / software coupled with a storage device that stores the coded video data. The receiver (431) may receive the coded video data together with other data, such as coded audio data and / or auxiliary data streams, which may be forwarded to respective use entities (not shown). The receiver (431) may separate the coded video sequences from the other data. To combat network jitter, a buffer memory (415) may be coupled between the receiver (431) and the entropy decoder / parser (420), hereafter referred to as the "parser (420)". In some applications, the buffer memory (415) is part of the video decoder (410). In other applications, it may be external to the video decoder (410) (not shown). In still other applications, there may be a buffer memory (not shown) external to the video decoder (410), e.g., to combat network jitter, and yet another buffer memory (415) internal to the video decoder (410), e.g., to address playout timing. When the receiver (431) is receiving data from a storage / transmission device with sufficient bandwidth and controllability, or from an isosynchronous network, the buffer memory (415) may not be needed or may be small. The buffer memory (415), which may be needed for use with best-effort packet networks such as the Internet, may be relatively large and preferably of adaptable size, and may be implemented at least in part in an operating system or similar element (not shown) external to the video decoder (410).

[0026] The video decoder (410) may include a parser (420) to reconstruct symbols (421) from the encoded video sequence. Such symbol classification may include information used to manage the operation of the video decoder (410) and potentially information for controlling a display device, such as a display device (412) (e.g., a display screen), which, as shown in FIG. 4, is not an integral part of the electronic device (430), but may be coupled to the electronic device (430). Control information for the display device(s) may be included in Supplemental Enhancement Information (SEI) messages, or Video Usability Information (VUUID) messages. The parser (420) may parse / entropy decode the received coded video sequence. The code of the coded video sequence may be in the form of a Variable Length Code (VUI) parameter set fragment (not shown). The parser (420) may parse / entropy decode the received coded video sequence. The code of the coded video sequence may be in accordance with a video coding technique or standard and may be in accordance with a variety of principles including variable length codes, Huffman codes, context-dependent or non-context-dependent arithmetic codes, etc. The parser (420) may extract a set of subgroup parameters for at least one subgroup of pixels in the video decoder based on at least one parameter corresponding to the group from the coded video sequence. The subgroup may include a group of pictures (GOP), an image, a tile, a slice, a macroblock, a coding unit (CU), a block, a transform unit (TU), a prediction unit (PU), etc. The parser (420) may also extract information from the coded video sequence such as transform coefficients, quantizer parameter values, motion vectors, etc.

[0027] The parser (420) may perform entropy decoding / parsing operations on the video sequence received from the buffer memory (415) to generate symbols (421).

[0028] The reconstruction of the symbols (421) can include a number of different units depending on the type of coded video or portions thereof (e.g., inter and intra pictures, inter and intra blocks) and other factors. Which units are included and how can be controlled by subgroup control information parsed from the coded video sequence by the parser (420). The flow of such subgroup control information between the parser (420) and the following units is not shown for clarity.

[0029] In addition to the functional blocks already mentioned, the video decoder (410) may be conceptually subdivided into a number of functional units, as described below. In an actual implementation operating under commercial constraints, many of such units may interact closely with each other and may be at least partially integrated with each other. However, for purposes of describing the disclosed subject matter, a conceptual subdivision into the following functional units is appropriate:

[0030] The first unit is a scalar / inverse transform unit (451), which receives quantized transform coefficients as well as control information, including the transform to use, block size, quantization factor, quantization scaling matrix, etc., as symbol(s) (421) from the parser (420). The scalar / inverse transform unit (451) can output a block containing sample values, which can be input to an aggregator (455).

[0031] In some cases, the output samples of the scalar / inverse transform (451) may relate to intra-coded blocks, i.e., blocks that do not use prediction information from a previously reconstructed image may use prediction information from a previously reconstructed portion of the current image. Such prediction information may be provided by an intra-image prediction unit (452). In some cases, the intra-image prediction unit (452) uses surrounding already reconstructed information taken from a current image buffer (458) to generate a block of the same size and shape as the block being reconstructed. The current image buffer (458) may, for example, buffer a partially reconstructed current image and / or a fully reconstructed current image. The aggregation device (455) may optionally add the prediction information generated by the intra-prediction unit (452) on a sample-by-sample basis to the output sample information provided by the scalar / inverse transform unit (451).

[0032] In other cases, the output samples of the scalar / inverse transform unit (451) may relate to an inter-coded and potentially motion-compensated block. In such cases, the motion compensation prediction unit (453) may access the reference picture memory (457) to retrieve samples to use for prediction. After motion compensating the retrieved samples according to the symbols (421) associated with the block, these samples may be added to the output of the scalar / inverse transform unit (451) (called residual samples or residual signals in this case) by the aggregation device (455) to generate output sample information. The addresses in the reference picture memory (457) from which the motion compensation prediction unit (453) retrieves the prediction samples may be controlled by a motion vector, available to the motion compensation prediction unit (453) in the form of symbols (421), and may have, for example, X, Y, and reference picture components. Motion compensation may also include interpolation of sample values ​​retrieved from the reference picture memory (457) when sub-sample accurate motion vectors are used, motion vector prediction mechanisms, etc.

[0033] The output samples of the aggregator (455) can be subjected to various loop filtering techniques in a loop filter unit (456). Video compression techniques can include in-loop filter techniques controlled by parameters included in the coded video sequence (also called coded video bitstream) and made available to the loop filter unit (456) as symbols (421) from the parser (420), but can also be responsive to meta-information obtained during decoding of previous (in decoding order) parts of the coded image or coded video sequence, as well as to previously reconstructed and loop filtered sample values.

[0034] The output of the loop filter unit (456) may be a sample stream that can be output to a display device (412) and also stored in a reference picture memory (457) for use in future inter-picture prediction.

[0035] Some coded pictures, once fully reconstructed, can be used as reference pictures for future predictions. For example, when a coded picture corresponding to a current picture is fully reconstructed and the coded picture has been identified as a reference picture (e.g., by the parser (420)), the current picture buffer (458) can become part of the reference picture memory (457) and a new current picture buffer can be reallocated before starting the reconstruction of a subsequent coded picture.

[0036] The video decoder (410) may perform decoding operations according to a given video compression technique in a certain standard, such as ITU-T Rec. H.265. An encoded video sequence is said to comply with the syntax specified by the video compression technique or standard used in the sense that the encoded video sequence complies with both the syntax of the video compression technique or standard and the profile recorded in the video compression technique or standard. In particular, a profile may select only some tools from all tools available in the video compression technique or standard as tools that can be used under the profile. A further requirement for compliance may be that the complexity of the encoded video sequence is within a range specified 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 / second), maximum reference picture size, etc. The limits set by the level may be further limited in some cases by a Hypothetical Reference Decoder (HRD) specification and HRD buffer management metadata signaled in the encoded video sequence.

[0037] In an embodiment, the receiver (431) may receive additional (redundant) data along with the encoded video. The additional data may be included as part of the encoded video sequence(s). The additional data may be used by the video decoder (410) 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-to-noise ratio (SNR) enhancement layers, redundant slices, redundant images, forward error correction codes, etc.

[0038] 5 shows a block diagram of a video encoder (503) according to an embodiment of the present disclosure. The video encoder (503) is included in an electronic device (520). The electronic device (520) includes a transmitter (540) (e.g., a transmission circuit). The video encoder (503) can be used in place of the video encoder (303) in the example of FIG. 3.

[0039] The video encoder (503) may receive video samples from a video source (501) (which, in the example of FIG. 5, is not part of the electronic device (520)) that may capture the video(s) to be encoded by the video encoder (503). In another example, the video source (501) is part of the electronic device (520).

[0040] The video source (501) may provide a source video sequence to be encoded by the video encoder (503) in the form of a digital video sample stream that may be of any suitable bit depth (8-bit, 10-bit, 12-bit, etc.), any color space (BT.601 Y CrCB, RGB, etc.), and any suitable sampling structure (Y CrCb 4:2:0, Y CrCb 4:4:4, etc.). In a media delivery system, the video source (501) may be a storage device that stores previously prepared video. In a video conferencing system, the video source (501) may be a camera that captures local image information as a video sequence. The video data may be provided as a number of individual images that convey motion when viewed in sequence. The images 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 will readily appreciate the relationship between pixels and samples. The following description focuses on samples.

[0041] According to an embodiment, the video encoder (503) may encode and compress images of a source video sequence into an encoded video sequence (543) in real time or under other time constraints required by the application. Providing an appropriate encoding rate is one function of the controller (550). In some embodiments, the controller (550) controls and is operatively coupled to other functional units as described below. For clarity, coupling is not shown. Parameters set by the controller (550) may include rate control related parameters (e.g., picture skip, quantization, lambda values ​​for rate-distortion optimization techniques), picture size, group of pictures (GOP) layout, maximum motion vector search range, etc. The controller (550) may be configured to have other suitable functions associated with the video encoder (503) optimized for some system designs.

[0042] In some embodiments, the video encoder (503) is configured to operate in an encoding loop. In a simplified example, the encoding loop may include a source encoder (530) (e.g., responsible for generating symbols, such as a symbol stream, based on an input image to be encoded and reference image(s)) and a (local) decoder (533) embedded in the video encoder (503). The decoder (533) reconstructs the symbols to generate sample data in a similar manner as the (remote) decoder would generate them (since the compression between the symbols and the encoded video bitstream is both lossless in the video compression techniques considered in the subject matter of this disclosure). The reconstructed sample stream (sample data) is input to a reference image memory (534). As the decoding of the symbol stream results in bit-perfect, regardless of the location of the decoder (local or remote), the contents of the reference image memory (534) are also bit-perfect between the local and remote encoders. In other words, the predictor of the encoder "sees" exactly the same sample values ​​as the reference image samples that the decoder "sees" when using prediction during decoding. This basic principle of reference image synchronicity (and the resulting drift if synchronicity cannot be maintained, e.g., due to channel errors) is used in some related techniques as well.

[0043] The operation of the "local" decoder (533) may be the same as a "remote" decoder, such as the video decoder (410), which has already been described in detail above in relation to Figure 4. However, referring also momentarily to Figure 4, the entropy decoding portion of the video decoder (410), including the buffer memory (415), and the parser (420) do not have to be implemented entirely in the local decoder (533), since symbols are available and can be losslessly encoded / decoded into an encoded video sequence by the entropy encoder (545) and the parser (420).

[0044] It should be noted at this point that the decoder techniques present in the decoder, with the exception of parsing / entropy decoding, naturally require that they also exist in the corresponding encoder in nearly identical functional form. For this reason, the disclosed subject matter focuses on the operation of the decoder. A description of the encoder techniques can be omitted, since they are the inverse of the decoder techniques, which are described generically. Only in a few areas are more detailed descriptions required and are described below.

[0045] In some examples, during operation, the source encoder (530) may perform motion compensated predictive encoding, predictively encoding an input image with respect to one or more previously encoded images from the video sequence designated as “reference images.” In this method, the encoding engine (532) encodes differences between pixel blocks of the input image and pixel blocks of reference image(s) that may be selected as predictive reference(s) for the input image.

[0046] The local video decoder (533) may decode the encoded video data of images that may be designated as reference images based on the symbols generated by the source encoder (530). The operation of the encoding engine (532) may preferably be a lossy process. When the encoded video data may be decoded in a video decoder (not shown in FIG. 5), the reconstructed video sequence may be a copy of the source video sequence, usually with some errors. The local video decoder (533) may replicate the decoding process that may be performed on the reference images by the video decoder, and may cause the reconstructed reference images to be stored in a reference image cache (534). In this way, the video encoder (503) may locally store copies of reconstructed reference images that have common content with the reconstructed reference images obtained by the far-end video decoder (free of transmission errors).

[0047] The predictor (535) may perform a prediction search for the coding engine (532). That is, for a new image to be coded, the predictor (535) may search the reference image memory (534) for sample data (as candidate reference pixel blocks) or some metadata such as reference image motion vectors, block shapes, etc., which serve as suitable prediction references for the new image. The predictor (535) may operate on a sample block-by-pixel block basis to find suitable prediction references. In some cases, as determined by the search results obtained by the predictor (535), the input image may have prediction references drawn from multiple reference images stored in the reference image memory (534).

[0048] The controller (550) may manage the encoding operations of the source encoder (530), including, for example, setting parameters and subgroup parameters used to encode the video data.

[0049] The output of all the aforementioned functional units may be entropy coded in an entropy coder (545) that converts the symbols, as produced by the various functional units, into an encoded video sequence by losslessly compressing the symbols with techniques such as Huffman coding, variable length coding, or arithmetic coding.

[0050] The transmitter (540) may buffer the encoded video sequence(s) as they are generated by the entropy encoder (545) in preparation for transmission over the communication channel (560), which may be a hardware / software link to a storage device that stores the encoded video data. The transmitter (540) may merge the encoded video data of the video encoder (503) with other data to be transmitted, such as encoded audio data and / or auxiliary data streams (sources not shown).

[0051] A controller (550) may manage the operation of the video encoder (503). During encoding, the controller (550) may assign a number of encoding image types to each of the encoded images, which may affect the encoding technique that may be applied to each image. For example, images are often assigned to one of the following image types:

[0052] An intra picture (I-picture) is one that can be coded and decoded without using other pictures in a sequence as a source of prediction. Some video codecs allow different kinds of intra pictures, including, for example, Independent Decoder Refresh ("IDR") pictures. Those skilled in the art are aware of such variations of I-pictures, as well as their respective uses and characteristics.

[0053] A predicted image (P picture) can be coded and decoded using intra- or inter-prediction, using at most one motion vector and reference index to predict the sample values ​​of each block.

[0054] Bidirectionally predicted images (B-pictures) are those that can be coded and decoded using intra- or inter-prediction, using up to two motion vectors and reference indices to predict the sample values ​​of each block. Similarly, multi-predictive images can use more than two reference images and associated metadata to reconstruct a block.

[0055] A source image may be coded block by block, usually spatially subdivided into multiple sample blocks (e.g., blocks of 4x4, 8x8, 4x8, or 16x16 samples each). Blocks may be predictively coded with reference to other (already coded) blocks as determined by the code assignment applied to each image of the block. For example, blocks of I-pictures may be non-predictively coded or may be predictively coded with reference to already coded blocks of the same image (spatial or intra prediction). Pixel blocks of P-pictures may be predictively coded by spatial prediction with reference to one previously coded reference image or by temporal prediction. Blocks of B-pictures may be predictively coded by spatial prediction with reference to one or two previously coded reference images or by temporal prediction.

[0056] The video encoder (503) may perform encoding operations in accordance with a given video encoding technique or standard, such as ITU-T Rec. H.265. During its operation, the video encoder (503) may perform various compression operations, including predictive encoding operations that exploit temporal and spatial redundancy in the input video sequence. The encoded video data may therefore conform to a syntax specified by the video encoding technique or standard used.

[0057] In an embodiment, the transmitter (540) may transmit additional data along with the encoded video. The source encoder (530) may include such data as part of the encoded video sequence. The additional data may include other types of redundant data, such as temporal / spatial / SNR enhancement layers, redundant pictures and slices, SEI messages, VUI parameter set fragments, etc.

[0058] A video may be captured as multiple source images (videos) in a time sequence. Intra-image prediction (often abbreviated as intra-prediction) uses spatial correlation within a given image, while inter-image prediction uses correlation (temporal or otherwise) between images. In an example, a particular image being coded / decoded, called a current image, is divided into blocks. When a block in the current image is similar to a reference block of a reference image that has been previously coded and is still buffered in the video, the block of the current image can be coded by a vector called a motion vector. A motion vector points to a reference block in the reference image and can have a third dimension that identifies the reference image, and in some cases, multiple reference images are used.

[0059] In some embodiments, bidirectional prediction techniques may be used for inter-image prediction. Bidirectional prediction techniques use two reference pictures, a first reference picture and a second reference picture, etc., both of which are earlier in decoding order (but may be earlier and later, respectively, in display order) with respect to a current picture in the video. A block in the current picture may be coded with 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 and second reference blocks.

[0060] Also, to improve coding efficiency, merge mode techniques can be used for inter-image prediction.

[0061] According to some embodiments of the present disclosure, predictions such as inter-image prediction and intra-image prediction are performed in units of blocks. For example, according to the HEVC standard, images in a video sequence are divided into code tree units (CTUs) for compression, and the CTUs in an image 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), one luma CTB, and two chroma CTBs. Each CTU can be recursively quad-tree partitioned into one or more coding units (CUs). For example, a 64×64 pixel CTU can be partitioned into one 64×64 pixel CU, or four 32×32 pixel CUs, or sixteen 16×16 pixel CUs. In an example, each CU is analyzed to determine the prediction type of the CU, such as inter prediction type or 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 an 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.

[0062] 6 shows a diagram of a video encoder (603) according to another embodiment of the present disclosure. The video encoder (603) is configured to receive a processed block of sample values ​​(e.g., a predictive block) in a current picture of a video sequence and to encode the processed block into an encoded picture that is part of the encoded video sequence. In an example, the video encoder (603) is used in place of the video encoder (303) in the example of FIG. 3.

[0063] In an HEVC example, the video encoder (603) receives a matrix of sample values ​​for a processing block, such as a predictive block of 8×8 samples. The video encoder (603) determines, for example using rate-distortion optimization, whether the processing block is best coded using an intra mode, an inter mode, or a bidirectional predictive mode. When the processing block is coded in an intra mode, the video encoder (603) may use intra prediction techniques to code the processing block into a coded image, and when the processing block is coded in an inter mode or a bidirectional predictive mode, the video encoder (603) may use inter prediction or bidirectional prediction techniques, respectively, to code the processing block into a coded image. In some video coding techniques, the merge mode may be an inter-image prediction submode, where motion vectors are derived from one or more motion vector predictors and do not utilize coded motion vector components outside of the predictors. In some other video coding techniques, there may be motion vector components that are applicable to the current block. In examples, the video encoder (603) includes other elements, such as a mode decision module (not shown), to determine the mode of the processing blocks.

[0064] In the example of FIG. 6, the video encoder (603) includes an inter encoder (630), an intra encoder (622), a residual calculator (623), a switch (626), a residual encoder (624), an overall controller (621), and an entropy encoder (625), coupled together as shown in FIG.

[0065] The inter encoder (630) 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 image (e.g., blocks in previous and future images), generate inter prediction information (e.g., a description of redundant information through inter coding techniques, motion vectors, merge mode information), and calculate an inter prediction result (e.g., a predicted block) based on the inter prediction information using any suitable technique. In some examples, the reference image is a decoded reference image that is decoded based on the coded video information.

[0066] The intra encoder (622) is configured to receive samples of a current block (e.g., a processing block), possibly compare the block with blocks already encoded in the same image, and generate transformed quantized coefficients and possibly further intra prediction information (e.g., intra prediction direction information according to one or more intra encoding techniques). In an example, the intra encoder (622) further calculates an intra prediction result (e.g., a predicted block) based on the intra prediction information and a reference block in the same image.

[0067] The overall controller (621) is configured to determine overall control data and control other elements of the video encoder (603) based on the overall control data. In an example, the overall controller (621) determines a mode of the block and provides a control signal to the switch (626) based on the mode. For example, when the mode is an intra mode, the overall controller (621) controls the switch (626) to select an intra mode result to be used by the residual calculator (623) and controls the entropy encoder (625) to select intra prediction information and include the intra prediction information in the bitstream, and when the mode is an inter mode, the overall controller (621) controls the switch (626) to select an inter prediction result to be used by the residual calculator (623) and controls the entropy encoder (625) to select inter prediction information and include the inter prediction information in the bitstream.

[0068] The residual calculator (623) is configured to calculate a difference (residual data) between the received block and a prediction result selected from the intra encoder (622) or the inter encoder (630). The residual encoder (624) is configured to operate on the residual data to encode the residual data and generate transform coefficients. In an example, the residual encoder (624) is configured to transform the residual data from the spatial domain to the frequency domain to generate transform coefficients. The transform coefficients are then quantized to obtain quantized transform coefficients. In various embodiments, the video encoder (603) further comprises a residual decoder (628). The residual decoder (628) is configured to perform an inverse transform to generate decoded residual data. The decoded residual data can be used by the intra encoder (622) and the inter encoder (630), as appropriate. For example, the inter encoder (630) can generate decoded blocks based on the decoded residual data and the inter prediction information, and the intra encoder (622) can generate decoded blocks based on the decoded residual data and the intra prediction information. The decoded blocks are appropriately processed to generate a decoded image, which can be buffered in a memory circuit (not shown) and used as a reference image in some examples.

[0069] The entropy encoder (625) is configured to format a bitstream to include the encoded block. The entropy encoder (625) is configured to include various information in accordance with an appropriate standard, such as the HEVC standard. For example, the entropy encoder (625) is configured to include overall control data, selected prediction information (e.g., intra-prediction information or inter-prediction information), residual data, and other appropriate information in the bitstream. It is noted that, in accordance with the disclosed subject matter, there is no residual information when encoding a block in either an inter mode or a merge submode of a bi-prediction mode.

[0070] 7 shows a diagram of a video decoder (710) according to another embodiment of the present disclosure. The video decoder (710) is configured to receive encoded images that are part of an encoded video sequence and to decode the encoded images to generate reconstructed images. In an example, the video decoder (710) is used in place of the video decoder (310) in the example of FIG. 3.

[0071] In the example of FIG. 7, the video decoder (710) includes an entropy decoder (771), an inter decoder (780), a residual decoder (773), a reconstruction module (774), and an intra decoder (772), coupled together as shown in FIG.

[0072] The entropy decoder (771) may be configured to reconstruct from the coded image several symbols representing syntax elements from which the coded image is created. Such symbols may include, for example, residual information in the form of prediction information (e.g., intra-mode, inter-mode, bi-predictive mode, inter-mode and bi-predictive mode of merged submode or another submode), quantized transform coefficients, etc., that may identify the mode in which the block is coded (e.g., intra-mode, inter-mode, bi-predictive mode, merged submode or another submode), several samples or metadata used for prediction by the intra decoder (772) or the inter decoder (780), respectively. In an example, when the prediction mode is an inter-mode or bi-predictive mode, the inter decoder (780) is provided with inter prediction information, and when the prediction type is an intra prediction type, the intra decoder (772) is provided with intra prediction information. The residual information may be dequantized and provided to the residual decoder (773).

[0073] The inter decoder (780) is configured to receive the inter prediction information and to generate inter prediction results based on the inter prediction information.

[0074] The intra decoder (772) is configured to receive the intra prediction information and to generate a prediction result based on the intra prediction information.

[0075] The residual decoder (773) is configured to extract the unquantized transform coefficients and perform inverse quantization to process the unquantized transform coefficients and transform the residual from the frequency domain to the spatial domain. The residual decoder (773) may further require some control information (to include quantizer parameters (QP)), which may be provided by the entropy decoder (771) (data path not shown for this, since there may only be low volume control information).

[0076] The reconstruction module (774) is configured to combine the residual as the output of the residual decoder (773) and the prediction result (possibly as the output of an inter- or intra-prediction module) in the spatial domain to form a reconstructed block, which may become part of the reconstructed image and then part of the reconstructed video. It should be noted that other suitable operations, such as deblocking operations, may be performed to improve visual quality.

[0077] It should be noted that the video encoders (303), (503), and (603) and the video decoders (310), (410), and (710) may be implemented using any suitable technology. In an embodiment, the video encoders (303), (503), and (603) and the video decoders (310), (410), and (710) may be implemented using one or more integrated circuits. In another embodiment, the video encoders (303), (503), and (503) and the video decoders (310), (410), and (710) may be implemented using one or more processors executing software instructions.

[0078] FIG. 8 is a schematic diagram of a current block (810) in a current image (800) that is coded using intra block copy (IBC), according to an embodiment.

[0079] In some examples, a block may be coded using a reference block from a different image, also called motion compensation. In some examples, a block may be coded using a reference block from a previously reconstructed region in the same image, also called intra-image block compensation, current-image referencing (CPR), or intra-block copy (IBC). A displacement vector indicating the offset between the current block and the reference block is called a block vector (or BV for short). Unlike the motion vector of motion compensation, which can take any value (positive or negative, in both x and y dimensions), a constraint is imposed on the block vector to ensure that the reference block has already been reconstructed and its reconstructed samples are available. In some embodiments, some reference regions that cross tile boundaries or wavefront ladder shape boundaries are further excluded to take into account parallelism constraints.

[0080] The coding of block vectors may be explicit or implicit. In explicit mode, the difference between a block vector and its predictor may be signaled in a manner similar to AMVP mode in inter coding. In implicit mode, the block vector may be recovered from the predictor in a manner similar to the motion vectors in merge mode. The resolution of the block vectors is set to integer positions in some implementations, or in some examples, fractional positions.

[0081] The use of IBC at the block level can be signaled using a block-level flag. In some examples, this flag can be signaled when the current block is not coded in merge mode. In some examples, this flag can be signaled by the means of a reference index. This is done by treating the currently decoded picture as a reference picture. In HEVC Screen Content Coding (HEVC SCC), such a reference picture is placed at the last position of the list. This special reference picture is also further managed in the Decoded Picture Buffer (DPB) together with other temporal reference pictures.

[0082] There are several variations in the implementation of IBC, such as inverted intra block copy (where a reference block is flipped horizontally or vertically before being used to predict the current block), or line-based intra block copy (where each compensation unit within an M×N coding block is an M×1 or 1×N line).

[0083] An example of using IBC is shown in Figure 8, where a current image (800) includes 15 blocks organized in 3 rows and 5 columns. In some examples, each block corresponds to a coding tree unit (CTU). A current block (810) includes a sub-block (812) (e.g., a coded block in a CTU) that has a block vector (822) that points to a reference sub-block (832) in the current image (800).

[0084] The reconstructed samples of the current image can be stored in a dedicated memory. Considering the implementation cost, the reference area where the reconstructed samples of the reference block are available may not be as large as the entire frame, depending on the memory size of the dedicated memory. Thus, for a current sub-block using IBC, in some examples, the IBC reference sub-block may be limited to only a few adjacent areas, rather than the entire image.

[0085] In some examples, a memory dedicated to storing reference samples of previously encoded CUs for later intra block copy reference is called a reference sample memory. In one example, the memory size is one CTU, for example, storing at most one previously encoded CTU or one left CTU. In another example, the memory size is two CTUs, for example, two previously encoded CTUs, or two left CTUs, or one current CTU plus one left CTU. In some embodiments, each CTU requires a memory size to store 128x128 luma samples together with the corresponding chroma samples. When a reference block is outside the stored and reconstructed area, the reference block cannot be used for IBC.

[0086] In some embodiments, when starting a new CTU (i.e., the current CTU), the reference sample memory allocates space to store reconstructed samples for the entire current CTU. In some embodiments, the memory size is one CTU, and the space allocated to the current CTU can still be partially used to store reconstructed samples from previously encoded CTUs, so the allocation of space for the current CTU is not completed at the start of the current CTU. Thus, a part (or location) of the reference sample memory that stores reconstructed samples from previously encoded CTUs can be used in IBC mode to predict the current encoded block in the current CTU until this part is updated by the reconstructed samples of the current encoded block in the current CTU. After that, the data of this part can still be used for IBC reference to provide reconstructed samples from the current CTU, but cannot be used to provide reconstructed samples from the previously encoded CTU that has just been overwritten.

[0087] In some embodiments, the current CTU is divided into several partitions based on one or more predefined grid patterns, such as 64×64 partitions, 32×32 partitions, etc. If the position of the current coding block in the current CTU is within one of the predefined partitions, the reconstructed samples for the entire corresponding partition stored in the reference sample memory are updated with the reconstructed samples from the current CTU, indicating that the old reconstructed samples from the previously coded CTU in that partition in the reference sample memory cannot be used for IBC reference purposes. In some examples, the size of the partitions is at least as large as the maximum possible IBC code block size. For example, if the maximum reference block size for IBC is 64×64, the CTU can be divided into as small as 64×64 partitions.

[0088] In some alternative embodiments, when a reference block in a previously coded CTU and its co-located block in the current CTU share the same location in the reference sample memory, the memory location is updated with data from the current CTU when the co-located block in the current CTU is coded. During the coding process of the current CTU, for a coding block in IBC mode, the reference block in the previously coded CTU is found and its reference samples are stored in the reference sample memory. For this reference block, if none of the samples in the co-located block in the current CTU have been coded, the location in the reference sample memory is not updated with data from the current CTU and this reference block containing reference samples from the previously coded CTU can still be used for IBC. Alternatively, according to an embodiment, if at least one sample of the co-located block in the current CTU has been reconstructed, this reference block in the previously coded CTU can be indicated as overwritten and cannot be used for IBC reference.

[0089] In some embodiments, the memory size is two CTUs. When starting a new CTU (i.e., the current CTU), the reconstructed samples of the last coded CTU may be left as is, and the space allocated to the current CTU can be partially used to store reconstructed samples from previously coded CTUs that were coded before the last coded CTU. Thus, depending on the coding order, the partition structure of the block, and the availability of reconstructed samples in the memory, the allowable area of ​​reference samples used in IBC mode can be extended to the reconstructed part of the current CTU, the entire last coded CTU, and / or the part of the previously coded CTU that can be indicated as not being overwritten by the reconstructed samples of the current block.

[0090] In another embodiment, the memory size is two CTUs. When starting a new CTU (i.e., the current CTU), the reconstructed samples from the last coded CTU may be left as is. Thus, depending on the coding order, the partition structure of the block, and the availability of reconstructed samples in memory, the allowable range of reference samples used in IBC mode can be extended to the reconstructed part of the current CTU and the entire last coded CTU.

[0091] In some examples, the size of the IBC reference sub-blocks can be as large as certain inter-coded blocks. To use the reference sample memory more efficiently, the size of the IBC reference sub-blocks can be limited to not exceed 64 luma samples on either the width or height edge, and depending on the color format, corresponding size constraints are applied to the chroma samples. For example, in a 4:2:0 format, the size of the chroma blocks in IBC mode can be limited to not exceed 32 samples on each side. In some embodiments, a lower limit such as 32 luma samples on each side can be used.

[0092] In the following non-limiting examples, for purposes of illustrating various embodiments, the maximum IBC reference sub-block size is set to 64x64 luma samples. Therefore, with a CTU size of 128x128 luma samples, sub-blocks of 128x128, 128x64, 64x128, 128x32, 32x128, etc. cannot use intra block copy mode for luma samples. For chroma samples, the corresponding sizes for chroma samples apply, similar to the constraints for luma samples, depending on the color format.

[0093] FIG. 9 is a schematic diagram of a current block (CTU, 910) and a neighboring block (CTU, 960) in a current image using IBC, according to an embodiment.

[0094] In some embodiments, two sub-blocks from different CTUs are called co-located sub-blocks when the two sub-blocks have the same size and the same position offset value with respect to the top left corner of each CTU. Figure 9 shows a current sub-block (912) in a current block (i.e., CTU) (910) and three of its possible reference sub-blocks (962, 964, and 966) in a previously coded block (960) on the left side, identifiable by respective block vectors (922, 924, and 926). In this example, for a reference sample memory size of one CTU, the reference sub-block (966) can be found from memory because its co-located sub-block (936) in the current block (910) has not yet been reconstructed (white area). Therefore, that location in the reference sample memory still stores a reference sample from the previously coded block (960). In contrast, reference subblock (962) cannot be used because its co-located subblock (932) in the current block (910) has been reconstructed (gray area). The location of the reference sample memory for reference subblock (962) has been overwritten with the reconstructed samples from subblock (932) in the current block (910). Similarly, reference subblock (964) cannot be a valid reference subblock because a portion of its co-located subblock (934) in the current block (910) has been reconstructed, and therefore that portion of the memory has been partially overwritten with data in the current block (910).

[0095] To efficiently use the stored reconstructed samples while sharing memory space between CTUs, the encoder or decoder may determine whether a reference sub-block from a previously encoded block has been (or is believed to have been) overwritten based on the partition structure, the coding order, and / or the position of the current sub-block within the current block.

[0096] For example, if a reference subblock in a previously coded block and its co-located subblock in the current block share the same location in the reference sample memory, when any part of this co-located subblock in the current block is coded, its location in the memory can be indicated as being updated (e.g., overwritten or considered to be overwritten) with data in the current block. During the coding process of the current block, for a subblock in IBC mode, its reference subblock in the previously coded block is found and its reference samples are stored in the reference sample memory. For this reference subblock, if the samples in its co-located subblock in the current block have not been coded, its location in the reference sample memory has not been updated with data from the current block, and this reference subblock containing reference samples from the previously coded block can be used for IBC reference. Otherwise, when at least one sample of the co-located subblock in the current block has been coded, the corresponding location in the reference sample memory has been updated with data in the current block, and this reference subblock cannot be used for IBC reference.

[0097] The general solution described above is based on checking the availability of different positions during the encoding and / or decoding process of the current block. Such availability checking process can be simplified in some examples to only checking the availability of some pre-defined positions. In some examples, the determination of the availability of a 64x64 luma block from a previously coded block may be based on whether any part of the 64x64 block at that same position in the current block is coded. In this case, only the top-left position of each 64x64 block in the current block may need to be checked. In other embodiments, other positions may be checked. The proposed method / solution can be extended to smaller block sizes, such as evaluation based on 32x32 blocks.

[0098] Based on the following two partitioning scenarios, different determination factors for different partition structures are further described. Based on different partition structures, such availability determination may be made by checking individual samples unlimitedly or limitedly to increase the availability reference range and improve IBC performance without using extra reference sample memory.

[0099] In the first scenario, each of the four 64x64 luma partitions (32x32 chroma partitions in 4:2:0 format) in the current CTU is completely contained within a coding block (also called a sub-block), or each coding block in the current CTU is completely contained within one of the four 64x64 luma partitions (32x32 chroma partitions in 4:2:0 format).

[0100] According to the first scenario, at the 128x128 CTU level, this block can be coded as is (128x128), or it can be split into four 64x64 blocks which can be further split, or it can be split into two 128x64 blocks which can be further split, or it can be split into two 64x128 blocks which can be further split.

[0101] In some variants, ternary tree division is not allowed for blocks with any edge (width or height) larger than 64 luma samples, or the resulting block is not contained within one of the four 64x64 partitions, or entirely contains one of the four 64x64 partitions.

[0102] In one example, if a coding block size is 128x128 and the maximum IBC block size is 64x64, then this 128x128 block will not be coded in IBC mode.

[0103] In one example, when the coding block is four 64×64 blocks, the availability of reference samples can be explained with reference to FIG. 10A.

[0104] FIG. 10A is a schematic diagram illustrating how reconstructed samples in neighboring blocks are overwritten based on the position of a current sub-block encoded using IBC, according to one embodiment.

[0105] In FIG. 10A, the current block (1010) corresponds to a current CTU that includes four 64×64 partitions (1012, 1014, 1016, and 1018). The previously coded block (1060) corresponds to a left CTU that includes four 64×64 partitions (1062, 1064, 1066, and 1068). The coding order for processing the coding blocks in the current block (1010) starts with the top left partition (1012), then the top right partition (1014), then the bottom left partition (1016), and finally the bottom right partition (1018). The 64×64 partitions with vertical stripes are where the current coding block will be located (the current coding block may be smaller in size than 64×64). The shaded grey blocks are reconstructed blocks. Blocks marked with an "X" cannot be used for IBC lookup because they need to be overwritten or have been overwritten with a reconstructed sample from the current block at the corresponding location.

[0106] Thus, if the current coding block falls within the top-left 64x64 partition (1012) of the current block (1010), then IBC mode can be used to reference reconstructed samples in the top-right, bottom-left, and bottom-right 64x64 partitions (1064, 1066, and 1068) of the left CTU (block 1060), in addition to already reconstructed samples in the current CTU. Partition (1062) is shown as being overwritten and unavailable.

[0107] In an embodiment, if the current coding block falls within the top right 64x64 partition (1014) of the current block (1010), then in addition to already reconstructed samples in the current CTU, it can reference reconstructed samples in the bottom left and bottom right 64x64 partitions (1066 and 1068) of the left CTU (block 1060) using IBC mode. Partitions (1062 and 1064) are shown as being overwritten and unavailable.

[0108] In an embodiment, if the current coding block falls within the bottom-left 64x64 partition (1016) of the current block (1010), then in addition to already reconstructed samples in the current CTU, reference samples in the bottom-right 64x64 partition of the left CTU (block 1060) can be referenced using IBC mode. Partitions (1062, 1064, and 1066) are shown as being overwritten and unavailable.

[0109] In an embodiment, only already reconstructed samples in the current CTU can be referenced using IBC mode if the current coding block falls within the 64x64 partition (1018) to the bottom right of the current block (1010). Partitions (1062, 1064, 1066, and 1068) are shown as being overwritten and unavailable.

[0110] The above assumptions work for cases where the CTU is split into a quadtree at the first level (when there is any split at the 128x128 level), such as when separate luma / chroma coding trees (parallel trees) are used.

[0111] In one example, if the coding block is two 128x64 blocks, it is not allowed to apply horizontal binary tree partitioning at the next level, otherwise the resulting 128x32 block would be contained in two 64x64 partitions, which would violate the premise of the first scenario. Therefore, each 128x64 block may be coded as is, or may be partitioned into two 64x64 blocks, or may be partitioned into four 64x16 blocks by a quadtree.

[0112] In one example, if the coding block is two 64x128 blocks, it is not allowed to apply vertical binary tree partitioning at the next level, otherwise the resulting 32x128 block will be contained in two 64x64 partitions, which contradicts the premise of the first scenario. Therefore, each 64x128 block may be coded as it is, or may be partitioned into two 64x64 blocks, or may be partitioned into four 16x64 blocks by a quadtree.

[0113] In some examples, the VVC standard allows flexible block partitioning strategies using quad-trees, binary trees, and ternary trees. If the first level partition is not a quad-tree, such as when parallel trees are not used, it may still be a binary tree partition (rather than a ternary tree partition). If a vertical binary tree partition is applied at the first level from the CTU, such as having two 128x64 blocks or two 64x128 blocks, the second and third coding orders of the four 64x64 partitions in Figure 10A may be different.

[0114] Fig. 10B is a schematic diagram of how reconstructed samples in neighboring blocks are indicated as overwritten based on the position of the current sub-block coded using IBC according to another embodiment. In Fig. 10B, the availability of reference samples for the top right 64x64 block and the bottom left 64x64 block is shown when vertical binary tree partitioning is applied at the 128x128 level from the CTU. When horizontal binary tree partitioning is applied at the 128x128 level from the CTU, the coding order and availability of reference samples for the top right 64x64 block and the bottom left 64x64 block are the same as Fig. 10A.

[0115] Thus, according to an embodiment, if the current coding block falls within the top-left 64x64 partition (1012) of the current block (1010), then IBC mode can be used to reference reconstructed samples in the top-right, bottom-left, and bottom-right 64x64 partitions (1064, 1066, and 1068) of the left CTU (block 1060), in addition to the already reconstructed samples in the current CTU. Partition (1062) is shown as being overwritten and unavailable.

[0116] According to an embodiment, if the current coding block falls within the bottom-left 64x64 partition (1016) of the current block (1010), then in addition to already reconstructed samples in the current CTU, reconstructed samples in the top-right and bottom-right 64x64 partitions (1064 and 1068) of the left CTU (block 1060) can be referenced using IBC mode. Partitions (1062 and 1066) are shown as being overwritten and unavailable.

[0117] If the current coding block falls within the upper right 64x64 partition (1016) of the current block (1010), then in addition to the already reconstructed samples in the current CTU, reference samples in the lower right 64x64 partition of the left CTU (block 1060) can be referenced using IBC mode. Partitions (1062, 1064, and 1066) are shown as being overwritten and unavailable.

[0118] According to an embodiment, only already reconstructed samples in the current CTU can be referenced using IBC mode if the current coding block falls within the bottom right 64x64 partition (1018) of the current block (1010). Partitions (1062, 1064, 1066, and 1068) are shown as being overwritten and unavailable.

[0119] Two exemplary solutions are outlined below for discussion with reference to Figures 10A and 10B.

[0120] A first exemplary solution is to fully reuse the reference sample memory when possible. More specifically, depending on the position of the current sub-block (e.g., coding block) relative to the current block (e.g., CTU), the following items can be applied: If the current sub-block is within the top-left 64x64 block of the current block, in addition to the already reconstructed samples in the current block, the reconstructed samples in the top-right, bottom-left, and bottom-right 64x64 blocks of the left block can be further referenced using IBC mode. · If the current sub-block is within the top right 64x64 block of the current block, in addition to the already reconstructed samples in the current block, it can further reference reconstructed samples in the bottom right 64x64 block of the left block using IBC mode. Also, if the luma position (0,64) for the current block has not yet been reconstructed, the current sub-block can further reference reconstructed samples in the bottom left 64x64 block of the left block using IBC mode. · If the current sub-block is within the bottom-left 64x64 partition of the current block, in addition to the already reconstructed samples in the current block, it can further reference reconstructed samples in the bottom-right 64x64 partition of the left block using IBC mode. If the luma position (64,0) for the current block has not yet been reconstructed, the current sub-block can further reference reconstructed samples in the top-right 64x64 partition of the left block using IBC mode. Only already reconstructed samples in the current block can be referenced using IBC mode if the current block is within the lower right 64x64 cell of the current block.

[0121] Table I below summarizes the availability of reconstructed samples from the left block for the first exemplary solution. UL, UR, LL, and LR refer to the top left, top right, bottom left, and bottom right, respectively. An "X" sign means unavailable and a "Y" sign means available.

[0122] [Table 1]

[0123] The second exemplary solution is to simplify the process, independent of the block division strategy adopted. More specifically, depending on the position of the current sub-block (e.g., coding block) relative to the current block (e.g., CTU), the following items can be applied: If the current sub-block is within the top-left 64x64 block of the current block, in addition to the already reconstructed samples in the current block, the reconstructed samples in the top-right, bottom-left, and bottom-right 64x64 blocks of the left block can be further referenced using IBC mode. If the current sub-block is within the upper right 64x64 block of the current block, in addition to the already reconstructed samples in the current block, the reconstructed samples in the lower right 64x64 block of the left block can be further referenced using IBC mode. If the current sub-block is within the bottom-left 64x64 block of the current block, in addition to the already reconstructed samples in the current block, the IBC mode can be used to further reference reconstructed samples in the bottom-right 64x64 block of the left block. Only already reconstructed samples in the current block can be referenced using IBC mode if the current block is within the lower right 64x64 cell of the current block.

[0124] Table II below summarizes the availability of reconstructed samples from the left block for the second exemplary solution. UL, UR, LL, and LR refer to the top left, top right, bottom left, and bottom right, respectively. An "X" sign means unavailable and a "Y" sign means available.

[0125] [Table 2]

[0126] In the second scenario, only quad-tree and binary-tree partitioning is allowed at the CTU root (128x128 luma samples). Binary-tree or ternary-tree partitioning can then be applied on either side of the 64x128, 128x64, or 64x64 blocks, respectively.

[0127] According to the second scenario, if the current sub-block in CPR mode falls within the range of the upper-left 64×64 partition, it is only guaranteed that all coding units in the upper-left 64×64 partition are coded before the coding blocks in the lower-right 64×64 partition. In this case, the lower-right 64×64 partition of the left block has not been updated yet during the processing of the coding units in the upper-left 64×64 partition of the current block. The reconstructed samples of this reference area (the lower-right 64×64 partition of the left block) can be used for CPR reference.

[0128] For coding blocks that are in the other three 64x64 partitions of the current block, there is no guarantee that the complete 64x64 partition containing the reference samples of the left block is not updated during the processing of the coding unit in the corresponding 64x64 partition. In some examples, no special action is suggested.

[0129] In the second scenario, two exemplary solutions are outlined as follows.

[0130] In a third exemplary solution, if the current sub-block is inside the top-left 64x64 partition of the current block, it is allowed to use the bottom-right 64x64 partition of the left block as a reference for the CPR mode. For sub-blocks inside the other three 64x64 partitions of the current block, it is only possible to reference reconstructed samples within the current block.

[0131] Table III below summarizes the availability of reconstructed samples from the left block for the third example solution. UL, UR, LL, and LR refer to the top left, top right, bottom left, and bottom right, respectively. An "X" sign means unavailable and a "Y" sign means available.

[0132] [Table 3]

[0133] To further improve the third exemplary solution, the availability of each 64x64 partition of the left block can be evaluated by checking the availability of the top left corner of each 64x64 partition in the current block for each sub-block in the current block. For example, when the current sub-block is in the top right 64x64 partition of the current block, if the top left corner of the bottom left 64x64 partition in the current block has not yet been reconstructed, it means that the top left and top right 64x64 partitions of the current block are processed before the bottom left and bottom right 64x64 partitions of the current block. Therefore, the reference sample memory locations that store the reference samples in the bottom left and bottom right 64x64 partitions of the left block have not yet been updated. These can be used as references for the current sub-block in the CPR mode. A similar check for the top left corner of the top right 64x64 partition is applied.

[0134] The fourth exemplary solution therefore allows for a more complete reuse of the reference sample memory when possible. More specifically, depending on the position of the current sub-block relative to the current block, the following items can be applied: ·If the current sub-block is within the top-left 64x64 partition of the current block, in addition to the already reconstructed samples in the current block, it can further reference reconstructed samples in the bottom-right 64x64 partition of the left block using IBC mode. Also, if the luma position (0,64) for the current block is not yet reconstructed, the current sub-block can further reference reconstructed samples in the bottom-left 64x64 partition of the left block using IBC mode. If the luma position (64,0) for the current block is not yet reconstructed, the current sub-block can further reference reconstructed samples in the top-right 64x64 partition of the left block using IBC mode. If the current sub-block is within the top right 64x64 block of the current block, in addition to the already reconstructed samples in the current block, if luma position (0,64) relative to the current block has not been reconstructed, the current sub-block may further reference reconstructed samples in the bottom left 64x64 block and bottom right 64x64 block of the left block using IBC mode. If the current sub-block is within the bottom-left 64x64 block of the current block, in addition to the already reconstructed samples in the current block, if the luma position (64,0) relative to the current block has not been reconstructed, the current sub-block may further reference reconstructed samples in the top-left 64x64 block and bottom-right 64x64 block of the left block using IBC mode. Only already reconstructed samples in the current block can be referenced using IBC mode if the current block is within the lower right 64x64 cell of the current block.

[0135] Table IV below summarizes the availability of reconstructed samples from the left block for the fourth example solution. UL, UR, LL, and LR refer to the top left, top right, bottom left, and bottom right, respectively. An "X" sign means unavailable and a "Y" sign means available.

[0136] [Table 4]

[0137] In the above solution, the reconstructed samples of the left block are divided into four 64x64 partitions, each of which is considered as a whole unit for determining whether the reconstructed samples in this partition can be used for coding the current sub-block in CPR mode. The above proposed solution can also be applied to a finer partition setting, for example to evaluate each 32x32 partition in the reference sample memory.

[0138] Furthermore, an evaluation of whether the reference sub-block for the current sub-block in IBC mode is in the left block can be performed by determining (a) whether all samples in the reference sub-block are from the left block, and (b) whether all reconstructed samples in the reference sub-block are from the left block.

[0139] The block vector constraint example based on the fourth solution described above is used as a non-limiting example below. In the example below, the CTU has a size of 128×128, and the reference sample memory has a size to store one CTU. In the example below, there is no chroma interpolation for IBC mode.

[0140] In this non-limiting example, the following is assumed: The luma position (xCb, yCb) of the top-left sample of the current luma coding block (e.g., current sub-block) relative to the top-left luma sample of the current picture. The variable cbWidth specifies the width of the current coding block in luma samples. The variable cbHeight specifies the height of the current coding block in luma samples. The variable ctuSize specifies the size (width or height) of the coding tree block (e.g., the current block) in luma samples. The luma block vector (bVx,bVy) for the current luma coding block, in integer precision.

[0141] Therefore, the top-left position of the current sub-block is (xCb, yCb), the bottom-right position of the current sub-block is (xCb+cbWidth-1, yCb+cbHeight-1), the top-left position of the reference sub-block is (xCb+bVx, yCb+bVy), and the bottom-right position of the reference sub-block is (xCb+bVx+cbWidth-1, yCb+bVy+cbHeight-1).

[0142] In this non-limiting example, a valid block vector satisfies the following conditions: The entire reference subblock is reconstructed before the current subblock, The entire reference subblock is located within the same tile / slice as the current subblock, bVx+cbWidth+xCb<=0 or bVy+cbHeight+yCb<=0, ·(yCb+bVy) / ctuSize=yCb / ctuSize, ·(yCb+bVy+cbHeight=1) / ctuSize=yCb / ctuSize, (xCb+bVx) / ctuSize>=(xCb / ctuSize)―1, (xCb+bVx+cbWidth-1) / ctuSize<=xCb / ctuSize.

[0143] If (xCb+bVx) / ctuSize is equal to (xCb / ctuSize)−1, it means that at least a part of the reference sub-block is within the left block, and the following items apply: · The condition (xCb%ctuSize>=64&&yCb%ctuSize>=64) is not true, If xCb%ctuSize<64&&yCb%ctuSize<64, If position ((xCb / ctuSize)+64,(yCb / ctuSize)) is unavailable (i.e. the sample at this position has not been reconstructed) and position ((xCb / ctuSize),(yCb / ctuSize)+64) is unavailable, then either (xCb+bVx)%ctuSize>64 or (yCb+bVy)%ctuSize>64 is true, If position ((xCb / ctuSize)+64,(yCb / ctuSize)) is unavailable, then (xCb+bVx)%ctuSize>64 is true, (If position ((xCb / ctuSize), (yCb / ctuSize)+64) is unavailable) (yCb+bVy)%ctuSize>64 is true, If xCb%ctuSize>=64&&xCb%ctuSize<64, Position ((xCb / ctuSize), (yCb / ctuSize)+64) is unavailable and (yCb+bVy)%ctuSize>64 is true, If xCb%ctuSize<64&&xCb%ctuSize>=64, Position ((xCb / ctuSize)+64,(yCb / ctuSize)) is unavailable and (xCb+bVx)%ctuSize>64 is true.

[0144] The proposed solution as described above can be extended to other configurations of the reference sample memory. Also, it should be noted that while the determination of which reconstructed samples are available is described above for some processing orders and partition sizes (e.g., from left to right or from top to bottom), the determination can be changed according to other processing orders and / or partition sizes in other embodiments.

[0145] Figure 11 is a schematic diagram of a current block (CTU, 1110), a first reference block (CTU, 1160), and a second reference block (CTU, 1140) between the current block (CTU, 1110) and the first reference block (CTU, 1160) in a current image using IBC, according to an embodiment. Figure 11 shows a current sub-block (1112) in the current block (i.e., CTU) (1110), a first possible reference sub-block (1166) in the first reference block (1160) that can be identified by a block vector (1126), and a second possible reference sub-block (1142) in the second reference block (1140) that can be identified by a block vector (1122). When generating the reconstructed samples for the current block (1110), the memory space for storing the reconstructed samples for the block (1140) remains intact so that all reconstructed samples of the second reference block (1140) may be available for determining the reference sub-block for the current sub-block (1112) in IBC mode. However, the memory space for storing the reconstructed samples of the first reference block (1160) is allocated for storing the reconstructed samples for the current block (1110), and the availability of the reference sub-block in the first reference block (1160) depends on whether the co-located block in the current block (1110) has been reconstructed, in a manner similar to that described above with reference to Figures 9-11.

[0146] 12 shows a flow chart outlining a decoding process (1200) according to an embodiment of the present disclosure. The process (1200) can be used to reconstruct a block (i.e., the current block) of an image that was coded using IBC mode. In some embodiments, one or more operations are performed before or after the process (1200), and some of the operations shown in FIG. 12 may be reordered or omitted.

[0147] In various embodiments, step (1200) is performed by a processing circuit, such as processing circuitry in terminal devices (210), (220), (230), and (240), or processing circuitry performing the functions of video decoders (310), (410), or (710). In some embodiments, step (1200) is performed by software instructions, such that the processing circuitry performs step (1200) when it executes the software instructions. The process begins at (S1201) and proceeds to (S1210).

[0148] At (S1210), reconstructed samples of a reconstructed block of an image are stored in a memory. The reconstructed samples of the reconstructed block are reconstructed according to the encoded video bitstream. In some examples, the reconstructed block corresponds to block (960) of FIG. 9 or block (1160) of FIG. 11. In some examples, the reconstructed samples of the reconstructed block may be generated using the systems or decoders shown in FIG. 3, FIG. 4, and FIG. 7.

[0149] In (S1220), it is determined whether the current sub-block in the current block of the image is reconstructed using intra block copy (IBC) based on the reference sub-block in the reconstruction block. If it is determined that the current sub-block is reconstructed using IBC, the process proceeds to (S1230). If not, the current sub-block can be reconstructed using another process and is coded using IBC mode, the process proceeds to (S1299) and ends.

[0150] In (S1230), it is determined whether the reconstructed samples of the reference subblock stored in the memory have been overwritten (or are indicated to be overwritten) based on the position of the current subblock. In some examples, it is determined that the reconstructed samples of the reference subblock stored in the memory have been overwritten, for example, as described above with reference to Figures 9-11. When it is determined that the reconstructed samples of the reference subblock stored in the memory indicate that they have been overwritten, the process proceeds to (S1240). Otherwise, the current subblock is reconstructed without using the reconstructed samples of the reference subblock or by another process, and the process proceeds to (S1299) and ends for encoding using IBC mode. In some examples, the reconstructed samples of the reconstructed block can be generated using the system or decoder shown in Figures 3, 4, and 7.

[0151] When it is determined in (S1240) that the reconstructed sample of the reference sub-block stored in the memory indicates that it is not overwritten, a reconstructed sample of the current sub-block is generated for output based on the reconstructed sample of the reference sub-block. In (S1250), the reconstructed sample of the co-located sub-block in the reconstructed block stored in the memory is overwritten with the generated reconstructed sample of the current sub-block. In some examples, the reconstructed sample of the reconstructed block may be generated using the system or decoder shown in Figures 3, 4, and 7.

[0152] After step (S1250), the process proceeds to (S1299) and ends.

[0153] 13 shows a flow chart outlining an encoding process (1300) according to an embodiment of the present disclosure. The process (1300) may be used to encode a block of an image (i.e., a current block) using IBC mode. In some embodiments, one or more operations may be performed before or after the process (1300), and some of the operations shown in FIG. 13 may be reordered or omitted.

[0154] In various embodiments, step (1300) is performed by a processing circuit, such as the processing circuitry in terminal devices (210), (220), (230), and (240), the processing circuitry performing functions such as video encoders (303), (503), or (603). In some embodiments, step (1300) is performed by software instructions, such that the processing circuitry performs step (1300) when it executes the software instructions. The process begins at (S1301) and proceeds to (S1310).

[0155] At (S1310), reconstructed samples of a reconstructed block of an image are stored in a memory. The reconstructed samples of the reconstructed block are reconstructed according to the encoded prediction information. In some examples, the reconstructed block corresponds to block (960) of FIG. 9 or block (1160) of FIG. 11. In some examples, the reconstructed samples of the reconstructed block can be generated using the systems or encoders shown in FIG. 3, FIG. 5, and FIG. 6.

[0156] In (S1320), it is determined whether the current sub-block in the current block of the image is coded using intra block copy (IBC) based on the reference sub-block in the reconstructed block. If it is determined that the current sub-block is coded using IBC, the process proceeds to (S1330). Otherwise, the current sub-block may be coded using a process not fully described in this disclosure, and the process proceeds to (S1399) and ends for coding using IBC mode.

[0157] At (S1330), a range of reconstructed samples stored in memory that are not overwritten (or not indicated as being overwritten) is determined based on at least the position of the current sub-block. In some examples, it may be determined whether the range of reconstructed samples stored in memory is overwritten or not, e.g., as described above with reference to Figures 9-11. In some examples, the reconstructed samples of the reconstructed block may be generated using the systems or encoders shown in Figures 3, 5, and 6.

[0158] At (S1340), a reference sub-block within the range of the reconstructed sample that is not indicated as being overwritten is determined. At (S1350), a reconstructed sample of the current sub-block is generated based on the reconstructed sample of the reference sub-block. At (S1360), the reconstructed sample of the co-located sub-block in the reconstructed block stored in memory is overwritten with the generated reconstructed sample of the current sub-block. In some examples, the reconstructed samples of the reconstructed block may be generated using the systems or encoders shown in Figures 3, 5, and 6.

[0159] After step (S1360), the process proceeds to (S1399) and ends.

[0160] The techniques described above can be implemented as computer software using computer readable instructions and physically stored on one or more computer readable media. For example, Figure 14 illustrates a computer system (1400) suitable for implementing some embodiments of the disclosed subject matter.

[0161] Computer software can be encoded using any suitable machine code or computer language, which may follow mechanisms of assembly, compilation, linking, etc. to produce code containing instructions that can be executed by one or more computer central processing units (CPUs), graphics processing units (GPUs), etc., directly, or via interpretation, microcode execution, etc.

[0162] The instructions may be executed in various types of computers or components thereof, such as personal computers, tablet computers, servers, smartphones, gaming consoles, and Internet of Things (IoT) devices.

[0163] 14 are exemplary in nature and are not intended to suggest any limitation 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 computer system (1400).

[0164] The computer system (1400) may include several human interface input devices. Such human interface input devices may be responsive to input by one or more users, for example, by tactile input (key presses, swipes, data glove movements, etc.), audio input (voice, clapping hands, etc.), visual input (gestures, etc.), olfactory input (not shown). The human interface devices may further be used to capture several media that do not necessarily involve direct conscious human input, such as audio (speech, music, ambient sounds, etc.), images (scanned images, photographic images captured by still cameras, etc.), and video (two-dimensional video, three-dimensional video including stereoscopic video, etc.).

[0165] The input human interface devices may include one or more of a keyboard (1401), a mouse (1402), a trackpad (1403), a touch screen (1410), a data glove (not shown), a joystick (1405), a microphone (1406), a scanner (1407), and a camera (1408) (only one of each is shown).

[0166] The computer system (1400) may include a number of human interface output devices. Such human interface output devices may stimulate one or more of the user's senses, such as 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 (1410), data gloves (not shown), or joystick (1405), although there may also be haptic feedback devices that do not function as input devices), audio output devices (speakers (1409), headphones (not shown)), visual output devices (such as screens (1410) including CRT screens, LCD screens, plasma screens, OLED screens, each with or without touch screen input capability, each with or without haptic feedback capability, some of which may be capable of outputting output in more than three dimensions by means of two-dimensional video output, or stereoscopic output, etc., VR glasses (not shown), holographic displays, smoke tanks (not shown), and printers (not shown)).

[0167] The computer system (1400) may further include human-accessible storage devices and associated media therewith, such as CD / DVD ROM / RW (1420), including media (1421), such as CDs / DVDs, thumb-drives (1422), removable hard drives or solid-state drives (1423), legacy magnetic media (not shown), such as tapes and floppy disks, and optical media, including specialized ROM / ASIC / PLD based devices (not shown), such as security dongles.

[0168] Those skilled in the art should further appreciate that the term "computer-readable medium" as used with respect to the subject matter disclosed herein does not include transmission media, carrier waves or other transitory signals.

[0169] The computer system (1400) may further comprise an interface to one or more communication networks. The network may be, for example, wireless, wired, optical. The network may further be local, wide area, metropolitan, in-vehicle and industrial, real-time, delay tolerant, etc. Examples of networks include local area networks such as Ethernet, mobile communication networks including wireless LAN, GSM, 3G, 4G, 5G, LTE, etc., wired or wireless wide area digital networks including cable, satellite, and terrestrial television, in-vehicle and industrial networks including CANBus, etc. Some networks typically require an external network interface adapter attached to some general-purpose data port or peripheral bus (1449) (e.g., a USB port of the computer system (1400)), while other networks are typically integrated into the core of the computer system (1400) by attaching to a system bus (e.g., an Ethernet interface to a PC computer system, or a mobile communication network interface to a smartphone computer system) as described below. Using any such network, the computer system (1400) can communicate with other entities. Such communications may be one-way, receive-only (e.g., television broadcast), one-way transmit-only (e.g., a device transmitting from the CANbus to the CANbus), or bidirectional to other computer systems, for example, using local or wide area digital networks. As previously mentioned, several protocols and protocol stacks may be used for each such network and each network interface.

[0170] The human interface devices, human accessible storage devices, and network interfaces described above may be attached to a core (1440) of the computer system (1400).

[0171] The cores (1440) may include one or more central processing units (CPUs) (1441), graphic processing units (GPUs) (1442), specialized programmable processing units (1443) in the form of field programmable gate areas (FPGAs), hardware accelerators (1444) for some tasks, etc. Such devices may be connected via a system bus (1448) along with read only memory (ROM) (1445), random access memory (1446), internal mass storage such as an internal non-user accessible hard drive, SSD, etc. (1447). In some computer systems, the system bus (1448) may be accessible in the form of one or more physical plugs to allow expansion with additional CPUs, GPUs, etc. Peripheral devices may be attached directly to the core's system bus (1448) or via a peripheral bus (1449). Peripheral bus architectures include PCI, USB, etc.

[0172] The CPU (1441), GPU (1442), FPGA (1443), and accelerator (1444) may execute a combination of instructions that may create the aforementioned computer code. The computer code may be stored in a ROM (1445) or a RAM (1446). Transient data may also be stored in the RAM (1446), whereas persistent data may be stored, for example, in an internal mass storage device (1447). The use of cache memory allows for quick storage and retrieval in any memory device, which may be closely associated with one or more of the CPU (1441), GPU (1442), mass storage device (1447), ROM (1445), RAM (1446), etc.

[0173] 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.

[0174] By way of example and not of limitation, a computer system having the architecture (1400), and in particular the core (1440), can provide functionality as a result of a processor(s) (CPU, GPU, FPGA, accelerator, etc.) executing software embodied in one or more tangible computer-readable media. Such computer-readable media may be user-accessible mass storage devices as introduced above, as well as media associated with some storage of the core (1440) that is non-transitory in nature, such as the core internal mass storage device (1447) or ROM (1445). Software implementing various embodiments of the present disclosure can be stored in such devices and executed by the core (1440). The computer-readable media can include one or more memory devices or chips according to particular needs. The software can cause the core (1440) and in particular the processors therein (including the CPU, GPU, FPGA, etc.) to perform certain operations, or certain portions of certain operations, described herein, including the definition of data structures stored in RAM (1446) and the modification of such data structures according to the operations defined by the software. Additionally or alternatively, the computer system may provide functionality as a result of logic hardwired into or embodied in circuitry (e.g., accelerator (1444)), which may operate in place of or in conjunction with software to perform certain operations, or portions of certain operations, described herein. References to software may encompass logic, where appropriate, and vice versa. References to computer-readable media may encompass circuitry (such as integrated circuits (ICs)) that store software for execution, where appropriate, circuitry embodying logic for execution, or both. The present disclosure encompasses any suitable combination of hardware and software. Appendix: Acronyms JEM: Joint exploration model VVC: versatile video coding BMS: Benchmark set MV: Motion Vector HEVC: High Efficiency Video Coding SEI: Supplementary Enhancement Information VUI:Video Usability Information GOP: Group of Pictures TU: Transform Unit PU: Prediction Unit CTU: Coding Tree Unit CTB: Coding Tree Block PB: Prediction Block HRD: Hypothetical Reference Decoder SNR: Signal Noise Ratio CPU: Central Processing Unit GPU: Graphics Processing Unit 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 Array SSD: Solid-state drive IC: Integrated Circuit CU: Coding Unit IBC: Intra Block Copy CPR: Current Picture Referencing BV: Block Vector AMVP: Advanced Motion Vector Prediction HEVC SCC: HEVC Screen Content Coding DPB: Decoded Picture Buffer

[0175] While this disclosure has described several exemplary embodiments, there are alterations, substitutions, and various substitute equivalents, which are within the scope of this disclosure. Thus, it will be appreciated that those skilled in the art will be able to devise many systems and methods that embody the principles of the present disclosure and are therefore within its scope, even if not explicitly shown or described herein. [Explanation of symbols]

[0176] 200 Communication Systems 210 Terminal Equipment 220 Terminal Equipment 230 Terminal Equipment 240 Terminal Equipment 250 Network 300 Communication Systems 301 Video Source 302 Video Stream 303 Video Encoder 304 Video data, encoded video bitstream 305 Streaming Server 306 Client Subsystem 307 Copying of encoded video data 308 Client Subsystem 309 Copying of encoded video data 310 Video Decoder 311 Outgoing Video Stream 312 Display device 313 Acquisition Subsystem 320 Electronic equipment 330 Electronic equipment 401 Channel 410 Video Decoder 412 Display device 415 Buffer Memory 420 Parser 421 Symbols 430 Electronic equipment 431 Receiver 451 Scaler / Descaler Unit 452 Intra-Image Prediction Unit 453 Motion Compensation Prediction Unit 455 Aggregation Device 456 Loop Filter Unit 457 Reference Image Memory 458 Current Image Buffer 501 Video Source 503 Video Encoder 520 Electronic equipment 530 Source Encoder 532 encoding engine 533 Local Decoder 534 Reference Image Memory 535 Predictor 540 Transmitter 543 Video Sequence 545 Entropy Encoder 550 Controller 560 Communication Channels 603 Video Encoder 621 General Controller 622 Intra Encoder 623 Residual Calculator 624 Residual Encoder 625 Entropy Encoder 626 Switch 628 Residual Decoder 630 Intercoder 710 Video Decoder 771 Entropy Decoder 772 Intra Decoder 773 Residual Decoder 774 Reconstruction Module 780 Inter Decoder 1400 Computer Systems 1401 Keyboard 1402 Mouse 1403 Trackpad 1405 Joystick 1406 Mike 1407 Scanner 1408 Camera 1409 Audio output device 1410 Touch Screen 1420 CD / DVD ROM / RW 1421 Medium 1422 USB memory 1423 Solid State Drive 1440 cores 1441 Central Processing Unit (CPU) 1442 Graphics Processing Unit (GPU) 1443 FPGA 1444 Accelerator 1445 Read-Only Memory (ROM) 1446 Random Access Memory (RAM) 1447 Internal mass storage 1448 System Bus 1449 Surrounding Bus 1450 Graphics Adapter 1454 Network Interface

Claims

1. 1. A method for decoding video performed by a decoder, comprising: storing reconstructed samples of a reconstructed block of an image in a reference memory, the reconstructed samples of the reconstructed block being reconstructed according to an encoded video bitstream; determining a reference sub-block for the current sub-block in a current block of the image based on a block vector within a search range in the current image, when the current sub-block in the current block is reconstructed using intra block copy (IBC) based on a reference sub-block in the reconstructed block, the search range including all remaining areas of coding blocks reconstructed before the current block in a current coding tree block (CTB) or coding blocks in a previously reconstructed CTB after an area co-located with an area including the current sub-block, the area co-located with the current area being an area in the previously reconstructed CTB having the same relative position as the current area in the current CTB; after the reference sub-block is determined, generating reconstructed samples of the current sub-block for output based on the reconstructed samples of the reference sub-block; updating the reconstructed samples of the sub-blocks in the reconstructed block stored in the reference memory; Including, the size of the current CTB is less than or equal to the size of the reference memory, the previously reconstructed CTB is the CTB to the left of the current CTB, and the location of the co-located region is offset from the location of the current region by the width of the reference memory; method.

2. Updating the reconstructed samples of the sub-blocks in the reconstructed block stored in the reference memory includes: updating the reconstructed sample of a sub-block in the reconstructed block stored in the reference memory, the sub-block being at the same position as the current sub-block in the current block, with the reconstructed sample generated by the current sub-block; The method of claim 1.

3. The search range includes at least all remaining areas in the previously reconstructed CTB after the area co-located with the area including the current sub-block, If the current region is the first region to be reconstructed in the current CTB, the search range includes at least all remaining regions in the previously reconstructed CTB other than the region at the same position as the current region; The method according to claim 1 or 2.

4. 4. A method according to claim 1, wherein the size of the current CTB and the previously reconstructed CTB is 128x128 samples, the current CTB includes four partitions of 64x64 samples, the previously reconstructed CTB includes four partitions of 64x64 samples, the position of the co-located sub-block is offset by 128 samples from the position of the current sub-block, the current region is one of the four partitions in the current CTB, and the co-located region is one of the four partitions in the previously reconstructed CTB.

5. The four sections in the current CTB include an upper left section, an upper right section, a lower left section and a lower right section; the four compartments in the previously reconstructed CTB include an upper left compartment, an upper right compartment, a lower left compartment, and a lower right compartment; if the current region is the top left region of the current CTB, the co-located region is the top left region of the previously reconstructed CTB; if the current region is the top right region of the current CTB, the co-located region is the top right region of the previously reconstructed CTB; if the current region is the bottom left region of the current CTB, the co-located region is the bottom left region of the previously reconstructed CTB; If the current region is the lower right region of the current CTB, the co-located region is the lower right region of the previously reconstructed CTB; The method according to claim 4.

6. 4. A method according to any one of claims 1 to 3, wherein the current CTB includes four regions having the same size and shape, the previously reconstructed CTB includes four regions having the same size and shape, the current region is one of the four regions in the current CTB, and the co-located region is one of the four regions in the previously reconstructed CTB.

7. A method according to claim 1, wherein the size of the reference memory is 128 x 128 samples.

8. one or more memories storing instructions; a processing circuit coupled to the one or more memories; Including, The instructions, when executed by the processing circuit, cause the processing circuit to perform a method according to any one of claims 1 to 7. Device.

9. A computer program causing a computer to carry out the method according to any one of claims 1 to 7.

Images