WO2016006776A1 - Programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de hevc et appareil associé - Google Patents

Programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de hevc et appareil associé Download PDF

Info

Publication number
WO2016006776A1
WO2016006776A1 PCT/KR2014/012253 KR2014012253W WO2016006776A1 WO 2016006776 A1 WO2016006776 A1 WO 2016006776A1 KR 2014012253 W KR2014012253 W KR 2014012253W WO 2016006776 A1 WO2016006776 A1 WO 2016006776A1
Authority
WO
WIPO (PCT)
Prior art keywords
depth
node
intra prediction
partition block
partition
Prior art date
Application number
PCT/KR2014/012253
Other languages
English (en)
Korean (ko)
Inventor
홍유표
이은총
강동길
강영석
Original Assignee
동국대학교 산학협력단
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 동국대학교 산학협력단 filed Critical 동국대학교 산학협력단
Publication of WO2016006776A1 publication Critical patent/WO2016006776A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/59—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial sub-sampling or interpolation, e.g. alteration of picture size or resolution
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/96—Tree coding, e.g. quad-tree coding

Definitions

  • the present invention relates to intra prediction of HEVC, a next-generation image compression standard technology, and more particularly, to a computer program and a device for the bottom up pruning technique applied to HEVC intra prediction.
  • JCT-VC Joint Collaborative Team on Video Coding
  • HEVC has a high compression ratio of up to about 2 times that of the same image quality compared to H.264, the previous video compression standard technology, enabling efficient management of ultra-high definition images.
  • the time complexity of coding operation increased considerably because many complicated and precise techniques were included to maximize the compression rate. The reason for this is that the number of prediction modes calculated to determine the prediction mode is larger than that of H.264, and the type of partition size for encoding is larger than that of H.264.
  • the biggest difference is the size of the PU (Prediction Unit) and the number of prediction directions.
  • the maximum PU size of H.264 was 16x16, but the maximum PU size of HEVC is 64x64, which is larger than before, and the unit of PU is also diversified.
  • H.264 supports up to nine prediction modes, while HEVC supports up to 35, allowing more diverse directions to be calculated.
  • HEVC is more flexible and more accurate than H.264, but the number of executions of Rate Distortion Optimization (RDO) operation to determine the intra prediction mode is rapidly increased, resulting in very high time complexity.
  • RDO Rate Distortion Optimization
  • the present invention is to provide a technique that can reduce the amount of computation of HEVC intra prediction by performing intra prediction on a large partition when performing a specific condition, HEVC intra prediction.
  • a computer program for a bottom-up pruning technique applied to high efficiency video coding (HEVC) intra prediction HEVC
  • partition blocks of a second depth constituting a lower node of a partition block of a first depth level correspond to leaf nodes or tree nodes; Determining whether a tree node corresponds to a tree node, wherein the tree node is a node in which partition blocks of a third depth constituting a lower node of the partition block of the second depth exist, and the leaf node is a partition of the second depth.
  • the partition block of the third depth constituting a lower node of the block is a node;
  • a computer program includes determining whether to perform intra prediction on a partition block of the first depth based on difference information between tree node average values that are average values of costs.
  • step (b) is,
  • the partition block of the first depth is determined.
  • the method may further include determining to perform intra prediction on the partition block of the first depth if the threshold value is less than the threshold.
  • the rate-distortion cost of the partition block of the second depth determined as the tree node may be determined as the sum of the rate-distortion cost of the partition blocks of the third depth that are lower nodes of the tree node.
  • step (a) and (b) are repeated after re-defining the partition block to the node of the second depth. It can be done with
  • the HEVC intra prediction determination apparatus for determining whether or not the HEVC (High Efficiency Video Coding) intra prediction
  • partition blocks of a second depth constituting a lower node of a partition block of a first depth level correspond to leaf nodes or tree nodes.
  • the partition block of the third depth constituting a lower node of the node is absent;
  • An average value of a leaf node average value which is an average value of a rate-distortion cost of the partition block of the second depth determined by the leaf node, and an average of a rate-distortion cost of the partition block of the second depth determined by the tree node
  • an intra prediction determining apparatus including an intra prediction determining unit configured to determine whether intra prediction is performed on a partition block of the first depth based on difference information between tree node average values which are values.
  • the method may further include an operation unit configured to calculate a value obtained by multiplying the number of tree nodes by a ratio obtained by subtracting the tree node average value from the leaf node average value by the leaf node average value.
  • the intra prediction determiner does not perform the intra prediction on the partition block of the first depth when the multiplied value exceeds a predetermined threshold, and performs the intra prediction on the partition block of the first depth when the intra prediction decision value is less than the threshold. Can be determined.
  • the operation unit the operation unit
  • the rate-distortion cost of the partition block of the second depth determined as the tree node may be determined as the sum of the rate-distortion cost of the partition blocks of the third depth that are lower nodes of the tree node.
  • the intra prediction determiner determines whether the intra prediction is a prediction of the intra prediction.
  • the partition block of the first depth in which performing intra prediction is determined if there is an upper partition block including the partition block, the partition block is redefined as a node of the second depth, and then the partition block is defined. It may be re-determined whether intra prediction on the higher partition block to be included is performed.
  • the amount of calculation according to the HEVC intra prediction can be greatly reduced, thereby greatly reducing the hardware size and the calculation time for the corresponding operation.
  • 1 is a diagram for explaining an intra prediction mode of HEVC.
  • FIG. 2 is a block diagram of an intra prediction determining apparatus for determining whether to predict HEVC intra according to an embodiment of the present invention.
  • FIG. 3 is a flowchart illustrating a bottom-up pruning technique applied to HEVC intra prediction according to an embodiment of the present invention.
  • FIG. 4 is a view for explaining an example of the bottom up pruning technique of FIG.
  • unit that processes at least one function or operation, which means that it may be implemented by one or more pieces of hardware or software or a combination of hardware and software.
  • 1 is a diagram for explaining an intra prediction mode of HEVC.
  • In-picture encoding in HEVC supports a total of 35 modes in the case of brightness values as shown in FIG. 1.
  • No. 35 is the mode supported by Chroma.
  • the two modes are non-directional modes, similar to the Planar mode and the DC mode in H.264, and the remaining 33 modes are the directional modes, which allow various prediction methods by direction with the surrounding reference pixels. This is about four times the number of modes compared to the nine modes of H.264.
  • the intra prediction of HEVC can be predicted more accurately by supporting various directionality compared to the intra prediction of H.264.
  • RDO rate distortion optimization
  • HEVC coding tree block
  • CU coding unit
  • PU prediction unit
  • the CU supports 64x64 ⁇ 8x8 coded blocks of various sizes by allowing a quadtree structure to recursively divide into smaller units according to layers.
  • a 64x64 block prediction unit PU
  • a 32x32 block PU is used for a 32x32 CU
  • a 16x16 block is used for a 16x16 CU.
  • a PU of 8x8 blocks a PU of 8x8 blocks and 4x4 blocks is used.
  • FIG. 2 is a block diagram of an intra prediction determining apparatus for determining whether to predict HEVC intra prediction according to an embodiment of the present invention
  • FIG. 3 is a bottom-up pruning applied to HEVC intra prediction according to an embodiment of the present invention. Up Pruning).
  • FIG. 4 is a diagram for describing an example of the bottom up pruning technique of FIG. 3.
  • the bottom-up pruning technique applied to HEVC intra prediction may include a leaf / tree node determination unit 310 and an operation unit as illustrated in FIG. 2.
  • the HEVC intra prediction determination apparatus 300 including the 320 and the intra prediction determination unit 330 may be implemented.
  • a bottom-up pruning technique applied to HEVC intra prediction according to an embodiment of the present invention may be implemented in computer readable program code.
  • the computer program related to the bottom up pruning technique applied to the HEVC intra prediction according to the embodiment of the present invention may be installed in a user's computer or downloaded online, and may be manufactured in a form of being integrated with an independent or other program ( That is, software products).
  • a bottom-up pruning technique applied to HEVC intra prediction may be implemented in the form of the computer program and stored in a computer-readable recording medium.
  • the computer-readable recording medium includes all kinds of recording media storing data that can be decrypted by a computer system.
  • ROM read only memory
  • RAM random access memory
  • magnetic tape magnetic tape
  • magnetic disk magnetic disk
  • flash memory an optical data storage device
  • the computer readable recording medium can also be distributed over computer systems connected over a computer network, stored and executed as readable code in a distributed fashion.
  • FIG. 4 a bottom-up pruning technique applied to HEVC intra prediction according to an embodiment of the present invention, which has various implementations as described above, is illustrated in FIG. 4. This will be described.
  • step S410 of FIG. 3 partition blocks of a second depth constituting a lower node of a partition block of a first depth level according to a hierarchical structure of a coding tree unit (CTU) are included in a leaf node ( Determine whether it corresponds to a leaf node or a tree node. If the embodiment of the present invention is implemented in a separate device, the function of step S410 will be executed by the leaf / tree node determination unit 310.
  • CTU coding tree unit
  • the tree node is a node in which the partition blocks of the third depth constituting the lower node of the partition block of the second depth are present, and the leaf node is the third depth constituting the lower node of the partition block of the second depth.
  • the depth refers to the step of hierarchically dividing the coding unit (CU).
  • a 16x16 block corresponds to a partition block of a first depth (depth level 0 in the example of FIG. 4), and 8x8 blocks correspond to a second depth (in the example of FIG. 4).
  • 4x4 blocks correspond to partition blocks of a third depth (depth level 2 in the example of FIG. 4).
  • B 1,2 is a tree node because it contains four 4x4 partition blocks that constitute the lower node, and 8x8 blocks except B 1,2 are leaf nodes because they do not include the lower node. .
  • Bij denotes each partition block
  • i denotes a depth level in the CTU
  • j denotes the number of partitions in the corresponding depth.
  • a numerical value assigned to each of the nodes means a rate-distortion cost (RDcost) for the node.
  • each node may be defined as in Equation 1 below.
  • the bottom up pruning technique performs pruning according to Equation 2 below.
  • nL is the number of leaf nodes
  • nT is the number of tree nodes
  • a predetermined threshold for pruning is the predetermined threshold for pruning.
  • the left term of the above equation is performed (see step S420 of FIG. 3). That is, the leaf node average value which is an average value of the rate-distortion cost of the partition block of the second depth determined as the leaf node through the previous step S410, and the average value of the rate-distortion cost of the partition block of the second depth determined as the tree node Calculate the difference between the tree node mean values.
  • the calculated difference value is calculated by multiplying the number of tree nodes by a ratio of dividing the average value of the leaf nodes (hereinafter, referred to as a pruning basis value for convenience of description). This may be executed by the calculator 320 when the embodiment of the present invention is implemented in a separate device.
  • the rate-distortion cost of the partition block determined as the tree node is determined as the sum of the rate-distortion cost of partition blocks that are lower nodes of the tree node.
  • the rate-distortion cost of B 1,2 is the sum of the rate-distortion costs of the four 4X4 partition blocks, which are lower nodes thereof.
  • step S420 Based on the pruning basis value calculated according to step S420, if the corresponding pruning basis value exceeds a predetermined threshold ( ⁇ ), the intra with respect to the partition block of the higher depth (which is a 16x16 block in the example figure of FIG. 4). Without performing the prediction, if it is less than the threshold, it is determined to perform the intra prediction on the partition block of the higher depth (see step S430 of FIG. 3).
  • the above-described step S430 may be executed by the intra prediction determiner 330 when the embodiment of the present invention is implemented in an independent device.
  • Step S430 will be described with reference to the exemplary diagram of FIG. 4 as follows.
  • the average value of the rate-distortion cost of leaf nodes (ie, B 1,0 , B 1,1 , B 1,3 ) in an 8x8 block is 100, and a tree node
  • the average value of the rate-distortion cost of (ie, B 1,2 ) is 89.
  • the difference between the two is 11, which is divided by the average value of the leaf nodes (that is, 100) is 0.11, and the number of tree nodes is 1, and according to Equation 1 above, FIG.
  • the pruning basis is 0.11 (that is, 0.11 * 1). If the threshold ( ⁇ ) is set to 0.1, since the pruning base value exceeds the threshold, intra prediction on a partition block of that higher depth (i.e., B 0,0 block, which is 16x16 block in this example) Do not do it.
  • the average value of the rate-distortion cost of the leaf nodes is 100, and the tree node (ie, B 1,5 , B).
  • the average value of the rate-distortion cost of 1,7 ) is 98.
  • the difference between the two is 2, divided by the average value of the leaf node (that is, 100) is 0.02, and the number of tree nodes is two, so that according to Equation 1 above, FIG.
  • the pruning basis is 0.04 (that is, 0.02 * 2). If the threshold ( ⁇ ) is set to 0.1, since the pruning base value is less than or equal to the threshold, the intra prediction for the partition block of the higher depth (that is, the B 0,1 block of 16 ⁇ 16 blocks in this example) Determine your progress.
  • the intra prediction of the partition block of the second depth and the partition block of the upper first depth of the second depth is performed on the partition block of the second depth and the partition block of the third depth. It determines whether or not, and recursively repeats this. That is, when the calculated pruning basis value exceeds a predetermined threshold, the operation for performing intra prediction is performed by not performing intra prediction on a partition block (that is, a partition block of larger size) that is a higher depth. The degree can be greatly reduced.
  • the bottom up pruning technique of the present invention since the result of the rough mode decision (RMD) is smaller than the smaller block size that is more likely to match the result of the rate distortion optimization (RDO), the number of RMDs is increased. You can modify it as follows.

