[go: up one dir, main page]

WO2019199093A1 - Intra prediction mode-based image processing method and device therefor - Google Patents

Intra prediction mode-based image processing method and device therefor Download PDF

Info

Publication number
WO2019199093A1
WO2019199093A1 PCT/KR2019/004390 KR2019004390W WO2019199093A1 WO 2019199093 A1 WO2019199093 A1 WO 2019199093A1 KR 2019004390 W KR2019004390 W KR 2019004390W WO 2019199093 A1 WO2019199093 A1 WO 2019199093A1
Authority
WO
WIPO (PCT)
Prior art keywords
intra prediction
prediction mode
degrees
sample
current block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/KR2019/004390
Other languages
French (fr)
Korean (ko)
Inventor
이령
ν—ˆμ§„
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
LG Electronics Inc
Original Assignee
LG Electronics Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by LG Electronics Inc filed Critical LG Electronics Inc
Publication of WO2019199093A1 publication Critical patent/WO2019199093A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103Selection of coding mode or of prediction mode
    • H04N19/105Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103Selection of coding mode or of prediction mode
    • H04N19/11Selection of coding mode or of prediction mode among a plurality of spatial predictive coding modes
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/132Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques

Definitions

  • the present invention relates to a still image or moving image processing method, and more particularly, to a method for encoding / decoding a still image or moving image based on an intra prediction mode and an apparatus supporting the same.
  • Compression coding refers to a series of signal processing techniques for transmitting digitized information through a communication line or for storing in a form suitable for a storage medium.
  • Media such as an image, an image, an audio, and the like may be a target of compression encoding.
  • a technique of performing compression encoding on an image is called video image compression.
  • Next-generation video content will be characterized by high spatial resolution, high frame rate and high dimensionality of scene representation. Processing such content would result in a tremendous increase in terms of memory storage, memory access rate, and processing power.
  • An object of the present invention is to propose a method for performing intra prediction using bi-directional reference samples in order to reduce prediction error and improve compression performance.
  • An aspect of the present invention is a method of decoding an image based on an intra prediction mode, wherein when bi-directional intra prediction is applied to a current block, based on available reference samples around the current block Configuring an intra prediction mode set used for the bidirectional intra prediction; Parsing a prediction mode index indicating an intra prediction mode applied to the current block within the intra prediction mode set; Deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode; And weighting the first reference sample and the second reference sample to generate a prediction sample of the current block, wherein the set of intra prediction modes is within a specific angular range determined according to the available direction of the reference sample. It may be configured to include a predefined number of intra prediction modes in.
  • said intra prediction mode set is within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. It may be configured to include intra prediction modes.
  • said intra prediction mode set is within an angle range greater than or equal to 0 degrees and less than 90 degrees and an angle range greater than or equal to 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include intra prediction modes.
  • the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees when left, right and top reference samples around the current block are available.
  • a weight applied to the first reference sample and the second reference sample, respectively is based on a ratio of the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. Can be determined.
  • an intra prediction mode set configuration unit constituting an intra prediction mode set used for the bidirectional intra prediction based on the basis;
  • a prediction mode index parser for parsing a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set;
  • a reference sample derivation unit for deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on a prediction direction of the intra prediction mode;
  • a prediction sample generator for weighting the first reference sample and the second reference sample to generate a prediction sample of the current block, wherein the intra prediction mode set is a specific angle determined according to an available direction of the reference sample. It may be configured to include a predefined number of intra prediction modes within a range.
  • said intra prediction mode set is within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. And decode the intra prediction modes.
  • said intra prediction mode set is within an angle range greater than or equal to 0 degrees and less than 90 degrees and an angle range greater than or equal to 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include intra prediction modes.
  • the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees when left, right and top reference samples around the current block are available.
  • a weight applied to the first reference sample and the second reference sample, respectively is based on a ratio of the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. Can be determined.
  • the prediction error can be reduced and the coding efficiency can be improved.
  • FIG. 1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.
  • FIG. 2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.
  • FIG. 3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.
  • FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.
  • FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.
  • FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.
  • FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.
  • FIGS. 8 and 9 are diagrams illustrating an intra prediction based video / image encoding method and an intra prediction unit in an encoding apparatus according to an embodiment of the present invention.
  • FIGS. 10 and 11 are diagrams illustrating an intra prediction based video / image decoding method and an intra prediction unit in a decoding apparatus according to an embodiment of the present invention.
  • FIG. 12 and 13 illustrate a prediction direction of an intra prediction mode according to an embodiment to which the present invention may be applied.
  • FIG. 14 is a diagram for describing a prediction angle of an intra prediction mode according to an embodiment to which the present invention is applied.
  • 15 is a diagram illustrating a method of performing intra prediction using an available reference sample according to an embodiment to which the present invention is applied.
  • 16 to 18 are diagrams illustrating the directionality of an intra prediction mode determined according to an available reference sample as an embodiment to which the present invention is applied.
  • 19 is a diagram illustrating a method of generating a predictive sample through bidirectional intra prediction as an embodiment to which the present invention is applied.
  • 20 is a flowchart illustrating a method of generating an intra prediction block according to an embodiment to which the present invention is applied.
  • 21 is a diagram illustrating an intra prediction apparatus according to an embodiment to which the present invention is applied.
  • FIG. 22 shows a video coding system to which the present invention is applied.
  • FIG. 23 is a diagram illustrating a structure of a content streaming system according to an embodiment to which the present invention is applied.
  • the 'processing unit' refers to a unit in which a process of encoding / decoding such as prediction, transformation, and / or quantization is performed.
  • the processing unit may be referred to as a 'processing block' or 'block'.
  • the processing unit may be interpreted to include a unit for the luma component and a unit for the chroma component.
  • the processing unit may correspond to a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), or a Transform Unit (TU).
  • CTU Coding Tree Unit
  • CU Coding Unit
  • PU Prediction Unit
  • TU Transform Unit
  • the processing unit may be interpreted as a unit for a luma component or a unit for a chroma component.
  • the processing unit may be a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a luma component. May correspond to. Or, it may correspond to a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a chroma component.
  • CTB coding tree block
  • CB coding block
  • PU prediction block
  • TB transform block
  • the present invention is not limited thereto, and the processing unit may be interpreted to include a unit for a luma component and a unit for a chroma component.
  • processing unit is not necessarily limited to square blocks, but may also be configured in a polygonal form having three or more vertices.
  • a pixel, a pixel, and the like are referred to collectively as samples.
  • using a sample may mean using a pixel value or a pixel value.
  • FIG. 1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.
  • the encoding apparatus 100 may include an image splitter 110, a subtractor 115, a transformer 120, a quantizer 130, an inverse quantizer 140, an inverse transformer 150,
  • the adder 155, the filter 160, the memory 170, the inter predictor 180, the intra predictor 185, and the entropy encoder 190 may be configured.
  • the inter predictor 180 and the intra predictor 185 may be collectively referred to as a predictor.
  • the predictor may include an inter predictor 180 and an intra predictor 185.
  • the transform unit 120, the quantization unit 130, the inverse quantization unit 140, and the inverse transform unit 150 may be included in the residual processing unit.
  • the residual processing unit may further include a subtracting unit 115.
  • the image divider 110, the subtractor 115, the transformer 120, the quantizer 130, the inverse quantizer 140, the inverse transformer 150, and the adder 155 may be described.
  • the filtering unit 160, the inter prediction unit 180, the intra prediction unit 185, and the entropy encoding unit 190 may be configured by one hardware component (eg, an encoder or a processor).
  • the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.
  • DPB decoded picture buffer
  • the image divider 110 may divide the input image (or picture or frame) input to the encoding apparatus 100 into one or more processing units.
  • the processing unit may be called a coding unit (CU).
  • the coding unit may be recursively divided according to a quad-tree binary-tree (QTBT) structure from a coding tree unit (CTU) or a largest coding unit (LCU).
  • QTBT quad-tree binary-tree
  • CTU coding tree unit
  • LCU largest coding unit
  • one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad tree structure and / or a binary tree structure.
  • the quad tree structure may be applied first and the binary tree structure may be applied later.
  • the binary tree structure may be applied first.
  • the coding procedure according to the present invention may be performed based on the final coding unit that is no longer split.
  • the maximum coding unit may be used as the final coding unit immediately based on coding efficiency according to the image characteristic, or if necessary, the coding unit is recursively divided into coding units of lower depths and optimized.
  • a coding unit of size may be used as the final coding unit.
  • the coding procedure may include a procedure of prediction, transform, and reconstruction, which will be described later.
  • the processing unit may further include a prediction unit (PU) or a transform unit (TU).
  • the prediction unit and the transform unit may be partitioned or partitioned from the aforementioned final coding unit, respectively.
  • the prediction unit may be a unit of sample prediction
  • the transformation unit may be a unit for deriving a transform coefficient and / or a unit for deriving a residual signal from the transform coefficient.
  • an M ⁇ N block may represent a set of samples or transform coefficients composed of M columns and N rows.
  • a sample may generally represent a pixel or a value of a pixel, and may only represent pixel / pixel values of the luma component, or only pixel / pixel values of the chroma component.
  • a sample may be used as a term corresponding to one picture (or image) for a pixel or a pel.
  • the encoding apparatus 100 subtracts the prediction signal (predicted block, prediction sample array) output from the inter prediction unit 180 or the intra prediction unit 185 from the input image signal (original block, original sample array).
  • a signal may be generated (residual signal, residual block, residual sample array), and the generated residual signal is transmitted to the converter 120.
  • a unit that subtracts a prediction signal (prediction block, prediction sample array) from an input image signal (original block, original sample array) in the encoder 100 may be called a subtraction unit 115.
  • the prediction unit may perform a prediction on a block to be processed (hereinafter, referred to as a 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. As described later in the description of each prediction mode, the prediction unit may generate various information related to prediction, such as prediction mode information, and transmit the generated information to the entropy encoding unit 190. The information about the prediction may be encoded in the entropy encoding unit 190 and output in the form of a bitstream.
  • the intra predictor 185 may predict the current block by referring to the samples in the current picture.
  • the referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • Non-directional mode may include, for example, DC mode and planner mode (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, as an example, more or less directional prediction modes may be used depending on the setting.
  • the intra predictor 185 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
  • the inter predictor 180 may derive the predicted block with respect to the current block based on the reference block (reference sample array) specified by the motion vector on the reference picture.
  • the motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of the 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.
  • the neighboring block may include a spatial neighboring block existing 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 referred to as a collocated reference block, a collocated CU (colCU), and the like, and a reference picture including the temporal neighboring block is called a collocated picture (colPic). It may be.
  • the inter prediction unit 180 constructs a motion information candidate list based on neighboring blocks and provides information indicating which candidates are used to derive a motion vector and / or a reference picture index of the current block. Can be generated. Inter prediction may be performed based on various prediction modes.
  • the inter prediction unit 180 may use motion information of a neighboring block as motion information of a current block.
  • the residual signal may not be transmitted.
  • the motion vector of the neighboring block is used as a motion vector predictor and the motion vector difference is signaled by signaling a motion vector difference. Can be directed.
  • the prediction signal generated by the inter predictor 180 or the intra predictor 185 may be used to generate a reconstruction signal or to generate a residual signal.
  • the transformer 120 may apply transform techniques to the residual signal to generate transform coefficients.
  • the transformation technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a karhunen-loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT).
  • DCT discrete cosine transform
  • DST discrete sine transform
  • KLT karhunen-loeve transform
  • GBT graph-based transform
  • CNT conditionally non-linear transform
  • GBT means a conversion obtained from this graph when the relationship information between pixels is represented by a graph.
  • CNT refers to a transform that is generated based on and generates a prediction signal using all previously reconstructed pixels.
  • the conversion process may be applied to pixel blocks having the same size as the square, or may be applied to blocks of variable size rather than square.
  • the quantization unit 130 quantizes the transform coefficients and transmits them to the entropy encoding unit 190.
  • the entropy encoding unit 190 encodes the quantized signal (information about the quantized transform coefficients) and outputs the bitstream. have.
  • the information about the quantized transform coefficients may be referred to as residual information.
  • the quantization unit 130 may rearrange block quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and quantize the quantized transform coefficients based on the quantized transform coefficients in the one-dimensional vector form. Information about transform coefficients may be generated.
  • the entropy encoding unit 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 encoding unit 190 may encode information necessary for video / image reconstruction other than quantized transform coefficients (for example, values of syntax elements) together or separately.
  • Encoded information eg, encoded video / image information
  • NALs network abstraction layer
  • the network may include a broadcasting network and / or a communication network
  • the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like.
  • the signal output from the entropy encoding unit 190 may include a transmitting unit (not shown) for transmitting and / or a storing unit (not shown) for storing as an internal / external element of the encoding apparatus 100, or the transmitting unit It may be a component of the entropy encoding unit 190.
  • the quantized transform coefficients output from the quantization unit 130 may be used to generate a prediction signal.
  • the quantized transform coefficients may be reconstructed in the residual signal by applying inverse quantization and inverse transform through inverse quantization unit 140 and inverse transform unit 150 in a loop.
  • the adder 155 adds the reconstructed residual signal to the predicted signal output from the inter predictor 180 or the intra predictor 185 so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) is added. Can be generated. 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 adder 155 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.
  • the filtering unit 160 may improve subjective / objective image quality by applying filtering to the reconstruction signal.
  • the filtering unit 160 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture is stored in the memory 170, specifically, the 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 filtering unit 160 may generate various information about the filtering and transmit the generated information to the entropy encoding unit 190.
  • the filtering information may be encoded in the entropy encoding unit 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 predictor 180.
  • the encoding apparatus may avoid prediction mismatch between the encoding apparatus 100 and the decoding apparatus, and may improve encoding efficiency.
  • the memory 170 DPB may store the modified reconstructed picture for use as a reference picture in the inter predictor 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 predictor 180 to use 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 transfer the reconstructed samples to the intra predictor 185.
  • FIG. 2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.
  • the decoding apparatus 200 includes an entropy decoding unit 210, an inverse quantizer 220, an inverse transform unit 230, an adder 235, a filter 240, a memory 250, and an inter
  • the prediction unit 260 and the intra prediction unit 265 may be configured.
  • the inter predictor 260 and the intra predictor 265 may be collectively called a predictor. That is, the predictor may include an inter predictor 180 and an intra predictor 185.
  • the inverse quantization unit 220 and the inverse transform unit 230 may be collectively called a residual processing unit. That is, the residual processing unit may include an inverse quantization unit 220 and an inverse transformation unit 230.
  • the entropy decoder 210, the inverse quantizer 220, the inverse transformer 230, the adder 235, the filter 240, the inter predictor 260, and the intra predictor 265 are described in the embodiment. Can be configured by one hardware component (eg, decoder or processor).
  • the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.
  • DPB decoded picture buffer
  • the decoding apparatus 200 may reconstruct an image corresponding to a process in which video / image information is processed in the encoding apparatus of FIG. 1.
  • the decoding apparatus 200 may perform decoding using a processing unit applied in the encoding apparatus.
  • the processing unit of decoding may be a coding unit, for example, which may be split along a quad tree structure and / or a binary tree structure from a coding tree unit or a maximum coding unit.
  • the reconstructed video signal decoded and output through the decoding apparatus 200 may be reproduced through the reproducing apparatus.
  • the decoding apparatus 200 may receive a signal output from the encoding apparatus of FIG. 1 in the form of a bitstream, and the received signal may be decoded through the entropy decoding unit 210.
  • the entropy decoding unit 210 may parse the bitstream to derive information (eg, video / image information) necessary for image reconstruction (or picture reconstruction).
  • the entropy decoding unit 210 decodes information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, quantized values of syntax elements required for image reconstruction, and transform coefficients for residuals. Can be output.
  • the CABAC entropy decoding method receives a bin corresponding to each syntax element in a bitstream, and decodes syntax element information and decoding information of neighboring and decoding target blocks or information of symbols / bins decoded in a previous step.
  • the context model may be determined using the context model, the probability of occurrence of a bin may be predicted according to the determined context model, and arithmetic decoding of the bin may be performed to generate a symbol corresponding to the value of each syntax element. have.
  • the CABAC entropy decoding method may update the context model by using the information of the decoded symbol / bin for the context model of the next symbol / bean after determining the context model.
  • the information related to the prediction among the information decoded by the entropy decoding unit 2110 is provided to the prediction unit (the inter prediction unit 260 and the intra prediction unit 265), and the entropy decoding performed by the entropy decoding unit 210 is performed. Dual values, that is, quantized transform coefficients and related parameter information, may be input to the inverse quantizer 220.
  • information on filtering among information decoded by the entropy decoding unit 210 may be provided to the filtering unit 240.
  • a receiver (not shown) that receives a signal output from the encoding apparatus may be further configured as an internal / external element of the decoding apparatus 200, or the receiver may be a component of the entropy decoding unit 210.
  • the inverse quantization unit 220 may dequantize the quantized transform coefficients and output the transform coefficients.
  • the inverse quantization unit 220 may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the reordering may be performed based on the coefficient scan order performed by the encoding apparatus.
  • the inverse quantization unit 220 may perform inverse quantization on quantized transform coefficients using a quantization parameter (for example, quantization step size information), and may obtain transform coefficients.
  • a quantization parameter for example, quantization step size information
  • the inverse transformer 230 inversely transforms 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 about the prediction output from the entropy decoding unit 210, and may determine a specific intra / inter prediction mode.
  • the intra predictor 265 may predict the current block by referring to samples in the current picture.
  • the referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode.
  • prediction modes may include a plurality of non-directional modes and a plurality of directional modes.
  • the intra predictor 265 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.
  • the inter prediction unit 260 may derive the predicted block for the current block based on the reference block (reference sample array) specified by the motion vector on the reference picture.
  • the motion information may be predicted in units of blocks, subblocks, or samples based on the correlation of the 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.
  • the neighboring block may include a spatial neighboring block existing in the current picture and a temporal neighboring block present in the reference picture.
  • the inter prediction unit 260 may construct a motion information candidate list based on neighboring blocks and derive a motion vector and / or a reference picture index of the current block based on the received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information about the prediction may include information indicating a mode of inter prediction for the current block.
  • the adder 235 adds the obtained residual signal to the predictive signal (predicted block, predictive sample array) output from the inter predictor 260 or the intra predictor 265 to restore the reconstructed signal (reconstructed picture, reconstructed block). , Restore sample array). 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 adder 235 may be called a restoration unit or a restoration block generation unit.
  • the generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.
  • the filtering unit 240 may improve subjective / objective image quality by applying filtering to the reconstruction signal.
  • the filtering unit 240 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture may be stored in the memory 250, specifically, the DPB of the memory 250. Can be sent to.
  • 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 the reference picture in the inter predictor 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 are already reconstructed.
  • the stored motion information may be transmitted to the inter predictor 260 to use 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 transfer the reconstructed samples to the intra predictor 265.
  • the embodiments described by the filtering unit 160, the inter prediction unit 180, and the intra prediction unit 185 of the encoding apparatus 100 are respectively the filtering unit 240 and the inter prediction of the decoding apparatus 200. The same may also apply to the unit 260 and the intra predictor 265.
  • the video / image coding method according to this document may be performed based on various detailed techniques, and each detailed technique will be described as follows. Techniques described below include prediction, residual processing ((inverse) transformation, (inverse) quantization, etc.), syntax element coding, filtering, partitioning / division, etc. in the video / image encoding / decoding procedures described above and / or described below. It will be apparent to those skilled in the art that they may be involved in related procedures.
  • the block partitioning procedure according to this document may be performed by the image splitter 110 of the encoding apparatus described above, and the partitioning related information may be processed (encoded) by the entropy encoding unit 190 and transmitted to the decoding apparatus in the form of a bitstream. .
  • the entropy decoding unit 210 of the decoding apparatus derives a block partitioning structure of the current picture based on the partitioning related information obtained from the bitstream, and based on this, a series of procedures (eg, prediction and residual) for image decoding. Processing, block reconstruction, in-loop filtering, etc.).
  • the CTU may correspond to a coding tree block (CTB).
  • CTB coding tree block
  • the CTU may include a coding tree block of luma samples and two coding tree blocks of corresponding chroma samples.
  • the CTU may include an N ⁇ N block of luma samples and two corresponding blocks of chroma samples.
  • the maximum allowable size of the CTU for coding and prediction may be different from the maximum allowable size of the CTU for transform.
  • the maximum allowable size of the luma block in the CTU may be 128x128.
  • the CTU may be divided into CUs based on a quad-tree (QT) structure.
  • the quadtree structure may be referred to as a quaternary tree structure. This is to reflect various local characteristics.
  • the CTU may be divided based on a multitype tree structure partition including a binary tree (BT) and a ternary tree (TT) as well as a quad tree.
  • the QTBT structure may include a quadtree and binary tree based partition structure
  • the QTBTTT may include a quadtree, binary tree, and ternary tree based partition structure.
  • the QTBT structure may include a quadtree, binary tree and ternary tree based partitioning structure.
  • a coding tree structure a CU may have a square or rectangular shape.
  • the CTU may first be divided into quadtree structures. After that, the leaf nodes of the quadtree structure may be further divided by the multitype tree structure.
  • FIG. 3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.
  • the multitype tree structure may include four partition types as shown in FIG.
  • the four types of split include vertical binary splitting (SPLIT_BT_VER), horizontal binary splitting (SPLIT_BT_HOR), vertical ternary splitting (SPLIT_TT_VER), and horizontal ternary splitting (SPLIT_TT_HOR). ) May be included.
  • Leaf nodes of the multitype tree structure may be called CUs. These CUs can be used for prediction and transform procedures.
  • CU, PU, and TU may have the same block size in this document. However, when the maximum supported transform length is smaller than the width or height of the color component of the CU, the CU and the TU may have different block sizes.
  • FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.
  • the CTU is treated as the root of the quadtree, and is partitioned for the first time into a quadtree structure.
  • Each quadtree leaf node may then be further partitioned into a multitype tree structure.
  • a first flag (ex. Mtt_split_cu_flag) is signaled to indicate whether the node is additionally partitioned.
  • a second flag (ex. Mtt_split_cu_verticla_flag) may be signaled to indicate the splitting direction.
  • a third flag (ex. Mtt_split_cu_binary_flag) may be signaled to indicate whether the partition type is binary partition or ternary partition.
  • a multi-type tree splitting mode (MttSplitMode) of a CU may be derived as shown in Table 1 below.
  • FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.
  • the CU may correspond to a coding block (CB).
  • the CU may include a coding block of luma samples and two coding blocks of corresponding chroma samples.
  • the size of a CU may be as large as CTU, or may be cut by 4 ⁇ 4 in luma sample units. For example, in the 4: 2: 0 color format (or chroma format), the maximum chroma CB size may be 64x64 and the minimum chroma CB size may be 2x2.
  • the maximum allowable luma TB size may be 64x64 and the maximum allowable chroma TB size may be 32x32. If the width or height of the CB divided according to the tree structure is larger than the maximum transform width or height, the CB may be automatically (or implicitly) split until the TB size limit in the horizontal and vertical directions is satisfied.
  • the following parameters may be defined and identified as SPS syntax elements.
  • CTU size the root node size of a quaternary tree
  • MinQTSize the minimum allowed quaternary tree leaf node size
  • MaxBtSize the maximum allowed binary tree root node size
  • MaxTtSize the maximum allowed ternary tree root node size
  • MaxMttDepth the maximum allowed hierarchy depth of multi-type tree splitting from a quadtree leaf
  • MinBtSize the minimum allowed binary tree leaf node size
  • MinTtSize the minimum allowed ternary tree leaf node size
  • the CTU size may be set to 64x64 blocks of 128x128 luma samples and two corresponding chroma samples (in 4: 2: 0 chroma format).
  • MinOTSize can be set to 16x16
  • MaxBtSize to 128x128, MaxTtSzie to 64x64
  • MinBtSize and MinTtSize (for both width and height) to 4x4, and MaxMttDepth to 4.
  • Quarttree 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 128x128 size (i.e. the CTU size) from a 16x16 size (i.e. the MinOTSize). If the leaf QT node is 128x128, it may not be additionally divided into a binary tree / a ternary tree. This is because in this case, even if split, it exceeds MaxBtsize and MaxTtszie (i.e. 64x64). 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.
  • mttDepth multitype tree depth
  • FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.
  • TT partitioning may be limited in certain cases. For example, when the width or height of the luma coding block is greater than a predetermined specific value (eg, 32 and 64), TT partitioning may be limited as shown in FIG. 6.
  • a predetermined specific value e.g, 32 and 64
  • the coding tree scheme may support that the luma and chroma blocks have separate block tree structures.
  • luma and chroma CTBs in one CTU may be limited to have the same coding tree structure.
  • luma and chroma blocks may have a separate block tree structure from each other. If an individual block tree mode is applied, the luma CTB may be split into CUs based on a particular coding tree structure, and the chroma CTB may be split into chroma CUs based on another coding tree structure. This may mean that a CU in an I slice may consist of a coding block of a luma component or coding blocks of two chroma components, and a CU of a P or B slice may be composed of blocks of three color components.
  • a quadtree coding tree structure involving a multitype tree has been described, but a structure in which a CU is divided is not limited thereto.
  • 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 to be divided through the QT structure and the MPT structure.
  • MPT multiple partitioning tree
  • a syntax element eg, MPT_split_type
  • MPT_split_mode a syntax element that contains information about which direction is divided into and horizontally.
  • the CU may be partitioned in a different way than the QT structure, BT structure or TT structure. That is, according to the QT structure, the CU of the lower depth is divided into 1/4 size of the CU of the upper depth, or the CU of the lower depth is divided into 1/2 size of the CU of the upper depth according to the BT structure, or according to the TT structure. Unlike the CU of the lower depth is divided into 1/4 or 1/2 size of the CU of the upper depth, the CU of the lower depth is sometimes 1/5, 1/3, 3/8, 3 of the CU of the upper depth. It can be divided into / 5, 2/3 or 5/8 size, the way in which the CU is divided is not limited to this.
  • the tree node block is placed so that all samples of all coded CUs are located within the picture boundaries. May be limited. In this case, for example, the following division rule may be applied.
  • the block is forced to be split with QT split mode.
  • the block is forced to be split with SPLIT_BT_HOR mode
  • the block is forced to be split with QT split mode.
  • the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_HOR mode.
  • the block is forced to be split with SPLIT_BT_HOR mode.
  • the block is forced to be split with QT split mode.
  • the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_VER mode.
  • the block is forced to be split with SPLIT_BT_VER mode.
  • the quadtree coded block structure with the multi-type tree described above can provide a very flexible block partitioning structure. Because of the partition types supported in a multitype tree, different partition patterns can sometimes lead to potentially identical coding block structure results. By limiting the occurrence of such redundant partition patterns, the data amount of partitioning information can be reduced. It demonstrates with reference to the following drawings.
  • FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.
  • two levels of consecutive binary splits in one direction have the same coding block structure as the binary split for the center partition after the ternary split.
  • the binary tree split in the given direction for the center partition of the ternary tree split may be limited. This restriction can be applied for CUs of all pictures. If this particular partitioning is restricted, the signaling of the corresponding syntax elements can be modified to reflect this limited case, thereby reducing the number of bits signaled for partitioning. For example, as shown in FIG.
  • the mtt_split_cu_binary_flag syntax element indicating whether the split is a binary split or a tenary split is not signaled, and its value is Can be inferred by the decoder to zero.
  • the decoded portion of the current picture or other pictures in which the current processing unit is included may be used to reconstruct the current processing unit in which decoding is performed.
  • Intra picture or I picture which uses only the current picture for reconstruction, i.e. performs only intra picture prediction, predicts a picture (slice) using at most one motion vector and reference index to predict each unit
  • a picture using a predictive picture or P picture (slice), up to two motion vectors, and a reference index (slice) may be referred to as a bi-predictive picture or a B picture (slice).
  • Inter prediction means a prediction method of deriving a current processing block based on data elements (eg, sample values or motion vectors, etc.) of pictures other than the current picture. That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in other reconstructed pictures other than the current picture.
  • data elements eg, sample values or motion vectors, etc.
  • intra prediction (or intra prediction) will be described in more detail.
  • Intra prediction or intra prediction
  • Intra prediction means a prediction method that derives the current processing block from data elements (eg, sample values, etc.) of the same decoded picture (or slice). That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in the current picture.
  • data elements eg, sample values, etc.
  • Intra prediction may indicate prediction for generating a prediction sample for a current block based on reference samples outside the current block in a picture to which the current block belongs (hereinafter, referred to as a current picture).
  • the present invention describes the detailed description of the intra prediction method described above with reference to FIGS. 1 and 2, and the decoder may be represented by the intra prediction-based video / image decoding method of FIG. 10 described later and the intra prediction unit in the decoding apparatus of FIG. 11. .
  • the encoder may be represented by the intra prediction-based video / video encoding method of FIG. 8 and the intra prediction unit in the encoding apparatus of FIG. 9.
  • the data encoded by FIGS. 8 and 9 may be stored in the form of a bitstream.
  • peripheral reference samples to be used for intra prediction of the current block may be derived.
  • the peripheral reference samples of the current block are samples adjacent to the left boundary of the current block of size nWxnH and a total of 2xnH samples neighboring the bottom-left, and samples adjacent to the top boundary of the current block. And a total of 2xnW samples neighboring the top-right and one sample neighboring the top-left of the current block.
  • the peripheral reference samples of the current block may include a plurality of upper peripheral samples and a plurality of left peripheral samples.
  • peripheral reference samples of the current block are a total of nH samples adjacent to the right boundary of the current block of size nWxnH, a total of nW samples adjacent to the bottom boundary of the current block and the lower right side of the current block. It may include one sample neighboring (bottom-right).
  • peripheral reference samples of the current block may not be decoded yet or available.
  • the decoder may construct the surrounding reference samples to use for prediction by substituting the samples that are not available with the available samples.
  • peripheral reference samples to be used for prediction may be configured through interpolation of the available samples.
  • the prediction sample can be derived based on the average or interpolation of neighboring reference samples of the current block, and (ii) the prediction among the neighbor reference samples of the current block.
  • the prediction sample may be derived based on a reference sample present in a specific (prediction) direction with respect to the sample. In case of (i), it may be called non-directional mode or non-angle mode, and in case of (ii), it may be called directional mode or angular mode.
  • the interpolation between the second neighboring sample and the first neighboring sample located in a direction opposite to the prediction direction of the intra prediction mode of the current block based on the prediction sample of the current block among the neighboring reference samples may be performed. Prediction samples may be generated.
  • LIP linear interpolation intra prediction
  • a temporary prediction sample of the current block is derived based on filtered neighbor reference samples, and at least one of the existing neighbor reference samples, that is, unfiltered neighbor reference samples, derived according to the intra prediction mode.
  • a weighted sum of a reference sample and the temporary prediction sample may be used to derive the prediction sample of the current block.
  • PDPC position dependent intra prediction
  • post-processing filtering may be performed on the predicted sample derived as needed.
  • the intra prediction procedure may include an intra prediction mode determination step, a peripheral reference sample derivation step, and an intra prediction mode based prediction sample derivation step.
  • a post-filtering step may be performed on the predicted sample derived as needed.
  • a video / image encoding procedure based on intra prediction and an intra prediction unit in the encoding apparatus may roughly include, for example, the following.
  • FIGS. 8 and 9 are diagrams illustrating an intra prediction based video / image encoding method and an intra prediction unit in an encoding apparatus according to an embodiment of the present invention.
  • S801 may be performed by the intra predictor 185 of the encoding apparatus, and S802 may be performed by the residual processor of the encoding apparatus.
  • S802 may be performed by the subtraction unit 115 of the encoding apparatus.
  • the prediction information may be derived by the intra prediction unit 185 and encoded by the entropy encoding unit 190.
  • the residual information may be derived by the residual processor and encoded by the entropy encoding unit 190.
  • the residual information is information about the residual samples.
  • the residual information may include information about quantized transform coefficients for the residual samples.
  • the residual samples may be derived as transform coefficients through the transform unit 120 of the encoding apparatus, and the transform coefficients may be derived as transform coefficients quantized through the quantization unit 130.
  • Information about the quantized transform coefficients may be encoded by the entropy encoding unit 190 through a residual coding procedure.
  • the encoding apparatus performs intra prediction on the current block (S801).
  • the encoding apparatus may derive an intra prediction mode for the current block, derive the peripheral reference samples of the current block, and generate the prediction samples in the current block based on the intra prediction mode and the peripheral reference samples.
  • the intra prediction mode determination, the peripheral reference samples (the procedure of generating the prediction and the prediction samples may be performed simultaneously or one procedure may be performed before the other procedure.
  • the intra prediction unit of the encoding apparatus ( 185 may include a prediction mode determiner 186, a reference sample derivator 187, and a prediction sample derivator 188, and the prediction mode determiner 186 determines an intra prediction mode for the current block.
  • the reference sample derivator 187 may derive peripheral reference samples of the current block, and the predictive sample derivator 188 may derive the motion samples of the current block.
  • the intra predictor 185 may further include a predictive sample filter unit (not shown)
  • the encoding apparatus may further include the current block among a plurality of intra prediction modes. The encoding apparatus may compare an RD cost for the intra prediction modes and determine an optimal intra prediction mode for the current block.
  • the encoding apparatus may perform a prediction sample filtering procedure.
  • Predictive sample filtering may be referred to as post filtering. Some or all of the prediction samples may be filtered by the prediction sample filtering procedure. In some cases, the prediction sample filtering procedure may be omitted.
  • the encoding apparatus generates residual samples for the current block based on the (filtered) prediction sample (S802).
  • the encoding apparatus may encode image information including prediction mode information indicating the intra prediction mode and residual information regarding the residual samples (S803).
  • the encoded image information may be output in the form of a bitstream.
  • the output bitstream may be delivered to the decoding apparatus via a storage medium or a network.
  • the encoding apparatus may generate a reconstructed picture (including the reconstructed samples and the reconstructed block) based on the reference samples and the residual samples. This is because the encoding apparatus derives the same prediction result as that performed in the decoding apparatus, and thus the coding efficiency can be increased. As described above, an in-loop filtering procedure may be further applied to the reconstructed picture.
  • FIGS. 10 and 11 are diagrams illustrating an intra prediction based video / image decoding method and an intra prediction unit in a decoding apparatus according to an embodiment of the present invention.
  • the decoding apparatus may perform an operation corresponding to the operation performed by the encoding apparatus.
  • the decoding apparatus may perform prediction on the current block and derive prediction samples based on the received prediction information.
  • the decoding apparatus may derive the intra prediction mode for the current block based on the received prediction mode information (S1001).
  • the decoding apparatus may derive peripheral reference samples of the current block (S1002).
  • the decoding apparatus generates prediction samples in the current block based on the intra prediction mode and the peripheral reference samples (S1003).
  • the decoding apparatus may perform a prediction sample filtering procedure. Predictive sample filtering may be referred to as post filtering. Some or all of the prediction samples may be filtered by the prediction sample filtering procedure. In some cases, the prediction sample filtering procedure may be omitted.
  • the decoding apparatus generates residual samples for the current block based on the received residual information (S1004).
  • the decoding apparatus may generate reconstructed samples for the current block based on the (filtered) prediction samples and the residual samples, and generate a reconstructed picture based on the (S1005).
  • the intra prediction unit 265 of the decoding apparatus may include a prediction mode determiner 266, a reference sample derivator 267, and a prediction sample derivator 268, and the prediction mode determiner 266 may be encoded.
  • the intra prediction mode for the current block is determined based on the prediction mode information received by the prediction mode determiner 186 of the apparatus, and the reference sample derivator 266 derives the neighbor reference samples of the current block and predicts the prediction mode.
  • the sample derivator 267 may derive the predictive samples of the current block.
  • the intra prediction unit 265 may further include a prediction sample filter (not shown).
  • the prediction mode information may include flag information (ex. Prev_intra_luma_pred_flag) indicating whether a most probable mode (MPM) is applied to the current block or a remaining mode is applied, and the MPM is the current When applied to a block, the prediction mode information may further include index information (ex. Mpm_idx) indicating one of the intra prediction mode candidates (MPM candidates).
  • the intra prediction mode candidates (MPM candidates) may consist of an MPM candidate list or an MPM list.
  • the prediction mode information further includes remaining mode information (ex. Rem_inra_luma_pred_mode) indicating one of the intra prediction modes except for the intra prediction mode candidates (MPM candidates). It may include.
  • the decoding apparatus may determine the intra prediction mode of the current block based on the prediction mode information.
  • the prediction mode information may be encoded / decoded through a coding method described below.
  • the prediction mode information may be encoded / decoded through encoding coding (ex. CABAC, CAVLC) based on truncated (rice) binary code.
  • the intra prediction mode applied to the current block may be determined using the intra prediction mode of the neighboring block.
  • the decoding apparatus may select one of the most probable mode (mpm) candidates derived based on the intra prediction mode of the left block of the current block and the intra prediction mode of the upper block based on the received mpm index, or One of the remaining intra prediction modes not included in the mpm candidates may be selected based on the remaining intra prediction mode information.
  • the mpm index may be signaled in the form of an mpm_idx syntax element
  • the remaining intra prediction mode information may be signaled in the form of a rem_intra_luma_pred_mode syntax element.
  • the remaining intra prediction mode information may index remaining intra prediction modes not included in the mpm candidates among all intra prediction modes in order of prediction mode number to indicate one of them.
  • FIG. 12 and 13 illustrate a prediction direction of an intra prediction mode according to an embodiment to which the present invention may be applied.
  • the intra prediction mode may include two non-directional intra prediction modes and 33 directional intra prediction modes.
  • the non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 34 intra prediction modes.
  • the planner intra prediction mode may be called a planner mode, and the DC intra prediction mode may be called a DC mode.
  • the directional intra prediction mode may be extended from 33 to 65 as shown in FIG. 13.
  • the intra prediction mode may include two non-directional intra prediction modes and 65 directional intra prediction modes.
  • the non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 66 intra prediction modes.
  • Extended Directional Intra Prediction It can be applied to blocks of all sizes and to both luma and chroma components.
  • the intra prediction mode may include two non-directional intra prediction modes and 129 directional intra prediction modes.
  • the non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 130 intra prediction modes.
  • the prediction unit of the encoding apparatus / decoding apparatus may derive a reference sample according to the intra prediction mode of the current block among neighbor reference samples of the current block, and generate a prediction sample of the current block based on the reference sample. .
  • the prediction sample may be derived based on the average or interpolation of neighboring reference samples of the current block, and (ii) specific to the prediction sample among the neighboring reference samples of the current block.
  • the prediction sample may be derived based on a reference sample present in the (prediction) direction. In case of (i), it may be called non-directional mode or non-angle mode, and in case of (ii), it may be called directional mode or angular mode.
  • multi-reference sample lines may be used that utilize one or more reference sample lines for intra prediction for more accurate prediction.
  • intra prediction uses correlation between samples within a block. However, as the distance between the predicted sample and the reference sample increases, the correlation may decrease, and a prediction error may occur.
  • the present invention proposes a method of performing intra prediction using bi-directional reference samples in order to reduce such prediction error and improve compression performance.
  • the present invention proposes a bidirectional intra prediction method that depends on the available reference samples.
  • bit streams and files may be stored in various types of storage devices within the device, or streamed in various network environments such as cellular networks, Internet protocols, and the like.
  • bit stream or file can be decoded and played.
  • the invention can be applied to any device having an encoder and / or a decoder regardless of the display of the bit stream.
  • the prediction error can be reduced and the coding efficiency can be improved.
  • the encoder / decoder may perform intra prediction along the prediction direction to effectively capture edges in the image.
  • FIG. 14 is a diagram for describing a prediction angle of an intra prediction mode according to an embodiment to which the present invention is applied.
  • the encoder / decoder may perform directional prediction using an intra prediction mode having an angle as shown in FIG. 14. For example, when the angle of the prediction mode is 180 degrees, the prediction sample of the current block may be generated using the horizontal left sample. Or, for example, when the angle of the prediction mode is 270 degrees, the prediction sample of the current block may be generated using the vertical upper sample.
  • 15 is a diagram illustrating a method of performing intra prediction using an available reference sample according to an embodiment to which the present invention is applied.
  • FIG. 15 it is assumed that an intra prediction mode having an angle of 315 degrees based on the angle illustrated in FIG. 14 described above is applied to a current block.
  • the shaded blocks represent reference samples around the current block.
  • the encoder / decoder may generate a prediction block (or prediction sample) of the current block by using reference samples around the current block according to the prediction direction of the intra prediction mode of the current block.
  • intra prediction mode as shown in FIG. 15 means that an edge exists in the current block along the prediction direction of the intra prediction mode from the upper reference sample. Meanwhile, when an intra prediction mode of 135 degrees, that is, an opposite direction of 315 degrees is applied, it means that an edge exists from the left reference sample to the upper reference sample along the prediction direction of the intra prediction mode.
  • embodiments of the present invention propose a directional intra mode depending on the reference sample availability.
  • 16 to 18 are diagrams illustrating the directionality of an intra prediction mode determined according to an available reference sample as an embodiment to which the present invention is applied.
  • the double arrow indicates that bi-directional intra prediction is available, and the shaded area indicates the available prediction angle (or range of prediction angles).
  • the encoder / decoder may construct (or generate) an intra prediction mode set that includes a predetermined number of prediction modes in the shaded region.
  • the encoder / decoder may construct (or generate) an intra prediction mode set within a prediction angle range defined according to the available reference samples.
  • the intra prediction mode set is not limited to its name, and the intra mode set, the prediction mode set, the intra prediction mode group, the prediction mode group, the intra mode group, the intra prediction mode list, the prediction mode list, the intra mode list Or the like.
  • an upper reference sample and a left reference sample are available as shown in FIG. 16 (a), between 90 degrees and 180 degrees and / or 270 degrees and 360 degrees as shown in FIG. 16 (b).
  • An directional intra prediction mode with angle may be used for bidirectional intra prediction.
  • ⁇ 360 may be used for bidirectional intra prediction.
  • the encoder / decoder has an angular range between 90 degrees and 180 degrees and / or 270 degrees and 360 degrees (or more than 90 degrees) for bidirectional intra prediction if the upper and left reference samples are available for intra prediction as reconstructed samples. Larger than less than or equal to 180 degrees and / or greater than or equal to 270 degrees and less than 360 degrees) to configure a set of intra prediction modes including a certain number of intra prediction modes.
  • the encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample. The method of generating the final prediction sample is described in detail below.
  • intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.
  • the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles.
  • nonlinear splitting for a particular angular range may be applied.
  • the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.
  • a directional intra prediction mode with an angle between 0 degrees and 90 degrees and / or 180 degrees and 270 degrees may be used for bidirectional intra prediction.
  • the encoder / decoder has an angular range between 0 degrees and 90 degrees and / or 180 degrees and 270 degrees (or more than 0 degrees) for bidirectional intra prediction if right and upper reference samples are available for intra prediction as reconstructed samples. Greater than or equal to less than 90 degrees and / or greater than 180 degrees and less than or equal to 270 degrees) to configure a set of intra prediction modes comprising a certain number of intra prediction modes. For example, if an arbitrary coding order or coding order (or scan order) is applied from right to left, the right and top samples of the current block may be available for prediction as reconstructed samples.
  • the encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample.
  • the dotted upper left reference sample represents a case where more reference samples are required for intra prediction due to the angle of the prediction direction.
  • the reference sample at that location ie, the dotted reference sample
  • the reference sample at the nearest location may be padded using the reference sample at the nearest location.
  • two upper left reference samples may be padded using adjacent reference samples for the prediction mode in the right downward direction.
  • intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.
  • the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles.
  • nonlinear splitting for a particular angular range may be applied.
  • the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.
  • left, top and right reference samples are available, as shown in FIG. 18A. If left, top and right reference samples are available, as shown in FIG. 18B, the directional intra prediction mode in all directions except 90 degrees may be used for bidirectional intra prediction.
  • the encoder / decoder includes an intra prediction mode that includes a certain number of intra prediction modes within all angular ranges except 90 degrees for bidirectional intra prediction, if left, top and right reference samples are available for intra prediction as reconstructed samples. You can configure a set. For example, if an arbitrary coding order or coding order (or scan order) is applied from right to left, the left, top and right samples of the current block may be available for prediction as reconstructed samples.
  • the encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample.
  • intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.
  • the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles.
  • nonlinear splitting for a particular angular range may be applied.
  • the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.
  • Embodiment 2 a method of performing bidirectional intra prediction using the reference sample dependent intra prediction mode described in Embodiment 2 is proposed.
  • 19 is a diagram illustrating a method of generating a predictive sample through bidirectional intra prediction as an embodiment to which the present invention is applied.
  • a reference sample dependent intra prediction mode is applied as in FIG. 16 and the upper and left reference samples are available.
  • the angle of the intra prediction mode is 300 degrees.
  • the encoder / decoder predicts a prediction sample by weighting reference samples based on a distance ratio between a bidirectional reference sample (first reference sample and a second reference sample) and a current sample determined according to the prediction direction of the prediction mode. Can be generated (or derived).
  • the A reference sample and the C reference sample may be used (or selected or determined) as reference samples for the prediction sample P1 at the position [2, 2] according to the direction of the intra prediction mode.
  • the prediction sample P1 may be generated (or derived, calculated) by the weighted average of the A reference sample and the C reference sample.
  • Equation 1 d_top represents the distance between the A reference sample located in the upper reference sample array and P1
  • d_left represents the distance between the C reference sample located in the left reference sample array and P1.
  • d_top and d_left may be switched with each other because the directional intra mode starts from the left reference sample to the upper reference sample.
  • the positions of A and C may be fractional positions rather than integer positions.
  • the sample value of the corresponding fractional position may be derived by performing interpolation based on the reference sample of the integer position.
  • the ratio of floating point position 1 / (d_left + d_top) may be rounded to the ratio of integer positions.
  • Embodiments of the present invention described above may be implemented independently, or one or more embodiments may be implemented in combination.
  • 20 is a flowchart illustrating a method of generating an intra prediction block according to an embodiment to which the present invention is applied.
  • a decoder is mainly described for convenience of description, but the present invention is not limited thereto, and the method of generating an intra prediction block according to the embodiment of the present invention may be performed in the same manner in the encoder and the decoder.
  • the decoder is configured to use an intra prediction mode set used for the bidirectional intra prediction based on available reference samples around the current block when bi-directional intra prediction is applied to the current block. (S2001).
  • the decoder parses a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set (S2002).
  • the decoder derives a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode (S2003).
  • the decoder weights the first reference sample and the second reference sample to generate a prediction sample of the current block (S2004).
  • the intra prediction mode set may be configured to include a predefined number of intra prediction modes within a specific angular range determined according to the available direction of the reference sample.
  • the intra prediction mode set is intra within an angle range of 90 degrees to 180 degrees and an angle range of 270 degrees to 360 degrees when left and upper reference samples around the current block are available. It may be configured to include prediction modes.
  • the intra prediction mode set is intra within an angle range of 0 degrees to 90 degrees and an angle range of 180 degrees to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include prediction modes.
  • the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees and 270 degrees when left, right and top reference samples around the current block are available. Can be.
  • the weights applied to the first reference sample and the second reference sample are the distance between the current sample and the first reference sample in the current block and the distance between the current sample and the second reference sample. It can be determined based on the ratio of. As an example, the method described above with reference to FIG. 19 and Equation 1 may be applied.
  • 21 is a diagram illustrating an intra prediction apparatus according to an embodiment to which the present invention is applied.
  • the intra predictor is illustrated as one block, but the intra predictor may be implemented in a configuration included in the encoder and / or the decoder.
  • the intra predictor implements the functions, processes, and / or methods proposed in FIGS. 8 to 20.
  • the intra prediction unit may include an intra prediction mode set configuration unit 2101, a prediction mode index parsing unit 2102, a reference sample derivation unit 2103, and a prediction sample generation unit 2104.
  • the intra prediction mode set configuration unit 2101 performs intra prediction used for the bidirectional intra prediction based on the available reference samples around the current block when bi-directional intra prediction is applied to the current block. Configure an intra prediction mode set.
  • a prediction mode index parser 2102 parses a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set.
  • the reference sample derivator 2103 derives a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode.
  • the prediction sample generator 2104 weights the first reference sample and the second reference sample to generate a prediction sample of the current block.
  • the intra prediction mode set may be configured to include a predefined number of intra prediction modes within a specific angular range determined according to the available direction of the reference sample.
  • the intra prediction mode set is intra within an angle range of 90 degrees to 180 degrees and an angle range of 270 degrees to 360 degrees when left and upper reference samples around the current block are available. It may be configured to include prediction modes.
  • the intra prediction mode set is intra within an angle range of 0 degrees to 90 degrees and an angle range of 180 degrees to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include prediction modes.
  • the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees and 270 degrees when left, right and top reference samples around the current block are available. Can be.
  • the weights applied to the first reference sample and the second reference sample are the distance between the current sample and the first reference sample in the current block and the distance between the current sample and the second reference sample. It can be determined based on the ratio of. As an example, the method described above with reference to FIG. 19 and Equation 1 may be applied.
  • FIG. 22 shows a video coding system to which the present invention is applied.
  • the video coding system can include a source device and a receiving device.
  • the source device may deliver the encoded video / image information or data to a receiving device through a digital storage medium or network in a file or streaming form.
  • the source device may include a video source, an encoding apparatus, and a transmitter.
  • the receiving device may include a receiver, a decoding apparatus, and a renderer.
  • the encoding device may be called a video / image encoding device, and the decoding device may be called a video / image decoding device.
  • the transmitter may be included in the encoding device.
  • the receiver may be included in the decoding device.
  • the renderer may include a display unit, and the display unit may be configured as a separate device or an external component.
  • the video source may acquire the video / image through a process of capturing, synthesizing, or generating the video / image.
  • the video source may comprise a video / image capture device and / or a video / image generation 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.
  • Video / image generation devices may include, for example, computers, tablets and smartphones, and may (electronically) generate video / images.
  • 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 device may encode the input video / image.
  • the encoding apparatus may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency.
  • the encoded data (encoded video / image information) may be output in the form of a bitstream.
  • the transmitter may transmit the encoded video / video information or data output in the form of a bitstream to the receiver of the receiving device through a digital storage medium or a network in the form of a file or streaming.
  • the digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like.
  • the transmission unit may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast / communication network.
  • the receiver may extract the bitstream and transmit the extracted bitstream to the decoding apparatus.
  • the decoding apparatus may decode the video / image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding apparatus.
  • the renderer may render the decoded video / image.
  • the rendered video / image may be displayed through the display unit.
  • FIG. 23 is a diagram illustrating a structure of a content streaming system according to an embodiment to which the present invention is applied.
  • a content streaming system to which the present invention 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 content input from multimedia input devices such as a smart phone, a camera, a camcorder, etc. into digital data to generate a bitstream and transmit the bitstream to the streaming server.
  • multimedia input devices such as smart phones, cameras, camcorders, etc. directly generate a bitstream
  • the encoding server may be omitted.
  • the bitstream may be generated by an encoding method or a bitstream generation method to which the present invention 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 the user's request through the web server, and the web server serves as a medium for informing the user of what service.
  • the web server delivers it to a streaming server, and the streaming server transmits multimedia data to the user.
  • the content streaming system may include a separate control server.
  • the control server plays a role of controlling a command / response between devices in the content streaming system.
  • the streaming server may receive content from a media store and / or an encoding server. For example, when the content is received from the encoding server, the content 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 include a mobile phone, a smart phone, 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, glass glasses, head mounted displays), digital TVs, desktops Computer, digital signage, and the like.
  • PDA personal digital assistant
  • PMP portable multimedia player
  • slate PC slate PC
  • Tablet PCs ultrabooks
  • wearable devices e.g., smartwatches, glass glasses, head mounted displays
  • digital TVs desktops Computer
  • digital signage digital signage
  • Each server in the content streaming system may be operated as a distributed server, in which case data received from each server may be distributed.
  • the embodiments described herein may be implemented and performed on a processor, microprocessor, controller, or chip.
  • the functional units shown in each drawing may be implemented and performed on a computer, processor, microprocessor, controller, or chip.
  • the decoder and encoder to which the present invention is applied include a multimedia broadcasting transmitting and receiving 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, Storage media, camcorders, video on demand (VoD) service providing devices, OTT video (Over the top video) devices, Internet streaming service providing devices, three-dimensional (3D) video devices, video telephony video devices, and medical video devices. It can be used to process video signals or data signals.
  • the OTT video device may include a game console, a Blu-ray player, an internet access TV, a home theater system, a smartphone, a tablet PC, a digital video recorder (DVR), and the like.
  • the processing method to which the present invention is applied can be produced in the form of a program executed by a computer, and stored in a computer-readable recording medium.
  • Multimedia data having a data structure according to the present invention can also be stored in a computer-readable recording medium.
  • the computer readable recording medium includes all kinds of storage devices and distributed storage devices in which computer readable data is stored.
  • the computer-readable recording medium may be, for example, a Blu-ray disc (BD), a universal serial bus (USB), a ROM, a PROM, an EPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical disc. It may include a data storage device.
  • the computer-readable recording medium also includes media embodied in the form of a carrier wave (eg, transmission over the Internet).
  • the bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network.
  • an embodiment of the present invention may be implemented as a computer program product by program code, which may be performed on a computer by an embodiment of the present invention.
  • the program code may be stored on a carrier readable by a computer.
  • Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof.
  • an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.
  • ASICs application specific integrated circuits
  • DSPs digital signal processors
  • DSPDs digital signal processing devices
  • PLDs programmable logic devices
  • FPGAs field programmable gate arrays
  • processors controllers, microcontrollers, microprocessors, and the like.
  • an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above.
  • the software code may be stored in memory and driven by the processor.
  • the memory may be located inside or outside the processor, and may exchange data with the processor by various known means.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

A method for decoding a video signal and a device therefor are disclosed. Particularly, a method for decoding an image on the basis of an intra prediction mode can comprise the steps of: forming, on the basis of available reference samples near a current block, an intra prediction mode set that is to be used for a bi-directional intra prediction when the bi-directional intra prediction is applied to the current block; parsing a prediction mode index indicating the intra prediction mode to be applied to the current block in the intra prediction mode set; deriving, on the basis of the prediction direction of the intra prediction mode, a first reference sample and a second reference sample, from among the reference samples, that are to be used for the bi-directional intra prediction; and generating a prediction sample of the current block by weighted-summing the first reference sample and the second reference sample.

Description

인트라 예츑 λͺ¨λ“œ 기반 μ˜μƒ 처리 방법 및 이λ₯Ό μœ„ν•œ μž₯치Intra prediction mode based image processing method and apparatus therefor

λ³Έ 발λͺ…은 μ •μ§€ μ˜μƒ λ˜λŠ” λ™μ˜μƒ 처리 방법에 κ΄€ν•œ κ²ƒμœΌλ‘œμ„œ, 보닀 μƒμ„Έν•˜κ²Œ 인트라 예츑 λͺ¨λ“œ(intra prediction mode) 기반으둜 μ •μ§€ μ˜μƒ λ˜λŠ” λ™μ˜μƒμ„ 인코딩/λ””μ½”λ”©ν•˜λŠ” 방법 및 이λ₯Ό μ§€μ›ν•˜λŠ” μž₯μΉ˜μ— κ΄€ν•œ 것이닀.The present invention relates to a still image or moving image processing method, and more particularly, to a method for encoding / decoding a still image or moving image based on an intra prediction mode and an apparatus supporting the same.

μ••μΆ• λΆ€ν˜Έν™”λž€ λ””μ§€ν„Έν™”ν•œ 정보λ₯Ό 톡신 νšŒμ„ μ„ 톡해 μ „μ†‘ν•˜κ±°λ‚˜, μ €μž₯ 맀체에 μ ν•©ν•œ ν˜•νƒœλ‘œ μ €μž₯ν•˜κΈ° μœ„ν•œ 일련의 μ‹ ν˜Έ 처리 κΈ°μˆ μ„ μ˜λ―Έν•œλ‹€. μ˜μƒ, 이미지, μŒμ„± λ“±μ˜ λ―Έλ””μ–΄κ°€ μ••μΆ• λΆ€ν˜Έν™”μ˜ λŒ€μƒμ΄ 될 수 있으며, 특히 μ˜μƒμ„ λŒ€μƒμœΌλ‘œ μ••μΆ• λΆ€ν˜Έν™”λ₯Ό μˆ˜ν–‰ν•˜λŠ” κΈ°μˆ μ„ λΉ„λ””μ˜€ μ˜μƒ 압좕이라고 μΌμ»«λŠ”λ‹€. Compression coding refers to a series of signal processing techniques for transmitting digitized information through a communication line or for storing in a form suitable for a storage medium. Media such as an image, an image, an audio, and the like may be a target of compression encoding. In particular, a technique of performing compression encoding on an image is called video image compression.

μ°¨μ„ΈλŒ€ λΉ„λ””μ˜€ μ»¨ν…μΈ λŠ” 고해상도(high spatial resolution), κ³ ν”„λ ˆμž„μœ¨(high frame rate) 및 μ˜μƒ ν‘œν˜„μ˜ 고차원화(high dimensionality of scene representation)λΌλŠ” νŠΉμ§•μ„ κ°–κ²Œ 될 것이닀. κ·ΈλŸ¬ν•œ 컨텐츠λ₯Ό μ²˜λ¦¬ν•˜κΈ° μœ„ν•΄μ„œλŠ” λ©”λͺ¨λ¦¬ μ €μž₯(memory storage), λ©”λͺ¨λ¦¬ μ•‘μ„ΈμŠ€μœ¨(memory access rate) 및 처리 μ „λ ₯(processing power) μΈ‘λ©΄μ—μ„œ μ—„μ²­λ‚œ 증가λ₯Ό κ°€μ Έμ˜¬ 것이닀.Next-generation video content will be characterized by high spatial resolution, high frame rate and high dimensionality of scene representation. Processing such content would result in a tremendous increase in terms of memory storage, memory access rate, and processing power.

λ”°λΌμ„œ, μ°¨μ„ΈλŒ€ λΉ„λ””μ˜€ 컨텐츠λ₯Ό 보닀 효율적으둜 μ²˜λ¦¬ν•˜κΈ° μœ„ν•œ μ½”λ”© νˆ΄μ„ λ””μžμΈν•  ν•„μš”κ°€ μžˆλ‹€.Accordingly, there is a need to design coding tools for more efficiently processing next generation video content.

λ³Έ 발λͺ…μ˜ λͺ©μ μ€, 예츑 였차λ₯Ό 쀄이고 μ••μΆ• μ„±λŠ₯을 ν–₯μƒμ‹œν‚€κΈ° μœ„ν•˜μ—¬, μ–‘λ°©ν–₯(bi-directional)의 μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜λŠ” 방법을 μ œμ•ˆν•œλ‹€.An object of the present invention is to propose a method for performing intra prediction using bi-directional reference samples in order to reduce prediction error and improve compression performance.

λ˜ν•œ, λ³Έ 발λͺ…μ˜ λͺ©μ μ€, 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œ(reference sample)에 의쑴적인 μ–‘λ°©ν–₯ 인트라 예츑 방법을 μ œμ•ˆν•œλ‹€.It is also an object of the present invention to propose a bi-directional intra prediction method that depends on the available reference samples.

λ³Έ 발λͺ…μ—μ„œ 이루고자 ν•˜λŠ” 기술적 κ³Όμ œλ“€μ€ μ΄μƒμ—μ„œ μ–ΈκΈ‰ν•œ 기술적 κ³Όμ œλ“€λ‘œ μ œν•œλ˜μ§€ μ•ŠμœΌλ©°, μ–ΈκΈ‰ν•˜μ§€ μ•Šμ€ 또 λ‹€λ₯Έ 기술적 κ³Όμ œλ“€μ€ μ•„λž˜μ˜ κΈ°μž¬λ‘œλΆ€ν„° λ³Έ 발λͺ…이 μ†ν•˜λŠ” κΈ°μˆ λΆ„μ•Όμ—μ„œ ν†΅μƒμ˜ 지식을 κ°€μ§„ μžμ—κ²Œ λͺ…ν™•ν•˜κ²Œ 이해될 수 μžˆμ„ 것이닀.The technical problems to be achieved in the present invention are not limited to the technical problems mentioned above, and other technical problems not mentioned above will be clearly understood by those skilled in the art from the following description. Could be.

λ³Έ 발λͺ…μ˜ 일 양상은, 인트라 예츑 λͺ¨λ“œ 기반으둜 μ˜μƒμ„ λ””μ½”λ”©ν•˜λŠ” 방법에 μžˆμ–΄μ„œ, ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•˜λŠ” 단계; 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•˜λŠ” 단계; 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜λŠ” 단계; 및 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 단계λ₯Ό ν¬ν•¨ν•˜λ˜, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.An aspect of the present invention is a method of decoding an image based on an intra prediction mode, wherein when bi-directional intra prediction is applied to a current block, based on available reference samples around the current block Configuring an intra prediction mode set used for the bidirectional intra prediction; Parsing a prediction mode index indicating an intra prediction mode applied to the current block within the intra prediction mode set; Deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode; And weighting the first reference sample and the second reference sample to generate a prediction sample of the current block, wherein the set of intra prediction modes is within a specific angular range determined according to the available direction of the reference sample. It may be configured to include a predefined number of intra prediction modes in.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 보닀 크고 180 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ 및 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.Advantageously, said intra prediction mode set is within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. It may be configured to include intra prediction modes.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„ 및 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.Advantageously, said intra prediction mode set is within an angle range greater than or equal to 0 degrees and less than 90 degrees and an angle range greater than or equal to 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include intra prediction modes.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.Advantageously, the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees when left, right and top reference samples around the current block are available.

λ°”λžŒμ§ν•˜κ²Œ, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ 결정될 수 μžˆλ‹€.Preferably, a weight applied to the first reference sample and the second reference sample, respectively, is based on a ratio of the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. Can be determined.

λ³Έ 발λͺ…μ˜ λ‹€λ₯Έ 일 양상은, 인트라 예츑 λͺ¨λ“œ 기반으둜 μ˜μƒμ„ λ””μ½”λ”©ν•˜λŠ” μž₯μΉ˜μ— μžˆμ–΄μ„œ, ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹ ꡬ성뢀; 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀 νŒŒμ‹±λΆ€; 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜λŠ” μ°Έμ‘° μƒ˜ν”Œ μœ λ„λΆ€; 및 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 예츑 μƒ˜ν”Œ 생성뢀λ₯Ό ν¬ν•¨ν•˜λ˜, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.According to another aspect of the present invention, in an apparatus for decoding an image based on an intra prediction mode, when bi-directional intra prediction is applied to a current block, an available reference samples around the current block are applied. An intra prediction mode set configuration unit constituting an intra prediction mode set used for the bidirectional intra prediction based on the basis; A prediction mode index parser for parsing a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set; A reference sample derivation unit for deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on a prediction direction of the intra prediction mode; And a prediction sample generator for weighting the first reference sample and the second reference sample to generate a prediction sample of the current block, wherein the intra prediction mode set is a specific angle determined according to an available direction of the reference sample. It may be configured to include a predefined number of intra prediction modes within a range.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 보닀 크고 180 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ 및 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© μž₯치.Advantageously, said intra prediction mode set is within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. And decode the intra prediction modes.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„ 및 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.Advantageously, said intra prediction mode set is within an angle range greater than or equal to 0 degrees and less than 90 degrees and an angle range greater than or equal to 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include intra prediction modes.

λ°”λžŒμ§ν•˜κ²Œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.Advantageously, the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees when left, right and top reference samples around the current block are available.

λ°”λžŒμ§ν•˜κ²Œ, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ 결정될 수 μžˆλ‹€.Preferably, a weight applied to the first reference sample and the second reference sample, respectively, is based on a ratio of the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. Can be determined.

λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯΄λ©΄, μ°Έμ‘° μƒ˜ν”Œμ— 따라 인트라 예츑 λ°©ν–₯을 효율적으둜 μ‚¬μš©ν•¨μœΌλ‘œμ¨ 예츑 였차λ₯Ό 쀄이고, λΆ€ν˜Έν™” νš¨μœ¨μ„ ν–₯μƒμ‹œν‚¬ 수 μžˆλ‹€.According to the embodiment of the present invention, by effectively using the intra prediction direction according to the reference sample, the prediction error can be reduced and the coding efficiency can be improved.

λ³Έ 발λͺ…μ—μ„œ 얻을 수 μžˆλŠ” νš¨κ³ΌλŠ” μ΄μƒμ—μ„œ μ–ΈκΈ‰ν•œ 효과둜 μ œν•œλ˜μ§€ μ•ŠμœΌλ©°, μ–ΈκΈ‰ν•˜μ§€ μ•Šμ€ 또 λ‹€λ₯Έ νš¨κ³Όλ“€μ€ μ•„λž˜μ˜ κΈ°μž¬λ‘œλΆ€ν„° λ³Έ 발λͺ…이 μ†ν•˜λŠ” κΈ°μˆ λΆ„μ•Όμ—μ„œ ν†΅μƒμ˜ 지식을 κ°€μ§„ μžμ—κ²Œ λͺ…ν™•ν•˜κ²Œ 이해될 수 μžˆμ„ 것이닀.The effects obtainable in the present invention are not limited to the above-mentioned effects, and other effects not mentioned will be clearly understood by those skilled in the art from the following description. .

λ³Έ 발λͺ…에 κ΄€ν•œ 이해λ₯Ό 돕기 μœ„ν•΄ μƒμ„Έν•œ μ„€λͺ…μ˜ μΌλΆ€λ‘œ ν¬ν•¨λ˜λŠ”, 첨뢀 도면은 λ³Έ 발λͺ…에 λŒ€ν•œ μ‹€μ‹œμ˜ˆλ₯Ό μ œκ³΅ν•˜κ³ , μƒμ„Έν•œ μ„€λͺ…κ³Ό ν•¨κ»˜ λ³Έ 발λͺ…μ˜ 기술적 νŠΉμ§•μ„ μ„€λͺ…ν•œλ‹€.BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, included as part of the detailed description in order to provide a thorough understanding of the present invention, provide embodiments of the present invention and together with the description, describe the technical features of the present invention.

도 1은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λΉ„λ””μ˜€/이미지 μ‹ ν˜Έμ˜ 인코딩이 μˆ˜ν–‰λ˜λŠ” 인코딩 μž₯치의 개랡적인 블둝도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.

도 2λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λΉ„λ””μ˜€/이미지 μ‹ ν˜Έμ˜ 디코딩이 μˆ˜ν–‰λ˜λŠ” λ””μ½”λ”© μž₯치의 개랡적인 블둝도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.

도 3은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ©€ν‹°νƒ€μž… 트리 ꡬ쑰의 일 예λ₯Ό λ‚˜νƒ€λ‚΄λŠ” 도면이닀.3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.

도 4λŠ” λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•˜λŠ” μΏΌλ“œνŠΈλ¦¬(quadtree with nested multi-type tree) ꡬ쑰의 νŒŒν‹°μ…˜ λΆ„ν•  μ •λ³΄μ˜ μ‹œκ·Έλ„λ§ λ©”μ»€λ‹ˆμ¦˜μ„ μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.

도 5λŠ” λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, μΏΌλ“œνŠΈλ¦¬ 및 μˆ˜λ°˜λ˜λŠ” λ©€ν‹°νƒ€μž… 트리(quadtree and nested multi-type tree) ꡬ쑰λ₯Ό 기반으둜 CTUλ₯Ό 닀쀑 CUλ“€λ‘œ λΆ„ν• ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.

도 6은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, ν„°λ„ˆλ¦¬ 트리(ternary-tree) 뢄할을 μ œν•œν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.

도 7은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ°”μ΄λ„ˆλ¦¬ 트리 λΆ„ν•  및 ν„°λ„ˆλ¦¬ 트리 λΆ„ν• μ—μ„œ λ°œμƒν•  수 μžˆλŠ” 리던던트 λΆ„ν•  νŒ¨ν„΄λ“€μ„ μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.

도 8 및 도 9λŠ” λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ 인코딩 방법 및 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인코딩 μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.8 and 9 are diagrams illustrating an intra prediction based video / image encoding method and an intra prediction unit in an encoding apparatus according to an embodiment of the present invention.

도 10 및 도 11은 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ λ””μ½”λ”© 방법 및 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ λ””μ½”λ”© μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.10 and 11 are diagrams illustrating an intra prediction based video / image decoding method and an intra prediction unit in a decoding apparatus according to an embodiment of the present invention.

도 12 및 도 13은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯을 λ‚˜νƒ€λ‚΄λŠ” 도면이닀.12 and 13 illustrate a prediction direction of an intra prediction mode according to an embodiment to which the present invention may be applied.

도 14λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 각도λ₯Ό μ„€λͺ…ν•˜κΈ° μœ„ν•œ 도면이닀. 14 is a diagram for describing a prediction angle of an intra prediction mode according to an embodiment to which the present invention is applied.

도 15λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.15 is a diagram illustrating a method of performing intra prediction using an available reference sample according to an embodiment to which the present invention is applied.

도 16 λ‚΄μ§€ 도 18은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 인트라 예츑 λͺ¨λ“œμ˜ λ°©ν–₯성을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.16 to 18 are diagrams illustrating the directionality of an intra prediction mode determined according to an available reference sample as an embodiment to which the present invention is applied.

도 19λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ 톡해 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.19 is a diagram illustrating a method of generating a predictive sample through bidirectional intra prediction as an embodiment to which the present invention is applied.

도 20은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 블둝을 μƒμ„±ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 흐름도이닀.20 is a flowchart illustrating a method of generating an intra prediction block according to an embodiment to which the present invention is applied.

도 21은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 μž₯치λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.21 is a diagram illustrating an intra prediction apparatus according to an embodiment to which the present invention is applied.

도 22λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” λΉ„λ””μ˜€ μ½”λ”© μ‹œμŠ€ν…œμ„ λ‚˜νƒ€λ‚Έλ‹€.22 shows a video coding system to which the present invention is applied.

도 23은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, 컨텐츠 슀트리밍 μ‹œμŠ€ν…œ ꡬ쑰도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.23 is a diagram illustrating a structure of a content streaming system according to an embodiment to which the present invention is applied.

μ΄ν•˜, λ³Έ 발λͺ…에 λ”°λ₯Έ λ°”λžŒμ§ν•œ μ‹€μ‹œ ν˜•νƒœλ₯Ό μ²¨λΆ€λœ 도면을 μ°Έμ‘°ν•˜μ—¬ μƒμ„Έν•˜κ²Œ μ„€λͺ…ν•œλ‹€. μ²¨λΆ€λœ 도면과 ν•¨κ»˜ μ΄ν•˜μ— κ°œμ‹œλ  μƒμ„Έν•œ μ„€λͺ…은 λ³Έ 발λͺ…μ˜ μ˜ˆμ‹œμ μΈ μ‹€μ‹œν˜•νƒœλ₯Ό μ„€λͺ…ν•˜κ³ μž ν•˜λŠ” 것이며, λ³Έ 발λͺ…이 μ‹€μ‹œλ  수 μžˆλŠ” μœ μΌν•œ μ‹€μ‹œν˜•νƒœλ₯Ό λ‚˜νƒ€λ‚΄κ³ μž ν•˜λŠ” 것이 μ•„λ‹ˆλ‹€. μ΄ν•˜μ˜ μƒμ„Έν•œ μ„€λͺ…은 λ³Έ 발λͺ…μ˜ μ™„μ „ν•œ 이해λ₯Ό μ œκ³΅ν•˜κΈ° μœ„ν•΄μ„œ ꡬ체적 세뢀사항을 ν¬ν•¨ν•œλ‹€. κ·ΈλŸ¬λ‚˜, λ‹Ήμ—…μžλŠ” λ³Έ 발λͺ…이 μ΄λŸ¬ν•œ ꡬ체적 세뢀사항 없이도 μ‹€μ‹œλ  수 μžˆμŒμ„ μ•ˆλ‹€. Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. The detailed description, which will be given below with reference to the accompanying drawings, is intended to explain exemplary embodiments of the present invention and is not intended to represent the only embodiments in which the present invention may be practiced. The following detailed description includes specific details in order to provide a thorough understanding of the present invention. However, one of ordinary skill in the art appreciates that the present invention may be practiced without these specific details.

λͺ‡λͺ‡ 경우, λ³Έ 발λͺ…μ˜ κ°œλ…μ΄ λͺ¨ν˜Έν•΄μ§€λŠ” 것을 ν”Όν•˜κΈ° μœ„ν•˜μ—¬ κ³΅μ§€μ˜ ꡬ쑰 및 μž₯μΉ˜λŠ” μƒλž΅λ˜κ±°λ‚˜, 각 ꡬ쑰 및 μž₯치의 핡심기λŠ₯을 μ€‘μ‹¬μœΌλ‘œ ν•œ 블둝도 ν˜•μ‹μœΌλ‘œ λ„μ‹œλ  수 μžˆλ‹€. In some instances, well-known structures and devices may be omitted or shown in block diagram form centering on the core functions of the structures and devices in order to avoid obscuring the concepts of the present invention.

μ•„μšΈλŸ¬, λ³Έ 발λͺ…μ—μ„œ μ‚¬μš©λ˜λŠ” μš©μ–΄λŠ” κ°€λŠ₯ν•œ ν•œ ν˜„μž¬ 널리 μ‚¬μš©λ˜λŠ” 일반적인 μš©μ–΄λ₯Ό μ„ νƒν•˜μ˜€μœΌλ‚˜, νŠΉμ •ν•œ κ²½μš°λŠ” μΆœμ›μΈμ΄ μž„μ˜λ‘œ μ„ μ •ν•œ μš©μ–΄λ₯Ό μ‚¬μš©ν•˜μ—¬ μ„€λͺ…ν•œλ‹€. κ·ΈλŸ¬ν•œ κ²½μš°μ—λŠ” ν•΄λ‹Ή λΆ€λΆ„μ˜ 상세 μ„€λͺ…μ—μ„œ κ·Έ 의미λ₯Ό λͺ…ν™•νžˆ κΈ°μž¬ν•˜λ―€λ‘œ, λ³Έ 발λͺ…μ˜ μ„€λͺ…μ—μ„œ μ‚¬μš©λœ μš©μ–΄μ˜ λͺ…μΉ­λ§ŒμœΌλ‘œ λ‹¨μˆœ ν•΄μ„λ˜μ–΄μ„œλŠ” μ•ˆ 될 것이며 κ·Έ ν•΄λ‹Ή μš©μ–΄μ˜ μ˜λ―ΈκΉŒμ§€ νŒŒμ•…ν•˜μ—¬ ν•΄μ„λ˜μ–΄μ•Ό 함을 λ°ν˜€λ‘κ³ μž ν•œλ‹€.In addition, the terminology used in the present invention was selected as a general term widely used as possible now, in a specific case will be described using terms arbitrarily selected by the applicant. In such a case, since the meaning is clearly described in the detailed description of the part, it should not be interpreted simply by the name of the term used in the description of the present invention, and it should be understood that the meaning of the term should be understood and interpreted. .

μ΄ν•˜μ˜ μ„€λͺ…μ—μ„œ μ‚¬μš©λ˜λŠ” νŠΉμ • μš©μ–΄λ“€μ€ λ³Έ 발λͺ…μ˜ 이해λ₯Ό 돕기 μœ„ν•΄μ„œ 제곡된 것이며, μ΄λŸ¬ν•œ νŠΉμ • μš©μ–΄μ˜ μ‚¬μš©μ€ λ³Έ 발λͺ…μ˜ 기술적 사상을 λ²—μ–΄λ‚˜μ§€ μ•ŠλŠ” λ²”μœ„μ—μ„œ λ‹€λ₯Έ ν˜•νƒœλ‘œ 변경될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μ‹ ν˜Έ, 데이터, μƒ˜ν”Œ, 픽쳐, ν”„λ ˆμž„, 블둝 λ“±μ˜ 경우 각 μ½”λ”© κ³Όμ •μ—μ„œ μ μ ˆν•˜κ²Œ λŒ€μ²΄λ˜μ–΄ 해석될 수 μžˆμ„ 것이닀.Specific terms used in the following description are provided to help the understanding of the present invention, and the use of such specific terms may be changed to other forms without departing from the technical spirit of the present invention. For example, signals, data, samples, pictures, frames, blocks, etc. may be appropriately replaced and interpreted in each coding process.

μ΄ν•˜ λ³Έ λͺ…μ„Έμ„œμ—μ„œ '처리 μœ λ‹›'은 예츑, λ³€ν™˜ 및/λ˜λŠ” μ–‘μžν™” λ“±κ³Ό 같은 인코딩/λ””μ½”λ”©μ˜ 처리 과정이 μˆ˜ν–‰λ˜λŠ” λ‹¨μœ„λ₯Ό μ˜λ―Έν•œλ‹€. μ΄ν•˜, μ„€λͺ…μ˜ 편의λ₯Ό μœ„ν•΄ 처리 μœ λ‹›μ€ '처리 블둝' λ˜λŠ” '블둝'으둜 지칭될 μˆ˜λ„ μžˆλ‹€. Hereinafter, in the present specification, the 'processing unit' refers to a unit in which a process of encoding / decoding such as prediction, transformation, and / or quantization is performed. Hereinafter, for convenience of description, the processing unit may be referred to as a 'processing block' or 'block'.

처리 μœ λ‹›μ€ νœ˜λ„(luma) 성뢄에 λŒ€ν•œ λ‹¨μœ„μ™€ 색차(chroma) 성뢄에 λŒ€ν•œ λ‹¨μœ„λ₯Ό ν¬ν•¨ν•˜λŠ” 의미둜 해석될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 처리 μœ λ‹›μ€ μ½”λ”© 트리 μœ λ‹›(CTU: Coding Tree Unit), μ½”λ”© μœ λ‹›(CU: Coding Unit), 예츑 μœ λ‹›(PU: Prediction Unit) λ˜λŠ” λ³€ν™˜ μœ λ‹›(TU: Transform Unit)에 해당될 수 μžˆλ‹€. The processing unit may be interpreted to include a unit for the luma component and a unit for the chroma component. For example, the processing unit may correspond to a Coding Tree Unit (CTU), a Coding Unit (CU), a Prediction Unit (PU), or a Transform Unit (TU).

λ˜ν•œ, 처리 μœ λ‹›μ€ νœ˜λ„(luma) 성뢄에 λŒ€ν•œ λ‹¨μœ„ λ˜λŠ” 색차(chroma) 성뢄에 λŒ€ν•œ λ‹¨μœ„λ‘œ 해석될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 처리 μœ λ‹›μ€ νœ˜λ„(luma) 성뢄에 λŒ€ν•œ μ½”λ”© 트리 블둝(CTB: Coding Tree Block), μ½”λ”© 블둝(CB: Coding Block), 예츑 블둝(PU: Prediction Block) λ˜λŠ” λ³€ν™˜ 블둝(TB: Transform Block)에 해당될 수 μžˆλ‹€. λ˜λŠ”, 색차(chroma) 성뢄에 λŒ€ν•œ μ½”λ”© 트리 블둝(CTB), μ½”λ”© 블둝(CB), 예츑 블둝(PU) λ˜λŠ” λ³€ν™˜ 블둝(TB)에 해당될 수 μžˆλ‹€. λ˜ν•œ, 이에 ν•œμ •λ˜λŠ” 것은 μ•„λ‹ˆλ©° 처리 μœ λ‹›μ€ νœ˜λ„(luma) 성뢄에 λŒ€ν•œ λ‹¨μœ„μ™€ 색차(chroma) 성뢄에 λŒ€ν•œ λ‹¨μœ„λ₯Ό ν¬ν•¨ν•˜λŠ” 의미둜 해석될 μˆ˜λ„ μžˆλ‹€. In addition, the processing unit may be interpreted as a unit for a luma component or a unit for a chroma component. For example, the processing unit may be a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a luma component. May correspond to. Or, it may correspond to a coding tree block (CTB), a coding block (CB), a prediction block (PU), or a transform block (TB) for a chroma component. In addition, the present invention is not limited thereto, and the processing unit may be interpreted to include a unit for a luma component and a unit for a chroma component.

λ˜ν•œ, 처리 μœ λ‹›μ€ λ°˜λ“œμ‹œ μ •μ‚¬κ°ν˜•μ˜ λΈ”λ‘μœΌλ‘œ ν•œμ •λ˜λŠ” 것은 μ•„λ‹ˆλ©°, 3개 μ΄μƒμ˜ 꼭지점을 κ°€μ§€λŠ” λ‹€κ°ν˜• ν˜•νƒœλ‘œ ꡬ성될 μˆ˜λ„ μžˆλ‹€. In addition, the processing unit is not necessarily limited to square blocks, but may also be configured in a polygonal form having three or more vertices.

λ˜ν•œ, μ΄ν•˜ λ³Έ λͺ…μ„Έμ„œμ—μ„œ ν”½μ…€ λ˜λŠ” ν™”μ†Œ 등을 μƒ˜ν”Œλ‘œ ν†΅μΉ­ν•œλ‹€. 그리고, μƒ˜ν”Œμ„ μ΄μš©ν•œλ‹€λŠ” 것은 ν”½μ…€ κ°’ λ˜λŠ” ν™”μ†Œ κ°’ 등을 μ΄μš©ν•œλ‹€λŠ” 것을 μ˜λ―Έν•  수 μžˆλ‹€. In the following specification, a pixel, a pixel, and the like are referred to collectively as samples. In addition, using a sample may mean using a pixel value or a pixel value.

도 1은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λΉ„λ””μ˜€/이미지 μ‹ ν˜Έμ˜ 인코딩이 μˆ˜ν–‰λ˜λŠ” 인코딩 μž₯치의 개랡적인 블둝도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.1 is a schematic block diagram of an encoding apparatus in which an encoding of a video / image signal is performed, according to an embodiment to which the present invention is applied.

도 1을 μ°Έμ‘°ν•˜λ©΄, 인코딩 μž₯치(100)λŠ” μ˜μƒ λΆ„ν• λΆ€(110), 감산뢀(115), λ³€ν™˜λΆ€(120), μ–‘μžν™”λΆ€(130), μ—­μ–‘μžν™”λΆ€(140), μ—­λ³€ν™˜λΆ€(150), κ°€μ‚°λΆ€(155), 필터링뢀(160), λ©”λͺ¨λ¦¬(170), 인터 μ˜ˆμΈ‘λΆ€(180), 인트라 μ˜ˆμΈ‘λΆ€(185) 및 μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λ₯Ό ν¬ν•¨ν•˜μ—¬ ꡬ성될 수 μžˆλ‹€. 인터 μ˜ˆμΈ‘λΆ€(180) 및 인트라 μ˜ˆμΈ‘λΆ€(185)λŠ” μ˜ˆμΈ‘λΆ€λ‘œ 톡칭될 수 μžˆλ‹€. λ‹€μ‹œ 말해, μ˜ˆμΈ‘λΆ€λŠ” 인터 μ˜ˆμΈ‘λΆ€(180) 및 인트라 μ˜ˆμΈ‘λΆ€(185)λ₯Ό 포함할 수 μžˆλ‹€. λ³€ν™˜λΆ€(120), μ–‘μžν™”λΆ€(130), μ—­μ–‘μžν™”λΆ€(140), μ—­λ³€ν™˜λΆ€(150)λŠ” λ ˆμ§€λ“€μ–Ό(residual) μ²˜λ¦¬λΆ€μ— 포함될 수 μžˆλ‹€. λ ˆμ§€λ“€μ–Ό μ²˜λ¦¬λΆ€λŠ” 감산뢀(115)λ₯Ό 더 포함할 μˆ˜λ„ μžˆλ‹€. 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, μƒμˆ ν•œ μ˜μƒ λΆ„ν• λΆ€(110), 감산뢀(115), λ³€ν™˜λΆ€(120), μ–‘μžν™”λΆ€(130), μ—­μ–‘μžν™”λΆ€(140), μ—­λ³€ν™˜λΆ€(150), κ°€μ‚°λΆ€(155), 필터링뢀(160), 인터 μ˜ˆμΈ‘λΆ€(180), 인트라 μ˜ˆμΈ‘λΆ€(185) 및 μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λŠ” ν•˜λ‚˜μ˜ ν•˜λ“œμ›¨μ–΄ μ»΄ν¬λ„ŒνŠΈ(예λ₯Ό λ“€μ–΄, 인코더 λ˜λŠ” ν”„λ‘œμ„Έμ„œ)에 μ˜ν•˜μ—¬ ꡬ성될 수 μžˆλ‹€. λ˜ν•œ, λ©”λͺ¨λ¦¬(170)λŠ” DPB(decoded picture buffer)λ₯Ό 포함할 수 있고, λ””μ§€ν„Έ μ €μž₯ 맀체에 μ˜ν•˜μ—¬ ꡬ성될 μˆ˜λ„ μžˆλ‹€. Referring to FIG. 1, the encoding apparatus 100 may include an image splitter 110, a subtractor 115, a transformer 120, a quantizer 130, an inverse quantizer 140, an inverse transformer 150, The adder 155, the filter 160, the memory 170, the inter predictor 180, the intra predictor 185, and the entropy encoder 190 may be configured. The inter predictor 180 and the intra predictor 185 may be collectively referred to as a predictor. In other words, the predictor may include an inter predictor 180 and an intra predictor 185. The transform unit 120, the quantization unit 130, the inverse quantization unit 140, and the inverse transform unit 150 may be included in the residual processing unit. The residual processing unit may further include a subtracting unit 115. As an example, the image divider 110, the subtractor 115, the transformer 120, the quantizer 130, the inverse quantizer 140, the inverse transformer 150, and the adder 155 may be described. The filtering unit 160, the inter prediction unit 180, the intra prediction unit 185, and the entropy encoding unit 190 may be configured by one hardware component (eg, an encoder or a processor). In addition, the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.

μ˜μƒ λΆ„ν• λΆ€(110)λŠ” 인코딩 μž₯치(100)에 μž…λ ₯된 μž…λ ₯ μ˜μƒ(λ˜λŠ”, 픽쳐, ν”„λ ˆμž„)λ₯Ό ν•˜λ‚˜ μ΄μƒμ˜ 처리 μœ λ‹›(processing unit)으둜 λΆ„ν• ν•  수 μžˆλ‹€. 일 예둜, 상기 처리 μœ λ‹›μ€ μ½”λ”© μœ λ‹›(coding unit, CU)이라고 뢈릴 수 μžˆλ‹€. 이 경우 μ½”λ”© μœ λ‹›μ€ μ½”λ”© 트리 μœ λ‹›(coding tree unit, CTU) λ˜λŠ” μ΅œλŒ€ μ½”λ”© μœ λ‹›(largest coding unit, LCU)μœΌλ‘œλΆ€ν„° QTBT (Quad-tree binary-tree) ꡬ쑰에 따라 μž¬κ·€μ μœΌλ‘œ(recursively) 뢄할될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, ν•˜λ‚˜μ˜ μ½”λ”© μœ λ‹›μ€ μΏΌλ“œ 트리 ꡬ쑰 및/λ˜λŠ” λ°”μ΄λ„ˆλ¦¬ 트리 ꡬ쑰λ₯Ό 기반으둜 ν•˜μœ„(deeper) 뎁슀의 볡수의 μ½”λ”© μœ λ‹›λ“€λ‘œ 뢄할될 수 μžˆλ‹€. 이 경우 예λ₯Ό λ“€μ–΄ μΏΌλ“œ 트리 ꡬ쑰가 λ¨Όμ € 적용되고 λ°”μ΄λ„ˆλ¦¬ 트리 ꡬ쑰가 λ‚˜μ€‘μ— 적용될 수 μžˆλ‹€. λ˜λŠ” λ°”μ΄λ„ˆλ¦¬ 트리 ꡬ쑰가 λ¨Όμ € 적용될 μˆ˜λ„ μžˆλ‹€. 더 이상 λΆ„ν• λ˜μ§€ μ•ŠλŠ” μ΅œμ’… μ½”λ”© μœ λ‹›μ„ 기반으둜 λ³Έ 발λͺ…에 λ”°λ₯Έ μ½”λ”© μ ˆμ°¨κ°€ μˆ˜ν–‰λ  수 μžˆλ‹€. 이 경우 μ˜μƒ νŠΉμ„±μ— λ”°λ₯Έ μ½”λ”© 효율 등을 기반으둜, μ΅œλŒ€ μ½”λ”© μœ λ‹›μ΄ λ°”λ‘œ μ΅œμ’… μ½”λ”© μœ λ‹›μœΌλ‘œ μ‚¬μš©λ  수 있고, λ˜λŠ” ν•„μš”μ— 따라 μ½”λ”© μœ λ‹›μ€ μž¬κ·€μ μœΌλ‘œ(recursively) 보닀 ν•˜μœ„ 뎁슀의 μ½”λ”© μœ λ‹›λ“€λ‘œ λΆ„ν• λ˜μ–΄ 졜적의 μ‚¬μ΄μ¦ˆμ˜ μ½”λ”© μœ λ‹›μ΄ μ΅œμ’… μ½”λ”© μœ λ‹›μœΌλ‘œ μ‚¬μš©λ  수 μžˆλ‹€. μ—¬κΈ°μ„œ μ½”λ”© 절차라 함은 ν›„μˆ ν•˜λŠ” 예츑, λ³€ν™˜, 및 볡원 λ“±μ˜ 절차λ₯Ό 포함할 수 μžˆλ‹€. λ‹€λ₯Έ 예둜, 상기 처리 μœ λ‹›μ€ 예츑 μœ λ‹›(PU: Prediction Unit) λ˜λŠ” λ³€ν™˜ μœ λ‹›(TU: Transform Unit)을 더 포함할 수 μžˆλ‹€. 이 경우 상기 예츑 μœ λ‹› 및 상기 λ³€ν™˜ μœ λ‹›μ€ 각각 μƒμˆ ν•œ μ΅œμ’… μ½”λ”© μœ λ‹›μœΌλ‘œλΆ€ν„° λΆ„ν•  λ˜λŠ” νŒŒν‹°μ…”λ‹λ  수 μžˆλ‹€. 상기 예츑 μœ λ‹›μ€ μƒ˜ν”Œ 예츑의 λ‹¨μœ„μΌ 수 있고, 상기 λ³€ν™˜ μœ λ‹›μ€ λ³€ν™˜ κ³„μˆ˜λ₯Ό μœ λ„ν•˜λŠ” λ‹¨μœ„ 및/λ˜λŠ” λ³€ν™˜ κ³„μˆ˜λ‘œλΆ€ν„° λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έ(residual signal)λ₯Ό μœ λ„ν•˜λŠ” λ‹¨μœ„μΌ 수 μžˆλ‹€. The image divider 110 may divide the input image (or picture or frame) input to the encoding apparatus 100 into one or more processing units. For example, the processing unit may be called a coding unit (CU). In this case, the coding unit may be recursively divided according to a quad-tree binary-tree (QTBT) structure from a coding tree unit (CTU) or a largest coding unit (LCU). For example, one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad tree structure and / or a binary tree structure. In this case, for example, the quad tree structure may be applied first and the binary tree structure may be applied later. Alternatively, the binary tree structure may be applied first. The coding procedure according to the present invention may be performed based on the final coding unit that is no longer split. In this case, the maximum coding unit may be used as the final coding unit immediately based on coding efficiency according to the image characteristic, or if necessary, the coding unit is recursively divided into coding units of lower depths and optimized. A coding unit of size 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 may further include a prediction unit (PU) or a transform unit (TU). In this case, the prediction unit and the transform unit may be partitioned or partitioned from the aforementioned final coding unit, respectively. The prediction unit may be a unit of sample prediction, and the transformation unit may be a unit for deriving a transform coefficient and / or a unit for deriving a residual signal from the transform coefficient.

μœ λ‹›μ€ κ²½μš°μ— λ”°λΌμ„œ 블둝(block) λ˜λŠ” μ˜μ—­(area) λ“±μ˜ μš©μ–΄μ™€ ν˜Όμš©ν•˜μ—¬ μ‚¬μš©λ  수 μžˆλ‹€. 일반적인 경우, MxN 블둝은 M개의 μ—΄κ³Ό N개의 ν–‰μœΌλ‘œ 이루어진 μƒ˜ν”Œλ“€ λ˜λŠ” λ³€ν™˜ κ³„μˆ˜(transform coefficient)λ“€μ˜ 집합을 λ‚˜νƒ€λ‚Ό 수 μžˆλ‹€. μƒ˜ν”Œμ€ 일반적으둜 ν”½μ…€ λ˜λŠ” ν”½μ…€μ˜ 값을 λ‚˜νƒ€λ‚Ό 수 있으며, νœ˜λ„(luma) μ„±λΆ„μ˜ ν”½μ…€/ν”½μ…€κ°’λ§Œμ„ λ‚˜νƒ€λ‚Ό μˆ˜λ„ 있고, 채도(chroma) μ„±λΆ„μ˜ ν”½μ…€/ν”½μ…€ κ°’λ§Œμ„ λ‚˜νƒ€λ‚Ό μˆ˜λ„ μžˆλ‹€. μƒ˜ν”Œμ€ ν•˜λ‚˜μ˜ ν”½μ²˜(λ˜λŠ” μ˜μƒ)을 ν”½μ…€(pixel) λ˜λŠ” 펠(pel)에 λŒ€μ‘ν•˜λŠ” μš©μ–΄λ‘œμ„œ μ‚¬μš©λ  수 μžˆλ‹€.The unit may be used interchangeably with terms such as block or area in some cases. In a general case, an M Γ— N block may represent a set of samples or transform coefficients composed of M columns and N rows. A sample may generally represent a pixel or a value of a pixel, and may only represent pixel / pixel values of the luma component, or only pixel / pixel values of the chroma component. A sample may be used as a term corresponding to one picture (or image) for a pixel or a pel.

인코딩 μž₯치(100)λŠ” μž…λ ₯ μ˜μƒ μ‹ ν˜Έ(원본 블둝, 원본 μƒ˜ν”Œ μ–΄λ ˆμ΄)μ—μ„œ 인터 μ˜ˆμΈ‘λΆ€(180) λ˜λŠ” 인트라 μ˜ˆμΈ‘λΆ€(185)λ‘œλΆ€ν„° 좜λ ₯된 예츑 μ‹ ν˜Έ(예츑된 블둝, 예츑 μƒ˜ν”Œ μ–΄λ ˆμ΄)λ₯Ό κ°μ‚°ν•˜μ—¬ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έ(residual signal, μž”μ—¬ 블둝, μž”μ—¬ μƒ˜ν”Œ μ–΄λ ˆμ΄)λ₯Ό 생성할 수 있고, μƒμ„±λœ λ ˆμ§€λ“€μ–Ό μ‹ ν˜ΈλŠ” λ³€ν™˜λΆ€(120)둜 μ „μ†‘λœλ‹€. 이 경우 λ„μ‹œλœ 바와 같이 인코더(100) λ‚΄μ—μ„œ μž…λ ₯ μ˜μƒ μ‹ ν˜Έ(원본 블둝, 원본 μƒ˜ν”Œ μ–΄λ ˆμ΄)μ—μ„œ 예츑 μ‹ ν˜Έ(예츑 블둝, 예츑 μƒ˜ν”Œ μ–΄λ ˆμ΄)λ₯Ό κ°μ‚°ν•˜λŠ” μœ λ‹›μ€ 감산뢀(115)라고 뢈릴 수 μžˆλ‹€. μ˜ˆμΈ‘λΆ€λŠ” 처리 λŒ€μƒ 블둝(μ΄ν•˜, ν˜„μž¬ 블둝이라 함)에 λŒ€ν•œ μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜κ³ , 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 예츑 μƒ˜ν”Œλ“€μ„ ν¬ν•¨ν•˜λŠ” 예츑된 블둝(predicted block)을 생성할 수 μžˆλ‹€. μ˜ˆμΈ‘λΆ€λŠ” ν˜„μž¬ 블둝 λ˜λŠ” CU λ‹¨μœ„λ‘œ 인트라 예츑이 μ μš©λ˜λŠ”μ§€ λ˜λŠ” 인터 예츑이 μ μš©λ˜λŠ”μ§€ κ²°μ •ν•  수 μžˆλ‹€. μ˜ˆμΈ‘λΆ€λŠ” 각 예츑λͺ¨λ“œμ— λŒ€ν•œ μ„€λͺ…μ—μ„œ ν›„μˆ ν•˜λŠ” 바와 같이 예츑 λͺ¨λ“œ 정보 λ“± μ˜ˆμΈ‘μ— κ΄€ν•œ λ‹€μ–‘ν•œ 정보λ₯Ό μƒμ„±ν•˜μ—¬ μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)둜 전달할 수 μžˆλ‹€. μ˜ˆμΈ‘μ— κ΄€ν•œ μ •λ³΄λŠ” μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)μ—μ„œ μΈμ½”λ”©λ˜μ–΄ λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ 좜λ ₯될 수 μžˆλ‹€. The encoding apparatus 100 subtracts the prediction signal (predicted block, prediction sample array) output from the inter prediction unit 180 or the intra prediction unit 185 from the input image signal (original block, original sample array). A signal may be generated (residual signal, residual block, residual sample array), and the generated residual signal is transmitted to the converter 120. In this case, as shown, a unit that subtracts a prediction signal (prediction block, prediction sample array) from an input image signal (original block, original sample array) in the encoder 100 may be called a subtraction unit 115. The prediction unit may perform a prediction on a block to be processed (hereinafter, referred to as a 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. As described later in the description of each prediction mode, the prediction unit may generate various information related to prediction, such as prediction mode information, and transmit the generated information to the entropy encoding unit 190. The information about the prediction may be encoded in the entropy encoding unit 190 and output in the form of a bitstream.

인트라 μ˜ˆμΈ‘λΆ€(185)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄μ˜ μƒ˜ν”Œλ“€μ„ μ°Έμ‘°ν•˜μ—¬ ν˜„μž¬ 블둝을 μ˜ˆμΈ‘ν•  수 μžˆλ‹€. 상기 μ°Έμ‘°λ˜λŠ” μƒ˜ν”Œλ“€μ€ 예츑 λͺ¨λ“œμ— 따라 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€(neighbor)에 μœ„μΉ˜ν•  수 있고, λ˜λŠ” λ–¨μ–΄μ Έμ„œ μœ„μΉ˜ν•  μˆ˜λ„ μžˆλ‹€. 인트라 μ˜ˆμΈ‘μ—μ„œ 예츑 λͺ¨λ“œλ“€μ€ 볡수의 λΉ„λ°©ν–₯μ„± λͺ¨λ“œμ™€ 볡수의 λ°©ν–₯μ„± λͺ¨λ“œλ₯Ό 포함할 수 μžˆλ‹€. λΉ„λ°©ν–₯μ„± λͺ¨λ“œλŠ” 예λ₯Ό λ“€μ–΄ DC λͺ¨λ“œ 및 ν”Œλž˜λ„ˆ λͺ¨λ“œ(Planar λͺ¨λ“œ)λ₯Ό 포함할 수 μžˆλ‹€. λ°©ν–₯μ„± λͺ¨λ“œλŠ” 예츑 λ°©ν–₯의 μ„Έλ°€ν•œ 정도에 따라 예λ₯Ό λ“€μ–΄ 33개의 λ°©ν–₯μ„± 예츑 λͺ¨λ“œ λ˜λŠ” 65개의 λ°©ν–₯μ„± 예츑 λͺ¨λ“œλ₯Ό 포함할 수 μžˆλ‹€. λ‹€λ§Œ, μ΄λŠ” μ˜ˆμ‹œλ‘œμ„œ 섀정에 따라 κ·Έ 이상 λ˜λŠ” κ·Έ μ΄ν•˜μ˜ 개수의 λ°©ν–₯μ„± 예츑 λͺ¨λ“œλ“€μ΄ μ‚¬μš©λ  수 μžˆλ‹€. 인트라 μ˜ˆμΈ‘λΆ€(185)λŠ” μ£Όλ³€ 블둝에 적용된 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬, ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•  μˆ˜λ„ μžˆλ‹€.The intra predictor 185 may predict the current block by referring to the samples in the current picture. The referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode. In intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. Non-directional mode may include, for example, DC mode and planner mode (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, as an example, more or less directional prediction modes may be used depending on the setting. The intra predictor 185 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.

인터 μ˜ˆμΈ‘λΆ€(180)λŠ” μ°Έμ‘° ν”½μ²˜ μƒμ—μ„œ μ›€μ§μž„ 벑터에 μ˜ν•΄ νŠΉμ •λ˜λŠ” μ°Έμ‘° 블둝(μ°Έμ‘° μƒ˜ν”Œ μ–΄λ ˆμ΄)을 기반으둜, ν˜„μž¬ 블둝에 λŒ€ν•œ 예츑된 블둝을 μœ λ„ν•  수 μžˆλ‹€. μ΄λ•Œ, 인터 예츑 λͺ¨λ“œμ—μ„œ μ „μ†‘λ˜λŠ” μ›€μ§μž„ μ •λ³΄μ˜ 양을 쀄이기 μœ„ν•΄ μ£Όλ³€ 블둝과 ν˜„μž¬ 블둝 κ°„μ˜ μ›€μ§μž„ μ •λ³΄μ˜ 상관성에 κΈ°μ΄ˆν•˜μ—¬ μ›€μ§μž„ 정보λ₯Ό 블둝, μ„œλΈŒλΈ”λ‘ λ˜λŠ” μƒ˜ν”Œ λ‹¨μœ„λ‘œ μ˜ˆμΈ‘ν•  수 μžˆλ‹€. 상기 μ›€μ§μž„ μ •λ³΄λŠ” μ›€μ§μž„ 벑터 및 μ°Έμ‘° ν”½μ²˜ 인덱슀λ₯Ό 포함할 수 μžˆλ‹€. 상기 μ›€μ§μž„ μ •λ³΄λŠ” 인터 예츑 λ°©ν–₯(L0 예츑, L1 예츑, Bi 예츑 λ“±) 정보λ₯Ό 더 포함할 수 μžˆλ‹€. 인터 예츑의 κ²½μš°μ—, μ£Όλ³€ 블둝은 ν˜„μž¬ ν”½μ²˜ 내에 μ‘΄μž¬ν•˜λŠ” 곡간적 μ£Όλ³€ 블둝(spatial neighboring block)κ³Ό μ°Έμ‘° ν”½μ²˜μ— μ‘΄μž¬ν•˜λŠ” μ‹œκ°„μ  μ£Όλ³€ 블둝(temporal neighboring block)을 포함할 수 μžˆλ‹€. 상기 μ°Έμ‘° 블둝을 ν¬ν•¨ν•˜λŠ” μ°Έμ‘° ν”½μ²˜μ™€ 상기 μ‹œκ°„μ  μ£Όλ³€ 블둝을 ν¬ν•¨ν•˜λŠ” μ°Έμ‘° ν”½μ²˜λŠ” 동일할 μˆ˜λ„ 있고, λ‹€λ₯Ό μˆ˜λ„ μžˆλ‹€. 상기 μ‹œκ°„μ  μ£Όλ³€ 블둝은 동일 μœ„μΉ˜ μ°Έμ‘° 블둝(collocated reference block), 동일 μœ„μΉ˜ CU(colCU) λ“±μ˜ μ΄λ¦„μœΌλ‘œ 뢈릴 수 있으며, 상기 μ‹œκ°„μ  μ£Όλ³€ 블둝을 ν¬ν•¨ν•˜λŠ” μ°Έμ‘° ν”½μ²˜λŠ” 동일 μœ„μΉ˜ ν”½μ²˜(collocated picture, colPic)라고 뢈릴 μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 인터 μ˜ˆμΈ‘λΆ€(180)λŠ” μ£Όλ³€ 블둝듀을 기반으둜 μ›€μ§μž„ 정보 후보 리슀트λ₯Ό κ΅¬μ„±ν•˜κ³ , 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ›€μ§μž„ 벑터 및/λ˜λŠ” μ°Έμ‘° ν”½μ²˜ 인덱슀λ₯Ό λ„μΆœν•˜κΈ° μœ„ν•˜μ—¬ μ–΄λ–€ 후보가 μ‚¬μš©λ˜λŠ”μ§€λ₯Ό μ§€μ‹œν•˜λŠ” 정보λ₯Ό 생성할 수 μžˆλ‹€. λ‹€μ–‘ν•œ 예츑 λͺ¨λ“œλ₯Ό 기반으둜 인터 예츑이 μˆ˜ν–‰λ  수 있으며, 예λ₯Ό λ“€μ–΄ μŠ€ν‚΅ λͺ¨λ“œμ™€ λ¨Έμ§€ λͺ¨λ“œμ˜ κ²½μš°μ—, 인터 μ˜ˆμΈ‘λΆ€(180)λŠ” μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ 정보λ₯Ό ν˜„μž¬ λΈ”λ‘μ˜ μ›€μ§μž„ μ •λ³΄λ‘œ μ΄μš©ν•  수 μžˆλ‹€. μŠ€ν‚΅ λͺ¨λ“œμ˜ 경우, λ¨Έμ§€ λͺ¨λ“œμ™€ 달리 λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έκ°€ μ „μ†‘λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€. μ›€μ§μž„ 정보 예츑(motion vector prediction, MVP) λͺ¨λ“œμ˜ 경우, μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ 벑터λ₯Ό μ›€μ§μž„ 벑터 예츑자(motion vector predictor)둜 μ΄μš©ν•˜κ³ , μ›€μ§μž„ 벑터 μ°¨λΆ„(motion vector difference)을 μ‹œκ·Έλ„λ§ν•¨μœΌλ‘œμ¨ ν˜„μž¬ λΈ”λ‘μ˜ μ›€μ§μž„ 벑터λ₯Ό μ§€μ‹œν•  수 μžˆλ‹€.The inter predictor 180 may derive the predicted block with respect to the current block based on the reference block (reference sample array) specified by the motion vector on the 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 the correlation of the 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 existing 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 referred to as a collocated reference block, a collocated CU (colCU), and the like, and a reference picture including the temporal neighboring block is called a collocated picture (colPic). It may be. For example, the inter prediction unit 180 constructs a motion information candidate list based on neighboring blocks and provides information indicating which candidates are used to derive a motion vector and / or a reference picture index of the current block. Can be generated. Inter prediction may be performed based on various prediction modes. For example, in case of a skip mode and a merge mode, the inter prediction unit 180 may use motion information of a neighboring block as motion information of a current block. In the skip mode, unlike the merge mode, the residual signal may not be transmitted. In the motion vector prediction (MVP) mode, the motion vector of the neighboring block is used as a motion vector predictor and the motion vector difference is signaled by signaling a motion vector difference. Can be directed.

상기 인터 μ˜ˆμΈ‘λΆ€(180) λ˜λŠ” 상기 인트라 μ˜ˆμΈ‘λΆ€(185)λ₯Ό 톡해 μƒμ„±λœ 예츑 μ‹ ν˜ΈλŠ” 볡원 μ‹ ν˜Έλ₯Ό μƒμ„±ν•˜κΈ° μœ„ν•΄ μ΄μš©λ˜κ±°λ‚˜ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έλ₯Ό μƒμ„±ν•˜κΈ° μœ„ν•΄ 이용될 수 μžˆλ‹€. The prediction signal generated by the inter predictor 180 or the intra predictor 185 may be used to generate a reconstruction signal or to generate a residual signal.

λ³€ν™˜λΆ€(120)λŠ” λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έμ— λ³€ν™˜ 기법을 μ μš©ν•˜μ—¬ λ³€ν™˜ κ³„μˆ˜λ“€(transform coefficients)λ₯Ό 생성할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, λ³€ν™˜ 기법은 DCT(Discrete Cosine Transform), DST(Discrete Sine Transform), KLT(Karhunen-Loeve Transform), GBT(Graph-Based Transform), λ˜λŠ” CNT(Conditionally Non-linear Transform) 쀑 적어도 ν•˜λ‚˜λ₯Ό 포함할 수 μžˆλ‹€. μ—¬κΈ°μ„œ, GBTλŠ” ν”½μ…€ κ°„μ˜ 관계 정보λ₯Ό κ·Έλž˜ν”„λ‘œ ν‘œν˜„ν•œλ‹€κ³  ν•  λ•Œ 이 κ·Έλž˜ν”„λ‘œλΆ€ν„° μ–»μ–΄μ§„ λ³€ν™˜μ„ μ˜λ―Έν•œλ‹€. CNTλŠ” 이전에 λ³΅μ›λœ λͺ¨λ“  ν”½μ…€(all previously reconstructed pixel)λ₯Ό μ΄μš©ν•˜μ—¬ 예츑 μ‹ ν˜Έλ₯Ό μƒμ„±ν•˜κ³  그에 κΈ°μ΄ˆν•˜μ—¬ νšλ“λ˜λŠ” λ³€ν™˜μ„ μ˜λ―Έν•œλ‹€. λ˜ν•œ, λ³€ν™˜ 과정은 μ •μ‚¬κ°ν˜•μ˜ λ™μΌν•œ 크기λ₯Ό κ°–λŠ” ν”½μ…€ 블둝에 적용될 μˆ˜λ„ 있고, μ •μ‚¬κ°ν˜•μ΄ μ•„λ‹Œ κ°€λ³€ 크기의 블둝에도 적용될 수 μžˆλ‹€.The transformer 120 may apply transform techniques to the residual signal to generate transform coefficients. For example, the transformation technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a karhunen-loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT). It may include. Here, GBT means a conversion obtained from this graph when the relationship information between pixels is represented by a graph. CNT refers to a transform that is generated based on and generates a prediction signal using all previously reconstructed pixels. In addition, the conversion process may be applied to pixel blocks having the same size as the square, or may be applied to blocks of variable size rather than square.

μ–‘μžν™”λΆ€(130)λŠ” λ³€ν™˜ κ³„μˆ˜λ“€μ„ μ–‘μžν™”ν•˜μ—¬ μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)둜 μ „μ†‘λ˜κ³ , μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λŠ” μ–‘μžν™”λœ μ‹ ν˜Έ(μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— κ΄€ν•œ 정보)λ₯Ό μΈμ½”λ”©ν•˜μ—¬ λΉ„νŠΈμŠ€νŠΈλ¦ΌμœΌλ‘œ 좜λ ₯ν•  수 μžˆλ‹€. 상기 μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— κ΄€ν•œ μ •λ³΄λŠ” λ ˆμ§€λ“€μ–Ό 정보라고 뢈릴 수 μžˆλ‹€. μ–‘μžν™”λΆ€(130)λŠ” κ³„μˆ˜ μŠ€μΊ” μˆœμ„œ(scan order)λ₯Ό 기반으둜 블둝 ν˜•νƒœμ˜ μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ„ 1차원 벑터 ν˜•νƒœλ‘œ μž¬μ •λ ¬ν•  수 있고, 상기 1차원 벑터 ν˜•νƒœμ˜ μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ„ 기반으둜 상기 μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— κ΄€ν•œ 정보λ₯Ό 생성할 μˆ˜λ„ μžˆλ‹€. μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λŠ” 예λ₯Ό λ“€μ–΄ μ§€μˆ˜ 골둬(exponential Golomb), CAVLC(context-adaptive variable length coding), CABAC(context-adaptive binary arithmetic coding) λ“±κ³Ό 같은 λ‹€μ–‘ν•œ 인코딩 방법을 μˆ˜ν–‰ν•  수 μžˆλ‹€. μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λŠ” μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€ μ™Έ λΉ„λ””μ˜€/이미지 볡원에 ν•„μš”ν•œ 정보듀(μ˜ˆμ»¨λŒ€ μ‹ νƒμŠ€ μš”μ†Œλ“€(syntax elements)의 κ°’ λ“±)을 ν•¨κ»˜ λ˜λŠ” λ³„λ„λ‘œ 인코딩할 μˆ˜λ„ μžˆλ‹€. μΈμ½”λ”©λœ 정보(ex. μΈμ½”λ”©λœ λΉ„λ””μ˜€/μ˜μƒ 정보)λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ NAL(network abstraction layer) μœ λ‹› λ‹¨μœ„λ‘œ 전솑 λ˜λŠ” μ €μž₯될 수 μžˆλ‹€. 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ€ λ„€νŠΈμ›Œν¬λ₯Ό ν†΅ν•˜μ—¬ 전솑될 수 있고, λ˜λŠ” λ””μ§€ν„Έ μ €μž₯맀체에 μ €μž₯될 수 μžˆλ‹€. μ—¬κΈ°μ„œ λ„€νŠΈμ›Œν¬λŠ” 방솑망 및/λ˜λŠ” 톡신망 등을 포함할 수 있고, λ””μ§€ν„Έ μ €μž₯λ§€μ²΄λŠ” USB, SD, CD, DVD, λΈ”λ£¨λ ˆμ΄, HDD, SSD λ“± λ‹€μ–‘ν•œ μ €μž₯맀체λ₯Ό 포함할 수 μžˆλ‹€. μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)λ‘œλΆ€ν„° 좜λ ₯된 μ‹ ν˜ΈλŠ” μ „μ†‘ν•˜λŠ” 전솑뢀(λ―Έλ„μ‹œ) 및/λ˜λŠ” μ €μž₯ν•˜λŠ” μ €μž₯λΆ€(λ―Έλ„μ‹œ)κ°€ 인코딩 μž₯치(100)의 λ‚΄/μ™ΈλΆ€ μ—˜λ¦¬λ¨ΌνŠΈλ‘œμ„œ ꡬ성될 수 있고, λ˜λŠ” μ „μ†‘λΆ€λŠ” μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)의 κ΅¬μ„±μš”μ†ŒμΌ μˆ˜λ„ μžˆλ‹€.The quantization unit 130 quantizes the transform coefficients and transmits them to the entropy encoding unit 190. The entropy encoding unit 190 encodes the quantized signal (information about the quantized transform coefficients) and outputs the bitstream. have. The information about the quantized transform coefficients may be referred to as residual information. The quantization unit 130 may rearrange block quantized transform coefficients into a one-dimensional vector form based on a coefficient scan order, and quantize the quantized transform coefficients based on the quantized transform coefficients in the one-dimensional vector form. Information about transform coefficients may be generated. The entropy encoding unit 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 encoding unit 190 may encode information necessary for video / image reconstruction other than quantized transform coefficients (for example, values of syntax elements) together or separately. Encoded information (eg, encoded video / image information) may be transmitted or stored in units of NALs (network abstraction layer) in the form of a 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. The signal output from the entropy encoding unit 190 may include a transmitting unit (not shown) for transmitting and / or a storing unit (not shown) for storing as an internal / external element of the encoding apparatus 100, or the transmitting unit It may be a component of the entropy encoding unit 190.

μ–‘μžν™”λΆ€(130)λ‘œλΆ€ν„° 좜λ ₯된 μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ€ 예츑 μ‹ ν˜Έλ₯Ό μƒμ„±ν•˜κΈ° μœ„ν•΄ 이용될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ€μ— 루프 λ‚΄μ˜ μ—­μ–‘μžν™”λΆ€(140) 및 μ—­λ³€ν™˜λΆ€(150)λ₯Ό 톡해 μ—­μ–‘μžν™” 및 μ—­λ³€ν™˜μ„ μ μš©ν•¨μœΌλ‘œμ¨ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έλ₯Ό 볡원할 수 μžˆλ‹€. κ°€μ‚°λΆ€(155)λŠ” λ³΅μ›λœ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έλ₯Ό 인터 μ˜ˆμΈ‘λΆ€(180) λ˜λŠ” 인트라 μ˜ˆμΈ‘λΆ€(185)λ‘œλΆ€ν„° 좜λ ₯된 예츑 μ‹ ν˜Έμ— λ”ν•¨μœΌλ‘œμ¨ 볡원(reconstructed) μ‹ ν˜Έ(볡원 ν”½μ²˜, 볡원 블둝, 볡원 μƒ˜ν”Œ μ–΄λ ˆμ΄)κ°€ 생성될 수 μžˆλ‹€. μŠ€ν‚΅ λͺ¨λ“œκ°€ 적용된 κ²½μš°μ™€ 같이 처리 λŒ€μƒ 블둝에 λŒ€ν•œ λ ˆμ§€λ“€μ–Όμ΄ μ—†λŠ” 경우, 예츑된 블둝이 볡원 λΈ”λ‘μœΌλ‘œ μ‚¬μš©λ  수 μžˆλ‹€. κ°€μ‚°λΆ€(155)λŠ” 볡원뢀 λ˜λŠ” 볡원 블둝 생성뢀라고 뢈릴 수 μžˆλ‹€. μƒμ„±λœ 볡원 μ‹ ν˜ΈλŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ λ‹€μŒ 처리 λŒ€μƒ λΈ”λ‘μ˜ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•˜μ—¬ μ‚¬μš©λ  수 있고, ν›„μˆ ν•˜λŠ” 바와 같이 필터링을 κ±°μ³μ„œ λ‹€μŒ ν”½μ²˜μ˜ 인터 μ˜ˆμΈ‘μ„ μœ„ν•˜μ—¬ μ‚¬μš©λ  μˆ˜λ„ μžˆλ‹€. The quantized transform coefficients output from the quantization unit 130 may be used to generate a prediction signal. For example, the quantized transform coefficients may be reconstructed in the residual signal by applying inverse quantization and inverse transform through inverse quantization unit 140 and inverse transform unit 150 in a loop. The adder 155 adds the reconstructed residual signal to the predicted signal output from the inter predictor 180 or the intra predictor 185 so that a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) is added. Can be generated. 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 adder 155 may be called a restoration unit or a restoration block generation unit. The generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.

필터링뢀(160)λŠ” 볡원 μ‹ ν˜Έμ— 필터링을 μ μš©ν•˜μ—¬ 주관적/객관적 ν™”μ§ˆμ„ ν–₯μƒμ‹œν‚¬ 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄ 필터링뢀(160)은 볡원 ν”½μ²˜μ— λ‹€μ–‘ν•œ 필터링 방법을 μ μš©ν•˜μ—¬ μˆ˜μ •λœ(modified) 볡원 ν”½μ²˜λ₯Ό 생성할 수 있고, 상기 μˆ˜μ •λœ 볡원 ν”½μ²˜λ₯Ό λ©”λͺ¨λ¦¬(170), ꡬ체적으둜 λ©”λͺ¨λ¦¬(170)의 DPB에 μ €μž₯ν•  수 μžˆλ‹€. 상기 λ‹€μ–‘ν•œ 필터링 방법은 예λ₯Ό λ“€μ–΄, 디블둝킹 필터링, μƒ˜ν”Œ 적응적 μ˜€ν”„μ…‹(sample adaptive offset), 적응적 루프 ν•„ν„°(adaptive loop filter), μ–‘λ°©ν–₯ ν•„ν„°(bilateral filter) 등을 포함할 수 μžˆλ‹€. 필터링뢀(160)은 각 필터링 방법에 λŒ€ν•œ μ„€λͺ…μ—μ„œ ν›„μˆ ν•˜λŠ” 바와 같이 필터링에 κ΄€ν•œ λ‹€μ–‘ν•œ 정보λ₯Ό μƒμ„±ν•˜μ—¬ μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)둜 전달할 수 μžˆλ‹€. 필터링 κ΄€ν•œ μ •λ³΄λŠ” μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)μ—μ„œ μΈμ½”λ”©λ˜μ–΄ λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ 좜λ ₯될 수 μžˆλ‹€. The filtering unit 160 may improve subjective / objective image quality by applying filtering to the reconstruction signal. For example, the filtering unit 160 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture is stored in the memory 170, specifically, the DPB of the memory 170. Can be stored in The various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like. As described below in the description of each filtering method, the filtering unit 160 may generate various information about the filtering and transmit the generated information to the entropy encoding unit 190. The filtering information may be encoded in the entropy encoding unit 190 and output in the form of a bitstream.

λ©”λͺ¨λ¦¬(170)에 μ „μ†‘λœ μˆ˜μ •λœ 볡원 ν”½μ²˜λŠ” 인터 μ˜ˆμΈ‘λΆ€(180)μ—μ„œ μ°Έμ‘° ν”½μ²˜λ‘œ μ‚¬μš©λ  수 μžˆλ‹€. 인코딩 μž₯μΉ˜λŠ” 이λ₯Ό ν†΅ν•˜μ—¬ 인터 예츑이 μ μš©λ˜λŠ” 경우, 인코딩 μž₯치(100)와 λ””μ½”λ”© μž₯μΉ˜μ—μ„œμ˜ 예츑 미슀맀치λ₯Ό ν”Όν•  수 있고, λΆ€ν˜Έν™” νš¨μœ¨λ„ ν–₯μƒμ‹œν‚¬ 수 μžˆλ‹€. The modified reconstructed picture transmitted to the memory 170 may be used as the reference picture in the inter predictor 180. When the inter prediction is applied through the encoding apparatus, the encoding apparatus may avoid prediction mismatch between the encoding apparatus 100 and the decoding apparatus, and may improve encoding efficiency.

λ©”λͺ¨λ¦¬(170) DPBλŠ” μˆ˜μ •λœ 볡원 ν”½μ²˜λ₯Ό 인터 μ˜ˆμΈ‘λΆ€(180)μ—μ„œμ˜ μ°Έμ‘° ν”½μ²˜λ‘œ μ‚¬μš©ν•˜κΈ° μœ„ν•΄ μ €μž₯ν•  수 μžˆλ‹€. λ©”λͺ¨λ¦¬(170)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ μ›€μ§μž„ 정보가 λ„μΆœλœ(λ˜λŠ” μΈμ½”λ”©λœ) λΈ”λ‘μ˜ μ›€μ§μž„ 정보 및/λ˜λŠ” 이미 λ³΅μ›λœ ν”½μ²˜ λ‚΄ λΈ”λ‘λ“€μ˜ μ›€μ§μž„ 정보λ₯Ό μ €μž₯ν•  수 μžˆλ‹€. 상기 μ €μž₯된 μ›€μ§μž„ μ •λ³΄λŠ” 곡간적 μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ 정보 λ˜λŠ” μ‹œκ°„μ  μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ μ •λ³΄λ‘œ ν™œμš©ν•˜κΈ° μœ„ν•˜μ—¬ 인터 μ˜ˆμΈ‘λΆ€(180)에 전달할 수 μžˆλ‹€. λ©”λͺ¨λ¦¬(170)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ λ³΅μ›λœ λΈ”λ‘λ“€μ˜ 볡원 μƒ˜ν”Œλ“€μ„ μ €μž₯ν•  수 있고, 인트라 μ˜ˆμΈ‘λΆ€(185)에 전달할 수 μžˆλ‹€. The memory 170 DPB may store the modified reconstructed picture for use as a reference picture in the inter predictor 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 predictor 180 to use 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 transfer the reconstructed samples to the intra predictor 185.

도 2λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λΉ„λ””μ˜€/이미지 μ‹ ν˜Έμ˜ 디코딩이 μˆ˜ν–‰λ˜λŠ” λ””μ½”λ”© μž₯치의 개랡적인 블둝도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.2 is a schematic block diagram of a decoding apparatus in which an embodiment of the present invention is applied and decoding of a video / image signal is performed.

도 2λ₯Ό μ°Έμ‘°ν•˜λ©΄, λ””μ½”λ”© μž₯치(200)λŠ” μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210), μ—­μ–‘μžν™”λΆ€(220), μ—­λ³€ν™˜λΆ€(230), κ°€μ‚°λΆ€(235), 필터링뢀(240), λ©”λͺ¨λ¦¬(250), 인터 μ˜ˆμΈ‘λΆ€(260) 및 인트라 μ˜ˆμΈ‘λΆ€(265)λ₯Ό ν¬ν•¨ν•˜μ—¬ ꡬ성될 수 μžˆλ‹€. 인터 μ˜ˆμΈ‘λΆ€(260) 및 인트라 μ˜ˆμΈ‘λΆ€(265)λ₯Ό ν•©μ³μ„œ μ˜ˆμΈ‘λΆ€λΌκ³  뢈릴 수 μžˆλ‹€. 즉, μ˜ˆμΈ‘λΆ€λŠ” 인터 μ˜ˆμΈ‘λΆ€(180) 및 인트라 μ˜ˆμΈ‘λΆ€(185)λ₯Ό 포함할 수 μžˆλ‹€. μ—­μ–‘μžν™”λΆ€(220), μ—­λ³€ν™˜λΆ€(230)λ₯Ό ν•©μ³μ„œ λ ˆμ§€λ“€μ–Ό μ²˜λ¦¬λΆ€λΌκ³  뢈릴 수 μžˆλ‹€. 즉, λ ˆμ§€λ“€μ–Ό μ²˜λ¦¬λΆ€λŠ” μ—­μ–‘μžν™”λΆ€(220), μ—­λ³€ν™˜λΆ€(230)을 포함할 수 μžˆλ‹€. μƒμˆ ν•œ μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210), μ—­μ–‘μžν™”λΆ€(220), μ—­λ³€ν™˜λΆ€(230), κ°€μ‚°λΆ€(235), 필터링뢀(240), 인터 μ˜ˆμΈ‘λΆ€(260) 및 인트라 μ˜ˆμΈ‘λΆ€(265)λŠ” μ‹€μ‹œμ˜ˆμ— 따라 ν•˜λ‚˜μ˜ ν•˜λ“œμ›¨μ–΄ μ»΄ν¬λ„ŒνŠΈ(예λ₯Ό λ“€μ–΄ 디코더 λ˜λŠ” ν”„λ‘œμ„Έμ„œ)에 μ˜ν•˜μ—¬ ꡬ성될 수 μžˆλ‹€. λ˜ν•œ λ©”λͺ¨λ¦¬(170)λŠ” DPB(decoded picture buffer)λ₯Ό 포함할 수 있고, λ””μ§€ν„Έ μ €μž₯ 맀체에 μ˜ν•˜μ—¬ ꡬ성될 μˆ˜λ„ μžˆλ‹€.Referring to FIG. 2, the decoding apparatus 200 includes an entropy decoding unit 210, an inverse quantizer 220, an inverse transform unit 230, an adder 235, a filter 240, a memory 250, and an inter The prediction unit 260 and the intra prediction unit 265 may be configured. The inter predictor 260 and the intra predictor 265 may be collectively called a predictor. That is, the predictor may include an inter predictor 180 and an intra predictor 185. The inverse quantization unit 220 and the inverse transform unit 230 may be collectively called a residual processing unit. That is, the residual processing unit may include an inverse quantization unit 220 and an inverse transformation unit 230. The entropy decoder 210, the inverse quantizer 220, the inverse transformer 230, the adder 235, the filter 240, the inter predictor 260, and the intra predictor 265 are described in the embodiment. Can be configured by one hardware component (eg, decoder or processor). In addition, the memory 170 may include a decoded picture buffer (DPB) or may be configured by a digital storage medium.

λΉ„λ””μ˜€/이미지 정보λ₯Ό ν¬ν•¨ν•˜λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Όμ΄ μž…λ ₯되면, λ””μ½”λ”© μž₯치(200)λŠ” 도 1의 인코딩 μž₯μΉ˜μ—μ„œ λΉ„λ””μ˜€/이미지 정보가 처리된 ν”„λ‘œμ„ΈμŠ€μ— λŒ€μ‘ν•˜μ—¬ μ˜μƒμ„ 볡원할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, λ””μ½”λ”© μž₯치(200)λŠ” 인코딩 μž₯μΉ˜μ—μ„œ 적용된 처리 μœ λ‹›μ„ μ΄μš©ν•˜μ—¬ 디코딩을 μˆ˜ν–‰ν•  수 μžˆλ‹€. λ”°λΌμ„œ λ””μ½”λ”©μ˜ 처리 μœ λ‹›μ€ 예λ₯Ό λ“€μ–΄ μ½”λ”© μœ λ‹›μΌ 수 있고, μ½”λ”© μœ λ‹›μ€ μ½”λ”© 트리 μœ λ‹› λ˜λŠ” μ΅œλŒ€ μ½”λ”© μœ λ‹›μœΌλ‘œλΆ€ν„° μΏΌλ“œ 트리 ꡬ쑰 및/λ˜λŠ” λ°”μ΄λ„ˆλ¦¬ 트리 ꡬ쑰λ₯Ό λ”°λΌμ„œ 뢄할될 수 μžˆλ‹€. 그리고, λ””μ½”λ”© μž₯치(200)λ₯Ό 톡해 λ””μ½”λ”© 및 좜λ ₯된 볡원 μ˜μƒ μ‹ ν˜ΈλŠ” μž¬μƒ μž₯치λ₯Ό 톡해 μž¬μƒλ  수 μžˆλ‹€.When a bitstream including video / image information is input, the decoding apparatus 200 may reconstruct an image corresponding to a process in which video / image information is processed in the encoding apparatus of FIG. 1. For example, the decoding apparatus 200 may perform decoding using a processing unit applied in the encoding apparatus. Thus the processing unit of decoding may be a coding unit, for example, which may be split along a quad tree structure and / or a binary tree structure from a coding tree unit or a maximum coding unit. The reconstructed video signal decoded and output through the decoding apparatus 200 may be reproduced through the reproducing apparatus.

λ””μ½”λ”© μž₯치(200)λŠ” 도 1의 인코딩 μž₯μΉ˜λ‘œλΆ€ν„° 좜λ ₯된 μ‹ ν˜Έλ₯Ό λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ μˆ˜μ‹ ν•  수 있고, μˆ˜μ‹ λœ μ‹ ν˜ΈλŠ” μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)λ₯Ό 톡해 디코딩될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)λŠ” 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ„ νŒŒμ‹±ν•˜μ—¬ μ˜μƒ 볡원(λ˜λŠ” ν”½μ²˜ 볡원)에 ν•„μš”ν•œ 정보(ex. λΉ„λ””μ˜€/μ˜μƒ 정보)λ₯Ό λ„μΆœν•  수 μžˆλ‹€. μ˜ˆμ»¨λŒ€, μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)λŠ” μ§€μˆ˜ 골둬 λΆ€ν˜Έν™”, CAVLC λ˜λŠ” CABAC λ“±μ˜ μ½”λ”© 방법을 기초둜 λΉ„νŠΈμŠ€νŠΈλ¦Ό λ‚΄ 정보λ₯Ό λ””μ½”λ”©ν•˜κ³ , μ˜μƒ 볡원에 ν•„μš”ν•œ μ‹ νƒμŠ€ μ—˜λ¦¬λ¨ΌνŠΈμ˜ κ°’, λ ˆμ§€λ“€μ–Όμ— κ΄€ν•œ λ³€ν™˜ κ³„μˆ˜μ˜ μ–‘μžν™”λœ κ°’ 듀을 좜λ ₯ν•  수 μžˆλ‹€. 보닀 μƒμ„Έν•˜κ²Œ, CABAC μ—”νŠΈλ‘œν”Ό λ””μ½”λ”© 방법은, λΉ„νŠΈμŠ€νŠΈλ¦Όμ—μ„œ 각 ꡬ문 μš”μ†Œμ— ν•΄λ‹Ήν•˜λŠ” λΉˆμ„ μˆ˜μ‹ ν•˜κ³ , λ””μ½”λ”© λŒ€μƒ ꡬ문 μš”μ†Œ 정보와 μ£Όλ³€ 및 λ””μ½”λ”© λŒ€μƒ λΈ”λ‘μ˜ λ””μ½”λ”© 정보 ν˜Ήμ€ 이전 λ‹¨κ³„μ—μ„œ λ””μ½”λ”©λœ 심볼/빈의 정보λ₯Ό μ΄μš©ν•˜μ—¬ λ¬Έλ§₯(context) λͺ¨λΈμ„ κ²°μ •ν•˜κ³ , κ²°μ •λœ λ¬Έλ§₯ λͺ¨λΈμ— 따라 빈(bin)의 λ°œμƒ ν™•λ₯ μ„ μ˜ˆμΈ‘ν•˜μ—¬ 빈의 μ‚°μˆ  λ””μ½”λ”©(arithmetic decoding)λ₯Ό μˆ˜ν–‰ν•˜μ—¬ 각 ꡬ문 μš”μ†Œμ˜ 값에 ν•΄λ‹Ήν•˜λŠ” 심볼을 생성할 수 μžˆλ‹€. μ΄λ•Œ, CABAC μ—”νŠΈλ‘œν”Ό λ””μ½”λ”© 방법은 λ¬Έλ§₯ λͺ¨λΈ κ²°μ • ν›„ λ‹€μŒ 심볼/빈의 λ¬Έλ§₯ λͺ¨λΈμ„ μœ„ν•΄ λ””μ½”λ”©λœ 심볼/빈의 정보λ₯Ό μ΄μš©ν•˜μ—¬ λ¬Έλ§₯ λͺ¨λΈμ„ μ—…λ°μ΄νŠΈν•  수 μžˆλ‹€. μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(2110)μ—μ„œ λ””μ½”λ”©λœ 정보 쀑 μ˜ˆμΈ‘μ— κ΄€ν•œ μ •λ³΄λŠ” μ˜ˆμΈ‘λΆ€(인터 μ˜ˆμΈ‘λΆ€(260) 및 인트라 μ˜ˆμΈ‘λΆ€(265))둜 제곡되고, μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)μ—μ„œ μ—”νŠΈλ‘œν”Ό 디코딩이 μˆ˜ν–‰λœ λ ˆμ§€λ“€μ–Ό κ°’, 즉 μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€ 및 κ΄€λ ¨ νŒŒλΌλ―Έν„° μ •λ³΄λŠ” μ—­μ–‘μžν™”λΆ€(220)둜 μž…λ ₯될 수 μžˆλ‹€. λ˜ν•œ, μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)μ—μ„œ λ””μ½”λ”©λœ 정보 쀑 필터링에 κ΄€ν•œ μ •λ³΄λŠ” 필터링뢀(240)으둜 제곡될 수 μžˆλ‹€. ν•œνŽΈ, 인코딩 μž₯μΉ˜λ‘œλΆ€ν„° 좜λ ₯된 μ‹ ν˜Έλ₯Ό μˆ˜μ‹ ν•˜λŠ” μˆ˜μ‹ λΆ€(λ―Έλ„μ‹œ)κ°€ λ””μ½”λ”© μž₯치(200)의 λ‚΄/μ™ΈλΆ€ μ—˜λ¦¬λ¨ΌνŠΈλ‘œμ„œ 더 ꡬ성될 수 있고, λ˜λŠ” μˆ˜μ‹ λΆ€λŠ” μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)의 κ΅¬μ„±μš”μ†ŒμΌ μˆ˜λ„ μžˆλ‹€. The decoding apparatus 200 may receive a signal output from the encoding apparatus of FIG. 1 in the form of a bitstream, and the received signal may be decoded through the entropy decoding unit 210. For example, the entropy decoding unit 210 may parse the bitstream to derive information (eg, video / image information) necessary for image reconstruction (or picture reconstruction). For example, the entropy decoding unit 210 decodes information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, quantized values of syntax elements required for image reconstruction, and transform coefficients for residuals. Can be output. More specifically, the CABAC entropy decoding method receives a bin corresponding to each syntax element in a bitstream, and decodes syntax element information and decoding information of neighboring and decoding target blocks or information of symbols / bins decoded in a previous step. The context model may be determined using the context model, the probability of occurrence of a bin may be predicted according to the determined context model, and arithmetic decoding of the bin may be performed to generate a symbol corresponding to the value of each syntax element. have. In this case, the CABAC entropy decoding method may update the context model by using the information of the decoded symbol / bin for the context model of the next symbol / bean after determining the context model. The information related to the prediction among the information decoded by the entropy decoding unit 2110 is provided to the prediction unit (the inter prediction unit 260 and the intra prediction unit 265), and the entropy decoding performed by the entropy decoding unit 210 is performed. Dual values, that is, quantized transform coefficients and related parameter information, may be input to the inverse quantizer 220. In addition, information on filtering among information decoded by the entropy decoding unit 210 may be provided to the filtering unit 240. Meanwhile, a receiver (not shown) that receives a signal output from the encoding apparatus may be further configured as an internal / external element of the decoding apparatus 200, or the receiver may be a component of the entropy decoding unit 210.

μ—­μ–‘μžν™”λΆ€(220)μ—μ„œλŠ” μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ„ μ—­μ–‘μžν™”ν•˜μ—¬ λ³€ν™˜ κ³„μˆ˜λ“€μ„ 좜λ ₯ν•  수 μžˆλ‹€. μ—­μ–‘μžν™”λΆ€(220)λŠ” μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ„ 2μ°¨μ›μ˜ 블둝 ν˜•νƒœλ‘œ μž¬μ •λ ¬ν•  수 μžˆλ‹€. 이 경우 상기 μž¬μ •λ ¬μ€ 인코딩 μž₯μΉ˜μ—μ„œ μˆ˜ν–‰λœ κ³„μˆ˜ μŠ€μΊ” μˆœμ„œλ₯Ό κΈ°λ°˜ν•˜μ—¬ μž¬μ •λ ¬μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. μ—­μ–‘μžν™”λΆ€(220)λŠ” μ–‘μžν™” νŒŒλΌλ―Έν„°(예λ₯Ό λ“€μ–΄ μ–‘μžν™” μŠ€ν… μ‚¬μ΄μ¦ˆ 정보)λ₯Ό μ΄μš©ν•˜μ—¬ μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— λŒ€ν•œ μ—­μ–‘μžν™”λ₯Ό μˆ˜ν–‰ν•˜κ³ , λ³€ν™˜ κ³„μˆ˜λ“€(transform coefficient)λ₯Ό νšλ“ν•  수 μžˆλ‹€. The inverse quantization unit 220 may dequantize the quantized transform coefficients and output the transform coefficients. The inverse quantization unit 220 may rearrange the quantized transform coefficients in the form of a two-dimensional block. In this case, the reordering may be performed based on the coefficient scan order performed by the encoding apparatus. The inverse quantization unit 220 may perform inverse quantization on quantized transform coefficients using a quantization parameter (for example, quantization step size information), and may obtain transform coefficients.

μ—­λ³€ν™˜λΆ€(230)μ—μ„œλŠ” λ³€ν™˜ κ³„μˆ˜λ“€λ₯Ό μ—­λ³€ν™˜ν•˜μ—¬ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έ(λ ˆμ§€λ“€μ–Ό 블둝, λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œ μ–΄λ ˆμ΄)λ₯Ό νšλ“ν•˜κ²Œ λœλ‹€. The inverse transformer 230 inversely transforms the transform coefficients to obtain a residual signal (residual block, residual sample array).

μ˜ˆμΈ‘λΆ€λŠ” ν˜„μž¬ 블둝에 λŒ€ν•œ μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜κ³ , 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 예츑 μƒ˜ν”Œλ“€μ„ ν¬ν•¨ν•˜λŠ” 예츑된 블둝(predicted block)을 생성할 수 μžˆλ‹€. μ˜ˆμΈ‘λΆ€λŠ” μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)λ‘œλΆ€ν„° 좜λ ₯된 상기 μ˜ˆμΈ‘μ— κ΄€ν•œ 정보λ₯Ό 기반으둜 상기 ν˜„μž¬ 블둝에 인트라 예츑이 μ μš©λ˜λŠ”μ§€ λ˜λŠ” 인터 예츑이 μ μš©λ˜λŠ”μ§€ κ²°μ •ν•  수 있고, ꡬ체적인 인트라/인터 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•  수 μžˆλ‹€. 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 about the prediction output from the entropy decoding unit 210, and may determine a specific intra / inter prediction mode.

인트라 μ˜ˆμΈ‘λΆ€(265)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄μ˜ μƒ˜ν”Œλ“€μ„ μ°Έμ‘°ν•˜μ—¬ ν˜„μž¬ 블둝을 μ˜ˆμΈ‘ν•  수 μžˆλ‹€. 상기 μ°Έμ‘°λ˜λŠ” μƒ˜ν”Œλ“€μ€ 예츑 λͺ¨λ“œμ— 따라 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€(neighbor)에 μœ„μΉ˜ν•  수 있고, λ˜λŠ” λ–¨μ–΄μ Έμ„œ μœ„μΉ˜ν•  μˆ˜λ„ μžˆλ‹€. 인트라 μ˜ˆμΈ‘μ—μ„œ 예츑 λͺ¨λ“œλ“€μ€ 볡수의 λΉ„λ°©ν–₯μ„± λͺ¨λ“œμ™€ 볡수의 λ°©ν–₯μ„± λͺ¨λ“œλ₯Ό 포함할 수 μžˆλ‹€. 인트라 μ˜ˆμΈ‘λΆ€(265)λŠ” μ£Όλ³€ 블둝에 적용된 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬, ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•  μˆ˜λ„ μžˆλ‹€.The intra predictor 265 may predict the current block by referring to samples in the current picture. The referenced samples may be located in the neighborhood of the current block or may be located apart according to the prediction mode. In intra prediction, prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The intra predictor 265 may determine the prediction mode applied to the current block by using the prediction mode applied to the neighboring block.

인터 μ˜ˆμΈ‘λΆ€(260)λŠ” μ°Έμ‘° ν”½μ²˜ μƒμ—μ„œ μ›€μ§μž„ 벑터에 μ˜ν•΄ νŠΉμ •λ˜λŠ” μ°Έμ‘° 블둝(μ°Έμ‘° μƒ˜ν”Œ μ–΄λ ˆμ΄)을 기반으둜, ν˜„μž¬ 블둝에 λŒ€ν•œ 예츑된 블둝을 μœ λ„ν•  수 μžˆλ‹€. μ΄λ•Œ, 인터 예츑 λͺ¨λ“œμ—μ„œ μ „μ†‘λ˜λŠ” μ›€μ§μž„ μ •λ³΄μ˜ 양을 쀄이기 μœ„ν•΄ μ£Όλ³€ 블둝과 ν˜„μž¬ 블둝 κ°„μ˜ μ›€μ§μž„ μ •λ³΄μ˜ 상관성에 κΈ°μ΄ˆν•˜μ—¬ μ›€μ§μž„ 정보λ₯Ό 블둝, μ„œλΈŒλΈ”λ‘ λ˜λŠ” μƒ˜ν”Œ λ‹¨μœ„λ‘œ μ˜ˆμΈ‘ν•  수 μžˆλ‹€. 상기 μ›€μ§μž„ μ •λ³΄λŠ” μ›€μ§μž„ 벑터 및 μ°Έμ‘° ν”½μ²˜ 인덱슀λ₯Ό 포함할 수 μžˆλ‹€. 상기 μ›€μ§μž„ μ •λ³΄λŠ” 인터 예츑 λ°©ν–₯(L0 예츑, L1 예츑, Bi 예츑 λ“±) 정보λ₯Ό 더 포함할 수 μžˆλ‹€. 인터 예츑의 κ²½μš°μ—, μ£Όλ³€ 블둝은 ν˜„μž¬ ν”½μ²˜ 내에 μ‘΄μž¬ν•˜λŠ” 곡간적 μ£Όλ³€ 블둝(spatial neighboring block)κ³Ό μ°Έμ‘° ν”½μ²˜μ— μ‘΄μž¬ν•˜λŠ” μ‹œκ°„μ  μ£Όλ³€ 블둝(temporal neighboring block)을 포함할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 인터 μ˜ˆμΈ‘λΆ€(260)λŠ” μ£Όλ³€ 블둝듀을 기반으둜 μ›€μ§μž„ 정보 후보 리슀트λ₯Ό κ΅¬μ„±ν•˜κ³ , μˆ˜μ‹ ν•œ 후보 선택 정보λ₯Ό 기반으둜 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ›€μ§μž„ 벑터 및/λ˜λŠ” μ°Έμ‘° ν”½μ²˜ 인덱슀λ₯Ό λ„μΆœν•  수 μžˆλ‹€. λ‹€μ–‘ν•œ 예츑 λͺ¨λ“œλ₯Ό 기반으둜 인터 예츑이 μˆ˜ν–‰λ  수 있으며, 상기 μ˜ˆμΈ‘μ— κ΄€ν•œ μ •λ³΄λŠ” 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 인터 예츑의 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 정보λ₯Ό 포함할 수 μžˆλ‹€. The inter prediction unit 260 may derive the predicted block for the current block based on the reference block (reference sample array) specified by the motion vector on the 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 the correlation of the 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 existing in the current picture and a temporal neighboring block present in the reference picture. For example, the inter prediction unit 260 may construct a motion information candidate list based on neighboring blocks and derive a motion vector and / or a reference picture index of the current block based on the received candidate selection information. Inter prediction may be performed based on various prediction modes, and the information about the prediction may include information indicating a mode of inter prediction for the current block.

κ°€μ‚°λΆ€(235)λŠ” νšλ“λœ λ ˆμ§€λ“€μ–Ό μ‹ ν˜Έλ₯Ό 인터 μ˜ˆμΈ‘λΆ€(260) λ˜λŠ” 인트라 μ˜ˆμΈ‘λΆ€(265)λ‘œλΆ€ν„° 좜λ ₯된 예츑 μ‹ ν˜Έ(예츑된 블둝, 예츑 μƒ˜ν”Œ μ–΄λ ˆμ΄)에 λ”ν•¨μœΌλ‘œμ¨ 볡원 μ‹ ν˜Έ(볡원 ν”½μ²˜, 볡원 블둝, 볡원 μƒ˜ν”Œ μ–΄λ ˆμ΄)λ₯Ό 생성할 수 μžˆλ‹€. μŠ€ν‚΅ λͺ¨λ“œκ°€ 적용된 κ²½μš°μ™€ 같이 처리 λŒ€μƒ 블둝에 λŒ€ν•œ λ ˆμ§€λ“€μ–Όμ΄ μ—†λŠ” 경우, 예츑된 블둝이 볡원 λΈ”λ‘μœΌλ‘œ μ‚¬μš©λ  수 μžˆλ‹€.The adder 235 adds the obtained residual signal to the predictive signal (predicted block, predictive sample array) output from the inter predictor 260 or the intra predictor 265 to restore the reconstructed signal (reconstructed picture, reconstructed block). , Restore sample array). 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.

κ°€μ‚°λΆ€(235)λŠ” 볡원뢀 λ˜λŠ” 볡원 블둝 생성뢀라고 뢈릴 수 μžˆλ‹€. μƒμ„±λœ 볡원 μ‹ ν˜ΈλŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ λ‹€μŒ 처리 λŒ€μƒ λΈ”λ‘μ˜ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•˜μ—¬ μ‚¬μš©λ  수 있고, ν›„μˆ ν•˜λŠ” 바와 같이 필터링을 κ±°μ³μ„œ λ‹€μŒ ν”½μ²˜μ˜ 인터 μ˜ˆμΈ‘μ„ μœ„ν•˜μ—¬ μ‚¬μš©λ  μˆ˜λ„ μžˆλ‹€. The adder 235 may be called a restoration unit or a restoration block generation unit. The generated reconstruction signal may be used for intra prediction of a next processing target block in a current picture, and may be used for inter prediction of a next picture through filtering as described below.

필터링뢀(240)λŠ” 볡원 μ‹ ν˜Έμ— 필터링을 μ μš©ν•˜μ—¬ 주관적/객관적 ν™”μ§ˆμ„ ν–₯μƒμ‹œν‚¬ 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄ 필터링뢀(240)λŠ” 볡원 ν”½μ²˜μ— λ‹€μ–‘ν•œ 필터링 방법을 μ μš©ν•˜μ—¬ μˆ˜μ •λœ(modified) 볡원 ν”½μ²˜λ₯Ό 생성할 수 있고, 상기 μˆ˜μ •λœ 볡원 ν”½μ²˜λ₯Ό λ©”λͺ¨λ¦¬(250), ꡬ체적으둜 λ©”λͺ¨λ¦¬(250)의 DPB에 전솑할 수 μžˆλ‹€. 상기 λ‹€μ–‘ν•œ 필터링 방법은 예λ₯Ό λ“€μ–΄, 디블둝킹 필터링, μƒ˜ν”Œ 적응적 μ˜€ν”„μ…‹(sample adaptive offset), 적응적 루프 ν•„ν„°(adaptive loop filter), μ–‘λ°©ν–₯ ν•„ν„°(bilateral filter) 등을 포함할 수 μžˆλ‹€. The filtering unit 240 may improve subjective / objective image quality by applying filtering to the reconstruction signal. For example, the filtering unit 240 may generate a modified reconstructed picture by applying various filtering methods to the reconstructed picture, and the modified reconstructed picture may be stored in the memory 250, specifically, the DPB of the memory 250. Can be sent to. The various filtering methods may include, for example, deblocking filtering, a sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like.

λ©”λͺ¨λ¦¬(250)의 DPB에 μ €μž₯된 (μˆ˜μ •λœ) 볡원 ν”½μ²˜λŠ” 인터 μ˜ˆμΈ‘λΆ€(260)μ—μ„œ μ°Έμ‘° ν”½μ³λ‘œ μ‚¬μš©λ  수 μžˆλ‹€. λ©”λͺ¨λ¦¬(250)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ μ›€μ§μž„ 정보가 λ„μΆœλœ(λ˜λŠ” λ””μ½”λ”©λœ) λΈ”λ‘μ˜ μ›€μ§μž„ 정보 및/λ˜λŠ” 이미 λ³΅μ›λœ ν”½μ²˜ λ‚΄ λΈ”λ‘λ“€μ˜ μ›€μ§μž„ 정보λ₯Ό μ €μž₯ν•  수 μžˆλ‹€. 상기 μ €μž₯된 μ›€μ§μž„ μ •λ³΄λŠ” 곡간적 μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ 정보 λ˜λŠ” μ‹œκ°„μ  μ£Όλ³€ λΈ”λ‘μ˜ μ›€μ§μž„ μ •λ³΄λ‘œ ν™œμš©ν•˜κΈ° μœ„ν•˜μ—¬ 인터 μ˜ˆμΈ‘λΆ€(260)에 전달할 수 μžˆλ‹€. λ©”λͺ¨λ¦¬(170)λŠ” ν˜„μž¬ ν”½μ²˜ λ‚΄ λ³΅μ›λœ λΈ”λ‘λ“€μ˜ 볡원 μƒ˜ν”Œλ“€μ„ μ €μž₯ν•  수 있고, 인트라 μ˜ˆμΈ‘λΆ€(265)에 전달할 수 μžˆλ‹€.The (modified) reconstructed picture stored in the DPB of the memory 250 may be used as the reference picture in the inter predictor 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 are already reconstructed. The stored motion information may be transmitted to the inter predictor 260 to use 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 transfer the reconstructed samples to the intra predictor 265.

λ³Έ λͺ…μ„Έμ„œμ—μ„œ, 인코딩 μž₯치(100)의 필터링뢀(160), 인터 μ˜ˆμΈ‘λΆ€(180) 및 인트라 μ˜ˆμΈ‘λΆ€(185)μ—μ„œ μ„€λͺ…λœ μ‹€μ‹œμ˜ˆλ“€μ€ 각각 λ””μ½”λ”© μž₯치(200)의 필터링뢀(240), 인터 μ˜ˆμΈ‘λΆ€(260) 및 인트라 μ˜ˆμΈ‘λΆ€(265)에도 동일 λ˜λŠ” λŒ€μ‘λ˜λ„λ‘ 적용될 수 μžˆλ‹€.In the present specification, the embodiments described by the filtering unit 160, the inter prediction unit 180, and the intra prediction unit 185 of the encoding apparatus 100 are respectively the filtering unit 240 and the inter prediction of the decoding apparatus 200. The same may also apply to the unit 260 and the intra predictor 265.

Block PartitioningBlock Partitioning

λ³Έ λ¬Έμ„œμ— λ”°λ₯Έ λΉ„λ””μ˜€/μ˜μƒ μ½”λ”© 방법은 λ‹€μ–‘ν•œ μ„ΈλΆ€ κΈ°μˆ λ“€μ— κΈ°λ°˜ν•˜μ—¬ μˆ˜ν–‰λ  수 있으며, 각각의 μ„ΈλΆ€ κΈ°μˆ λ“€μ„ 개랡적으둜 μ„€λͺ…ν•˜λ©΄ λ‹€μŒκ³Ό κ°™λ‹€. μ΄ν•˜ μ„€λͺ…λ˜λŠ” κΈ°μˆ λ“€μ€ μƒμˆ ν•œ 및/λ˜λŠ” ν›„μˆ λ˜λŠ” λΉ„λ””μ˜€/μ˜μƒ 인코딩/λ””μ½”λ”© μ ˆμ°¨μ—μ„œμ˜ 예츑, λ ˆμ§€λ“€μ–Ό 처리((μ—­)λ³€ν™˜, (μ—­)μ–‘μžν™” λ“±), μ‹ ν…μŠ€ μš”μ†Œ μ½”λ”©, 필터링, νŒŒν‹°μ…”λ‹/λΆ„ν•  λ“±μ˜ κ΄€λ ¨ μ ˆμ°¨μ— 연관될 수 μžˆμŒμ€ λ‹Ήμ—…μžμ—κ²Œ 자λͺ…ν•˜λ‹€.The video / image coding method according to this document may be performed based on various detailed techniques, and each detailed technique will be described as follows. Techniques described below include prediction, residual processing ((inverse) transformation, (inverse) quantization, etc.), syntax element coding, filtering, partitioning / division, etc. in the video / image encoding / decoding procedures described above and / or described below. It will be apparent to those skilled in the art that they may be involved in related procedures.

λ³Έ λ¬Έμ„œμ— λ”°λ₯Έ 블둝 νŒŒν‹°μ…”λ‹ μ ˆμ°¨λŠ” μƒμˆ ν•œ 인코딩 μž₯치의 μ˜μƒ λΆ„ν• λΆ€(110)μ—μ„œ μˆ˜ν–‰λ˜μ–΄, νŒŒν‹°μ…”λ‹ κ΄€λ ¨ 정보가 μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)μ—μ„œ (인코딩) μ²˜λ¦¬λ˜μ–΄ λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ λ””μ½”λ”© μž₯치둜 전달될 수 μžˆλ‹€. λ””μ½”λ”© μž₯치의 μ—”νŠΈλ‘œν”Ό λ””μ½”λ”©λΆ€(210)λŠ” 상기 λΉ„νŠΈμŠ€νŠΈλ¦ΌμœΌλ‘œλΆ€ν„° νšλ“ν•œ 상기 νŒŒν‹°μ…”λ‹ κ΄€λ ¨ 정보λ₯Ό 기반으둜 ν˜„μž¬ ν”½μ²˜μ˜ 블둝 νŒŒν‹°μ…”λ‹ ꡬ쑰λ₯Ό λ„μΆœν•˜κ³ , 이λ₯Ό 기반으둜 μ˜μƒ 디코딩을 μœ„ν•œ 일련의 절차(ex. 예츑, λ ˆμ§€λ“€μ–Ό 처리, 블둝 볡원, 인루프 필터링 λ“±)을 μˆ˜ν–‰ν•  수 μžˆλ‹€.The block partitioning procedure according to this document may be performed by the image splitter 110 of the encoding apparatus described above, and the partitioning related information may be processed (encoded) by the entropy encoding unit 190 and transmitted to the decoding apparatus in the form of a bitstream. . The entropy decoding unit 210 of the decoding apparatus derives a block partitioning structure of the current picture based on the partitioning related information obtained from the bitstream, and based on this, a series of procedures (eg, prediction and residual) for image decoding. Processing, block reconstruction, in-loop filtering, etc.).

Partitioning of picture into CTUsPartitioning of picture into CTUs

ν”½μ²˜λ“€μ€ μ½”λ”© 트리 μœ λ‹›λ“€ (CTUs)의 μ‹œν€€μŠ€λ‘œ 뢄할될(divided into a sequence) 수 μžˆλ‹€. CTUλŠ” μ½”λ”© 트리 블둝(CTB)에 λŒ€μ‘λ  수 μžˆλ‹€. ν˜Ήμ€ CTUλŠ” 루마 μƒ˜ν”Œλ“€μ˜ μ½”λ”© 트리 블둝과, λŒ€μ‘ν•˜λŠ” 크둜마 μƒ˜ν”Œλ“€μ˜ λ‘κ°œμ˜ μ½”λ”© 트리 블둝듀을 포함할 수 μžˆλ‹€. λ‹€μ‹œ λ§ν•˜λ©΄, μ„Έκ°€μ§€ μƒ˜ν”Œ μ–΄λ ˆμ΄λ₯Ό ν¬ν•¨ν•˜λŠ” ν”½μ²˜μ— λŒ€ν•˜μ—¬, CTUλŠ” 루마 μƒ˜ν”Œλ“€μ˜ NxN 블둝과 크둜마 μƒ˜ν”Œλ“€μ˜ λ‘κ°œμ˜ λŒ€μ‘ 블둝듀을 포함할 수 μžˆλ‹€.Pictures can be divided into a sequence of coding tree units (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. In other words, for a picture that includes three sample arrays, the CTU may include an N Γ— N block of luma samples and two corresponding blocks of chroma samples.

μ½”λ”© 및 예츑 등을 μœ„ν•œ CTU의 μ΅œλŒ€ ν—ˆμš© μ‚¬μ΄μ¦ˆλŠ” λ³€ν™˜μ„ μœ„ν•œ CTU의 μ΅œλŒ€ ν—ˆμš© μ‚¬μ΄μ¦ˆμ™€ λ‹€λ₯Ό 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, CTU λ‚΄ 루마 λΈ”λ‘μ˜ μ΅œλŒ€ ν—ˆμš© μ‚¬μ΄μ¦ˆλŠ” 128x128일 수 μžˆλ‹€.The maximum allowable size of the CTU for coding and prediction may be different from the maximum allowable size of the CTU for transform. For example, the maximum allowable size of the luma block in the CTU may be 128x128.

Partitionig of the CTUs using a tree structurePartitionig of the CTUs using a tree structure

CTUλŠ” μΏΌλ“œνŠΈλ¦¬(quad-tree, QT) ꡬ쑰λ₯Ό 기반으둜 CUλ“€λ‘œ 뢄할될 수 μžˆλ‹€. μΏΌλ“œνŠΈλ¦¬ κ΅¬μ‘°λŠ” μΏΌν„°λ„ˆλ¦¬(quaternary) 트리 ꡬ쑰라고 뢈릴 수 μžˆλ‹€. μ΄λŠ” λ‹€μ–‘ν•œ ꡭ지적 νŠΉμ§•(local characteristic)을 λ°˜μ˜ν•˜κΈ° μœ„ν•¨μ΄λ‹€. ν•œνŽΈ, λ³Έ λ¬Έμ„œμ—μ„œλŠ” CTUλŠ” μΏΌλ“œνŠΈλ¦¬ 뿐 μ•„λ‹ˆλΌ λ°”μ΄λ„ˆλ¦¬ 트리(binary-tree, BT) 및 ν„°λ„ˆλ¦¬ 트리(ternary-tree, TT)을 ν¬ν•¨ν•˜λŠ” λ©€ν‹°νƒ€μž… 트리 ꡬ쑰 뢄할을 κΈ°λ°˜ν•˜μ—¬ 뢄할될 수 μžˆλ‹€. μ΄ν•˜, QTBT ꡬ쑰라 함은 μΏΌλ“œνŠΈλ¦¬ 및 λ°”μ΄λ„ˆλ¦¬ 트리 기반 λΆ„ν•  ꡬ쑰λ₯Ό 포함할 수 있고, QTBTTT라 함은 μΏΌλ“œνŠΈλ¦¬, λ°”μ΄λ„ˆλ¦¬ 트리 및 ν„°λ„ˆλ¦¬ 트리 기반 λΆ„ν•  ꡬ쑰λ₯Ό 포함할 수 μžˆλ‹€. λ˜λŠ”, QTBT κ΅¬μ‘°λŠ” μΏΌλ“œνŠΈλ¦¬, λ°”μ΄λ„ˆλ¦¬ 트리 및 ν„°λ„ˆλ¦¬ 트리 기반 λΆ„ν•  ꡬ쑰λ₯Ό 포함할 μˆ˜λ„ μžˆλ‹€. μ½”λ”© 트리 κ΅¬μ‘°μ—μ„œ, CUλŠ” μ •μ‚¬κ°ν˜• λ˜λŠ” μ§μ‚¬κ°ν˜• λͺ¨μ–‘을 κ°€μ§ˆ 수 μžˆλ‹€. CTUλŠ” λ¨Όμ € μΏΌλ“œνŠΈλ¦¬ ꡬ쑰둜 뢄할될 수 μžˆλ‹€. 이후 μΏΌλ“œνŠΈλ¦¬ ꡬ쑰의 리프 λ…Έλ“œλ“€μ€ λ©€ν‹°νƒ€μž… 트리 ꡬ쑰에 μ˜ν•˜μ—¬ μΆ”κ°€μ μœΌλ‘œ 뢄할될 수 μžˆλ‹€. The CTU may be divided into CUs based on a quad-tree (QT) structure. The quadtree structure may be referred to as a quaternary tree structure. This is to reflect various local characteristics. Meanwhile, in the present document, the CTU may be divided based on a multitype tree structure partition including a binary tree (BT) and a ternary tree (TT) as well as a quad tree. Hereinafter, the QTBT structure may include a quadtree and binary tree based partition structure, and the QTBTTT may include a quadtree, binary tree, and ternary tree based partition structure. Alternatively, the QTBT structure may include a quadtree, binary tree and ternary tree based partitioning structure. In a coding tree structure, a CU may have a square or rectangular shape. The CTU may first be divided into quadtree structures. After that, the leaf nodes of the quadtree structure may be further divided by the multitype tree structure.

도 3은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ©€ν‹°νƒ€μž… 트리 ꡬ쑰의 일 예λ₯Ό λ‚˜νƒ€λ‚΄λŠ” 도면이닀.3 is a diagram illustrating an example of a multi-type tree structure as an embodiment to which the present invention can be applied.

λ³Έ 발λͺ…μ˜ 일 μ‹€μ‹œμ˜ˆμ—μ„œ, λ©€ν‹°νƒ€μž… 트리 κ΅¬μ‘°λŠ” 도 3에 λ„μ‹œλœ 바와 같은 4개의 λΆ„ν•  νƒ€μž…μ„ 포함할 수 μžˆλ‹€. 상기 4개의 λΆ„ν•  νƒ€μž…μ€ 수직 λ°”μ΄λ„ˆλ¦¬ λΆ„ν• (vertical binary splitting, SPLIT_BT_VER), μˆ˜ν‰ λ°”μ΄λ„ˆλ¦¬ λΆ„ν• (horizontal binary splitting, SPLIT_BT_HOR), 수직 ν„°λ„ˆλ¦¬ λΆ„ν• (vertical ternary splitting, SPLIT_TT_VER), μˆ˜ν‰ ν„°λ„ˆλ¦¬ λΆ„ν• (horizontal ternary splitting, SPLIT_TT_HOR)을 포함할 수 μžˆλ‹€. 상기 λ©€ν‹°νƒ€μž… 트리 ꡬ쑰의 리프 λ…Έλ“œλ“€μ€ CU듀이라고 뢈리 수 μžˆλ‹€. μ΄λŸ¬ν•œ CU듀은 예츑 및 λ³€ν™˜ 절차λ₯Ό μœ„ν•˜μ—¬ μ‚¬μš©λ  수 μžˆλ‹€. λ³Έ λ¬Έμ„œμ—μ„œ 일반적으둜 CU, PU, TUλŠ” λ™μΌν•œ 블둝 μ‚¬μ΄μ¦ˆλ₯Ό κ°€μ§ˆ 수 μžˆλ‹€. λ‹€λ§Œ, μ΅œλŒ€ ν—ˆμš© λ³€ν™˜ 길이(maximum supported transform length )κ°€ CU의 컬러 μ„±λΆ„(colour component)의 λ„ˆλΉ„ λ„λŠ” 높이보닀 μž‘μ€ κ²½μš°μ—λŠ” CU와 TUκ°€ μ„œλ‘œ λ‹€λ₯Έ 블둝 μ‚¬μ΄μ¦ˆλ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.In one embodiment of the present invention, the multitype tree structure may include four partition types as shown in FIG. The four types of split include vertical binary splitting (SPLIT_BT_VER), horizontal binary splitting (SPLIT_BT_HOR), vertical ternary splitting (SPLIT_TT_VER), and horizontal ternary splitting (SPLIT_TT_HOR). ) May be included. Leaf nodes of the multitype tree structure may be called CUs. These CUs can be used for prediction and transform procedures. In general, CU, PU, and TU may have the same block size in this document. However, when the maximum supported transform length is smaller than the width or height of the color component of the CU, the CU and the TU may have different block sizes.

도 4λŠ” λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•˜λŠ” μΏΌλ“œνŠΈλ¦¬(quadtree with nested multi-type tree) ꡬ쑰의 νŒŒν‹°μ…˜ λΆ„ν•  μ •λ³΄μ˜ μ‹œκ·Έλ„λ§ λ©”μ»€λ‹ˆμ¦˜μ„ μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 4 is a diagram illustrating a signaling mechanism of partition partition information of a quadtree with nested multi-type tree structure according to an embodiment to which the present invention may be applied.

μ—¬κΈ°μ„œ, CTUλŠ” μΏΌλ“œνŠΈλ¦¬μ˜ 루트(root)둜 μ·¨κΈ‰λ˜λ©°, μΏΌλ“œνŠΈλ¦¬ ꡬ쑰둜 처음으둜 νŒŒν‹°μ…”λ‹λœλ‹€. 각 μΏΌλ“œνŠΈλ¦¬ 리프 λ…Έλ“œλŠ” 이후 λ©€ν‹°νƒ€μž… 트리 ꡬ쑰둜 더 νŒŒν‹°μ…”λ‹λ  수 μžˆλ‹€. λ©€ν‹°νƒ€μž… 트리 κ΅¬μ‘°μ—μ„œ, 제1 ν”Œλž˜κ·Έ(a first flag, ex. mtt_split_cu_flag)κ°€ ν•΄λ‹Ή λ…Έλ“œκ°€ μΆ”κ°€μ μœΌλ‘œ νŒŒν‹°μ…”λ‹λ˜λŠ”μ§€λ₯Ό μ§€μ‹œν•˜κΈ° μœ„ν•˜μ—¬ μ‹œκ·Έλ„λ§λœλ‹€. λ§Œμ•½ ν•΄λ‹Ή λ…Έλ“œκ°€ μΆ”κ°€μ μœΌλ‘œ νŒŒν‹°μ…”λ‹λ˜λŠ” 경우, 제2 ν”Œλž˜κ·Έ(a second flag, ex. mtt_split_cu_verticla_flag)κ°€ λΆ„ν•  λ°©ν–₯(splitting direction)을 μ§€μ‹œν•˜κΈ° μœ„ν•˜μ—¬ μ‹œκ·Έλ„λ§λ  수 μžˆλ‹€. κ·Έ ν›„ 제3 ν”Œλž˜κ·Έ(a third flag, ex. mtt_split_cu_binary_flag)κ°€ λΆ„ν•  νƒ€μž…μ΄ λ°”μ΄λ„ˆλ¦¬ 뢄할인지 ν„°λ„ˆλ¦¬ 뢄할인지 μ—¬λΆ€λ₯Ό μ§€μ‹œν•˜κΈ° μœ„ν•˜μ—¬ μ‹œκ·Έλ„λ§λ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 상기 mtt_split_cu_vertical_flag 및 상기 mtt_split_cu_binary_flagλ₯Ό 기반으둜, CU의 λ©€ν‹°νƒ€μž… 트리 λΆ„ν•  λͺ¨λ“œ(multi-type tree splitting mode, MttSplitMode)κ°€ λ‹€μŒ ν‘œ 1κ³Ό 같이 λ„μΆœλ  수 μžˆλ‹€.Here, the CTU is treated as the root of the quadtree, and is partitioned for the first time into a quadtree structure. Each quadtree leaf node may then be further partitioned into a multitype tree structure. In the multitype tree structure, a first flag (ex. Mtt_split_cu_flag) is signaled to indicate whether the node is additionally partitioned. If the node is additionally partitioned, a second flag (ex. Mtt_split_cu_verticla_flag) may be signaled to indicate the splitting direction. Thereafter, a third flag (ex. Mtt_split_cu_binary_flag) may be signaled to indicate whether the partition type is binary partition or ternary partition. For example, 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.

Figure PCTKR2019004390-appb-img-000001
Figure PCTKR2019004390-appb-img-000001

도 5λŠ” λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, μΏΌλ“œνŠΈλ¦¬ 및 μˆ˜λ°˜λ˜λŠ” λ©€ν‹°νƒ€μž… 트리(quadtree and nested multi-type tree) ꡬ쑰λ₯Ό 기반으둜 CTUλ₯Ό 닀쀑 CUλ“€λ‘œ λΆ„ν• ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 5 is a diagram illustrating a method of dividing a CTU into multiple CUs based on a quadtree and accompanying multi-type tree structure as an embodiment to which the present invention may be applied.

μ—¬κΈ°μ„œ, λ³Όλ“œ 블둝 μ—£μ§€λ“€(bold block edges)λŠ” μΏΌλ“œνŠΈλ¦¬ νŒŒν‹°μ…”λ‹μ„, λ‚˜λ¨Έμ§€ 엣지듀은 λ©€ν‹°νƒ€μž… 트리 νŒŒν‹°μ…”λ‹μ„ λ‚˜νƒ€λ‚Έλ‹€. λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•œ μΏΌλ“œνŠΈλ¦¬ νŒŒν‹°μ…˜μ€ 컨텐츠-μ–΄λŒ‘ν‹°λ“œ μ½”λ”© 트리 ꡬ쑰λ₯Ό μ œκ³΅ν•  수 μžˆλ‹€. CUλŠ” μ½”λ”© 블둝(CB)에 λŒ€μ‘λ  수 μžˆλ‹€. ν˜Ήμ€ CUλŠ” 루마 μƒ˜ν”Œλ“€μ˜ μ½”λ”© 블둝과, λŒ€μ‘ν•˜λŠ” 크둜마 μƒ˜ν”Œλ“€μ˜ λ‘κ°œμ˜ μ½”λ”© 블둝듀을 포함할 수 μžˆλ‹€. CU의 μ‚¬μ΄μ¦ˆλŠ” CTU만큼 클 μˆ˜λ„ 있고, λ˜λŠ” 루마 μƒ˜ν”Œ λ‹¨μœ„μ—μ„œ 4x4 만큼 μž˜μ„ μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 4:2:0 컬러 포멧(or 크둜마 포멧)인 경우, μ΅œλŒ€ 크둜마 CB μ‚¬μ΄μ¦ˆλŠ” 64x64이고 μ΅œμ†Œ 크둜마 CB μ‚¬μ΄μ¦ˆλŠ” 2x2일 수 μžˆλ‹€.Here, bold block edges represent quadtree partitioning and the remaining edges represent multitype tree partitioning. Quadtree partitions involving a multitype tree can provide a content-adapted coding tree structure. The CU may correspond to a coding block (CB). Alternatively, the CU may include a coding block of luma samples and two coding blocks of corresponding chroma samples. The size of a CU may be as large as CTU, or may be cut by 4 Γ— 4 in luma sample units. For example, in the 4: 2: 0 color format (or chroma format), the maximum chroma CB size may be 64x64 and the minimum chroma CB size may be 2x2.

λ³Έ λ¬Έμ„œμ—μ„œ 예λ₯Ό λ“€μ–΄, μ΅œλŒ€ ν—ˆμš© 루마 TB μ‚¬μ΄μ¦ˆλŠ” 64x64이고, μ΅œλŒ€ ν—ˆμš© 크둜마 TB μ‚¬μ΄μ¦ˆλŠ” 32x32일 수 μžˆλ‹€. λ§Œμ•½ 상기 트리 ꡬ쑰에 따라 λΆ„ν• λœ CB의 λ„ˆλΉ„ λ˜λŠ” 높이가 μ΅œλŒ€ λ³€ν™˜ λ„ˆλΉ„ λ˜λŠ” 높이보닀 큰 경우, ν•΄λ‹Ή CBλŠ” μžλ™μ μœΌλ‘œ(λ˜λŠ” λ¬΅μ‹œμ μœΌλ‘œ) μˆ˜ν‰ 및 수직 λ°©ν–₯의 TB μ‚¬μ΄μ¦ˆ μ œν•œμ„ λ§Œμ‘±ν•  λ•ŒκΉŒμ§€ 뢄할될 수 μžˆλ‹€. For example, in this document, the maximum allowable luma TB size may be 64x64 and the maximum allowable chroma TB size may be 32x32. If the width or height of the CB divided according to the tree structure is larger than the maximum transform width or height, the CB may be automatically (or implicitly) split until the TB size limit in the horizontal and vertical directions is satisfied.

ν•œνŽΈ, λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•œ μΏΌλ“œνŠΈλ¦¬ μ½”λ”© 트리 μŠ€ν‚΄μ„ μœ„ν•˜μ—¬, λ‹€μŒ νŒŒλΌλ―Έν„°λ“€μ΄ SPS μ‹ ν…μŠ€ μš”μ†Œλ‘œ μ •μ˜ 및 식별될 수 μžˆλ‹€.Meanwhile, for a quadtree coding tree scheme involving a multitype tree, the following parameters may be defined and identified as SPS syntax elements.

- CTU size: the root node size of a quaternary treeCTU size: the root node size of a quaternary tree

- MinQTSize: the minimum allowed quaternary tree leaf node sizeMinQTSize: the minimum allowed quaternary tree leaf node size

- MaxBtSize: the maximum allowed binary tree root node sizeMaxBtSize: the maximum allowed binary tree root node size

- MaxTtSize: the maximum allowed ternary tree root node sizeMaxTtSize: the maximum allowed ternary tree root node size

- MaxMttDepth: the maximum allowed hierarchy depth of multi-type tree splitting from a quadtree leafMaxMttDepth: the maximum allowed hierarchy depth of multi-type tree splitting from a quadtree leaf

- MinBtSize: the minimum allowed binary tree leaf node sizeMinBtSize: the minimum allowed binary tree leaf node size

- MinTtSize: the minimum allowed ternary tree leaf node sizeMinTtSize: the minimum allowed ternary tree leaf node size

λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•œ μΏΌλ“œνŠΈλ¦¬ μ½”λ”© 트리 ꡬ쑰의 일 예둜, CTU μ‚¬μ΄μ¦ˆλŠ” 128x128 루마 μƒ˜ν”Œλ“€ 및 λ‘κ°œμ˜ λŒ€μ‘ν•˜λŠ” 크둜마 μƒ˜ν”Œλ“€μ˜ 64x64 λΈ”λ‘λ“€λ‘œ 섀정될 수 μžˆλ‹€(4:2:0 크둜마 ν¬λ©§μ—μ„œ). 이 경우, MinOTSizeλŠ” 16x16으둜 μ„€μ •λ˜κ³ , MaxBtSizeλŠ” 128x128둜 μ„€μ •λ˜κ³ , MaxTtSzieλŠ” 64x64둜 μ„€μ •λ˜κ³ , MinBtSize 및 MinTtSize (for both width and height)λŠ” 4x4둜, 그리고 MaxMttDepthλŠ” 4둜 섀정될 수 μžˆλ‹€. 쿼트트리 νŒŒν‹°μ…”λ‹μ€ CTU에 μ μš©λ˜μ–΄ μΏΌλ“œνŠΈλ¦¬ 리프 λ…Έλ“œλ“€μ„ 생성할 수 μžˆλ‹€. μΏΌλ“œνŠΈλ¦¬ 리프 λ…Έλ“œλŠ” 리프 QT λ…Έλ“œλΌκ³  뢈릴 수 μžˆλ‹€. μΏΌλ“œνŠΈλ¦¬ 리프 λ…Έλ“œλ“€μ€ 16x16 μ‚¬μ΄μ¦ˆ (i.e. the MinOTSize)λ‘œλΆ€ν„° 128x128 μ‚¬μ΄μ¦ˆ(i.e. the CTU size)λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€. λ§Œμ•½ 리프 QT λ…Έλ“œκ°€ 128x128인 경우, μΆ”κ°€μ μœΌλ‘œ λ°”μ΄λ„ˆλ¦¬ 트리/ν„°λ„ˆλ¦¬ 트리둜 λΆ„ν• λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€. μ΄λŠ” 이 경우 λΆ„ν• λ˜λ”λΌλ„ MaxBtsize 및 MaxTtszie (i.e. 64x64)λ₯Ό μ΄ˆκ³Όν•˜κΈ° λ•Œλ¬Έμ΄λ‹€. 이 μ™Έμ˜ 경우, 리프 QT λ…Έλ“œλŠ” λ©€ν‹°νƒ€μž… 트리둜 μΆ”κ°€μ μœΌλ‘œ 뢄할될 수 μžˆλ‹€. κ·ΈλŸ¬λ―€λ‘œ, 리프 QT λ…Έλ“œλŠ” λ©€ν‹°νƒ€μž… νŠΈλ¦¬μ— λŒ€ν•œ 루트 λ…Έλ“œ(root node)이고, 리프 QT λ…Έλ“œλŠ” λ©€ν‹°νƒ€μž… 트리 뎁슀(mttDepth) 0 값을 κ°€μ§ˆ 수 μžˆλ‹€. λ§Œμ•½, λ©€ν‹°νƒ€μž… 트리 λŽμŠ€κ°€ MaxMttdepth (ex. 4)에 λ„λ‹¬ν•œ 경우, 더 이상 μΆ”κ°€ 뢄할은 κ³ λ €λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€. λ§Œμ•½, λ©€ν‹°νƒ€μž… 트리 λ…Έλ“œμ˜ λ„ˆλΉ„κ°€ MinBtSize와 κ°™κ³ , 2xMinTtSize보닀 μž‘κ±°λ‚˜ 같을 λ•Œ, 더 이상 좔가적인 μˆ˜ν‰ 뢄할은 κ³ λ €λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€. λ§Œμ•½, λ©€ν‹°νƒ€μž… 트리 λ…Έλ“œμ˜ 높이가 MinBtSize와 κ°™κ³ , 2xMinTtSize보닀 μž‘κ±°λ‚˜ 같을 λ•Œ, 더 이상 좔가적인 수직 뢄할은 κ³ λ €λ˜μ§€ μ•Šμ„ 수 μžˆλ‹€.As an example of a quadtree coding tree structure involving a multitype tree, the CTU size may be set to 64x64 blocks of 128x128 luma samples and two corresponding chroma samples (in 4: 2: 0 chroma format). In this case, MinOTSize can be set to 16x16, MaxBtSize to 128x128, MaxTtSzie to 64x64, MinBtSize and MinTtSize (for both width and height) to 4x4, and MaxMttDepth to 4. Quarttree 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 128x128 size (i.e. the CTU size) from a 16x16 size (i.e. the MinOTSize). If the leaf QT node is 128x128, it may not be additionally divided into a binary tree / a ternary tree. This is because in this case, even if split, it exceeds MaxBtsize and MaxTtszie (i.e. 64x64). 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 (ex. 4), further splitting may not be considered further. If the width of the multitype tree node is equal to MinBtSize and less than or equal to 2xMinTtSize, then no further horizontal split may be considered. If the height of the multitype tree node is equal to MinBtSize and less than or equal to 2xMinTtSize, no further vertical split may be considered.

도 6은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, ν„°λ„ˆλ¦¬ 트리(ternary-tree) 뢄할을 μ œν•œν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 6 is a diagram illustrating a method of limiting ternary-tree splitting as an embodiment to which the present invention may be applied.

도 6을 μ°Έμ‘°ν•˜λ©΄, ν•˜λ“œμ›¨μ–΄ λ””μ½”λ”μ—μ„œμ˜ 64x64 루마 블둝 및 32x32 크둜마 νŒŒμ΄ν”„λΌμΈ λ””μžμΈμ„ ν—ˆμš©ν•˜κΈ° μœ„ν•˜μ—¬, TT 뢄할은 νŠΉμ • 경우 μ œν•œλ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 루마 μ½”λ”© λΈ”λ‘μ˜ λ„ˆλΉ„ λ˜λŠ” 높이가 κΈ° μ„€μ •λœ νŠΉμ • κ°’(μ˜ˆμ»¨λŒ€, 32, 64)보닀 큰 경우, 도 6에 λ„μ‹œλœ 바와 같이, TT 뢄할이 μ œν•œλ  수 μžˆλ‹€. With reference to FIG. 6, to allow for 64x64 luma blocks and 32x32 chroma pipeline designs in a hardware decoder, TT partitioning may be limited in certain cases. For example, when the width or height of the luma coding block is greater than a predetermined specific value (eg, 32 and 64), TT partitioning may be limited as shown in FIG. 6.

λ³Έ λ¬Έμ„œμ—μ„œ, μ½”λ”© 트리 μŠ€ν‚΄μ€ 루마 및 크둜마 블둝이 κ°œλ³„μ (separate) 블둝 트리 ꡬ쑰λ₯Ό κ°€μ§€λŠ” 것을 지원할 수 μžˆλ‹€. P 및 B μŠ¬λΌμ΄μŠ€λ“€μ— λŒ€ν•˜μ—¬, ν•˜λ‚˜μ˜ CTU λ‚΄ 루마 및 크둜마 CTB듀은 λ™μΌν•œ μ½”λ”© 트리 ꡬ쑰λ₯Ό 갖도둝 μ œν•œλ  수 μžˆλ‹€. κ·ΈλŸ¬λ‚˜, I μŠ¬λΌμ΄μŠ€λ“€μ— λŒ€ν•˜μ—¬, 루마 및 크둜마 블둝듀은 μ„œλ‘œ κ°œλ³„μ  블둝 트리 ꡬ쑰λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€. λ§Œμ•½ κ°œλ³„μ  블둝 트리 λͺ¨λ“œκ°€ μ μš©λ˜λŠ” 경우, 루마 CTBλŠ” νŠΉμ • μ½”λ”© 트리 ꡬ쑰λ₯Ό 기반으둜 CUλ“€λ‘œ λΆ„ν• λ˜κ³ , 크둜마 CTBλŠ” λ‹€λ₯Έ μ½”λ”© 트리 ꡬ쑰λ₯Ό 기반으둜 크둜마 CUλ“€λ‘œ 뢄할될 수 μžˆλ‹€. μ΄λŠ”, I 슬라이슀 λ‚΄ CUλŠ” 루마 μ„±λΆ„μ˜ μ½”λ”© 블둝 λ˜λŠ” 두 크둜마 μ„±λΆ„λ“€μ˜ μ½”λ”© λΈ”λ‘λ“€λ‘œ κ΅¬μ„±λ˜κ³ , P λ˜λŠ” B 슬라이슀의 CUλŠ” μ„Έκ°€μ§€ 컬러 μ„±λΆ„μ˜ λΈ”λ‘λ“€λ‘œ ꡬ성될 수 μžˆμŒμ„ μ˜λ―Έν•  수 μžˆλ‹€.In this document, the coding tree scheme may support that the luma and chroma blocks have separate block tree structures. For P and B slices, luma and chroma CTBs in one CTU may be limited to have the same coding tree structure. However, for I slices, luma and chroma blocks may have a separate block tree structure from each other. If an individual block tree mode is applied, the luma CTB may be split into CUs based on a particular coding tree structure, and the chroma CTB may be split into chroma CUs based on another coding tree structure. This may mean that a CU in an I slice may consist of a coding block of a luma component or coding blocks of two chroma components, and a CU of a P or B slice may be composed of blocks of three color components.

μƒμˆ ν•œ β€œPartitionig of the CTUs using a tree structureβ€μ—μ„œ λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•œ μΏΌλ“œνŠΈλ¦¬ μ½”λ”© 트리 ꡬ쑰에 λŒ€ν•˜μ—¬ μ„€λͺ…ν•˜μ˜€μœΌλ‚˜, CUκ°€ λΆ„ν• λ˜λŠ” κ΅¬μ‘°λŠ” 이에 ν•œμ •λ˜μ§€ μ•ŠλŠ”λ‹€. 예λ₯Ό λ“€μ–΄, BT ꡬ쑰 및 TT κ΅¬μ‘°λŠ” λ‹€μˆ˜ λΆ„ν•  트리 (Multiple Partitioning Tree, MPT) ꡬ쑰에 ν¬ν•¨λ˜λŠ” κ°œλ…μœΌλ‘œ 해석될 수 있고, CUλŠ” QT ꡬ쑰 및 MPT ꡬ쑰λ₯Ό 톡해 λΆ„ν• λœλ‹€κ³  해석할 수 μžˆλ‹€. QT ꡬ쑰 및 MPT ꡬ쑰λ₯Ό 톡해 CUκ°€ λΆ„ν• λ˜λŠ” 일 μ˜ˆμ—μ„œ, QT ꡬ쑰의 리프 λ…Έλ“œκ°€ λͺ‡ 개의 λΈ”λ‘μœΌλ‘œ λΆ„ν• λ˜λŠ”μ§€μ— κ΄€ν•œ 정보λ₯Ό ν¬ν•¨ν•˜λŠ” μ‹ νƒμŠ€ μš”μ†Œ(예λ₯Ό λ“€μ–΄, MPT_split_type) 및 QT ꡬ쑰의 리프 λ…Έλ“œκ°€ 수직과 μˆ˜ν‰ 쀑 μ–΄λŠ λ°©ν–₯으둜 λΆ„ν• λ˜λŠ”μ§€μ— κ΄€ν•œ 정보λ₯Ό ν¬ν•¨ν•˜λŠ” μ‹ νƒμŠ€ μš”μ†Œ(예λ₯Ό λ“€μ–΄, MPT_split_mode)κ°€ μ‹œκ·Έλ„λ§ 됨으둜써 λΆ„ν•  ꡬ쑰가 결정될 수 μžˆλ‹€.In the above-described "Partitionig of the CTUs using a tree structure", a quadtree coding tree structure involving a multitype tree has been described, but a structure in which a CU is divided 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 to be divided through the QT structure and the MPT structure. In one example where a CU is split through a QT structure and an MPT structure, a syntax element (eg, MPT_split_type) that contains information about how many blocks the leaf node of the QT structure is divided into and the leaf node of the QT structure are vertical The partition structure may be determined by signaling a syntax element (eg, MPT_split_mode) including information about which direction is divided into and horizontally.

또 λ‹€λ₯Έ μ˜ˆμ—μ„œ, CUλŠ” QT ꡬ쑰, BT ꡬ쑰 λ˜λŠ” TT ꡬ쑰와 λ‹€λ₯Έ λ°©λ²•μœΌλ‘œ 뢄할될 수 μžˆλ‹€. 즉, QT ꡬ쑰에 따라 ν•˜μœ„ 뎁슀의 CUκ°€ μƒμœ„ 뎁슀의 CU의 1/4 크기둜 λΆ„ν• λ˜κ±°λ‚˜, BT ꡬ쑰에 따라 ν•˜μœ„ 뎁슀의 CUκ°€ μƒμœ„ 뎁슀의 CU의 1/2 크기둜 λΆ„ν• λ˜κ±°λ‚˜, TT ꡬ쑰에 따라 ν•˜μœ„ 뎁슀의 CUκ°€ μƒμœ„ 뎁슀의 CU의 1/4 λ˜λŠ” 1/2 크기둜 λΆ„ν• λ˜λŠ” 것과 달리, ν•˜μœ„ 뎁슀의 CUλŠ” κ²½μš°μ— 따라 μƒμœ„ 뎁슀의 CU의 1/5, 1/3, 3/8, 3/5, 2/3 λ˜λŠ” 5/8 크기둜 뢄할될 수 있으며, CUκ°€ λΆ„ν• λ˜λŠ” 방법은 이에 ν•œμ •λ˜μ§€ μ•ŠλŠ”λ‹€.In another example, the CU may be partitioned in a different way than the QT structure, BT structure or TT structure. That is, according to the QT structure, the CU of the lower depth is divided into 1/4 size of the CU of the upper depth, or the CU of the lower depth is divided into 1/2 size of the CU of the upper depth according to the BT structure, or according to the TT structure. Unlike the CU of the lower depth is divided into 1/4 or 1/2 size of the CU of the upper depth, the CU of the lower depth is sometimes 1/5, 1/3, 3/8, 3 of the CU of the upper depth. It can be divided into / 5, 2/3 or 5/8 size, the way in which the CU is divided is not limited to this.

λ§Œμ•½ 트리 λ…Έλ“œ λΈ”λ‘μ˜ λΆ€λΆ„(a portion)이 ν•˜λ‹¨(bottom) λ˜λŠ” 였λ₯Έμͺ½(right) ν”½μ²˜ λ°”μš΄λ”λ¦¬λ₯Ό μ΄ˆκ³Όν•˜λŠ”(exceeds) 경우, ν•΄λ‹Ή 트리 λ…Έλ“œ 블둝은 λͺ¨λ“  μ½”λ”©λœ CU의 λͺ¨λ“  μƒ˜ν”Œλ“€μ΄ 상기 ν”½μ²˜ λ°”μš΄λ”λ¦¬λ“€ 내에 μœ„μΉ˜ν•˜λ„λ‘ μ œν•œλ  수 μžˆλ‹€. 이 경우 예λ₯Ό λ“€μ–΄ λ‹€μŒκ³Ό 같은 λΆ„ν•  κ·œμΉ™μ΄ 적용될 수 μžˆλ‹€.If a portion of a tree node block exceeds the bottom or right picture boundary, the tree node block is placed so that all samples of all coded CUs are located within the picture boundaries. May be limited. In this case, for example, the following division rule may be applied.

- If a portion of a tree node block exceeds both the bottom and the right picture boundaries,-If a portion of a tree node block exceeds both the bottom and the right picture boundaries,

- If the block is a QT node and the size of the block is larger than the minimum QT size, the block is forced to be split with QT split mode.-If the block is a QT node and the size of the block is larger than the minimum QT size, the block is forced to be split with QT split mode.

- Otherwise, the block is forced to be split with SPLIT_BT_HOR mode-Otherwise, the block is forced to be split with SPLIT_BT_HOR mode

- Otherwise if a portion of a tree node block exceeds the bottom picture boundaries,-Otherwise if a portion of a tree node block exceeds the bottom picture boundaries,

- If the block is a QT node, and the size of the block is larger than the minimum QT size, and the size of the block is larger than the maximum BT size, the block is forced to be split with QT split mode.-If the block is a QT node, and the size of the block is larger than the minimum QT size, and the size of the block is larger than the maximum BT size, the block is forced to be split with QT split mode.

- Otherwise, if the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_HOR mode.-Otherwise, if the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_HOR mode.

- Otherwise (the block is a BTT node or the size of the block is smaller than or equal to the minimum QT size), the block is forced to be split with SPLIT_BT_HOR mode.-Otherwise (the block is a BTT node or the size of the block is smaller than or equal to the minimum QT size), the block is forced to be split with SPLIT_BT_HOR mode.

- Otherwise if a portion of a tree node block exceeds the right picture boundaries,-Otherwise if a portion of a tree node block exceeds the right picture boundaries,

- If the block is a QT node, and the size of the block is larger than the minimum QT size, and the size of the block is larger than the maximum BT size, the block is forced to be split with QT split mode.-If the block is a QT node, and the size of the block is larger than the minimum QT size, and the size of the block is larger than the maximum BT size, the block is forced to be split with QT split mode.

- Otherwise, if the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_VER mode.-Otherwise, if the block is a QT node, and the size of the block is larger than the minimum QT size and the size of the block is smaller than or equal to the maximum BT size, the block is forced to be split with QT split mode or SPLIT_BT_VER mode.

- Otherwise (the block is a BTT node or the size of the block is smaller than or equal to the minimum QT size), the block is forced to be split with SPLIT_BT_VER mode.-Otherwise (the block is a BTT node or the size of the block is smaller than or equal to the minimum QT size), the block is forced to be split with SPLIT_BT_VER mode.

ν•œνŽΈ, μƒμˆ ν•œ λ©€ν‹°νƒ€μž… 트리λ₯Ό μˆ˜λ°˜ν•œ μΏΌλ“œνŠΈλ¦¬ μ½”λ”© 블둝 κ΅¬μ‘°λŠ” 맀우 μœ μ—°ν•œ 블둝 νŒŒν‹°μ…”λ‹ ꡬ쑰λ₯Ό μ œκ³΅ν•  수 μžˆλ‹€. λ©€ν‹°νƒ€μž… νŠΈλ¦¬μ— μ§€μ›λ˜λŠ” λΆ„ν•  νƒ€μž…λ“€ λ•Œλ¬Έμ—, λ‹€λ₯Έ λΆ„ν•  νŒ¨ν„΄λ“€μ΄ κ²½μš°μ— λ”°λΌμ„œ 잠재적으둜 λ™μΌν•œ μ½”λ”© 블둝 ꡬ쑰 κ²°κ³Όλ₯Ό κ°€μ Έμ˜¬ 수 μž‡λ‹€. μ΄λŸ¬ν•œ 리던던트(redundant)ν•œ λΆ„ν•  νŒ¨ν„΄λ“€μ˜ λ°œμƒμ„ μ œν•œν•¨μœΌλ‘œμ¨ νŒŒν‹°μ…”λ‹ μ •λ³΄μ˜ λ°μ΄ν„°λŸ‰μ„ 쀄일 수 μžˆλ‹€. μ•„λž˜μ˜ 도면을 μ°Έμ‘°ν•˜μ—¬ μ„€λͺ…ν•œλ‹€.On the other hand, the quadtree coded block structure with the multi-type tree described above can provide a very flexible block partitioning structure. Because of the partition types supported in a multitype tree, different partition patterns can sometimes lead to potentially identical coding block structure results. By limiting the occurrence of such redundant partition patterns, the data amount of partitioning information can be reduced. It demonstrates with reference to the following drawings.

도 7은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, λ°”μ΄λ„ˆλ¦¬ 트리 λΆ„ν•  및 ν„°λ„ˆλ¦¬ 트리 λΆ„ν• μ—μ„œ λ°œμƒν•  수 μžˆλŠ” 리던던트 λΆ„ν•  νŒ¨ν„΄λ“€μ„ μ˜ˆμ‹œν•˜λŠ” 도면이닀.FIG. 7 is a diagram illustrating redundant division patterns that may occur in binary tree division and ternary tree division, as an embodiment to which the present invention may be applied.

도 7에 λ„μ‹œλœ 바와 같이, 2단계 레벨의 ν•œ λ°©ν–₯에 λŒ€ν•œ 연속적인 λ°”μ΄λ„ˆλ¦¬ λΆ„ν• (two levels of consecutive binary splits in one direction)은, ν„°λ„ˆλ¦¬ λΆ„ν•  이후 μ„Όν„° νŒŒν‹°μ…˜μ— λŒ€ν•œ λ°”μ΄λ„ˆλ¦¬ λΆ„ν• κ³Ό λ™μΌν•œ μ½”λ”© 블둝 ꡬ쑰λ₯Ό κ°–λŠ”λ‹€. μ΄λŸ¬ν•œ 경우, ν„°λ„ˆλ¦¬ 트리 λΆ„ν• μ˜ μ„Όν„° νŒŒν‹°μ…˜μ— λŒ€ν•œ λ°”μ΄λ„ˆλ¦¬ 트리 λΆ„ν•  (in the given direction)은 μ œν•œλ  수 μžˆλ‹€. μ΄λŸ¬ν•œ μ œν•œλŠ” λͺ¨λ“  ν”½μ²˜λ“€μ˜ CU듀에 λŒ€ν•˜μ—¬ 적용될 수 μžˆλ‹€. μ΄λŸ¬ν•œ νŠΉμ • 뢄할이 μ œν•œλ˜λŠ” 경우, λŒ€μ‘ν•˜λŠ” μ‹ ν…μŠ€ μš”μ†Œλ“€μ˜ μ‹œκ·Έλ„λ§μ€ μ΄λŸ¬ν•œ μ œν•œλ˜λŠ” 경우λ₯Ό λ°˜μ˜ν•˜μ—¬ μˆ˜μ •λ  수 있고, 이λ₯Ό ν†΅ν•˜μ—¬ νŒŒν‹°μ…”λ‹μ„ μœ„ν•˜μ—¬ μ‹œκ·Έλ„λ§λ˜λŠ” λΉ„νŠΈμˆ˜λ₯Ό 쀄일 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 도 7에 λ„μ‹œλœ μ˜ˆμ™€ 같이, CU의 μ„Όν„° νŒŒν‹°μ…˜μ— λŒ€ν•œ λ°”μ΄λ„ˆλ¦¬ 트리 뢄할이 μ œν•œλ˜λŠ” 경우, 뢄할이 λ°”μ΄λ„ˆλ¦¬ 뢄할인지 ν…Œλ„ˆλ¦¬ 뢄할인지 μ—¬λΆ€λ₯Ό κ°€λ¦¬ν‚€λŠ” mtt_split_cu_binary_flag μ‹ ν…μŠ€ μš”μ†ŒλŠ” μ‹œκ·Έλ„λ§λ˜μ§€ μ•Šκ³ , κ·Έ 값은 0으둜 디코더에 μ˜ν•˜μ—¬ 좔둠될 수 μžˆλ‹€.As shown in FIG. 7, two levels of consecutive binary splits in one direction have the same coding block structure as the binary split for the center partition after the ternary split. . In this case, the binary tree split in the given direction for the center partition of the ternary tree split may be limited. This restriction can be applied for CUs of all pictures. If this particular partitioning is restricted, the signaling of the corresponding syntax elements can be modified to reflect this limited case, thereby reducing the number of bits signaled for partitioning. For example, as shown in FIG. 7, when the binary tree split for the center partition of the CU is restricted, the mtt_split_cu_binary_flag syntax element indicating whether the split is a binary split or a tenary split is not signaled, and its value is Can be inferred by the decoder to zero.

예츑(prediction)Prediction

디코딩이 μˆ˜ν–‰λ˜λŠ” ν˜„μž¬ 처리 μœ λ‹›μ„ λ³΅μ›ν•˜κΈ° μœ„ν•΄μ„œ ν˜„μž¬ 처리 μœ λ‹›μ΄ ν¬ν•¨λœ ν˜„μž¬ 픽쳐 λ˜λŠ” λ‹€λ₯Έ ν”½μ³λ“€μ˜ λ””μ½”λ”©λœ 뢀뢄을 μ΄μš©ν•  수 μžˆλ‹€. The decoded portion of the current picture or other pictures in which the current processing unit is included may be used to reconstruct the current processing unit in which decoding is performed.

볡원에 ν˜„μž¬ ν”½μ³λ§Œμ„ μ΄μš©ν•˜λŠ”, 즉 ν™”λ©΄λ‚΄ μ˜ˆμΈ‘λ§Œμ„ μˆ˜ν–‰ν•˜λŠ” 픽쳐(슬라이슀)λ₯Ό 인트라 픽쳐 λ˜λŠ” I 픽쳐(슬라이슀), 각 μœ λ‹›μ„ μ˜ˆμΈ‘ν•˜κΈ° μœ„ν•˜μ—¬ μ΅œλŒ€ ν•˜λ‚˜μ˜ μ›€μ§μž„ 벑터 및 레퍼런슀 인덱슀λ₯Ό μ΄μš©ν•˜λŠ” 픽쳐(슬라이슀)λ₯Ό 예츑 픽쳐(predictive picture) λ˜λŠ” P 픽쳐(슬라이슀), μ΅œλŒ€ 두 개의 μ›€μ§μž„ 벑터 및 레퍼런슀 인덱슀λ₯Ό μ΄μš©ν•˜λŠ” 픽쳐(슬라이슀)λ₯Ό 쌍예츑 픽쳐(Bi-predictive picture) λ˜λŠ” B 픽쳐(슬라이슀)라고 μ§€μΉ­ν•  수 μžˆλ‹€. Intra picture or I picture (slice), which uses only the current picture for reconstruction, i.e. performs only intra picture prediction, predicts a picture (slice) using at most one motion vector and reference index to predict each unit A picture using a predictive picture or P picture (slice), up to two motion vectors, and a reference index (slice) may be referred to as a bi-predictive picture or a B picture (slice).

인터 μ˜ˆμΈ‘μ€ ν˜„μž¬ 픽쳐 μ΄μ™Έμ˜ ν”½μ³μ˜ 데이터 μš”μ†Œ(예λ₯Ό λ“€μ–΄, μƒ˜ν”Œ κ°’ λ˜λŠ” μ›€μ§μž„ 벑터 λ“±)의 κΈ°λ°˜ν•˜μ—¬ ν˜„μž¬ 처리 블둝을 λ„μΆœν•˜λŠ” 예츑 방법을 μ˜λ―Έν•œλ‹€. 즉, ν˜„μž¬ 픽쳐 μ΄μ™Έμ˜ λ³΅μ›λœ λ‹€λ₯Έ 픽쳐 λ‚΄μ˜ λ³΅μ›λœ μ˜μ—­λ“€μ„ μ°Έμ‘°ν•˜μ—¬ ν˜„μž¬ 처리 λΈ”λ‘μ˜ 픽셀값을 μ˜ˆμΈ‘ν•˜λŠ” 방법을 μ˜λ―Έν•œλ‹€.Inter prediction means a prediction method of deriving a current processing block based on data elements (eg, sample values or motion vectors, etc.) of pictures other than the current picture. That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in other reconstructed pictures other than the current picture.

μ΄ν•˜, 인트라 예츑(λ˜λŠ” ν™”λ©΄ λ‚΄ 예츑)에 λŒ€ν•˜μ—¬ 보닀 μƒμ„Ένžˆ μ‚΄νŽ΄λ³Έλ‹€.Hereinafter, intra prediction (or intra prediction) will be described in more detail.

인트라 예츑(Intra prediction)(λ˜λŠ” ν™”λ©΄ λ‚΄ 예츑)Intra prediction (or intra prediction)

인트라 μ˜ˆμΈ‘μ€ λ™μΌν•œ λ””μ½”λ”©λœ 픽쳐(λ˜λŠ” 슬라이슀)의 데이터 μš”μ†Œ(예λ₯Ό λ“€μ–΄, μƒ˜ν”Œ κ°’ λ“±)μœΌλ‘œλΆ€ν„° ν˜„μž¬ 처리 블둝을 λ„μΆœν•˜λŠ” 예츑 방법을 μ˜λ―Έν•œλ‹€. 즉, ν˜„μž¬ 픽쳐 λ‚΄μ˜ λ³΅μ›λœ μ˜μ—­λ“€μ„ μ°Έμ‘°ν•˜μ—¬ ν˜„μž¬ 처리 λΈ”λ‘μ˜ 픽셀값을 μ˜ˆμΈ‘ν•˜λŠ” 방법을 μ˜λ―Έν•œλ‹€. Intra prediction means a prediction method that derives the current processing block from data elements (eg, sample values, etc.) of the same decoded picture (or slice). That is, a method of predicting pixel values of the current processing block by referring to reconstructed regions in the current picture.

인트라 μ˜ˆμΈ‘μ€ ν˜„μž¬ 블둝이 μ†ν•˜λŠ” ν”½μ²˜(μ΄ν•˜, ν˜„μž¬ ν”½μ²˜) λ‚΄μ˜ ν˜„μž¬ 블둝 μ™ΈλΆ€μ˜ μ°Έμ‘° μƒ˜ν”Œμ„ 기반으둜 ν˜„μž¬ 블둝에 λŒ€ν•œ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” μ˜ˆμΈ‘μ„ λ‚˜νƒ€λ‚Ό 수 μžˆλ‹€.Intra prediction may indicate prediction for generating a prediction sample for a current block based on reference samples outside the current block in a picture to which the current block belongs (hereinafter, referred to as a current picture).

λ³Έ 발λͺ…은 μ•žμ„œ 도 1 및 도 2μ—μ„œ μ„€λͺ…ν•œ 인트라 예츑 λ°©λ²•μ˜ μ„ΈλΆ€ κΈ°μˆ μ„ μ„€λͺ…ν•˜λŠ” κ²ƒμœΌλ‘œ λ””μ½”λ”μ˜ 경우 ν›„μˆ ν•˜λŠ” 도 10의 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ λ””μ½”λ”© 방법 및 도 11의 λ””μ½”λ”© μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ‘œ λ‚˜νƒ€λ‚Ό 수 μžˆλ‹€. λ”λΆˆμ–΄ μΈμ½”λ”μ˜ 경우, ν›„μˆ ν•˜λŠ” 도 8의 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ 인코딩 방법 및 도 9의 인코딩 μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ‘œ λ‚˜νƒ€λ‚Ό 수 μžˆλ‹€. λ”ν•˜μ—¬, 도 8 및 도 9에 μ˜ν•΄ μΈμ½”λ”©λœ λ°μ΄ν„°λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Όμ˜ ν˜•νƒœλ‘œ μ €μž₯될 수 μžˆλ‹€.The present invention describes the detailed description of the intra prediction method described above with reference to FIGS. 1 and 2, and the decoder may be represented by the intra prediction-based video / image decoding method of FIG. 10 described later and the intra prediction unit in the decoding apparatus of FIG. 11. . In addition, the encoder may be represented by the intra prediction-based video / video encoding method of FIG. 8 and the intra prediction unit in the encoding apparatus of FIG. 9. In addition, the data encoded by FIGS. 8 and 9 may be stored in the form of a bitstream.

ν˜„μž¬ 블둝에 인트라 예츑이 μ μš©λ˜λŠ” 경우, ν˜„μž¬ λΈ”λ‘μ˜ 인트라 μ˜ˆμΈ‘μ— μ‚¬μš©ν•  μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ λ„μΆœλ  수 μžˆλ‹€. 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ€ nWxnH 크기의 ν˜„μž¬ λΈ”λ‘μ˜ 쒌츑(left) 경계에 μΈμ ‘ν•œ μƒ˜ν”Œ 및 μ’Œν•˜μΈ‘(bottom-left)에 μ΄μ›ƒν•˜λŠ” 총 2xnH 개의 μƒ˜ν”Œλ“€, ν˜„μž¬ λΈ”λ‘μ˜ 상츑(top) 경계에 μΈμ ‘ν•œ μƒ˜ν”Œ 및 μš°μƒμΈ‘(top-right)에 μ΄μ›ƒν•˜λŠ” 총 2xnW 개의 μƒ˜ν”Œλ“€ 및 ν˜„μž¬ λΈ”λ‘μ˜ μ’ŒμƒμΈ‘(top-left)에 μ΄μ›ƒν•˜λŠ” 1개의 μƒ˜ν”Œμ„ 포함할 수 μžˆλ‹€. λ˜λŠ”, 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ€ λ³΅μˆ˜μ—΄μ˜ 상츑 μ£Όλ³€ μƒ˜ν”Œλ“€ 및 λ³΅μˆ˜ν–‰μ˜ 쒌츑 μ£Όλ³€ μƒ˜ν”Œλ“€μ„ 포함할 μˆ˜λ„ μžˆλ‹€. λ˜ν•œ, 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ€ nWxnH 크기의 ν˜„μž¬ λΈ”λ‘μ˜ 우츑(right) 경계에 μΈμ ‘ν•œ 총 nH 개의 μƒ˜ν”Œλ“€, ν˜„μž¬ λΈ”λ‘μ˜ ν•˜μΈ‘(bottom) 경계에 μΈμ ‘ν•œ 총 nW 개의 μƒ˜ν”Œλ“€ 및 ν˜„μž¬ λΈ”λ‘μ˜ μš°ν•˜μΈ‘(bottom-right)에 μ΄μ›ƒν•˜λŠ” 1개의 μƒ˜ν”Œμ„ 포함할 μˆ˜λ„ μžˆλ‹€. When intra prediction is applied to the current block, peripheral reference samples to be used for intra prediction of the current block may be derived. The peripheral reference samples of the current block are samples adjacent to the left boundary of the current block of size nWxnH and a total of 2xnH samples neighboring the bottom-left, and samples adjacent to the top boundary of the current block. And a total of 2xnW samples neighboring the top-right and one sample neighboring the top-left of the current block. Alternatively, the peripheral reference samples of the current block may include a plurality of upper peripheral samples and a plurality of left peripheral samples. In addition, the peripheral reference samples of the current block are a total of nH samples adjacent to the right boundary of the current block of size nWxnH, a total of nW samples adjacent to the bottom boundary of the current block and the lower right side of the current block. It may include one sample neighboring (bottom-right).

λ‹€λ§Œ, ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 μΌλΆ€λŠ” 아직 λ””μ½”λ”©λ˜μ§€ μ•Šμ•˜κ±°λ‚˜, 이용 κ°€λŠ₯ν•˜μ§€ μ•Šμ„ 수 μžˆλ‹€. 이 경우, λ””μ½”λ”λŠ” 이용 κ°€λŠ₯ν•œ μƒ˜ν”Œλ“€λ‘œ 이용 κ°€λŠ₯ν•˜μ§€ μ•Šμ€ μƒ˜ν”Œλ“€μ„ λŒ€μ²΄(substitution)ν•˜μ—¬ μ˜ˆμΈ‘μ— μ‚¬μš©ν•  μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ ꡬ성할 수 μžˆλ‹€. λ˜λŠ”, 이용 κ°€λŠ₯ν•œ μƒ˜ν”Œλ“€μ˜ 보간(interpolation)을 ν†΅ν•˜μ—¬ μ˜ˆμΈ‘μ— μ‚¬μš©ν•  μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ ꡬ성할 수 μžˆλ‹€.However, some of the peripheral reference samples of the current block may not be decoded yet or available. In this case, the decoder may construct the surrounding reference samples to use for prediction by substituting the samples that are not available with the available samples. Alternatively, peripheral reference samples to be used for prediction may be configured through interpolation of the available samples.

μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ λ„μΆœλœ 경우, ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€(neighboring) μ°Έμ‘° μƒ˜ν”Œλ“€μ˜ 평균(average) ν˜Ήμ€ μΈν„°ν΄λ ˆμ΄μ…˜(interpolation)을 기반으둜 예츑 μƒ˜ν”Œμ„ μœ λ„ν•  수 있고, (ii) ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 예츑 μƒ˜ν”Œμ— λŒ€ν•˜μ—¬ νŠΉμ • (예츑) λ°©ν–₯에 μ‘΄μž¬ν•˜λŠ” μ°Έμ‘° μƒ˜ν”Œμ„ 기반으둜 상기 예츑 μƒ˜ν”Œμ„ μœ λ„ν•  μˆ˜λ„ μžˆλ‹€. (i)의 κ²½μš°λŠ” λΉ„λ°©ν–₯μ„± λͺ¨λ“œ λ˜λŠ” 비각도 λͺ¨λ“œ, (ii)의 κ²½μš°λŠ” λ°©ν–₯μ„±(directional) λͺ¨λ“œ λ˜λŠ” 각도(angular) λͺ¨λ“œλΌκ³  뢈릴 수 μžˆλ‹€. λ˜ν•œ, 상기 μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ κΈ°μ€€μœΌλ‘œ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯의 λ°˜λŒ€ λ°©ν–₯에 μœ„μΉ˜ν•˜λŠ” 상기 제2 μ£Όλ³€ μƒ˜ν”Œκ³Ό 상기 제1 μ£Όλ³€ μƒ˜ν”Œκ³Όμ˜ 보간을 ν†΅ν•˜μ—¬ 상기 예츑 μƒ˜ν”Œμ΄ 생성될 μˆ˜λ„ μžˆλ‹€. μƒμˆ ν•œ κ²½μš°λŠ” μ„ ν˜• 보간 인트라 예츑(Linear interpolation intra prediction, LIP) 이라고 뢈릴 수 μžˆλ‹€. λ˜ν•œ, ν•„ν„°λ§λœ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ 기반으둜 상기 ν˜„μž¬ λΈ”λ‘μ˜ μž„μ‹œ 예츑 μƒ˜ν”Œμ„ λ„μΆœν•˜κ³ , 상기 기쑴의 μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€, 즉, ν•„ν„°λ§λ˜μ§€ μ•Šμ€ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 상기 인트라 예츑 λͺ¨λ“œμ— 따라 λ„μΆœλœ 적어도 ν•˜λ‚˜μ˜ μ°Έμ‘° μƒ˜ν”Œκ³Ό 상기 μž„μ‹œ 예츑 μƒ˜ν”Œμ„ 가쀑합(weighted sum)ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ λ„μΆœν•  μˆ˜λ„ μžˆλ‹€. μƒμˆ ν•œ κ²½μš°λŠ” PDPC(Position dependent intra prediction) 라고 뢈릴 수 μžˆλ‹€. ν•œνŽΈ, ν•„μš”μ— λ”°λΌμ„œ λ„μΆœλœ 예츑 μƒ˜ν”Œμ— λŒ€ν•œ ν›„μ²˜λ¦¬ 필터링이 μˆ˜ν–‰λ  μˆ˜λ„ μžˆλ‹€.When the neighbor reference samples are derived, the prediction sample can be derived based on the average or interpolation of neighboring reference samples of the current block, and (ii) the prediction among the neighbor reference samples of the current block. The prediction sample may be derived based on a reference sample present in a specific (prediction) direction with respect to the sample. In case of (i), it may be called non-directional mode or non-angle mode, and in case of (ii), it may be called directional mode or angular mode. The interpolation between the second neighboring sample and the first neighboring sample located in a direction opposite to the prediction direction of the intra prediction mode of the current block based on the prediction sample of the current block among the neighboring reference samples may be performed. Prediction samples may be generated. The above case may be referred to as linear interpolation intra prediction (LIP). In addition, a temporary prediction sample of the current block is derived based on filtered neighbor reference samples, and at least one of the existing neighbor reference samples, that is, unfiltered neighbor reference samples, derived according to the intra prediction mode. A weighted sum of a reference sample and the temporary prediction sample may be used to derive the prediction sample of the current block. The above case may be referred to as position dependent intra prediction (PDPC). Meanwhile, post-processing filtering may be performed on the predicted sample derived as needed.

ꡬ체적으둜, 인트라 예츑 μ ˆμ°¨λŠ” 인트라 예츑 λͺ¨λ“œ κ²°μ • 단계, μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œ λ„μΆœ 단계, 인트라 예츑 λͺ¨λ“œ 기반 예츑 μƒ˜ν”Œ λ„μΆœ 단계λ₯Ό 포함할 수 μžˆλ‹€. λ˜ν•œ, ν•„μš”μ— λ”°λΌμ„œ λ„μΆœλœ 예츑 μƒ˜ν”Œμ— λŒ€ν•œ ν›„μ²˜λ¦¬ 필터링(post-filtering) 단계가 μˆ˜ν–‰λ  μˆ˜λ„ μžˆλ‹€. In detail, the intra prediction procedure may include an intra prediction mode determination step, a peripheral reference sample derivation step, and an intra prediction mode based prediction sample derivation step. In addition, a post-filtering step may be performed on the predicted sample derived as needed.

인트라 μ˜ˆμΈ‘μ— κΈ°λ°˜ν•œ λΉ„λ””μ˜€/μ˜μƒ 인코딩 절차 및 인코딩 μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λŠ” 개랡적으둜 예λ₯Ό λ“€μ–΄ λ‹€μŒμ„ 포함할 수 μžˆλ‹€.A video / image encoding procedure based on intra prediction and an intra prediction unit in the encoding apparatus may roughly include, for example, the following.

도 8 및 도 9λŠ” λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ 인코딩 방법 및 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인코딩 μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.8 and 9 are diagrams illustrating an intra prediction based video / image encoding method and an intra prediction unit in an encoding apparatus according to an embodiment of the present invention.

도 8 및 도 9λ₯Ό μ°Έμ‘°ν•˜λ©΄, S801은 인코딩 μž₯치의 인트라 μ˜ˆμΈ‘λΆ€(185)에 μ˜ν•˜μ—¬ μˆ˜ν–‰λ  수 있고, S802λŠ” 인코딩 μž₯치의 λ ˆμ§€λ“€μ–Ό μ²˜λ¦¬λΆ€μ— μ˜ν•˜μ—¬ μˆ˜ν–‰λ  수 μžˆλ‹€. ꡬ체적으둜, S802은 인코딩 μž₯치의 감산뢀(115)에 μ˜ν•˜μ—¬ μˆ˜ν–‰λ  수 μžˆλ‹€. S803μ—μ„œ 예츑 μ •λ³΄λŠ” 인트라 μ˜ˆμΈ‘λΆ€(185)에 μ˜ν•˜μ—¬ λ„μΆœλ˜κ³ , μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)에 μ˜ν•˜μ—¬ 인코딩될 수 μžˆλ‹€. S803μ—μ„œ λ ˆμ§€λ“€μ–Ό μ •λ³΄λŠ” λ ˆμ§€λ“€μ–Ό μ²˜λ¦¬λΆ€μ— μ˜ν•˜μ—¬ λ„μΆœλ˜κ³ , μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)에 μ˜ν•˜μ—¬ 인코딩될 수 μžˆλ‹€. 상기 λ ˆμ§€λ“€μ–Ό μ •λ³΄λŠ” 상기 λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ— κ΄€ν•œ 정보이닀. 상기 λ ˆμ§€λ“€μ–Ό μ •λ³΄λŠ” 상기 λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ— λŒ€ν•œ μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— κ΄€ν•œ 정보λ₯Ό 포함할 수 μžˆλ‹€. 8 and 9, S801 may be performed by the intra predictor 185 of the encoding apparatus, and S802 may be performed by the residual processor of the encoding apparatus. In detail, S802 may be performed by the subtraction unit 115 of the encoding apparatus. In S803, the prediction information may be derived by the intra prediction unit 185 and encoded by the entropy encoding unit 190. In S803, the residual information may be derived by the residual processor and encoded by the entropy encoding unit 190. The residual information is information about the residual samples. The residual information may include information about quantized transform coefficients for the residual samples.

μƒμˆ ν•œ 바와 같이 상기 λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ€ 인코딩 μž₯치의 λ³€ν™˜λΆ€(120)λ₯Ό ν†΅ν•˜μ—¬ λ³€ν™˜ κ³„μˆ˜λ“€λ‘œ λ„μΆœλ˜κ³ , 상기 λ³€ν™˜ κ³„μˆ˜λ“€μ€ μ–‘μžν™”λΆ€(130)λ₯Ό ν†΅ν•˜μ—¬ μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€λ‘œ λ„μΆœλ  수 μžˆλ‹€. 상기 μ–‘μžν™”λœ λ³€ν™˜ κ³„μˆ˜λ“€μ— κ΄€ν•œ 정보가 λ ˆμ§€λ“€μ–Ό μ½”λ”© 절차λ₯Ό ν†΅ν•˜μ—¬ μ—”νŠΈλ‘œν”Ό 인코딩뢀(190)μ—μ„œ 인코딩될 수 μžˆλ‹€. As described above, the residual samples may be derived as transform coefficients through the transform unit 120 of the encoding apparatus, and the transform coefficients may be derived as transform coefficients quantized through the quantization unit 130. Information about the quantized transform coefficients may be encoded by the entropy encoding unit 190 through a residual coding procedure.

인코딩 μž₯μΉ˜λŠ” ν˜„μž¬ 블둝에 λŒ€ν•œ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•œλ‹€(S801). 인코딩 μž₯μΉ˜λŠ” ν˜„μž¬ 블둝에 λŒ€ν•œ 인트라 예츑 λͺ¨λ“œλ₯Ό λ„μΆœν•˜κ³ , ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ λ„μΆœν•  수 있고, 상기 인트라 예츑 λͺ¨λ“œ 및 상기 μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ 기반으둜 상기 ν˜„μž¬ 블둝 λ‚΄ 예츑 μƒ˜ν”Œλ“€μ„ μƒμ„±ν•œλ‹€. μ—¬κΈ°μ„œ 인트라 예츑 λͺ¨λ“œ κ²°μ •, μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 도(좜 및 예츑 μƒ˜ν”Œλ“€ 생성 μ ˆμ°¨λŠ” λ™μ‹œμ— μˆ˜ν–‰λ  μˆ˜λ„ 있고, μ–΄λŠ ν•œ μ ˆμ°¨κ°€ λ‹€λ₯Έ μ ˆμ°¨λ³΄λ‹€ λ¨Όμ € μˆ˜ν–‰λ  μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 인코딩 μž₯치의 인트라 μ˜ˆμΈ‘λΆ€(185)λŠ” 예츑 λͺ¨λ“œ κ²°μ •λΆ€(186), μ°Έμ‘° μƒ˜ν”Œ λ„μΆœλΆ€(187), 예츑 μƒ˜ν”Œ λ„μΆœλΆ€(188)λ₯Ό 포함할 수 있으며, 예츑 λͺ¨λ“œ κ²°μ •λΆ€(186)μ—μ„œ 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•˜κ³ , μ°Έμ‘° μƒ˜ν”Œ λ„μΆœλΆ€(187)μ—μ„œ 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ λ„μΆœν•˜κ³ , 예츑 μƒ˜ν”Œ λ„μΆœλΆ€(188)μ—μ„œ 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ›€μ§μž„ μƒ˜ν”Œλ“€μ„ λ„μΆœν•  수 μžˆλ‹€. ν•œνŽΈ, 비둝 λ„μ‹œλ˜μ§€λŠ” μ•Šμ•˜μ§€λ§Œ, ν›„μˆ ν•˜λŠ” 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨κ°€ μˆ˜ν–‰λ˜λŠ” 경우, 인트라 μ˜ˆμΈ‘λΆ€(185)λŠ” 예츑 μƒ˜ν”Œ ν•„ν„°λΆ€(λ―Έλ„μ‹œ)λ₯Ό 더 포함할 μˆ˜λ„ μžˆλ‹€. 인코딩 μž₯μΉ˜λŠ” 볡수의 인트라 예츑 λͺ¨λ“œλ“€ 쀑 상기 ν˜„μž¬ 블둝에 λŒ€ν•˜μ—¬ μ μš©λ˜λŠ” λͺ¨λ“œλ₯Ό κ²°μ •ν•  수 μžˆλ‹€. 인코딩 μž₯μΉ˜λŠ” 상기 인트라 예츑 λͺ¨λ“œλ“€μ— λŒ€ν•œ RD costλ₯Ό λΉ„κ΅ν•˜κ³  상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 졜적의 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•  수 μžˆλ‹€. The encoding apparatus performs intra prediction on the current block (S801). The encoding apparatus may derive an intra prediction mode for the current block, derive the peripheral reference samples of the current block, and generate the prediction samples in the current block based on the intra prediction mode and the peripheral reference samples. Here, the intra prediction mode determination, the peripheral reference samples (the procedure of generating the prediction and the prediction samples may be performed simultaneously or one procedure may be performed before the other procedure. For example, the intra prediction unit of the encoding apparatus ( 185 may include a prediction mode determiner 186, a reference sample derivator 187, and a prediction sample derivator 188, and the prediction mode determiner 186 determines an intra prediction mode for the current block. The reference sample derivator 187 may derive peripheral reference samples of the current block, and the predictive sample derivator 188 may derive the motion samples of the current block. When the predictive sample filtering procedure is performed, the intra predictor 185 may further include a predictive sample filter unit (not shown) The encoding apparatus may further include the current block among a plurality of intra prediction modes. The encoding apparatus may compare an RD cost for the intra prediction modes and determine an optimal intra prediction mode for the current block.

ν•œνŽΈ, 인코딩 μž₯μΉ˜λŠ” 예츑 μƒ˜ν”Œ 필터링 절차λ₯Ό μˆ˜ν–‰ν•  μˆ˜λ„ μžˆλ‹€. 예츑 μƒ˜ν”Œ 필터링은 포슀트 필터링이라 뢈릴 수 μžˆλ‹€. 상기 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨μ— μ˜ν•˜μ—¬ 상기 예츑 μƒ˜ν”Œλ“€ 쀑 일뢀 λ˜λŠ” μ „λΆ€κ°€ 필터링될 수 μžˆλ‹€. κ²½μš°μ— 따라 상기 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨λŠ” μƒλž΅λ  수 μžˆλ‹€. Meanwhile, the encoding apparatus may perform a prediction sample filtering procedure. Predictive sample filtering may be referred to as post filtering. Some or all of the prediction samples may be filtered by the prediction sample filtering procedure. In some cases, the prediction sample filtering procedure may be omitted.

인코딩 μž₯μΉ˜λŠ” (ν•„ν„°λ§λœ) 예츑 μƒ˜ν”Œμ„ 기반으둜 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ„ μƒμ„±ν•œλ‹€(S802). 인코딩 μž₯μΉ˜λŠ” 상기 인트라 예츑 λͺ¨λ“œλ₯Ό λ‚˜νƒ€λ‚΄λŠ” 예츑 λͺ¨λ“œ 정보 및 상기 λ ˆλ“€μ–Ό μƒ˜ν”Œλ“€μ— κ΄€ν•œ λ ˆμ§€λ“€μ–Ό 정보λ₯Ό ν¬ν•¨ν•˜λŠ” μ˜μƒ 정보λ₯Ό 인코딩할 수 μžˆλ‹€(S803). μΈμ½”λ”©λœ μ˜μƒ 정보λ₯Ό λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ 좜λ ₯될 수 μžˆλ‹€. 좜λ ₯된 λΉ„νŠΈμŠ€νŠΈλ¦Όμ€ μ €μž₯맀체 λ˜λŠ” λ„€νŠΈμ›Œν¬λ₯Ό ν†΅ν•˜μ—¬ λ””μ½”λ”© μž₯치둜 전달될 수 μžˆλ‹€.The encoding apparatus generates residual samples for the current block based on the (filtered) prediction sample (S802). The encoding apparatus may encode image information including prediction mode information indicating the intra prediction mode and residual information regarding the residual samples (S803). The encoded image information may be output in the form of a bitstream. The output bitstream may be delivered to the decoding apparatus via a storage medium or a network.

ν•œνŽΈ, μƒμˆ ν•œ 바와 같이 인코딩 μž₯μΉ˜λŠ” 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ 및 상기 λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ„ 기반으둜 볡원 ν”½μ²˜(볡원 μƒ˜ν”Œλ“€ 및 볡원 블둝 포함)λ₯Ό 생성할 수 μžˆλ‹€. μ΄λŠ” λ””μ½”λ”© μž₯μΉ˜μ—μ„œ μˆ˜ν–‰λ˜λŠ” 것과 λ™μΌν•œ 예츑 κ²°κ³Όλ₯Ό 인코딩 μž₯μΉ˜μ—μ„œ λ„μΆœν•˜κΈ° μœ„ν•¨μ΄λ©°, 이λ₯Ό ν†΅ν•˜μ—¬ μ½”λ”© νš¨μœ¨μ„ 높일 수 있기 λ•Œλ¬Έμ΄λ‹€. 상기 볡원 ν”½μ²˜μ— 인루프 필터링 절차 등이 더 적용될 수 μžˆμŒμ€ μƒμˆ ν•œ 바와 κ°™λ‹€. Meanwhile, as described above, the encoding apparatus may generate a reconstructed picture (including the reconstructed samples and the reconstructed block) based on the reference samples and the residual samples. This is because the encoding apparatus derives the same prediction result as that performed in the decoding apparatus, and thus the coding efficiency can be increased. As described above, an in-loop filtering procedure may be further applied to the reconstructed picture.

도 10 및 도 11은 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 기반 λΉ„λ””μ˜€/μ˜μƒ λ””μ½”λ”© 방법 및 λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ λ””μ½”λ”© μž₯치 λ‚΄ 인트라 μ˜ˆμΈ‘λΆ€λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.10 and 11 are diagrams illustrating an intra prediction based video / image decoding method and an intra prediction unit in a decoding apparatus according to an embodiment of the present invention.

도 10 및 도 11을 μ°Έμ‘°ν•˜λ©΄, λ””μ½”λ”© μž₯μΉ˜λŠ” 상기 인코딩 μž₯μΉ˜μ—μ„œ μˆ˜ν–‰λœ λ™μž‘κ³Ό λŒ€μ‘λ˜λŠ” λ™μž‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. λ””μ½”λ”© μž₯μΉ˜λŠ” μˆ˜μ‹ λœ 예츑 정보λ₯Ό 기반으둜 ν˜„μž¬ 블둝에 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜κ³  예츑 μƒ˜ν”Œλ“€μ„ λ„μΆœν•  수 μžˆλ‹€.10 and 11, the decoding apparatus may perform an operation corresponding to the operation performed by the encoding apparatus. The decoding apparatus may perform prediction on the current block and derive prediction samples based on the received prediction information.

ꡬ체적으둜 λ””μ½”λ”© μž₯μΉ˜λŠ” μˆ˜μ‹ λœ 예츑 λͺ¨λ“œ 정보λ₯Ό 기반으둜 ν˜„μž¬ 블둝에 λŒ€ν•œ 인트라 예츑 λͺ¨λ“œλ₯Ό λ„μΆœν•  수 μžˆλ‹€(S1001). λ””μ½”λ”© μž₯μΉ˜λŠ” 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ λ„μΆœν•  수 μžˆλ‹€(S1002). λ””μ½”λ”© μž₯μΉ˜λŠ” 상기 인트라 예츑 λͺ¨λ“œ 및 상기 μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ 기반으둜 상기 ν˜„μž¬ 블둝 λ‚΄ 예츑 μƒ˜ν”Œλ“€μ„ μƒμ„±ν•œλ‹€(S1003). 이 경우 λ””μ½”λ”© μž₯μΉ˜λŠ” 예츑 μƒ˜ν”Œ 필터링 절차λ₯Ό μˆ˜ν–‰ν•  수 μžˆλ‹€. 예츑 μƒ˜ν”Œ 필터링은 포슀트 필터링이라 뢈릴 수 μžˆλ‹€. 상기 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨μ— μ˜ν•˜μ—¬ 상기 예츑 μƒ˜ν”Œλ“€ 쀑 일뢀 λ˜λŠ” μ „λΆ€κ°€ 필터링될 수 μžˆλ‹€. κ²½μš°μ— 따라 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨λŠ” μƒλž΅λ  수 μžˆλ‹€. In detail, the decoding apparatus may derive the intra prediction mode for the current block based on the received prediction mode information (S1001). The decoding apparatus may derive peripheral reference samples of the current block (S1002). The decoding apparatus generates prediction samples in the current block based on the intra prediction mode and the peripheral reference samples (S1003). In this case, the decoding apparatus may perform a prediction sample filtering procedure. Predictive sample filtering may be referred to as post filtering. Some or all of the prediction samples may be filtered by the prediction sample filtering procedure. In some cases, the prediction sample filtering procedure may be omitted.

λ””μ½”λ”© μž₯μΉ˜λŠ” μˆ˜μ‹ λœ λ ˆμ§€λ“€μ–Ό 정보λ₯Ό 기반으둜 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ„ μƒμ„±ν•œλ‹€(S1004). λ””μ½”λ”© μž₯μΉ˜λŠ” 상기 (ν•„ν„°λ§λœ) 예츑 μƒ˜ν”Œλ“€ 및 상기 λ ˆμ§€λ“€μ–Ό μƒ˜ν”Œλ“€μ„ 기반으둜 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 볡원 μƒ˜ν”Œλ“€μ„ μƒμ„±ν•˜κ³ , 이λ₯Ό 기반으둜 볡원 ν”½μ²˜λ₯Ό 생성할 수 μžˆλ‹€(S1005).The decoding apparatus generates residual samples for the current block based on the received residual information (S1004). The decoding apparatus may generate reconstructed samples for the current block based on the (filtered) prediction samples and the residual samples, and generate a reconstructed picture based on the (S1005).

μ—¬κΈ°μ„œ, λ””μ½”λ”© μž₯치의 인트라 μ˜ˆμΈ‘λΆ€(265)λŠ” 예츑 λͺ¨λ“œ κ²°μ •λΆ€(266), μ°Έμ‘° μƒ˜ν”Œ λ„μΆœλΆ€(267), 예츑 μƒ˜ν”Œ λ„μΆœλΆ€(268)λ₯Ό 포함할 수 있으며, 예츑 λͺ¨λ“œ κ²°μ •λΆ€(266)λŠ” 인코딩 μž₯치의 예츑 λͺ¨λ“œ κ²°μ •λΆ€(186)μ—μ„œ μˆ˜μ‹ λœ 예츑 λͺ¨λ“œ 정보λ₯Ό 기반으둜 상기 ν˜„μž¬ 블둝에 λŒ€ν•œ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•˜κ³ , μ°Έμ‘° μƒ˜ν”Œ λ„μΆœλΆ€(266)λŠ” 상기 ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ λ„μΆœν•˜κ³ , 예츑 μƒ˜ν”Œ λ„μΆœλΆ€(267)λŠ” 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œλ“€μ„ λ„μΆœν•  수 μžˆλ‹€. ν•œνŽΈ, 비둝 λ„μ‹œλ˜μ§€λŠ” μ•Šμ•˜μ§€λ§Œ, μƒμˆ ν•œ 예츑 μƒ˜ν”Œ 필터링 μ ˆμ°¨κ°€ μˆ˜ν–‰λ˜λŠ” 경우, 인트라 μ˜ˆμΈ‘λΆ€(265)λŠ” 예츑 μƒ˜ν”Œ ν•„ν„°λΆ€(λ―Έλ„μ‹œ)λ₯Ό 더 포함할 μˆ˜λ„ μžˆλ‹€.Here, the intra prediction unit 265 of the decoding apparatus may include a prediction mode determiner 266, a reference sample derivator 267, and a prediction sample derivator 268, and the prediction mode determiner 266 may be encoded. The intra prediction mode for the current block is determined based on the prediction mode information received by the prediction mode determiner 186 of the apparatus, and the reference sample derivator 266 derives the neighbor reference samples of the current block and predicts the prediction mode. The sample derivator 267 may derive the predictive samples of the current block. Although not shown, when the above-described prediction sample filtering procedure is performed, the intra prediction unit 265 may further include a prediction sample filter (not shown).

상기 예츑 λͺ¨λ“œ μ •λ³΄λŠ” MPM(most probable mode)κ°€ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ”μ§€ μ•„λ‹ˆλ©΄ 리메이닝 λͺ¨λ“œ(remaining mode)κ°€ μ μš©λ˜λŠ”μ§€ μ—¬λΆ€λ₯Ό λ‚˜νƒ€λ‚΄λŠ” ν”Œλž˜κ·Έ 정보(ex. prev_intra_luma_pred_flag)λ₯Ό 포함할 수 있고, 상기 MPM이 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 경우 상기 예츑 λͺ¨λ“œ μ •λ³΄λŠ” 상기 인트라 예츑 λͺ¨λ“œ 후보듀(MPM 후보듀) 쀑 ν•˜λ‚˜λ₯Ό κ°€λ¦¬ν‚€λŠ” 인덱슀 정보(ex. mpm_idx)λ₯Ό 더 포함할 수 μžˆλ‹€. 상기 인트라 예츑 λͺ¨λ“œ 후보듀(MPM 후보듀)은 MPM 후보 리슀트 λ˜λŠ” MPM 리슀트둜 ꡬ성될 수 μžˆλ‹€. λ˜ν•œ, 상기 MPM이 상기 ν˜„μž¬ 블둝에 μ μš©λ˜μ§€ μ•ŠλŠ” 경우, 상기 예츑 λͺ¨λ“œ μ •λ³΄λŠ” 상기 인트라 예츑 λͺ¨λ“œ 후보듀(MPM 후보듀)을 μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 인트라 예츑 λͺ¨λ“œλ“€ 쀑 ν•˜λ‚˜λ₯Ό κ°€λ¦¬ν‚€λŠ” 리메이닝 λͺ¨λ“œ 정보(ex. rem_inra_luma_pred_mode)λ₯Ό 더 포함할 수 μžˆλ‹€. λ””μ½”λ”© μž₯μΉ˜λŠ” 상기 예츑 λͺ¨λ“œ 정보λ₯Ό 기반으둜 상기 ν˜„μž¬ λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•  수 μžˆλ‹€. 상기 예츑 λͺ¨λ“œ μ •λ³΄λŠ” ν›„μˆ ν•˜λŠ” μ½”λ”© 방법을 ν†΅ν•˜μ—¬ 인코딩/디코딩될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 상기 예츑 λͺ¨λ“œ μ •λ³΄λŠ” truncated (rice) binary codeλ₯Ό 기반으둜 μ—”μ½”λ‘œν”Ό μ½”λ”©(ex. CABAC, CAVLC) 코딩을 ν†΅ν•˜μ—¬ 인코딩/디코딩될 수 μžˆλ‹€.The prediction mode information may include flag information (ex. Prev_intra_luma_pred_flag) indicating whether a most probable mode (MPM) is applied to the current block or a remaining mode is applied, and the MPM is the current When applied to a block, the prediction mode information may further include index information (ex. Mpm_idx) indicating one of the intra prediction mode candidates (MPM candidates). The intra prediction mode candidates (MPM candidates) may consist of an MPM candidate list or an MPM list. In addition, when the MPM is not applied to the current block, the prediction mode information further includes remaining mode information (ex. Rem_inra_luma_pred_mode) indicating one of the intra prediction modes except for the intra prediction mode candidates (MPM candidates). It may include. The decoding apparatus may determine the intra prediction mode of the current block based on the prediction mode information. The prediction mode information may be encoded / decoded through a coding method described below. For example, the prediction mode information may be encoded / decoded through encoding coding (ex. CABAC, CAVLC) based on truncated (rice) binary code.

인트라 예츑 λͺ¨λ“œ κ²°μ •Determine intra prediction mode

인트라 예츑이 μ μš©λ˜λŠ” 경우, μ£Όλ³€ λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œκ°€ 결정될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, λ””μ½”λ”© μž₯μΉ˜λŠ” ν˜„μž¬ λΈ”λ‘μ˜ 쒌츑 λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œ 및 상츑 λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œλ₯Ό 기반으둜 λ„μΆœλœ mpm(most probable mode) 후보듀 쀑 ν•˜λ‚˜λ₯Ό μˆ˜μ‹ λœ mpm 인덱슀λ₯Ό 기반으둜 선택할 수 있으며, λ˜λŠ” 상기 mpm 후보듀에 ν¬ν•¨λ˜μ§€ μ•Šμ€ λ‚˜λ¨Έμ§€ 인트라 예츑 λͺ¨λ“œλ“€ 쀑 ν•˜λ‚˜λ₯Ό 리메이닝 인트라 예츑 λͺ¨λ“œ 정보λ₯Ό 기반으둜 선택할 수 μžˆλ‹€. 상기 mpm μΈλ±μŠ€λŠ” mpm_idx μ‹ ν…μŠ€ μš”μ†Œμ˜ ν˜•νƒœλ‘œ μ‹œκ·Έλ„λ§λ  수 있고, 상기 리메이닝 인트라 예츑 λͺ¨λ“œ μ •λ³΄λŠ” rem_intra_luma_pred_mode μ‹ ν…μŠ€ μš”μ†Œμ˜ ν˜•νƒœλ‘œ μ‹œκ·Έλ„λ§λ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 상기 리메이닝 인트라 예츑 λͺ¨λ“œ μ •λ³΄λŠ” 전체 인트라 예츑 λͺ¨λ“œλ“€ 쀑 상기 mpm 후보듀에 ν¬ν•¨λ˜μ§€ μ•ŠλŠ” λ‚˜λ¨Έμ§€ 인트라 예츑 λͺ¨λ“œλ“€μ„ 예츑 λͺ¨λ“œ 번호 순으둜 μΈλ±μ‹±ν•˜μ—¬ κ·Έ 쀑 ν•˜λ‚˜λ₯Ό 가리킬 수 μžˆλ‹€.When intra prediction is applied, the intra prediction mode applied to the current block may be determined using the intra prediction mode of the neighboring block. For example, the decoding apparatus may select one of the most probable mode (mpm) candidates derived based on the intra prediction mode of the left block of the current block and the intra prediction mode of the upper block based on the received mpm index, or One of the remaining intra prediction modes not included in the mpm candidates may be selected based on the remaining intra prediction mode information. The mpm index may be signaled in the form of an mpm_idx syntax element, and the remaining intra prediction mode information may be signaled in the form of a rem_intra_luma_pred_mode syntax element. For example, the remaining intra prediction mode information may index remaining intra prediction modes not included in the mpm candidates among all intra prediction modes in order of prediction mode number to indicate one of them.

도 12 및 도 13은 λ³Έ 발λͺ…이 적용될 수 μžˆλŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯을 λ‚˜νƒ€λ‚΄λŠ” 도면이닀.12 and 13 illustrate a prediction direction of an intra prediction mode according to an embodiment to which the present invention may be applied.

도 12λ₯Ό μ°Έμ‘°ν•˜λ©΄, 인트라 예츑 λͺ¨λ“œλŠ” 2개의 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€κ³Ό 33개의 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€. 상기 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ ν”Œλž˜λ„ˆ(planar) 인트라 예츑 λͺ¨λ“œ 및 DC 인트라 예츑 λͺ¨λ“œλ₯Ό 포함할 수 있고, 상기 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ 2번 λ‚΄μ§€ 34번 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€. 상기 ν”Œλž˜λ„ˆ 인트라 예츑 λͺ¨λ“œλŠ” ν”Œλž˜λ„ˆ λͺ¨λ“œλΌκ³  뢈릴 수 있고, 상기 DC 인트라 예츑 λͺ¨λ“œλŠ” DC λͺ¨λ“œλΌκ³  뢈릴 수 μžˆλ‹€.Referring to FIG. 12, the intra prediction mode may include two non-directional intra prediction modes and 33 directional intra prediction modes. The non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 34 intra prediction modes. The planner intra prediction mode may be called a planner mode, and the DC intra prediction mode may be called a DC mode.

ν•œνŽΈ, μžμ—° μ˜μƒ(natural video)μ—μ„œ μ œμ‹œλœ μž„μ˜μ˜ 에지 λ°©ν–₯(edge direction)을 μΊ‘μ³ν•˜κΈ° μœ„ν•˜μ—¬, 상기 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλŠ” ν›„μˆ ν•˜λŠ” 도 13에 λ„μ‹œλœ 바와 같이 기쑴의 33κ°œμ—μ„œ 65개둜 ν™•μž₯될 수 μžˆλ‹€. 이 경우, 인트라 예츑 λͺ¨λ“œλŠ” 2개의 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€κ³Ό 65개의 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€. 상기 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ ν”Œλž˜λ„ˆ(planar) 인트라 예츑 λͺ¨λ“œ 및 DC 인트라 예츑 λͺ¨λ“œλ₯Ό 포함할 수 있고, 상기 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ 2번 λ‚΄μ§€ 66번 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€. ν™•μž₯된 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“  μ‚¬μ΄μ¦ˆμ˜ 블둝듀에 적용될 수 있고, 루마 μ„±λΆ„ 및 크둜마 μ„±λΆ„ λͺ¨λ‘μ— 적용될 수 μžˆλ‹€.Meanwhile, in order to capture an arbitrary edge direction presented in a natural video, the directional intra prediction mode may be extended from 33 to 65 as shown in FIG. 13. In this case, the intra prediction mode may include two non-directional intra prediction modes and 65 directional intra prediction modes. The non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 66 intra prediction modes. Extended Directional Intra Prediction It can be applied to blocks of all sizes and to both luma and chroma components.

λ˜λŠ”, 상기 인트라 예츑 λͺ¨λ“œλŠ” 2개의 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€κ³Ό 129개의 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€. 상기 λΉ„λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ ν”Œλž˜λ„ˆ(planar) 인트라 예츑 λͺ¨λ“œ 및 DC 인트라 예츑 λͺ¨λ“œλ₯Ό 포함할 수 있고, 상기 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œλ“€μ€ 2번 λ‚΄μ§€ 130번 인트라 예츑 λͺ¨λ“œλ“€μ„ 포함할 수 μžˆλ‹€.Alternatively, the intra prediction mode may include two non-directional intra prediction modes and 129 directional intra prediction modes. The non-directional intra prediction modes may include a planar intra prediction mode and a DC intra prediction mode, and the directional intra prediction modes may include 2 to 130 intra prediction modes.

인코딩 μž₯치/λ””μ½”λ”© μž₯치의 μ˜ˆμΈ‘λΆ€λŠ” ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 상기 ν˜„μž¬ λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œμ— λ”°λ₯Έ μ°Έμ‘° μƒ˜ν”Œμ„ λ„μΆœν•  수 있고, 상기 μ°Έμ‘° μƒ˜ν”Œμ„ 기반으둜 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ 생성할 수 μžˆλ‹€.The prediction unit of the encoding apparatus / decoding apparatus may derive a reference sample according to the intra prediction mode of the current block among neighbor reference samples of the current block, and generate a prediction sample of the current block based on the reference sample. .

예λ₯Ό λ“€μ–΄, ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€(neighboring) μ°Έμ‘° μƒ˜ν”Œλ“€μ˜ 평균(average) ν˜Ήμ€ μΈν„°ν΄λ ˆμ΄μ…˜(interpolation)을 기반으둜 예츑 μƒ˜ν”Œμ„ μœ λ„ν•  수 있고, (ii) ν˜„μž¬ λΈ”λ‘μ˜ μ£Όλ³€ μ°Έμ‘° μƒ˜ν”Œλ“€ 쀑 예츑 μƒ˜ν”Œμ— λŒ€ν•˜μ—¬ νŠΉμ • (예츑) λ°©ν–₯에 μ‘΄μž¬ν•˜λŠ” μ°Έμ‘° μƒ˜ν”Œμ„ 기반으둜 상기 예츑 μƒ˜ν”Œμ„ μœ λ„ν•  μˆ˜λ„ μžˆλ‹€. (i)의 κ²½μš°λŠ” λΉ„λ°©ν–₯μ„± λͺ¨λ“œ λ˜λŠ” 비각도 λͺ¨λ“œ, (ii)의 κ²½μš°λŠ” λ°©ν–₯μ„±(directional) λͺ¨λ“œ λ˜λŠ” 각도(angular) λͺ¨λ“œλΌκ³  뢈릴 수 μžˆλ‹€. λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 보닀 μ •ν™•ν•œ μ˜ˆμΈ‘μ„ μœ„ν•˜μ—¬ ν•˜λ‚˜ μ΄μƒμ˜ μ°Έμ‘° μƒ˜ν”Œ 라인을 인트라 μ˜ˆμΈ‘μ— μ΄μš©ν•˜λŠ” λ©€ν‹° μ°Έμ‘° μƒ˜ν”Œ 라인이 이용될 μˆ˜λ„ μžˆλ‹€.For example, the prediction sample may be derived based on the average or interpolation of neighboring reference samples of the current block, and (ii) specific to the prediction sample among the neighboring reference samples of the current block. The prediction sample may be derived based on a reference sample present in the (prediction) direction. In case of (i), it may be called non-directional mode or non-angle mode, and in case of (ii), it may be called directional mode or angular mode. Further, in one embodiment, multi-reference sample lines may be used that utilize one or more reference sample lines for intra prediction for more accurate prediction.

μ΄μƒμ—μ„œ μ„€λͺ…ν•œ 바와 같이, 인트라 μ˜ˆμΈ‘μ€ 블둝 λ‚΄λΆ€μ˜ μƒ˜ν”Œκ°„μ˜ 상관 관계λ₯Ό μ΄μš©ν•œλ‹€. κ·ΈλŸ¬λ‚˜, 예츑 μƒ˜ν”Œκ³Ό μ°Έμ‘° μƒ˜ν”Œκ°„ 거리가 증가함에 따라 상관 관계가 κ°μ†Œν•˜μ—¬ 예츑 μ˜€μ°¨κ°€ λ°œμƒν•  수 μžˆλ‹€.As described above, intra prediction uses correlation between samples within a block. However, as the distance between the predicted sample and the reference sample increases, the correlation may decrease, and a prediction error may occur.

λ”°λΌμ„œ, λ³Έ 발λͺ…μ—μ„œλŠ”, 이와 같은 예츑 였차λ₯Ό 쀄이고 μ••μΆ• μ„±λŠ₯을 ν–₯μƒμ‹œν‚€κΈ° μœ„ν•˜μ—¬, μ–‘λ°©ν–₯(bi-directional)의 μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜λŠ” 방법을 μ œμ•ˆν•œλ‹€. 특히, λ³Έ 발λͺ…μ—μ„œλŠ”, 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 의쑴적인 μ–‘λ°©ν–₯ 인트라 예츑 방법을 μ œμ•ˆν•œλ‹€.Accordingly, the present invention proposes a method of performing intra prediction using bi-directional reference samples in order to reduce such prediction error and improve compression performance. In particular, the present invention proposes a bidirectional intra prediction method that depends on the available reference samples.

μ •μ§€ μ˜μƒ 및 λΉ„λ””μ˜€μ˜ 인코딩/디코딩은 λΉ„νŠΈ 슀트림 λ˜λŠ” λ‹€λ₯Έ μœ ν˜•μ˜ 파일 ν˜•μ‹μ— λŒ€ν•˜μ—¬ 적용될 수 μžˆλ‹€. λΉ„νŠΈ 슀트림 및 νŒŒμΌμ€ λ””λ°”μ΄μŠ€ λ‚΄μ—μ„œ λ‹€μ–‘ν•œ μ’…λ₯˜μ˜ μ €μž₯ μž₯μΉ˜μ— μ €μž₯λ˜κ±°λ‚˜, μ…€λ£°λŸ¬ λ„€νŠΈμ›Œν¬, 인터넷 ν”„λ‘œν† μ½œ λ“±κ³Ό 같은 λ‹€μ–‘ν•œ λ„€νŠΈμ›Œν¬ ν™˜κ²½μ—μ„œ 슀트리밍될 수 μžˆλ‹€. λ””μŠ€ν”Œλ ˆμ΄κ°€ μžˆλŠ” μ΅œμ’… μ‚¬μš©μž λ””λ°”μ΄μŠ€λ‘œ μŠ€νŠΈλ¦¬λ°λ˜λŠ” 경우, 상기 λΉ„νŠΈ 슀트림 λ˜λŠ” νŒŒμΌμ€ λ””μ½”λ”© 및 μž¬μƒλ  수 μžˆλ‹€. λ³Έ 발λͺ…은 λΉ„νŠΈ 슀트림의 λ””μŠ€ν”Œλ ˆμ΄μ— 관계없이 인코더 및/λ˜λŠ” 디코더λ₯Ό κ°–λŠ” λͺ¨λ“  μž₯μΉ˜μ— 적용될 수 μžˆλ‹€.The encoding / decoding of still pictures and videos can be applied for bit streams or other types of file formats. Bit streams and files may be stored in various types of storage devices within the device, or streamed in various network environments such as cellular networks, Internet protocols, and the like. When streamed to an end user device with a display, the bit stream or file can be decoded and played. The invention can be applied to any device having an encoder and / or a decoder regardless of the display of the bit stream.

λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯΄λ©΄, μ°Έμ‘° μƒ˜ν”Œμ— 따라 인트라 예츑 λ°©ν–₯을 효율적으둜 μ‚¬μš©ν•¨μœΌλ‘œμ¨ 예츑 였차λ₯Ό 쀄이고, λΆ€ν˜Έν™” νš¨μœ¨μ„ ν–₯μƒμ‹œν‚¬ 수 μžˆλ‹€.According to the embodiment of the present invention, by effectively using the intra prediction direction according to the reference sample, the prediction error can be reduced and the coding efficiency can be improved.

μƒ˜ν”Œ 예츑 λ‹¨κ³„μ—μ„œ, 인코더/λ””μ½”λ”λŠ” μ˜μƒ λ‚΄ μ—£μ§€(edge)λ₯Ό 효과적으둜 μΊ‘μ³ν•˜κΈ° μœ„ν•˜μ—¬ 예츑 λ°©ν–₯을 따라 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. In the sample prediction step, the encoder / decoder may perform intra prediction along the prediction direction to effectively capture edges in the image.

도 14λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 각도λ₯Ό μ„€λͺ…ν•˜κΈ° μœ„ν•œ 도면이닀. 14 is a diagram for describing a prediction angle of an intra prediction mode according to an embodiment to which the present invention is applied.

인코더/λ””μ½”λ”λŠ” 도 14에 λ„μ‹œλœ 바와 같은 각도λ₯Ό κ°€μ§€λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ λ°©ν–₯μ„± μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 예츑 λͺ¨λ“œμ˜ 각도가 180 도(Β°)인 경우, ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ€ μˆ˜ν‰ λ°©ν–₯ 쒌츑 μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 생성될 수 μžˆλ‹€. λ˜λŠ”, 예λ₯Ό λ“€μ–΄, 예츑 λͺ¨λ“œμ˜ 각도가 270 도인 경우, ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ€ 수직 λ°©ν–₯ 상츑 μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 생성될 수 μžˆλ‹€.The encoder / decoder may perform directional prediction using an intra prediction mode having an angle as shown in FIG. 14. For example, when the angle of the prediction mode is 180 degrees, the prediction sample of the current block may be generated using the horizontal left sample. Or, for example, when the angle of the prediction mode is 270 degrees, the prediction sample of the current block may be generated using the vertical upper sample.

μ΄ν•˜ λ³Έ λͺ…μ„Έμ„œμ—μ„œλŠ”, 도 14에 λ„μ‹œλœ 각도λ₯Ό κΈ°μ€€μœΌλ‘œ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯을 μ„€λͺ…ν•˜λ„λ‘ ν•œλ‹€.Hereinafter, the prediction direction of the intra prediction mode will be described based on the angle shown in FIG. 14.

도 15λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.15 is a diagram illustrating a method of performing intra prediction using an available reference sample according to an embodiment to which the present invention is applied.

도 15μ—μ„œ, μ•žμ„œ μ„€λͺ…ν•œ 도 14에 λ„μ‹œλœ 각도λ₯Ό κΈ°μ€€μœΌλ‘œ 315 λ„μ˜ 각도λ₯Ό κ°€μ§€λŠ” 인트라 예츑 λͺ¨λ“œκ°€ ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 경우λ₯Ό κ°€μ •ν•œλ‹€. 음영 처리된 블둝듀은 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ λ‚˜νƒ€λ‚Έλ‹€. 인코더/λ””μ½”λ”λŠ” ν˜„μž¬ λΈ”λ‘μ˜ 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 따라 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ μ΄μš©ν•˜μ—¬ ν˜„μž¬ λΈ”λ‘μ˜ 예츑 블둝(λ˜λŠ” 예츑 μƒ˜ν”Œ)을 생성할 수 μžˆλ‹€.In FIG. 15, it is assumed that an intra prediction mode having an angle of 315 degrees based on the angle illustrated in FIG. 14 described above is applied to a current block. The shaded blocks represent reference samples around the current block. The encoder / decoder may generate a prediction block (or prediction sample) of the current block by using reference samples around the current block according to the prediction direction of the intra prediction mode of the current block.

도 15에 λ„μ‹œλœ 바와 같은 인트라 예츑 λͺ¨λ“œκ°€ μ μš©λ¨μ€ 상단 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯을 따라 ν˜„μž¬ 블둝 λ‚΄μ—μ„œ μ—£μ§€(edge)κ°€ μ‘΄μž¬ν•¨μ„ μ˜λ―Έν•œλ‹€. ν•œνŽΈ, 135 λ„μ˜ 각도, 즉, 315 λ„μ˜ λ°˜λŒ€ λ°©ν–₯의 인트라 예츑 λͺ¨λ“œκ°€ 적용되면, 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯을 따라 μ’Œλ‹¨ μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 상단 μ°Έμ‘° μƒ˜ν”ŒκΉŒμ§€ μ—£μ§€κ°€ μ‘΄μž¬ν•¨μ„ μ˜λ―Έν•œλ‹€.Application of the intra prediction mode as shown in FIG. 15 means that an edge exists in the current block along the prediction direction of the intra prediction mode from the upper reference sample. Meanwhile, when an intra prediction mode of 135 degrees, that is, an opposite direction of 315 degrees is applied, it means that an edge exists from the left reference sample to the upper reference sample along the prediction direction of the intra prediction mode.

μ΄ν•˜, λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ—μ„œλŠ” μ°Έμ‘° μƒ˜ν”Œ κ°€μš©μ„±μ— μ˜μ‘΄ν•˜λŠ” λ°©ν–₯μ„± 인트라 λͺ¨λ“œλ₯Ό μ œμ•ˆν•œλ‹€. Hereinafter, embodiments of the present invention propose a directional intra mode depending on the reference sample availability.

도 16 λ‚΄μ§€ 도 18은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 인트라 예츑 λͺ¨λ“œμ˜ λ°©ν–₯성을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.16 to 18 are diagrams illustrating the directionality of an intra prediction mode determined according to an available reference sample as an embodiment to which the present invention is applied.

도 16 λ‚΄μ§€ 도 18μ—μ„œ, μ–‘λ°©ν–₯ ν™”μ‚΄ν‘œλŠ” μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μ‚¬μš©ν•  수 μžˆμŒμ„ λ‚˜νƒ€λ‚΄κ³ , 음영 처리된 μ˜μ—­μ€ μ‚¬μš© κ°€λŠ₯ν•œ 예츑 각도(λ˜λŠ” 예츑 κ°λ„μ˜ λ²”μœ„)λ₯Ό λ‚˜νƒ€λ‚Έλ‹€. μ‹€μ‹œμ˜ˆλ‘œμ„œ, 인코더/λ””μ½”λ”λŠ” 음영 처리된 μ˜μ—­ λ‚΄μ—μ„œ 미리 μ •ν•΄μ§„ 개수의 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋을 ꡬ성(λ˜λŠ” 생성)ν•  수 μžˆλ‹€.In Figures 16-18, the double arrow indicates that bi-directional intra prediction is available, and the shaded area indicates the available prediction angle (or range of prediction angles). As an embodiment, the encoder / decoder may construct (or generate) an intra prediction mode set that includes a predetermined number of prediction modes in the shaded region.

λ‹€μ‹œ 말해, 인코더/λ””μ½”λ”λŠ” μ‚¬μš© κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 μ •μ˜λ˜λŠ” 예츑 각도 λ²”μœ„ λ‚΄μ—μ„œ 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 ꡬ성(λ˜λŠ” 생성)ν•  수 μžˆλ‹€. λ³Έ 발λͺ…μ—μ„œ, 상기 인트라 예츑 λͺ¨λ“œ 셋은 κ·Έ λͺ…칭에 μ œν•œλ˜μ§€ μ•ŠμœΌλ©°, 인트라 λͺ¨λ“œ μ…‹, 예츑 λͺ¨λ“œ μ…‹, 인트라 예츑 λͺ¨λ“œ κ·Έλ£Ή, 예츑 λͺ¨λ“œ κ·Έλ£Ή, 인트라 λͺ¨λ“œ κ·Έλ£Ή, 인트라 예츑 λͺ¨λ“œ 리슀트, 예츑 λͺ¨λ“œ 리슀트, 인트라 λͺ¨λ“œ 리슀트 λ“±μœΌλ‘œ 지칭될 μˆ˜λ„ μžˆλ‹€.In other words, the encoder / decoder may construct (or generate) an intra prediction mode set within a prediction angle range defined according to the available reference samples. In the present invention, the intra prediction mode set is not limited to its name, and the intra mode set, the prediction mode set, the intra prediction mode group, the prediction mode group, the intra mode group, the intra prediction mode list, the prediction mode list, the intra mode list Or the like.

ꡬ체적으둜, 도 16(a)에 λ„μ‹œλœ 바와 같이 상츑 μ°Έμ‘° μƒ˜ν”Œ 및 쒌츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 도 16(b)에 λ„μ‹œλœ 바와 같이 90 도 λ‚΄μ§€ 180 도 및/λ˜λŠ” 270 도 λ‚΄μ§€ 360 도 μ‚¬μ΄μ˜ 각도λ₯Ό κ°–λŠ” λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œκ°€ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€. 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 상츑 및 쒌츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 보닀 크고 180 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„(즉, 90<angle<=180) 및/λ˜λŠ” 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„(즉, 270<=angle<360) λ‚΄μ˜ 각도λ₯Ό κ°–λŠ” λ°©ν–₯μ„± 인트라 λͺ¨λ“œκ°€ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€.Specifically, if an upper reference sample and a left reference sample are available as shown in FIG. 16 (a), between 90 degrees and 180 degrees and / or 270 degrees and 360 degrees as shown in FIG. 16 (b). An directional intra prediction mode with angle may be used for bidirectional intra prediction. In one embodiment, when upper and left reference samples are available, an angle range greater than 90 degrees and less than or equal to 180 degrees (ie, 90 <angle <= 180) and / or greater than or equal to 270 degrees and less than 360 degrees Directional intra mode with angles within an angular range (ie, 270 <= angle <360) may be used for bidirectional intra prediction.

λ‹€μ‹œ 말해, 인코더/λ””μ½”λ”λŠ” 상츑 및 쒌츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 볡원 μƒ˜ν”Œλ‘œμ„œ 인트라 μ˜ˆμΈ‘μ— 이용 κ°€λŠ₯ν•œ 경우, μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ 90 도 λ‚΄μ§€ 180 도 및/λ˜λŠ” 270 도 λ‚΄μ§€ 360 도 μ‚¬μ΄μ˜ 각도 λ²”μœ„(λ˜λŠ” 90 도 보닀 크고 180 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ 및/λ˜λŠ” 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„) λ‚΄μ—μ„œ νŠΉμ • 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋을 ꡬ성할 수 μžˆλ‹€.In other words, the encoder / decoder has an angular range between 90 degrees and 180 degrees and / or 270 degrees and 360 degrees (or more than 90 degrees) for bidirectional intra prediction if the upper and left reference samples are available for intra prediction as reconstructed samples. Larger than less than or equal to 180 degrees and / or greater than or equal to 270 degrees and less than 360 degrees) to configure a set of intra prediction modes including a certain number of intra prediction modes.

인코더/λ””μ½”λ”λŠ” 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋에 κΈ°μ΄ˆν•˜μ—¬ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•˜κ³ , κ²°μ •λœ 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. μ΄λ•Œ, 인코더/λ””μ½”λ”λŠ” κ²°μ •λœ 인트라 예츑 λͺ¨λ“œμ— κΈ°μ΄ˆν•˜μ—¬, 쒌츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제1 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , 상츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , μœ λ„λœ 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ μ΅œμ’… 예츑 μƒ˜ν”Œμ„ 생성할 수 μžˆλ‹€. μ΅œμ’… 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 방법은 μ΄ν•˜ μžμ„Ένžˆ ν›„μˆ ν•œλ‹€.The encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample. The method of generating the final prediction sample is described in detail below.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 미리 μ •μ˜λœ 예츑 λͺ¨λ“œ ν…Œμ΄λΈ”μ— 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ΄ 맡핑될 수 μžˆλ‹€.In addition, in one embodiment, intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, νŠΉμ • 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” κ°λ„μ˜ 뢄할에 따라 λ‹€λ₯΄κ²Œ 결정될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 0λ„μ—μ„œ 90도 μ‚¬μ΄μ˜ κ°λ„λŠ” 각각 3 도 λ§ˆλ‹€ 뢄할될 수 있고, μ΄λ•Œ, 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” 0도 및 90도 각도λ₯Ό μ œμ™Έν•˜κ³  29개둜 결정될 수 μžˆλ‹€. λ‹€λ₯Έ 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, νŠΉμ • 각도 λ²”μœ„μ— λŒ€ν•œ λΉ„μ„ ν˜• 뢄할이 적용될 μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 첫 번째 인트라 예츑 λͺ¨λ“œ 및 두 번째 인트라 예츑 λͺ¨λ“œλŠ” 각각 2도 및 5λ„μ˜ 각도λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.In addition, in one embodiment, the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles. As another example, nonlinear splitting for a particular angular range may be applied. For example, the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.

도 17을 μ°Έμ‘°ν•˜λ©΄, 도 17(a)에 λ„μ‹œλœ 바와 같이, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ 이용 κ°€λŠ₯ν•œ 경우λ₯Ό κ°€μ •ν•œλ‹€. 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ 이용 κ°€λŠ₯ν•œ 경우, 도 17(b)에 λ„μ‹œλœ 바와 같이, 0 도 λ‚΄μ§€ 90 도 및/λ˜λŠ” 180 도 λ‚΄μ§€ 270 도 μ‚¬μ΄μ˜ 각도λ₯Ό κ°–λŠ” λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œκ°€ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€. 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„(즉, 0=<angle<90) 및/λ˜λŠ” 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„(즉, 180<angle<=270) λ‚΄μ˜ 각도λ₯Ό κ°–λŠ” λ°©ν–₯μ„± 인트라 λͺ¨λ“œκ°€ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€. Referring to FIG. 17, it is assumed that right and upper reference samples are available, as shown in FIG. 17A. If right and top reference samples are available, as shown in Fig. 17 (b), a directional intra prediction mode with an angle between 0 degrees and 90 degrees and / or 180 degrees and 270 degrees may be used for bidirectional intra prediction. Can be. In one embodiment, when right and top reference samples are available, an angle range greater than or equal to 0 degrees and less than 90 degrees (ie, 0 = <angle <90) and / or greater than 180 degrees and less than or equal to 270 degrees Directional intra mode with angles within an angular range (ie, 180 <angle <= 270) may be used for bidirectional intra prediction.

λ‹€μ‹œ 말해, 인코더/λ””μ½”λ”λŠ” 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 볡원 μƒ˜ν”Œλ‘œμ„œ 인트라 μ˜ˆμΈ‘μ— 이용 κ°€λŠ₯ν•œ 경우, μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ 0 도 λ‚΄μ§€ 90도 및/λ˜λŠ” 180 도 λ‚΄μ§€ 270 도 μ‚¬μ΄μ˜ 각도 λ²”μœ„(λ˜λŠ” 0도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„ 및/λ˜λŠ” 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„) λ‚΄μ—μ„œ νŠΉμ • 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋을 ꡬ성할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μž„μ˜μ˜ μ½”λ”© μˆœμ„œ(arbitrary coding order) λ˜λŠ” μš°μΈ‘μ—μ„œ 쒌츑으둜 μ½”λ”© μˆœμ„œ(λ˜λŠ” μŠ€μΊ” μˆœμ„œ)κ°€ μ μš©λ˜λŠ” 경우, ν˜„μž¬ λΈ”λ‘μ˜ 우츑 및 상츑 μƒ˜ν”Œμ΄ 볡원 μƒ˜ν”Œλ‘œμ„œ μ˜ˆμΈ‘μ— 이용 κ°€λŠ₯ν•  수 μžˆλ‹€.In other words, the encoder / decoder has an angular range between 0 degrees and 90 degrees and / or 180 degrees and 270 degrees (or more than 0 degrees) for bidirectional intra prediction if right and upper reference samples are available for intra prediction as reconstructed samples. Greater than or equal to less than 90 degrees and / or greater than 180 degrees and less than or equal to 270 degrees) to configure a set of intra prediction modes comprising a certain number of intra prediction modes. For example, if an arbitrary coding order or coding order (or scan order) is applied from right to left, the right and top samples of the current block may be available for prediction as reconstructed samples.

인코더/λ””μ½”λ”λŠ” 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋에 κΈ°μ΄ˆν•˜μ—¬ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•˜κ³ , κ²°μ •λœ 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. μ΄λ•Œ, 인코더/λ””μ½”λ”λŠ” κ²°μ •λœ 인트라 예츑 λͺ¨λ“œμ— κΈ°μ΄ˆν•˜μ—¬, 쒌츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제1 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , 상츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , μœ λ„λœ 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ μ΅œμ’… 예츑 μƒ˜ν”Œμ„ 생성할 수 μžˆλ‹€.The encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample.

도 17(a)μ—μ„œ, μ’ŒμƒμΈ‘μ˜ 점선 처리된 μ°Έμ‘° μƒ˜ν”Œμ€ 예츑 λ°©ν–₯의 κ°λ„λ‘œ 인해 인트라 μ˜ˆμΈ‘μ— 더 λ§Žμ€ μ°Έμ‘° μƒ˜ν”Œμ΄ ν•„μš”ν•œ 경우λ₯Ό λ‚˜νƒ€λ‚Έλ‹€. 일 μ‹€μ‹œμ˜ˆμ—μ„œ, ν•΄λ‹Ή μœ„μΉ˜μ˜ μ°Έμ‘° μƒ˜ν”Œ(즉, 점선 처리된 μ°Έμ‘° μƒ˜ν”Œ)은 κ°€μž₯ κ·Όμ ‘ν•œ μœ„μΉ˜μ˜ μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ νŒ¨λ”©λ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μš°ν•˜ν–₯ λŒ€κ°μ„  λ°©ν–₯의 예츑 λͺ¨λ“œλ₯Ό μœ„ν•΄ μ’ŒμƒμΈ‘ 두 개의 μ°Έμ‘° μƒ˜ν”Œμ΄ μΈμ ‘ν•œ μ°Έμ‘° μƒ˜ν”Œμ„ μ΄μš©ν•˜μ—¬ νŒ¨λ”©λ  수 μžˆλ‹€.In FIG. 17A, the dotted upper left reference sample represents a case where more reference samples are required for intra prediction due to the angle of the prediction direction. In one embodiment, the reference sample at that location (ie, the dotted reference sample) may be padded using the reference sample at the nearest location. For example, two upper left reference samples may be padded using adjacent reference samples for the prediction mode in the right downward direction.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 미리 μ •μ˜λœ 예츑 λͺ¨λ“œ ν…Œμ΄λΈ”μ— 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ΄ 맡핑될 수 μžˆλ‹€.In addition, in one embodiment, intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, νŠΉμ • 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” κ°λ„μ˜ 뢄할에 따라 λ‹€λ₯΄κ²Œ 결정될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 0λ„μ—μ„œ 90도 μ‚¬μ΄μ˜ κ°λ„λŠ” 각각 3 도 λ§ˆλ‹€ 뢄할될 수 있고, μ΄λ•Œ, 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” 0도 및 90도 각도λ₯Ό μ œμ™Έν•˜κ³  29개둜 결정될 수 μžˆλ‹€. λ‹€λ₯Έ 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, νŠΉμ • 각도 λ²”μœ„μ— λŒ€ν•œ λΉ„μ„ ν˜• 뢄할이 적용될 μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 첫 번째 인트라 예츑 λͺ¨λ“œ 및 두 번째 인트라 예츑 λͺ¨λ“œλŠ” 각각 2도 및 5λ„μ˜ 각도λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.In addition, in one embodiment, the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles. As another example, nonlinear splitting for a particular angular range may be applied. For example, the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.

도 18을 μ°Έμ‘°ν•˜λ©΄, 도 18(a)에 λ„μ‹œλœ 바와 같이, 쒌츑, 상츑 및 우츑 μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ 이용 κ°€λŠ₯ν•œ 경우λ₯Ό κ°€μ •ν•œλ‹€. 쒌츑, 상츑 및 우츑 μ°Έμ‘° μƒ˜ν”Œλ“€μ΄ 이용 κ°€λŠ₯ν•œ 경우, 도 18(b)에 λ„μ‹œλœ 바와 같이, 90 도λ₯Ό μ œμ™Έν•œ λͺ¨λ“  λ°©ν–₯의 λ°©ν–₯μ„± 인트라 예츑 λͺ¨λ“œκ°€ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€.Referring to FIG. 18, it is assumed that left, top and right reference samples are available, as shown in FIG. 18A. If left, top and right reference samples are available, as shown in FIG. 18B, the directional intra prediction mode in all directions except 90 degrees may be used for bidirectional intra prediction.

λ‹€μ‹œ 말해, 인코더/λ””μ½”λ”λŠ” 쒌츑, 상츑 및 우츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 볡원 μƒ˜ν”Œλ‘œμ„œ 인트라 μ˜ˆμΈ‘μ— 이용 κ°€λŠ₯ν•œ 경우, μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μœ„ν•΄ 90 도 μ œμ™Έν•œ λͺ¨λ“  각도 λ²”μœ„ λ‚΄μ—μ„œ νŠΉμ • 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋을 ꡬ성할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, μž„μ˜μ˜ μ½”λ”© μˆœμ„œ(arbitrary coding order) λ˜λŠ” μš°μΈ‘μ—μ„œ 쒌츑으둜 μ½”λ”© μˆœμ„œ(λ˜λŠ” μŠ€μΊ” μˆœμ„œ)κ°€ μ μš©λ˜λŠ” 경우, ν˜„μž¬ λΈ”λ‘μ˜ 쒌츑, 상츑 및 우츑 μƒ˜ν”Œμ΄ 볡원 μƒ˜ν”Œλ‘œμ„œ μ˜ˆμΈ‘μ— 이용 κ°€λŠ₯ν•  수 μžˆλ‹€.In other words, the encoder / decoder includes an intra prediction mode that includes a certain number of intra prediction modes within all angular ranges except 90 degrees for bidirectional intra prediction, if left, top and right reference samples are available for intra prediction as reconstructed samples. You can configure a set. For example, if an arbitrary coding order or coding order (or scan order) is applied from right to left, the left, top and right samples of the current block may be available for prediction as reconstructed samples.

인코더/λ””μ½”λ”λŠ” 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 인트라 예츑 λͺ¨λ“œ 셋에 κΈ°μ΄ˆν•˜μ—¬ 인트라 예츑 λͺ¨λ“œλ₯Ό κ²°μ •ν•˜κ³ , κ²°μ •λœ 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•  수 μžˆλ‹€. μ΄λ•Œ, 인코더/λ””μ½”λ”λŠ” κ²°μ •λœ 인트라 예츑 λͺ¨λ“œμ— κΈ°μ΄ˆν•˜μ—¬, 쒌츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제1 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , 상츑 μ°Έμ‘° μƒ˜ν”Œλ‘œλΆ€ν„° 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜κ³ , μœ λ„λœ 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ μ΅œμ’… 예츑 μƒ˜ν”Œμ„ 생성할 수 μžˆλ‹€.The encoder / decoder may determine the intra prediction mode based on the set of intra prediction modes determined according to the available reference samples, and perform bidirectional intra prediction using the determined intra prediction mode. At this time, the encoder / decoder derives the first reference sample from the left reference sample, derives the second reference sample from the upper reference sample, and derives the derived first reference sample and the second reference sample based on the determined intra prediction mode. Can be weighted to produce the final predicted sample.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, 미리 μ •μ˜λœ 예츑 λͺ¨λ“œ ν…Œμ΄λΈ”μ— 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œμ— 따라 κ²°μ •λ˜λŠ” 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ΄ 맡핑될 수 μžˆλ‹€.In addition, in one embodiment, intra prediction modes within an angular range determined according to reference samples available to the predefined prediction mode table may be mapped.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, νŠΉμ • 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” κ°λ„μ˜ 뢄할에 따라 λ‹€λ₯΄κ²Œ 결정될 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 0λ„μ—μ„œ 90도 μ‚¬μ΄μ˜ κ°λ„λŠ” 각각 3 도 λ§ˆλ‹€ 뢄할될 수 있고, μ΄λ•Œ, 인트라 예츑 λͺ¨λ“œμ˜ μˆ˜λŠ” 0도 및 90도 각도λ₯Ό μ œμ™Έν•˜κ³  29개둜 결정될 수 μžˆλ‹€. λ‹€λ₯Έ 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, νŠΉμ • 각도 λ²”μœ„μ— λŒ€ν•œ λΉ„μ„ ν˜• 뢄할이 적용될 μˆ˜λ„ μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 첫 번째 인트라 예츑 λͺ¨λ“œ 및 두 번째 인트라 예츑 λͺ¨λ“œλŠ” 각각 2도 및 5λ„μ˜ 각도λ₯Ό κ°€μ§ˆ 수 μžˆλ‹€.In addition, in one embodiment, the number of intra prediction modes within a specific angle range may be determined differently according to the division of the angle. For example, angles between 0 degrees and 90 degrees may be divided every 3 degrees, and in this case, the number of intra prediction modes may be determined as 29 except for 0 degrees and 90 degrees angles. As another example, nonlinear splitting for a particular angular range may be applied. For example, the first intra prediction mode and the second intra prediction mode may have angles of 2 degrees and 5 degrees, respectively.

μ΄ν•˜μ—μ„œ, λ³Έ 발λͺ…μ˜ 일 μ‹€μ‹œμ˜ˆμ—μ„œλŠ”, μ•žμ„œ μ‹€μ‹œμ˜ˆ 2μ—μ„œ μ„€λͺ…ν•œ μ°Έμ‘° μƒ˜ν”Œ 의쑴적인 인트라 예츑 λͺ¨λ“œλ₯Ό μ΄μš©ν•˜μ—¬ μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ μˆ˜ν–‰ν•˜λŠ” 방법을 μ œμ•ˆν•œλ‹€. Hereinafter, in an embodiment of the present invention, a method of performing bidirectional intra prediction using the reference sample dependent intra prediction mode described in Embodiment 2 is proposed.

도 19λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 일 μ‹€μ‹œμ˜ˆλ‘œμ„œ, μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ„ 톡해 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 도면이닀.19 is a diagram illustrating a method of generating a predictive sample through bidirectional intra prediction as an embodiment to which the present invention is applied.

도 19λ₯Ό μ°Έμ‘°ν•˜λ©΄, μ•žμ„œ μ„€λͺ…ν•œ 도 16κ³Ό 같이 μ°Έμ‘° μƒ˜ν”Œ 의쑴적인 인트라 예츑 λͺ¨λ“œκ°€ 적용되고, 상츑 및 쒌츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우λ₯Ό κ°€μ •ν•œλ‹€. 그리고, 인트라 예츑 λͺ¨λ“œμ˜ κ°λ„λŠ” 300 도인 경우λ₯Ό κ°€μ •ν•œλ‹€. Referring to FIG. 19, it is assumed that a reference sample dependent intra prediction mode is applied as in FIG. 16 and the upper and left reference samples are available. In addition, it is assumed that the angle of the intra prediction mode is 300 degrees.

λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ—μ„œ, 인코더/λ””μ½”λ”λŠ” 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” μ–‘λ°©ν–₯ μ°Έμ‘° μƒ˜ν”Œ(제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œ)κ³Ό ν˜„μž¬ μƒ˜ν”Œκ°„ 거리 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ μ°Έμ‘° μƒ˜ν”Œλ“€μ„ κ°€μ€‘ν•©ν•˜μ—¬ 예츑 μƒ˜ν”Œμ„ 생성(λ˜λŠ” μœ λ„)ν•  수 μžˆλ‹€.In an embodiment of the present invention, the encoder / decoder predicts a prediction sample by weighting reference samples based on a distance ratio between a bidirectional reference sample (first reference sample and a second reference sample) and a current sample determined according to the prediction direction of the prediction mode. Can be generated (or derived).

μ΄λ•Œ, 인트라 예츑 λͺ¨λ“œμ˜ λ°©ν–₯성에 따라 [2,2] μœ„μΉ˜μ˜ 예츑 μƒ˜ν”Œ P1λ₯Ό μœ„ν•œ μ°Έμ‘° μƒ˜ν”Œλ‘œμ„œ A μ°Έμ‘° μƒ˜ν”Œ 및 C μ°Έμ‘° μƒ˜ν”Œμ΄ 이용(λ˜λŠ” 선택, κ²°μ •)될 수 μžˆλ‹€. 이 경우, 예츑 μƒ˜ν”Œ P1은 A μ°Έμ‘° μƒ˜ν”Œ 및 C μ°Έμ‘° μƒ˜ν”Œμ˜ 가쀑 평균에 μ˜ν•΄ 생성(λ˜λŠ” μœ λ„, 계산)될 수 μžˆλ‹€.In this case, the A reference sample and the C reference sample may be used (or selected or determined) as reference samples for the prediction sample P1 at the position [2, 2] according to the direction of the intra prediction mode. In this case, the prediction sample P1 may be generated (or derived, calculated) by the weighted average of the A reference sample and the C reference sample.

Figure PCTKR2019004390-appb-img-000002
Figure PCTKR2019004390-appb-img-000002

μˆ˜ν•™μ‹ 1μ—μ„œ, d_top은 상츑 μ°Έμ‘° μƒ˜ν”Œ 배열에 μœ„μΉ˜ν•œ A μ°Έμ‘° μƒ˜ν”Œκ³Ό P1κ°„ 거리λ₯Ό λ‚˜νƒ€λ‚΄λ©°, d_leftλŠ” 쒌츑 μ°Έμ‘° μƒ˜ν”Œ 배열에 μœ„μΉ˜ν•œ C μ°Έμ‘° μƒ˜ν”Œκ³Ό P1κ°„ 거리λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.In Equation 1, d_top represents the distance between the A reference sample located in the upper reference sample array and P1, and d_left represents the distance between the C reference sample located in the left reference sample array and P1.

일 μ‹€μ‹œμ˜ˆμ—μ„œ, λ°˜λŒ€ 각도가 300 도인 160λ„μ˜ 경우, λ°©ν–₯μ„± 인트라 λͺ¨λ“œκ°€ 쒌츑 μ°Έμ‘° μƒ˜ν”ŒλΆ€ν„° 상츑 μ°Έμ‘° μƒ˜ν”ŒκΉŒμ§€ μ‹œμž‘λ˜κΈ° λ•Œλ¬Έμ— d_top 및 d_leftκ°€ μ„œλ‘œ μ „ν™˜λ  수 μžˆλ‹€. In one embodiment, for 160 degrees with an opposite angle of 300 degrees, d_top and d_left may be switched with each other because the directional intra mode starts from the left reference sample to the upper reference sample.

λ§ˆμ°¬κ°€μ§€λ‘œ, 도 17 및 도 18의 κ²½μš°μ—λ„ λ™μΌν•˜κ²Œ μƒμˆ ν•œ μ–‘λ°©ν–₯ 인트라 예츑 방법이 적용될 수 μžˆλ‹€.Likewise, in the case of FIGS. 17 and 18, the above-described bidirectional intra prediction method may be applied.

λ˜ν•œ, 일 μ‹€μ‹œμ˜ˆμ—μ„œ, A와 C의 μœ„μΉ˜λŠ” μ •μˆ˜ μœ„μΉ˜κ°€ μ•„λ‹Œ λΆ„μˆ˜ μœ„μΉ˜μΌ 수 μžˆλ‹€. 이 경우, μ •μˆ˜ μœ„μΉ˜μ˜ μ°Έμ‘° μƒ˜ν”Œμ„ 기반으둜 보간(interpolation)을 μˆ˜ν–‰ν•¨μœΌλ‘œμ¨ ν•΄λ‹Ή λΆ„μˆ˜ μœ„μΉ˜μ˜ μƒ˜ν”Œ 값이 μœ λ„λ  수 μžˆλ‹€. λ˜ν•œ, κ΅¬ν˜„μ˜ 편의λ₯Ό μœ„ν•΄ 뢀동 μ†Œμˆ˜μ  μœ„μΉ˜ 1/(d_left + d_top)의 λΉ„μœ¨μ€ μ •μˆ˜ μœ„μΉ˜μ˜ λΉ„μœ¨λ‘œ 반올림될 수 μžˆλ‹€.Also, in one embodiment, the positions of A and C may be fractional positions rather than integer positions. In this case, the sample value of the corresponding fractional position may be derived by performing interpolation based on the reference sample of the integer position. Also, for convenience of implementation, the ratio of floating point position 1 / (d_left + d_top) may be rounded to the ratio of integer positions.

μ΄μƒμ—μ„œ μ„€λͺ…ν•œ λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆλ“€μ€ 각각 λ…λ¦½μ μœΌλ‘œ κ΅¬ν˜„λ  μˆ˜λ„ 있고, ν•˜λ‚˜ μ΄μƒμ˜ μ‹€μ‹œμ˜ˆκ°€ μ‘°ν•©λ˜μ–΄ κ΅¬ν˜„λ  μˆ˜λ„ μžˆλ‹€.Embodiments of the present invention described above may be implemented independently, or one or more embodiments may be implemented in combination.

도 20은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 블둝을 μƒμ„±ν•˜λŠ” 방법을 μ˜ˆμ‹œν•˜λŠ” 흐름도이닀.20 is a flowchart illustrating a method of generating an intra prediction block according to an embodiment to which the present invention is applied.

도 20을 μ°Έμ‘°ν•˜λ©΄, μ„€λͺ…μ˜ 편의λ₯Ό μœ„ν•΄ 디코더λ₯Ό μœ„μ£Όλ‘œ μ„€λͺ…ν•˜λ‚˜ λ³Έ 발λͺ…이 이에 ν•œμ •λ˜λŠ” 것이 μ•„λ‹ˆλ©°, λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 블둝 생성 방법은 인코더와 λ””μ½”λ”μ—μ„œ λ™μΌν•˜κ²Œ μˆ˜ν–‰λ  수 μžˆλ‹€. Referring to FIG. 20, a decoder is mainly described for convenience of description, but the present invention is not limited thereto, and the method of generating an intra prediction block according to the embodiment of the present invention may be performed in the same manner in the encoder and the decoder.

λ””μ½”λ”λŠ” ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•œλ‹€(S2001).The decoder is configured to use an intra prediction mode set used for the bidirectional intra prediction based on available reference samples around the current block when bi-directional intra prediction is applied to the current block. (S2001).

λ””μ½”λ”λŠ” 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•œλ‹€(S2002).The decoder parses a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set (S2002).

λ””μ½”λ”λŠ” 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•œλ‹€(S2003).The decoder derives a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode (S2003).

λ””μ½”λ”λŠ” 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•œλ‹€(S2004).The decoder weights the first reference sample and the second reference sample to generate a prediction sample of the current block (S2004).

μ‹€μ‹œμ˜ˆλ‘œμ„œ, μ „μˆ ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.In an embodiment, as described above, the intra prediction mode set may be configured to include a predefined number of intra prediction modes within a specific angular range determined according to the available direction of the reference sample.

μ•žμ„œ 도 16μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도뢀터 180 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ 및 270 도뢀터 360 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 16, the intra prediction mode set is intra within an angle range of 90 degrees to 180 degrees and an angle range of 270 degrees to 360 degrees when left and upper reference samples around the current block are available. It may be configured to include prediction modes.

μ•žμ„œ 도 17μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도뢀터 90 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ 및 180 도뢀터 270 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 17, the intra prediction mode set is intra within an angle range of 0 degrees to 90 degrees and an angle range of 180 degrees to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include prediction modes.

μ•žμ„œ 도 18μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 및 270 도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 18, the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees and 270 degrees when left, right and top reference samples around the current block are available. Can be.

λ˜ν•œ, μ „μˆ ν•œ 바와 같이, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ 결정될 수 μžˆλ‹€. 일 μ˜ˆλ‘œμ„œ, μ•žμ„œ 도 19 및 μˆ˜ν•™μ‹ 1μ—μ„œ μ„€λͺ…ν•œ 방법이 적용될 수 μžˆλ‹€.In addition, as described above, the weights applied to the first reference sample and the second reference sample, respectively, are the distance between the current sample and the first reference sample in the current block and the distance between the current sample and the second reference sample. It can be determined based on the ratio of. As an example, the method described above with reference to FIG. 19 and Equation 1 may be applied.

도 21은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆμ— λ”°λ₯Έ 인트라 예츑 μž₯치λ₯Ό μ˜ˆμ‹œν•˜λŠ” 도면이닀.21 is a diagram illustrating an intra prediction apparatus according to an embodiment to which the present invention is applied.

도 21μ—μ„œλŠ” μ„€λͺ…μ˜ 편의λ₯Ό μœ„ν•΄ 인트라 μ˜ˆμΈ‘λΆ€λ₯Ό ν•˜λ‚˜μ˜ λΈ”λ‘μœΌλ‘œ λ„μ‹œν•˜μ˜€μœΌλ‚˜, 인트라 μ˜ˆμΈ‘λΆ€λŠ” 인코더 및/λ˜λŠ” 디코더에 ν¬ν•¨λ˜λŠ” κ΅¬μ„±μœΌλ‘œ κ΅¬ν˜„λ  수 μžˆλ‹€.In FIG. 21, for convenience of description, the intra predictor is illustrated as one block, but the intra predictor may be implemented in a configuration included in the encoder and / or the decoder.

도 21을 μ°Έμ‘°ν•˜λ©΄, 인트라 μ˜ˆμΈ‘λΆ€λŠ” μ•žμ„œ 도 8λ‚΄μ§€ 도 20μ—μ„œ μ œμ•ˆλœ κΈ°λŠ₯, κ³Όμ • 및/λ˜λŠ” 방법을 κ΅¬ν˜„ν•œλ‹€. ꡬ체적으둜, 인트라 μ˜ˆμΈ‘λΆ€λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹ ꡬ성뢀(2101), 예츑 λͺ¨λ“œ 인덱슀 νŒŒμ‹±λΆ€(2102), μ°Έμ‘° μƒ˜ν”Œ μœ λ„λΆ€(2103) 및 예츑 μƒ˜ν”Œ 생성뢀(2104)λ₯Ό ν¬ν•¨ν•˜μ—¬ ꡬ성될 수 μžˆλ‹€.Referring to FIG. 21, the intra predictor implements the functions, processes, and / or methods proposed in FIGS. 8 to 20. In detail, the intra prediction unit may include an intra prediction mode set configuration unit 2101, a prediction mode index parsing unit 2102, a reference sample derivation unit 2103, and a prediction sample generation unit 2104.

인트라 예츑 λͺ¨λ“œ μ…‹ ꡬ성뢀(2101)λŠ” ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•œλ‹€.The intra prediction mode set configuration unit 2101 performs intra prediction used for the bidirectional intra prediction based on the available reference samples around the current block when bi-directional intra prediction is applied to the current block. Configure an intra prediction mode set.

예츑 λͺ¨λ“œ 인덱슀 νŒŒμ‹±λΆ€(2102)λŠ” 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•œλ‹€.A prediction mode index parser 2102 parses a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set.

μ°Έμ‘° μƒ˜ν”Œ μœ λ„λΆ€(2103)λŠ” 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•œλ‹€.The reference sample derivator 2103 derives a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode.

예츑 μƒ˜ν”Œ 생성뢀(2104)λŠ” 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•œλ‹€.The prediction sample generator 2104 weights the first reference sample and the second reference sample to generate a prediction sample of the current block.

μ‹€μ‹œμ˜ˆλ‘œμ„œ, μ „μˆ ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.In an embodiment, as described above, the intra prediction mode set may be configured to include a predefined number of intra prediction modes within a specific angular range determined according to the available direction of the reference sample.

μ•žμ„œ 도 16μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도뢀터 180 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ 및 270 도뢀터 360 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 16, the intra prediction mode set is intra within an angle range of 90 degrees to 180 degrees and an angle range of 270 degrees to 360 degrees when left and upper reference samples around the current block are available. It may be configured to include prediction modes.

μ•žμ„œ 도 17μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도뢀터 90 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ 및 180 도뢀터 270 λ„κΉŒμ§€μ˜ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 17, the intra prediction mode set is intra within an angle range of 0 degrees to 90 degrees and an angle range of 180 degrees to 270 degrees when right and upper reference samples around the current block are available. It may be configured to include prediction modes.

μ•žμ„œ 도 18μ—μ„œ μ„€λͺ…ν•œ 바와 같이, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 및 270 도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ ꡬ성될 수 μžˆλ‹€.As described above with reference to FIG. 18, the intra prediction mode set may be configured to include intra prediction modes within the remaining angular range except for 90 degrees and 270 degrees when left, right and top reference samples around the current block are available. Can be.

λ˜ν•œ, μ „μˆ ν•œ 바와 같이, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ 결정될 수 μžˆλ‹€. 일 μ˜ˆλ‘œμ„œ, μ•žμ„œ 도 19 및 μˆ˜ν•™μ‹ 1μ—μ„œ μ„€λͺ…ν•œ 방법이 적용될 수 μžˆλ‹€.In addition, as described above, the weights applied to the first reference sample and the second reference sample, respectively, are the distance between the current sample and the first reference sample in the current block and the distance between the current sample and the second reference sample. It can be determined based on the ratio of. As an example, the method described above with reference to FIG. 19 and Equation 1 may be applied.

도 22λŠ” λ³Έ 발λͺ…이 μ μš©λ˜λŠ” λΉ„λ””μ˜€ μ½”λ”© μ‹œμŠ€ν…œμ„ λ‚˜νƒ€λ‚Έλ‹€.22 shows a video coding system to which the present invention is applied.

λΉ„λ””μ˜€ μ½”λ”© μ‹œμŠ€ν…œμ€ μ†ŒμŠ€ λ””λ°”μ΄μŠ€(source device) 및 μˆ˜μ‹  λ””λ°”μ΄μŠ€(receiving device)λ₯Ό 포함할 수 μžˆλ‹€. μ†ŒμŠ€ λ””λ°”μ΄μŠ€λŠ” μΈμ½”λ”©λœ λΉ„λ””μ˜€/μ˜μƒ 정보 λ˜λŠ” 데이터λ₯Ό 파일 λ˜λŠ” 슀트리밍 ν˜•νƒœλ‘œ λ””μ§€ν„Έ μ €μž₯맀체 λ˜λŠ” λ„€νŠΈμ›Œν¬λ₯Ό ν†΅ν•˜μ—¬ μˆ˜μ‹  λ””λ°”μ΄μŠ€λ‘œ 전달할 수 μžˆλ‹€. The video coding system can include a source device and a receiving device. The source device may deliver the encoded video / image information or data to a receiving device through a digital storage medium or network in a file or streaming form.

상기 μ†ŒμŠ€ λ””λ°”μ΄μŠ€λŠ” λΉ„λ””μ˜€ μ†ŒμŠ€(video source), 인코딩 μž₯치(encoding apparatus), 전솑뢀(transmitter)λ₯Ό 포함할 수 μžˆλ‹€. 상기 μˆ˜μ‹  λ””λ°”μ΄μŠ€λŠ” μˆ˜μ‹ λΆ€(receiver), λ””μ½”λ”© μž₯치(decoding apparatus) 및 λ Œλ”λŸ¬(renderer)λ₯Ό 포함할 수 μžˆλ‹€. 상기 인코딩 μž₯μΉ˜λŠ” λΉ„λ””μ˜€/μ˜μƒ 인코딩 μž₯치라고 뢈릴 수 있고, 상기 λ””μ½”λ”© μž₯μΉ˜λŠ” λΉ„λ””μ˜€/μ˜μƒ λ””μ½”λ”© μž₯치라고 뢈릴 수 μžˆλ‹€. μ†‘μ‹ κΈ°λŠ” 인코딩 μž₯μΉ˜μ— 포함될 수 μžˆλ‹€. μˆ˜μ‹ κΈ°λŠ” λ””μ½”λ”© μž₯μΉ˜μ— 포함될 수 μžˆλ‹€. λ Œλ”λŸ¬λŠ” λ””μŠ€ν”Œλ ˆμ΄λΆ€λ₯Ό 포함할 μˆ˜λ„ 있고, λ””μŠ€ν”Œλ ˆμ΄λΆ€λŠ” λ³„κ°œμ˜ λ””λ°”μ΄μŠ€ λ˜λŠ” μ™ΈλΆ€ μ»΄ν¬λ„ŒνŠΈλ‘œ ꡬ성될 μˆ˜λ„ μžˆλ‹€. The source device may include a video source, an encoding apparatus, and a transmitter. The receiving device may include a receiver, a decoding apparatus, and a renderer. The encoding device may be called a video / image encoding device, and the decoding device may be called a video / image decoding device. The transmitter may be included in the encoding device. The receiver may be included in the decoding device. The renderer may include a display unit, and the display unit may be configured as a separate device or an external component.

λΉ„λ””μ˜€ μ†ŒμŠ€λŠ” λΉ„λ””μ˜€/μ˜μƒμ˜ 캑쳐, ν•©μ„± λ˜λŠ” 생성 κ³Όμ • 등을 ν†΅ν•˜μ—¬ λΉ„λ””μ˜€/μ˜μƒμ„ νšλ“ν•  수 μžˆλ‹€. λΉ„λ””μ˜€ μ†ŒμŠ€λŠ” λΉ„λ””μ˜€/μ˜μƒ 캑쳐 λ””λ°”μ΄μŠ€ 및/λ˜λŠ” λΉ„λ””μ˜€/μ˜μƒ 생성 λ””λ°”μ΄μŠ€λ₯Ό 포함할 수 μžˆλ‹€. λΉ„λ””μ˜€/μ˜μƒ 캑쳐 λ””λ°”μ΄μŠ€λŠ” 예λ₯Ό λ“€μ–΄, ν•˜λ‚˜ μ΄μƒμ˜ 카메라, 이전에 캑쳐된 λΉ„λ””μ˜€/μ˜μƒμ„ ν¬ν•¨ν•˜λŠ” λΉ„λ””μ˜€/μ˜μƒ μ•„μΉ΄μ΄λΈŒ 등을 포함할 수 μžˆλ‹€. λΉ„λ””μ˜€/μ˜μƒ 생성 λ””λ°”μ΄μŠ€λŠ” 예λ₯Ό λ“€μ–΄ 컴퓨터, 타블렛 및 슀마트폰 등을 포함할 수 있으며 (μ „μžμ μœΌλ‘œ) λΉ„λ””μ˜€/μ˜μƒμ„ 생성할 수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 컴퓨터 등을 ν†΅ν•˜μ—¬ κ°€μƒμ˜ λΉ„λ””μ˜€/μ˜μƒμ΄ 생성될 수 있으며, 이 경우 κ΄€λ ¨ 데이터가 μƒμ„±λ˜λŠ” κ³Όμ •μœΌλ‘œ λΉ„λ””μ˜€/μ˜μƒ 캑쳐 과정이 갈음될 수 μžˆλ‹€.The video source may acquire the video / image through a process of capturing, synthesizing, or generating the video / image. The video source may comprise a video / image capture device and / or a video / image generation 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. Video / image generation devices 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.

인코딩 μž₯μΉ˜λŠ” μž…λ ₯ λΉ„λ””μ˜€/μ˜μƒμ„ 인코딩할 수 μžˆλ‹€. 인코딩 μž₯μΉ˜λŠ” μ••μΆ• 및 μ½”λ”© νš¨μœ¨μ„ μœ„ν•˜μ—¬ 예츑, λ³€ν™˜, μ–‘μžν™” λ“± 일련의 절차λ₯Ό μˆ˜ν–‰ν•  수 μžˆλ‹€. μΈμ½”λ”©λœ 데이터(μΈμ½”λ”©λœ λΉ„λ””μ˜€/μ˜μƒ 정보)λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Ό(bitstream) ν˜•νƒœλ‘œ 좜λ ₯될 수 μžˆλ‹€.The encoding device may encode the input video / image. The encoding apparatus may perform a series of procedures such as prediction, transform, and quantization for compression and coding efficiency. The encoded data (encoded video / image information) may be output in the form of a bitstream.

μ „μ†‘λΆ€λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Ό ν˜•νƒœλ‘œ 좜λ ₯된 μΈμ½”λ”©λœ λΉ„λ””μ˜€/μ˜μƒ 정보 λ˜λŠ” 데이터λ₯Ό 파일 λ˜λŠ” 슀트리밍 ν˜•νƒœλ‘œ λ””μ§€ν„Έ μ €μž₯맀체 λ˜λŠ” λ„€νŠΈμ›Œν¬λ₯Ό ν†΅ν•˜μ—¬ μˆ˜μ‹  λ””λ°”μ΄μŠ€μ˜ μˆ˜μ‹ λΆ€λ‘œ 전달할 수 μžˆλ‹€. λ””μ§€ν„Έ μ €μž₯ λ§€μ²΄λŠ” USB, SD, CD, DVD, λΈ”λ£¨λ ˆμ΄, HDD, SSD λ“± λ‹€μ–‘ν•œ μ €μž₯ 맀체λ₯Ό 포함할 수 μžˆλ‹€. μ „μ†‘λΆ€λŠ” 미리 μ •ν•΄μ§„ 파일 포멧을 ν†΅ν•˜μ—¬ λ―Έλ””μ–΄ νŒŒμΌμ„ μƒμ„±ν•˜κΈ° μœ„ν•œ μ—˜λ¦¬λ¨ΌνŠΈλ₯Ό 포함할 수 있고, 방솑/톡신 λ„€νŠΈμ›Œν¬λ₯Ό ν†΅ν•œ 전솑을 μœ„ν•œ μ—˜λ ˆλ©˜νŠΈλ₯Ό 포함할 수 μžˆλ‹€. μˆ˜μ‹ λΆ€λŠ” 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ„ μΆ”μΆœν•˜μ—¬ λ””μ½”λ”© μž₯치둜 전달할 수 μžˆλ‹€.The transmitter may transmit the encoded video / video information or data output in the form of a bitstream to the receiver of the receiving device through a digital storage medium or a network in the form of a file or streaming. The digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, and the like. The transmission unit may include an element for generating a media file through a predetermined file format, and may include an element for transmission through a broadcast / communication network. The receiver may extract the bitstream and transmit the extracted bitstream to the decoding apparatus.

λ””μ½”λ”© μž₯μΉ˜λŠ” 인코딩 μž₯치의 λ™μž‘μ— λŒ€μ‘ν•˜λŠ” μ—­μ–‘μžν™”, μ—­λ³€ν™˜, 예츑 λ“± 일련의 절차λ₯Ό μˆ˜ν–‰ν•˜μ—¬ λΉ„λ””μ˜€/μ˜μƒμ„ λ””μ½”λ”©ν•  수 μžˆλ‹€. The decoding apparatus may decode the video / image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding apparatus.

λ Œλ”λŸ¬λŠ” λ””μ½”λ”©λœ λΉ„λ””μ˜€/μ˜μƒμ„ λ Œλ”λ§ν•  수 μžˆλ‹€. λ Œλ”λ§λœ λΉ„λ””μ˜€/μ˜μƒμ€ λ””μŠ€ν”Œλ ˆμ΄λΆ€λ₯Ό ν†΅ν•˜μ—¬ λ””μŠ€ν”Œλ ˆμ΄λ  수 μžˆλ‹€.The renderer may render the decoded video / image. The rendered video / image may be displayed through the display unit.

도 23은 λ³Έ 발λͺ…이 μ μš©λ˜λŠ” μ‹€μ‹œμ˜ˆλ‘œμ„œ, 컨텐츠 슀트리밍 μ‹œμŠ€ν…œ ꡬ쑰도λ₯Ό λ‚˜νƒ€λ‚Έλ‹€.23 is a diagram illustrating a structure of a content streaming system according to an embodiment to which the present invention is applied.

도 23을 μ°Έμ‘°ν•˜λ©΄, λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 컨텐츠 슀트리밍 μ‹œμŠ€ν…œμ€ 크게 인코딩 μ„œλ²„, 슀트리밍 μ„œλ²„, μ›Ή μ„œλ²„, λ―Έλ””μ–΄ μ €μž₯μ†Œ, μ‚¬μš©μž μž₯치 및 λ©€ν‹°λ―Έλ””μ–΄ μž…λ ₯ μž₯치λ₯Ό 포함할 수 μžˆλ‹€.Referring to FIG. 23, a content streaming system to which the present invention 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 content input from multimedia input devices such as a smart phone, a camera, a camcorder, etc. into digital data to generate a bitstream and transmit the bitstream to the streaming server. As another example, when multimedia input devices such as smart phones, cameras, camcorders, etc. directly generate a bitstream, the encoding server may be omitted.

상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ€ λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 인코딩 방법 λ˜λŠ” λΉ„νŠΈμŠ€νŠΈλ¦Ό 생성 방법에 μ˜ν•΄ 생성될 수 있고, 상기 슀트리밍 μ„œλ²„λŠ” 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ„ 전솑 λ˜λŠ” μˆ˜μ‹ ν•˜λŠ” κ³Όμ •μ—μ„œ μΌμ‹œμ μœΌλ‘œ 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ„ μ €μž₯ν•  수 μžˆλ‹€.The bitstream may be generated by an encoding method or a bitstream generation method to which the present invention 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 the user's request through the web server, and the web server serves as a medium for informing the user of what service. When a user requests a desired service from the web server, the web server delivers it to a streaming server, and the streaming server transmits multimedia data to the user. In this case, the content streaming system may include a separate control server. In this case, the control server plays a role of controlling a command / response between devices in the content streaming system.

상기 슀트리밍 μ„œλ²„λŠ” λ―Έλ””μ–΄ μ €μž₯μ†Œ 및/λ˜λŠ” 인코딩 μ„œλ²„λ‘œλΆ€ν„° 컨텐츠λ₯Ό μˆ˜μ‹ ν•  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 상기 인코딩 μ„œλ²„λ‘œλΆ€ν„° 컨텐츠λ₯Ό μˆ˜μ‹ ν•˜κ²Œ λ˜λŠ” 경우, 상기 컨텐츠λ₯Ό μ‹€μ‹œκ°„μœΌλ‘œ μˆ˜μ‹ ν•  수 μžˆλ‹€. 이 경우, μ›ν™œν•œ 슀트리밍 μ„œλΉ„μŠ€λ₯Ό μ œκ³΅ν•˜κΈ° μœ„ν•˜μ—¬ 상기 슀트리밍 μ„œλ²„λŠ” 상기 λΉ„νŠΈμŠ€νŠΈλ¦Όμ„ 일정 μ‹œκ°„λ™μ•ˆ μ €μž₯ν•  수 μžˆλ‹€.The streaming server may receive content from a media store and / or an encoding server. For example, when the content is received from the encoding server, the content 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.

상기 μ‚¬μš©μž μž₯치의 μ˜ˆλ‘œλŠ”, νœ΄λŒ€ν°, 슀마트 폰(smart phone), λ…ΈνŠΈλΆ 컴퓨터(laptop computer), λ””μ§€ν„Έλ°©μ†‘μš© 단말기, PDA(personal digital assistants), PMP(portable multimedia player), λ„€λΉ„κ²Œμ΄μ…˜, 슬레이트 PC(slate PC), νƒœλΈ”λ¦Ώ PC(tablet PC), 울트라뢁(ultrabook), μ›¨μ–΄λŸ¬λΈ” λ””λ°”μ΄μŠ€(wearable device, 예λ₯Ό λ“€μ–΄, μ›ŒμΉ˜ν˜• 단말기 (smartwatch), κΈ€λž˜μŠ€ν˜• 단말기 (smart glass), HMD(head mounted display)), λ””μ§€ν„Έ TV, λ°μŠ€ν¬νƒ‘ 컴퓨터, λ””μ§€ν„Έ μ‚¬μ΄λ‹ˆμ§€ 등이 μžˆμ„ 수 μžˆλ‹€.Examples of the user device include a mobile phone, a smart phone, 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, glass glasses, head mounted displays), digital TVs, desktops Computer, digital signage, and the like.

상기 컨텐츠 슀트리밍 μ‹œμŠ€ν…œ λ‚΄ 각 μ„œλ²„λ“€μ€ λΆ„μ‚° μ„œλ²„λ‘œ 운영될 수 있으며, 이 경우 각 μ„œλ²„μ—μ„œ μˆ˜μ‹ ν•˜λŠ” λ°μ΄ν„°λŠ” λΆ„μ‚° 처리될 수 μžˆλ‹€.Each server in the content streaming system may be operated as a distributed server, in which case data received from each server may be distributed.

상기 기술된 것과 같이, λ³Έ 발λͺ…μ—μ„œ μ„€λͺ…ν•œ μ‹€μ‹œμ˜ˆλ“€μ€ ν”„λ‘œμ„Έμ„œ, 마이크둜 ν”„λ‘œμ„Έμ„œ, 컨트둀러 λ˜λŠ” μΉ© μƒμ—μ„œ κ΅¬ν˜„λ˜μ–΄ μˆ˜ν–‰λ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, 각 λ„λ©΄μ—μ„œ λ„μ‹œν•œ κΈ°λŠ₯ μœ λ‹›λ“€μ€ 컴퓨터, ν”„λ‘œμ„Έμ„œ, 마이크둜 ν”„λ‘œμ„Έμ„œ, 컨트둀러 λ˜λŠ” μΉ© μƒμ—μ„œ κ΅¬ν˜„λ˜μ–΄ μˆ˜ν–‰λ  수 μžˆλ‹€.As described above, the embodiments described herein may be implemented and performed on a processor, microprocessor, controller, or chip. For example, the functional units shown in each drawing may be implemented and performed on a computer, processor, microprocessor, controller, or chip.

λ˜ν•œ, λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 디코더 및 μΈμ½”λ”λŠ” λ©€ν‹°λ―Έλ””μ–΄ 방솑 μ†‘μˆ˜μ‹  μž₯치, λͺ¨λ°”일 톡신 단말, ν™ˆ μ‹œλ„€λ§ˆ λΉ„λ””μ˜€ μž₯치, λ””μ§€ν„Έ μ‹œλ„€λ§ˆ λΉ„λ””μ˜€ μž₯치, κ°μ‹œμš© 카메라, λΉ„λ””μ˜€ λŒ€ν™” μž₯치, λΉ„λ””μ˜€ 톡신과 같은 μ‹€μ‹œκ°„ 톡신 μž₯치, λͺ¨λ°”일 슀트리밍 μž₯치, μ €μž₯ 맀체, 캠코더, μ£Όλ¬Έν˜• λΉ„λ””μ˜€(VoD) μ„œλΉ„μŠ€ 제곡 μž₯치, OTT λΉ„λ””μ˜€(Over the top video) μž₯치, 인터넷 슀트리밍 μ„œλΉ„μŠ€ 제곡 μž₯치, 3차원(3D) λΉ„λ””μ˜€ μž₯치, 화상 μ „ν™” λΉ„λ””μ˜€ μž₯치, 및 의료용 λΉ„λ””μ˜€ μž₯치 등에 포함될 수 있으며, λΉ„λ””μ˜€ μ‹ ν˜Έ λ˜λŠ” 데이터 μ‹ ν˜Έλ₯Ό μ²˜λ¦¬ν•˜κΈ° μœ„ν•΄ μ‚¬μš©λ  수 μžˆλ‹€. 예λ₯Ό λ“€μ–΄, OTT λΉ„λ””μ˜€(Over the top video) μž₯μΉ˜λ‘œλŠ” κ²Œμž„ μ½˜μ†”, λΈ”λ£¨λ ˆμ΄ ν”Œλ ˆμ΄μ–΄, 인터넷 접속 TV, ν™ˆμ‹œμ–΄ν„° μ‹œμŠ€ν…œ, 슀마트폰, νƒœλΈ”λ¦Ώ PC, DVR(Digital Video Recoder) 등을 포함할 수 μžˆλ‹€.In addition, the decoder and encoder to which the present invention is applied include a multimedia broadcasting transmitting and receiving 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, Storage media, camcorders, video on demand (VoD) service providing devices, OTT video (Over the top video) devices, Internet streaming service providing devices, three-dimensional (3D) video devices, video telephony video devices, and medical video devices. It can be used to process video signals or data signals. For example, the OTT video device may include a game console, a Blu-ray player, an internet access TV, a home theater system, a smartphone, a tablet PC, a digital video recorder (DVR), and the like.

λ˜ν•œ, λ³Έ 발λͺ…이 μ μš©λ˜λŠ” 처리 방법은 μ»΄ν“¨ν„°λ‘œ μ‹€ν–‰λ˜λŠ” ν”„λ‘œκ·Έλž¨μ˜ ν˜•νƒœλ‘œ 생산될 수 있으며, 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 맀체에 μ €μž₯될 수 μžˆλ‹€. λ³Έ 발λͺ…에 λ”°λ₯Έ 데이터 ꡬ쑰λ₯Ό κ°€μ§€λŠ” λ©€ν‹°λ―Έλ””μ–΄ 데이터도 λ˜ν•œ 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 맀체에 μ €μž₯될 수 μžˆλ‹€. 상기 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 λ§€μ²΄λŠ” μ»΄ν“¨ν„°λ‘œ 읽을 수 μžˆλŠ” 데이터가 μ €μž₯λ˜λŠ” λͺ¨λ“  μ’…λ₯˜μ˜ μ €μž₯ μž₯치 및 λΆ„μ‚° μ €μž₯ μž₯치λ₯Ό ν¬ν•¨ν•œλ‹€. 상기 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 λ§€μ²΄λŠ”, 예λ₯Ό λ“€μ–΄, λΈ”λ£¨λ ˆμ΄ λ””μŠ€ν¬(BD), λ²”μš© 직렬 λ²„μŠ€(USB), ROM, PROM, EPROM, EEPROM, RAM, CD-ROM, 자기 ν…Œμ΄ν”„, ν”Œλ‘œν”Ό λ””μŠ€ν¬ 및 광학적 데이터 μ €μž₯ μž₯치λ₯Ό 포함할 수 μžˆλ‹€. λ˜ν•œ, 상기 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 λ§€μ²΄λŠ” λ°˜μ†‘νŒŒ(예λ₯Ό λ“€μ–΄, 인터넷을 ν†΅ν•œ 전솑)의 ν˜•νƒœλ‘œ κ΅¬ν˜„λœ λ―Έλ””μ–΄λ₯Ό ν¬ν•¨ν•œλ‹€. λ˜ν•œ, 인코딩 λ°©λ²•μœΌλ‘œ μƒμ„±λœ λΉ„νŠΈμŠ€νŠΈλ¦Όμ΄ 컴퓨터가 νŒλ…ν•  수 μžˆλŠ” 기둝 맀체에 μ €μž₯λ˜κ±°λ‚˜ μœ λ¬΄μ„  톡신 λ„€νŠΈμ›Œν¬λ₯Ό 톡해 전솑될 수 μžˆλ‹€.In addition, the processing method to which the present invention is applied can be produced in the form of a program executed by a computer, and stored in a computer-readable recording medium. Multimedia data having a data structure according to the present invention can also be stored in a computer-readable recording medium. The computer readable recording medium includes all kinds of storage devices and distributed storage devices in which computer readable data is stored. The computer-readable recording medium may be, for example, a Blu-ray disc (BD), a universal serial bus (USB), a ROM, a PROM, an EPROM, an EEPROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, and an optical disc. It may include a data storage device. The computer-readable recording medium also includes media embodied in the form of a carrier wave (eg, transmission over the Internet). In addition, the bitstream generated by the encoding method may be stored in a computer-readable recording medium or transmitted through a wired or wireless communication network.

λ˜ν•œ, λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆλŠ” ν”„λ‘œκ·Έλž¨ μ½”λ“œμ— μ˜ν•œ 컴퓨터 ν”„λ‘œκ·Έλž¨ μ œν’ˆμœΌλ‘œ κ΅¬ν˜„λ  수 있고, 상기 ν”„λ‘œκ·Έλž¨ μ½”λ“œλŠ” λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆμ— μ˜ν•΄ μ»΄ν“¨ν„°μ—μ„œ μˆ˜ν–‰λ  수 μžˆλ‹€. 상기 ν”„λ‘œκ·Έλž¨ μ½”λ“œλŠ” 컴퓨터에 μ˜ν•΄ νŒλ…κ°€λŠ₯ν•œ 캐리어 상에 μ €μž₯될 수 μžˆλ‹€.In addition, an embodiment of the present invention may be implemented as a computer program product by program code, which may be performed on a computer by an embodiment of the present invention. The program code may be stored on a carrier readable by a computer.

μ΄μƒμ—μ„œ μ„€λͺ…λœ μ‹€μ‹œμ˜ˆλ“€μ€ λ³Έ 발λͺ…μ˜ κ΅¬μ„±μš”μ†Œλ“€κ³Ό νŠΉμ§•λ“€μ΄ μ†Œμ • ν˜•νƒœλ‘œ κ²°ν•©λœ 것듀이닀. 각 κ΅¬μ„±μš”μ†Œ λ˜λŠ” νŠΉμ§•μ€ λ³„λ„μ˜ λͺ…μ‹œμ  언급이 μ—†λŠ” ν•œ 선택적인 κ²ƒμœΌλ‘œ κ³ λ €λ˜μ–΄μ•Ό ν•œλ‹€. 각 κ΅¬μ„±μš”μ†Œ λ˜λŠ” νŠΉμ§•μ€ λ‹€λ₯Έ κ΅¬μ„±μš”μ†Œλ‚˜ νŠΉμ§•κ³Ό κ²°ν•©λ˜μ§€ μ•Šμ€ ν˜•νƒœλ‘œ μ‹€μ‹œλ  수 μžˆλ‹€. λ˜ν•œ, 일뢀 κ΅¬μ„±μš”μ†Œλ“€ 및/λ˜λŠ” νŠΉμ§•λ“€μ„ κ²°ν•©ν•˜μ—¬ λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆλ₯Ό κ΅¬μ„±ν•˜λŠ” 것도 κ°€λŠ₯ν•˜λ‹€. λ³Έ 발λͺ…μ˜ μ‹€μ‹œμ˜ˆλ“€μ—μ„œ μ„€λͺ…λ˜λŠ” λ™μž‘λ“€μ˜ μˆœμ„œλŠ” 변경될 수 μžˆλ‹€. μ–΄λŠ μ‹€μ‹œμ˜ˆμ˜ 일뢀 κ΅¬μ„±μ΄λ‚˜ νŠΉμ§•μ€ λ‹€λ₯Έ μ‹€μ‹œμ˜ˆμ— 포함될 수 있고, λ˜λŠ” λ‹€λ₯Έ μ‹€μ‹œμ˜ˆμ˜ λŒ€μ‘ν•˜λŠ” ꡬ성 λ˜λŠ” νŠΉμ§•κ³Ό ꡐ체될 수 μžˆλ‹€. νŠΉν—ˆμ²­κ΅¬λ²”μœ„μ—μ„œ λͺ…μ‹œμ μΈ 인용 관계가 μžˆμ§€ μ•Šμ€ 청ꡬ항듀을 κ²°ν•©ν•˜μ—¬ μ‹€μ‹œμ˜ˆλ₯Ό κ΅¬μ„±ν•˜κ±°λ‚˜ μΆœμ› ν›„μ˜ 보정에 μ˜ν•΄ μƒˆλ‘œμš΄ μ²­κ΅¬ν•­μœΌλ‘œ ν¬ν•¨μ‹œν‚¬ 수 μžˆμŒμ€ 자λͺ…ν•˜λ‹€.The embodiments described above are the components and features of the present invention are combined in a predetermined form. Each component or feature should be considered optional unless stated otherwise. Each component or feature may be embodied in a form that is not combined with other components or features. It is also possible to combine some of the components and / or features to form an embodiment of the invention. The order of the operations described in the embodiments of the present invention may be changed. Some components or features of one embodiment may be included in another embodiment or may be replaced with corresponding components or features of another embodiment. It is obvious that the claims may be combined to form an embodiment by combining claims that do not have an explicit citation relationship in the claims or as new claims by post-application correction.

λ³Έ 발λͺ…에 λ”°λ₯Έ μ‹€μ‹œμ˜ˆλŠ” λ‹€μ–‘ν•œ μˆ˜λ‹¨, 예λ₯Ό λ“€μ–΄, ν•˜λ“œμ›¨μ–΄, νŽŒμ›¨μ–΄(firmware), μ†Œν”„νŠΈμ›¨μ–΄ λ˜λŠ” κ·Έκ²ƒλ“€μ˜ κ²°ν•© 등에 μ˜ν•΄ κ΅¬ν˜„λ  수 μžˆλ‹€. ν•˜λ“œμ›¨μ–΄μ— μ˜ν•œ κ΅¬ν˜„μ˜ 경우, λ³Έ 발λͺ…μ˜ 일 μ‹€μ‹œμ˜ˆλŠ” ν•˜λ‚˜ λ˜λŠ” κ·Έ μ΄μƒμ˜ ASICs(application specific integrated circuits), DSPs(digital signal processors), DSPDs(digital signal processing devices), PLDs(programmable logic devices), FPGAs(field programmable gate arrays), ν”„λ‘œμ„Έμ„œ, 콘트둀러, 마이크둜 콘트둀러, 마이크둜 ν”„λ‘œμ„Έμ„œ 등에 μ˜ν•΄ κ΅¬ν˜„λ  수 μžˆλ‹€.Embodiments according to the present invention may be implemented by various means, for example, hardware, firmware, software, or a combination thereof. In the case of a hardware implementation, an embodiment of the present invention may include one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), FPGAs ( field programmable gate arrays), processors, controllers, microcontrollers, microprocessors, and the like.

νŽŒμ›¨μ–΄λ‚˜ μ†Œν”„νŠΈμ›¨μ–΄μ— μ˜ν•œ κ΅¬ν˜„μ˜ 경우, λ³Έ 발λͺ…μ˜ 일 μ‹€μ‹œμ˜ˆλŠ” μ΄μƒμ—μ„œ μ„€λͺ…λœ κΈ°λŠ₯ λ˜λŠ” λ™μž‘λ“€μ„ μˆ˜ν–‰ν•˜λŠ” λͺ¨λ“ˆ, 절차, ν•¨μˆ˜ λ“±μ˜ ν˜•νƒœλ‘œ κ΅¬ν˜„λ  수 μžˆλ‹€. μ†Œν”„νŠΈμ›¨μ–΄ μ½”λ“œλŠ” λ©”λͺ¨λ¦¬μ— μ €μž₯λ˜μ–΄ ν”„λ‘œμ„Έμ„œμ— μ˜ν•΄ ꡬ동될 수 μžˆλ‹€. 상기 λ©”λͺ¨λ¦¬λŠ” 상기 ν”„λ‘œμ„Έμ„œ λ‚΄λΆ€ λ˜λŠ” 외뢀에 μœ„μΉ˜ν•˜μ—¬, 이미 κ³΅μ§€λœ λ‹€μ–‘ν•œ μˆ˜λ‹¨μ— μ˜ν•΄ 상기 ν”„λ‘œμ„Έμ„œμ™€ 데이터λ₯Ό μ£Όκ³  받을 수 μžˆλ‹€.In the case of implementation by firmware or software, an embodiment of the present invention may be implemented in the form of a module, procedure, function, etc. that performs the functions or operations described above. The software code may be stored in memory and driven by the processor. The memory may be located inside or outside the processor, and may exchange data with the processor by various known means.

λ³Έ 발λͺ…은 λ³Έ 발λͺ…μ˜ ν•„μˆ˜μ  νŠΉμ§•μ„ λ²—μ–΄λ‚˜μ§€ μ•ŠλŠ” λ²”μœ„μ—μ„œ λ‹€λ₯Έ νŠΉμ •ν•œ ν˜•νƒœλ‘œ ꡬ체화될 수 μžˆμŒμ€ λ‹Ήμ—…μžμ—κ²Œ 자λͺ…ν•˜λ‹€. λ”°λΌμ„œ, μƒμˆ ν•œ μƒμ„Έν•œ μ„€λͺ…은 λͺ¨λ“  λ©΄μ—μ„œ μ œν•œμ μœΌλ‘œ ν•΄μ„λ˜μ–΄μ„œλŠ” μ•„λ‹ˆ 되고 μ˜ˆμ‹œμ μΈ κ²ƒμœΌλ‘œ κ³ λ €λ˜μ–΄μ•Ό ν•œλ‹€. λ³Έ 발λͺ…μ˜ λ²”μœ„λŠ” μ²¨λΆ€λœ μ²­κ΅¬ν•­μ˜ 합리적 해석에 μ˜ν•΄ κ²°μ •λ˜μ–΄μ•Ό ν•˜κ³ , λ³Έ 발λͺ…μ˜ 등가적 λ²”μœ„ λ‚΄μ—μ„œμ˜ λͺ¨λ“  변경은 λ³Έ 발λͺ…μ˜ λ²”μœ„μ— ν¬ν•¨λœλ‹€.It will be apparent to those skilled in the art that the present invention may be embodied in other specific forms without departing from the essential features of the present invention. Accordingly, the above detailed description should not be construed as limiting in all aspects and should be considered as illustrative. The scope of the invention should be determined by reasonable interpretation of the appended claims, and all changes within the equivalent scope of the invention are included in the scope of the invention.

이상, μ „μˆ ν•œ λ³Έ 발λͺ…μ˜ λ°”λžŒμ§ν•œ μ‹€μ‹œμ˜ˆλŠ”, μ˜ˆμ‹œμ˜ λͺ©μ μ„ μœ„ν•΄ κ°œμ‹œλœ κ²ƒμœΌλ‘œ, λ‹Ήμ—…μžλΌλ©΄ μ΄ν•˜ μ²¨λΆ€λœ νŠΉν—ˆμ²­κ΅¬λ²”μœ„μ— κ°œμ‹œλœ λ³Έ 발λͺ…μ˜ 기술적 사상과 κ·Έ 기술적 λ²”μœ„ λ‚΄μ—μ„œ, λ‹€μ–‘ν•œ λ‹€λ₯Έ μ‹€μ‹œμ˜ˆλ“€μ„ κ°œλŸ‰, λ³€κ²½, λŒ€μ²΄ λ˜λŠ” λΆ€κ°€ 등이 κ°€λŠ₯ν•  것이닀.As mentioned above, preferred embodiments of the present invention are disclosed for the purpose of illustration, and those skilled in the art can improve and change various other embodiments within the spirit and technical scope of the present invention disclosed in the appended claims below. , Replacement or addition would be possible.

Claims (10)

인트라 예츑 λͺ¨λ“œ 기반으둜 μ˜μƒμ„ λ””μ½”λ”©ν•˜λŠ” 방법에 μžˆμ–΄μ„œ,In the method of decoding an image based on the intra prediction mode, ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•˜λŠ” 단계;When bi-directional intra prediction is applied to the current block, configure an intra prediction mode set used for the bidirectional intra prediction based on available reference samples around the current block. Doing; 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•˜λŠ” 단계;Parsing a prediction mode index indicating an intra prediction mode applied to the current block within the intra prediction mode set; 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜λŠ” 단계; 및 Deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on the prediction direction of the intra prediction mode; And 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 단계λ₯Ό ν¬ν•¨ν•˜λ˜,Generating a prediction sample of the current block by weighting the first reference sample and the second reference sample, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© 방법.The intra prediction mode set is configured to include a predefined number of intra prediction modes within a particular angular range determined according to the available direction of the reference sample. 제1항에 μžˆμ–΄μ„œ,The method of claim 1, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 보닀 크고 180 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ 및 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© 방법.The intra prediction mode set is an intra prediction mode within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. And a decoding method. 제1항에 μžˆμ–΄μ„œ,The method of claim 1, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„ 및 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© 방법.The intra prediction mode set is an intra prediction mode within an angle range greater than or equal to 0 degrees and less than 90 degrees and an angle range greater than 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. And a decoding method. 제1항에 μžˆμ–΄μ„œ,The method of claim 1, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© 방법.The intra prediction mode set is configured to include intra prediction modes within the remaining angular range except 90 degrees when left, right and top reference samples around the current block are available. 제1항에 μžˆμ–΄μ„œ,The method of claim 1, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ κ²°μ •λ˜λŠ”, λ””μ½”λ”© 방법.The weights applied to the first reference sample and the second reference sample, respectively, are determined based on a ratio between the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. , Decoding method. 인트라 예츑 λͺ¨λ“œ 기반으둜 μ˜μƒμ„ λ””μ½”λ”©ν•˜λŠ” μž₯μΉ˜μ— μžˆμ–΄μ„œ,An apparatus for decoding an image based on an intra prediction mode, ν˜„μž¬ 블둝에 μ–‘λ°©ν–₯ 인트라 예츑(bi-directional intra prediction)이 μ μš©λ˜λŠ” 경우, 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 이용 κ°€λŠ₯ν•œ μ°Έμ‘° μƒ˜ν”Œλ“€μ— κΈ°μ΄ˆν•˜μ—¬ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹(intra prediction mode set)을 κ΅¬μ„±ν•˜λŠ” 인트라 예츑 λͺ¨λ“œ μ…‹ ꡬ성뢀;When bi-directional intra prediction is applied to the current block, configure an intra prediction mode set used for the bidirectional intra prediction based on available reference samples around the current block. An intra prediction mode set configuration unit; 상기 인트라 예츑 λͺ¨λ“œ μ…‹ λ‚΄μ—μ„œ 상기 ν˜„μž¬ 블둝에 μ μš©λ˜λŠ” 인트라 예츑 λͺ¨λ“œλ₯Ό μ§€μ‹œν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀(prediction mode index)λ₯Ό νŒŒμ‹±ν•˜λŠ” 예츑 λͺ¨λ“œ 인덱슀 νŒŒμ‹±λΆ€;A prediction mode index parser for parsing a prediction mode index indicating an intra prediction mode applied to the current block in the intra prediction mode set; 상기 인트라 예츑 λͺ¨λ“œμ˜ 예츑 λ°©ν–₯에 κΈ°μ΄ˆν•˜μ—¬ 상기 μ°Έμ‘° μƒ˜ν”Œλ“€ μ€‘μ—μ„œ 상기 μ–‘λ°©ν–₯ 인트라 μ˜ˆμΈ‘μ— μ΄μš©λ˜λŠ” 제1 μ°Έμ‘° μƒ˜ν”Œ 및 제2 μ°Έμ‘° μƒ˜ν”Œμ„ μœ λ„ν•˜λŠ” μ°Έμ‘° μƒ˜ν”Œ μœ λ„λΆ€; 및 A reference sample derivation unit for deriving a first reference sample and a second reference sample used for the bidirectional intra prediction among the reference samples based on a prediction direction of the intra prediction mode; And 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ„ κ°€μ€‘ν•©ν•˜μ—¬ 상기 ν˜„μž¬ λΈ”λ‘μ˜ 예츑 μƒ˜ν”Œμ„ μƒμ„±ν•˜λŠ” 예츑 μƒ˜ν”Œ 생성뢀λ₯Ό ν¬ν•¨ν•˜λ˜,A prediction sample generator configured to weight the first reference sample and the second reference sample to generate a prediction sample of the current block, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 μ°Έμ‘° μƒ˜ν”Œμ˜ 이용 κ°€λŠ₯ν•œ λ°©ν–₯에 따라 κ²°μ •λ˜λŠ” νŠΉμ • 각도 λ²”μœ„ λ‚΄μ—μ„œ 미리 μ •μ˜λœ 개수의 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© μž₯치.The intra prediction mode set is configured to include a predefined number of intra prediction modes within a particular angular range determined according to the available direction of the reference sample. 제6항에 μžˆμ–΄μ„œ,The method of claim 6, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90 도 보닀 크고 180 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ 및 270 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  360 도 보닀 μž‘μ€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© μž₯치.The intra prediction mode set is an intra prediction mode within an angle range greater than 90 degrees and less than or equal to 180 degrees and an angle range greater than or equal to 270 degrees and less than 360 degrees when left and upper reference samples around the current block are available. And a decoding device. 제6항에 μžˆμ–΄μ„œ,The method of claim 6, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 0 도 보닀 ν¬κ±°λ‚˜ κ°™κ³  90 도 보닀 μž‘μ€ 각도 λ²”μœ„ 및 180 도 보닀 크고 270 도 보닀 μž‘κ±°λ‚˜ 같은 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© μž₯치.The intra prediction mode set is an intra prediction mode within an angular range greater than or equal to 0 degrees and less than 90 degrees and an angular range greater than 180 degrees and less than or equal to 270 degrees when right and upper reference samples around the current block are available. And a decoding device. 제6항에 μžˆμ–΄μ„œ,The method of claim 6, 상기 인트라 예츑 λͺ¨λ“œ 셋은 상기 ν˜„μž¬ 블둝 μ£Όλ³€μ˜ 쒌츑, 우츑 및 상츑 μ°Έμ‘° μƒ˜ν”Œμ΄ 이용 κ°€λŠ₯ν•œ 경우, 90도λ₯Ό μ œμ™Έν•œ λ‚˜λ¨Έμ§€ 각도 λ²”μœ„ λ‚΄μ˜ 인트라 예츑 λͺ¨λ“œλ“€μ„ ν¬ν•¨ν•˜λ„λ‘ κ΅¬μ„±λ˜λŠ”, λ””μ½”λ”© μž₯치.And the intra prediction mode set is configured to include intra prediction modes within the remaining angular range except 90 degrees when left, right and top reference samples around the current block are available. 제6항에 μžˆμ–΄μ„œ,The method of claim 6, 상기 제1 μ°Έμ‘° μƒ˜ν”Œ 및 상기 제2 μ°Έμ‘° μƒ˜ν”Œμ— 각각 μ μš©λ˜λŠ” κ°€μ€‘μΉ˜λŠ” 상기 ν˜„μž¬ 블둝 λ‚΄ ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제1 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리 및 상기 ν˜„μž¬ μƒ˜ν”Œκ³Ό 상기 제2 μ°Έμ‘° μƒ˜ν”Œκ°„ 거리의 λΉ„μœ¨μ— κΈ°μ΄ˆν•˜μ—¬ κ²°μ •λ˜λŠ” λ””μ½”λ”© μž₯치.The weights applied to the first reference sample and the second reference sample, respectively, are determined based on a ratio between the distance between the current sample and the first reference sample and the distance between the current sample and the second reference sample in the current block. Decoding device.
PCT/KR2019/004390 2018-04-11 2019-04-11 Intra prediction mode-based image processing method and device therefor Ceased WO2019199093A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862656338P 2018-04-11 2018-04-11
US62/656,338 2018-04-11

Publications (1)

Publication Number Publication Date
WO2019199093A1 true WO2019199093A1 (en) 2019-10-17

Family

ID=68164140

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2019/004390 Ceased WO2019199093A1 (en) 2018-04-11 2019-04-11 Intra prediction mode-based image processing method and device therefor

Country Status (1)

Country Link
WO (1) WO2019199093A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2595015A (en) * 2018-06-27 2021-11-17 Kt Corp Method and apparatus for processing video signal
US11509889B2 (en) 2018-06-27 2022-11-22 Kt Corporation Method and apparatus for processing video signal
WO2024078401A1 (en) * 2022-10-12 2024-04-18 η»΄ζ²ƒη§»εŠ¨ι€šδΏ‘ζœ‰ι™ε…¬εΈ Intra-frame prediction method and apparatus, and device

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20120080548A (en) * 2011-01-07 2012-07-17 μ‚Όμ„±μ „μžμ£Όμ‹νšŒμ‚¬ Method and apparatus for prediction using bi- and uni-directional prediction, method and apparatus for video encoding/decoding with prediction and compensation using bi- and uni-directional prediction
KR20140057674A (en) * 2010-08-17 2014-05-13 μ— μ•€μΌ€μ΄ν™€λ”©μŠ€ μ£Όμ‹νšŒμ‚¬ Intra prediction decoding method
KR20170121303A (en) * 2010-05-30 2017-11-01 μ—˜μ§€μ „μž μ£Όμ‹νšŒμ‚¬ Enhanced intra prediction mode signaling
KR20180026718A (en) * 2015-07-28 2018-03-13 μ—˜μ§€μ „μž μ£Όμ‹νšŒμ‚¬ Intra prediction mode based image processing method and apparatus therefor
KR101843155B1 (en) * 2011-06-28 2018-03-28 μ‚Όμ„±μ „μžμ£Όμ‹νšŒμ‚¬ Method and apparatus for video encoding with intra prediction, method and apparatus for video decoding with intra prediction

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20170121303A (en) * 2010-05-30 2017-11-01 μ—˜μ§€μ „μž μ£Όμ‹νšŒμ‚¬ Enhanced intra prediction mode signaling
KR20140057674A (en) * 2010-08-17 2014-05-13 μ— μ•€μΌ€μ΄ν™€λ”©μŠ€ μ£Όμ‹νšŒμ‚¬ Intra prediction decoding method
KR20120080548A (en) * 2011-01-07 2012-07-17 μ‚Όμ„±μ „μžμ£Όμ‹νšŒμ‚¬ Method and apparatus for prediction using bi- and uni-directional prediction, method and apparatus for video encoding/decoding with prediction and compensation using bi- and uni-directional prediction
KR101843155B1 (en) * 2011-06-28 2018-03-28 μ‚Όμ„±μ „μžμ£Όμ‹νšŒμ‚¬ Method and apparatus for video encoding with intra prediction, method and apparatus for video decoding with intra prediction
KR20180026718A (en) * 2015-07-28 2018-03-13 μ—˜μ§€μ „μž μ£Όμ‹νšŒμ‚¬ Intra prediction mode based image processing method and apparatus therefor

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB2595015A (en) * 2018-06-27 2021-11-17 Kt Corp Method and apparatus for processing video signal
US11343536B2 (en) 2018-06-27 2022-05-24 Kt Corporation Method and apparatus for processing video signal
GB2595015B (en) * 2018-06-27 2022-07-13 Kt Corp Bi-directional intra-prediction involving weighted sum of two reference samples
US11509889B2 (en) 2018-06-27 2022-11-22 Kt Corporation Method and apparatus for processing video signal
US11930212B2 (en) 2018-06-27 2024-03-12 Kt Corporation Method and apparatus for processing video signal
US12200251B2 (en) 2018-06-27 2025-01-14 Kt Corporation Method and apparatus for processing video signal by generating prediction samples using reference samples in different groups
WO2024078401A1 (en) * 2022-10-12 2024-04-18 η»΄ζ²ƒη§»εŠ¨ι€šδΏ‘ζœ‰ι™ε…¬εΈ Intra-frame prediction method and apparatus, and device

Similar Documents

Publication Publication Date Title
WO2020246849A1 (en) Transform-based image coding method and device for same
WO2020256389A1 (en) Bdpcm-based image decoding method and device for same
WO2020218793A1 (en) Bdpcm-based image coding method and device therefor
WO2019203610A1 (en) Method for processing image and device therefor
WO2020141879A1 (en) Affine motion prediction-based video decoding method and device using subblock-based temporal merge candidate in video coding system
WO2020184991A1 (en) Method and apparatus for video encoding/decoding using ibc mode, and method for transmitting bitstream
WO2019235822A1 (en) Method and device for processing video signal by using affine motion prediction
WO2020171632A1 (en) Mpm list-based intra prediction method and device
WO2020167097A1 (en) Derivation of inter-prediction type for inter prediction in image coding system
WO2021040402A1 (en) Image or video coding based on palette coding
WO2021137597A1 (en) Image decoding method and device using dpb parameter for ols
WO2020235960A1 (en) Image decoding method using bdpcm and device therefor
WO2020149630A1 (en) Method and device for decoding image on basis of cclm prediction in image coding system
WO2021133100A1 (en) Video encoding/decoding method and apparatus for performing pdpc and method for transmitting bitstream
WO2021091252A1 (en) Method and device for processing image information for image/video coding
WO2021034116A1 (en) Image decoding method using chroma quantization parameter, and apparatus therefor
WO2021034161A1 (en) Intra prediction device and method
WO2019199093A1 (en) Intra prediction mode-based image processing method and device therefor
WO2021141225A1 (en) Image decoding method using bdpcm and apparatus thereof
WO2020256506A1 (en) Video encoding/decoding method and apparatus using multiple reference line intra-prediction, and method for transmitting bitstream
WO2020145620A1 (en) Intra prediction-based image coding method and device using mpm list
WO2020149616A1 (en) Method and device for decoding image on basis of cclm prediction in image coding system
WO2020055159A1 (en) Method for processing image on basis of intra prediction mode, and device therefor
WO2020055208A1 (en) Image prediction method and apparatus for performing intra prediction
WO2020050697A1 (en) Intra-prediction mode-based image processing method and device therefor

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19785789

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19785789

Country of ref document: EP

Kind code of ref document: A1