Patent Publication Number: US-11659172-B2

Title: Image encoding/decoding method and device for signaling chroma component prediction information according to whether palette mode is applicable, and method for transmitting bitstream

Description:
This application is a Continuation Application of International Application No. PCT/KR2020/009618 filed on Jul. 21, 2020, which claims the benefit of U.S. Provisional Application No. 62/876,766 filed on Jul. 21, 2019, the contents of which are all hereby incorporated by reference herein in their entirety. 
    
    
     TECHNICAL FIELD 
     The present disclosure relates to an image encoding/decoding method and apparatus, and, more particularly, to an image encoding/decoding method for signaling chroma component prediction information depending on whether to apply a palette mode, and a method of transmitting a bitstream generated by the image encoding method/apparatus of the present disclosure. 
     BACKGROUND ART 
     Recently, demand for high-resolution and high-quality images such as high definition (HD) images and ultra high definition (UHD) images is increasing in various fields. As resolution and quality of image data are improved, the amount of transmitted information or bits relatively increases as compared to existing image data. An increase in the amount of transmitted information or bits causes an increase in transmission cost and storage cost. 
     Accordingly, there is a need for high-efficient image compression technology for effectively transmitting, storing and reproducing information on high-resolution and high-quality images. 
     DISCLOSURE 
     Technical Problem 
     An object of the present disclosure is to provide an image encoding/decoding method and apparatus with improved encoding/decoding efficiency. 
     An object of the present disclosure is to provide an image encoding/decoding method and apparatus for improving encoding/decoding efficiency by signaling chroma component prediction information depending on whether to apply a palette mode. 
     Another object of the present disclosure is to provide a method of transmitting a bitstream generated by an image encoding method or apparatus according to the present disclosure. 
     Another object of the present disclosure is to provide a recording medium storing a bitstream generated by an image encoding method or apparatus according to the present disclosure. 
     Another object of the present disclosure is to provide a recording medium storing a bitstream received, decoded and used to reconstruct an image by an image decoding apparatus according to the present disclosure. 
     The technical problems solved by the present disclosure are not limited to the above technical problems and other technical problems which are not described herein will become apparent to those skilled in the art from the following description. 
     Technical Solution 
     An image decoding method performed by an image decoding apparatus according to an aspect of the present disclosure may comprise determining a current block by splitting an image, identifying whether a palette mode is applied for the current block, based on a palette mode flag obtained from a bitstream, obtaining palette mode encoding information of the current block from the bitstream, based on a tree type of the current block and whether the palette mode is applied for the current block, and obtaining chroma component prediction information of the current block from the bitstream, based on the palette mode being not applied for the current block. 
     In addition, an image decoding apparatus according to an aspect of the present disclosure may comprise a memory and at least one processor. The at least one processor may determine a current block by splitting an image, identify whether a palette mode is applied for the current block, based on a palette mode flag obtained from a bitstream, obtain palette mode encoding information of the current block from the bitstream, based on a tree type of the current block and whether the palette mode is applied for the current block, and obtain chroma component prediction information of the current block from the bitstream, based on the palette mode being not applied for the current block. 
     In addition, an image encoding method performed by an image encoding apparatus according to an aspect of the present disclosure may comprise determining a current block by splitting an image, determining a prediction mode of the current block, encoding a palette mode flag specifying whether the prediction mode of the current block is a palette mode, based on whether the prediction mode of the current block being the palette mode, encoding palette mode encoding information in which the current block is encoded in a palette mode, based on a tree type of the current block and whether the prediction mode of the current block is the palette mode, and encoding chroma component prediction information of the current block, based on the prediction mode of the current block being not the palette mode. 
     In addition, a transmission method according to another aspect of the present disclosure may transmit a bitstream generated by the image encoding apparatus or the image encoding method of the present disclosure. 
     In addition, a computer-readable recording medium according to another aspect of the present disclosure may store the bitstream generated by the image encoding apparatus or the image encoding method of the present disclosure. 
     The features briefly summarized above with respect to the present disclosure are merely exemplary aspects of the detailed description below of the present disclosure, and do not limit the scope of the present disclosure. 
     Advantageous Effects 
     According to the present disclosure, it is possible to provide an image encoding/decoding method and apparatus with improved encoding/decoding efficiency. 
     Also, according to the present disclosure, it is possible to provide an image encoding/decoding method and apparatus for improving encoding/decoding efficiency by signaling chroma component prediction information depending on whether to apply a palette mode. 
     Also, according to the present disclosure, it is possible to provide a method of transmitting a bitstream generated by an image encoding method or apparatus according to the present disclosure. 
     Also, according to the present disclosure, it is possible to provide a recording medium storing a bitstream generated by an image encoding method or apparatus according to the present disclosure. 
     Also, according to the present disclosure, it is possible to provide a recording medium storing a bitstream received, decoded and used to reconstruct an image by an image decoding apparatus according to the present disclosure. 
     It will be appreciated by persons skilled in the art that that the effects that can be achieved through the present disclosure are not limited to what has been particularly described hereinabove and other advantages of the present disclosure will be more clearly understood from the detailed description. 
    
    
     
       DESCRIPTION OF DRAWINGS 
         FIG.  1    is a view schematically showing a video coding system, to which an embodiment of the present disclosure is applicable. 
         FIG.  2    is a view schematically showing an image encoding apparatus, to which an embodiment of the present disclosure is applicable. 
         FIG.  3    is a view schematically showing an image decoding apparatus, to which an embodiment of the present disclosure is applicable. 
         FIG.  4    is a view showing a partitioning structure of an image according to an embodiment. 
         FIG.  5    is a view showing an embodiment of a partitioning type of a block according to a multi-type tree structure. 
         FIG.  6    is a view showing a signaling mechanism of block splitting information in a quadtree with nested multi-type tree structure according to the present disclosure. 
         FIG.  7    is a view showing an embodiment in which a CTU is partitioned into multiple CUs. 
         FIG.  8    is a view illustrating an embodiment of a redundant splitting pattern. 
         FIG.  9    is a view illustrating a syntax for chroma format signaling according to an embodiment. 
         FIG.  10    is a view illustrating a chroma format classification table according to an embodiment. 
         FIG.  11    is a view illustrating horizontal scan and vertical scan according to an embodiment. 
         FIGS.  12  to  13    are views illustrating a syntax for a palette mode according to an embodiment. 
         FIGS.  14  to  19    are views illustrating a syntax for a palette mode according to an embodiment. 
         FIG.  20    is a view illustrating an equation for determining PredictorPaletteEntries and CurrentPaletteEntries according to an embodiment. 
         FIG.  21    is a view illustrating syntax of a coding unit according to a modified embodiment. 
         FIG.  22    is a flowchart illustrating a signaling method of predetermined chroma intra prediction information according to an embodiment. 
         FIG.  23    is a flowchart illustrating a method of obtaining chroma prediction information by a decoding apparatus according to an embodiment. 
         FIG.  24    is a flowchart illustrating a method of encoding an image by an encoding apparatus according to an embodiment. 
         FIG.  25    is a flowchart illustrating a method of decoding an image by a decoding apparatus according to an embodiment. 
         FIG.  26    is a view showing a content streaming system, to which an embodiment of the present disclosure is applicable. 
     
    
    
     MODE FOR INVENTION 
     Hereinafter, the embodiments of the present disclosure will be described in detail with reference to the accompanying drawings so as to be easily implemented by those skilled in the art. However, the present disclosure may be implemented in various different forms, and is not limited to the embodiments described herein. 
     In describing the present disclosure, if it is determined that the detailed description of a related known function or construction renders the scope of the present disclosure unnecessarily ambiguous, the detailed description thereof will be omitted. In the drawings, parts not related to the description of the present disclosure are omitted, and similar reference numerals are attached to similar parts. 
     In the present disclosure, when a component is “connected”, “coupled” or “linked” to another component, it may include not only a direct connection relationship but also an indirect connection relationship in which an intervening component is present. In addition, when a component “includes” or “has” other components, it means that other components may be further included, rather than excluding other components unless otherwise stated. 
     In the present disclosure, the terms first, second, etc. may be used only for the purpose of distinguishing one component from other components, and do not limit the order or importance of the components unless otherwise stated. Accordingly, within the scope of the present disclosure, a first component in one embodiment may be referred to as a second component in another embodiment, and similarly, a second component in one embodiment may be referred to as a first component in another embodiment. 
     In the present disclosure, components that are distinguished from each other are intended to clearly describe each feature, and do not mean that the components are necessarily separated. That is, a plurality of components may be integrated and implemented in one hardware or software unit, or one component may be distributed and implemented in a plurality of hardware or software units. Therefore, even if not stated otherwise, such embodiments in which the components are integrated or the component is distributed are also included in the scope of the present disclosure. 
     In the present disclosure, the components described in various embodiments do not necessarily mean essential components, and some components may be optional components. Accordingly, an embodiment consisting of a subset of components described in an embodiment is also included in the scope of the present disclosure. In addition, embodiments including other components in addition to components described in the various embodiments are included in the scope of the present disclosure. 
     The present disclosure relates to encoding and decoding of an image, and terms used in the present disclosure may have a general meaning commonly used in the technical field, to which the present disclosure belongs, unless newly defined in the present disclosure. 
     In the present disclosure, a “picture” generally refers to a unit representing one image in a specific time period, and a slice/tile is a coding unit constituting a part of a picture, and one picture may be composed of one or more slices/tiles. In addition, a slice/tile may include one or more coding tree units (CTUs). 
     In the present disclosure, a “pixel” or a “pel” may mean a smallest unit constituting one picture (or image). In addition, “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. 
     In the present disclosure, a “unit” may represent a basic unit of image processing. The unit may include at least one of a specific region of the picture and information related to the region. The unit may be used interchangeably with terms such as “sample array”, “block” or “area” in some cases. In a general case, an M×N block may include samples (or sample arrays) or a set (or array) of transform coefficients of M columns and N rows. 
     In the present disclosure, “current block” may mean one of “current coding block”, “current coding unit”, “coding target block”, “decoding target block” or “processing target block”. When prediction is performed, “current block” may mean “current prediction block” or “prediction target block”. When transform (inverse transform)/quantization (dequantization) is performed, “current block” may mean “current transform block” or “transform target block”. When filtering is performed, “current block” may mean “filtering target block”. 
     In addition, in the present disclosure, a “current block” may mean “a luma block of a current block” unless explicitly stated as a chroma block. The “chroma block of the current block” may be expressed by including an explicit description of a chroma block, such as “chroma block” or “current chroma block”. 
     In the present disclosure, the term “/” and “,” should be interpreted to indicate “and/or.” For instance, the expression “A/B” and “A, B” may mean “A and/or B.” Further, “A/B/C” and “A/B/C” may mean “at least one of A, B, and/or C.” 
     In the present disclosure, the term “or” should be interpreted to indicate “and/or.” For instance, the expression “A or B” may comprise 1) only “A”, 2) only “B”, and/or 3) both “A and B”. In other words, in the present disclosure, the term “or” should be interpreted to indicate “additionally or alternatively.” 
     Overview of Video Coding System 
       FIG.  1    is a view showing a video coding system according to the present disclosure. 
     The video coding system according to an embodiment may include a encoding apparatus  10  and a decoding apparatus  20 . The encoding apparatus  10  may deliver encoded video and/or image information or data to the decoding apparatus  20  in the form of a file or streaming via a digital storage medium or network. 
     The encoding apparatus  10  according to an embodiment may include a video source generator  11 , an encoding unit  12  and a transmitter  13 . The decoding apparatus  20  according to an embodiment may include a receiver  21 , a decoding unit  22  and a renderer  23 . The encoding unit  12  may be called a video/image encoding unit, and the decoding unit  22  may be called a video/image decoding unit. The transmitter  13  may be included in the encoding unit  12 . The receiver  21  may be included in the decoding unit  22 . The renderer  23  may include a display and the display may be configured as a separate device or an external component. 
     The video source generator  11  may acquire a video/image through a process of capturing, synthesizing or generating the video/image. The video source generator  11  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, and the like. The video/image generating device may include, for example, computers, tablets and smartphones, and may (electronically) generate video/images. 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 unit  12  may encode an input video/image. The encoding unit  12  may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency. The encoding unit  12  may output encoded data (encoded video/image information) in the form of a bitstream. 
     The transmitter  13  may transmit the encoded video/image information or data output in the form of a bitstream to the receiver  21  of the decoding apparatus  20  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  13  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  21  may extract/receive the bitstream from the storage medium or network and transmit the bitstream to the decoding unit  22 . 
     The decoding unit  22  may decode the video/image by performing a series of procedures such as dequantization, inverse transform, and prediction corresponding to the operation of the encoding unit  12 . 
     The renderer  23  may render the decoded video/image. The rendered video/image may be displayed through the display. 
     Overview of Image Encoding Apparatus 
       FIG.  2    is a view schematically showing an image encoding apparatus, to which an embodiment of the present disclosure is applicable. 
     As shown in  FIG.  2   , the image encoding apparatus  100  may include an image partitioner  110 , a subtractor  115 , a transformer  120 , a quantizer  130 , a dequantizer  140 , an inverse transformer  150 , an adder  155 , a filter  160 , a memory  170 , an inter prediction unit  180 , an intra prediction unit  185  and an entropy encoder  190 . The inter prediction unit  180  and the intra prediction unit  185  may be collectively referred to as a “prediction unit”. The transformer  120 , the quantizer  130 , the dequantizer  140  and the inverse transformer  150  may be included in a residual processor. The residual processor may further include the subtractor  115 . 
     All or at least some of the plurality of components configuring the image encoding apparatus  100  may be configured by one hardware component (e.g., an encoder or a processor) in some embodiments. In addition, the memory  170  may include a decoded picture buffer (DPB) and may be configured by a digital storage medium. 
     The image partitioner  110  may partition an input image (or a picture or a frame) input to the image encoding apparatus  100  into one or more processing units. For example, the processing unit may be called a coding unit (CU). The coding unit may be acquired by recursively partitioning a coding tree unit (CTU) or a largest coding unit (LCU) according to a quad-tree binary-tree ternary-tree (QT/BT/TT) structure. For example, one coding unit may be partitioned into a plurality of coding units of a deeper depth based on a quad tree structure, a binary tree structure, and/or a ternary structure. For partitioning of the coding unit, a quad tree structure may be applied first and the binary tree structure and/or ternary structure may be applied later. The coding procedure according to the present disclosure may be performed based on the final coding unit that is no longer partitioned. The largest coding unit may be used as the final coding unit or the coding unit of deeper depth acquired by partitioning the largest coding unit may be used as the final coding unit. Here, the coding procedure may include a procedure of prediction, transform, and reconstruction, which will be described later. As another example, the processing unit of the coding procedure may be a prediction unit (PU) or a transform unit (TU). The prediction unit and the transform unit may be split or partitioned from the 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 the transform coefficient. 
     The prediction unit (the inter prediction unit  180  or the intra prediction unit  185 ) may perform prediction on a block to be processed (current block) and generate a predicted block including prediction samples for the current block. The prediction unit may determine whether intra prediction or inter prediction is applied on a current block or CU basis. The prediction unit may generate various information related to prediction of the current block and transmit the generated information to the entropy encoder  190 . The information on the prediction may be encoded in the entropy encoder  190  and output in the form of a bitstream. 
     The intra prediction unit  185  may predict the current block by referring to the samples in the current picture. The referred samples may be located in the neighborhood of the current block or may be located apart according to the intra prediction mode and/or the intra prediction technique. The intra prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The non-directional mode 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, more or less directional prediction modes may be used depending on a setting. The intra prediction unit  185  may determine the prediction mode applied to the current block by using a prediction mode applied to a neighboring block. 
     The inter prediction unit  180  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. In this case, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted in units of blocks, subblocks, or samples 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 (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block present in the current picture and a temporal neighboring block present in the reference picture. The reference picture including the reference block and the reference picture including the temporal neighboring block may be the same or different. The temporal neighboring block may be called a collocated reference block, a co-located CU (colCU), and the like. The reference picture including the temporal neighboring block may be called a collocated picture (colPic). For example, the inter prediction unit  180  may configure a motion information candidate list based on neighboring blocks and generate information specifying 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 prediction unit  180  may use motion information of the neighboring block as motion information of the current block. In the case of the skip mode, unlike the merge mode, the residual signal may not be transmitted. In the case of the 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 signaled by encoding a motion vector difference and an indicator for a motion vector predictor. The motion vector difference may mean a difference between the motion vector of the current block and the motion vector predictor. 
     The prediction unit may generate a prediction signal based on various prediction methods and prediction techniques described below. For example, the prediction unit may not only apply intra prediction or inter prediction but also simultaneously apply both intra prediction and inter prediction, in order to predict the current block. A prediction method of simultaneously applying both intra prediction and inter prediction for prediction of the current block may be called combined inter and intra prediction (CIIP). In addition, the prediction unit may perform intra block copy (IBC) for prediction of the current block. Intra block copy may be used for content image/video coding of a game or the like, for example, screen content coding (SCC). IBC is a method of predicting a current picture using a previously reconstructed reference block in the current picture at a location apart from the current block by a predetermined distance. When IBC is applied, the location of the reference block in the current picture may be encoded as a vector (block vector) corresponding to the predetermined distance. IBC basically performs prediction in the current picture, but may be performed similarly to inter prediction in that a reference block is derived within the current picture. That is, IBC may use at least one of the inter prediction techniques described in the present disclosure. 
     The prediction signal generated by the prediction unit may be used to generate a reconstructed signal or to generate a residual signal. The subtractor  115  may generate a residual signal (residual block or residual sample array) by subtracting the prediction signal (predicted block or prediction sample array) output from the prediction unit from the input image signal (original block or original sample array). The generated residual signal may be transmitted to the transformer  120 . 
     The transformer  120  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-loève 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 acquired 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 square. 
     The quantizer  130  may quantize the transform coefficients and transmit them to the entropy encoder  190 . The entropy encoder  190  may encode the quantized signal (information on the quantized transform coefficients) and output a bitstream. The information on the quantized transform coefficients may be referred to as residual information. The quantizer  130  may rearrange quantized transform coefficients in a block form into a one-dimensional vector form based on a coefficient scanning order and generate information on the quantized transform coefficients based on the quantized transform coefficients in the one-dimensional vector form. 
     The entropy encoder  190  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  190  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 in units of network abstraction layers (NALs) 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), or a video parameter set (VPS). In addition, the video/image information may further include general constraint information. The signaled information, transmitted information and/or syntax elements described in the present disclosure may be encoded through the above-described encoding procedure and included in the bitstream. 
     The bitstream may be transmitted over a network or may be stored in a digital storage medium. The network may include a broadcasting network and/or a communication network, 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) transmitting a signal output from the entropy encoder  190  and/or a storage unit (not shown) storing the signal may be included as internal/external element of the image encoding apparatus  100 . Alternatively, the transmitter may be provided as the component of the entropy encoder  190 . 
     The quantized transform coefficients output from the quantizer  130  may be used to generate a residual signal. For example, the residual signal (residual block or residual samples) may be reconstructed by applying dequantization and inverse transform to the quantized transform coefficients through the dequantizer  140  and the inverse transformer  150 . 
     The adder  155  adds the reconstructed residual signal to the prediction signal output from the inter prediction unit  180  or the intra prediction unit  185  to generate a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array). If there is no residual for the block to be processed, such as a case where the skip mode is applied, the predicted block may be used as the reconstructed block. The adder  155  may be called a reconstructor or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next block to be processed in the current picture and may be used for inter prediction of a next picture through filtering as described below. 
     The filter  160  may improve subjective/objective image quality by applying filtering to the reconstructed signal. For example, the filter  160  may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture and store the modified reconstructed picture in the memory  170 , specifically, a DPB of the memory  170 . The various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like. The filter  160  may generate various information related to filtering and transmit the generated information to the entropy encoder  190  as described later in the description of each filtering method. The information related to filtering may be encoded by the entropy encoder  190  and output in the form of a bitstream. 
     The modified reconstructed picture transmitted to the memory  170  may be used as the reference picture in the inter prediction unit  180 . When inter prediction is applied through the image encoding apparatus  100 , prediction mismatch between the image encoding apparatus  100  and the image decoding apparatus may be avoided and encoding efficiency may be improved. 
     The DPB of the memory  170  may store the modified reconstructed picture for use as a reference picture in the inter prediction unit  180 . The memory  170  may store the motion information of the block from which the motion information in the current picture is derived (or encoded) and/or the motion information of the blocks in the picture that have already been reconstructed. The stored motion information may be transmitted to the inter prediction unit  180  and used as the motion information of the spatial neighboring block or the motion information of the temporal neighboring block. The memory  170  may store reconstructed samples of reconstructed blocks in the current picture and may transfer the reconstructed samples to the intra prediction unit  185 . 
     Overview of Image Decoding Apparatus 
       FIG.  3    is a view schematically showing an image decoding apparatus, to which an embodiment of the present disclosure is applicable. 
     As shown in  FIG.  3   , the image decoding apparatus  200  may include an entropy decoder  210 , a dequantizer  220 , an inverse transformer  230 , an adder  235 , a filter  240 , a memory  250 , an inter prediction unit  260  and an intra prediction unit  265 . The inter prediction unit  260  and the intra prediction unit  265  may be collectively referred to as a “prediction unit”. The dequantizer  220  and the inverse transformer  230  may be included in a residual processor. 
     All or at least some of a plurality of components configuring the image decoding apparatus  200  may be configured by a hardware component (e.g., a decoder or a processor) according to an embodiment. In addition, the memory  250  may include a decoded picture buffer (DPB) or may be configured by a digital storage medium. 
     The image decoding apparatus  200 , which has received a bitstream including video/image information, may reconstruct an image by performing a process corresponding to a process performed by the image encoding apparatus  100  of  FIG.  2   . For example, the image decoding apparatus  200  may perform decoding using a processing unit applied in the image encoding apparatus. Thus, the processing unit of decoding may be a coding unit, for example. The coding unit may be acquired by partitioning a coding tree unit or a largest coding unit. The reconstructed image signal decoded and output through the image decoding apparatus  200  may be reproduced through a reproducing apparatus (not shown). 
     The image decoding apparatus  200  may receive a signal output from the image encoding apparatus of  FIG.  2    in the form of a bitstream. The received signal may be decoded through the entropy decoder  210 . For example, the entropy decoder  210  may parse the bitstream to derive information (e.g., video/image information) necessary for image reconstruction (or picture reconstruction). 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), or a video parameter set (VPS). In addition, the video/image information may further include general constraint information. The image decoding apparatus may further decode picture based on the information on the parameter set and/or the general constraint information. Signaled/received information and/or syntax elements described in the present disclosure may be decoded through the decoding procedure and obtained from the bitstream. For example, the entropy decoder  210  decodes the information in the bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, and output values of syntax elements required for image reconstruction and quantized values of transform coefficients for residual. More specifically, the CABAC entropy decoding method may receive a bin corresponding to each syntax element in the bitstream, determine a context model using a decoding target syntax element information, decoding information of a neighboring block and a decoding target block or information of a symbol/bin decoded in a previous stage, and perform arithmetic decoding on the bin by predicting a probability of occurrence of a bin according to the determined context model, and generate a symbol corresponding to the value of each syntax element. In this case, the CABAC entropy decoding method may update the context model by using the information of the decoded symbol/bin for a context model of a next symbol/bin after determining the context model. The information related to the prediction among the information decoded by the entropy decoder  210  may be provided to the prediction unit (the inter prediction unit  260  and the intra prediction unit  265 ), and the residual value on which the entropy decoding was performed in the entropy decoder  210 , that is, the quantized transform coefficients and related parameter information, may be input to the dequantizer  220 . In addition, information on filtering among information decoded by the entropy decoder  210  may be provided to the filter  240 . Meanwhile, a receiver (not shown) for receiving a signal output from the image encoding apparatus may be further configured as an internal/external element of the image decoding apparatus  200 , or the receiver may be a component of the entropy decoder  210 . 
     Meanwhile, the image decoding apparatus according to the present disclosure may be referred to as a video/image/picture decoding apparatus. The image decoding apparatus may be classified into an information decoder (video/image/picture information decoder) and a sample decoder (video/image/picture sample decoder). The information decoder may include the entropy decoder  210 . The sample decoder may include at least one of the dequantizer  220 , the inverse transformer  230 , the adder  235 , the filter  240 , the memory  250 , the inter prediction unit  260  or the intra prediction unit  265 . 
     The dequantizer  220  may dequantize the quantized transform coefficients and output the transform coefficients. The dequantizer  220  may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the rearrangement may be performed based on the coefficient scanning order performed in the image encoding apparatus. The dequantizer  220  may perform dequantization on the quantized transform coefficients by using a quantization parameter (e.g., quantization step size information) and obtain transform coefficients. 
     The inverse transformer  230  may inversely transform the transform coefficients to obtain a residual signal (residual block, residual sample array). 
     The prediction unit may perform prediction on the current block and generate a predicted block including prediction samples for the current block. The prediction unit may determine whether intra prediction or inter prediction is applied to the current block based on the information on the prediction output from the entropy decoder  210  and may determine a specific intra/inter prediction mode (prediction technique). 
     It is the same as described in the prediction unit of the image encoding apparatus  100  that the prediction unit may generate the prediction signal based on various prediction methods (techniques) which will be described later. 
     The intra prediction unit  265  may predict the current block by referring to the samples in the current picture. The description of the intra prediction unit  185  is equally applied to the intra prediction unit  265 . 
     The inter prediction unit  260  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. In this case, in order to reduce the amount of motion information transmitted in the inter prediction mode, motion information may be predicted in units of blocks, subblocks, or samples 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 (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block present in the current picture and a temporal neighboring block present in the reference picture. For example, the inter prediction unit  260  may configure a motion information candidate list based on neighboring blocks and derive a motion vector of the current block and/or a reference picture index based on the received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information on the prediction may include information specifying a mode of inter prediction for the current block. 
     The adder  235  may generate a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) by adding the obtained residual signal to the prediction signal (predicted block, predicted sample array) output from the prediction unit (including the inter prediction unit  260  and/or the intra prediction unit  265 ). If there is no residual for the block to be processed, such as when the skip mode is applied, the predicted block may be used as the reconstructed block. The description of the adder  155  is equally applicable to the adder  235 . The adder  235  may be called a reconstructor or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next block to be processed in the current picture and may be used for inter prediction of a next picture through filtering as described below. 
     The filter  240  may improve subjective/objective image quality by applying filtering to the reconstructed signal. For example, the filter  240  may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture and store the modified reconstructed picture in the memory  250 , specifically, a DPB of the memory  250 . The various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like. 
     The (modified) reconstructed picture stored in the DPB of the memory  250  may be used as a reference picture in the inter prediction unit  260 . The memory  250  may store the motion information of the block from which the motion information in the current picture is derived (or decoded) and/or the motion information of the blocks in the picture that have already been reconstructed. The stored motion information may be transmitted to the inter prediction unit  260  so as to be utilized as the motion information of the spatial neighboring block or the motion information of the temporal neighboring block. The memory  250  may store reconstructed samples of reconstructed blocks in the current picture and transfer the reconstructed samples to the intra prediction unit  265 . 
     In the present disclosure, the embodiments described in the filter  160 , the inter prediction unit  180 , and the intra prediction unit  185  of the image encoding apparatus  100  may be equally or correspondingly applied to the filter  240 , the inter prediction unit  260 , and the intra prediction unit  265  of the image decoding apparatus  200 . 
     Overview of Image Partitioning 
     The video/image coding method according to the present disclosure may be performed based on an image partitioning structure as follows. Specifically, the procedures of prediction, residual processing ((inverse) transform, (de)quantization, etc.), syntax element coding, and filtering, which will be described later, may be performed based on a CTU, CU (and/or TU, PU) derived based on the image partitioning structure. The image may be partitioned in block units and the block partitioning procedure may be performed in the image partitioner  110  of the encoding apparatus. The partitioning related information may be encoded by the entropy encoder  190  and transmitted to the decoding apparatus in the form of a bitstream. The entropy decoder  210  of the decoding apparatus may derive a block partitioning structure of the current picture based on the partitioning related information obtained from the bitstream, and based on this, may perform a series of procedures (e.g., prediction, residual processing, block/picture reconstruction, in-loop filtering, etc.) for image decoding. 
     Pictures may be partitioned into a sequence of coding tree units (CTUs).  FIG.  4    shows an example in which a picture is partitioned into CTUs. The CTU may correspond to a coding tree block (CTB). Alternatively, the CTU may include a coding tree block of luma samples and two coding tree blocks of corresponding chroma samples. For example, for a picture that contains three sample arrays, the CTU may include an N×N block of luma samples and two corresponding blocks of chroma samples. 
     Overview of Partitioning of CTU 
     As described above, the coding unit may be acquired by recursively partitioning the coding tree unit (CTU) or the largest coding unit (LCU) according to a quad-tree/binary-tree/ternary-tree (QT/BT/TT) structure. For example, the CTU may be first partitioned into quadtree structures. Thereafter, leaf nodes of the quadtree structure may be further partitioned by a multi-type tree structure. 
     Partitioning according to quadtree means that a current CU (or CTU) is partitioned into equally four. By partitioning according to quadtree, the current CU may be partitioned into four CUs having the same width and the same height. When the current CU is no longer partitioned into the quadtree structure, the current CU corresponds to the leaf node of the quad-tree structure. The CU corresponding to the leaf node of the quadtree structure may be no longer partitioned and may be used as the above-described final coding unit. Alternatively, the CU corresponding to the leaf node of the quadtree structure may be further partitioned by a multi-type tree structure. 
       FIG.  5    is a view showing an embodiment of a partitioning type of a block according to a multi-type tree structure. Partitioning according to the multi-type tree structure may include two types of splitting according to a binary tree structure and two types of splitting according to a ternary tree structure. 
     The two types of splitting according to the binary tree structure may include vertical binary splitting (SPLIT_BT_VER) and horizontal binary splitting (SPLIT_BT_HOR). Vertical binary splitting (SPLIT_BT_VER) means that the current CU is split into equally two in the vertical direction. As shown in  FIG.  4   , by vertical binary splitting, two CUs having the same height as the current CU and having a width which is half the width of the current CU may be generated. Horizontal binary splitting (SPLIT_BT_HOR) means that the current CU is split into equally two in the horizontal direction. As shown in  FIG.  5   , by horizontal binary splitting, two CUs having a height which is half the height of the current CU and having the same width as the current CU may be generated. 
     Two types of splitting according to the ternary tree structure may include vertical ternary splitting (SPLIT_TT_VER) and horizontal ternary splitting (SPLIT_TT_HOR). In vertical ternary splitting (SPLIT_TT_VER), the current CU is split in the vertical direction at a ratio of 1:2:1. As shown in  FIG.  5   , by vertical ternary splitting, two CUs having the same height as the current CU and having a width which is ¼ of the width of the current CU and a CU having the same height as the current CU and having a width which is half the width of the current CU may be generated. In horizontal ternary splitting (SPLIT_TT_HOR), the current CU is split in the horizontal direction at a ratio of 1:2:1. As shown in  FIG.  5   , by horizontal ternary splitting, two CUs having a height which is ¼ of the height of the current CU and having the same width as the current CU and a CU having a height which is half the height of the current CU and having the same width as the current CU may be generated. 
       FIG.  6    is a view showing a signaling mechanism of block splitting information in a quadtree with nested multi-type tree structure according to the present disclosure. 
     Here, the CTU is treated as the root node of the quadtree, and is partitioned for the first time into a quadtree structure. Information (e.g., qt_split_flag) specifying whether quadtree splitting is performed on the current CU (CTU or node (QT_node) of the quadtree) is signaled. For example, when qt_split_flag has a first value (e.g., “1”), the current CU may be quadtree-partitioned. In addition, when qt_split_flag has a second value (e.g., “0”), the current CU is not quadtree-partitioned, but becomes the leaf node (QT_leaf_node) of the quadtree. Each quadtree leaf node may then be further partitioned into multitype tree structures. That is, the leaf node of the quadtree may become the node (MTT_node) of the multi-type tree. In the multitype tree structure, a first flag (e.g., Mtt_split_cu_flag) is signaled to specify whether the current node is additionally partitioned. If the corresponding node is additionally partitioned (e.g., if the first flag is 1), a second flag (e.g., Mtt_split_cu_vertical_flag) may be signaled to specify the splitting direction. For example, the splitting direction may be a vertical direction if the second flag is 1 and may be a horizontal direction if the second flag is 0. Then, a third flag (e.g., Mtt_split_cu_binary_flag) may be signaled to specify whether the split type is a binary split type or a ternary split type. For example, the split type may be a binary split type when the third flag is 1 and may be a ternary split type when the third flag is 0. The node of the multi-type tree acquired by binary splitting or ternary splitting may be further partitioned into multi-type tree structures. However, the node of the multi-type tree may not be partitioned into quadtree structures. If the first flag is 0, the corresponding node of the multi-type tree is no longer split but becomes the leaf node (MTT_leaf_node) of the multi-type tree. The CU corresponding to the leaf node of the multi-type tree may be used as the above-described final coding unit. 
     Based on the mtt_split_cu_vertical_flag and the mtt_split_cu_binary_flag, a multi-type tree splitting mode (MttSplitMode) of a CU may be derived as shown in Table 1 below. In the following description, the multi-type tree splitting mode may be referred to as a multi-tree splitting type or splitting type. 
     
       
         
           
               
               
               
             
               
                 TABLE 1 
               
               
                   
               
               
                 MttSplitMode  
                 mtt_split_cu_vertical_flag  
                 mtt_split_cu_binary_flag 
               
               
                   
               
             
            
               
                 SPLIT_TT_HOR  
                 0  
                 0  
               
               
                 SPLIT_BT_HOR  
                 0  
                 1  
               
               
                 SPLIT_TT_VER  
                 1  
                 0  
               
               
                 SPLIT_BT_VER  
                 1  
                 1 
               
               
                   
               
            
           
         
       
     
       FIG.  7    is a view showing an example in which a CTU is partitioned into multiple CUs by applying a multi-type tree after applying a quadtree. In  FIG.  7   , bold block edges  710  represent quadtree partitioning and the remaining edges  720  represent multitype tree partitioning. The CU may correspond to a coding block (CB). In an embodiment, the CU may include a coding block of luma samples and two coding blocks of chroma samples corresponding to the luma samples. A chroma component (sample) CB or TB size may be derived based on a luma component (sample) CB or TB size according to the component ratio according to the color format (chroma format, e.g., 4:4:4, 4:2:2, 4:2:0 or the like) of the picture/image. In case of 4:4:4 color format, the chroma component CB/TB size may be set equal to be luma component CB/TB size. In case of 4:2:2 color format, the width of the chroma component CB/TB may be set to half the width of the luma component CB/TB and the height of the chroma component CB/TB may be set to the height of the luma component CB/TB. In case of 4:2:0 color format, the width of the chroma component CB/TB may be set to half the width of the luma component CB/TB and the height of the chroma component CB/TB may be set to half the height of the luma component CB/TB. 
     In an embodiment, when the size of the CTU is 128 based on the luma sample unit, the size of the CU may have a size from 128×128 to 4×4 which is the same size as the CTU. In one embodiment, in case of 4:2:0 color format (or chroma format), a chroma CB size may have a size from 64×64 to 2×2. 
     Meanwhile, in an embodiment, the CU size and the TU size may be the same. Alternatively, there may be a plurality of TUs in a CU region. The TU size generally represents a luma component (sample) transform block (TB) size. 
     The TU size may be derived based a largest allowable TB size maxTbSize which is a predetermined value. For example, when the CU size is greater than maxTbSize, a plurality of TUs (TBs) having maxTbSize may be derived from the CU and transform/inverse transform may be performed in units of TU (TB). For example, the largest allowable luma TB size may be 64×64 and the largest allowable chroma TB size may be 32×32. If the width or height of the CB partitioned according to the tree structure is larger than the largest transform width or height, the CB may be automatically (or implicitly) partitioned until the TB size limit in the horizontal and vertical directions is satisfied. 
     In addition, for example, when intra prediction is applied, an intra prediction mode/type may be derived in units of CU (or CB) and a neighboring reference sample derivation and prediction sample generation procedure may be performed in units of TU (or TB). In this case, there may be one or a plurality of TUs (or TBs) in one CU (or CB) region and, in this case, the plurality of TUs or (TBs) may share the same intra prediction mode/type. 
     Meanwhile, for a quadtree coding tree scheme with nested multitype tree, the following parameters may be signaled as SPS syntax elements from the encoding apparatus to the decoding apparatus. For example, at least one of a CTU size which is a parameter representing the root node size of a quadtree, MinQTSize which is a parameter representing the minimum allowed quadtree leaf node size, MaxBtSize which is a parameter representing the maximum allowed binary tree root node size, MaxTtSize which is a parameter representing the maximum allowed ternary tree root node size, MaxMttDepth which is a parameter representing the maximum allowed hierarchy depth of multi-type tree splitting from a quadtree leaf node, MinBtSize which is a parameter representing the minimum allowed binary tree leaf node size, or MinTtSize which is a parameter representing the minimum allowed ternary tree leaf node size is signaled. 
     As an embodiment of using 4:2:0 chroma format, the CTU size may be set to 128×128 luma blocks and two 64×64 chroma blocks corresponding to the luma blocks. In this case, MinOTSize may be set to 16×16, MaxBtSize may be set to 128×128, MaxTtSize may be set to 64×64, MinBtSize and MinTtSize may be set to 4×4, and MaxMttDepth may be set to 4. Quadtree partitioning may be applied to the CTU to generate quadtree leaf nodes. The quadtree leaf node may be called a leaf QT node. Quadtree leaf nodes may have a size from a 16×16 size (e.g., the MinOTSize) to a 128×128 size (e.g., the CTU size). If the leaf QT node is 128×128, it may not be additionally partitioned into a binary tree/ternary tree. This is because, in this case, even if partitioned, it exceeds MaxBtsize and MaxTtsize (e.g., 64×64). In other cases, leaf QT nodes may be further partitioned into a multitype tree. Therefore, the leaf QT node is the root node for the multitype tree, and the leaf QT node may have a multitype tree depth (mttDepth) 0 value. If the multitype tree depth reaches MaxMttdepth (e.g., 4), further partitioning may not be considered further. If the width of the multitype tree node is equal to MinBtSize and less than or equal to 2×MinTtSize, then no further horizontal partitioning may be considered. If the height of the multitype tree node is equal to MinBtSize and less than or equal to 2×MinTtSize, no further vertical partitioning may be considered. When partitioning is not considered, the encoding apparatus may skip signaling of partitioning information. In this case, the decoding apparatus may derive partitioning information with a predetermined value. 
     Meanwhile, one CTU may include a coding block of luma samples (hereinafter referred to as a “luma block”) and two coding blocks of chroma samples corresponding thereto (hereinafter referred to as “chroma blocks”). The above-described coding tree scheme may be equally or separately applied to the luma block and chroma block of the current CU. Specifically, the luma and chroma blocks in one CTU may be partitioned into the same block tree structure and, in this case, the tree structure is represented as SINGLE_TREE. Alternatively, the luma and chroma blocks in one CTU may be partitioned into separate block tree structures, and, in this case, the tree structure may be represented as DUAL_TREE. That is, when the CTU is partitioned into dual trees, the block tree structure for the luma block and the block tree structure for the chroma block may be separately present. In this case, the block tree structure for the luma block may be called DUAL_TREE_LUMA, and the block tree structure for the chroma component may be called DUAL_TREE_CHROMA. For P and B slice/tile groups, luma and chroma blocks in one CTU may be limited to have the same coding tree structure. However, for I slice/tile groups, luma and chroma blocks may have a separate block tree structure from each other. If the separate block tree structure is applied, the luma CTB may be partitioned into CUs based on a particular coding tree structure, and the chroma CTB may be partitioned into chroma CUs based on another coding tree structure. That is, this means that a CU in an I slice/tile group, to which the separate block tree structure is applied, may include a coding block of luma components or coding blocks of two chroma components and a CU of a P or B slice/tile group may include blocks of three color components (a luma component and two chroma components). 
     Although a quadtree coding tree structure with a nested multitype tree has been described, a structure in which a CU is partitioned is not limited thereto. For example, the BT structure and the TT structure may be interpreted as a concept included in a multiple partitioning tree (MPT) structure, and the CU may be interpreted as being partitioned through the QT structure and the MPT structure. In an example where the CU is partitioned through a QT structure and an MPT structure, a syntax element (e.g., MPT_split_type) including information on how many blocks the leaf node of the QT structure is partitioned into and a syntax element (ex. MPT_split_mode) including information on which of vertical and horizontal directions the leaf node of the QT structure is partitioned into may be signaled to determine a partitioning structure. 
     In another example, the CU may be partitioned in a different way than the QT structure, BT structure or TT structure. That is, unlike that the CU of the lower depth is partitioned into ¼ of the CU of the higher depth according to the QT structure, the CU of the lower depth is partitioned into ½ of the CU of the higher depth according to the BT structure, or the CU of the lower depth is partitioned into ¼ or ½ of the CU of the higher depth according to the TT structure, the CU of the lower depth may be partitioned into ⅕, ⅓, ⅜, ⅗, ⅔, or ⅝ of the CU of the higher depth in some cases, and the method of partitioning the CU is not limited thereto. 
     The quadtree coding block structure with the multi-type tree may provide a very flexible block partitioning structure. Because of the partition types supported in a multi-type tree, different partition patterns may potentially result in the same coding block structure in some cases. In the encoding apparatus and the decoding apparatus, by limiting the occurrence of such redundant partition patterns, a data amount of partitioning information may be reduced. 
     For example,  FIG.  8    shows redundant splitting patterns which may occur in binary tree splitting and ternary tree splitting. As shown in  FIG.  8   , continuous binary splitting  810  and  820  for one direction of two-step levels have the same coding block structure as binary splitting for a center partition after ternary splitting. In this case, binary tree splitting for center blocks  830  and  840  of ternary tree splitting may be prohibited. this prohibition is applicable to CUs of all pictures. When such specific splitting is prohibited, signaling of corresponding syntax elements may be modified by reflecting this prohibited case, thereby reducing the number of bits signaled for splitting. For example, as shown in the example shown in  FIG.  8   , when binary tree splitting for the center block of the CU is prohibited, a syntax element mtt_split_cu_binary_flag specifying whether splitting is binary splitting or ternary splitting is not signaled and the value thereof may be derived as 0 by a decoding apparatus. 
     Overview of Chroma Format 
     Hereinafter, a chroma format will be described. An image may be encoded into encoded data including a luma component (e.g., Y) array and two chroma component (e.g., Cb and Cr) arrays. For example, one pixel of the encoded image may include a luma sample and a chroma sample. A chroma format may be used to represent a configuration format of the luma sample and the chroma sample, and the chroma format may be referred to as a color format. 
     In an embodiment, an image may be encoded into various chroma formats such as monochrome, 4:2:0, 4:2:2 or 4:4:4. In monochrome sampling, there may be one sample array and the sample array may be a luma array. In 4:2:0 sampling, there may be one luma sample array and two chroma sample arrays, each of the two chroma arrays may have a height equal to half that of the luma array and a width equal to half that of the luma array. In 4:2:2 sampling, there may be one luma sample array and two chroma sample arrays, each of the two chroma arrays may have a height equal to that of the luma array and a width equal to half that of the luma array. In 4:4:4 sampling, there may be one luma sample array and two chroma sample arrays, and each of the two chroma arrays may have a height and width equal to those of the luma array. 
     For example, in 4:2:0 sampling, a chroma sample may be located below a luma sample corresponding thereto. In 4:2:2 sampling, a chroma sample may be located to overlap a luma sample corresponding thereto. In 4:4:4 sampling, both a luma sample and a chroma sample may be located at an overlapping position. 
     A chroma format used in an encoding apparatus and a decoding apparatus may be predetermined. Alternatively, a chroma format may be signaled from an encoding apparatus to a decoding apparatus to be adaptively used in the encoding apparatus and the decoding apparatus. In an embodiment, the chroma format may be signaled based on at least one of chroma_format_idc or separate_colour_plane_flag. At least one of chroma_format_idc or separate_colour_plane_flag may be signaled through higher level syntax such as DPS, VPS, SPS or PPS. For example, chroma_format_idc and separate_colour_plane_flag may be included in SPS syntax shown in  FIG.  9   . 
     Meanwhile,  FIG.  10    shows an embodiment of chroma format classification using signaling of chroma_format_idc and separate_colour_plane_flag. chroma_format_idc may be information specifying a chroma format applying to an encoded image. separate_colour_plane_flag may specify whether a color array is separately processed in a specific chroma format. For example, a first value (e.g., 0) of chroma_format_idc may specify monochrome sampling. A second value (e.g., 1) of chroma_format_idc may specify 4:2:0 sampling. A third value (e.g., 2) of chroma_format_idc may specify 4:2:2 sampling. A fourth value (e.g., 3) of chroma_format_idc may specify 4:4:4 sampling. 
     In 4:4:4, the following may apply based on the value of separate_colour_plane_flag. If the value of separate_colour_plane_flag is a first value (e.g., 0), each of two chroma arrays may have the same height and width as a luma array. In this case, a value of ChromaArrayType specifying a type of a chroma sample array may be set equal to chroma_format_idc. If the value of separate_colour_plane_flag is a second value (e.g., 1), luma, Cb and Cr sample arrays may be separately processed and processed along with monochrome-sampled pictures. In this case, ChromaArrayType may be set to 0. 
     Intra Prediction on Chroma Block 
     When intra prediction is performed on a current block, prediction on a luma component block (luma block) of the current block and prediction on a chroma component block (chroma block) may be performed. In this case, the intra prediction mode for the chroma block may be set separately from the intra prediction mode for the luma block. 
     For example, the intra prediction mode for the chroma block may be specified based on intra chroma prediction mode information, and the intra chroma prediction mode information may be signaled in the form of an intra_chroma_pred_mode syntax element. For example, the intra chroma prediction mode information may represent one of a planar mode, a DC mode, a vertical mode, a horizontal mode, a derived mode (DM), and a cross-component linear model (CCLM) mode. Here, the planar mode may specify intra prediction mode #0, the DC mode may specify intra prediction mode #1, the vertical mode may specify intra prediction mode #26, and the horizontal mode may specify intra prediction mode #10. DM may also be referred to as a direct mode. The CCLM may also be referred to as a linear model (LM). The CCLM mode may include at least one of L_CCLM, T_CCLM and LT_CCLM. 
     Meanwhile, the DM and the CCLM are dependent intra prediction modes for predicting the chroma block using information on the luma block. The DM may represent a mode in which the same intra prediction mode as the intra prediction mode for the luma component applies as the intra prediction mode for the chroma component. In addition, the CCLM may represent an intra prediction mode using, as the prediction samples of the chroma block, samples derived by subsampling reconstructed samples of the luma block and then applying α and β which are CCLM parameters to subsampled samples in a process of generating the prediction block for the chroma block. 
     CCLM (Cross-Component Linear Model) Mode 
     As described above, a CCLM mode may apply to a chroma block. The CCLM mode is an intra prediction mode using correlation between a luma block and a chroma block corresponding to the luma block, and is performed by deriving a linear model based on neighboring samples of the luma block and neighboring samples of the chroma block. In addition, a prediction sample of the chroma block may be derived based on the derived linear model and the reconstructed samples of the luma block. 
     Specifically, when the CCLM mode applies to a current chroma block, parameters for a linear model may be derived based on neighboring samples used for intra prediction of the current chroma block and neighboring samples used for intra prediction of a current luma block. For example, the linear model for CCLM may be expressed based on the following equation.
 
