METHODS FOR SIGNALING VIRTUAL BOUNDARIES AND WRAP-AROUND

MOTION COMPENSATION

CROSS-REFERENCE TO RELATED APPLICATIONS

[001 ] The present disclosure claims priority to US provisional application No. 62/954,828, filed on December 30, 2019, which is incorporated herein by reference in its entirety.

TECHNICAL FIELD

[002] lire present disclosure generally relates to video processing, and more particularly, to methods tor signaling virtual boundaries and wrap-around motion compensation ,

BACKGROUND

[003] A video is a set of static pictures (or “frames”) capturing the visual information. To reduce the storage memory and the transmission bandwidth, a video can be compressed before storage or transmission and decompressed before display. The compression process is usually referred to as encoding and the decompression process is usually referred to as decoding. There are various video coding formats which use standardized video coding technologies, most commonly based on prediction, transform, quantization, entropy coding and in-loop filtering. The video coding standards, such as the High Efficiency Video Coding (HEVC/H.265) standard, the Versatile Video Coding (VVC/H.266) standard, and A VS standards, specifying the specific video coding formats, are developed by standardization organizations. With more and more advanced video coding technologies being adopted in the video standards, the coding efficiency of the new video coding standards get higher and higher. SUMMARY OF THE DISCLOSURE

[004] The present disclosure provides methods for picture processing. The method can include: receiving a bitstream comprising a set of pictures; determining, according to the received bitstream, whether a virtual boundary is signaled at a sequence level for the set of pictures; in response to the virtual boundary being signaled at the sequence level, determining a position of the virtual boundary for the set of pictures, the position being bounded by a range signaled in the received bitstream; and disabling in-loop filtering operations across the virtual boundary.

[005] lire embodiments of tire present disclosure further provide an apparatus for picture processing. The apparatus can include a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the apparatus to perform: receiving a bitstream comprising a set of pictures; determining, according to the received bitstream, whether a virtual boundary is signaled at a sequence level for the set of pictures; in response to the virtual boundary/ being signaled at the sequence level, determining a position of the virtual boundary for the set of pictures, the position being bounded by a range signaled in the received bitstream: and disabling in-loop filtering operations across the virtual boundary/.

[006] The embodiments of the present disclosure further provide a non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer to cause the computer to perform a picture processing method, the method comprising: receiving a bitstream comprising a set of pictures; determining, according to the received bitstream, whether a virtual boundary ^/ is signaled at a sequence level for the set of pictures; in response to the virtual boundary being signaled at the sequence level, determining a position of the virtual boundary ^/ for the set of pictures, the position being bounded by a range signaled in the received bitstream; and disabling in-loop filtering operations across the virtual boundary.

BRIEF DESCRIPTION OF THE DRAWINGS

[007] Embodiments and various aspects of the present disclosure are illustrated in the following detailed description and the accompanying figures. Various features shown in the figures are not drawn to scale.

[008] FIG. 1 illustrates structures of an example video sequence, according to some embodiments of this disclosure.

[009] FIG. 2A illustrates a schematic diagram of an exemplary encoding process of a hybrid video coding system, consistent with some embodiments of the disclosure.

[010] FIG. 2B illustrates a schematic diagram of another exemplary encoding process of a hybrid video coding system, consistent with some embodiments of the disclosure .

[011] FIG. 3A illustrates a schematic diagram of an exemplary decoding process of a hybrid video coding system, consistent with some embodiments of the disclosure.

[012] FIG. 3B illustrates a schematic diagram of another exemplary decoding process of a hybrid video coding system, consistent with some embodiments of the disclosure.

[013] FIG. 4 illustrates a block diagram of an exemplar _} ' apparatus for encoding or decoding a video, consistent with some embodiments of the disclosure.

[014] FIG. 5 illustrates an exemplary sequence parameter set (SP8) syntax for signaling virtual boundary, consistent with some embodiments of the disclosure.

[015] FIG. 6 illustrates an exemplar}' picture header (PH) syntax for signaling virtual boundary, consistent with some embodiments of the disclosure. [016] FIG. 7A illustrates exemplary Horizontal wrap-around motion compensation for equirectangular projection (ERP), consistent with some embodiments of the disclosure,

[017] FIG. 7B illustrates exemplar}' Horizontal wrap around motion compensation tor padded ERP (PERP), consistent with some embodiments of the disclosure,

[018] FIG. 8 illustrates an exemplar} _' syntax for wrap-around motion compensation, consistent with some embodiments of the disclosure.

[019] FIG. 9 illustrates an exemplary SPS syntax for signaling maximum values of picture width and height, consistent with some embodiments of the disclosure.

[020] FIG. 10 illustrates an exemplary syntax for signaling wrap-around motion compensation, consistent with some embodiments of the disclosure.

[021] FIG. II illustrates an exemplary SPS syntax tor signaling virtual boundaries, consistent with some embodiments of the disclosure.

[022] FIG. 12 illustrates another exemplary SPS syntax for signaling virtual boundaries, consistent with some embodiments of the disclosure.

[023] FIG. 13 illustrates an exemplar}' SPS syntax for signaling wrap-around motion compensation, consistent with some embodiments of the disclosure.

[024] FIG. 14 illustrates another exemplar}' SPS syntax for signaling wrap-around motion compensation, consistent with some embodiments of the disclosure.

[025] FIG. 15 illustrates an exemplary' method for picture processing, consistent with some embodiments of the disclosure.

DETAILED DESCRIPTION

[026] Reference will now be made in detail to exemplary embodiments, examples of which are illustrated in the accompanying drawings. The following description refers to the accompanying drawings in which the same numbers in different drawings represent the same or similar elements unless otherwise represented. The implementations set forth in the following description of exemplar} _' embodiments do not represent all implementations consistent with the present disclosure. Instead, they are merely examples of apparatuses and methods consistent with aspects related to the present disclosure as recited in the appended claims. Particular aspects of the present disclosure are described in greater detail below'. The terms and definitions provided herein control, if in conflict with terms and/or definitions incorporated by reference.

[027] As stated above, video is frames arranged in a temporal sequence to store visual information. A video capture device (e.g., a camera) can be used to capture and store those pictures in a temporal sequence, and a video playback device (e.g,, a television, a computer, a smartphone, a tablet computer, a video play er, or any end-user terminal with a function of display) can he used to display such pictures in the temporal sequence. Also, in some applications, a video capturing device can transmit the captured video to the video playback device (e.g., a computer with a monitor) in real-time, such as for surveillance, conferencing, or live broadcasting.

[028] For reducing the storage space and the transmission bandwidth needed by such applications, the video can be compressed before storage and transmission and decompressed before the display. The compression and decompression can be implemented by software executed by a processor (e.g., a processor of a generic computer) or specialized hardware.

The module for compression is generally referred to as an “encoder,” and the module for decompression is generally referred to as a “decoder.” The encoder and decoder can be collectively referred to as a “codec.” The encoder and decoder can be implemented as any of a variety of suitable hardware, software, or a combination thereof. For example, the hardw are implementation of the encoder and decoder can include circuitry, such as one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), discrete logic, or any combinations thereof. The software implementation of the encoder and decoder can include program codes, computer-executable instructions, firmware, or any suitable computer-implemented algorithm or process fixed in a computer-readable medium. In some applications, the codec can decompress the video from a first coding standard and re-compress the decompressed video using a second coding standard, in which case the codec can be referred to as a “transcoder. ’

[029] The video encoding process can identify and keep useful information that can be used to reconstruct a picture and disregard unimportant information for the reconstruction, if the disregarded, unimportant information cannot be fully reconstructed, such an encoding process can be referred to as “lossy.” Otherwise, it can be referred to as “lossless.” Most encoding processes are lossy, which is a tradeoff to reduce the needed storage space and the transmission bandwidth.

[030] The useful information of a picture being encoded (referred to as a “current picture”) includes changes with respect to a reference picture (e.g., a picture previously encoded and reconstructed). Such changes can include position changes, luminosity changes, or color changes of the pixels, among which the position changes are mostly concerned. Position changes of a group of pixels that represent an object can reflect the motion of the object between the reference picture and the current picture.