Landscapes

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

Abstract

L'invention concerne un programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de codage vidéo à haute efficacité (HEVC), le programme comprenant les étapes consistant à : (a) déterminer si un second niveau de profondeur de blocs de partition, qui constituent des nœuds inférieurs d'un premier niveau de profondeur de blocs de partition conformément à une structure hiérarchique d'une unité d'arbre de codage (CTU), correspondent à des nœuds feuilles ou à des nœuds d'arbre ; et (b) déterminer s'il faut ou non réaliser une prédiction intra sur le premier niveau de profondeur de blocs de partition, sur la base d'informations de différence entre une valeur moyenne de nœud feuille, qui est une valeur moyenne de coûts de taux de distorsion du second niveau de profondeur de blocs de partition déterminés comme étant des nœuds feuilles, et une valeur moyenne de nœud d'arbre, qui est une valeur moyenne de coûts de taux de distorsion du second niveau de profondeur de blocs de partition déterminés comme étant des nœuds d'arbre.
PCT/KR2014/012253 2014-07-11 2014-12-12 Programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de hevc et appareil associé WO2016006776A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR1020140087344A KR101671759B1 (ko) 2014-07-11 2014-07-11 Hevc에 적용되는 바텀 업 프루닝 기법을 이용한 인트라 예측의 수행 방법 및 이를 위한 장치
KR10-2014-0087344 2014-07-11