pred c ( i,j )=α·rec L ′( i,j )+β  [Equation 1]
 
     where, pred c (i,j) may denote the prediction sample of (i, j) coordinates of the current chroma block in the current CU. rec L ′(i,j) may denote the reconstructed sample of (i, j) coordinates of the current luma block in the CU. For example, rec L ′(i,j) may denote the down-sampled reconstructed sample of the current luma block. Linear model coefficients α and β may be signaled or derived from neighboring samples. 
     Overview of Palette Mode 
     Hereinafter, a palette mode will be described. An encoding apparatus according to an embodiment may encode an image using a palette mode, and a decoding apparatus may decode an image using a palette mode in a manner corresponding thereto. The palette mode may be called a palette encoding mode, an intra palette mode, an intra palette encoding mode, etc. The palette mode may be regarded as a type of intra encoding mode or may be regarded as one of intra prediction methods. However, similarly to the above-described skip mode, a separate residual value for the corresponding block may not be signaled. 
     In an embodiment, the palette mode may be used to improve encoding efficiency in encoding screen content which is an image generated by a computer including a significant amount of text and graphics. In general, a local area of the image generated as screen content is separated by sharp edges, and is expressed with a small number of colors. In order to utilize this characteristic, in the palette mode, samples for one block may be expressed by indices specifying a color entry of the palette table. 
     To apply a palette mode, information on a palette table may be signaled. In an embodiment, the palette table may include an index value corresponding to each color. To signal the index value, palette index prediction information may be signaled. The palette index prediction information may include an index value for at least a portion of a palette index map. In the palette index map, pixels of video data may be mapped to color indices of the palette table. 
     The palette index prediction information may include run value information. For at least a portion of the palette index map, the run value information may associate a run value with an index value. One run value may be associated with an escape color index. The palette index map may be generated from the palette index prediction information. For example, at least a portion of the palette index map may be generated by determining whether to adjust the index value of the palette index prediction information based on a last index value. 
     A current block in a current picture may be encoded or reconstructed according to the palette index map. When applying the palette mode, a pixel value in a current coding unit may be expressed as a small set of representative color values. Such a set may be called a palette. For pixels having a value close to a palette color, the palette index may be signaled. For pixels having a value which does not belong to (is out of) the palette, the corresponding pixels may be denoted by an escape symbol and a quantized pixel value may be directly signaled. In this document, a pixel or a pixel value may be described as a sample. 
     In order to encode a block encoded in the palette mode, a decoding apparatus may decode a palette color and an index. The palette color may be described in the palette table, and may be encoded using a palette table coding tool. An escape flag may be signaled for each coding unit. The escape flag may specify whether an escape symbol is present in a current coding unit. If the escape symbol is present, the palette table may be increased by 1 unit (e.g., index unit) and a last index may be designated as an escape mode. The palette indices of all pixels for one coding unit may configure the palette index map, and may be encoded using a palette index map coding tool. 
     For example, in order to encode the palette table, a palette predictor may be maintained. The palette predictor may be initialized at a start point of each slice. For example, the palette predictor may be reset to 0. For each entry of the palette predictor, a reuse flag specifying whether it is a portion of a current palette may be signaled. The reuse flag may be signaled using run-length coding of a value of 0. 
     Thereafter, numbers for new palette entries may be signaled using a zero-order exponential Golomb code. Finally, component values for a new palette entry may be signaled. After encoding a current coding unit, the palette predictor may be updated using the current palette, and an entry from a previous palette predictor which is not reused in the current palette (until reaching an allowed maximum size) may be added to an end of a new palette predictor and this may be referred to as palette stuffing. 
     For example, in order to encode the palette index map, indices may be encoded using horizontal or vertical scan. A scan order may be signaled through a bitstream using palette_transpose_flag which is a parameter specifying a scan direction. For example, when horizontal scan applies to scan indices for samples in a current coding unit, palette_transpose_flag may have a first value (e.g., 0) and when vertical scan applies, palette_transpose_flag may have a second value (e.g., 1).  FIG.  11    shows an embodiment of horizontal scan and vertical scan according to an embodiment. 
     In addition, in an embodiment, the palette index may be encoded using an ‘INDEX’ mode and a ‘COPY_ABOVE’ mode. Except for the case where the mode of the palette index is signaled for an uppermost row when horizontal scan is used, the case where the mode of the palette index is signaled for a leftmost column when vertical scan is used, and the case where an immediately previous mode is ‘COPY_ABOVE’, the two modes may be signaled using one flag. 
     In an ‘INDEX’ mode, the palette index may be explicitly signaled. For a ‘INDEX’ mode and a ‘COPY_ABOVE’ mode, a run value specifying the number of pixels encoded using the same mode may be signaled. 
     An encoding order for an index map may be set as follows. First, the number of index values for a coding unit may be signaled. This may be performed after signaling of an actual index value for the entire coding unit using truncated binary coding. Both the number of indices and the index values may be coded in a bypass mode. Through this, bypass bins related to the index may be grouped. Then, the palette mode (INDEX or COPY_ABOVE) and the run value may be signaled using an interleaving method. 
     Finally, component escape values corresponding to escape samples for the entire coding unit may be mutually grouped and encoded in a bypass mode. last_run_type_flag which is an additional syntax element may be signaled after signaling the index value. By using last_run_type_flag along with the number of indices, signaling of a run value corresponding to a last run in the block may be skipped. 
     In an embodiment, a dual tree type, in which independent coding unit partitioning is performed on a luma component and a chroma component, may be used for an I slice. The palette mode may apply to the luma component and the chroma component individually or together. If the dual tree does not apply, the palette mode is applicable to all Y, Cb and Cr components. 
     In an embodiment, a syntax element for the palette mode may be encoded and signaled as shown in  FIGS.  12  to  19   .  FIG.  12    to  FIG.  13    show consecutive syntax in a coding unit (CU) for a palette mode, and  FIGS.  14  to  19    show consecutive syntax for a palette mode. 
     Hereinafter, each syntax element will be described. pred_mode_plt_flag which is a palette mode flag may specify whether the palette mode applies to a current coding unit. For example, a first value (e.g., 0) of pred_mode_plt_flag may specify that the palette mode does not apply to the current coding unit. A second value (e.g., 1) of pred_mode_plt_flag may specify that the palette mode applies to the current coding unit. When pred_mode_plt_flag is not obtained from a bitstream, the value of pred_mode_plt_flag may be determined to be the first value. 
     A parameter PredictorPaletteSize[startComp] may specify the size of a predictor palette for startComp which is a first color component of a current palette table. 
     A parameter PalettePredictorEntryReuseFlags[i] may be information specifying whether to reuse an entry. For example, a first value (e.g., 0) of PalettePredictorEntryReuseFlags[i] may specify that an i-th entry of the predictor palette may specify that the i-th entry of the predictor palette is not an entry of a current palette and a second value (e.g., 1) may specify that the i-th entry of the predictor palette may be reused in the current palette. For use of PalettePredictorEntryReuseFlags[i], an initial value may be set to 0. 
     A parameter palette_predictor_run may specify the number of 0s present before a non-zero entry in an array PalettePredictorEntryReuseFlags. 
     A parameter num_signalled_palette_entries may specify the number of entries in the current palette explicitly signaled for a first color component startComp of the current palette table. When num_signalled_palette_entries is not obtained from the bitstream, the value of num_signalled_palette_entries may be determined to be 0. 
     A parameter CurrentPaletteSize[startComp] may specify the size of the current palette for the first color component startComp of the current palette table. This may be calculated as shown in the following equation. The value of CurrentPaletteSize[startComp] may have a range from 0 to palette_max_size.
 