[03 i] A picture coded without referencing another picture (i.e., it is its own reference picture) is referred to as an “[-picture, ” A picture coded using a previous picture as a reference picture is referred to as a “P-picture.” A picture coded using both a previous picture and a future picture as reference pictures (i.e., the reference is “bi-directional”) is referred to as a “B-picture.”

[032] In order to achieve the same subjective quality as 1 Si A C/H.265 using half the bandwidth, the JYET has been developing technologies beyond HE VC using the joint exploration model (JEM) reference software. As coding technologies were incorporated into the JEM. the JEM achieved substantially higher coding performance than HEVC.

[033] Hie VVC standard continues to include more coding technologies that provide better compression performance. VVC is based on the same hybrid video coding system that has been used in modem video compression standards such as HEVC, H.264/AVC, MPEG2, H.263, etc. in applications like 360-degree video, the layout for a specific projection fomiat usually has multiple faces. For example, MPEG-I part 2: omni-directional media fomiat (OMAF) standardizes Cube-map based projection format named CMP which has six faces. And for those projection fomiats including a plurality of faces, no mater what kind of compact frame packing arrangement is used, discontinuities appear between two or more adjacent faces in the frame packed picture, if in -loop filtering operations are performed across this discontinuity, face seam artifacts may become visible in the reconstructed video after rendering. To alleviate face seam artifacts, in-loop filtering operations have to be disabled across discontinuities in the frame-packed picture. A virtual boundary can be set as one of the coding tools for 360-degree video such that in-loop filtering can be disabled across the virtual boundary to prevent from artifacts,

[034] FIG. 1 illustrates structures of an example video sequence 100, according to some embodiments of this disclosure. Video sequence 100 can be a live video or a video having been captured and archived. Video 100 can be a real-life video, a computer-generated video (e.g., computer game video), or a combination thereof (e.g., a real-life video with augmented-reality effects). Video sequence 100 can be inputted from a video capture device (e.g., a camera), a video archive (e.g., a video file stored in a storage device) containing previously captured video, or a video feed interface (e.g., a video broadcast transceiver) to receive video from a video content provider. [035] As shown in FIG. 1, video sequence 100 can include a series of pictures arranged temporally along a timeline, including pictures 102, 104, 106, and 108. Pictures 102-106 are continuous, and there are more pictures between pictures 106 and 108. in FIG.

1, picture 102 is an ί-picture, the reference picture of which is picture 102 itself. Picture 104 is a P-picture, the reference picture of which is picture 102, as indicated by the arrow'. Picture 106 is a B-picture, the reference pictures of which are pictures 104 and 108, as indicated by the arrow's. In some embodiments, the reference picture of a picture (e.g., picture 104) can be not immediately preceding or following the picture. For example, the reference picture of picture 104 can be a picture preceding picture 102. It should he noted that the reference pictures of pictures 102-106 are only examples, and this disclosure does not limit embodiments of the reference pictures as the examples shown in FIG. 1.

[036] Typically, video codecs do not encode or decode an entire picture at one time due to the computing complexity of such tasks. Rather, they can split the picture into basic segments, and encode or decode the picture segment by segment. Such basic segments are referred to as basic processing units (“BPUs”) in this disclosure. For example, structure 110 in FIG. 1 shows an example structure of a picture of video sequence 100 (e.g., any of pictures 102-108). In structure 110, a picture is divided into 4*4 basic processing units, the boundaries of which are shown as dash lines, in some embodiments, the basic processing units can be referred to as “macroblocks” in some video coding standards (e.g., MPEG family, H.261, H.263, or H.264/AVC), or as “coding tree units” (“CTUs”) in some other video coding standards (e.g., H.265/HEVC or H.266/VVC). The basic processing units can have variable sizes in a picture, such as 128x128, 64x64, 32x32, 16x16, 4x8, 16x32, or any arbitrary* shape and size of pixels. The sizes and shapes of the basic processing units can be selected for a picture based on the balance of coding efficiency and levels of details to be kept in the basic processing unit. [037] The basic processing units can be logical units, which can include a group of different types of video data stored in a computer memory (e.g., m a video frame buffer). For example, a basic processing unit of a color picture can include a luma component (Y) representing achromatic brightness information, one or more chroma components (e.g,, Cb and Cr) representing color information, and associated syntax elements, in which the luma and chroma components can have the same size of the basic processing unit. The luma and chroma components can be referred to as “coding tree blocks” (“CTBs”) in some video coding standards (e.g., H.265/HEV C or H.266/WC). Any operation performed to a basic processing unit can be repeatedly performed to each of its luma and chroma components, [038] Video coding has multiple stages of operations, examples of which will be detailed in FIGs. 2A-2B and 3A-3B. For each stage, the size of the basic processing units can still be too large for processing, and thus can be further divided into segments referred to as “basic processing sub-units” in this disclosure. In some embodiments, the basic processing sub-units can be referred to as “blocks” in some video coding standards (e.g., MPEG family, H.261, H.263, orH.264/AVC), or as “coding units” (“CUs”) in some other video coding standards (e.g., H.265/HEVC orH.266/WC). A basic processing sub-unit can have the same or smaller size than the basic processing unit. Similar to the basic processing units, basic processing sub-units are also logical units, w hich can include a group of different types of video data (e.g., Y, Cb, Cr, and associated syntax elements) stored in a computer memory (e.g., in a video frame buffer). Any operation performed to a basic processing sub-unit can be repeatedly performed to each of its luma and chroma components, it should he noted that such division can be performed to further levels depending on processing needs. It should also be noted that different stages can divide the basic processing units using different schemes. [039] For example, at a mode decision stage (an example of which will be detailed in FIG, 2B), the encoder can decide what prediction mode (e.g., intra-picture prediction or inter-picture prediction) to use for a basic processing unit, which can be too large to make such a decision. The encoder can split the basic processing unit into multiple basic processing sub-units (e.g., CUs as in H.265/HEVC or H.266/WC), and decide a prediction type for each individual basic processing sub-unit.

[040] For another example, at a prediction stage (an example of which will be detailed in FIGs. 2A-2B), the encoder can perform prediction operation at the level of basic processing sub-units (e.g., CUs). However, in some cases, a basic processing sub-unit can still be too large to process. The encoder can further split the basic processing sub-unit into smaller segments (e.g., referred to as “prediction blocks’ ¹ or “PBs” in H.265/HEVC or H.266/VV C), at the level of which the prediction operation can be performed.

[041] For another example, at a transform stage (an example of which will be detailed in FIGs. 2A-2B), the encoder can perform a transform operation for residual basic processing sub-units (e.g., CUs). However, in some cases, a basic processing sub-unit can still he too large to process. The encoder can further split the basic processing sub-unit into smaller segments (e.g., referred to as “transform blocks” or “TBs” in H.265/HEVC or H.266/WC), at the level of which the transform operation can be performed, it should be noted that the division schem es of the same basic processing sub-unit can he different at the prediction stage and the transform stage. For example, in H.265/HEVC or H.266/VVC, the prediction blocks and transform blocks of the same CU can have different sizes and numbers.

[042] In structure 110 of FIG. 1, basic processing unit i 12 is further divided into 3x3 basic processing sub-units, the boundaries of which are shown as dotted lines. Different basic processing units of the same picture can be divided into basic processing sub-units in different schemes. [043] In some implementations, to provide the capability of parallel processing and error resilience to video encoding and decoding, a picture can be divided into regions for processing, such that, for a region of the picture, the encoding or decoding process can depend on no information from any other region of the picture. In other words, each region of the picture can be processed independently. By doing so, the codec can process different regions of a picture in parallel, thus increasing the coding efficiency. Also, when data of a region is corrupted in the processing or lost in network transmission, the codec can correctly encode or decode other regions of the same picture without reliance on the corrupted or lost data, thus providing the capability of error resilience. In some video coding standards, a picture can be divided into different types of regions. For example, H.265/HEVC and H.266/WC provide two types of regions: “slices” and “ ^' tiles.” it should also be noted that different pictures of video sequence 100 can have different partition schemes for dividing a picture into regions.

[044] For example, in FIG, I, structure 110 is divided into three regions 114, 116, and 118, the boundaries of which are shown as solid lines inside structure 110. Region 114 includes four basic processing units. Each of regions 116 and 118 includes six basic processing units. It should be noted that the basic processing units, basic processing subunits, and regions of structure 110 in FIG, 1 are only examples, and this disclosure does not limit embodiments thereof

[045] FIG. 2A illustrates a schematic diagram of an example encoding process 200 A, consistent with embodiments of the disclosure. For example, the encoding process 200A can be performed by an encoder. As shown in FIG. 2A, the encoder can encode video sequence 202 into video bitstream 228 according to process 200A. Similar to video sequence 100 in FIG. 1, video sequence 202 can include a set of pictures (referred to as “original pictures”) arranged in a temporal order. Similar to structure 110 in FIG. I, each original picture of video sequence 202 can be divided by the encoder into basic processing units, basic processing sub-units, or regions for processing. In some embodiments, the encoder can perform process 200A at the level of basic processing units for each original picture of video sequence 202. For example, the encoder can perform process 200A in an iterative manner, in which the encoder can encode a basic processing unit in one i teration of process 200A. In some embodiments, the encoder can perform process 200A in parallel for regions (e.g., regions 114-118) of each original picture of video sequence 202.

[046] In FIG. 2A, the encoder can feed a basic processing unit (referred to as an “original BPU”) of an original picture of video sequence 202. to prediction stage 204 to generate prediction data 206 and predicted BPU 208. The encoder can subtract predicted BPU 208 from the original BPU to generate residual BPU 210. The encoder can feed residual BPU 210 to transform stage 212 and quantization stage 214 to generate quantized transform coefficients 216. The encoder can feed prediction data 206 and quantized transform coefficients 216 to binary coding stage 226 to generate video bitstream 228. Components 202, 204, 206, 208, 210, 212, 214, 216, 226, and 228 can be referred to as a “forward path.” During process 200A, after quantization stage 214, the encoder can feed quantized transform coefficients 216 to inverse quantization stage 218 and inverse transform stage 220 to generate reconstructed residual BPU 222. The encoder can add reconstructed residual BPU 222 to predicted BPU 2.08 to generate prediction reference 224, which is used in prediction stage 204 for the next iteration of process 200A. Components 218, 220, 222, and 224 of process 200A can be referred to as a “reconstruction path.” The reconstruction path am be used to ensure that both the encoder and the decoder use the same reference data for prediction.

[047] The encoder can perform process 200A iteratively to encode each original BPU of the original picture (in the forward path) and generate predicted reference 224 for encoding the next original BPU of the original picture (in the reconstruction path). After encoding ail original BPUs of the original picture, the encoder can proceed to encode the next picture in video sequence 202,

[048] Referring to process 200A, the encoder can receive video sequence 202 generated by a video capturing device (e.g., a camera). The term “receive” used herein can refer to receiving, inputting, acquiring, retrieving, obtaining, reading, accessing, or any action in any manner for inputing data.

[049] At prediction stage 204, at a current iteration, the encoder can receive an original BPU and prediction reference 224, and perform a prediction operation to generate prediction data 206 and predicted BPU 208, Prediction reference 224 can be generated from the reconstruction path of the previous iteration of process 200A. lire purpose of prediction stage 204 is to reduce information redundancy by extracting prediction data 206 that can be used to reconstruct the original BPU as predicted BPU 2.08 from prediction data 2.06 and prediction reference 224.

[050] Ideally, predicted BPU 208 can be identical to the original BPU, However, due to non-ideal prediction and reconstruction operations, predicted BPU 208 is generally slightly different from the original BPU. For recording such differences, after generating predicted BPU 208, the encoder can subtract it from the original BPU to generate residual BPU 210. For example, the encoder can subtract values (e.g., greyscale values or RGB values) of pixels of predicted BPU 208 from values of corresponding pixels of the original BPU. Each pixel of residual BPU 210 can have a residual value as a result of such subtraction between the corresponding pixels of the original BPU and predicted BPU 208. Compared with the original BPU, prediction data 206 and residual BPU 210 can have fewer bits, but they can be used to reconstruct the original BPU without significant quality deterioration. Thus, the original BPU is compressed. [051] To further compress residual BPU 210, at transform stage 212, the encoder can reduce spatial redundancy of residual BPU 210 by decomposing it into a set of two- dimensional ‘"base paterns,” each base patern being associated with a “transform coefficient.” The base patterns can have the same size (e.g., the size of residual BPU 210). Each base pattern can represent a variation frequency (e.g., frequency of brightness variation) component of residual BPU 210. None of the base patterns can be reproduced from any combinations (e.g., linear combinations) of any other base patterns, in other w ords, the decomposition can decompose variations of residual BPU 210 into a frequency domain. Such a decomposition is analogous to a discrete Fourier transform of a function, in which the base patterns are analogous to the base functions (e.g., trigonometry functions) of the discrete Fourier transform, and the transform coefficients are analogous to the coefficients associated with the base functions.

[052] Different transform algorithms can use different base patterns. Various transform algorithms can be used at transform stage 212, such as, for example, a discrete cosine transform, a discrete sine transform, or the like. The transform at transform stage 212 is invertible. That is, the encoder can restore residual BPU 210 by an inverse operation of the transform (referred to as an “inverse transform”). For example, to restore a pixel of residual BPU 210, the inverse transform can be multiplying values of corresponding pixels of the base paterns by respective associated coefficients and adding the products to produce a weighted sum. For a video coding standard, both tire encoder and decoder can use the same transform algorithm (thus the same base paterns). Thus, the encoder can record only the transform coefficients, from which the decoder can reconstruct residual BPU 210 without receiving the base paterns from the encoder. Compared with residual BPU 210, the transform coefficients am have fewer bits, but they can be used to reconstruct residual BPU 210 without significant quality deterioration. Thus, residual BPU 210 is further compressed. [053] The encoder can further compress the transform coefficients at quantization stage 214. In the transform process, different base patterns can represent different variation frequencies (e.g., brightness variation frequencies). Because human eyes are generally better at recognizing low-frequency variation, the encoder can disregard information of high- frequency variation without causing significant quality deterioration in decoding. For example, at quantization stage 214, the encoder can generate quantized transform coefficients 216 by dividing each transform coefficient by an integer value (referred to as a “quantization parameter”) and rounding the quotient to its nearest integer. After such an operation, some transform coefficients of the high-frequency base patterns can be converted to zero, and the transform coefficients of the low-frequency base patterns can be converted to smaller integers. The encoder can disregard the zero-value quantized transform coefficients 216, by which the transform coefficients are further compressed. The quantization process is also invertible, in which quantized transform coefficients 216 can be reconstructed to tire transform coefficients in an inverse operation of the quantization (referred to as "‘inverse quantization”).

[054] Because the encoder disregards the remainders of such divisions in the rounding operation, quantization stage 214 can be lossy. Typically, quantization stage 214 can contribute the most information loss in process 200A. The larger the information loss is, the fewer bits the quantized transform coefficients 216 can need. For obtaining different levels of information loss, the encoder can use different values of the quantization parameter or any other parameter of the quantization process.

[055] At binary coding stage 226, the encoder can encode prediction data 206 and quantized transform coefficients 216 using a biliary coding technique, such as, for example, entropy coding, variable length coding, arithmetic coding, Huffman coding, context-adaptive binary' arithmetic coding, or any other lossless or lossy compression algorithm. In some embodiments, besides prediction data 206 and quantized transform coefficients 216, the encoder can encode other information at binary coding stage 2.26, such as, for example, a prediction mode used at prediction stage 204, parameters of the prediction operation, a transform type at transform stage 212, parameters of the quantization process (e.g., quantization parameters), an encoder control parameter (e.g., a bitrate control parameter), or the like. The encoder can use the output data of binary' coding stage 226 to generate video bitstream 228. in some embodiments, video bitstream 228 can be further packetized for network transmission.

[056] Referring to the reconstruction path of process 200A, at inverse quantization stage 218, the encoder can perform inverse quantization on quantized transform coefficients 216 to generate reconstructed transform coefficients. At inverse transform stage 220, the encoder can generate reconstructed residual BPU 222 based on the reconstructed transform coefficients, lire encoder can add reconstructed residual BPU 222 to predicted BPU 208 to generate prediction reference 224 that is to be used in the next iteration of process 200A.

[057] It should be noted that other variations of the process 200A can be used to encode video sequence 202. In some embodiments, stages of process 200A can be performed by the encoder in different orders. In some embodiments, one or more stages of process 2.00A can be combined into a single stage. In some embodiments, a single stage of process 200A can be divided into multiple stages. For example, transform stage 212 and quantization stage 214 can be combined into a single stage. In some embodiments, process 200A can include additional stages, in some embodiments, process 200 A can omit one or more stages in FIG, 2A.

[058] FIG. 2B illustrates a schematic diagram of another example encoding process 200B, consistent with embodiments of the disclosure. Process 200B can be modified from process 200A. For example, process 200B can be used by an encoder conforming to a hybrid video coding standard (e.g., H.26x series). Compared with process 200A, the forward path of process 200B additionally includes mode decision stage 230 and divides prediction stage 2.04 into spatial prediction stage 2042 and temporal prediction stage 2044. The reconstruction path of process 200B additionally includes loop filter stage 232 and buffer 234.

[059] Generally, prediction techniques can be categorized into two types: spatial prediction and temporal prediction. Spatial prediction (e.g., an intra-picture prediction or “intra prediction”) can use pixels from one or more already coded neighboring BPUs in the same picture to predict the current BPU. That is, prediction reference 224 in the spatial prediction can include the neighboring BPUs. The spatial prediction can reduce the inherent spatial redundancy of the picture. Temporal prediction (e.g., an inter-picture prediction or ‘inter prediction”) can use regions from one or more already coded pictures to predict the current BPU, That is, prediction reference 224 in the temporal prediction can include the coded pictures. The temporal prediction can reduce the inherent temporal redundancy of the pictures.

[060] Referring to process 200B, in the forward path, the encoder performs the prediction operation at spatial prediction stage 2042 and temporal prediction stage 2044. For example, at spatial prediction stage 2042, the encoder can perform the intra prediction. For an original BPU of a picture being encoded, predic tion reference 224 can include one or more neighboring BPUs that have been encoded (in the forward path) and reconstructed (in the reconstructed path) in the same picture. Hie encoder can generate predicted BPU 208 by extrapolating the neighboring BPUs. The extrapolation technique can include, for example, a linear extrapolation or interpolation, a polynomial extrapolation or interpolation, or the like.

In some embodiments, the encoder can perform the extrapolation at the pixel level, such as by extrapolating values of corresponding pixels for each pixel of predicted BPU 208. The neighboring BPUs used for extrapolation can be located with respect to the original BPU from various directions, such as in a vertical direction (e.g., on top of the original BPU), a horizontal direction (e.g,, to the left of the original BPU), a diagonal direction (e.g,, to the down-left, down-right, up-left, or up-right of the original BPU), or any direction defined in the used video coding standard. For the into prediction, prediction data 206 can include, tor example, locations (e.g., coordinates) of the used neighboring BPUs, sizes of the used neighboring BPUs, parameters of the extrapolation, a direction of the used neighboring BPUs with respect to the original BPU, or the like.

[061] For another example, at temporal prediction stage 2044, the encoder can perform the inter prediction. For an original BPU of a current picture, prediction reference 224 can include one or more pictures (referred to as “reference pictures”) that have been encoded (in the forward path) and reconstructed (in the reconstructed path), in some embodiments, a reference picture can be encoded and reconstructed BPU by BPU. For example, the encoder can add reconstructed residual BPU 222 to predicted BPU 208 to generate a reconstructed BPU. When all reconstructed BPUs of the same picture are generated, the encoder can generate a reconstructed picture as a reference picture. The encoder can perform an operation of “motion estimation” to search for a matching region in a scope (referred to as a “search window”) of the reference picture. The location of the search window in the reference picture can be determined based on the location of the original BPU m the current picture. For example, the search window can be centered at a location having the same coordinates in the reference picture as the original BPU in the current picture and can be extended out for a predetermined distance. When the encoder identifies (e.g., by using a pel-recursive algorithm, a block-matching algorithm, or the like) a region similar to the original BPU in the search window, the encoder can determine such a region as the matching region. The matching region can have different dimensions (e.g., being smaller than, equal to, larger than, or in a different shape) from the original BPU. Because the reference picture and the current picture are temporally separated in the timeline (e.g., as shown in FIG, I), it can he deemed that the matching region “moves” to the location of the original BPU as time goes by. The encoder can record the direction and distance of such a motion as a “motion vector.” When multiple reference pictures are used (e.g., as picture 106 in FIG. 1), the encoder can search for a matching region and determine its associated motion vector for each reference picture. In some embodiments, the encoder can assign weights to pixel values of the matching regions of respective matching reference pictures.

[062] The motion estimation can be used to identify various types of motions, such as, for example, translations, rotations, zooming, or the like. For inter prediction, prediction data 206 can include, for example, locations (e.g., coordinates) of the matching region, the motion vec tors associated with the matching region, the number of reference pictures, weights associated with the reference pictures, or the like.

[063] For generating predicted BPU 208, the encoder can perform an operation of “ ^' motion compensation.” The motion compensation can be used to reconstruct predicted BPU 208 based on prediction data 206 (e.g., the motion vector) and prediction reference 224. For example, the encoder can move the matching region of the reference picture according to the motion vector, in which the encoder can predict the original BPU of the current picture.

When multiple reference pictures are used (e.g., as picture 106 in FIG. 1), the encoder can move the matching regions of the reference pictures according to the respective motion vectors and average pixel values of the matching regions. In some embodiments, if the encoder has assigned weights to pixel values of the matching regions of respective matching reference pictures, the encoder can add a weighted sum of the pixel values of the moved matching regions.

[064] in some embodiments, the inter prediction can be unidirectional or bidirectional. Unidirectional inter predictions can use one or more reference pictures in the same temporal direction with respect to the current picture. For example, picture 104 in FIG. 1 is a unidirectional inter-predicted picture, in which the reference picture (i.e., picture 102) precedes picture 104. Bidirectional inter predictions can use one or more reference pictures at both temporal directions with respect to the current picture. For example, picture 106 in FIG. l is a bidirectional inter-predicted picture, in which the reference pictures (i.e., pictures 104 and 108) are at both temporal directions with respect to picture 104.

[065] Still referring to the forward path of process 200B, after spatial prediction 2042 and temporal prediction stage 2044, at mode decision stage 230, the encoder can select a prediction mode (e.g., one of the intra prediction or the inter prediction) for the current iteration of process 200B. For example, the encoder can perform a rate-distortion optimization technique, in which the encoder can select a prediction mode to minimize a value of a cost function depending on a bit rate of a candidate prediction mode and distortion of the reconstructed reference picture under the candidate prediction mode. Depending on the selected prediction mode, the encoder can generate the corresponding predicted BPU 208 and predicted data, 206.

[066] In the reconstruction path of process 200B, if intra prediction mode has been selected in the forward path, after generating prediction reference 224 (e.g., the current BPU that has been encoded and reconstructed in the current picture), the encoder can directly feed prediction reference 224 to spatial prediction stage 2042 for later usage (e.g., for extrapolation of a next BPU of the current picture), if tire inter prediction mode has been selected in the forward path, after generating prediction reference 224 (e.g., the current picture in which all BPUs have been encoded and reconstructed), the encoder can feed prediction reference 224 to loop filter stage 232, at which the encoder can apply a loop filter to prediction reference 224 to reduce or eliminate distortion (e.g., blocking artifacts) introduced by the inter prediction. The encoder can apply various loop filter techniques at loop filter stage 232, such as, for example, deblocking, sample adaptive offsets, adaptive loop filters, or the like. The loop-filtered reference picture can be stored in buffer 234 (or “decoded picture buffer”) for later use (e.g., to be used as an inter-prediction reference picture for a future picture of video sequence 202). Hie encoder can store one or more reference pictures in buffer 234 to be used at temporal prediction stage 2044. In some embodiments, the encoder can encode parameters of the loop filter (e.g., a loop filter strength) at binary coding stage 226, along with quantized transform coefficients 216, prediction data 206, and other information.

[067] FIG. 3A illustrates a schematic diagram of an example decoding process 300A, consistent with embodiments of the disclosure. Process 300A can be a decompression process corresponding to the compression process 200A in FIG. 2A. In some embodiments, process 300 A can be similar to the reconstruction path of process 200A. A decoder can decode video bitstream 228 into video stream 304 according to process 300A. Video stream 304 can be very similar to video sequence 202. However, due to the information loss in the compression and decompression process (e.g., quantization stage 214 in FIGs. 2A-2B), generally, video stream 304 is not identical to video sequence 202. Similar to processes 200A and 200B in FIGs. 2A-2B, the decoder can perform process 300A at the level of basic processing units (BPUs) tor each picture encoded in video bitstream 228. For example, the decoder can perform process 300A in an iterative manner, in which the decoder can decode a basic processing unit in one iteration of process 300A. In some embodiments, the decoder can perform process 300A in parallel for regions (e.g., regions 114-118) of each picture encoded in video bitstream 228.

[068] In FIG. 3A, the decoder can feed a portion of video bitstream 2.28 associated with a basic processing unit (referred to as an “encoded BPU”) of an encoded picture to binary' decoding stage 302. At binary' decoding stage 302, the decoder can decode the portion into prediction data 206 and quantized transform coefficients 216. The decoder can feed quantized transform coefficients 216 to inverse quantization stage 218 and inverse transform stage 220 to generate reconstructed residual BPU 222. The decoder can feed prediction data 206 to prediction stage 204 to generate predicted BPU 208. The decoder can add reconstructed residual BPU 222 to predicted BPU 208 to generate predicted reference 224. In some embodiments, predicted reference 224 can be stored in a buffer (e.g., a decoded picture buffer in a computer memory). The decoder can feed predicted reference 224 to prediction stage 204 for performing a prediction operation in the next iteration of process 300A.

[069] The decoder can perform process 300A iteratively to decode each encoded BPU of the encoded picture and generate predicted reference 224 for encoding the next encoded BPU of the encoded picture. After decoding all encoded BPUs of the encoded picture, the decoder can output the picture to video stream 304 for display and proceed to decode the next encoded picture in video bitstream 228.

[070] At binary decoding stage 302, the decoder can perform an inverse operation of the binary coding technique used by the encoder (e.g., entropy coding, variable length coding, arithmetic coding, Huffman coding, context-adaptive binary ⁷ arithmetic coding, or any other lossless compression algorithm). In some embodiments, besides prediction data 206 and quantized transform coefficients 216, the decoder can decode other information at binary decoding stage 302, such as, for example, a prediction mode, parameters of the prediction operation, a transform type, parameters of the quantization process (e.g., quantization parameters), an encoder control parameter (e.g., a bitrate control parameter), or the like. In some embodiments, if video bitstream 228 is transmitted over a network in packets, the decoder can depacketize video bitstream 228 before feeding it to binary ⁷ decoding stage 302,

[071] FIG, 3 El illustrates a schematic diagram of another example decoding process 300B, consistent with embodiments of the disclosure. Process 300B can be modified from process 300A. For example, process 300B can be used by a decoder conforming to a hybrid video coding standard (e.g., H.26x series). Compared with process 300A. process 300B additionally divides prediction stage 204 into spatial prediction stage 2042 and temporal prediction stage 2044, and additionally includes loop filter stage 232 and buffer 234.

[072] in process 300B, for an encoded basic processing unit (referred to as a ^' ‘current BPU”) of an encoded picture (referred to as a “current picture”) that is being decoded, prediction data 206 decoded from binary decoding stage 302 by the decoder can include various types of data, depending on what prediction mode was used to encode the current BPU by the encoder. For example, if intra prediction was used by the encoder to encode the current BPU, prediction data 206 can include a prediction mode indicator (e.g., a flag value) indicative of the intra prediction, parameters of the intra prediction operation, or the like. The parameters of the intra prediction operation can include, for example, locations (e.g., coordinates) of one or more neighboring BPUs used as a reference, sizes of the neighboring BPUs, parameters of extrapolation, a direction of the neighboring BPUs with respect to the original BPU, or the like. For another example, if inter prediction was used by the encoder to encode the current BPU, prediction data 206 can include a prediction mode indicator (e.g., a flag value) indicative of the inter prediction, parameters of the inter prediction operation, or the like. The parameters of the inter prediction operation can include, for example, the number of reference pictures associated with the current BPU, weights respectively associated with the reference pictures, locations (e.g., coordinates) of one or more matching regions in the respective reference pictures, one or more motion vectors respectively associated with the matching regions, or the like.

[073] Based on the prediction mode indicator, the decoder can decide whether to perform a spatial prediction (e.g., the intra prediction) at spatial prediction stage 2042 or a temporal prediction (e.g., the inter prediction) at temporal prediction stage 2044. The details of performing such spatial prediction or temporal prediction are described in FIG. 2B and will not be repeated hereinafter. After performing such spatial prediction or temporal prediction, the decoder can generate predicted BPU 208. The decoder can add predicted BPU 208 and reconstructed residual BPU 222 to generate prediction reference 224, as described in FIG. 3A.

[074] In process 300B, the decoder can feed predicted reference 224 to spatial prediction stage 2042 or temporal prediction stage 2044 for performing a prediction operation in the next iteration of process 300B. For example, if the current BPU is decoded using the intra prediction at spatial prediction stage 2042, after generating prediction reference 224 (e.g., the decoded current BPU), the decoder can directly feed prediction reference 224 to spatial prediction stage 2042 tor later usage (e.g., for extrapolation of a next BPU of the current picture). If the current BPU is decoded using the inter prediction at temporal prediction stage 2044, after generating prediction reference 224 (e.g., a reference picture in which all BPUs have been decoded), the encoder can feed prediction reference 224 to loop filter stage 232 to reduce or eliminate distortion (e.g., blocking artifacts). The decoder can apply a loop filter to prediction reference 224, in a way as described in FIG. 2B. The loop- filtered reference picture can be stored in buffer 234 (e.g., a decoded picture buffer in a computer memory) for later use (e.g., to be used as an inter-prediction reference picture for a future encoded picture of video bitstream 228). The decoder can store one or more reference pictures in buffer 234 to be used at temporal prediction stage 2044. In some embodiments, when the prediction mode indicator of prediction data 206 indicates that inter prediction was used to encode the current BPU, prediction data can further include parameters of the loop filter (e.g,, a loop filter strength).

[075] FIG. 4 is a block diagram of an example apparatus 400 for encoding or decoding a video, consistent with embodiments of the disclosure. As shown in FIG. 4, apparatus 400 can include processor 402. When processor 402 executes instructions described herein, apparatus 400 can become a specialized machine for video encoding or decoding. Processor 402 can be any type of circuitry capable of manipulating or processing information. For example, processor 402 can include any combination of any number of a central processing unit (or '‘CPU”), a graphics processing unit (or “GPU”), a neural processing unit (“NPU”), a microcontroller unit (“MCU”), an optical processor, a programmable logic controller, a microcontroller, a microprocessor, a digital signal processor, an intellectual property (IP) core, a Programmable Logic Array (PLA), a Programmable Array Logic (PAL), a Generic Array Logic (GAL), a Complex Programmable Logic De vice (CPLD), a Field-Programmable Gate Array (FPGA), a System On Chip (SoC), an Application- Specific Integrated Circuit (ASIC), or the like. In some embodiments, processor 402 can also be a set of processors grouped as a single logical component. For example, as shown in FIG. 4, processor 402 can include multiple processors, including processor 402a, processor 402b, and processor 402n.

[076] Apparatus 400 can also include memory 404 configured to store data (e.g., a set of instructions, computer codes, intermediate data, or the like). For example, as shown in FIG. 4, the stored data can include program instructions (e.g., program instructions for implementing the stages in processes 200A, 200B, 300A, or 300B) and data for processing (e.g,, video sequence 202, video bitstream 228, or video stream 304). Processor 402 can access the program instructions and data for processing (e.g., via bus 410), and execute the program instructions to perform an operation or manipulation on the data for processing. Memory _' 404 can include a high-speed random-access storage device or a non-volatile storage device. In some embodiments, memory' 404 can include any combination of any number of a random-access memory (RAM), a read-only memory (ROM), an optical disc, a magnetic disk, a hard drive, a solid-state drive, a flash drive, a security digital (8D) card, a memory stick, a compact flash (CF) card, or the like. Memory 404 can also be a group of memories (not shown in FIG, 4) grouped as a single logical component.

[077] Bus 410 can be a communication device that transfers data between components inside apparatus 400, such as an internal bus (e.g., a CPU-memory bus), an external bus (e.g., a universal serial bus port, a peripheral component interconnect express port), or the like.

[078] For ease of explanation without causing ambiguity, processor 402 and other data processing circuits are collectively referred to as a “data, processing circuit” in this disclosure. The data processing circuit can be implemented entirely as hardware, or as a combination of software, hardware, or firmware. In addition, the data processing circuit can be a single independent module or can be combined entirely or partially into any other component of apparatus 400.

[079] Apparatus 400 can further include network interface 406 to provide wired or wireless communication with a network (e.g., the Internet, an intranet, a local area network, a mobile communications network, or the like), in some embodiments, network interface 406 can include any combination of any number of a network interface controller (NIC), a radio frequency (RF) module, a transponder, a transceiver, a modem, a router, a gateway, a wired network adapter, a wireless network adapter, a Bluetooth adapter, an infrared adapter, an near-field communication (“NFC”) adapter, a cellular network chip, or the like.

[080] in some embodiments, optionally, apparatus 400 can further include peripheral interface 408 to provide a connection to one or more peripheral devices. As shown in FIG. 4A, the peripheral device can include, but is not limited to, a cursor control device (e.g., a mouse, a touchpad, or a touchscreen), a keyboard, a display (e.g., a cathode-ray tube display, a liquid crystal display, or a light-emitting diode display), a video input device (e.g., a camera or an input interface coupled to a video archive), or the like. [081] It should be noted that video codecs (e.g., a codec performing process 200A, 200B, 300A, or 300B) can be implemented as any combination of any software or hardware modules in apparatus 400. For example, some or all stages of process 200A, 200B, 300A, or 300B can be implemented as one or more software modules of apparatus 400, such as program instructions that can be loaded into memory 404. For another example, some or all stages of process 200A, 200B, 300A, or 300B can be implemented as one or more hardware modules of apparatus 400, such as a specialized data processing circuit (e.g., an FPGA, an ASIC, an NPU, or the like).

[082] According to the disclosed embodiments, several coding tools can be used to code 360-degree video or gradual decoding refresh (GDR). Virtual boundary is one of these coding tools. In applications like 360-degree video, the layout for a specific projection format usually has multiple faces. For example, MPEG-I part 2: omni-directional media format (OMAF) standardizes Cube-map based projection format named CMP which has six faces. And for those projection formats including a plurality of faces, no matter what kind of compact frame packing arrangement is used, discontinuities appear between two or more adjacent faces in the frame packed picture. If in-loop filtering operations are performed across this discontinuity, face seam artifacts may become visible in the reconstructed video after rendering. To alleviate face seam artifacts, in-loop filtering operations have to be disabled across discontinuities m the frame-packed picture. Tims, consistent with the disclosed embodiments, a concept called virtual boundary can be used across which the loop filtering operation is disabled. An encoder may set the discontinued boundary as a virtual boundary', and thus no loop filter can be applied on the discontinued boundary'. Hie position of the virtual boundary is signaled in the bitstream, and the encoder may change the virtual boundary position according to the current projection format. [083] Other than the 360-degree video, the virtual boundary may also be used for gradual decoding refresh (GDR), which is mainly used in the very-low-deiay application. In the very-low-deiay application, inserting an intra coded picture as a random access point picture may cause unacceptable transmission latency due to the big size of the intra coded picture. To reduce the latency, GDR is adopted in which the pictures are refreshed progressively by inserting intra-coded regions in B/P-pictures. To prevent error propagation, the pixels in refreshed region in a picture cannot refer to the those in the un-refreshed region of the current picture or reference picture. Therefore, the loop filtering cannot be applied across the boundary of refreshed region and un-freshed region. With the above virtual boundary scheme, the encoder may set the boundary of refreshed region and un-refreshed region as a virtual boundary, and then no loop filtering operation can be applied across this boundary'.

[084] According to some embodiments, the virtual boundary can be signaled in a Sequence Parameter Set (SPS) or a Picture Header (PH). The Picture Header conveys information for a particular picture and contains information that is common to all slices that belong to the same picture. The PH can contain information related to virtual boundaries. One PH is set for each picture. The Sequence Parameter Set contains syntax dements pertaining to a coded layer video sequence (CLVS). The SPS contains sequence-level information shared by all pictures in an entire coded layer video sequence (CLVS) and can provide a big picture of what a bitstream contains and how the information in the bitstream can be used, in SPS, a virtual boundary present flag “sps virtual boundaries present flag” is signaled first. If the flag is true, then a number of virtual boundaries and the position of each virtual boundary are signaled for pictures referring to the SPS. If

‘ ^‘ sps virtual boundaries present flag” is false, then in PH, another virtual boundary present flag “ph_wrtual_boundaries_present_flag” can be signaled. Similarly, if “ph jvirtml Jxxmdariesjresentj!ag” is true, the number of virtual boundaries and the position of each virtual boundary can be signaled for the picture associated with the PH.

[085] The SPS syntax of virtual boundary is shown in Table 1 of FIG. 5. Semantics of the SPS syntax in FIG. 5 are given as below.

[086] “sps_virtual_boundaries_present_flag” equal to I specifies that information of virtual boundaries is signalled in the SPS. “sps virtual boundaries present flag” equal to 0 specifies that information of virtual boundaries is not signalled in the SPS. When there are one or more virtual boundaries signalled in the SPS, the in-loop filtering operations are disabled across the virtual boundaries in pictures referring to the SPS. In-loop filtering operations include the deblocking filter, sample adaptive offset filter, and adaptive loop filter operations.

[087] “sps_num_ver_virtaaI_boundaries” specifies the number of ^' ‘sps virtual boundaries pos x[i]” syntax elements that are present in tire SPS. When “sps num yer virtual boundaries” is not present, it is inferred to be equal to 0.

[088] “sps_virtual_boundariesjpos_x[i] ^,! specifies the location of the i-th vertical virtual boundary' in units of luma samples divided by 8, The value of “sps virtual boundaries pos x[ij” is m the range of I to Ceil( pic _.. width in luma samples-:- 8 ) - 1, inclusive.

[089] “sps_num_hor_virtual_boundaries” specifies the number of “sps virtual boundaries pos y[i]” syntax elements that are present in tire SPS. When “sps num hor virtual boundaries” is not present, it is inferred to be equal to 0.

[090] “sps_virtual_boundariesjpos_y[i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. The value of “sps virtual boundaries pos yji]” is in the range of 1 to Ceilt pic_height_in_luma_samples ÷ 8 ) - f inclusive. [091] PH syntax of virtual boundary is shown m Table 2 of FIG. 6. The semantics of PH syntax in FIG. 6 are given below.

[092] “ph mini ver virtual boundaries” specifies the number of “ph virtual boundaries pos x[if’ syntax elements that are present in the PH. When “ph_num_ver_virtual_boundaries” is not present, it is inferred to be equal to 0.

[093] The parameter VirtuaiBoundariesMumV er is derived as follows:

YirtualBoundariesNumVer ^:::: sps virtual boundaries present flag ? sps_num_ver_virtual_boundaries : ph_num_ver_virtual_boundaries

[094] “ph_virtua3_boundaries_pos_x[i]” specifies the location of the i-th vertical virtual boundary in units of luma samples divided by 8. The value of ‘ ^‘ ph virtual boundaries pos x[i]” is in the range of 1 to Cei!{ pic_widtb_in_luma_samp3es ÷ 8 } - 1. inclusive.

[095] The location of the vertical virtual boundary ^' ‘ViitualBoundariesPosX[i]” in units of luma samples is derived as follows:

VirtualBounda,riesPosX[ i ] = ( sps_virtual_boundaries_present_flag ? sps_virtual_boundaries_pos_x[ i ] : ph_virtuai_boundaries_pos_x[ i ] ) * 8

[096] lire distance between any two vertical virtual boundaries may be greater than or equal to CtbSizeY luma samples.

[097] “ph_num_hor_virtual_boundaries” specifies the number of ^' ‘ph virtual boundaries pos y[i |” syntax elements that are present in the PH. When “ph iiuin hor virtual boundaries ⁵ ’ is not present, it is inferred to be equal to 0.

[098] The parameter VirtualBoundariesNumHor is derived as follows:

VirtualBoundariesNumHor = sps_virtual_boundaries_present_flag ? sps num hor virtual boundaries : ph num hor virtual boundaries. [099] “pli_virtual_boundaries_pos_3 _' [i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. The value of “ph virtual boundaries j30s v[i]” is in the range of 1 to Ceil( pic height in luma samples ÷ 8 ) --- 1, inclusive.

[100] The location of the horizontal virtual boundary' “VirtualBoundariesPosYfi]” in units of luma samples is derived as follows:

VirtualBoundariesPosY[ i ] = ( sps virtual boundaries present flag ? sps_virhral_boundariesjpos_y[ i ] : ph_virtual_boundaries_pos_y[ i ] ) * 8.

[ 101 ] The distance between any two horizontal virtual boundaries may be greater than or equal to CtbSizeY luma samples.

[102] Wrap-around motion compensation is another 360-degree video coding tool.

In the conventional motion compensation, when a motion vector refers to samples beyond the picture boundaries of the reference picture, repetiti ve padding is applied to deri ve the values of the out-of-bounds samples by copying from those nearest neighbors on the corresponding picture boundary. For the 360-degree video, this method of repetitive padding is not sui table, and could cause visual artefacts called "‘seam artefacts” in a reconstructed viewport video. Because a 360-degree video is captured on a sphere and inherently has no “boundary,” the reference samples that are out of the boundaries of a reference picture in the projected domain can always be obtained from neighboring samples in the spherical domain. For a general projection format, it may be difficult to derive the corresponding neighboring samples in the spherical domain, because it involves 2D-to-3D and 3D-to-2D coordinate conversion, as well as sample interpolation for fractional sample positions. This problem is much simpler for the left and right boundari es of the equirectangular projection (ERP) or padded ERP (PERP) format, as the spherical neighbors outside of the left picture boundary- can be obtained from samples inside the right picture boundary _' , and vice versa. Given the wide usage of the ERP or PERP projection format and the relative ease of implementation, the horizontal wrap-around motion compensation can be used to improve the visual quality of 360-video coded m the ERP projection format.

[103] The horizontal wrap-around motion compensation process is depicted in FIG. 7A. When a part of the reference block is outside of the reference picture's left (or right) boundary in the projected domain, instead of repetiti ve padding, the “out-of-boundary” part is taken from the corresponding spherical neighbors that are located within the reference picture toward the right (or left) boundary in the projected domain. Repetitive padding is only used for the top and bottom picture boundaries. As depicted in FIG. 7B, the horizontal wraparound motion compensation can be combined with the non-normative padding method often used in 360-degree video coding. This can be achieved by signaling a high level syntax element to indicate the wrap-around offset, which should be set to the ERP picture width before padding. This syntax is used to adjust the position of horizontal wrap-around accordingly. This syntax is not affected by the specific amount of padding on the left and right picture boundaries, and therefore naturally supports asymmetric padding of the ERP picture (i.e., when left and right paddings are different). The horizontal wrap-around motion compensation provides more meaningful information for motion compensation when the reference samples are outside of the reference picture’s left and right boundaries. This tool improves compression performance not only in terms of rate-distortion performance, but also in terms of reduced seam artefacts and improved subjective quality of the reconstructed 360- degree video. Tiie horizontal wrap-around motion compensation can also be used for other single face projection formats with constant sampling density in the horizontal direction, such as ad _j usted equal-area pro _j ection.

[104] According to some embodiments, wrap-around motion compensation is signaled in SPS. First, an enabling flag is signaled, if it is true, then wrap-around offset is signaled. The SPS syntax is shown in FIG. 8 and the corresponding semantics are given below.

[105] “sps ref wraparound enabled flag” equal to 1 specifies that horizontal wraparound motion compensation is applied in inter prediction.

“sps_ref_wraparound_enabied_flag” equal to 0 specifies that horizontal wrap-around motion compensation is not applied. When the value of ( CtbSize Y/MinCbSizeY + 1 ) is larger than (pic width in luma samples/MinCbSizeY- l), where “pic width in luma samples” is the value of “pic_width_in_luma_samples” in any picture parameter set (PPS) that refers to the SPS, the value of “sps_ref_wraparoijnd_enabled_flag” is equal to 0.

[106] “sps ref wraparound offset minus 1” plus 1 specifies the offset used for computing the horizontal wrap-around position in units of MinCbSizeY luma samples. The value of “ref_wraparound_offset_minus 1 ” is in the range of (CtbSizeY/MinCbSizeY)+l to (pic width in luma samples/MinCbSizeY}- 1 , inclusive, where

“pic width in luma samples” is the value of “pic width in luma samples” in any PPS that refers to the SPS .

[107] CtbSizeY is the luma size of coding tree block (CTB), MinCbSizeY is the mm size of luma coding block, and “pic width in luma samples” is the picture width in luma samples.

[108] According to some embodiments, the maximum values of width and height of all the pictures within a picture sequence is signaled in SPS and then in each PPS, the picture width and height are signaled for the current picture. The syntax for signaling maximum values of picture width and height is shown in Table 4 of FIG. 9 and the syntax for signaling the picture width and height is shown in Table 5 of FIG. 10. The semantics corresponding to FIGs, 9 and 10 are given below. [109] “ref_pic_resatnplmg_enabled_flag” equal to I specifies that reference picture resampling may be applied when decoding coded pictures in the coded layer video sequences (CLVSs) referring to the SPS. ref pic resampling enabled flag equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS. For example, a decoding program can decode each of the frames. If the decoding program determines a resolution of a current frame is different from the resolution of the reference picture, the decoding program can perform suitable resampling to the reference picture, and then use the generated resampling reference picture as the reference picture for the current frame. That is to say, when the picture spatial resolution is allowed to be changed within a video sequence, the resampling of the reference picture is needed, lire suitable resampling of the reference picture can be a dow n sampling or an up sampling of the reference picture.

[110] "‘pic width max in luma samples ^’ ’ specifies the maximum width, in units of luma samples, of each decoded picture referring to the SPS.

"‘pic__width__max__in__luma_samples” may not be equal to 0 and may be an integer multiple of Max{8, MmCbSizeY),

[111] “pic height max m iunia samples’” specifies the maximum height, in units of luma samples, of each decoded picture referring to the SPS.

“pic_height_maxjn_luma_samples” may not be equal to 0 and may be an integer multiple of Max(8, MmCbSizeY).

[112] “pie width in luma samples” specifies the width of each decoded picture referring to the PPS in units of luma samples. “pic_w'idth_m_luma_samples” may not be equal to 0. Rather, “pic__wid†hjn_luma_samp!es” may be an integer multiple of

Max(8, MinCbSizeY), and may be less than or equal to “pie width max in luma samples.” [113] When “subpics_j)resent_flag” is equal to 1 or when “refjpie_resampling_enabled_flag” is equal to 0, the value of “pic_width_in_luma_saraples” is equal to “pic width max in luma _ samples.”

[114] “pic height in luma samples ⁵ ’ specifies the height of each decoded picture referring to the PPS in units of luma samples. “pic__height_injuma,__samples” may not he equal to 0. Rather, “pic height m luma samples” may be an integer multiple of

Max(8, MinChSizeY), and may be less than or equal to “pic height max in luma samples.”

[115] When “subpicsjpresent_flag” is equal to 1 or when “ref_pie_resampling_enabled_flag” is equal to 0, the value of “pic_height_in_luma_samples” is equal to “pic height max in luma samples.”

[116] The above-described SPS signaling of virtual boundaries may cause some ambiguities. In particular, the range of “sps_virtual Jboundaries_pos_x[i] ” and

“sps virtual boundaries pos y[i],” which are signaled m SPS, are from 0 to Ceil( pic width in luma samples÷8 )--! and from O to

Ceil( picjieightjn__luma_samples÷8 )-l, respectively. However, as described above, “pic_width_in_luma_samples” and “piejheight_injuma_samples” are signaled in PPS and they may vary from one PPS to another PPS. It is not clear whether the “pie width in luma samples” and “pic height in luma samples” should be set as the upper bound for the “sps_virtual_boundaries_pos_x[i] ” and “sps__virtua!__boundaries__pos__y[i],” since there may be multiple PPS referring to the same SPS.

[117] Moreover, the above-described SPS signaling of wrap-around motion compensation may have some problems. In particular, “sps__ref_wraparound__enabled__flag” and “sps_ref_wraparound_offset_minus 1 ” are syntax elements signaled in SPS, but there is a conformance constraint of “sps ref w raparound enabled flag” dependent on the “pic_widih_in__luma__samples” which is signaled on PPS. And the range of “spsj'efyvvraparound__offset_minusi” is also dependent on ‘‘pic_widthjm_luma_samples” which is signaled on PPS. These dependencies cause some problems. First, restricting the value of a SPS syntax element by the syntax elements in all of the associated PPS is not an efficient way because SPS is a higher level than PPS. Moreover, it is normally understood that high level syntax should not refer to low level syntax. Second, according to the current design, “sps ref vvraparound enabled flag” can only be true when the widths of all the pictures in the sequence referring tire SPS satisfy the constraint condition. Therefore, wraparound motion compensation cannot be used even if only one frame in the whole sequence fails to meet the constraint condition. Thus, the benefit of wrap-around motion compensation for the whole sequence is lost just because of one frame.

[118] The present disclosure provides methods to solve the above problems associated with signaling virtual boundaries or wrap-around motion compensation . Some exemplary embodiments consistent with the disclosed methods are described below in detail.

[119] In some exemplary embodiments, to solve the above problems associated with the signaling of virtual boundaries, the upper bounds of the values of

“sps__virtuai__boundaries__pos_x[i]” and “sps__virtual__boundaries_pos_y[i]” are changed to the minimum values of width and height of the picture in the sequence. Therefore, for each picture, the virtual boundary position signaled in SPS ( ^" ‘sps virtual boundaries pos x[i]” and “sps_virtual_boundaries_pos_y[i]”) is not beyond the picture boundary'.

[120] The semantics consistent with these embodiments are described below.

[121] “sps virtual boundaries pos x[i]” specifies the location of the i-th vertical virtual boundary' in units of luma samples divided by 8. The value of “sps__virtuai__boundaries__pos_x[i]” is in the range of 1 to

Ceil( pic _.. width in luma samples 8 ) - 1, inclusive, where “pic width in luma samples” is the value of “pic_width_in_luma_samples” in any PPS that refers to the SPS. [122] “sps_virtual_boundariesjpos_y[i] ^,! specifies the location of the i-th horizontal virtual boundary- in units of luma samples divided by 8. The value of

“sps virtual boundaries _„ _pos yji j” is in the range of 1 to

Ceil( pic height in luma samples ÷ 8 ) - 1, inclusive, where “pie height in luma samples” is the value of “pic_width_in_luma_sampies” in any PPS that refers to the SPS,.

[123] in some exemplary embodiments, to solve the above problems associated with the signaling of virtual boundaries, the upper bounds of the values of “sps_virtual_boundaries__pos__x[i]” and “sps_virtual_boundaries_pos_y[i]” are changed to “pic_width_max_in_luma_samples” and “pic_height_maxjn_luma_samples” respectively, which are the maximum values of width and height of tire picture in the sequence, respectively. And for each picture, if the virtual boundary position signaled in SPS (“sps_virtual_boundaries_pos_x[i] ” and “sps_virtual_boundaries_pos_y[i]”) is beyond the picture boundary, the virtual boundary is dipped within the boundary or discarded.

[124] The semantics consistent with these embodiments are described below.

[125] “sps_virtual_boundariesjpos_x[i] ^,! specifies the location of the i-th vertical virtual boundary' in units of luma samples divided by 8, The value of

“sps virtual boundaries pos x[i]” is m the range of 1 to Ceil( pic width max in luma samples ÷ 8 ) - 1, inclusive.

[126] “sps_virtual_boundaiies_pos_y[i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. Pie value of

“sps virtual boundaries pos v[i]” is in the range of 1 to Ceil( pic_height_max_in_luma_samples ÷ 8 ) - 1, inclusive.

[127] As an example, for each picture, the virtual boundary position signaled in SPS is clipped within the current picture boundary, in this example, the derived virtual boundary position VirtuaiBoundariesPosX[ i ] and VirtualBoundariesPosY[ i ], and the number of virtual boundaries VirtualBoundariesNumVer and VirtualBoundariesNumHor are derived as follows.

Virtua!BoundariesNumVer - sps_virtuaL_boundaries_piesent_ilag ? sps_num_ver_virtual_bounda!ies : ph_num_ver_virtual_boundaiies

ViriualBoundariesPosXE i j - { sps_ _virtiLal_boundaries_present _.. flag ? min(Ceil( pic_widthjnjuma_sainples ÷ 8 ) - I, spsjrirtual_boundaries_pos_x[ i ]j; ph virtual boundaries _^ pos x[ i ] ) * 8

VirtualBoundariesNumHor - sps_virtual_boundaries_pFesent__flag ? sps__num__hor_ virtual boundaries : ph_rmm_hor_virtua]_ boundaries

Virtua!BoundariesPosYj i J = ( sps virtual boundaries present flag ? rnin(Ceii( pic width in luma samples ÷ 8 ) - I, sps virtual boundaries pos y[ i j| : ph virtual boundaries pos y[ i ] ) * 8

[128] The distance between any two vertical virtual boundaries may be zero, or greater than or equal to CtbSize Y luma samples.

[129] The distance between any two horizontal virtual boundaries may be zero, or greater than or equal to CtbSize Y luma samples.

[130] As another example, for each picture, if a virtual boundary position signaled in SPS is beyond the current picture boundary, the virtual boundary is not used in current picture. Tire derived virtual boundary position VirtualBoundariesPosX[ i ] and VirtualBoundariesPosY[ i ], and the number of virtual boundaries VirtualBoundariesNum Ver and VirtualBoundariesNumHor are derived as follows.

VirtualBoundariesNumVer - sps_virtual_boimdariesj)tesent_flag ? sps_niim_ver_virtual_boundaries : ph_mun_ver_yi«ual_boundaries

Virtua!BoundariesPosX!riPicj i ] = ( sps virtual boundaries present flag ? sps virtual boundaries pos x[ i j ; ph virtual boundaries pos x[ i ] ) * 8, (i=0.. VirtualBoundariesNumVer)

VirtualBoundariesNumHor = sps virtual boundaries present flag ? sps tmni hor virtual boundaries : ph iiuni hor virtual boundaries

VirtualBoundariesPosYInPic[ i ] = ( sps_virtual_boundaries_piesent_flag ? sps_virtual_boundaries_pos_y [ i j : ph_virtual_boundaries_pos_y[ i j ) * 8, (i=0 _„ VirtualBoundariesNumHor) for(i=0j=0;i< VirtualBoundariesNumVer;i++){ if(VirtualBoundariesPosXInPic[ i j <= Ceil( pic_width_in_luma_samples ÷ 8 ) - 1){ VirtualBoundaiiesPosX[j++j ^: = VirtualBoundaiiesPosXIiiPicj i j }

ViriualBoiindaiiesNumVer-j for(i=0,j=0;i< VirtualBoundariesNumHor, i-r+){ jf(VirtualBoundariesPosYInPic[ i ] <= Ceii( pic height in luma samples ÷ 8 ) - 1){ Virtua!BouodariesPosY[j++·]^ VirtualBoundariesPosYTnPicf i ]

1

}

VirtuaiBoundariesNuinHor=j

[131] Alternatively, the derived virtual boundary' position “VirtualBoimdanesPosXjij,” “VirtuaiBoundariesPosYj i j, ^’ ’ and the number of virtual boundaries YirtualBoundariesNumVer and VirtualBoundariesNumHor are derived as follows. for(i=0.j=0;i< sps_num_ver_virtual_boundaries;i++){ if(sps_virtual_boundariesjpos_x[ i ]<= Cei3( pic_width_in_luma_samples ÷ 8 ) - 1){ ViriualBoimdariesPosXI j+vj^ sps_viitual_boundaries_pos_x[ i j

}

}

VirtualBoundariesNumV er=j for(i=0j=0;i< sps_num_hor_virtual_boundaries;i-H-){ if(sps_virtual_boundaries_pos_y [ i 1 <= Ceil( pic_helght_in_luma_samples ÷ 8 ) - 1){ VirtualBouiidariesPosY[j++j'= sps_virtual_boundaries_pos_y [ i j

}

VirtualBoundariesNumHoryj

VirtualBouiidariesNumVer = sps_virtual_boundaries_piesent_flag ?

VirtualBoundariesNumVer : ph_num_ver_virtual_boundaries

VirtualBoundariesPosXf i ] = ( sps_viitua3_boundaries_present_flag ?

VirtualBoundariesPosX [ i j: ph_virtual_boundaries_pos_x[ i j ) * 8, (i=0.. VirtualBoundariesNumVer)

VirtualBoundariesNumHor = sps_virtual_boundaries_present_flag ?

VirtualBoundariesNumHor : ph_nmn_hor_virtua3_bouiidaries

VirtualBoundariesPosY[ i ] = ( sps_virtual_boundariesjpresent_ilag ?

ViitualBoundariesPosY [ i ] : ph_virtual_boundaries_pos_y[ i ] ) * 8, (i=0.. VirtualBoundariesNumHor)

[132] In some exemplary embodiments, to solve the above problems associated with the signaling of virtual boundaries, the upper bounds of the values of “sps_virtual_boundaries_pos_x[ i ]” and “sps_virtual_boundaries_pos_y[ i ]” are changed to “picyvvidth max in luma samples” and “pic height max in luma samples ^’ ’ respectively, which are the maximum values of width and height of the picture in the sequence, respectively. And for each picture, if the virtual boundary position signaled in SPS (“sps virtual boundaries pos x[ i ]” and “sps virtual boundaries pos v[ i ]”) is scaled according to the ratio between maximum picture width and height signaled in SPS and the current picture width and height signaled in PPS.

[133] The semantics consistent with these embodiments are described as below.

[134] “sps virtual boundaries pos x[ i ]” specifies the location of the i-tli vertical virtual boundary in units of luma samples divided by 8. The value of “sps__virtual__boimdaries__pos_x[ i ]” is m the range of i to

Ceii( pic width max in luma samples ÷ 8 ) - L inclusive.

[135] “sps_v4rtual__boundaries__pos_y[ i ]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. The value of “sps virtual boundaries j30s y[ i ]” is in the range of 1 to

Ceil( pie height max in luma samples ÷ 8 ) - 1, inclusive.

[1.36] To derive the virtual boundary position for each picture, the scaling ratio is calculated first and then the virtual boundary position signaled in SPS is scaled as follows.

VBScaleX - ( (pic_vridthjrnaxjnjunia_sarap!es « 14 ) + (pic_width_in_luma_samples » 1 ) ) / pkywidih _ in _luma_ samples

VBScaleY = { (pic height mas in luma samples « 14 ) + (pic height in luma samples »

1 ) ) / picJwight_io_luma_samples

SPSVxrhialBoundariesPosXli]^ (sps virtual boundaries pos x[ i j ^x VBScaleX+ ( 1 « IS )) » 14 SPSVirtualBoundariesPosYfi]^ (sps_virtual_boundaries_pos_3'[ i ] ^x VBScaleY + ( 1 « 13 )) » 14

[136] For example, “SPSVirtualBoimdariesPosX[i] ” and “SPSVirtualBoundanesPosY|i]” may be further rounded to 8-pixel grid as follows.

SPSVirtualBoundariesPosX[i3=(( SPSVirtualBoundariesPosXii] ÷ 4 ) » 3) « 3 SPSVirtualBoundariesPosYfij^K SPSVirtualBoundariesPosYfij + 4 ) » 3) « 3 [138] Finally, the derived virtual boundary' position “VirtualBoundariesPosX[i]” and “VirtualBoundariesPosY[i],” and the number of virtual boundaries “VirtualBoundariesNumVer’’ and “VirtiialBoundariesNumHor ’ are derived as follows.

VirtualBoundariesNumVer = sps virtual boundaries present flag ? sps nuan ver __ virtual boundaries : ph num ver virtual boundaries

VirtualBoundariesPosX[ i ] = ( sps_virtual_boundaries_present_flag ?

SPSVirtualBoundariesPosX [ i j: ph_virtual_boundaries_pos_x[ i j ) * 8, (i=0..

VirtualBoundariesNumVer)

VirtualBoundariesNimiHor = sps_virtual_boundaries_presenl_flag ? sps_num_hor_virtual_boundaries : pli_niim_hor_virtual_boundaries

Viitua!BoundariesPosY[ i ] = ( sps_viitua3_boundaries_present_flag ?

SPSViitualBoundariesPosY [ i ] : ph_virtual_boundaries_pos_y[ i ] ) * 8, (i=0..

VirtualB oundariesNumH o r)

[139] in some exemplary embodiments, to solve the above problems associated with the signaling of virtual boundaries, sequence level virtual boundary _' signaling and picture width and height changes are used m a mutually exclusive manner. For example, when the virtual boundary is signaled m SPS, the picture width and height cannot be changed in the sequence. When the picture width and height is changed in the sequence, the virtual boundary cannot be signaled in SPS.

[140] In the present embodiments, the upper bound of the values of

‘ ^‘ sps virtual boundaries pos x]i r and “sps virtual boundaries pos yjlj” are changed to “pic_widthjmaxjnjuma_samples” and “pic_width_max_in_luma_samples” respectively, which are the maximum values of width and height of the picture in the sequence, respectively.

[141] The semantics of “sps virtual boundaries pos x[i]” and “sps_virtual_boundaries_pos_y[i]” consistent with the present embodiments are as follows.

[142] “sps virtual boundaries pos x[i] ^' ’ specifies the location of the i-th vertical virtual boundary in units of luma samples divided by 8. The value of “sps_virtual_boimdaries_pos_x[i] ^, ” is in the range of I to Ceil{ pic_widt3i_inax_in_luma_sainpies ÷ 8 ) - L inclusive.

[143] “sps virtual boundaries pos j'ji]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. The value of “sps_virtual_boundaries_j)os_jy[i]” is in the range of 1 to

Ceil( pic height max in luma samples ÷ 8 } - 1, inclusive.

[144] As an example, a bitstream conformance requirement of “pic_width_in_luma_samples” and “pic_height_in_luma_samples” may be imposed as follows.

[145] When (1) “subpics present flag” is equal to 1, or (2)

‘ ^‘ ref pic resampling enabled flag” is equal to 0, or (3) “sps_virtual_boundaries_present_flag” is equal to 1, then the value of

^‘ ‘pic yvidth in luma samples” is equal to “pic width max m luma samples.” According to the third condition of this constraint (i.e., “sps virtual boundaries present flag” is equal to 1), when the virtual boundary is present in SPS, each picture in a sequence has the same width that is equal to the maximum width of the pictures in the sequence,

[146] When (I) “subpics present flag” is equal to 1, or (2)

“ref pic resampling enabled flag” is equal to 0, or (3) “sps_virtual_boundaries_present_flag” is equal to 1, then the value of

“pic height in luma samples” is equal to “pic height max in luma samples.” According to the third condition of this constraint (i.e., “sps virtual boundaries present flag” is equal to 1 ), when the virtual boundary' is present in SPS, each picture in a sequence has the same height that is equal to the maximum height of the picture in the sequence. [147] As another example, a bitstream conformance requirement of “pic_width_in_luina_samples” and “pic_height_in_3uma_samples” may be imposed as follows.

[148] When (1) “subpics present flag” is equal to 1, or (2) “ref_pic_resampling_enabied_flag” is equal to 0, or (3) “sps_num_ver_vritual_boundaries” is not equal to 0, then the value of ‘"pic width in luma samples” is equal to

“pic width max in luma samples.” According to the third condition of this constraint (i.e., “spsjnum_ver_vritual_boundaries” is not equal to 0), if a number of the vertical virtual boundary is larger than 0 (i.e., there is at least one vertical virtual boundary'), each picture in a sequence has the same width that is equal to the maximum width of the picture in the sequence.

[149] When (1) “subpics_present_flag” is equal to 1, or (2)

“ref pic resampling enabled flag” is equal to 0, or (3) “sps num hor virtual boundaries” is not equal to 0, then the value of “pic height in luma samples” is equal to “pic_height_max_in_luma_samples.” According to the third condition of this constraint (i.e., “spsjiumJior_vritual_houndaries” is not equal to 0), if a number of the vertical virtual boundary is larger than 0 (i.e., there is at least one vertical virtual boundary), each picture in a sequence has the same width that is equal to the maximum width of the picture in the sequence.

[150] As another example, a bitstream conformance requirement of

“sps __ virtual boundaries present flag” may be imposed as follows: it is a requirement of bitstream conformance that when “ref_pic_resampling_enabled_flag” is 1, “sps_virtual_boundaries_present_f!ag” is 0. According this constraint, if reference picture resampling is enabled, a virtual boundary should not be present in SPS. The philosophy of this constraint is as follows. Reference picture resampling is used when the current picture has a different resolution from the reference picture. When the picture resolution is allowed to be changed within a sequence, the position of the virtual boundary can also be changed from picture to picture as different pictures may have different resolutions. Thus, virtual boundary position can be signalled at a picture level (e.g., PPS). The sequence level signalling of virtual boundary (i.e., signalled in SPS) is not suitable.

[151] As another example, “sps virtual boundaries present _... flag” is conditionally signaled on “ref pic resampling enabled _... flag/’ For example,

“refjpic_resampling_enabled_flag” equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS and

“sps virtual boundaries present flag ^’ ’ is signaled based on tire value of

“!ref pic resampling enabled flag” being 1. The syntax is shown in FIG. 11, with the changes to the syntax in Table i (FIG. 5} being shown in italics. The associated semantics are described as follows.

[152] “sps virtual boundaries present flag” equal to 1 specifies that information of virtual boundaries is signalled in the SPS. “sps_virtual__boundaries__present_flag” equal to 0 specifies that information of virtual boundaries is not signalled in the SPS. When there are one or more virtual boundaries signalled in the SPS, the in-loop filtering operations are disabled across the virtual boundaries in pictures referring to the SPS. When “sps_virtual_boundaries_present_fIag” is not present, its value is inferred to be 0. In-loop filtering operations include the deblocking filter, sample adaptive offset filter, and adaptive loop filter operations.

[153] As another example, “ref_pic_resampling_enabled_flag” is conditionally signaled on “sps_virtual_boundaries_present_flag ” The syntax is shown in FIG. 12, with the changes to the syntax in Table 1 (FIG. 5) are shown with italics and strikethrough. The associated semantics are described below'. [154] “ref_pic_resatnplmg_enabled_flag” equal to I specifies that reference picture resampling may he applied when decoding coded pictures in the CLVSs referring to the SPS. “ref pic resampling enabled flag” equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS. When“refj)ic_resampliiig_enab3ed_flag” is not present, its value is inferred to be 0.

[155] Further, to solve the above problems associated with the signaling of wraparound motion compensation “sps ref wraparound enabled flag” can only be true when the widths of all the pictures in the sequence referring the SPS satisfy the constraint condition, the following embodiments are provided by the present disclosure.

[156] In some embodiments, the constraint on the wrap-around motion compensation enabling flag and wrap-around offset is changed to depend on the maximum picture width, which is signaled in SPS, And at a picture level, the check of picture width is introduced. The wrap-around can only be applied to the picture with a width satisfying the condition. For those pictures of which the width fails to mee t condition, the wrap-around is turned off even if “sps_ref_wrapaxound_enabled_flag” is true. By doing this, there is no need to restrict “sps_ref_wraparound_enabled_flag” and “sps_ref_wraparound_offset_minus 1 ” signaled in SPS using picture width which is signaled in PPS. lire syntax is not changed and the semantics of “sps ref wraparound enabled flag” and “sps_ref_wraparound_ofFset_minus 1 ” are as follows.

[157] “sps ref wraparound enabled flag” equal to 1 specifies that horizontal wraparound motion compensation may be applied in inter prediction. sps_ref_wraparound_enabled_flag equal to 0 specifies that horizontal wrap-around motion compensation is not applied. When the value of ( CtbSizeY / MinCbSizeY + 1} is larger than ( pie width max in luma samples / MinCbSizeY - 1 ), the value of ^s PS_ref_wraparound_enab3ed_flag shall be equal to 0. [158] “sps_ref_wraparound_offset_minusI” plus 1 specifies the maximum value of offset used for computing the horizontal wrap-around position in units of MmCbSizeY luma samples. Hie value of sps ref _ wraparound offset minus 1 shall be in the range of

( CtbSizeY / MinCbSizeY ) + 1 to ( pic width max in luma samples / MinCbSizeY ) - L inclusive.

[159] Wherein pic width max in luma samples is the maximum width, in units of luma samples, of each decoded picture referring to the SPS as VVC draft 7. CtbSizeY ^' and MinCbSizeY are as defined as VVC draft 7.

[ 160] For each picture of the sequence, a variable “PicRefWraparoundEnableFlag” is defined as follows.

[161] PicRefWraparoundEnableFiag = sps_ref_wraparound_enabled_flag && sps_ref_wraparound_offset_minus 1 <=( pic__width__in__luma_samples / MinCbSizeY - 1 ))

[162] Wherein “pic width in luma samples” is the width of the picture referring to the PPS in which “pic _ width in luma samples" ^’ is signaled as VVC draft 7. CtbSizeY and MinCbSizeY are as defined as VVC draft 7.

[163] The variable “PicRefWraparoundEnabfeFiag” is used to determine whether wrap-around MC can be enabled for the current picture.

[164] in an alternative way, for each picture of the sequence, two variables “PicRefWraparoundEnabfeFiag” and “PicRefWraparoundOffset” are defined as follows.

[165] PicRefWraparoundEnableFiag = ^: sps ref wraparound enabled flag && ((ctbSizeY/MinCbSizeY-f-1) <==( pic width in luma samples / MinCbSizeY - 1 ))

[166] PieRefWraparouiidOffset=min(sps_ref_wraparouiid_ofset_minus+ l, (pic_width_iuJuma_sampies/MinCbSizeY)) [167] Wherein “pic_width_in_iuma_samples” is the width of the picture referring to the PPS in which “pic_width_in_luina_samples” is signaled as VVC draft 7. CtbSizeY and MinCbSizeY are as defined as VVC draft 7.

[168] The variable “PicRefWraparoundEnableFlag” is used to determine whether wrap-around MC can be enabled for the current picture. And if so, the offset “PicRefWraparoundOffset” can be used in motion compensation process.

[169] In some embodiments, mutually exclusive use of wrap-around motion compensation and sequence level virtual boundary signaling and picture width change are provided. When wrap-around motion compensation is enabled, the picture width cannot be changed in the sequence. When the picture width is changed in the sequence, the wraparound motion compensation is disabled.

[ 170] As an example, the semantics of “sps_ref_wraparound_enabied_flag” and ^' ‘sps ref wraparound offset minus 1” consistent with the present embodiments are described as follows.

[171] “sps_ref_wraparound_enabled_flag” equal to 1 specifies that horizontal wraparound motion compensation is applied in inter prediction.

“sps ref wraparound enabled flag” equal to 0 specifies that horizontal wrap-around motion compensation is not applied. When the value of ( CtbSizeY / MinCbSizeY + 1) is larger than { pic_width_max_m_luma_samples / MinCbSizeY - 1 ), the value of sps ref wraparound enabled flag may be equal to 0.

[172] “sps ref wraparound offset minus 1” plus 1 specifies the offset used tor computing the horizontal wrap-around position in units of MinCbSizeY luma samples. The value of “ref_wraparound_offset_minusl” may be in the range of

( CtbSizeY / MinCbSizeY ) + 1 to ( pic width max in luma samples / MinCbSizeY ) -- 1, inclusive. [173] A bitstream conformance requirement of “pie_width_m_luma_samples” and “pic_height_in_luma_samples” may be imposed as follows.

[174] When “subpics _present _... flag” is equal to 1 or

‘ ^‘ ref pic resampling enabled flag" ^’ equal to 0 or “sps ref wraparound enabled flag” is equal to I, the value of “pic_width_in_luma_samples” is equal to ^‘ ‘pic width max m luma samples.”

[175] As another example, a bitstream conformance requirement of “sps_ref_wraparound_enabled_flag” may be imposed. The semantics of “sps_ref_wraparound_enabled_f!ag” and “sps_ref_wraparound_offset_minus 1 ” consistent with the present embodiments are described as follows.

[176] “sps_ref_wraparound_enabled_flag” equal to 1 specifies that horizontal wraparound motion compensation is applied in inter prediction.

^‘ ‘sps ref wraparound enabled flag” equal to 0 specifies that horizontal wrap-around motion compensation is not applied. When the value of ( CtbSizeY / MinCbSizeY + 1) is larger than ( pic_width_max_in_iuma_samples / MinCbSizeY - 1 ), the value of sps_ref_wraparound_enabled_flag is equal to 0,

[177] When ref pic resampling enabled flag is 1, the value of

‘ ^‘ sps ref wraparound enabled flag” may he 0. ref pic resampling enabled flag specifies whether reference resampling is enabled. The reference resampling is used to resample the reference picture when the resolution of reference picture is different from the resolution of the current picture. So at a picture level (e.g., PPS, PH), when the resolution of the reference picture is difference from the current picture, the wraparound motion compensation is not used to predict the current picture.

[178] ‘ ^" sps ref wraparound offset minus 1” plus 1 specifies the offset used for computing the horizontal wrap-around position in units of MinCbSizeY luma samples. The value of “ref_wraparovmd_offset_minusl” is in the range of ( CtbSizeY / MinCbSizeY ) + 1 to ( pic_width_raax_in_luma_saraples / MinCbSizeY ) - 1, inclusive.

[179] As another example, “sps ref wraparound enabled flag” is conditionally signaled on ‘‘ref pie resampling enabled flag.” The syntax is shown in FIG. 13, with the changes to the syntax in Table 3 (FIG. 8) being shown in italics. The associated semantics are described below.

[180] “sps ref \vraparound enabled _... flag” equal to 1 specifies that horizontal wraparound motion compensation is applied in inter prediction.

“spsj'ef_wraparound_enabled__f!ag” equal to 0 specifies that horizontal wrap-around motion compensation is not applied. When the value of ( CtbSizeY / MinCbSizeY + 1} is larger than ( pic width max in luma samples / MinCbSizeY - 1 ), the value of “sps_ref_wraparoiind__enabled_fiag” is equal to 0. When "sps ref wraparound enabled _... flag” is not present, its value is inferred to be 0.

[181] “sps ref \vraparound _.. offset minus 1” plus 1 specifies the offset used tor computing the horizontal w rap-around position in units of MinCbSizeY ^" luma samples. The value of ref_wraparound_offset_minus I is in the range of ( CtbSizeY / MinCbSizeY ) ÷ 1 to ( pic width max in luma samples / MinCbSizeY ) - 1, inclusive.

[182] As an example, “ref_pic_resamp3ing_enabled_flag ’ is conditionally signaled on “sps_ref_wraparound_enab!ed_flag.” The syntax is shown as Table 9 of FIG. 14, with the changes to the syntax in Table 3 (FIG. 8) being shown in italics and strikethrough. The associated semantics are as follows.

[18.3] “ref_pic_resampling_enabled_flag” equal to I specifies that reference picture resampling may he applied when decoding coded pictures in the CLVSs referring to the SPS. ref pic resampling enabled flag equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS. When ref_pic_resampling_enabled_flag is not present, its value is inferred to be 0.

[184] FIG. IS illustrates a flowchart of an exemplary method 1500, consistent with some embodiments of the disclosure. In some embodiments, method 1500 can be performed by an encoder, one or more software or hardware components of an apparatus (e.g., apparatus 400 of FIG. 4). For example, a processor (e.g., processor 402 of FIG. 4) can perform method 1500. In some embodiments, method 1500 can be implemented by a computer program product, embodied in a computer-readable medium, including computer-executable instructions, such as program code, executed by computers (e.g., apparatus 400 of FIG. 4).

[185] A virtual boundary can be set as one of the coding tools for 360-degree video or gradual decoding refresh (GDR) coding such that in-loop filtering can be disabled to prevent from error and artifacts. It is illustrated in the method shown in FIG. 15.

[186] in step 1501, a bitstream comprising a sequence of pictures is received. The sequence of pictures cart be a set of pictures. As described, a basic processing unit of a color picture can include a luma component (Y) representing achromatic brightness information, one or more chroma components (e.g., Cb and Cr) representing color information, and associated syntax elements, in which the luma and chroma components can have the same size of the basic processing unit. The luma and chroma components can be referred to as ‘boding tree blocks” (“CTBs”) m some video coding standards (e.g., H.265/HEVC or H.266/VVC). Any operation performed to a basic processing unit can be repeatedly performed to each of its luma and chroma components.

[187] In step 1503, whether the virtual boundary is signaled at a sequence level (i.e., in SPS) is determined according to the received stream. When the virtual boundary is signaled at the sequence level, a number of virtual boundaries and the position of each virtual boundary' are signaled for pictures referring to the SPS . [188] The virtual boundary can be signaled in a sequence parameter set (8PS) or a picture header (PH). In 8PS, a virtual boundary present flag

“sps virtual boundaries present flag” is signaled first, if the flag is true, then a number of virtual boundaries and the position of each virtual boundary are signaled for pictures referring to the SPS.

[189] in step 1505, optionally, in response to the virtual boundary is not signaled at the sequence level for the set of pictures, whether the virtual boundary is signaled at a picture level (e.g., PP8 or PH) tor a picture of the set of pictures is determined according to the received stream. For example, if “sps_virtual_boundariesjpresent_flag” is false, then in PH, another virtual boundary present flag “ph virtual boundaries present flag” can be signaled. Similarly, if ‘ ^‘ ph virtual boundaries present flag” is true, the number of virtual boundaries and the position of each virtual boundary can be signaled for the picture associated with the PH. Step 1505 is optional, in some embodiments, the method can include step 1505 in response to the virtual boundary not being signaled at the sequence level, in some embodiments, in response to the virtual boundary not being signaled at the sequence level, the method can end without performing step 1505. In response to the virtual boundary being signaled at the picture level, the method proceeds to step 1507 for determining a position of the virtual boundary.

[190] In some embodiments, whether any condition indicating the virtual boundary being not signaled at the sequence level is met can be determined. As noted above in the example, the value of “sps virtual boundaries present flag” in Table 1 of FIG. 5 can be determined and the value being I indicates the virtual boundary is signaled at the sequence level. However, there are other conditions indicating that the virtual boundary is not applied at the sequence level. A first condition that indicates no sequence level virtual boundary' signaling is reference resampling being enabled. A second condition is that a resolution of a picture in the set of pictures is allowed to be changed. Any of these two conditions is met, the virtual boundary is not signaled at the sequence level. When none of these two conditions is met, and as in the example, the value of “sps virtual boundaries present flag” is determined to he 1, it is determined that the virtual signal is signaled at the sequence level for the set of pictures. The method proceeds to step 1507 for determining the position of the virtual boundary.

[191] In some embodiments, whether reference resampling is enabled for the sequence of pictures is determined according to the received bitstream. In response to the reference resampling being enabled for the sequence of pictures, the virtual boundary is not signaled at the sequence level.

[192] A decoding program can decode each of the frames. If the decoding program determines a resolution of a current frame is different from the resolution of the reference picture, the decoding program can perform suitable resampling to the reference picture, and then use the generated resampled reference block as the reference blocks to decode the blocks in the current frame. When the picture spatial resolution is allowed to be changed within a video sequence, the resampling of the reference picture is needed. When the resampling is enabled, the resolution can be allowed to be changed or not allowed to be changed. When the resolution of the picture is allowed to he changed, the resampling is enabled because the resampling is needed. The suitable resampling of the reference picture can be a down sampling or an up sampling of the reference picture. For example, as shown in in FIG. 9,

‘‘ref pic resampling enabled flag ⁵ ’ equal to 1 specifies that reference picture resampling may be applied when decoding coded pictures in the CLVSs referring to the SPS. refj)ic_resampling_enabled_f]ag equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS. [193] For example, “sps_virtual_boundaries_present_flag” in Table 1 of FIG. 5 can he conditionally signaled on “refjpic_resampling_enabled_flag.” The value of

“ref pie resampling enabled flag” can be determined, “ref pic resampling enabled flag” equal to 0 specifies that reference picture resampling is not applied when decoding pictures in CLVSs referring to the SPS. When “ref_pic_resampiing_enabled_flag” is 1, “sps_virtual_boundaries_present_flag” is 0,

[194] In some embodiments, whether a resolution of a picture in the sequence of pictures is allowed to be changed is determined. In response to the resolution being allowed to be changed, it is determined that the virtual boundary is not signaled at the sequence level ,

[195] Hie reference picture resampling is used when the current picture has a different resolution from the reference picture. When the picture resolution is allowed to be changed within a sequence, the position of the virtual boundary ⁷ can also he changed from picture to picture as different pictures may have different resolutions. Thus, virtual boundary position can be signalled at a picture level (e.g., PPS and PH), while the sequence level signalling of virtual boundary (i.e., signalled in SPS) is not suitable. Therefore, when the picture resolution is allowed to he changed, it is determined that the virtual boundary is not signaled at the sequence level, if, at the same time, the resampling is enabled but the picture resolution is not allowed to be changed, no constraint is placed on the virtual boundary signaling.

[196] in some embodiments, in response to the reference resampling being enabled for the sequence of pictures, it is determined that wrap-around motion compensation is disabled for the sequence of pictures.

[197] For example, it is determined that the value of

“ref pic resampling enabled flag” in FIG. 13 is 1, “sps ref wraparound enabled flag” is 0 and horizontal wrap-around motion compensation is not applied. “ref__pic_resampling_enabled__flag” specifies whether reference resampling is enabled. The reference resampling is used to resample the reference picture when the resolution of reference picture is different from the resolution of the current picture. At a picture level (e.g., PPS), in this example, when the resolution of the reference picture is difference from the current picture, the wraparound motion compensation is not used to predict the current picture. If it is determined that the value of “ref pie resampling enabled flag” is 0,

“sps ref wraparound enabled flag” is 1 and horizontal wrap-around motion compensation is applied.

[198] In some embodiments, in response to the resolution of the picture in the sequence of pictures being allowed to be changed, it is determined that wrap-around motion compensation is disabled for the sequence of pictures.

[199] In step 1507, in response to the virtual boundary being signaled at the sequence level, a position of the virtual boundary for the sequence is determined. The position is bounded by a range based on the widths and the heights of the pictures in the sequence. The virtual boundary' can include vertical boundaries and horizontal boundaries. The position of a virtual boundary can include location points of vertical boundaries and location points of horizontal boundaries. For example, as shown in Table 1 of FIG. 5,

“sps virtual boundaries pos xjij” specifies the location of the i-tfa vertical virtual boundary m units of luma samples divided by 8, while “sps_virtual_boundaries_pos_y[i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8.

[200] In some embodiments, a vertical range of the position is less than or equal to a maximum width allowed for each picture of the pictures in the sequence and a horizonal range is less than or equal to a maximum height allowed for each of the pictures in the set. The maximum width and the maximum height are signaled in the received stream. The examples in the semantics are as follows. [201] “sps_virtual_boundariesjpos_x[i] ^,! specifies the location of the i-th vertical virtual boundary in units of luma samples divided by 8, The value of “sps virtual boundaries _„ _pos xji j” is in the range of 1 to Ceil( pic width max in luma samples ÷ 8 ) - 1. inclusive.

[202] “^sjHrtuaIJxmndaries_j>os_y[i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. lire value of

“sps virtual boundaries pos y[i]” is in the range of 1 to Ceil( pic_height_max_in_luma_samples ÷ 8 ) - 1, inclusive.

[203] When the virtual boundary is present in SPS, i.e.,

“sps virtual boundaries present flag” is equal to 1. each picture in the sequence has the same width that is equal to the maximum width of the pictures in the sequence.

[204] In some embodiments, in response to the virtual boundary being signaled at the picture le vel for one picture of the set of pictures, the position of the virtual boundary for the one picture can be determined. One or more boundaries can be signaled for one or more pictures in the set. For example, as show n in the semantics of PH syntax in FIG, 6, “ph_num_ver_virtual_boundaries” specifies a number of “ph__virtuaI__boiindaries__pos_x[i]” syntax elements that are present in the PH. When “ph num ver virtual boundaries” is not present, it is inferred to be equal to 0.

[205] “ph_virtual_boundaries_pos_x[i] ^,! specifies the location of the i-th vertical virtual boundary in units of luma samples divided by 8. The value of

“ph virtual boundaries pos x[ij” is in the range of 1 to Ceil( pic_width_in_luma_samples ÷ 8 ) - 1, inclusive.

[206] “ph_virtua3_boundaries_pos_y[i]” specifies the location of the i-th horizontal virtual boundary in units of luma samples divided by 8. The value of “ph__virtu ^a l__boundaries_pos_yfi]” is in the range of 1 to Ceii{ picjieight_in_lurna_samples ÷ 8 ) - i, inclusive.

[207] As described, in applications like 360-degree video, the layout for a specific projection format usually has multiple faces. For example, MPEG-I part 2: omni-directional media format (OMAF) standardizes Cube-map based projection format named CMP which has six faces. And for those projection formats including a plurality of faces, no matter what kind of compact frame packing arrangement is used, discontinuities appear between two or more adjacent faces in the frame packed picture. If in-loop filtering operations are performed across this discontinuity, face seam artifacts may become visible in the reconstructed video after rendering. To alleviate face seam artifacts, in-loop filtering operations have to be disabled across discontinuities in the frame-packed picture. The virtual boundary can be used across which the loop filtering operation is disabled. An encoder may set the discontinued boundary as a virtual boundary, and thus no loop filter can be applied on the discontinued boundary. Other than the 360-degree video, the virtual boundary may also be used for gradual decoding refresh (GDR), which is mainly used in the very-!ow-delay application. In the very- low-delay application, inserting an intra coded picture as a random access point picture may cause unacceptable transmission latency due to the big size of the intra coded picture. To reduce the latency, GDR is adopted in which the pictures are refreshed progressively by- inserting intra-coded regions in B/P-pictures. To prevent error propagation, the pixels m refreshed region in a picture cannot refer to the those in the im-refreshed region of the current picture or reference picture. Therefore, the loop filtering cannot be applied across the boundary of refreshed region and un-freshed region. With the above virtual boundary' scheme, the encoder may set the boundary' of refreshed region and un-refreshed region as a virtual boundary, and then no loop filtering operation can be applied across this boundary. [208] In step 1509, in-loop filtering operations (e.g., look filter stage 232 in FIG, 3A) across the virtual boundary of the pictures is disabled. When there are one or more virtual boundaries signalled in the SPS, the in-loop filtering operations can be disabled across the virtual boundaries in pictures referring to the SPS. In-loop filtering operations include the deblocking filter, sample adaptive offset filter, and adaptive loop filter operations.

[209] According to some embodiments of the present disclosure, another exemplary method 1600 is provided. The method can be performed by an encoder, one or more software or hardware components of an apparatus (e.g., apparatus 400 of FIG, 4). For example, a processor (e.g., processor 402 of FIG, 4) can perform method 1600, In some embodiments, method 1600 can be implemented by a computer program product, embodied in a computer- readable medium, including computer-executable instructions, such as program code, executed by computers (e.g., apparatus 400 of FIG, 4). The method can include the following steps.

[210] In step 1601, a bitstream comprising a sequence of pictures is received. The sequence of pictures can be a set of pictures. As described, a basic processing unit of a color picture can include a luma component (Y) representing achromatic brightness information, one or more chroma components (e.g., Cb and Cr) representing color information, and associated syntax elements, in which the luma and chroma components can have the same size of the basic processing unit. The luma and chroma components can he referred to as ^' ‘coding tree blocks” (“CTBs”) in some video coding standards (e.g., H.265/HEVC or H.266/VVC). Any operation performed to a basic processing unit can be repeatedly performed to each of its luma and chroma components.

[211] In step 1603, whether reference resampling is enabled for the sequence of pictures is determined according to the received bitstream. [212] In step 1605, in response to the reference resampling being enabled for the sequence of pictures, it is determined that wrap-around motion compensation is disabled for the sequence of pictures.

[213] For example, it is determined that the value of “ref_pic_resamplmg_enabled_flag” in FIG, 13 is 1, “sps_ref_wraparound_enabled_f!ag” is 0 and horizontal wrap-around motion compensation is not applied.

‘‘ref pic resampling enabled flag ⁵ ’ specifies whether reference resampling is enabled. The reference resampling is used to resample the reference picture when the resolution of reference picture is different from the resolution of the current picture. At a picture level (e.g., PPS), in tins example, when the resolution of the reference picture is difference from the current picture, the wraparound motion compensation is not used to predict the current picture. If it is determined that the value of “ref_pie_resampling_enabled_flag” is 0.

^' ‘sps ref vvraparound enabled flag” is 1 and horizontal wrap-around motion compensation is applied.

[214] Accordingly, in step 1703, an alternative step of step 1603, whether a resolution of a reference picture of the sequence of pictures is different from a resolution of a current picture of the sequence of pictures is determined.

[215] in step 1705, an alternative step of step 1605, in response to the resolution of the reference picture of the sequence of pictures is different from the resolution of the current picture of the sequence of pictures, it is determined that wrap-around motion compensation is disabled tor the current picture.

[216] In some embodiments, a non -transitory computer-readable storage medium including instructions is also provided, and the instructions may be executed by a device (such as the disclosed encoder and decoder), for performing the above-described methods. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD- ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM or any other flash memory, NVRAM, a cache, a register, any other memory chip or cartridge, and networked versions of the same. The device may include one or more processors (CPUs), an input/output interface, a network interface, and/or a memory.

[217] The disclosed embodiments may further be described using the following clauses:

1. A method, comprising: recei ving a set of pictures: determining widths and heights of pictures in the set; and determining, based on the widths and heights, a position of a virtual boundary for the set of pictures.

2. The method according to clause 1, further comprising: determining a minimum value of the detennined widths and heights of the pictures, wherein determining, based on the widths and heights, the position of the virtual boundary for the set of pictures further comprises: determining, based on the minimum value, the position of the virtual boundary for the set of pictures,

3. The method according to clause 1, further comprising: determining a maximum value of the determined widths and heights of the pictures, wherein determining, based on the widths and heights, the position of the virtual boundary' for the set of pictures further comprises: determining, based on the maximum value, the position of the virtual boundary' for the set of pictures. 4. The method according to clause 1, further comprising: determining whether a width of a first picture in the set satisfies a given condition; and in response to a determination that the width of the first picture satisfies the given condition, disabling horizontal wrap-around motion compensation for the first picture.

5. The method according to clause 1, further comprising: disabling in-loop filtering operations across the virtual boundary of the set of pictures,

6. The method according to clause 1, further comprising: determining whether a resampling has been performed on a first picture in the set; in response to a determination that a resampling has not been performed on the first picture, disabling, for the first picture, at least one of signaling of the virtual boundary or wrap-around motion compensation.

7. The method according to clause 1, wherein the position of the virtual boundary is signaled in at least one of a Sequence Parameter Set (SPS) or a Picture Header (PH).

8. An apparatus comprising: a memory storing a set of instructions; and one or more processors configured to execute the set of instructions to cause the apparatus to perfonn : receiving a set of pictures; determining widths and heights of pictures in the set; and determining, based on the widths and heights, a position of a virtual boundary for the set of pictures.

9. The apparatus according to clause 8, wherein the one or more processors configured to execute the set of instructions to cause the apparatus to further perform: determining a minimum value of the determined widths and heigh ts of the pictures, wherein determining, based on the widths and heights, the position of tire virtual boundary tor the set of pic tures further comprises: determining, based on the minimum value, the position of the virtual boundary for the set of pictures.

10. The apparatus according to clause 8, wherein the one or more processors configured to execute the set of instructions to cause the apparatus to further perform: determining a maximum value of the determined widths and heights of the pictures, wherein determining, based on the widths and heights, the position of tire virtual boundary tor the set of pictures further comprises: determining, based on the maximum value, the position of the virtual boundary for the set of pictures.

11. The apparatus according to clause 8, wherein the one or more processors configured to execute the set of instructions to cause the apparatus to further perform: determining whether a width of a first picture in the set satisfies a given condition; and in response to a determination that the width of the first picture satisfies the given condition, disabling horizontal wrap-around motion compensation for the first picture.

12. The apparatus according to clause 8, wherein the one or more processors configured to execute the set of instructions to cause the apparatus to further perform: disabling in-ioop filtering operations across the virtual boundary of the set of pictures,

13, The apparatus according to clause 8, wherein the one or more processors configured to execute the set of instructions to cause the apparatus to further perform: determining whether a, resampling has been performed on a first picture in the set: in response to a determination that a resampling has not been performed on the first picture, disabling, tor the first picture, at least one of signaling of the virtual boundary or wrap-around motion compensation.

14, The apparatus according to clause 8, wherein the position of the virtual boundary is signaled in at least one of a Sequence Parameter Set (SPS) or a Picture Header (PH).

15. A non-transitory computer readable medium that stores a set of instructions that is executable by at least one processor of a computer to cause the computer to perform a video processing method, the method comprising: receiving a set of pictures; determining widths and heights of pictures in the set; and determining, based on the widths and heights, a position of a virtual boundary for the set of pictures,

16. The non-transitory computer readable medium according to clause 15, wherein the set of instructions that is executable by the computer to cause the computer to further perform : determining a minimum value of the determined widths and heights of the pictures, wherein determining, based on die widths and heights, the position of the virtual boundary for the set of pictures further comprises: determining, based on the minimum value, the position of the virtual boundary for the set of pictures.

17. The non-transitory computer readable medium according to clause 15, wherein the set of instructions that is executable by the computer to cause the computer to further perform: determining a maximum value of the determined widths and heights of the pictures, wherein determining, based on the widths and heights, the position of the virtual boundary' for the set of pictures further comprises: determining, based on the maximum value, the position of the virtual boundary' for the set of pictures.

18. The non-transitory' computer readable medium according to clause 15, wherein the set of instructions that is executable by the computer to cause the computer to further perform: determining whether a width of a first picture in the set satisfies a given condition; and in response to a determination that the width of the first picture satisfies the given condition, disabling horizontal wrap-around motion compensation for the first picture.

19. The non-transitory' computer readable medium according to clause 15, wherein the set of instructions that is executable by the computer to cause the computer to further perform: disabling in-loop filtering operations across the virtual boundary _' of the set of pictures. 20. The non-transitory computer readable medium according to clause 15, wherein the set of instructions that is executable by the computer to cause the computer to further perform: determining whether a resampling has been performed on a first picture in the set; in response to a determination that a resampling has not been performed on the first picture, disabling, for the first picture, at least one of signaling of the virtual boundary _' or wrap-around motion compensation.

21. The non-transitory' computer readable medium according to clause 15, wherein the position of the virtual boundary' is signaled in at least one of a Sequence Parameter Set (SPS) or a Picture Header (PH).

[218] It should be noted that, the relational terms herein such as “first” and “second” are used only to differentiate an entity or operation from another entity or operation, and do not require or imply any actual relationship or sequence between these entities or operations. Moreover, the words “comprising,” “having,” “containing,” and “including,” and other similar forms are intended to be equivalent m meaning and he open ended in that an item or items following any one of these words is not meant to be an exhaustive listing of such item or items, or meant to be limited to only the listed item or items.

[219] As used herein, unless specifically stated otherwise, the term “or” encompasses all possible combinations, except where infeasible. For example, if it is stated that a database may include A or B, then, unless specifically stated otherwise or infeasible, the database may include A, or B, or A and B. As a second example, if it is stated that a database may include A, B, or C, then, unless specifically stated otherwise or infeasible, the database may include A, or B, or C, or A and B, or A and C, or B and C, or A and B and C. [220] It is appreciated that the above described embodiments can be implemented by hardware, or software (program codes), or a combination of hardware and software. If implemented by software, it may be stored in the above-described computer-readable media. The software, when executed by the processor can perform the disclosed methods. The computing units and other functional units described in this disclosure can be implemented by hardware, or software, or a combination of hardware and software. One of ordinary skill in the art will also understand that multiple ones of the above described modules/units may be combined as one module/unit, and each of the above described modules/units may be further divided into a plurality of sub-modules/sub-units.

[221] In the foregoing specification, embodiments have been described with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. It is intended that the specification and examples he considered as exemplar)' only, with a true scope and spirit of the invention being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, those skilled in the art can appreciate that these steps can be performed in a different order while implementing the same method,

[222] In the drawings and specification, there have been disclosed exemplary embodiments. However, many variations and modifications can be made to these embodiments. Accordingly, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation.