Patent Grant
11582486
The present disclosure relates generally to an image coding technology and, more particularly, to an image coding method based on a transform in an image coding system and an apparatus therefor.
Nowadays, the demand for high-resolution and high-quality images/videos such as 4K, 8K or more ultra high definition (UHD) images/videos has been increasing in various fields. As the image/video data becomes higher resolution and higher quality, the transmitted information amount or bit amount increases as compared to the conventional image data. Therefore, when image data is transmitted using a medium such as a conventional wired/wireless broadband line or image/video data is stored using an existing storage medium, the transmission cost and the storage cost thereof are increased.
Further, nowadays, the interest and demand for immersive media such as virtual reality (VR), artificial reality (AR) content or hologram, or the like is increasing, and broadcasting for images/videos having image features different from those of real images, such as a game image is increasing.
Accordingly, there is a need for a highly efficient image/video compression technique for effectively compressing and transmitting or storing, and reproducing information of high resolution and high quality images/videos having various features as described above.
A technical aspect of the present disclosure is to provide a method and an apparatus for increasing image coding efficiency.
Another technical aspect of the present disclosure is to provide a method and an apparatus for increasing transform efficiency.
Still another technical aspect of the present disclosure is to provide an image coding method and an image coding apparatus which are based on a reduced secondary transform (RST).
Yet another technical aspect of the present disclosure is to provide a method and an apparatus for increasing the efficiency of a secondary transform by changing the array of transform coefficients according to an intra prediction mode.
Still another technical aspect of the present disclosure is to provide an image coding method and an image coding apparatus for increasing the efficiency of a secondary transform by optimizing the transformation kernel matrix applied to the secondary transform.
Still another technical aspect of the present disclosure is to provide an image coding method and an image coding apparatus which are based on a transform set for increasing coding efficiency.
According to an embodiment of the present disclosure, there is provided an image decoding method performed by a decoding apparatus. The method may include: deriving transform coefficients through dequantization based on quantized transform coefficients for a target block; deriving modified transform coefficients based on an inverse reduced secondary transform (RST) using a preset transform kernel matrix for the transform coefficients; deriving residual samples for the target block based on an inverse primary transform for the modified transform coefficients; and generating a reconstructed picture based on the residual samples for the target block, wherein the deriving the modified transform coefficients derive the modified transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region by applying the transform kernel matrix to the transform coefficients of the top-left 4×4 region of the 8×8 region of the target block.
When performing a matrix operation between the transform coefficients of the top-left 4×4 region of the 8×8 region and the transform kernel matrix, the transform coefficients of the top-left 4×4 region of the 8×8 region are one-dimensionally arranged according to a forward diagonal scanning order.
The transform coefficients arranged one-dimensional are two-dimensionally arranged the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region according to a row-first direction or a column-first direction corresponding to the intra prediction mode applied to the target block after the matrix operation with the transform kernel matrix.
According to another embodiment of the present disclosure, there is provided a decoding apparatus for performing image decoding. The decoding apparatus may include: an entropy decoder to derive quantized transform coefficients for a target block and information on prediction from a bitstream; a predictor to generate a prediction sample for the target block based on the information on prediction; a dequantizer to derive transform coefficients through dequantization based on the quantized transform coefficients for the target block; an inverse transformer to include an inverse reduced secondary transformer (RST) that derives modified transform coefficients based on inverse RST of the transform coefficients and an inverse primary transformer that derives residual samples for the target block based on first inverse transform of the modified transform coefficients; and an adder to generate reconstructed samples based on the residual samples and the prediction samples, wherein the inverse reduced secondary transformer derive the modified transform coefficients in the top-left 4×4 region of the 8×8 region by applying the transform kernel matrix to the transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region of the target block.
According to still another embodiment of the present disclosure, there is provided an image encoding method performed by an encoding apparatus. The method may include: deriving prediction samples based on an intra prediction mode applied to a target block; deriving residual samples for the target block based on the prediction samples; deriving transform coefficients for the target block based on a primary transform for the residual samples; deriving modified transform coefficients based on a reduced secondary transform (RST) for the transform coefficients; and deriving quantized transform coefficients by performing quantization based on the modified transform coefficients, wherein the deriving of the modified transform coefficients one-dimensionally may include arranging the transform coefficients according to one of a row-first direction or a column-first direction according to the intra prediction mode applied to the target block and applying the RST to the transform coefficients.
According to yet another embodiment of the present disclosure, there may be provided a digital storage medium that stores image data including encoded image information and a bitstream generated according to an image encoding method performed by an encoding apparatus.
According to still another embodiment of the present disclosure, there may be provided a digital storage medium that stores image data including encoded image information and a bitstream to cause a decoding apparatus to perform the image decoding method.
According to the present disclosure, it is possible to increase overall image/video compression efficiency.
According to the present disclosure, it is possible to increase the efficiency of a secondary transform by changing the array of transform coefficients according to an intra prediction mode.
According to the present disclosure, it is possible to increase image coding efficiency by performing image coding based on a transform set.
According to the present disclosure, it is possible to increase the efficiency of a secondary transform by optimizing the transformation kernel matrix applied to the secondary transform.
While the present disclosure may be susceptible to various modifications and include various embodiments, specific embodiments thereof have been shown in the drawings by way of example and will now be described in detail. However, this is not intended to limit the present disclosure to the specific embodiments disclosed herein. The terminology used herein is for the purpose of describing specific embodiments only, and is not intended to limit technical idea of the present disclosure. The singular forms may include the plural forms unless the context clearly indicates otherwise. The terms such as “include” and “have” are intended to indicate that features, numbers, steps, operations, elements, components, or combinations thereof used in the following description exist, and thus should not be understood as that the possibility of existence or addition of one or more different features, numbers, steps, operations, elements, components, or combinations thereof is excluded in advance.
Meanwhile, each component on the drawings described herein is illustrated independently for convenience of description as to characteristic functions different from each other, and however, it is not meant that each component is realized by a separate hardware or software. For example, any two or more of these components may be combined to form a single component, and any single component may be divided into plural components. The embodiments in which components are combined and/or divided will belong to the scope of the patent right of the present disclosure as long as they do not depart from the essence of the present disclosure.
Hereinafter, preferred embodiments of the present disclosure will be explained in more detail while referring to the attached drawings. In addition, the same reference signs are used for the same components on the drawings, and repeated descriptions for the same components will be omitted.
This document relates to video/image coding. For example, the method/example disclosed in this document may relate to a VVC (Versatile Video Coding) standard (ITU-T Rec. H.266), a next-generation video/image coding standard after VVC, or other video coding related standards (e.g., HEVC (High Efficiency Video Coding) standard (ITU-T Rec. H.265), EVC (essential video coding) standard, AVS2 standard, etc.).
In this document, a variety of embodiments relating to video/image coding may be provided, and, unless specified to the contrary, the embodiments may be combined to each other and be performed.
In this document, a video may mean a set of a series of images over time. Generally a picture means a unit representing an image at a specific time zone, and a slice/tile is a unit constituting a part of the picture. The slice/tile may include one or more coding tree units (CTUs). One picture may be constituted by one or more slices/tiles. One picture may be constituted by one or more tile groups. One tile group may include one or more tiles.
A pixel or a pel may mean a smallest unit constituting one picture (or image). Also, ‘sample’ may be used as a term corresponding to a pixel. A sample may generally represent a pixel or a value of a pixel, and may represent only a pixel/pixel value of a luma component or only a pixel/pixel value of a chroma component. Alternatively, the sample may refer to a pixel value in the spatial domain, or when this pixel value is converted to the frequency domain, it may refer to a transform coefficient in the frequency domain.
A unit may represent the basic unit of image processing. The unit may include at least one of a specific region and information related to the region. One unit may include one luma block and two chroma (e.g., cb, cr) blocks. The unit and a term such as a block, an area, or the like may be used in place of each other according to circumstances. In a general case, an M×N block may include a set (or an array) of samples (or sample arrays) or transform coefficients consisting of M columns and N rows.
In this document, the term “/“and”,” should be interpreted to indicate “and/or.” For instance, the expression “A/B” may mean “A and/or B.” Further, “A, B” may mean “A and/or B.” Further, “A/B/C” may mean “at least one of A, B, and/or C.” Also, “A/B/C” may mean “at least one of A, B, and/or C.”
Further, in the document, the term “or” should be interpreted to indicate “and/or.” For instance, the expression “A or B” may include 1) only A, 2) only B, and/or 3) both A and B. In other words, the term “or” in this document should be interpreted to indicate “additionally or alternatively.”
Referring to
The source device may include a video source, an encoding apparatus, and a transmitter. The receive device may include a receiver, a decoding apparatus, and a renderer. The encoding apparatus may be called a video/image encoding apparatus, and the decoding apparatus may be called a video/image decoding apparatus. The transmitter may be included in the encoding apparatus. The receiver may be included in the decoding apparatus. The renderer may include a display, and the display may be configured as a separate device or an external component.
The video source may obtain a video/image through a process of capturing, synthesizing, or generating a video/image. The video source may include a video/image capture device and/or a video/image generating device. The video/image capture device may include, for example, one or more cameras, video/image archives including previously captured video/images, or the like. The video/image generating device may include, for example, a computer, a tablet and a smartphone, and may (electronically) generate a video/image. For example, a virtual video/image may be generated through a computer or the like. In this case, the video/image capturing process may be replaced by a process of generating related data.
The encoding apparatus may encode an input video/image. The encoding apparatus may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency. The encoded data (encoded video/image information) may be output in the form of a bitstream.
The transmitter may transmit the encoded video/image information or data output in the form of a bitstream to the receiver of the receive device through a digital storage medium or a network in the form of a file or streaming. The digital storage medium may include various storage mediums such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like. The transmitter may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast/communication network. The receiver may receive/extract the bitstream and transmit the received/extracted bitstream to the decoding apparatus.
The decoding apparatus may decode a video/image by performing a series of procedures such as dequantization, inverse transform, prediction, and the like corresponding to the operation of the encoding apparatus.
The renderer may render the decoded video/image. The rendered video/image may be displayed through the display.
Referring to
The image partitioner 210 may partition an input image (or a picture or a frame) input to the encoding apparatus 200 into one or more processing units. As one example, the processing unit may be called a coding unit (CU). In this case, starting with a coding tree unit (CTU) or the largest coding unit (LCU), the coding unit may be recursively partitioned according to the Quad-tree binary-tree ternary-tree (QTBTTT) structure. For example, one coding unit may be divided into a plurality of coding units of a deeper depth based on the quad-tree structure, the binary-tree structure, and/or the ternary structure. In this case, for example, the quad-tree structure may be applied first and the binary-tree structure and/or the ternary structure may be applied later. Alternatively, the binary-tree structure may be applied first. The coding procedure according to the present disclosure may be performed based on the final coding unit which is not further partitioned. In this case, the maximum coding unit may be used directly as a final coding unit based on coding efficiency according to the image characteristic. Alternatively, the coding unit may be recursively partitioned into coding units of a further deeper depth as needed, so that the coding unit of an optimal size may be used as a final coding unit. Here, the coding procedure may include procedures such as prediction, transform, and reconstruction, which will be described later. As another example, the processing unit may further include a prediction unit (PU) or a transform unit (TU). In this case, the prediction unit and the transform unit may be split or partitioned from the above-described final coding unit. The prediction unit may be a unit of sample prediction, and the transform unit may be a unit for deriving a transform coefficient and/or a unit for deriving a residual signal from a transform coefficient.
The unit and a term such as a block, an area, or the like may be used in place of each other according to circumstances. In a general case, an M×N block may represent a set of samples or transform coefficients consisting of M columns and N rows. The sample may generally represent a pixel or a value of a pixel, and may represent only a pixel/pixel value of a luma component, or only a pixel/pixel value of a chroma component. The sample may be used as a term corresponding to a pixel or a pel of one picture (or image).
The subtractor 231 subtracts a prediction signal (predicted block, prediction sample array) output from the inter predictor 221 or the intra predictor 222 from an input image signal (original block, original sample array) to generate a residual signal (residual block, residual sample array), and the generated residual signal is transmitted to the transformer 232. In this case, as shown, a unit which subtracts the prediction signal (predicted block, prediction sample array) from the input image signal (original block, original sample array) in the encoder 200 may be called the subtractor 231. The predictor may perform prediction on a processing target block (hereinafter, referred to as ‘current block’), and may generate a predicted block including prediction samples for the current block. The predictor may determine whether intra prediction or inter prediction is applied on a current block or CU basis. As discussed later in the description of each prediction mode, the predictor may generate various information relating to prediction, such as prediction mode information, and transmit the generated information to the entropy encoder 240. The information on the prediction may be encoded in the entropy encoder 240 and output in the form of a bitstream.
The intra predictor 222 may predict the current block by referring to samples in the current picture. The referred samples may be located in the neighbor of or apart from the current block according to the prediction mode. In the intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The non-directional modes may include, for example, a DC mode and a planar mode. The directional mode may include, for example, 33 directional prediction modes or 65 directional prediction modes according to the degree of detail of the prediction direction. However, this is merely an example, and more or less directional prediction modes may be used depending on a setting. The intra predictor 222 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
The inter predictor 221 may derive a predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on a reference picture. At this time, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted on a block, subblock, or sample basis based on correlation of motion information between the neighboring block and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (LO prediction, L 1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block existing in the reference picture. The reference picture including the reference block and the reference picture including the temporal neighboring block may be same to each other or different from each other. The temporal neighboring block may be called a collocated reference block, a collocated CU (colCU), and the like, and the reference picture including the temporal neighboring block may be called a collocated picture (colPic). For example, the inter predictor 221 may configure a motion information candidate list based on neighboring blocks and generate information indicating which candidate is used to derive a motion vector and/or a reference picture index of the current block. Inter prediction may be performed based on various prediction modes. For example, in the case of a skip mode and a merge mode, the inter predictor 221 may use motion information of the neighboring block as motion information of the current block. In the skip mode, unlike the merge mode, the residual signal may not be transmitted. In the case of the motion information prediction (motion vector prediction, MVP) mode, the motion vector of the neighboring block may be used as a motion vector predictor and the motion vector of the current block may be indicated by signaling a motion vector difference.
The predictor 220 may generate a prediction signal based on various prediction methods. For example, the predictor may apply intra prediction or inter prediction for prediction on one block, and, as well, may apply intra prediction and inter prediction at the same time. This may be called combined inter and intra prediction (CIIP). Further, the predictor may be based on an intra block copy (IBC) prediction mode, or a palette mode in order to perform prediction on a block. The IBC prediction mode or palette mode may be used for content image/video coding of a game or the like, such as screen content coding (SCC). Although the IBC basically performs prediction in a current block, it can be performed similarly to inter prediction in that it derives a reference block in a current block. That is, the IBC may use at least one of inter prediction techniques described in the present disclosure.
The prediction signal generated through the inter predictor 221 and/or the intra predictor 222 may be used to generate a reconstructed signal or to generate a residual signal. The transformer 232 may generate transform coefficients by applying a transform technique to the residual signal. For example, the transform technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a Karhunen-Loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT). Here, the GBT means transform obtained from a graph when relationship information between pixels is represented by the graph. The CNT refers to transform obtained based on a prediction signal generated using all previously reconstructed pixels. In addition, the transform process may be applied to square pixel blocks having the same size or may be applied to blocks having a variable size rather than the square one.
The quantizer 233 may quantize the transform coefficients and transmit them to the entropy encoder 240, and the entropy encoder 240 may encode the quantized signal (information on the quantized transform coefficients) and output the encoded signal in a bitstream. The information on the quantized transform coefficients may be referred to as residual information. The quantizer 233 may rearrange block type quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and generate information on the quantized transform coefficients based on the quantized transform coefficients of the one-dimensional vector form. The entropy encoder 240 may perform various encoding methods such as, for example, exponential Golomb, context-adaptive variable length coding (CAVLC), context-adaptive binary arithmetic coding (CABAC), and the like. The entropy encoder 240 may encode information necessary for video/image reconstruction other than quantized transform coefficients (e.g. values of syntax elements, etc.) together or separately. Encoded information (e.g., encoded video/image information) may be transmitted or stored on a unit basis of a network abstraction layer (NAL) in the form of a bitstream. The video/image information may further include information on various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), a video parameter set (VPS) or the like. Further, the video/image information may further include general constraint information. In the present disclosure, information and/or syntax elements which are transmitted/signaled to the decoding apparatus from the encoding apparatus may be included in video/image information. The video/image information may be encoded through the above-described encoding procedure and included in the bitstream. The bitstream may be transmitted through a network, or stored in a digital storage medium. Here, the network may include a broadcast network, a communication network and/or the like, and the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like. A transmitter (not shown) which transmits a signal output from the entropy encoder 240 and/or a storage (not shown) which stores it may be configured as an internal/external element of the encoding apparatus 200, or the transmitter may be included in the entropy encoder 240.
Quantized transform coefficients output from the quantizer 233 may be used to generate a prediction signal. For example, by applying dequantization and inverse transform to quantized transform coefficients through the dequantizer 234 and the inverse transformer 235, the residual signal (residual block or residual samples) may be reconstructed. The adder 155 adds the reconstructed residual signal to a prediction signal output from the inter predictor 221 or the intra predictor 222, so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) may be generated. When there is no residual for a processing target block as in a case where the skip mode is applied, the predicted block may be used as a reconstructed block. The adder 250 may be called a reconstructor or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next processing target block in the current block, and as described later, may be used for inter prediction of a next picture through filtering.
Meanwhile, in the picture encoding and/or reconstructing process, luma mapping with chroma scaling (LMCS) may be applied.
The filter 260 may improve subjective/objective video quality by applying the filtering to the reconstructed signal. For example, the filter 260 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and may store the modified reconstructed picture in the memory 270, specifically in the DPB of the memory 270. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter or the like. As discussed later in the description of each filtering method, the filter 260 may generate various information relating to filtering, and transmit the generated information to the entropy encoder 240. The information on the filtering may be encoded in the entropy encoder 240 and output in the form of a bitstream.
The modified reconstructed picture which has been transmitted to the memory 270 may be used as a reference picture in the inter predictor 221. Through this, the encoding apparatus can avoid prediction mismatch in the encoding apparatus 100 and a decoding apparatus when the inter prediction is applied, and can also improve coding efficiency.
The memory 270 DPB may store the modified reconstructed picture in order to use it as a reference picture in the inter predictor 221. The memory 270 may store motion information of a block in the current picture, from which motion information has been derived (or encoded) and/or motion information of blocks in an already reconstructed picture. The stored motion information may be transmitted to the inter predictor 221 to be utilized as motion information of a neighboring block or motion information of a temporal neighboring block. The memory 270 may store reconstructed samples of reconstructed blocks in the current picture, and transmit them to the intra predictor 222.
Referring to
When a bitstream including video/image information is input, the decoding apparatus 300 may reconstruct an image correspondingly to a process by which video/image information has been processed in the encoding apparatus of
The decoding apparatus 300 may receive a signal output from the encoding apparatus of
The dequantizer 321 may output transform coefficients by dequantizing the quantized transform coefficients. The dequantizer 321 may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the rearrangement may perform rearrangement based on an order of coefficient scanning which has been performed in the encoding apparatus. The dequantizer 321 may perform dequantization on the quantized transform coefficients using quantization parameter (e.g., quantization step size information), and obtain transform coefficients.
The deqauntizer 322 obtains a residual signal (residual block, residual sample array) by inverse transforming transform coefficients.
The predictor may perform prediction on the current block, and generate a predicted block including prediction samples for the current block. The predictor may determine whether intra prediction or inter prediction is applied to the current block based on the information on prediction output from the entropy decoder 310, and specifically may determine an intra/inter prediction mode.
The predictor may generate a prediction signal based on various prediction methods. For example, the predictor may apply intra prediction or inter prediction for prediction on one block, and, as well, may apply intra prediction and inter prediction at the same time. This may be called combined inter and intra prediction (CIIP). In addition, the predictor may perform intra block copy (IBC) for prediction on a block. The intra block copy may be used for content image/video coding of a game or the like, such as screen content coding (SCC). Although the IBC basically performs prediction in a current block, it can be performed similarly to inter prediction in that it derives a reference block in a current block. That is, the IBC may use at least one of inter prediction techniques described in the present disclosure.
The intra predictor 331 may predict the current block by referring to the samples in the current picture. The referred samples may be located in the neighbor of or apart from the current block according to the prediction mode. In the intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The intra predictor 331 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
The inter predictor 332 may derive a predicted block for the current block based on a reference block (reference sample array) specified by a motion vector on a reference picture. At this time, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted on a block, subblock, or sample basis based on correlation of motion information between the neighboring block and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (LO prediction, L 1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block existing in the reference picture. For example, the inter predictor 332 may configure a motion information candidate list based on neighboring blocks, and derive a motion vector and/or a reference picture index of the current block based on received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information on prediction may include information indicating a mode of inter prediction for the current block.
The adder 340 may generate a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) by adding the obtained residual signal to the prediction signal (predicted block, prediction sample array) output from the predictor 330. When there is no residual for a processing target block as in a case where the skip mode is applied, the predicted block may be used as a reconstructed block.
The adder 340 may be called a reconstructor or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next processing target block in the current block, and as described later, may be output through filtering or be used for inter prediction of a next picture.
Meanwhile, in the picture decoding process, luma mapping with chroma scaling (LMCS) may be applied.
The filter 350 may improve subjective/objective video quality by applying the filtering to the reconstructed signal. For example, the filter 350 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and may transmit the modified reconstructed picture in the memory 360, specifically in the DPB of the memory 360. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter or the like.
The (modified) reconstructed picture which has been stored in the DPB of the memory 360 may be used as a reference picture in the inter predictor 332. The memory 360 may store motion information of a block in the current picture, from which motion information has been derived (or decoded) and/or motion information of blocks in an already reconstructed picture. The stored motion information may be transmitted to the inter predictor 260 to be utilized as motion information of a neighboring block or motion information of a temporal neighboring block. The memory 360 may store reconstructed samples of reconstructed blocks in the current picture, and transmit them to the intra predictor 331.
In this specification, the examples described in the predictor 330, the dequantizer 321, the inverse transformer 322, and the filter 350 of the decoding apparatus 300 may be similarly or correspondingly applied to the predictor 220, the dequantizer 234, the inverse transformer 235, and the filter 260 of the encoding apparatus 200, respectively.
As described above, prediction is performed in order to increase compression efficiency in performing video coding. Through this, a predicted block including prediction samples for a current block, which is a coding target block, may be generated. Here, the predicted block includes prediction samples in a space domain (or pixel domain). The predicted block may be identically derived in the encoding apparatus and the decoding apparatus, and the encoding apparatus may increase image coding efficiency by signaling to the decoding apparatus not original sample value of an original block itself but information on residual (residual information) between the original block and the predicted block. The decoding apparatus may derive a residual block including residual samples based on the residual information, generate a reconstructed block including reconstructed samples by adding the residual block to the predicted block, and generate a reconstructed picture including reconstructed blocks.
The residual information may be generated through transform and quantization procedures. For example, the encoding apparatus may derive a residual block between the original block and the predicted block, derive transform coefficients by performing a transform procedure on residual samples (residual sample array) included in the residual block, and derive quantized transform coefficients by performing a quantization procedure on the transform coefficients, so that it may signal associated residual information to the decoding apparatus (through a bitstream). Here, the residual information may include value information, position information, a transform technique, transform kernel, a quantization parameter or the like of the quantized transform coefficients. The decoding apparatus may perform a quantization/dequantization procedure and derive the residual samples (or residual sample block), based on residual information. The decoding apparatus may generate a reconstructed block based on a predicted block and the residual block. The encoding apparatus may derive a residual block by dequantizing/inverse transforming quantized transform coefficients for reference for inter prediction of a next picture, and may generate a reconstructed picture based on this.
Referring to
The transformer may derive (primary) transform coefficients by performing a primary transform based on residual samples (residual sample array) in a residual block (S410). This primary transform may be referred to as a core transform. Herein, the primary transform may be based on multiple transform selection (MTS), and when a multiple transform is applied as the primary transform, it may be referred to as a multiple core transform.
The multiple core transform may represent a method of transforming additionally using discrete cosine transform (DCT) type 2 and discrete sine transform (DST) type 7, DCT type 8, and/or DST type 1. That is, the multiple core transform may represent a transform method of transforming a residual signal (or residual block) of a space domain into transform coefficients (or primary transform coefficients) of a frequency domain based on a plurality of transform kernels selected from among the DCT type 2, the DST type 7, the DCT type 8 and the DST type 1. Herein, the primary transform coefficients may be called temporary transform coefficients from the viewpoint of the transformer.
In other words, when the conventional transform method is applied, transform coefficients might be generated by applying transform from a space domain to a frequency domain for a residual signal (or residual block) based on the DCT type 2. Unlike to this, when the multiple core transform is applied, transform coefficients (or primary transform coefficients) may be generated by applying transform from a space domain to a frequency domain for a residual signal (or residual block) based on the DCT type 2, the DST type 7, the DCT type 8, and/or DST type 1. Herein, the DCT type 2, the DST type 7, the DCT type 8, and the DST type 1 may be called a transform type, transform kernel or transform core.
For reference, the DCT/DST transform types may be defined based on basis functions, and the basis functions may be represented as in the following table.
If the multiple core transform is performed, then a vertical transform kernel and a horizontal transform kernel for a target block may be selected from among the transform kernels, a vertical transform for the target block may be performed based on the vertical transform kernel, and a horizontal transform for the target block may be performed based on the horizontal transform kernel. Here, the horizontal transform may represent a transform for horizontal components of the target block, and the vertical transform may represent a transform for vertical components of the target block. The vertical transform kernel/horizontal transform kernel may be adaptively determined based on a prediction mode and/or a transform index of a target block (CU or sub-block) including a residual block.
Further, according to an example, if the primary transform is performed by applying the MTS, a mapping relationship for transform kernels may be set by setting specific basis functions to predetermined values and combining basis functions to be applied in the vertical transform or the horizontal transform. For example, when the horizontal transform kernel is expressed as trTypeHor and the vertical direction transform kernel is expressed as trTypeVer, a trTypeHor or trTypeVer value of 0 may be set to DCT2, a trTypeHor or trTypeVer value of 1 may be set to DST7, and a trTypeHor or trTypeVer value of 2 may be set to DCT8.
In this case, MTS index information may be encoded and signaled to the decoding apparatus to indicate any one of a plurality of transform kernel sets. For example, an MTS index of 0 may indicate that both trTypeHor and trTypeVer values are 0, an MTS index of 1 may indicate that both trTypeHor and trTypeVer values are 1, an MTS index of 2 may indicate that the trTypeHor value is 2 and the trTypeVer value. Is 1, an MTS index of 3 may indicate that the trTypeHor value is 1 and the trTypeVer value is 2, and an MTS index of 4 may indicate that both both trTypeHor and trTypeVer values are 2.
The transformer may derive modified (secondary) transform coefficients by performing the secondary transform based on the (primary) transform coefficients (S420). The primary transform is a transform from a spatial domain to a frequency domain, and the secondary transform refers to transforming into a more compressive expression by using a correlation existing between (primary) transform coefficients. The secondary transform may include a non-separable transform. In this case, the secondary transform may be called a non-separable secondary transform (NSST), or a mode-dependent non-separable secondary transform (MDNSST). The non-separable secondary transform may represent a transform which generates modified transform coefficients (or secondary transform coefficients) for a residual signal by secondary-transforming, based on a non-separable transform matrix, (primary) transform coefficients derived through the primary transform. At this time, the vertical transform and the horizontal transform may not be applied separately (or horizontal and vertical transforms may not be applied independently) to the (primary) transform coefficients, but the transforms may be applied at once based on the non-separable transform matrix. In other words, the non-separable secondary transform may represent a transform method in which the vertical and horizontal components of the (primary) transform coefficients are not separated, and for example, two-dimensional signals (transform coefficients) are rearranged to a one-dimensional signal through a certain determined direction (e.g., row-first direction or column-first direction), and then modified transform coefficients (or secondary transform coefficients) are generated based on the non-separable transform matrix. For example, according to a row-first order, M×N blocks are disposed in a line in an order of a first row, a second row, . . . , and an Nth row. According to a column-first order, M×N blocks are disposed in a line in an order of a first column, a second column, . . . , and an Nth column. The non-separable secondary transform may be applied to a top-left region of a block configured with (primary) transform coefficients (hereinafter, may be referred to as a transform coefficient block). For example, if the width (W) and the height (H) of the transform coefficient block are all equal to or greater than 8, an 8×8 non-separable secondary transform may be applied to a top-left 8×8 region of the transform coefficient block. Further, if the width (W) and the height (H) of the transform coefficient block are all equal to or greater than 4, and the width (W) or the height (H) of the transform coefficient block is less than 8, then a 4×4 non-separable secondary transform may be applied to a top-left min(8.W)×min(8,H) region of the transform coefficient block. However, the embodiment is not limited to this, and for example, even if only the condition that the width (W) or height (H) of the transform coefficient block is equal to or greater than 4 is satisfied, the 4×4 non-separable secondary transform may be applied to the top-left min(8.W)×min(8,H) region of the transform coefficient block.
Specifically, for example, if a 4×4 input block is used, the non-separable secondary transform may be performed as follows.
The 4×4 input block X may be represented as follows.
If the X is represented in the form of a vector, the vector may be represented as below.
=[X00 X01 X02 X03 X10 X11 X12 X13 X20 X21 X22 X23 X30 X31 X32 X33]T [Equation 2]
In Equation 2, the vector is a one-dimensional vector obtained by rearranging the two-dimensional block X of Equation 1 according to the row-first order.
In this case, the secondary non-separable transform may be calculated as below.=T·
[Equation 3]
In this equation, represents a transform coefficient vector, and T represents a 16×16 (non-separable) transform matrix.
Through foregoing Equation 3, a 16×1 transform coefficient vector may be derived, and the
may be re-organized into a 4×4 block through a scan order (horizontal, vertical, diagonal and the like). However, the above-described calculation is an example, and hypercube-Givens transform (HyGT) or the like may be used for the calculation of the non-separable secondary transform in order to reduce the computational complexity of the non-separable secondary transform.
Meanwhile, in the non-separable secondary transform, a transform kernel (or transform core, transform type) may be selected to be mode dependent. In this case, the mode may include the intra prediction mode and/or the inter prediction mode.
As described above, the non-separable secondary transform may be performed based on an 8×8 transform or a 4×4 transform determined based on the width (W) and the height (H) of the transform coefficient block. The 8×8 transform refers to a transform that is applicable to an 8×8 region included in the transform coefficient block when both W and H are equal to or greater than 8, and the 8×8 region may be a top-left 8×8 region in the transform coefficient block. Similarly, the 4×4 transform refers to a transform that is applicable to a 4×4 region included in the transform coefficient block when both W and H are equal to or greater than 4, and the 4×4 region may be a top-left 4×4 region in the transform coefficient block. For example, an 8×8 transform kernel matrix may be a 64×64/16×64 matrix, and a 4×4 transform kernel matrix may be a 16×16/8×16 matrix.
Here, to select a mode-based transform kernel, three non-separable secondary transform kernels may be configured per transform set for the non-separable secondary transform for both the 8×8 transform and the 4×4 transform, and there may be 35 transform sets. That is, 35 transform sets may be configured for the 8×8 transform, and 35 transform sets may be configured for the 4×4 transform. In this case, three 8×8 transform kernels may be included in each of the 35 transform sets for the 8×8 transform, and three 4×4 transform kernels may be included in each of the 35 transform sets for the 4×4 transform. The sizes of the transforms, the numbers of sets, and the numbers of transform kernels in each set mentioned above are merely for illustration. Instead, a size other than 8×8 or 4×4 may be used, n sets may be configured, and k transform kernels may be included in each set.
The transform set may be called an NSST set, and the transform kernel in the NSST set may be called an NSST kernel. The selection of a specific set from among the transform sets may be performed, for example, based on the intra prediction mode of the target block (CU or sub-block).
For reference, as an example, the intra prediction mode may include two non-directional (or non-angular) intra prediction modes and 65 directional (or angular) intra prediction modes. The non-directional intra prediction modes may include a No. 0 planar intra prediction mode, and a No. 1 DC intra prediction mode, and the directional intra prediction modes may include 65 intra prediction modes between a No. 2 intra prediction mode and a No. 66 intra prediction mode. However, this is an example, and the present disclosure may be applied to a case where there are different number of intra prediction modes. Meanwhile, according to circumstances, a No. 67 intra prediction mode may be further used, and the No. 67 intra prediction mode may represent a linear model (LM) mode.
Referring to
In this case, mapping between the 35 transform sets and the intra prediction modes may be, for example, represented as in the following table. For reference, if an LM mode is applied to a target block, the secondary transform may not be applied to the target block.
Meanwhile, if a specific set is determined to be used, one of k transform kernels in the specific set may be selected through the non-separable secondary transform index. The encoding apparatus may derive a non-separable secondary transform index indicating a specific transform kernel based on the rate-distortion (RD) check, and may signal the non-separable secondary transform index to the decoding apparatus. The decoding apparatus may select one from among k transform kernels in the specific set based on the non-separable secondary transform index. For example, the NSST index value 0 may indicate a first non-separable secondary transform kernel, the NSST index value 1 may indicate a second non-separable secondary transform kernel, and the NSST index value 2 may indicate a third non-separable secondary transform kernel. Alternatively, the NSST index value 0 may indicate that the first non-separable secondary transform is not applied to a target block, and the NSST index values 1 to 3 may indicate the three transform kernels.
Referring back to
Meanwhile, as described above, if the secondary transform is omitted, (primary) transform coefficients, which are an output of the primary (separable) transform, may be derived as transform coefficients quantized through the quantizer as described above, and may be encoded and signaled to the decoding apparatus and transferred to the dequantizer/inverse transformer in the encoding apparatus.
The inverse transformer may perform a series of procedures in the inverse order to that in which they have been performed in the above-described transformer. The inverse transformer may receive (dequantized) transformer coefficients, and derive (primary) transform coefficients by performing a secondary (inverse) transform (S450), and may obtain a residual block (residual samples) by performing a primary (inverse) transform on the (primary) transform coefficients (S460). In this connection, the primary transform coefficients may be called modified transform coefficients from the viewpoint of the inverse transformer. As described above, the encoding apparatus and the decoding apparatus may generate the reconstructed block based on the residual block and the predicted block, and may generate the reconstructed picture based on the reconstructed block.
The decoding apparatus may further include a secondary inverse transform application determinator (or an element to determine whether to apply a secondary inverse transform) and a secondary inverse transform determinator (or an element to determine a secondary inverse transform). The secondary inverse transform application determinator may determine whether to apply a secondary inverse transform. For example, the secondary inverse transform may be an NSST or an RST, and the secondary inverse transform application determinator may determine whether to apply the secondary inverse transform based on a secondary transform flag obtained by parsing the bitstream. In another example, the secondary inverse transform application determinator may determine whether to apply the secondary inverse transform based on a transform coefficient of a residual block.
The secondary inverse transform determinator may determine a secondary inverse transform. In this case, the secondary inverse transform determinator may determine the secondary inverse transform applied to the current block based on an NSST (or RST) transform set specified according to an intra prediction mode. In an embodiment, a secondary transform determination method may be determined depending on a primary transform determination method. Various combinations of primary transforms and secondary transforms may be determined according to the intra prediction mode. Further, in an example, the secondary inverse transform determinator may determine a region to which a secondary inverse transform is applied based on the size of the current block.
Meanwhile, as described above, if the secondary (inverse) transform is omitted, (dequantized) transform coefficients may be received, the primary (separable) inverse transform may be performed, and the residual block (residual samples) may be obtained. As described above, the encoding apparatus and the decoding apparatus may generate the reconstructed block based on the residual block and the predicted block, and may generate the reconstructed picture based on the reconstructed block.
Meanwhile, in the present disclosure, a reduced secondary transform (RST) in which the size of a transform matrix (kernel) is reduced may be applied in the concept of NSST in order to reduce the amount of computation and memory required for the non-separable secondary transform.
Meanwhile, the transform kernel, the transform matrix, and the coefficient constituting the transform kernel matrix, that is, the kernel coefficient or the matrix coefficient, described in the present disclosure may be expressed in 8 bits. This may be a condition for implementation in the decoding apparatus and the encoding apparatus, and may reduce the amount of memory required to store the transform kernel with a performance degradation that can be reasonably accommodated compared to the existing 9 bits or 10 bits. In addition, the expressing of the kernel matrix in 8 bits may allow a small multiplier to be used, and may be more suitable for single instruction multiple data (SIMD) instructions used for optimal software implementation.
In the present specification, the term “RST” may mean a transform which is performed on residual samples for a target block based on a transform matrix whose size is reduced according to a reduced factor. In the case of performing the reduced transform, the amount of computation required for transform may be reduced due to a reduction in the size of the transform matrix. That is, the RST may be used to address the computational complexity issue occurring at the non-separable transform or the transform of a block of a great size.
RST may be referred to as various terms, such as reduced transform, reduced secondary transform, reduction transform, simplified transform, simple transform, and the like, and the name which RST may be referred to as is not limited to the listed examples. Alternatively, since the RST is mainly performed in a low frequency region including a non-zero coefficient in a transform block, it may be referred to as a Low-Frequency Non-Separable Transform (LFNST).
Meanwhile, when the secondary inverse transform is performed based on RST, the inverse transformer 235 of the encoding apparatus 200 and the inverse transformer 322 of the decoding apparatus 300 may include an inverse reduced secondary transformer which derives modified transform coefficients based on the inverse RST of the transform coefficients, and an inverse primary transformer which derives residual samples for the target block based on the inverse primary transform of the modified transform coefficients. The inverse primary transform refers to the inverse transform of the primary transform applied to the residual. In the present disclosure, deriving a transform coefficient based on a transform may refer to deriving a transform coefficient by applying the transform.
In the present specification, the term “target block” may mean a current block or a residual block on which coding is performed.
In the RST according to an example, an N-dimensional vector may be mapped to an R-dimensional vector located in another space, so that the reduced transform matrix may be determined, where R is less than N. N may mean the square of the length of a side of a block to which the transform is applied, or the total number of transform coefficients corresponding to a block to which the transform is applied, and the reduced factor may mean an R/N value. The reduced factor may be referred to as a reduced factor, reduction factor, simplified factor, simple factor or other various terms. Meanwhile, R may be referred to as a reduced coefficient, but according to circumstances, the reduced factor may mean R. Further, according to circumstances, the reduced factor may mean the N/R value.
In an example, the reduced factor or the reduced coefficient may be signaled through a bitstream, but the example is not limited to this. For example, a predefined value for the reduced factor or the reduced coefficient may be stored in each of the encoding apparatus 200 and the decoding apparatus 300, and in this case, the reduced factor or the reduced coefficient may not be signaled separately.
The size of the reduced transform matrix according to an example may be R×N less than N×N, the size of a conventional transform matrix, and may be defined as in Equation 4 below.
The matrix T in the Reduced Transform block shown in
In an example, if the size of the block to which the transform is applied is 8×8 and R=16 (i. E., R/N=16/64=1/4), then the RST according to
In this document, matrix operation can be understood as an operation to obtain a column vector by multiplying the matrix and the column vector by placing the matrix on the left side of the column vector.
In Equation 5, r1 to r64 may represent residual samples for the target block and may be specifically transform coefficients generated by applying a primary transform. As a result of the calculation of Equation 5, transform coefficients ci for the target block may be derived, and a process of deriving ci may be as in Equation 6.
for i from to R:
ci=0
for j from 1 to N
ci+=tij*rj [Equation 6]
As a result of the calculation of Equation 6, transform coefficients c1 to CR for the target block may be derived. That is, when R=16, transform coefficients c1 to c16 for the target block may be derived. If, instead of RST, a regular transform is applied and a transform matrix of 64×64 (N×N) size is multiplied to residual samples of 64×1 (N×1) size, then only 16 (R) transform coefficients are derived for the target block because RST was applied, although 64 (N) transform coefficients are derived for the target block. Since the total number of transform coefficients for the target block is reduced from N to R, the amount of data transmitted by the encoding apparatus 200 to the decoding apparatus 300 decreases, so efficiency of transmission between the encoding apparatus 200 and the decoding apparatus 300 can be improved.
When considered from the viewpoint of the size of the transform matrix, the size of the regular transform matrix is 64×64 (N×N), but the size of the reduced transform matrix is reduced to 16×64 (R×N), so memory usage in a case of performing the RST can be reduced by an R/N ratio when compared with a case of performing the regular transform. In addition, when compared to the number of multiplication calculations N×N in a case of using the regular transform matrix, the use of the reduced transform matrix can reduce the number of multiplication calculations by the R/N ratio (R×N).
In an example, the transformer 232 of the encoding apparatus 200 may derive transform coefficients for the target block by performing the primary transform and the RST-based secondary transform on residual samples for the target block. These transform coefficients may be transferred to the inverse transformer of the decoding apparatus 300, and the inverse transformer 322 of the decoding apparatus 300 may derive the modified transform coefficients based on the inverse reduced secondary transform (RST) for the transform coefficients, and may derive residual samples for the target block based on the inverse primary transform for the modified transform coefficients.
The size of the inverse RST matrix TN×R according to an example is N×R less than the size N×N of the regular inverse transform matrix, and is in a transpose relationship with the reduced transform matrix TR×N shown in Equation 4.
The matrix Tt in the Reduced Inv. Transform block shown in
More specifically, when the inverse RST is applied as the secondary inverse transform, the modified transform coefficients for the target block may be derived when the inverse RST matrix TR×NT is multiplied to the transform coefficients for the target block. Meanwhile, the inverse RST may be applied as the inverse primary transform, and in this case, the residual samples for the target block may be derived when the inverse RST matrix TR×NT is multiplied to the transform coefficients for the target block.
In an example, if the size of the block to which the inverse transform is applied is 8×8 and R=16 (i. E., R/N=16/64=1/4), then the RST according to
In Equation 7, c1 to c16 may represent the transform coefficients for the target block. As a result of the calculation of Equation 7, rj representing the modified transform coefficients for the target block or the residual samples for the target block may be derived, and the process of deriving rj may be as in Equation 8.
for i from to N:
n=0
for j from 1 to R
ri×=tji*cj [Equation 8]
As a result of the calculation of Equation 8, r1 to rN representing the modified transform coefficients for the target block or the residual samples for the target block may be derived. When considered from the viewpoint of the size of the inverse transform matrix, the size of the regular inverse transform matrix is 64×64 (N×N), but the size of the reduced inverse transform matrix is reduced to 64×16 (R×N), so memory usage in a case of performing the inverse RST can be reduced by an R/N ratio when compared with a case of performing the regular inverse transform. In addition, when compared to the number of multiplication calculations N×N in a case of using the regular inverse transform matrix, the use of the reduced inverse transform matrix can reduce the number of multiplication calculations by the R/N ratio (N×R).
A transform set configuration shown in Table 2 may also be applied to an 8×8 RST. That is, the 8×8 RST may be applied according to a transform set in Table 2. Since one transform set includes two or three transforms (kernels) according to an intra prediction mode, it may be configured to select one of up to four transforms including that in a case where no secondary transform is applied. In a transform where no secondary transform is applied, it may be considered to apply an identity matrix. Assuming that indexes 0, 1, 2, and 3 are respectively assigned to the four transforms (e.g., index 0 may be allocated to a case where an identity matrix is applied, that is, a case where no secondary transform is applied), an NSST index as a syntax element may be signaled for each transform coefficient block, thereby designating a transform to be applied. That is, through the NSST index, it is possible to designate an 8×8 NSST for atop-left 8×8 block and to designate an 8×8 RST in an RST configuration. The 8×8 NSST and the 8×8 RST refer to transforms applicable to an 8×8 region included in the transform coefficient block when both W and H of the target block to be transformed are equal to or greater than 8, and the 8×8 region may be a top-left 8×8 region in the transform coefficient block. Similarly, a 4×4 NSST and a 4×4 RST refer to transforms applicable to a 4×4 region included in the transform coefficient block when both W and H of the target block to are equal to or greater than 4, and the 4×4 region may be a top-left 4×4 region in the transform coefficient block.
If the (forward) 8×8 RST illustrated in Equation 4 is applied, 16 significant transform coefficients are generated. Thus, it is considered that 64 pieces of input data forming the 8×8 region is reduced to 16 pieces of output data, and only 1/4 of the region is filled with significant transform coefficients from the perspective of a two-dimensional region. Accordingly, the 16 pieces of output data obtained by applying the forward 8×8 RST, may fill exemplary the top-left region(transform coefficients 1 to 16, i. E., c1, c2, . . . , c16 obtained through Equation 6) of the block as shown in
In
That is, when an 8×8 RST with a 16×64 forward transform matrix is applied to the 8×8 region, output transform coefficients may be arranged in the top-left 4×4 region, and the region where no output transform coefficient exists may be filled with 0s (from the 64th to 17th transform coefficients) according to the scanning order of
If a non-zero significant transform coefficient is found outside the ROI of
The present disclosure discloses methods for optimizing a design and an association of an RST that can be applied to a 4×4 block from an RST structure described in this embodiment. Some concepts can be applied not only to a 4×4 RST but also to an 8×8 RST or other types of transforms.
Each operation disclosed in
In an embodiment, the specific operations according to the inverse RST may be different from the specific operations according to the RST only in that their operation orders are opposite to each other, and the specific operations according to the inverse RST may be substantially similar to the specific operations according to the RST. Accordingly, a person skilled in the art will readily understand that the descriptions of S800 to S820 for the inverse RST described below may be applied to the RST in the same or similar manner.
The decoding apparatus 300 according to an embodiment may derive the transform coefficients by performing dequantization on the quantized transform coefficients for the target block (S800).
The decoding apparatus 300 may determine whether to apply an inverse secondary transform after an inverse primary transform and before the inverse secondary transform. For example, the inverse secondary transform may be an NSST or an RST. For example, the decoding apparatus may determine whether to apply the inverse secondary transform based on a secondary transform flag parsed from a bitstream. In another example, the decoding apparatus may determine whether to apply the inverse secondary transform based on a transform coefficient of a residual block.
The decoding apparatus 300 may determine an inverse secondary transform. In this case, the decoding apparatus 300 may determine the secondary inverse transform applied to the current block based on an NSST (or RST) transform set specified according to an intra prediction mode. In an embodiment, a secondary transform determination method may be determined depending on a primary transform determination method. For example, it may be determined to apply an RST or LFNST only when DCT-2 is applied as a transform kernel in the primary transform. Alternatively, various combinations of primary transforms and secondary transforms may be determined according to the intra prediction mode.
Further, in an example, the decoding apparatus 300 may determine a region to which the inverse secondary transform is applied based on the size of the current block before determining the inverse secondary transform.
The decoding apparatus 300 according to an embodiment may select a transform kernel (S810). More specifically, the decoding apparatus 300 may select the transform kernel based on at least one of information on a transform index, a width and height of a region to which the transform is applied, an intra prediction mode used in image decoding, and a color component of the target block. However, the example is not limited to this, and for example, the transform kernel may be predefined, and separate information for selecting the transform kernel may not be signaled.
In one example, information on the color component of the target block may be indicated through CIdx. If the target block is a luma block, CIdx may indicate 0, and if the target block is a chroma block, for example, a Cb block or a Cr block, then CIdx may indicate a non-zero value (for example, 1).
The decoding apparatus 300 according to an embodiment may apply the inverse RST to transform coefficients based on the selected transform kernel and the reduced factor (S820).
Hereinafter, a method for determining a secondary NSST set, that is, a secondary transform set or a transform set, in view of an intra prediction mode and the size of a block according to an embodiment of the present disclosure is proposed.
In an embodiment, a set for a current transform block may be configured based on the intra prediction mode described above, thereby applying a transform set including transform kernels having various sizes to the transform block. Transform sets in Table 3 are expressed using 0 to 3 as in Table 4.
Indexes 0, 2, 18, and 34 illustrated in Table 3 correspond to 0, 1, 2, and 3 in Table 4, respectively. In Table 3 and Table 4, only four transform sets are used instead of 35 transform sets, thereby significantly reducing memory space.
Various numbers of transform kernel matrices that may be included in each transform set may be set as shown in the following tables.
According to Table 5, two available transform kernels are used for each transform set, and accordingly a transform index ranges from 0 to 2.
According to Table 6, two available transform kernels are used for transform set 0, that is, a transform set according to a DC mode and a planar mode among intra prediction modes, and one transform kernel is used for each of the remaining transform sets. Here, an available transform index for transform set 1 ranges from 0 to 2, and a transform index for the remaining transform sets 1 to 3 ranges from 0 to 1.
According to Table 7, one available transform kernel is used for each transform set, and accordingly a transform index ranges from 0 to 1.
In transform set mapping of Table 3, a total of four transform sets may be used, and the four transform sets may be rearranged to be distinguished by indexes 0, 1, 2, and 3 as shown in Table 4. Table 8 and Table 9 illustrate four transform sets available for secondary transform, wherein Table 8 presents transform kernel matrices applicable to an 8×8 block, and Table 9 presents transform kernel matrices applicable to a 4×4 block. Table 8 and Table 9 include two transform kernel matrices per transform set, and two transform kernel matrices may be applied to all intra prediction modes as shown in Table 5.
All of the illustrative transform kernel matrices shown in Table 8 are transform kernel matrices multiplied by 128 as a scaling value. In a g_aiNsst8×8[N1][N2][16][64] array present in matrix arrays of Table 8, N1 denotes the number of transform sets (N1 is 4 or 35, distinguished by index 0, 1, . . . , and N1−1), N2 denotes the number (1 or 2) of transform kernel matrices included in each transform set, and [16][64] denotes a 16×64 reduced secondary transform (RST).
As shown in Table 3 and Table 4, when a transform set includes one transform kernel matrix, either a first transform kernel matrix or a second transform kernel matrix may be used for the transform set in Table 8.
While 16 transform coefficients are output when the RST is applied, only m transform coefficients may be output when only an m×64 portion of a 16×64 matrix is applied. For example, when only eight transform coefficients are output by setting m=8 and multiplying only an 8×64 matrix from the top, it is possible to reduce computational amount by half. To reduce computational amount in a worst case, an 8×64 matrix may be applied to an 8×8 transform unit (TU).
An m×64 transform matrix applicable to an 8×8 region (m≤16, e.g., the transform kernel matrices in Table 8) receives 64 pieces of data and generates m coefficients. That is, as shown in Equation 5, when the 64 pieces of data form a 64×1 vector, an m×1 vector is generated by sequentially multiplying an m×64 matrix and a 64×1 vector. Here, the 64 pieces of data forming the 8×8 region may be properly arranged to form a 64×1 vector. For example, as shown in Table 10, the data may be arranged in the order of indexes indicated at respective positions in the 8×8 region.
As shown in Table 10, the data is arranged in the row-first direction in the 8×8 region for a secondary transform. This order refers to an order in which two-dimensional data is one-dimensionally arranged for a secondary transform, specifically an RST or an LFNST, and may be applied to a forward secondary transform performed in an encoding apparatus. Accordingly, in an inverse secondary transform performed by the inverse transformer of the encoding apparatus or the inverse transformer of the decoding apparatus, transform coefficients generated as a result of the transform, that is, primary transform coefficients, may be two-dimensionally arranged as shown in Table 10.
When there are 67 intra prediction modes as shown in
As shown in Table 11, the data is arranged in the column-first direction in the 8×8 region for a secondary transform. This order refers to an order in which two-dimensional data is one-dimensionally arranged for a secondary transform, specifically an RST or an LFNST, and may be applied to a forward secondary transform performed in an encoding apparatus. Accordingly, in an inverse secondary transform performed by the inverse transformer of the encoding apparatus or the inverse transformer of the decoding apparatus, transform coefficients generated as a result of the transform, that is, primary transform coefficients, may be two-dimensionally arranged as shown in Table 11.
Table 11 shows that, for intra prediction mode (66−n), that is, for modes 35 to 66, a 64×1 input vector may be configured for according to the column-first direction.
In summary, the same transform kernel matrix shown in Table 8 may be applied while symmetrically arranging input data for mode (2+n) according to the row-first direction and input data for mode (66−n) (0≤n≤31) according to the column-first direction. A transform kernel matrix to be applied in each mode is shown in Table 5 to Table 7. Here, either the arrangement order shown in Table 10 or the arrangement order shown in Table 11 may be applied for the planar mode of intra prediction mode 0, the DC mode of intra prediction mode 1, and intra prediction mode 34. For example, for intra prediction mode 34, input data may be arranged according to the row-first direction as shown in Table 10.
According to another example, all of the illustrative transform kernel matrices shown in Table 9 applicable to a 4×4 region are transform kernel matrices multiplied by 128 as a scaling value. In a g_aiNsst4×4[N1][N2][16][64] array present in matrix arrays of Table 9, N1 denotes the number of transform sets (N1 is 4 or 35, distinguished by index 0, 1, . . . , and N1−1), N2 denotes the number (1 or 2) of transform kernel matrices included in each transform set, and [16][16] denotes a 16×16 transform.
As shown in Table 3 and Table 4, when a transform set includes one transform kernel matrix, either a first transform kernel matrix or a second transform kernel matrix may be used for the transform set in Table 9.
As in the 8×8 RST, only m transform coefficients may be output when only an m×16 portion of a 16×16 matrix is applied. For example, when only eight transform coefficients are output by setting m=8 and multiplying only an 8×16 matrix from the top, it is possible to reduce computational amount by half. To reduce computational amount in a worst case, an 8×16 matrix may be applied to a 4×4 transform unit (TU).
Basically, the transform kernel matrices applicable to a 4×4 region, presented in Table 9, may be applied to a 4×4 TU, a 4×M TU, and an M×4 TU(M>4, the 4×M TU and the M×4 TU may be divided into 4×4 regions, to which each designated transform kernel matrix may be applied, or the transform kernel matrices may be applied only to a maximum top-left 4×8 or 8×4 region) or may be applied only to a top-left 4×4 region. If the secondary transform is configured to be applied only to the top-left 4×4 region, the transform kernel matrices applicable to an 8×8 region, shown in Table 8, may be unnecessary.
An m×16 transform matrix applicable to a 4×4 region (m≤16, e.g., the transform kernel matrices in Table 9) receives 16 pieces of data and generates m coefficients. That is, when the 16 pieces of data form a 16×1 vector, an m×1 vector is generated by sequentially multiplying an m×16 matrix and a 16×1 vector. Here, the 16 pieces of data forming the 4×4 region may be properly arranged to form a 16×1 vector. For example, as shown in Table 12, the data may be arranged in the order of indexes indicated at respective positions in the 4×4 region.
As shown in Table 12, the data is arranged in the row-first direction in the 4×4 region for a secondary transform. This order refers to an order in which two-dimensional data is one-dimensionally arranged for a secondary transform, specifically an RST or an LFNST, and may be applied to a forward secondary transform performed in an encoding apparatus. Accordingly, in an inverse secondary transform performed by the inverse transformer of the encoding apparatus or the inverse transformer of the decoding apparatus, transform coefficients generated as a result of the transform, that is, primary transform coefficients, may be two-dimensionally arranged as shown in Table 12.
When there are 67 intra prediction modes as shown in
As shown in Table 13, the data is arranged in the column-first direction in the 4×4 region for a secondary transform. This order refers to an order in which two-dimensional data is one-dimensionally arranged for a secondary transform, specifically an RST or an LFNST, and may be applied to a forward secondary transform performed in an encoding apparatus. Accordingly, in an inverse secondary transform performed by the inverse transformer of the encoding apparatus or the inverse transformer of the decoding apparatus, transform coefficients generated as a result of the transform, that is, primary transform coefficients, may be two-dimensionally arranged as shown in Table 13.
Table 13 shows that, for intra prediction mode (66−n), that is, for modes 35 to 66, a 16×1 input vector may be configured for according to the column-first direction.
In summary, the same transform kernel matrices shown in Table 9 may be applied while symmetrically arranging input data for mode (2+n) according to the row-first direction and input data for mode (66−n) (0≤n≤31) according to the column-first direction. A transform kernel matrix to be applied in each mode is shown in Table 5 to Table 7. Here, either the arrangement order shown in Table 12 or the arrangement order shown in Table 13 may be applied for the planar mode of intra prediction mode 0, the DC mode of intra prediction mode 1, and intra prediction mode 34. For example, for intra prediction mode 34, input data may be arranged according to the row-first direction as shown in Table 12.
On the other hand, according to another embodiment of this document, for 64 pieces of data forming an 8×8 region, not the maximum 16×64 transform kernel matrix in Tables 8 and 9, but a maximum of 16×48 kernel matrix can be applied by selecting only 48 pieces of data. Here, “maximum” means that the maximum value of m is 16 for an mx 48 transform kernel matrix capable of generating m coefficients.
A 16×48 transform kernel matrix according to the present embodiment may be represented as shown in Table 14.
When the RST is performed by applying an m×48 transform matrix (m≤16) to an 8×8 region, 64 pieces of data are inputted and m coefficients may be generated. Table 14 shows an example of a transform kernel matrix when m is 16, and 48 pieces of data is inputted and 16 coefficients are generated. That is, assuming that 48 pieces of data form a 48×1 vector, a 16×1 vector may be generated by sequentially multiplying a 16×48 matrix and a 48×1 vector. At this time, 48 pieces of data forming an 8×8 region may be properly arranged to form a 48×1 vector, and the input data can be arranged in the following order.
When the RST is performed, as shown in Table 14, when a matrix operation is performed by applying a maximum 16×48 transform kernel matrix, 16 modified transform coefficients are generate, the 16 modified transform coefficients can be arranged in the top-left 4×4 region according to the scanning order, and the top-right 4×4 region and the bottom-left 4×4 region can be filled with zeros. Table 16 shows an example of the arrangement order of 16 modified transform coefficients generated through the matrix operation.
As shown in Table 16, the modified transform coefficient generated when the maximum 16×48 transform kernel matrix is applied can be filled in the top-left 4×4 region according to the scanning order. In this case, the number of each position in the top-left 4×4 region indicates the scanning order. Typically, the coefficient generated from an inner product operation of the topmost row of the 16×48 transform kernel matrix and the 48×1 input column vector is the first in the scanning order. In this case, the direction of going down to the bottom row and the scanning order may match. For example, a coefficient generated from the inner product operation between a 48×1 input column vector and an n-th row from the top becomes the n-th in the scanning order.
In the case of the maximum 16×48 transform kernel matrix, the 4×4 region in the top-right of Table 16 is the area to which the secondary transformation is not applied, so the original input data (primary transform coefficient) is preserved as it is, and the 4×4 region in the top-right 4×4 region and the bottom-left 4×4 region will be filled with zeros.
In addition, according to another embodiment, a scanning order other than the scanning order shown in Table 16 may also be applied. For example, a row-first direction or a column first direction may be applied as a scanning order.
In addition, even if the 16×64 transform kernel matrix shown in Table 8 is applied, 16 transform coefficients are equally generated, so the 16 transform coefficients can be arranged in the scanning order shown in Table 16 and in the case of applying the 16×64 transform kernel matrix since the matrix operation is performed using all 64 input data instead of 48, zeros are filled in all 4×4 regions except for the top-right 4×4 region. Also in this case, the scanning order in the diagonal direction as shown in Table 16 may be applied, and other scanning order such as the row first direction or the column first direction be applied.
On the other hand, when inverse RST or LFNST is performed as an inverse transformation process performed by the decoding apparatus, the input coefficient data to which the inverse RST is applied are composed of a 1-D vector according to the arrangement order of Table 16, and the modified coefficient vector obtained by multiplying the 1D vector and the corresponding inverse RST matrix from the left can be arranged in a 2D block according to the arrangement order in Table 15.
In order to derive the transform coefficient, the decoding apparatus may first arrange information on the received transform coefficient according to the reverse scanning order, that is, the diagonal scanning order from 64 in
Then, the inverse transform unit 322 of the decoding apparatus may apply the transform kernel matrix to transform coefficients arranged in one dimension according to the scanning order in Table 16. That is, 48 modified transform coefficients can be derived through the matrix operation between the one dimensional transform coefficients arranged according to the scanning order in Table 16 and the transform kernel matrix based on the transform kernel matrix in Table 14. That is, the one-dimensional transform coefficients can be derived into the 48 modified transform coefficients through the matrix operation with a matrix in which the transform kernel matrix in Table 14 is transposed.
The 48 modified transform coefficients derived in this way can be arranged in two dimensions as shown in Table 15 for the inverse primary transform.
In summary, in the transformation process, when RST or LFNST is applied to the 8×8 region, the transform operation is performed between 48 transform coefficients among the transform coefficients of the 8×8 region in the top-left, the top-right and the bottom-left regions of the 8×8 region excluding the bottom-right region of the 8×8 region and the 16×48 transform matrix kernel. For the matrix operation, 48 transform coefficients are inputted in a one-dimensional array in the order shown in Table 15. When such a matrix operation is performed, 16 modified transform coefficients are derived, and the modified transform coefficients may be arranged in the form shown in Table 16 in the top-left region of the 8×8 region.
Conversely, in the inverse conversion process, when inverse RST or LFNST is applied to the 8×8 region, 16 transform coefficients corresponding to the top-left of the 8×8 region among the transform coefficients of the 8×8 region are input in a one-dimensional array form according to the scanning order shown in Table 16, so that the transform operation is performed between the 48×16 transform kernel matrix and the 16 transform coefficients. That is, the matrix operation in this case can be expressed as (48×16 matrix)*(16×1 transform coefficient vector)=(48×1 modified transform coefficient vector). Here, since the n×1 vector can be interpreted in the same meaning as the n×1 matrix, it may be expressed as an n×1 column vector. Also, * means matrix multiplication operation. When such a matrix operation is performed, the 48 modified transform coefficients can be derived, and the 48 modified transform coefficients may be arranged in the top-left, the top-right, and the bottom-left region excluding the bottom-right region of the 8×8 region as shown in Table 15.
Meanwhile, according to an embodiment, as shown in Table 15, data arrangement in an 8×8 region for the secondary transformation is in row-first order. When there are 67 intra prediction modes as shown in
As shown in Table 11, the data is arranged in the column-first direction in the 8×8 region for a secondary transform. Table 17 shows that, for intra prediction mode (66−n), that is, for modes 35 to 66, a 48×1 input vector may be configured for according to the column-first direction.
In summary, the same transform kernel matrix shown in Table 14 may be applied while symmetrically arranging input data for mode (2+n) according to the row-first direction and input data for mode (66−n) (0≤n≤31) according to the column-first direction. A transform kernel matrix to be applied in each mode is shown in Table 5 to Table 7.
Here, either the arrangement order shown in Table 15 or the arrangement order shown in Table 17 may be applied for the planar mode of intra prediction mode 0, the DC mode of intra prediction mode 1, and the intra prediction mode 34. For example, for the planar mode of intra prediction mode 0, the DC mode of intra prediction mode 1, and the intra prediction mode 34, input data may be arranged according to the row-first direction as shown in Table 15 and the arrangement order shown in Table 16 can be applied to the derived transform coefficients. Alternatively, for the planar mode of intra prediction mode 0, the DC mode of intra prediction mode 1, and the intra prediction mode 34, input data may be arranged according to the column-first direction as shown in Table 17 and the arrangement order shown in Table 16 can be applied to the derived transform coefficients.
As described above, when the 16×48 transform kernel matrix of Table 14 is applied to the secondary transformation, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region are filled with zeros as shown in Table 16. When an m×48 transform kernel matrix is applied to the secondary transform (m≤16), not only the top-right 4×4 region and the bottom-left 4×4 region, but also from the (m+1)th to 16th in the scanning order shown in Table 16 can be filled with zeros.
Therefore, if there is any non-zero transform coefficient from the (m+1)th to 16th position in the scanning order or in the top-right 4×4 region or the bottom-left 4×4 region, it can be considered that the m×48 secondary transform is (m≤16) is not applied. In this case, the index for the secondary transformation may not be signaled. The decoding apparatus first parses the transform coefficient and checks whether the corresponding condition (that is, if a non-zero transform coefficient exists in the region where the transform coefficient should be 0) is satisfied and if it is satisfied the decoding apparatus may infer the index for the secondary transformation to zero without parsing the index. For example, in the case of m=16, it may be determined whether to apply the secondary transformation and whether to parse the index for the secondary transformation by checking whether there is a non-zero coefficient in the top-right 4×4 region or the bottom-left 4×4 region.
Meanwhile, Table 18 shows another example of transform kernel matrices that can be applied to a 4×4 region.
The following embodiments may be proposed in order to reduce computational amount in a worst case. In this document, a matrix including M rows and N columns is expressed as an M×N matrix, and the M×N matrix refers to a transform matrix applied in a forward transform, that is, when the encoding apparatus performs a transform (RST). Accordingly, in the inverse transform (inverse RST) performed by the decoding apparatus, an N×M matrix obtained by transposing the M×N matrix may be used. In addition, the following describes a case where an mx 64 transform kernel matrix (m≤16) is applied as a transformation matrix for an 8×8 region, but the same may be applied to a case where input vector is 48×1 and the mx 48 transform kernel matrix is (m≤16). That is, 16×64 (or m×64) may be replaced with 16×48 (or m×48).
1) In a case of a block (e.g., a transform unit) having a width of W and a height of H where W≥8 and H≥8, a transform kernel matrix applicable to an 8×8 region is applied to a top-left 8×8 region of the block. In a case where W=8 and H=8, only an 8×64 portion of a 16×64 matrix may be applied. That is, eight transform coefficients may be generated. Alternatively, only 8×48 parts of the 16×48 matrix can be applied. That is, 8 transform coefficients can be generated.
2) In a case of a block (e.g., a transform unit) having a width of W and a height of H where one of W and H is less than 8, that is, one of W and H is 4, a transform kernel matrix applicable to a 4×4 region is applied to a top-left region of the block. In a case where W=4 and H=4, only an 8×16 portion of a 16×16 matrix may be applied, in which case eight transform coefficients are generated.
If (W, H)=(4, 8) or (8, 4), a secondary transform is applied only to the top-left 4×4 region. If W or H is greater than 8, that is, if one of W and H is equal to or greater than 16 and the other is 4, the secondary transform is applied only to two top-left 4×4 blocks. That is, only atop-left 4×8 or 8×4 region may be divided into two 4×4 blocks, and a designated transform kernel matrix may be applied thereto.
3) In a case of a block (e.g., a transform unit) having a width of W and a height of H where both W and H are 4, a secondary transform may not be applied.
4) In a case of a block (e.g., a transform unit) having a width of W and a height of H, the number of coefficients generated by applying a secondary transform may be maintained to be ¼ or less of the area of the transform unit (i. E., the total number of pixels included in the transform unit=W×H). For example, when both W and H are 4, atop 4×16 matrix of a 16×16 matrix may be applied so that four transform coefficients are generated.
Assuming that a secondary transform is applied only to a top-left 8×8 region of the entire transform unit (TU), eight or less coefficients need to be generated for a 4×8 transform unit or a 8×4 transform unit, and thus a top 8×16 matrix of a 16×16 matrix may be applied to a top left 4×4 region. Up to a 16×64 matrix (or 16×48 matrix) may be applied to an 8×8 transform unit (up to 16 coefficients can be generated). In a 4×N or N×4 (N≥16) transform unit, a 16×16 matrix may be applied to atop-left 4×4 block, or atop 8×16 matrix of the 16×16 matrix may be applied to two top-left 4×4 blocks. Similarly, in a 4×8 transform unit or 8×4 transform unit, eight transform coefficients may be generated by applying atop 4×16 matrix of the 16×16 matrix to two top-left 4×4 blocks.
5) The maximum size of a secondary transform applied to a 4×4 region may be limited to 8×16. In this case, the amount of a memory required to store transform kernel matrices applied to the 4×4 region can be reduced by half compared to that in a 16×16 matrix.
For example, in all transform kernel matrices shown in Table 9 or Table 18, the maximum size may be limited to 8×16 by extracting only a top 8×16 matrix of each 16×16 matrix, and an actual image coding system may be implemented to store only 8×16 matrices of the transform kernel matrices.
If the maximum applicable transform size is 8×16 and the maximum number of multiplications required to generate one coefficient is limited to 8, an up to 8×16 matrix may be applied to a 4×4 block, and an up to 8×16 matrix may be applied to each of up to two top-left two 4×4 blocks included in a 4×N block or an N×4 block (N≥8, N=2n, n≥3). For example, an 8×16 matrix may be applied to one top-left 4×4 block in a 4×N block or an N×4 block (N≥8, N=2n, n≥3).
According to an embodiment, when coding an index specifying a secondary transform to be applied to a luma component, specifically, when one transform set includes two transform kernel matrices, it is necessary to specify whether to apply the secondary transform and which transform kernel matrix to apply in the secondary transform. For example, when no secondary transform is applied, a transform index may be coded as 0, and when the secondary transform is applied, transform indexes for two transform sets may be coded as 1 and 2, respectively.
In this case, when coding the transform index, truncated unary coding may be used. For example, binary codes of 0, 10, and 11 may be respectively allocated to transform indexes 0, 1, and 2, thereby coding the transform indexes.
In addition, when coding the transform index by truncated unary coding, different CABAC context may be assigned to each bin. When coding the transform indexes 0, 10, and 11 in the above example, two CABAC contexts may be used.
When coding a transform index specifying a secondary transform to be applied to a chroma component, specifically, when one transform set includes two transform kernel matrices, it is necessary to specify whether to apply the secondary transform and which transform kernel matrix to apply in the secondary transform similarly to when coding the transform index of the secondary transform for the luma component. For example, when no secondary transform is applied, a transform index may be coded as 0, and when the secondary transform is applied, transform indexes for two transform sets may be coded as 1 and 2, respectively.
In this case, when coding the transform index, truncated unary coding may be used. For example, binary codes of 0, 10, and 11 may be respectively allocated to transform indexes 0, 1, and 2, thereby coding the transform indexes.
In addition, when coding the transform index by truncated unary coding, different CABAC context may be assigned to each bin. When coding the transform indexes 0, 10, and 11 in the above example, two CABAC contexts may be used.
According to an embodiment, a different CABAC context set may be allocated according to a chroma intra prediction mode. For example, when chroma intra prediction modes are divided into non-directional modes, such as a planar mode or a DC mode, and other directional modes (i. E., divided into two groups), a corresponding CABAC context set (including two contexts) may be allocated for each group when coding 0, 10, and 11 in the above example.
When the chroma intra prediction modes are divided into a plurality of groups and a corresponding CABAC context set is allocated, it is necessary to find out a chroma intra prediction mode value before coding the transform index of a secondary transform. However, in a chroma direct mode (DM), since a luma intra prediction mode value is used as it is, it is also necessary to find out an intra prediction mode value for a luma component. Therefore, when coding information on a chroma component, data dependency on luma component information may occur. Thus, in the chroma DM, when coding the transform index of the secondary transform without having information on the intra prediction mode, the data dependency can be removed by mapping to a specific group. For example, if the chroma intra prediction mode is the chroma DM, the transform index may be coded using a corresponding CABAC context set assuming the planner mode or the DC mode, or a corresponding CABAC context set may be applied assuming that other directional modes.
Each operation illustrated in
The decoding apparatus 300 according to an embodiment may derive quantized transform coefficients for a target block from a bitstream (S910). Specifically, the decoding apparatus 300 may decode information on the quantized transform coefficients for the target block from the bitstream and may derive the quantized transform coefficients for the target block based on the information on the quantized transform coefficients for the target block. The information on the quantized transform coefficients for the target block may be included in a sequence parameter set (SPS) or a slice header and may include at least one of information on whether a reduced transform (RST) is applied, information on a reduced factor, information on a minimum transform size to which the RST is applied, information on a maximum transform size to which the RST is applied, information on a reduced inverse transform size, and information on a transform index indicating any one of transform kernel matrices included in a transform set.
The decoding apparatus 300 according to an embodiment may derive transform coefficients by dequantizing the quantized transform coefficients for the target block (S920).
The derived transform coefficients may be arranged according to the reverse diagonal scan order in units of 4×4 blocks, and the transform coefficients in the 4×4 block may also be arranged according to the reverse diagonal scan order. That is, the transform coefficients performed to inverse quantization may be arranged according to the inverse scan order applied in a video codec such as in VVC or HEVC.
The decoding apparatus 300 according to an embodiment may derive modified transform coefficients based on an inverse reduced secondary transform (RST) of the transform coefficients (S930).
In an example, the inverse RST may be performed based on an inverse RST transform matrix, and the inverse RST transform matrix may be a non square matrix in which the number of columns is less than the number of rows.
In an embodiment, S930 may include decoding a transform index, determining whether a condition for applying an inverse RST is satisfied based on the transform index, selecting a transform kernel matrix, and applying the inverse RST to the transform coefficients based on the selected transform kernel matrix and/or the reduced factor when the condition for applying the inverse RST is satisfied. In this case, the size of a reduced inverse transform matrix may be determined based on the reduced factor.
The decoding apparatus 300 according to an embodiment may derive residual samples for the target block based on an inverse transform of the modified transform coefficients (S940).
The decoding apparatus 300 may perform an inverse primary transform on the modified transform coefficients for the target block, in which case a reduced inverse transform may be applied or a conventional separable transform may be used as the inverse primary transform.
The decoding apparatus 300 according to an embodiment may generate reconstructed samples based on the residual samples for the target block and prediction samples for the target block (S950).
Referring to S930, it may be identified that the residual samples for the target block are derived based on the inverse RST of the transform coefficients for the target block. From the perspective of the size of the inverse transform matrix, since the size of a regular inverse transform matrix is N×N but the size of the inverse RST matrix is reduced to N×R, it is possible to reduce memory usage in a case of performing the inverse RST by an R/N ratio compared to that in a case of performing a regular transform. Further, using the inverse RST matrix can reduce the number of multiplications (N×R) by the R/N ratio, compared to the number of multiplications N×N in a case of using the regular inverse transform matrix. In addition, since only R transform coefficients need to be decoded when the inverse RST is applied, the total number of transform coefficients for the target block may be reduced from N to R, compared to that in a case where N transform coefficients needs to be decoded when a regular inverse transform is applied, thus increasing decoding efficiency. That is, according to S930, the (inverse) transform efficiency and decoding efficiency of the decoding apparatus 300 may be increased through the inverse RST.
The decoding apparatus 300 receives information on quantized transform coefficients, an intra prediction mode, and a transform index through a bitstream (S1000).
Transform coefficients are derived from the quantized transform coefficients received through the bitstream via dequantization as shown in S920 of
To apply an inverse RST to the dequantized transform coefficients, a transform set and a transform kernel matrix to be applied to a target block are derived (S1010).
According to an example, the transform set may be derived based on a mapping relationship according to an intra prediction mode for the target block, and a plurality of intra prediction modes may be mapped to one transform set. Each one transform set may include a plurality of transform kernel matrices. A transform index may indicate any one of the plurality of transform kernel matrices. For example, when one transform set includes two transform kernel matrices, the transform index may indicate any one of the two transform kernel matrices.
A syntax element of the transform index according to an embodiment may indicate whether an inverse RST is applied and one of transform kernel matrices included in the transform set. When the transform set includes two transform kernel matrices, the syntax element of the transform index may have three values.
That is, according to an embodiment, the value of the syntax element of the transform index may include 0 indicating that the inverse RST is not applied to the target block, 1 indicating a first transform kernel matrix of the transform kernel matrices, and 2 indicating a second transform kernel matrix of the transform kernel matrices. This information is received as syntax information, and the syntax information is received as a bin string including 0 and 1.
The transform kernel matrix according to an example may be applied to a specified top-left region of the target block, for example, an 8×8 region or a 4×4 region, according to the reduced or simplified size of a secondary transform, and the size of modified transform coefficients output by applying the transform kernel matrix, that is, the number of transform coefficients, may be derived based on the transform index, the intra prediction mode, and the size of the target block to which the secondary transform is applied.
According to an example, when the inverse secondary transformation is applied to a region of the target block, that is, an 8×8 region or a 4×4 region, the inverse secondary transformation can be applied only to some of among transform coefficients included in an 8×8 region or a 4×4 region. For inverse secondary transformation, if only 48 of the transform coefficients of the 8×8 region are input, the 64×m transform kernel matrix applied to the 8×8 region can be further reduced to the 48×m transform kernel matrix.
According to an example, m may be 16, and the 48×16 transform kernel matrix may be a transform kernel matrix based on Table 14, that is, a matrix obtained by taking a transpose to the matrix of Table 14. When there are 4 transform sets and two transform kernel matrices are included in each transform set, a transform index indicating whether an inverse secondary transform is applied and any one of transform kernel matrices included in the transform set may have a value of 0, 1 and 2. If the transform index is 0, it indicates that the inverse secondary transform is not applied. Therefore, if there are 4 transform sets, all 8 transform kernel matrices can be used for the inverse secondary transform.
As shown in Equation 7, the transform coefficients in a one-dimensional array derived through the dequantization may be subjected to a matrix operation with the transform kernel matrix, thereby deriving modified transform coefficients in a two-dimensional array.
The inverse transformer 322 according to this embodiment may derive the modified transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region by applying the transform kernel matrix to the transform coefficients of the top-left 4×4 region of the 8×8 region of the target block (S1020).
According to an example, when performing the matrix operation between the transform coefficients of the top-left 4×4 region of the 8×8 region and the transform kernel matrix, the transform coefficients of the top-left 4×4 region of the 8×8 region are one-dimensionally arranged according to a forward diagonal scanning order as shown in Table 16, the transform coefficients of the one-dimensional array may be two-dimensionally arranged the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region as shown in Table 15 or Table 17 according to the row-first direction or the column-first direction corresponding to the intra prediction mode applied to the target block after the matrix operation with the transform kernel matrix. That is, the inverse secondary transform can be applied to the 16 transform coefficients in the top-left 4×4 region in the 8×8 region, and the 48 modified transform coefficients can be derived in the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region among the 8×8 region through the operation with the transform kernel matrix.
When the intra prediction mode applicable to the target block is one of 65 directional modes, the intra prediction mode is symmetric around intra prediction mode 34 in the top-left diagonal direction, and the intra prediction mode applied to the target block is one of mode 2 to mode 34 in the left direction with respect to the intra prediction mode 34, the modified transform coefficients are two-dimensionally arranged according to the row-first direction.
If the intra prediction mode applied to the target block is one of mode 35 to mode 66 in the right direction c the intra prediction mode mode 34, the modified transform coefficients may be two-dimensionally arranged according to the column-first direction.
In addition, if the intra prediction mode applied to the target block is the planar mode or the DC mode, the modified transform coefficients may be two-dimensionally arranged according to the row-first direction.
The inverse transformer 322 may apply the inverse RST to generate the modified transform coefficient of the 8×8 region or the 4×4 region as a 2 dimension block, and subsequently apply the inverse primary transformation to the modified transform coefficient of the 2 dimension block.
Each operation illustrated in
The encoding apparatus 200 according to an embodiment may derive prediction samples based on an intra prediction mode applied to a target block (S1110).
The encoding apparatus 200 according to an embodiment may derive residual samples for the target block (S1120).
The encoding apparatus 200 according to an embodiment may derive transform coefficients for the target block based on primary transform of the residual sample (S1130). The primary transform may be performed through a plurality of transform kernels, and the transform kernels may be selected based on the intra prediction mode.
The decoding apparatus 300 may perform a secondary transform, specifically an NSST, on the transform coefficients for the target block, in which case the NSST may be performed based on a reduced transform (RST) or without being based on the RST. When the NSST is performed based on the reduced transform, an operation according to S1140 may be performed.
The encoding apparatus 200 according to an embodiment may derive modified transform coefficients for the target block based on the RST of the transform coefficients (S1140). In an example, the RST may be performed based on a reduced transform matrix or a transform kernel matrix, and the reduced transform matrix may be a non square matrix in which the number of rows is less than the number of columns.
In an embodiment, S1140 may include determining whether a condition for applying the RST is satisfied, generating and encoding the transform index based on the determination, selecting a transform kernel, and applying the RST to the residual samples based on the selected transform kernel matrix and/or a reduced factor when the condition for applying the RST is satisfied. In this case, the size of the reduced transform kernel matrix may be determined based on the reduced factor.
The encoding apparatus 200 according to an embodiment may derive quantized transform coefficients by performing quantization based on the modified transform coefficients for the target block and may encode information on the quantized transform coefficients (S1150).
Specifically, the encoding apparatus 200 may generate the information on the quantized transform coefficients and may encode the generated information on the quantized transform coefficients.
In an example, the information on the quantized transform coefficients may include at least one of information on whether the RST is applied, information on the reduced factor, information on a minimum transform size to which the RST is applied, and information on a maximum transform size to which the RST is applied.
Referring to S1140, it may be identified that the transform coefficients for the target block are derived based on the RSTof the residual samples. From the perspective of the size of the transform kernel matrix, since the size of a regular transform kernel matrix is N×N but the size of the reduced transform matrix is reduced to R×N, it is possible to reduce memory usage in a case of performing the RST by an R/N ratio compared to that in a case of performing a regular transform. Further, using the reduced transform kernel matrix can reduce the number of multiplications (R×N) by the R/N ratio, compared to the number of multiplications N×N in a case of using the regular transform kernel matrix. In addition, since only R transform coefficients are derived when the RST is applied, the total number of transform coefficients for the target block may be reduced from N to R, compared to that in a case where N transform coefficients are derived when a regular transform is applied, thus reducing the amount of data transmitted by the encoding apparatus 200 to the decoding apparatus 300. That is, according to S1140, the transform efficiency and coding efficiency of the encoding apparatus 320 may be increased through the RST.
First, the encoding apparatus 200 may determine a transform set based on a mapping relationship according to an intra prediction mode applied to a target block (S1200).
The transformer 232 may select any one of a plurality of transform kernel matrices included in the transform set (S1210).
According to an example, the transform set may be derived based on the mapping relationship according to the intra prediction mode of the target block, and a plurality of intra prediction modes may be mapped to one transform set. Each one transform set may include a plurality of transform kernel matrices. When one transform set includes two transform kernel matrices, a transform index indicating any one of the two transform kernel matrices may be encoded and may be signaled to the decoding apparatus.
When two transforms are applied to a residual sample, the residual sample may be referred to as a transform coefficient after being subjected to a primary transform, and may be referred to as a modified transform coefficient after being subjected to the primary transform and then a secondary transform, such as an RST.
According to an example, when the secondary transformation is applied to a region of the target block, that is, an 8×8 region or a 4×4 region, the secondary transformation can be applied only to some of among transform coefficients included in an 8×8 region or a 4×4 region. For example, when the secondary transformation may be apply to only 48 of the transform coefficients of the 8×8 region, the m×64 transform kernel matrix applied to the 8×8 region can be further reduced to the m×48 transform kernel matrix.
According to an example, m may be 16, and the 16×48 transform kernel matrix may be a transform kernel matrix in Table 14. When there are 4 transform sets and two transform kernel matrices are included in each transform set, a transform index indicating whether the inverse secondary transform is applied and any one of transform kernel matrices included in the transform set may have a value of 0, 1 and 2. If the transform index is 0, it indicates that the inverse secondary transform is not applied. Therefore, if there are 4 transform sets, all 8 transform kernel matrices can be used for the inverse secondary transform.
When performing the RST on transform coefficients using the transform kernel matrix, the transformer 232 one-dimensionally arrange the transform coefficients in a two-dimensional array, which have been subjected to the primary transform, according to either the row-first direction or the column-first direction, based on the intra prediction mode applied to the target block Specifically, The transformer 232 according to this embodiment may derive the modified transform coefficients in the top-left 4×4 region of the 8×8 region by applying the transform kernel matrix to the transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region of the target block (S1220).
The transform kernel matrix may be applied to a specified top-left region of the target block, for example, an 8×8 region or a 4×4 region or some of the 8×8 region, according to the reduced or simplified size of a secondary transform, and the size of modified transform coefficients output by applying the transform kernel matrix, that is, the number of modified transform coefficients, may be derived based on the size of the transform kernel matrix, the intra prediction mode, and the size of the target block to which the secondary transform is applied.
The two-dimensional transform coefficients need to be one-dimensionally arranged for a matrix operation with the transform kernel matrix as shown in Equation 5, and a smaller number of modified transform coefficients than that of transform coefficients may be derived through an operation, such as Equation 6.
That is, the transform coefficients in the two-dimensional array in the specified region may be read in one dimension according to a certain direction, from which modified transform coefficients are derived through the matrix operation with the transform kernel matrix.
According to an example, when performing the matrix operation between the transform coefficients of the top-left 4×4 region of the 8×8 region and the transform kernel matrix, the 48 transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region may be one-dimensionally arranged as shown in Table 15 or Table 17 according to the row-first direction or the column-first direction corresponding to the intra prediction mode applied to the target block, the derived 16 modified transform coefficients may be arranged according to the diagonal scanning direction in the top-left 4×4 region of the 8×8 region as shown in Table 16.
When the intra prediction mode applicable to the target block is one of 65 directional modes, the intra prediction mode is symmetric around intra prediction mode 34 in the top-left diagonal direction, and the intra prediction mode applied to the target block is one of mode 2 to mode 34 in the left direction with respect to the intra prediction mode 34, the transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region may be one-dimensionally arranged according to the row-first direction as shown in Table 15.
If the intra prediction mode applied to the target block is one of mode 35 to mode 66 in the right direction with respect to the intra prediction mode mode 34, the transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region may be one-dimensionally arranged according to the column-first direction as shown in Table 17.
In addition, if the intra prediction mode applied to the target block is the planar mode or the DC mode, the transform coefficients of the top-left 4×4 region, the top-right 4×4 region and the bottom-left 4×4 region of the 8×8 region may be one-dimensionally arranged according to the row-first direction.
When the RST is performed, information on the RST may be encoded by the entropy encoder 240.
First, the entropy encoder 240 may derive a syntax element value for the transform index indicating any one of the transform kernel matrices included in the transform set, may binarize the derived syntax element value for the transform index, and may encode bins of a syntax element bin string based on context information, that is, a context model, on a bin string of the transform index.
The encoded bin string of the syntax element may be output as a bitstream to the decoding apparatus 300 or to the outside.
In the above-described embodiments, the methods are explained on the basis of flowcharts by means of a series of steps or blocks, but the present disclosure is not limited to the order of steps, and a certain step may be performed in order or step different from that described above, or concurrently with another step. Further, it may be understood by a person having ordinary skill in the art that the steps shown in a flowchart are not exclusive, and that another step may be incorporated or one or more steps of the flowchart may be removed without affecting the scope of the present disclosure.
The above-described methods according to the present disclosure may be implemented as a software form, and an encoding apparatus and/or decoding apparatus according to the disclosure may be included in a device for image processing, such as, a TV, a computer, a smartphone, a set-top box, a display device or the like.
When embodiments in the present disclosure are embodied by software, the above-described methods may be embodied as modules (processes, functions or the like) to perform the above-described functions. The modules may be stored in a memory and may be executed by a processor. The memory may be inside or outside the processor and may be connected to the processor in various well-known manners. The processor may include an application-specific integrated circuit (ASIC), other chipset, logic circuit, and/or a data processing device. The memory may include a read-only memory (ROM), a random access memory (RAM), a flash memory, a memory card, a storage medium, and/or other storage device. That is, embodiments described in the present disclosure may be embodied and performed on a processor, a microprocessor, a controller or a chip. For example, function units shown in each drawing may be embodied and performed on a computer, a processor, a microprocessor, a controller or a chip.
Further, the decoding apparatus and the encoding apparatus to which the present disclosure is applied, may be included in a multimedia broadcasting transceiver, a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video chat device, a real time communication device such as video communication, a mobile streaming device, a storage medium, a camcorder, a video on demand (VoD) service providing device, an over the top (OTT) video device, an Internet streaming service providing device, a three-dimensional (3D) video device, a video telephony video device, and a medical video device, and may be used to process a video signal or a data signal. For example, the over the top (OTT) video device may include a game console, a Blu-ray player, an Internet access TV, a Home theater system, a smartphone, a Tablet PC, a digital video recorder (DVR) and the like.
In addition, the processing method to which the present disclosure is applied, may be produced in the form of a program executed by a computer, and be stored in a computer-readable recording medium. Multimedia data having a data structure according to the present disclosure may also be stored in a computer-readable recording medium. The computer-readable recording medium includes all kinds of storage devices and distributed storage devices in which computer-readable data are stored. The computer-readable recording medium may include, for example, a Blu-ray Disc (BD), a universal serial bus (USB), a ROM, a PROM, an EPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device. Further, the computer-readable recording medium includes media embodied in the form of a carrier wave (for example, transmission over the Internet). In addition, a bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network. Additionally, the embodiments of the present disclosure may be embodied as a computer program product by program codes, and the program codes may be executed on a computer by the embodiments of the present disclosure. The program codes may be stored on a computer-readable carrier.
Further, the contents streaming system to which the present disclosure is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user equipment, and a multimedia input device.
The encoding server functions to compress to digital data the contents input from the multimedia input devices, such as the smart phone, the camera, the camcoder and the like, to generate a bitstream, and to transmit it to the streaming server. As another example, in a case where the multimedia input device, such as, the smart phone, the camera, the camcoder or the like, directly generates a bitstream, the encoding server may be omitted. The bitstream may be generated by an encoding method or a bitstream generation method to which the present disclosure is applied. And the streaming server may store the bitstream temporarily during a process to transmit or receive the bitstream.
The streaming server transmits multimedia data to the user equipment on the basis of a user's request through the web server, which functions as an instrument that informs a user of what service there is. When the user requests a service which the user wants, the web server transfers the request to the streaming server, and the streaming server transmits multimedia data to the user. In this regard, the contents streaming system may include a separate control server, and in this case, the control server functions to control commands/responses between respective equipment in the content streaming system.
The streaming server may receive contents from the media storage and/or the encoding server. For example, in a case the contents are received from the encoding server, the contents may be received in real time. In this case, the streaming server may store the bitstream for a predetermined period of time to provide the streaming service smoothly.
For example, the user equipment may include a mobile phone, a smart phone, a laptop computer, a digital broadcasting terminal, a personal digital assistant (PDA), a portable multimedia player (PMP), a navigation, a slate PC, a tablet PC, an ultrabook, a wearable device (e.g., a watch-type terminal (smart watch), a glass-type terminal (smart glass), a head mounted display (HMD)), a digital TV, a desktop computer, a digital signage or the like. Each of servers in the contents streaming system may be operated as a distributed server, and in this case, data received by each server may be processed in distributed manner.
This application is a continuation of U.S. application Ser. No. 17/350,790, filed on Jun. 17, 2021, which is a continuation pursuant to 35 U.S.C. § 119(e) of International Application PCT/KR2019/018071, with an international filing date of Dec. 19, 2019, which claims the benefit of U.S. Provisional Patent Application No. 62/782,294 filed on Dec. 19, 2018, the contents of which are hereby incorporated by reference herein in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 20150264403 | Chong | Sep 2015 | A1 |
| 20170280163 | Kao et al. | Sep 2017 | A1 |
| Number | Date | Country |
|---|---|---|
| 2021519546 | Aug 2021 | JP |
| 1020160134702 | Nov 2016 | KR |
| 1020180061046 | Jun 2018 | KR |
| WO 2016081939 | May 2016 | WO |
| WO2018016823 | Jan 2018 | WO |
| Entry |
|---|
| LG Electronics Inc., “CE 6-2.1: Reduced Secondary Transform (RST),” JVET-L0133, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, 10 pages. |
| LG Electronics, “Description of SDR video coding technology proposal by LG Electronics,” JVET-J0017-v1, Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 10th Meeting, San Diego, CA, Apr. 10-20, 2018, 73 pages. |
| EP Extended Search Report in European Appln. No. 19900872.3, dated Feb. 25, 2022, 12 pages. |
| IN Office Action in Indian Appln. No. 202117025907, dated Mar. 10, 2022, 5 pages (with English translation). |
| JVET, “Test Model 5 of Versatile Video Coding (VTM 5),” JVET-N1002-v2, Geneva, CH, Mar. 19-27, 2019, 77 pages. |
| LG Electronics Inc., “CE 6.2.6: Reduced Secondary Transform (RST),” JVET-K0099, Ljubljana, SI, Jul. 10-18, 2018, 12 pages. |
| Koo et al., “CE 6-5.1: Reduced Secondary Transform (RST),” JVET-M0292, Presented at Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, 97 pages. |
| Office Action in Japanese Appln. No. 2021-533297, dated Oct. 4, 2022, 4 pages (with English translation). |
| Number | Date | Country | |
|---|---|---|---|
| 20220159303 A1 | May 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| 62782294 | Dec 2018 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17350790 | Jun 2021 | US |
| Child | 17592768 | US | |
| Parent | PCT/KR2019/018071 | Dec 2019 | US |
| Child | 17350790 | US |