CurrentPaletteSize[startComp]=NumPredictedPaletteEntries+num_signalled_palette_entries  [Equation 2]
 
     A parameter new_palette_entries[cIdx][i] may specify a value of a palette entry i-th-signaled for a color component cIdx. 
     A parameter PredictorPaletteEntries[cIdx][i] may specify an i-th element in a predictor palette for the color component cIdx. 
     A parameter CurrentPaletteEntries[cIdx][i] may specify an i-th element in the current palette for the color component cIdx. PredictorPaletteEntries and CurrentPaletteEntries may be generated as shown in the equation of  FIG.  20   . 
     A parameter palette_escape_val_present_flag may specify whether an escape coding sample is present. For example, a first value (e.g., 0) of palette_escape_val_present_flag may specify that the escape coding sample is present for the current coding unit, and a second value (e.g., 1) of palette_escape_val_present_flag may specify that the current coding unit includes at least one escape coding sample. When palette_escape_val_present_flag is not obtained from the bitstream, the value of palette_escape_val_present_flag may be determined to be 1. 
     A parameter MaxPaletteIndex may specify a maximum available value of a palette index for the current coding unit. The value of MaxPaletteIndex may be determined to be CurrentPaletteSize[startComp]+palette_escape_val_present_flag. 
     A parameter num_palette_indices_minus1 may specify the number of palette indices explicitly or implicitly signaled for a current block. For example, a value obtained by adding 1 to num_palette_indices_minus1 may specify the number of palette indices explicitly or implicitly signaled for the current block. When num_palette_indices_minus 1 is not included in the bitstream, the value of num_palette_indices_minus 1 may be determined to be 0. 
     A parameter palette_idx_idc may be an indicator of an index for the palette table CurrentPaletteEntries. The value of palette_idx_idc may have a value of 0 to MaxPaletteIndex for a first index of the corresponding block, and may have a value of 0 to MaxPaletteIndex−1 for the remaining indices of the corresponding block. When the value of palette_idx_idc is not obtained from the bitstream, the value of palette_idx_jdc may be determined to be 0. 
     A parameter PaletteIndexIdc[i] may be an array storing the value of the i-th palette_idx_jdc signaled explicitly or implicitly. The values of all elements of PaletteIndexIdc[i] may be initialized to 0. 
     A parameter copy_above_indices_for_final_run_flag may specify information specifying whether to copy a previous index for a last run, a first value (e.g., 0) may specify that the palette index at a last position of the current coding unit is explicitly or implicitly signaled through the bitstream, and a second value (e.g., 1) may specify that the palette index at the last position of the current coding unit is explicitly or implicitly signaled through the bitstream. When copy_above_indices_for_final_run_flag is not obtained from the bitstream, the value of copy_above_indices_for_final_run_flag may be determined to be 0. 
     A parameter palette_transpose_flag may be information specifying a scan method used to scan an index for a pixel of a current coding unit. For example, a first value (e.g., 0) of palette_transpose_flag may specify that horizontal scan applies to scan an index for a pixel of a current coding unit, and a second value (e.g., 1) of palette_transpose_flag may specify that vertical scan applies to scan an index for a pixel of a current coding unit. When palette_transpose_flag is not obtained from the bitstream, the value of palette_transpose_flag may be determined to be 0. 
     A first value (e.g., 0) of a parameter copy_above_palette_indices_flag may specify that an indicator specifying the palette index of a sample is obtained or derived from an encoded value of the bitstream. A second value (e.g., 1) of copy_above_palette_indices_flag may specify that the palette index is the same as the palette index of a neighboring sample. For example, the neighboring sample may be a sample located at the same position as the current sample in a left column of the current sample when vertical scan is currently used. Alternatively, the neighboring sample may be a sample located at the same position as the current sample in a top row of the current sample when horizontal scan is current used. 
     A first value (e.g., 0) of a parameter CopyAboveIndicesFlag[xC][yC] may specify that the palette index is explicitly or implicitly obtained from the bitstream. A second value (e.g., 1) may specify that a palette index is generated by copying a palette index of a left column when vertical scan is currently used or by copying a palette index of a top row when horizontal scan is currently used. Here, xC and yC are coordinate indicators relatively specifying the position of the current sample from the top-left sample of the current picture. PaletteIndexMap[xC][yC] may have a value of 0 to (MaxPaletteIndex−1). 
     A parameter PaletteIndexMap[xC][yC] may specify a palette index and, for example, specify an index for an array represented by CurrentPaletteEntries. Array indices xC and yC are coordinate indicators specifying the coordinates of a current sample relative to the top-left sample of a current picture as described above. PaletteIndexMap[xC][yC] may have a value of 0 to (MaxPaletteIndex−1). 
     A parameter PaletteRun may specify the number of consecutive positions having the same palette index, when the value of CopyAboveIndicesFlag[xC][yC] is 0. Meanwhile, when the value of CopyAboveIndicesFlag[xC][yC] is 1, PaletteRun may specify the number of consecutive positions having the same palette index as a palette index at a position in a top row when a current scan direction is horizontal scan and a palette index at a position in a left column when the current scan direction is vertical scan. 
     A parameter PaletteMaxRun may specify a maximum available value of PaletteRun. The value of PaletteMaxRun may be an integer greater than 0. 
     A parameter palette_run_prefix may specify a prefix portion used for binarization of PaletteRun. 
     A parameter palette_run_suffix may specify a suffix portion used for binarization of PaletteRun. When palette_run_suffix is not obtained from a bitstream, the value thereof may be determined to be 0. 
     The value of PaletteRun may be determined as follows. For example, when the value of palette_run_prefix is less than 2, this may be calculated as follows.
 