Publications (1)

Publication Number Publication Date
WO2016006776A1 true WO2016006776A1 (fr) 2016-01-14

Family

ID=55064384

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2014/012253 WO2016006776A1 (fr) 2014-07-11 2014-12-12 Programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de hevc et appareil associé

Country Status (2)

Country Link
KR (1) KR101671759B1 (fr)
WO (1) WO2016006776A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114979673A (zh) * 2022-05-10 2022-08-30 上海大学 H.266/vvc帧内多类型树结构决策方法及系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20230027947A (ko) 2021-08-20 2023-02-28 선문대학교 산학협력단 비디오 압축 성능 향상 장치 및 방법

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130116056A (ko) * 2009-12-01 2013-10-22 (주)휴맥스 고해상도 영상의 부호화/복호화 방법 및 이를 수행하는 장치
KR101387467B1 (ko) * 2010-06-07 2014-04-22 (주)휴맥스 고해상도 영상의 부호화/복호화 방법 및 이를 수행하는 장치
KR20140056599A (ko) * 2012-10-30 2014-05-12 광주과학기술원 Ｈｅｖｃ 예측 모드 결정 방법 및 장치
KR20140071301A (ko) * 2014-05-07 2014-06-11 삼성전자주식회사 큰 크기의 변환 단위를 이용한 영상 부호화, 복호화 방법 및 장치

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130116056A (ko) * 2009-12-01 2013-10-22 (주)휴맥스 고해상도 영상의 부호화/복호화 방법 및 이를 수행하는 장치
KR101387467B1 (ko) * 2010-06-07 2014-04-22 (주)휴맥스 고해상도 영상의 부호화/복호화 방법 및 이를 수행하는 장치
KR20140056599A (ko) * 2012-10-30 2014-05-12 광주과학기술원 Ｈｅｖｃ 예측 모드 결정 방법 및 장치
KR20140071301A (ko) * 2014-05-07 2014-06-11 삼성전자주식회사 큰 크기의 변환 단위를 이용한 영상 부호화, 복호화 방법 및 장치

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
AN IMPROVED RDO ALGORITHM FOR THE HEVC INTRA ENCODER, 31 December 2003 (2003-12-31) *
EARLY DECISION OF TRANSFORM UNIT FOR HEVC, 31 December 2002 (2002-12-31) *
HIGH EFFICIENCY VIDEO CODING (HEVC) TEST MODEL 3 ENCODER DESCRIPTION, 10 July 2011 (2011-07-10) *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114979673A (zh) * 2022-05-10 2022-08-30 上海大学 H.266/vvc帧内多类型树结构决策方法及系统