PaletteRun=palette_run_prefix  [Equation 3]
 
     Otherwise, when the value of palette_run_prefix is equal to or greater than 2, this may be calculated as follows.
 
PrefixOffset=1&lt;&lt;(palette_run_prefix−1)
 
PaletteRun=PrefixOffset+palette_run_suffix  [Equation 4]
 
     A parameter palette_escape_val may specify a quantized escape coding sample value for a component. A parameter PaletteEscapeVal[cIdx][xC][yC] may specify an escape value of a sample with a PaletteIndexMap[xC][yC] value of (MaxPaletteIndex−1) and a palette_escape_val_present_flag value of 1. Here, cIdx may specify a color component. Array indicators xC and yC may be position indicators specifying relative distances of the position of the current sample from the top-left sample of the current picture, as described above. 
     Chroma Prediction Mode Signaling when Applying Palette Mode 
     Hereinafter, a method of signaling chroma prediction mode information when applying a palette mode will be described. In an embodiment, chroma prediction encoding such as CCLM may not apply to a coding unit (or coding block) to which the palette mode applies. In addition, intra_chroma_pred_mode may not be signaled for a coding unit to which the palette mode applies. 
     Upon determining that CCLM is available for a chroma component, an on/off flag therefor may be signaled. In an embodiment, availability of CCLM may be determined using sps_palette_enabled_flag or sps_plt_enabled_flag, and the on/off flag of CCLM may be signaled using sps_palette_enabled_flag or sps_plt_enabled_flag. 
     Meanwhile, in the example of  FIG.  13   , signaling of CCLM information (e.g., cclm_mode_flag) does not consider whether to apply a palette mode of a coding unit. For example, in the example of  FIG.  13   , an embodiment in which predetermined chroma prediction information (e.g., cclm_mode_flag, intra_chroma_pred_mode) is signaled when a palette mode does not apply to a current coding unit or when a coding unit is not a dual tree chroma is described. 
     In this case, as predetermined chroma prediction information is signaled in a palette-coded block in a single tree, unnecessary syntax signaling may occur. In addition, as the predetermined chroma prediction information is signaled, even though a chroma component in a coding unit is encoded in a palette mode, chroma intra prediction according to CCLM may be performed and chroma intra prediction according to a DM mode may be performed. 
     In order to solve the above-described problem, syntax for a coding unit may be modified as shown in  FIG.  21   .  FIG.  21    shows syntax of a coding unit specifying that predetermined chroma intra prediction information  2120  is obtained from a bitstream, when a value of pred_mode_plt_flag  2110  which is a parameter specifying whether a palette mode applies to a current coding unit is a first value (e.g., 0) specifying that the palette mode does not apply. In addition, the syntax of  FIG.  21    specifies that the predetermined chroma intra prediction information  2120  is not obtained from the bitstream when the value of pred_mode_plt_flag  2110  is a second value (e.g., 1) specifying that the palette mode applies. 
     As in the embodiment of  FIG.  21   , to signal the predetermined chroma prediction information (e.g., cclm_mode_flag, intra_chroma_pred_mode), the predetermined chroma prediction information (e.g., cclm_mode_flag, intra_chroma_pred_mode) may be signaled depending on whether the palette mode applies to the current coding unit. 
     Hereinafter, signaling of predetermined chroma intra prediction information according to the syntax of  FIG.  21    will be described with reference to  FIG.  22   . An encoding apparatus or decoding apparatus according to an embodiment may determine whether a palette mode applies to a current coding unit (e.g., a coding block) (S 2210 ). For example, the decoding apparatus may determine whether the palette mode applies to the current coding unit according to a value of pred_mode_plt_flag. 
     Next, when the palette mode applies to the current coding unit, the encoding apparatus may encode the corresponding coding unit in the palette mode, and the decoding apparatus may decode the corresponding coding unit in the palette mode. Therefore, the encoding apparatus or the decoding apparatus may not signal predetermined chroma prediction information (S 2220 ). For example, the encoding apparatus may not encode the predetermined chroma prediction information (e.g., cclm_mode_flag, intra_chroma_pred_mode), and the decoding apparatus may not obtain the predetermined chroma prediction information from a bitstream. 
     Next, when the palette mode does not apply to the current coding unit, the encoding apparatus or the decoding apparatus may signal the predetermined chroma prediction information. In an embodiment, the encoding apparatus or the decoding apparatus may determine whether a CCLM mode is available for the current coding unit (S 2230 ), signal a CCLM parameter if available (S 2240 ), and signal an intra_chroma_pred_mode parameter if not available (S 2250 ). 
     For this, step of obtaining chroma prediction information by the decoding apparatus will be described in greater detail with reference to  FIG.  23   . When the palette mode does not apply to the current coding unit (S 2310 ), the decoding apparatus may determine whether the CCLM mode is available for the current coding unit (S 2320 ). For example, a parameter sps_cclm_enabled_flag specifying availability of the CCLM mode signaled in a sequence parameter set has a first value (e.g., 0) specifying that the CCLM mode is not available, the decoding apparatus may determine that the CCLM mode is not available for the current coding unit. Alternatively, when sps_cclm_enabled_flag has a second value (e.g., 1) specifying that the cclm mode is available, a slice type parameter sh_slice_type transmitted through a slice header specifies that a current slice type is not an I slice or a size of a luma component of a current block is less than 64, the decoding apparatus may determine that the CCLM mode is available for the current coding unit. Alternatively, when sps_cclm_enabled_flag has a second value (e.g., 1) specifying that the cclm mode is available, each coding tree unit (CTU) in which a sps_qtbtt_dual_tree_intra_flag parameter signaled in a sequence parameter set is included in an I slice is split into luma component blocks having a size of 64×64, and it does not indicate that each CTU becomes a header node of a dual tree, the decoding apparatus may determine that the CCLM mode is available for the current coding unit. 
     When the CCLM mode is available, the decoding apparatus may determine whether the CCLM applies to the current coding unit (S 2330 ). For example, the decoding apparatus may obtain a cclm_mode_flag parameter from the bitstream. The parameter cclm_mode_flag may specify whether to apply the CCLM mode. A first value (e.g., 0) of cclm_mode_flag may specify that the CCLM mode does not apply. A second value (e.g., 1) of cclm_mode_flag may specify that the CCLM mode of any one of T_CCLM, L_CCLM and LT_CCLM is applicable. When the value of cclm_mode_flag is not obtained from the bitstream, the value of cclm_mode_flag may be determined to be 0. 
     When applying the CCLM mode (e.g., cclm_mode_flag==1), the decoding apparatus may obtain a parameter cclm_mode_idx from the bitstream (S 2340 ). The parameter cclm_mode_idx may specify an index specifying a CCLM mode used to decode a chroma component of a current coding unit among T_CCLM, L_CCLM and LT_CCLM. 
     Meanwhile, when the CCLM mode is not available or the CCLM mode does not apply (e.g., cclm_mode_flag==0), the decoding apparatus may obtain a parameter intra_chroma_pred_mode from the bitstream (S 2350 ). As described above, the parameter intra_chroma_pred_mode may specify an intra prediction mode used to decode a chroma component of a current coding unit. For example, the intra_chroma_pred_mode may specify one of a planar mode, a DC mode, a vertical mode, a horizontal mode and a derived mode (DM)). 
     Encoding Method 
     Hereinafter, a method of performing encoding by an encoding apparatus according to an embodiment using the above-described method will be described with reference to  FIG.  24   . The encoding apparatus according to an embodiment includes a memory and at least one processor, and the at least one processor may perform the following encoding method. 
     First, the encoding apparatus may determine a current block by splitting an image (S 2410 ). For example, the encoding apparatus may determine the current block by splitting image as described above with reference to  FIGS.  4  to  6   . In a splitting process according to an embodiment, image splitting information may be encoded, and the encoded image splitting information may be generated as a bitstream. 
     Next, the encoding apparatus may determine a prediction mode of the current block (S 2420 ). Next, the encoding apparatus may encode a palette mode flag (e.g., pred_mode_plt_flag) specifying that the prediction mode of the current block is a palette mode, based on whether the prediction mode of the current mode is a palette mode (S 2430 ). The encoded palette mode flag may be generated as a bitstream. 
     Next, the encoding apparatus may encode palette mode encoding information in which the current block is encoded in the palette mode, based on a tree type of the current block and whether the prediction mode of the current block is a palette mode (S 2440 ). For example, upon determining that the palette mode applies, the encoding apparatus may generate a bitstream by generating palette mode encoding information using palette_coding( ) syntax as described with reference to  FIGS.  14  to  19   . 
     Meanwhile, encoding the palette mode encoding information of the current block may include encoding the palette mode encoding information of a luma component of the current block. For example, when the tree type of the current block is a single tree type or a dual tree luma type and the palette mode is applied for the current block, information for palette mode prediction of the luma component of the current block may be encoded, and a bitstream may be generated using the encoded information. 
     In this case, the palette mode encoding information of the luma component of the current block may be encoded based on a size of the luma component block of the current block. For example, as in the embodiment of  FIG.  13   , the encoding apparatus may generate the palette mode encoding information as a bitstream according to palette_coding( ) syntax defined based on a width (e.g., cbWidth) of the luma component block of the current block and a height (e.g., cbHeight) of the luma component block of the current block. 
     In addition, encoding the palette mode encoding information of the current block may further include encoding the palette mode encoding information of a chroma component of the current block. For example, when the palette mode is applied for the current block and a tree type of the current block is a dual tree chroma type, information for palette mode prediction of the chroma component of the current block may be encoded and a bitstream may be generated using the encoded information. 
     In this case, the palette mode encoding information of the chroma component of the current block may be encoded based on a size of the chroma component block of the current block. For example, as in the embodiment of  FIG.  13   , the encoding apparatus may generate the palette mode encoding information as a bitstream, according to palette_coding( ) syntax defined based on a width (e.g., cbWidth/subWidthC) of the chroma component block of the current block and a height (e.g., cbHeight/subHeightC) of the chroma component block of the current block. Here, subWidthC and subHeightC may be ratios of the height and the width of the luma component block to the chroma component block. In an embodiment, subWidthC and subHeightC may be determined based on chroma_format_idc and separate_cour_plane_flag as shown in  FIG.  10   . 
     Next, when the prediction mode of the current block is not a palette mode, the encoding apparatus may encode chroma component prediction information of the current block (S 2450 ). The chroma component prediction information may be information (e.g., cclm_mode_flag, cclm_mode_idx) for CCLM (Cross-component linear model) prediction or chroma component intra prediction information (e.g., intra_chroma_pred_mode). 
     Meanwhile, when the palette mode applies to the current block, the encoding apparatus may not encode the chroma component prediction information. 
     More specifically, information on CCLM prediction may include a CCLM flag (e.g., cclm_mode_flag) specifying whether CCLM prediction is performed and a CCLM mode index (e.g., cclm_mode_idx) specifying a mode of CCLM prediction. The CCLM flag may be encoded and generated as a bitstream, when CCLM prediction is available for the current block. The CCLM mode index may be encoded and generated as the bitstream, when the CCLM flag specifies that CCLM prediction is performed. 
     Meanwhile, when the CCLM flag specifies that CCLM prediction is not performed, the chroma component intra prediction information (e.g., intra_chroma_pred_mode) may be encoded and generated as the bitstream. 
     Decoding Method 
     Hereinafter, a method of performing decoding by a decoding apparatus according to an embodiment using the above-described method will be described with reference to  FIG.  25   . The decoding apparatus according to an embodiment may include a memory and at least one processor, and the at least one processor may perform the following decoding method. 
     First, the decoding apparatus may determine a current block by splitting an image (S 2510 ). For example, the decoding apparatus may determine the current block by splitting the image as described above with reference to  FIGS.  4  to  6   . In a splitting process according to an embodiment, image splitting information obtained from a bitstream may be used. 
     Next, the decoding apparatus may identify whether a palette mode is applied for the current block, based on a palette mode flag (e.g., pred_mode_plt_flag) obtained from the bitstream (S 2520 ). 
     Next, the decoding apparatus may obtain the palette mode encoding information of the current block from the bitstream, based on a tree type of the current block and whether the palette mode is applied for the current block (S 2530 ). For example, upon determining that the palette mode is applied, the decoding apparatus may obtain the palette mode encoding information from the bitstream using palette_coding( ) syntax as described with reference to  FIGS.  14  to  19   . 
     Meanwhile, obtaining the palette mode encoding information of the current block may include obtaining the palette mode encoding information of a luma component of the current block. For example, when the tree type of the current block is a single tree type or a dual tree luma type and the palette mode is applied for the current block, information for palette mode prediction of the luma component of the current block may be obtained from the bitstream. 
     In this case, the palette mode encoding information of the luma component of the current block may be obtained based on a size of the luma component block of the current block. For example, as in the embodiment of  FIG.  13   , palette_coding( ) syntax may be performed based on a width (e.g., cbWidth) of the luma component block of the current block and a height (e.g., cbHeight) of the luma component block of the current block. 
     Meanwhile, obtaining the palette mode encoding information of the current block may further include obtaining the palette mode encoding information of the chroma component of the current block. For example, when the palette mode is applied for the current block and a tree type of the current block is a dual tree chroma type, information for palette mode prediction of the chroma component of the current block may be obtained from the bitstream. 
     In this case, the palette mode encoding information of the chroma component of the current block may be obtained based on a size of the chroma component block of the current block. For example, as in the embodiment of  FIG.  13   , palette_coding( ) syntax may be performed based on a width (e.g., cbWidth/subWidthC) of the chroma component block of the current block and a height (e.g., cbHeight/subHeightC) of the chroma component block of the current block. Here, subWidthC and subHeightC may be ratios of the height and the width of the luma component block to the chroma component block. In an embodiment, subWidthC and subHeightC may be determined based on chroma_format_idc and separate_colour_plane_flag as shown in  FIG.  10   . 
     Next, when the palette mode is not applied for the current block, the decoding apparatus may obtain chroma component prediction information of the current block from the bitstream (S 2540 ). For example, when the palette mode is not applied, the decoding apparatus may obtain CCLM prediction information (e.g., cclm_mode_flag, cclm_mode_idx) or chroma component intra prediction information (e.g., intra_chroma_pred_mode) from the bitstream as described with reference to  FIG.  23   . Meanwhile, when the palette mode is not applied for the current block, the chroma component prediction information may not be obtained from the bitstream. 
     More specifically, information for CCLM prediction may include a CCLM flag (e.g., cclm_mode_flag) specifying whether CCLM prediction is performed and a CCLM mode index (e.g., cclm_mode_idx) specifying a mode of CCLM prediction. The CCLM flag may be obtained from the bitstream when the CCLM prediction is available for the current block. The CCLM mode index may be obtained from the bitstream when the CCLM flag specifies that the CCLM prediction is performed. 
     Meanwhile, when the CCLM flag specifies that CCLM prediction is not performed, the chroma component intra prediction information (e.g., intra_chroma_pred_mode) may be obtained from the bitstream. 
     Application Embodiment 
     While the exemplary methods of the present disclosure described above are represented as a series of operations for clarity of description, it is not intended to limit the order in which the steps are performed, and the steps may be performed simultaneously or in different order as necessary. In order to implement the method according to the present disclosure, the described steps may further include other steps, may include remaining steps except for some of the steps, or may include other additional steps except for some steps. 
     In the present disclosure, the image encoding apparatus or the image decoding apparatus that performs a predetermined operation (step) may perform an operation (step) of confirming an execution condition or situation of the corresponding operation (step). For example, if it is described that predetermined operation is performed when a predetermined condition is satisfied, the image encoding apparatus or the image decoding apparatus may perform the predetermined operation after determining whether the predetermined condition is satisfied. 
     The various embodiments of the present disclosure are not a list of all possible combinations and are intended to describe representative aspects of the present disclosure, and the matters described in the various embodiments may be applied independently or in combination of two or more. 
     Various embodiments of the present disclosure may be implemented in hardware, firmware, software, or a combination thereof. In the case of implementing the present disclosure by hardware, the present disclosure can be implemented with application specific integrated circuits (ASICs), Digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), general processors, controllers, microcontrollers, microprocessors, etc. 
     In addition, the image decoding apparatus and the image encoding apparatus, to which the embodiments of the present disclosure are applied, may be included in a multimedia broadcasting transmission and reception device, 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 OTT video (over the top video) device, an Internet streaming service providing device, a three-dimensional (3D) video device, a video telephony video device, a medical video device, and the like, and may be used to process video signals or data signals. For example, the OTT video devices 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), or the like. 
       FIG.  26    is a view showing a contents streaming system, to which an embodiment of the present disclosure is applicable. 
     As shown in  FIG.  26   , the contents streaming system, to which the embodiment of the present disclosure is applied, may largely include an encoding server, a streaming server, a web server, a media storage, a user device, and a multimedia input device. 
     The encoding server compresses contents input from multimedia input devices such as a smartphone, a camera, a camcorder, etc. into digital data to generate a bitstream and transmits the bitstream to the streaming server. As another example, when the multimedia input devices such as smartphones, cameras, camcorders, etc. directly generate a bitstream, the encoding server may be omitted. 
     The bitstream may be generated by an image encoding method or an image encoding apparatus, to which the embodiment of the present disclosure is applied, and the streaming server may temporarily store the bitstream in the process of transmitting or receiving the bitstream. 
     The streaming server transmits the multimedia data to the user device based on a user&#39;s request through the web server, and the web server serves as a medium for informing the user of a service. When the user requests a desired service from the web server, the web server may deliver it to a streaming server, and the streaming server may transmit multimedia data to the user. In this case, the contents streaming system may include a separate control server. In this case, the control server serves to control a command/response between devices in the contents streaming system. 
     The streaming server may receive contents from a media storage and/or an encoding server. For example, when the contents are received from the encoding server, the contents may be received in real time. In this case, in order to provide a smooth streaming service, the streaming server may store the bitstream for a predetermined time. 
     Examples of the user device may include a mobile phone, a smartphone, a laptop computer, a digital broadcasting terminal, a personal digital assistant (PDA), a portable multimedia player (PMP), navigation, a slate PC, tablet PCs, ultrabooks, wearable devices (e.g., smartwatches, smart glasses, head mounted displays), digital TVs, desktops computer, digital signage, and the like. 
     Each server in the contents streaming system may be operated as a distributed server, in which case data received from each server may be distributed. 
     The scope of the disclosure includes software or machine-executable commands (e.g., an operating system, an application, firmware, a program, etc.) for enabling operations according to the methods of various embodiments to be executed on an apparatus or a computer, a non-transitory computer-readable medium having such software or commands stored thereon and executable on the apparatus or the computer. 
     INDUSTRIAL APPLICABILITY 
     The embodiments of the present disclosure may be used to encode or decode an image.