Also Published As

Publication number Publication date
KR20160007131A (ko) 2016-01-20
KR101671759B1 (ko) 2016-11-02

Similar Documents

Publication Publication Date Title
WO2009093879A2 (fr) Procédé et appareil destinés à déterminer un mode de codage fondé sur la complexité temporelle et spatiale
Zhang et al. Gradient-based fast decision for intra prediction in HEVC
WO2010095915A2 (fr) Procédé de codage vidéo pour le codage d'un bloc de division, procédé de décodage vidéo pour le décodage d'un bloc de division, et moyen d'enregistrement aux fins d'application desdits procédés
WO2013105791A1 (fr) Procédé et appareil de codage d'image, procédé de décodage d'image et appareil basé sur la normalisation d'un vecteur de mouvement
EP3282701B1 (fr) Procédé, appareil et dispositif de sélection de mode de prédiction
WO2020027513A1 (fr) Système d'analyse d'image basé sur la syntaxe pour image compressée, et procédé de traitement d'interfonctionnement
WO2015122726A1 (fr) Procédé de pvc utilisant des caractéristiques de reconnaissance visuelle
WO2017191891A1 (fr) Procédé et dispositif électronique pour coder un segment d'une intertrame
US20200036987A1 (en) Context reduction of significance map coding of 4 x 4 and 8 x 8 transform coefficient in hm4.0
WO2012115435A2 (fr) Procédé et appareil destinés à coder et à décoder une vidéo à plusieurs vues
WO2016006776A1 (fr) Programme d'ordinateur associé à une technique d'élagage ascendant appliquée à une prédiction intra de hevc et appareil associé
JP2008017305A (ja) 画像処理装置及び画像処理方法
Ting et al. Gradient-based PU size selection for HEVC intra prediction
JP2023101782A (ja) 非直線の非長方形分割を用いた幾何学的分割におけるインター予測
WO2018070556A1 (fr) Procédé et appareil pour extraire des données de mode de prédiction intra d'un bloc carré ou rectangulaire
WO2020248715A1 (fr) Procédé et appareil de gestion de codage faisant appel à un codage vidéo à haute efficacité
WO2010147429A2 (fr) Procédé de filtrage d'image à l'aide d'un filtre à nombre pseudo-aléatoire et appareil apparenté
WO2019112084A1 (fr) Procédé d'élimination de distorsion de compression à l'aide d'un cnn
KR100846780B1 (ko) 움직임 벡터 추정 방법 및 장치
WO2020251124A1 (fr) Procédé, dispositif et système de décodage réparti hevc reposant sur un modèle d'apprentissage machine à l'aide d'une chaîne de blocs
WO2012165886A2 (fr) Procédé destiné à stocker des informations qui se rapportent à une prédiction de déplacement dans un procédé de prédiction entre écrans et procédé destiné à calculer les informations qui se rapportent à une prédiction de déplacement dans le procédé de prédiction entre écrans
WO2014007562A1 (fr) Procédé et dispositif de recherche d'image
WO2019124634A1 (fr) Procédé orienté syntaxe de suivi d'objet dans une vidéo comprimée
WO2017010642A1 (fr) Procédé et dispositif pour réduire une unité de prédiction pour une prédiction inter hevc
WO2016060478A1 (fr) Procédé et appareil pour un traitement vidéo effectué avec des informations de complexité

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: 14897132

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: 14897132

Country of ref document: EP

Kind code of ref document: A1