WO2020140274A1 - 图像编解码方法及装置、电子设备 - Google Patents

图像编解码方法及装置、电子设备 Download PDF

Info

Publication number
WO2020140274A1
WO2020140274A1 PCT/CN2019/070434 CN2019070434W WO2020140274A1 WO 2020140274 A1 WO2020140274 A1 WO 2020140274A1 CN 2019070434 W CN2019070434 W CN 2019070434W WO 2020140274 A1 WO2020140274 A1 WO 2020140274A1
Authority
WO
WIPO (PCT)
Prior art keywords
unit
coding
boundary
coding unit
pipeline data
Prior art date
Application number
PCT/CN2019/070434
Other languages
English (en)
French (fr)
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 富士通株式会社
Priority to PCT/CN2019/070434 priority Critical patent/WO2020140274A1/zh
Publication of WO2020140274A1 publication Critical patent/WO2020140274A1/zh

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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods 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/17—Methods 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/176—Methods 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
    • 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 invention relates to the field of information technology, in particular to an image coding and decoding method and device, and electronic equipment.
  • the CTU may be first divided into quadtrees (quaternary trees), or the CTU may not be used.
  • BT binary tree
  • SPLIT_BT_VER horizontal binary tree split
  • SPLIT_TT_VER vertical tri-tree
  • SPLIT_TT_VER horizontal tri-tree split
  • SPLIT_TT_HOR horizontal tri-tree split
  • each VPDU does not overlap with each other, and each VPDU includes 64 ⁇ 64 Samples of pixels to be processed, that is, luma samples of size 64 ⁇ 64 or chroma samples of 32 ⁇ 32.
  • each VPDU includes 64 ⁇ 64 Samples of pixels to be processed, that is, luma samples of size 64 ⁇ 64 or chroma samples of 32 ⁇ 32.
  • the existing method stipulates that when segmenting an image block in BT or TT, there are the following constraints: (1) For each VPDU containing one or more CUs, the CU is completely included in the VPDU; ( 2) For each CU containing one or more VPDUs, the VPDU is completely contained in the CU. In addition, the following constraints may be proposed: (3) For each CTU, the above two constraints shall not be violated, and the processing order of the CU shall not leave a VPDU and access the VPDU again in the future.
  • TT splitting should not be used for partitioning; (2) For 128 ⁇ 64 or 64 ⁇ 128 CU It should not be partitioned by TT partitioning; (3)) For 128 ⁇ 64 CUs, horizontal BT partitioning is not applied for partitioning; (4) For 64 ⁇ 128 CUs, vertical BT partitioning is not applied for partitioning.
  • Embodiments of the present invention provide an image encoding and decoding method and apparatus, and electronic equipment.
  • the CU When performing CTU region division, for a CU including a boundary of a VPDU, the CU is further divided into 2 TUs or CUs along the boundary to Makes the CTU area partition less restrictive and can conform to the concept of VPDU, thereby improving the efficiency of codec; in addition, when the CU is divided into 2 CUs along the border, it is easier to comply with the existing method Constraints, and because the split is implicit, no signaling is required.
  • an image encoding and decoding method comprising: dividing a coding tree unit (CTU) into at least one coding unit (CU); for a virtual pipeline data unit (VPDU)
  • the coding unit of the boundary the coding unit is divided into 2 coding units or 2 transformation units along the boundary, wherein the boundary of each virtual pipeline data unit is obtained according to the division direction and accumulation when the coding unit is divided
  • the number of samples to be processed is determined; and in the coding tree unit, coding or decoding is performed in the order of coding units.
  • an image coding and decoding device comprising: a first division unit that divides a coding tree unit (CTU) into at least one coding unit (CU); a second division unit , For a coding unit that contains a boundary of a virtual pipeline data unit (VPDU), the coding unit is divided into 2 coding units or 2 transformation units along the boundary, wherein the boundary of each virtual pipeline data unit is based on The division direction and the accumulated number of samples to be processed when the coding unit is obtained by division are determined; and a processing section that performs coding or decoding in the coding tree unit in the order of coding units.
  • CTU coding tree unit
  • CU coding unit
  • VPDU virtual pipeline data unit
  • an electronic device including the device according to the second aspect of the embodiments of the present invention.
  • the beneficial effect of the present invention is that when the CTU is divided into regions, for the CU containing the boundary of the VPDU, the CU is further divided into 2 TUs or CUs along the boundary, so that the restriction when dividing the CTU into regions Less and can meet the concept of VPDU, thereby improving the efficiency of codec;
  • the CU is divided into 2 CUs along the boundary, it is easier to meet the constraints in the existing method, and, due to the division It is implicit, so no signaling is required.
  • FIG. 1 is a schematic diagram of an image encoding and decoding method according to Embodiment 1 of the present invention.
  • FIG. 2 is a schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 3 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 4 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 5 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 6 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 7 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 9 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 10 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 11 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 12 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 13 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 14 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 16 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • FIG. 17 is a schematic diagram of an image encoding and decoding device according to Embodiment 2 of the present invention.
  • FIG. 19 is a schematic block diagram of the system configuration of an electronic device according to Embodiment 3 of the present invention.
  • FIG. 1 is a schematic diagram of an image encoding and decoding method according to Embodiment 1 of the present invention. As shown in Figure 1, the method includes:
  • Step 101 Split the coding tree unit (CTU) into at least one coding unit (CU);
  • Step 102 For a coding unit including a boundary of a virtual pipeline data unit (VPDU), divide the coding unit into 2 coding units or 2 transformation units along the boundary, wherein the boundary of each virtual pipeline data unit is divided according to Determined by the direction of division when the coding unit was obtained and the cumulative amount of samples to be processed; and
  • VPDU virtual pipeline data unit
  • Step 103 In the coding tree unit, coding or decoding is performed in the order of coding units.
  • the CU when the CTU is divided into regions, for the CU including the boundary of the VPDU, the CU is further divided into 2 TUs or CUs along the boundary, so that the restriction on the region division of the CTU is less And it can meet the concept of VPDU, thereby improving the efficiency of encoding and decoding.
  • the CU when the CU is divided into 2 CUs along the boundary, it is easier to meet the constraint conditions in the existing method, and, because the segmentation is Implicit, so no signaling is required.
  • each CTU in the image to be processed is processed one by one in order, and the above steps 101 to 103 are processes for processing each of the CTUs.
  • the image to be processed is, for example, each frame in the video.
  • one CTU contains 128 ⁇ 128 pixel samples, for example, 128 ⁇ 128 luma samples, or 64 ⁇ 64 chroma samples.
  • each VPDU contains 4096 pixel samples, that is, contains 4096 luma samples or 1024 chroma samples, but it is not limited to the form of 64 ⁇ 64 or 32 ⁇ 32.
  • step 101 one CTU is divided into at least one CU, and the manner of division may be determined according to actual needs.
  • the entire CTU is used as a CU, or the CTU is divided into two left and right CUs or two upper and lower CUs in a binary tree (1:1 ratio), or the CTU is divided into a three-tree tree (1:2: (1 scale) is divided into three CUs on the left, middle and right or three CUs on the upper, middle and lower.
  • each CU after being split by a binary tree or a trigeminal tree it may be further divided, for example, further divided by a trigeminal tree.
  • this embodiment for the case where the entire CTU is used as one CU, existing methods can be used for processing; this embodiment mainly describes the case where one CTU is divided into at least 2 CUs.
  • the method may further include:
  • Step 104 Determine whether each CU in the at least one CU obtained by dividing the CTU includes a VPDU boundary.
  • the CU including the boundary of the VPDU means that the inside of the CU includes the boundary of the VPDU.
  • step 104 is an optional step, which is indicated by a dotted frame.
  • each CU obtained by the division in step 101 may be sequentially determined.
  • the following is an exemplary description of a method for determining whether each CU includes a boundary of a VPDU.
  • the size of the CU is equal to the sample size included in the 2 VPDUs, it is determined that the CU includes the boundary of the VPDU.
  • the size of the CU is 128 ⁇ 64 or 64 ⁇ 128, it is determined that the CU contains the boundary of the VPDU.
  • the size of the CU is 128 ⁇ 128, that is, the CTU is not divided in step 101 and the entire CUT is used as a CU, it can be divided according to the existing method, for example, the CU is in the form of a quadtree Split into 4 TUs.
  • the first method is to determine the boundary where the CU contains VPDUs if the CU contains specific samples.
  • the specific sample includes: samples with coordinates (32,64), (64,32), (64,64), (96,64), and (64,96).
  • the second method is to determine the CU that meets the following conditions as the boundary containing the VPDU: the CU is an intermediate CU obtained after at least one tritree split, and the multi-type tree root node of the CU is equal to 2 in size
  • the upper-level nodes of the CU except the root node of the multi-type tree are all intermediate CUs obtained after the tri-tree split.
  • the root node of the multi-type tree of the CU is a CU with a size of 128 ⁇ 64 or 64 ⁇ 128.
  • the parent node of the CU is the intermediate CU obtained after the trigeminal tree is split.
  • the parent node of the CU also has a parent node.
  • the parent node of the CU's parent node is also the middle CU obtained after the tri-tree split.
  • step 104 it is determined which CUs contain the boundary of the VPDU.
  • the location and direction of the boundary of the VPDU in the CU can be further determined.
  • the method may further include:
  • Step 105 Determine the position and direction of the boundary of the VPDU, so that the accumulated sample amount of the VPDU to be processed is a sample of 4096 pixels, and make the boundary extend along the segmentation direction when the CU is obtained by segmentation.
  • the VPDU has a sample of 4096 pixels, and the direction of dividing the CU along the boundary is perpendicular to the direction of division when the CU is obtained .
  • the CU is the middle CU obtained by the horizontal tri-tree split, then the boundary extends along the horizontal direction, that is, the CU will be along the horizontal boundary
  • the CU performs vertical division.
  • the sample size to be processed can be accumulated in the order of the CUs.
  • step 105 the position and direction of the boundary in the CU containing the VPDU boundary are further determined.
  • step 104 and step 105 are optional steps. In this embodiment, other methods may also be used to determine the CU containing the boundary of the VPDU.
  • step 102 for a CU containing a boundary of a VPDU, the CU is divided into 2 CUs or 2 TUs along the boundary, wherein the boundary of each VPDU is obtained according to the division direction and the cumulative waiting time
  • the sample size is determined by processing. For the specific determination method of the boundary, refer to step 105 above.
  • the division in step 102 is a forced division.
  • the CU is divided into two CUs, it is easier to meet the constraint conditions in the existing method, and it is an implicit division and does not require signaling.
  • the solid line in the CTU indicates the boundary of the CU
  • the broken line indicates the boundary of the VPDU
  • the numbers 0-3 in FIGS. 2-16 indicate the number of the VPDU.
  • each CU is numbered.
  • the principle of the numbering is from left to right, and then from top to bottom.
  • VPDUs are numbered according to a similar principle and based on the order of CUs.
  • FIG. 2 is a schematic diagram of CTU segmentation according to Embodiment 1 of the present invention. As shown in Fig. 2, the entire CTU is regarded as a CU, and the number of the CU is 0, which is recorded as CU0. The size of the CU is 128 ⁇ 128, and the CU0 is divided into 4 TUs in four. This method is the same as the existing method.
  • FIG. 3 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided into two CUs horizontally at a 1:1 ratio in a binary tree manner, numbered 0 and 1 from left to right, and denoted as CU0 and CU1.
  • the size of each CU is 64 ⁇ 128, and CU0 and CU1 are further divided into 2 TUs along the boundary of the VPDU.
  • FIG. 4 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is vertically divided into two CUs at the ratio of 1:1 in a binary tree manner and denoted as CU0 and CU1 from top to bottom.
  • the size of each CU is 128 ⁇ 64, and CU0 and CU1 are further divided into 2 TUs along the boundary of the VPDU.
  • FIG. 5 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is split into three left-center-right CUs in a 1:2:1 ratio in the form of a tri-tree, and denoted as CU0, CU1, and CU2 from left to right.
  • the sizes of the three CUs are 32 ⁇ 128, 64 ⁇ 128, and 32 ⁇ 128, respectively.
  • the size of the middle CU1 is equal to the size of the two VPDUs, which includes the boundaries of the two VPDUs numbered 1 and 2, and is vertically divided into two upper and lower TUs according to the boundary.
  • FIG. 6 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is vertically split into three CUs in the upper, middle, and lower CUs in a 1:2:1 ratio in a tri-tree manner, and numbered from left to right as CU0, CU1, and CU2.
  • the sizes of the three CUs are 128 ⁇ 32, 128 ⁇ 64, and 128 ⁇ 32, respectively.
  • the size of the middle CU1 is equal to the size of the two VPDUs.
  • it contains the boundaries of the two VPDUs numbered 1 and 2. According to this boundary, it is divided horizontally into two left and right TUs.
  • FIG. 7 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided into two CUs horizontally at a time of 1:1 in a binary tree manner, and the size of each CU is 64 ⁇ 128; then the left CU is divided again, such as
  • the CU on the left is vertically divided into three CUs in the upper, middle, and lower tiers in the form of a tritree and a ratio of 1:2:1.
  • the numbers for all CUs are 0, 1, 2, and 3.
  • the CU1 since it contains specific samples (32, 64), the CU1 contains the boundary of the VPDU.
  • CU1 is horizontally divided into two left and right TUs.
  • CU3 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 8 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided into two CUs horizontally at a time of 1:1 with a binary tree, and the size of each CU is 64 ⁇ 128; then the CU on the right is divided again, such as As shown in FIG. 8, the CU on the right is vertically divided into three CUs in the upper, middle, and lower tiers in the form of a tri-tree and a ratio of 1:2:1.
  • the numbers of all CUs are 0, 1, 2, 3, and for CU2, since it contains a specific sample (96,64), the CU2 contains the boundary of the VPDU. According to the boundary, the CU2 is horizontally divided into two left and right TUs. In addition, CU0 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 9 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is vertically divided into two upper and lower CUs at a time of 1:1 with a binary tree, and the size of each CU is 128 ⁇ 64; then the upper CU is divided again, such as
  • the above CU is horizontally divided into three CUs in the left, middle, and right again in the form of a tritree and a ratio of 1:2:1.
  • the numbers for all CUs are 0, 1, 2, and 3.
  • the CU1 since it contains specific samples (64, 32), the CU1 contains the boundary of the VPDU.
  • the CU1 is vertically divided into upper and lower TUs.
  • CU3 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 10 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is vertically divided into two upper and lower CUs at a time of 1:1 with a binary tree, and the size of each CU is 128 ⁇ 64; then the following CUs are divided again, as As shown in Fig. 10, the following CU is horizontally divided into three CUs in the left, middle, and right again in the form of a tritree and a ratio of 1:2:1.
  • the numbers for all CUs are 0, 1, 2, 3, and for CU2, since it contains a specific sample (64,96), the CU2 contains the boundary of the VPDU. According to this boundary, CU2 is vertically divided into two upper and lower TUs.
  • CU0 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 11 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is split into three left-center-right CUs at a time of 1:2:1 in the form of a three-tree tree; then the middle CU is divided again, as shown in Figure 11,
  • the middle CU is divided vertically again into three upper, middle and lower CUs in the form of a tri-tree and a ratio of 1:2:1.
  • the middle CU2 contains the boundary of the VPDU. According to this boundary, CU2 is horizontally divided into two left and right TUs.
  • FIG. 12 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided into two CUs horizontally at a time of 1:1 with a binary tree, and the size of each CU is 64 ⁇ 128; then the CU on the left is divided again, such as
  • the left CU is vertically divided into three upper, middle and lower CUs in the form of a three-tree tree with a ratio of 1:2:1, and the middle CU is divided three times to 1:2:1
  • the ratio is divided horizontally into three CUs on the left, center and right. All CUs are numbered 0, 1, 2, 3, 4, and 5.
  • the CU2 contains the boundary of the VPDU. According to the boundary, the CU2 is vertically divided into two upper and lower TUs.
  • the CU5 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 13 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided into two CUs horizontally at a time in a 1:1 ratio by a binary tree, and the size of each CU is 64 ⁇ 128; then the CU on the right is divided again, such as
  • the right CU is divided vertically into three upper, middle and lower CUs in the form of a three-tree tree with a ratio of 1:2:1, and the middle CU is divided three times to 1:2:1
  • the ratio is divided horizontally into three CUs on the left, center and right. All CUs are numbered 0, 1, 2, 3, 4, and 5.
  • the CU3 contains the boundary of the VPDU. According to the boundary, the CU3 is vertically divided into two upper and lower TUs. In addition, CU0 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 14 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is divided vertically into two upper and lower CUs at a time of 1:1 with a binary tree, and the size of each CU is 128 ⁇ 64; and then the upper CU is divided again, such as
  • the above CU is horizontally split into the left, middle, and right three CUs in the form of a three-tree tree with a ratio of 1:2:1, and the middle CU is divided three times to 1:2:1
  • the ratio is divided vertically into three CUs in the upper, middle and lower. All CUs are numbered 0, 1, 2, 3, 4, and 5.
  • the CU2 contains the boundary of the VPDU. According to the boundary, the CU3 is horizontally divided into two left and right TUs. In addition, the CU4 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 15 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is vertically divided into two upper and lower CUs at a time of 1:1 in a binary tree manner, and the size of each CU is 128 ⁇ 64; then the following CUs are divided again, such as
  • the following CU is split horizontally into the left, middle, and right three CUs in a 1:2:1 ratio in the form of a trigeminal tree, and the middle CU is split three times to 1:2:1
  • the ratio is divided vertically into three CUs in the upper, middle and lower. All CUs are numbered 0, 1, 2, 3, 4, and 5.
  • the CU3 contains the boundary of the VPDU. According to the boundary, the CU3 is horizontally divided into two left and right TUs. In addition, CU0 is further divided into two TUs along the boundary of the VPDU.
  • FIG. 16 is another schematic diagram of CTU segmentation according to Embodiment 1 of the present invention.
  • the CTU is split into three left-center-right CUs at a time of 1:2:1 in a three-tree manner, and then the middle CU is divided twice, as shown in Figure 16,
  • the middle CU is divided vertically into the upper, middle, and lower three CUs at a ratio of 1:2:1, and the middle CU is divided three times, and the horizontal division at a ratio of 1:2:1 is Three CUs from left to right. All CUs are numbered 0, 1, 2, 3, 4, 5, and 6.
  • the CU3 contains the boundary of the VPDU. According to the boundary, the CU3 is vertically divided into two upper and lower TUs.
  • a VPDU contains 4096 pixels of samples to be processed, which is not limited to the 64 ⁇ 64 form, but can be divided according to the division of CU or TU Flexible design, so as to be able to comply with the concept of VPDU without excessive restrictions on codec.
  • step 102 for the CU including the boundary of the VPDU, the two division methods may also be combined. For example, for a part of the CUs that include the boundary of the VPDU, the CU is divided into 2 TUs along the boundary; for another part of the CU that includes the boundary of the VPDU, the CU is divided into 2 CUs along the boundary. In this way, the codec can be made more flexible, and the efficiency of the codec can be further improved.
  • the CU when the size of the CU is large, such as 128 ⁇ 128, 128 ⁇ 64, or 64 ⁇ 128, the CU is divided into two TUs along the boundary, when the CU’s When the size is small, the CU is divided into two CUs along the boundary.
  • step 103 the CTU is encoded or decoded in the order of CU.
  • the processing is performed sequentially in units of the number of samples to be processed included in each VPDU. For example, for the cases shown in FIGS. 2 to 16, the processing is performed in units of the number of samples to be processed (samples of 4096 pixels) included in each VPDU in the order of serial numbers 0-3.
  • the specific method of encoding or decoding in the order of CUs can refer to the prior art, and this example does not limit the specific method of encoding or decoding.
  • the CU when the CTU is divided into regions, for the CU including the boundary of the VPDU, the CU is further divided into 2 TUs or CUs along the boundary, so that the restriction on the region division of the CTU is less And it can meet the concept of VPDU, thereby improving the efficiency of encoding and decoding.
  • the CU when the CU is divided into 2 CUs along the boundary, it is easier to meet the constraint conditions in the existing method, and, because the segmentation is Implicit, so no signaling is required.
  • An embodiment of the present invention also provides an image codec device, which corresponds to the image codec method of Embodiment 1.
  • 17 is a schematic diagram of an image codec device according to Embodiment 2 of the present invention. As shown in FIG. 17, the device 200 includes:
  • a first dividing unit 201 which divides the coding tree unit (CTU) into at least one coding unit (CU);
  • the second dividing unit 202 divides the coding unit into 2 coding units or 2 transformation units along the boundary with respect to the coding unit including the boundary of the virtual pipeline data unit (VPDU), wherein each virtual pipeline data unit The boundary of is determined according to the direction of division when the coding unit was obtained and the accumulated sample size to be processed; and
  • the processing unit 203 performs coding or decoding in the order of coding units in the coding tree unit.
  • the device 200 may further include:
  • the first determining unit 204 determines whether each coding unit in the at least one coding unit obtained by dividing the coding tree unit includes a boundary of a virtual pipeline data unit.
  • the first determining unit 204 determines that the coding unit includes the boundary of the virtual pipeline data unit.
  • the first determining unit 204 determines that the coding unit contains virtual pipeline data when the coding unit contains a specific sample The boundary of the unit.
  • the specific sample includes: samples with coordinates (32,64), (64,32), (64,64), (96,64), and (64,96).
  • the first determining unit 204 determines the coding unit that meets the following conditions as the boundary containing the virtual pipeline data unit: the coding unit passes The intermediate coding unit obtained after at least one tritree splitting, and the multi-type tree root node of the coding unit is a coding unit with a size equal to the number of samples contained in the two virtual pipeline data units, except for the multi-type tree root
  • the upper-level nodes other than the nodes are all intermediate coding units obtained after the tri-tree split.
  • the device 200 may further include:
  • the second determining unit 205 determines the position and direction of the boundary of the virtual pipeline data unit, so that the virtual pipeline data unit accumulates a sample amount of 4096 pixels to be processed, and causes the boundary to obtain the The division direction when coding the unit extends.
  • the first determining unit 204 and the second determining unit 205 are optional components, and are indicated by dotted boxes in FIG. 17.
  • the processing unit 203 when the processing unit 203 performs encoding or decoding in the order of encoding units, it processes sequentially according to the amount of samples to be processed included in each virtual pipeline data unit.
  • the second dividing unit 202 divides the coding unit into two transform units along the boundary of a part of the coding unit including the boundary of the virtual pipeline data unit; Part of the coding unit, the coding unit is divided into two coding units along the boundary.
  • FIG. 17 only exemplarily shows the connection relationship between the various components or modules, but those skilled in the art should understand that various related technologies such as bus connection can be used, for example.
  • the above components or modules may be implemented by hardware facilities such as processors, memories, etc.; the implementation of the present invention does not limit this.
  • the image codec device may be a device for encoding and/or decoding an image of a video or a part of the device.
  • the image codec device is an encoder or a decoder.
  • the CU when the CTU is divided into regions, for the CU including the boundary of the VPDU, the CU is further divided into 2 TUs or CUs along the boundary, so that the restriction on the region division of the CTU is less And it can meet the concept of VPDU, thereby improving the efficiency of encoding and decoding.
  • the CU when the CU is divided into 2 CUs along the boundary, it is easier to meet the constraint conditions in the existing method, and, because the segmentation is Implicit, so no signaling is required.
  • FIG. 18 is a schematic diagram of an electronic device according to Embodiment 3 of the present invention. As shown in FIG. 18, the electronic device 300 includes an image codec device 301, wherein the structure and function of the image codec device 301 are the same as those described in Embodiment 2, and are not repeated here.
  • the electronic device 400 may include a central processor 401 and a memory 402; the memory 402 is coupled to the central processor 401.
  • the diagram is exemplary; other types of structures can also be used to supplement or replace the structure to implement telecommunications functions or other functions.
  • the electronic device 400 may further include: an input unit 403, a display 404, and a power supply 405.
  • the functions of the image codec device described in Example 2 can be integrated into the central processor 401.
  • the central processor 401 may be configured to: divide the coding tree unit (CTU) into at least one coding unit (CU); for the coding unit containing the boundary of the virtual pipeline data unit (VPDU), the coding is performed along the boundary
  • the unit is divided into 2 coding units or 2 transformation units, wherein the boundary of each virtual pipeline data unit is determined according to the division direction when the coding unit is obtained by division and the cumulative number of samples to be processed; and in the coding tree unit , Coding or decoding in the order of coding units.
  • the central processor 401 may be further configured to determine whether each coding unit in the at least one coding unit obtained by dividing the coding tree unit contains a boundary of a virtual pipeline data unit.
  • the size of the coding unit is equal to the number of samples contained in the two virtual pipeline data units, it is determined that the coding unit contains the boundary of the virtual pipeline data unit.
  • the size of the coding unit is smaller than the number of samples contained in the two virtual pipeline data units, in the case where the coding unit contains a specific sample, it is determined that the coding unit contains the boundary of the virtual pipeline data unit.
  • the specific sample includes: samples with coordinates (32,64), (64,32), (64,64), (96,64), and (64,96).
  • the coding unit that meets the following conditions is determined as the boundary containing the virtual pipeline data unit: the coding unit is divided by at least one tritree split
  • the obtained intermediate coding unit, and the multi-type tree root node of the coding unit is a coding unit whose size is equal to the number of samples contained in the two virtual pipeline data units, and the upper nodes of the coding unit other than the multi-type tree root node are all It is the middle coding unit obtained after splitting the trigeminal tree.
  • the central processor 401 may be further configured to: determine the position and direction of the boundary of the virtual pipeline data unit, such that the virtual pipeline data unit accumulates a sample of 4096 pixels to be processed, and, such that The boundary extends along the division direction when the coding unit is obtained by division.
  • the processing is performed sequentially according to the amount of samples to be processed included in each virtual pipeline data unit.
  • the coding unit is divided into 2 transform units along the boundary; for another part of the coding units containing the boundary of the virtual pipeline data unit, the coding unit is divided along the boundary The coding unit is divided into 2 coding units.
  • the image codec apparatus described in Example 2 can be configured separately from the central processor 401.
  • the image codec apparatus can be configured as a chip connected to the central processor 401. Control to realize the function of the image codec device.
  • the electronic device 400 does not necessarily include all the components shown in FIG. 19.
  • the central processor 401 is sometimes referred to as a controller or operation control, and may include a microprocessor or other processor devices and/or logic devices.
  • the central processor 401 receives input and controls various components of the electronic device 400 Operation.
  • the memory 402 may be, for example, one or more of a buffer, flash memory, hard drive, removable media, volatile memory, non-volatile memory, or other suitable devices.
  • the central processor 401 can execute the program stored in the memory 402 to realize information storage or processing.
  • the functions of other components are similar to the existing ones and will not be repeated here.
  • the components of the electronic device 400 may be implemented by dedicated hardware, firmware, software, or a combination thereof, without departing from the scope of the present invention.
  • the CU when the CTU is divided into regions, for the CU including the boundary of the VPDU, the CU is further divided into 2 TUs or CUs along the boundary, so that the restriction on the region division of the CTU is less And it can meet the concept of VPDU, thereby improving the efficiency of encoding and decoding.
  • the CU when the CU is divided into 2 CUs along the boundary, it is easier to meet the constraint conditions in the existing method, and, because the segmentation is Implicit, so no signaling is required.
  • An embodiment of the present invention also provides a computer-readable program, wherein when the program is executed in an image codec apparatus or electronic device, the program causes the computer to execute the program in the image codec apparatus or electronic device.
  • An embodiment of the present invention also provides a storage medium storing a computer-readable program, wherein the computer-readable program causes the computer to execute the image codec method described in Embodiment 1 in an image codec apparatus or electronic device.
  • the method for training in the image codec device described in conjunction with the embodiment of the present invention may be directly embodied as hardware, a software module executed by a processor, or a combination of both.
  • one or more of the functional block diagrams shown in FIG. 17 and/or one or more combinations of the functional block diagrams may correspond to each software module of the computer program flow or each hardware module.
  • These software modules can correspond to the steps shown in FIG. 1 respectively.
  • These hardware modules can be realized by solidifying these software modules using, for example, a field programmable gate array (FPGA).
  • FPGA field programmable gate array
  • the software module may be located in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, removable disk, CD-ROM, or any other form of storage medium known in the art.
  • a storage medium may be coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium; or the storage medium may be an integral part of the processor.
  • the processor and the storage medium may be located in the ASIC.
  • the software module can be stored in the memory of the mobile terminal or in a memory card that can be inserted into the mobile terminal.
  • the software module may be stored in the MEGA-SIM card or a larger-capacity flash memory device.
  • One or more of the functional block diagrams described in FIG. 17 and/or one or more combinations of the functional block diagrams may be implemented as a general-purpose processor, a digital signal processor (DSP), dedicated for performing the functions described in this application Integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component, or any suitable combination thereof.
  • DSP digital signal processor
  • ASIC application Integrated circuit
  • FPGA field programmable gate array
  • it can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, multiple microprocessors, One or more microprocessors combined with DSP communication or any other such configuration.

Landscapes

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

Abstract

一种图像编解码方法及装置、电子设备。在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易满足现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。

Description

图像编解码方法及装置、电子设备 技术领域
本发明涉及信息技术领域，尤其涉及一种图像编解码方法及装置、电子设备。
背景技术
在新一代视频编码标准(VVC，Versatile Video Coding)中，对于一个编码树单元(CTU，coding tree unit)，可以首先对该CTU进行四叉树(quaternary tree)分割，或者，也可以不对该CTU进行四叉树分割；接着，对经过四叉树分割后的各个节点或者没有经过四叉树分割的CTU进行多类型树(MTT，multi-type tree)分割，包括垂直方向的二叉树(BT，binary tree)分割(SPLIT_BT_VER)、水平方向的二叉树分割(SPLIT_BT_HOR)、垂直方向的三叉树(TT，ternary tree)分割(SPLIT_TT_VER)以及水平方向的三叉树分割(SPLIT_TT_HOR)。分割后得到的这些节点称为编码单元(CU，coding unit)。
另外，在现有的技术(JVET-K0556)中，定义了虚拟流水线数据单元(VPDU，Virtual pipeline data unit)，在一个图像中，各个VPDU之间相互不重叠，每个VPDU包括64×64个像素的待处理样本，即尺寸为64×64的亮度样本或者32×32的色度样本。在对包含编码器或解码器的电子设备的硬件进行设计时，考虑以每个VPDU即64×64的图像块为单位依次进行处理。
应该注意，上面对技术背景的介绍只是为了方便对本发明的技术方案进行清楚、完整的说明，并方便本领域技术人员的理解而阐述的。不能仅仅因为这些方案在本发明的背景技术部分进行了阐述而认为上述技术方案为本领域技术人员所公知。
发明内容
现有的方法中规定，在对图像块以BT或TT进行分割时，有以下的约束条件：(1)对于包含一个或多个CU的每个VPDU，该CU完全包含在该VPDU中；(2)对于包含一个或多个VPDU的每个CU，该VPDU完全包含在该CU中。另外，还可能提出如下的约束条件：(3)对于每个CTU，不应违反上述两个约束条件，并且CU 的处理顺序不得离开一个VPDU而在以后再次访问该VPDU。
例如，为了符合VPDU的概念，在进行BT或TT分割时，有以下的限制：(1)对于128×128CTU，不应通过TT分割进行分区；(2)对于128×64或64×128的CU，也不应通过TT分割进行分区；(3))对于128×64的CU，不应用水平BT分割进行分区；(4)对于64×128的CU，不应用垂直BT分割进行分区。
如果在满足以上这些限制的基础上对图像块进行分割并按照CU进行编解码等处理，则限制较多，导致编解码的效率较低。
本发明实施例提供一种图像编解码方法及装置、电子设备，在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易符合现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
根据本发明实施例的第一方面，提供一种图像编解码方法，所述方法包括：将编码树单元(CTU)分割为至少一个编码单元(CU)；对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着所述边界将所述编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到所述编码单元时的分割方向和累积的待处理样本量而确定；以及在所述编码树单元中，按照编码单元的顺序进行编码或解码。
根据本发明实施例的第二方面，提供一种图像编解码装置，所述装置包括：第一分割部，其将编码树单元(CTU)分割为至少一个编码单元(CU)；第二分割部，其对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着所述边界将所述编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到所述编码单元时的分割方向和累积的待处理样本量而确定；以及处理部，其在所述编码树单元中，按照编码单元的顺序进行编码或解码。
根据本发明实施例的第三方面，提供一种电子设备，包括根据本发明实施例的第二方面所述的装置。
本发明的有益效果在于：在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿 着该边界将该CU分割为2个CU时，其更容易符合现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
参照后文的说明和附图，详细公开了本发明的特定实施方式，指明了本发明的原理可以被采用的方式。应该理解，本发明的实施方式在范围上并不因而受到限制。在所附权利要求的精神和条款的范围内，本发明的实施方式包括许多改变、修改和等同。
针对一种实施方式描述和/或示出的特征可以以相同或类似的方式在一个或更多个其它实施方式中使用，与其它实施方式中的特征相组合，或替代其它实施方式中的特征。
应该强调，术语“包括/包含”在本文使用时指特征、整件、步骤或组件的存在，但并不排除一个或更多个其它特征、整件、步骤或组件的存在或附加。
附图说明
所包括的附图用来提供对本发明实施例的进一步的理解，其构成了说明书的一部分，用于例示本发明的实施方式，并与文字描述一起来阐释本发明的原理。显而易见地，下面描述中的附图仅仅是本发明的一些实施例，对于本领域普通技术人员来讲，在不付出创造性劳动性的前提下，还可以根据这些附图获得其他的附图。在附图中：
图1是本发明实施例1的图像编解码方法的一示意图；
图2是本发明实施例1的对CTU进行分割的一示意图；
图3是本发明实施例1的对CTU进行分割的另一示意图；
图4是本发明实施例1的对CTU进行分割的另一示意图；
图5是本发明实施例1的对CTU进行分割的另一示意图；
图6是本发明实施例1的对CTU进行分割的另一示意图；
图7是本发明实施例1的对CTU进行分割的另一示意图；
图8是本发明实施例1的对CTU进行分割的另一示意图；
图9是本发明实施例1的对CTU进行分割的另一示意图；
图10是本发明实施例1的对CTU进行分割的另一示意图；
图11是本发明实施例1的对CTU进行分割的另一示意图；
图12是本发明实施例1的对CTU进行分割的另一示意图；
图13是本发明实施例1的对CTU进行分割的另一示意图；
图14是本发明实施例1的对CTU进行分割的另一示意图；
图15是本发明实施例1的对CTU进行分割的另一示意图；
图16是本发明实施例1的对CTU进行分割的另一示意图；
图17是本发明实施例2的图像编解码装置的一示意图；
图18是本发明实施例3的电子设备的一示意图；
图19是本发明实施例3的电子设备的系统构成的一示意框图。
具体实施方式
参照附图，通过下面的说明书，本发明的前述以及其它特征将变得明显。在说明书和附图中，具体公开了本发明的特定实施方式，其表明了其中可以采用本发明的原则的部分实施方式，应了解的是，本发明不限于所描述的实施方式，相反，本发明包括落入所附权利要求的范围内的全部修改、变型以及等同物。
实施例1
本发明实施例提供一种图像编解码方法。图1是本发明实施例1的图像编解码方法的一示意图。如图1所示，该方法包括：
步骤101：将编码树单元(CTU)分割为至少一个编码单元(CU)；
步骤102：对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着该边界将该编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到该编码单元时的分割方向和累积的待处理样本量而确定；以及
步骤103：在该编码树单元中，按照编码单元的顺序进行编码或解码。
由上述实施例可知，在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易满足现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
在本实施例中，对待处理图像中的各个CTU按顺序逐个进行处理，以上步骤101至步骤103是对其中的每个CTU进行处理的过程。该待处理图像例如是视频中的各个帧。
在本实施例中，一个CTU包含128×128个像素的样本，例如，包含128×128个亮度样本，或者，64×64个色度样本。
在本实施例中，每个VPDU包含4096个像素的样本，即，包含4096个亮度样本或1024个色度样本，但是，并不限制为64×64或32×32的形式。
在步骤101中，将一个CTU分割为至少一个CU，其分割的方式可以根据实际需要而确定。
例如，将整个CTU作为一个CU，或者，将CTU以二叉树的方式(1:1的比例)分割为左右两个CU或上下两个CU，或者，将CTU以三叉树的方式(1:2:1的比例)分割为左中右三个CU或上中下三个CU。
对于经过二叉树或三叉树分割后的各个CU，还可以进一步分割，例如，进一步以三叉树的方式进行分割。
在本实施例中，对于将整个CTU作为一个CU的情况，可以使用现有方法进行处理；本实施例主要针对将一个CTU分割为至少2个CU的情况进行说明。
在步骤102之前，如图1所示，该方法还可以包括：
步骤104：确定将该CTU分割得到的该至少一个CU中的各个CU是否包含VPDU的边界。
在本实施例中，包含VPDU的边界的CU是指，该CU的内部包含VPDU的边界。
如图1所示，步骤104为可选步骤，以虚线框表示。
在步骤104中，可以对步骤101中分割得到的各个CU依次进行判断。
以下对确定各个CU中是否包含VPDU的边界的方法进行示例性的说明。
在本实施例中，当该CU的尺寸等于2个VPDU包含的样本量时，确定该CU包含VPDU的边界。
例如，当该CU的尺寸为128×64或64×128时，确定该CU包含VPDU的边界。
另外，当该CU的尺寸为128×128，即在步骤101中没有对CTU分割而将整个CUT作为一个CU时，可以按照现有的方法进行分割，例如，将该CU以四叉树的方式分割为4个TU。
在本实施例中，当该CU的尺寸小于2个VPDU包含的样本量时，可以有两种判断方法。
第一种方法是，在该CU包含特定样本的情况下，确定该CU包含VPDU的边界。
例如，该特定样本包括：坐标为(32,64)、(64,32)、(64,64)、(96,64)以及(64,96)的样本。
第二种方法是，将满足以下条件的CU确定为包含VPDU的边界：该CU是经过至少一次三叉树分割后得到的中间的CU，并且，该CU的多类型树根节点是尺寸等于2个VPDU包含的样本量的CU，该CU的除了多类型树根节点以外的上级节点均为三叉树分割后得到的中间的CU。
例如，该CU的多类型树根节点是尺寸为128×64或64×128的CU，该CU的父节点为三叉树分割后得到的中间的CU，在该CU父节点也存在父节点的情况下，该CU的父节点的父节点也是三叉树分割后得到的中间的CU。
通过上述步骤104，确定了哪些CU中包含VPDU的边界。对于包含VPDU的边界的CU，还可以进一步确定该CU中的VPDU的边界的位置和方向。
在步骤102之前，如图1所示，该方法还可以包括：
步骤105：确定VPDU的该边界的位置和方向，使得该VPDU累积的待处理样本量为4096个像素的样本，并且，使得该边界沿着分割得到该CU时的分割方向延伸。
也就是说，通过确定VPDU的该边界的位置和方向，使得该VPDU具有4096个像素的样本，并且，沿着该边界对该CU进行分割的方向与分割得到该CU时的分割方向是垂直的。
例如，对于具有VPDU边界的某个CU，该CU是通过水平方向的三叉树分割而得到的中间的CU，那么，该边界沿着水平方向延伸，即，对该CU沿着水平的边界而将该CU进行垂直方向的分割。
另外，对于包含多个CU的VPDU，可以按照CU的顺序而累积其待处理的样本量。
这样，通过上述步骤105，进一步确定了包含VPDU边界的CU中该边界的位置和方向。
在本实施例中，步骤104和步骤105为可选步骤，本实施例还可以使用其他方法确定包含VPDU的边界的CU。
在步骤102中，对于包含VPDU的边界的CU，沿着该边界将该CU分割为2个 CU或2个TU，其中，每个VPDU的边界根据分割得到该CU时的分割方向和累积的待处理样本量而确定，边界的具体确定方法可参见以上的步骤105。
在本实施例中，步骤102中的分割为强制分割。另外，对于将CU分割为2个CU的情况，其更容易满足现有方法中的约束条件，并且，其属于隐性分割，不需要信令。
以下，以对包含VPDU的边界的CU分割为2个TU为例，对本实施例的CTU进行分割的方式进行示例性的说明。
在本实施例的图2-16中，在对CTU进行分割时，CTU内的实线表示CU的边界，虚线表示VPDU的边界，图2-16中的编号0-3表示VPDU的编号。
另外，在对CUT分割得到各个CU后，对各个CU进行编号，其编号的原则是先从左到右、再从上到下。另外，VPDU也按照类似的原则，并基于CU的顺序进行编号。
图2是本发明实施例1的对CTU进行分割的一示意图。如图2所示，将整个CTU作为一个CU，该CU的编号为0，记为CU0。该CU的尺寸为128×128，将该CU0以四分割为4个TU。该方法与现有方法相同。
图3是本发明实施例1的对CTU进行分割的另一示意图。如图3所示，将CTU以二叉树的方式并以1:1的比例水平分割为左右两个CU，从左至右编号为0和1，记为CU0和CU1。每个CU的尺寸为64×128，分别将CU0和CU1沿着VPDU的边界进一步分割为2个TU。
图4是本发明实施例1的对CTU进行分割的另一示意图。如图4所示，将CTU以二叉树的方式并以1:1的比例垂直分割为上下两个CU，从上到下记为CU0和CU1。每个CU的尺寸为128×64，分别将CU0和CU1沿着VPDU的边界进一步分割为2个TU。
图5是本发明实施例1的对CTU进行分割的另一示意图。如图5所示，将CTU以三叉树的方式并以1:2:1的比例水平分割为左中右三个CU，从左到右记为CU0、CU1和CU2。三个CU的尺寸分别为32×128、64×128、32×128。如图5所示，中间的CU1的尺寸等于两个VPDU的尺寸，其包含编号为1和2的这两个VPDU的边界，按照该边界，将其垂直分割为上下两个TU。
图6是本发明实施例1的对CTU进行分割的另一示意图。如图6所示，将CTU 以三叉树的方式并以1:2:1的比例垂直分割为上中下三个CU，从左到右编号记为CU0、CU1和CU2。三个CU的尺寸分别为128×32、128×64、128×32。中间的CU1的尺寸等于两个VPDU的尺寸，如图6所示，其包含编号为1和2的这两个VPDU的边界，按照该边界，将其水平分割为左右两个TU。
图7是本发明实施例1的对CTU进行分割的另一示意图。如图7所示，将CTU以二叉树的方式并以1:1的比例一次水平分割为左右两个CU，每个CU的尺寸为64×128；然后再对左边的CU进行二次分割，如图7所示，以三叉树的方式并以1:2:1的比例将左边的CU再次垂直分割为上中下三个CU。对所有的CU编号为0、1、2、3，对于CU1，由于其包含特定样本(32,64)，则该CU1包含VPDU的边界。按照该边界将CU1水平分割为左右两个TU。另外，将CU3沿着VPDU的边界进一步分割为2个TU。
图8是本发明实施例1的对CTU进行分割的另一示意图。如图8所示，将CTU以二叉树的方式并以1:1的比例一次水平分割为左右两个CU，每个CU的尺寸为64×128；然后再对右边的CU进行二次分割，如图8所示，以三叉树的方式并以1:2:1的比例将右边的CU再次垂直分割为上中下三个CU。对所有的CU编号为0、1、2、3，对于CU2，由于其包含特定样本(96,64)，则该CU2包含VPDU的边界。按照该边界将该CU2水平分割为左右两个TU。另外，将CU0沿着VPDU的边界进一步分割为2个TU。
图9是本发明实施例1的对CTU进行分割的另一示意图。如图9所示，将CTU以二叉树的方式并以1:1的比例一次垂直分割为上下两个CU，每个CU的尺寸为128×64；然后再对上面的CU进行二次分割，如图9所示，以三叉树的方式并以1:2:1的比例将上面的CU再次水平分割为左中右三个CU。对所有的CU编号为0、1、2、3，对于CU1，由于其包含特定样本(64,32)，则该CU1包含VPDU的边界。按照该边界将该CU1垂直分割为上下两个TU。另外，将CU3沿着VPDU的边界进一步分割为2个TU。
图10是本发明实施例1的对CTU进行分割的另一示意图。如图10所示，将CTU以二叉树的方式并以1:1的比例一次垂直分割为上下两个CU，每个CU的尺寸为128×64；然后再对下面的CU进行二次分割，如图10所示，以三叉树的方式并以1:2:1的比例将下面的CU再次水平分割为左中右三个CU。对所有的CU编号为0、1、2、 3，对于CU2，由于其包含特定样本(64,96)，则该CU2包含VPDU的边界。按照该边界将CU2垂直分割为上下两个TU。另外，将CU0沿着VPDU的边界进一步分割为2个TU。
图11是本发明实施例1的对CTU进行分割的另一示意图。如图11所示，将CTU以三叉树的方式并以1:2:1的比例一次水平分割为左中右三个CU；然后再对中间的CU进行二次分割，如图11所示，以三叉树的方式并以1:2:1的比例将中间的CU再次垂直分割为上中下三个CU。对所有的CU编号为0、1、2、3、4，对于中间的CU2，由于其包含特定样本(64,64)，则该CU2包含VPDU的边界。按照该边界将CU2水平分割为左右两个TU。
图12是本发明实施例1的对CTU进行分割的另一示意图。如图12所示，将CTU以二叉树的方式并以1:1的比例一次水平分割为左右两个CU，每个CU的尺寸为64×128；然后再对左边的CU进行二次分割，如图12所示，以三叉树的方式并以1:2:1的比例将左边的CU二次垂直分割为上中下三个CU，并对中间的CU进行三次分割，以1:2:1的比例水平分割为左中右三个CU。对所有的CU编号为0、1、2、3、4、5，对于CU2，由于其包含特定样本(32,64)，则该CU2包含VPDU的边界。按照该边界将该CU2垂直分割为上下两个TU。另外，将CU5沿着VPDU的边界进一步分割为2个TU。
图13是本发明实施例1的对CTU进行分割的另一示意图。如图13所示，将CTU以二叉树的方式并以1:1的比例一次水平分割为左右两个CU，每个CU的尺寸为64×128；然后再对右边的CU进行二次分割，如图13所示，以三叉树的方式并以1:2:1的比例将右边的CU二次垂直分割为上中下三个CU，并对中间的CU进行三次分割，以1:2:1的比例水平分割为左中右三个CU。对所有的CU编号为0、1、2、3、4、5，对于CU3，由于其包含特定样本(96,64)，则该CU3包含VPDU的边界。按照该边界将该CU3垂直分割为上下两个TU。另外，将CU0沿着VPDU的边界进一步分割为2个TU。
图14是本发明实施例1的对CTU进行分割的另一示意图。如图14所示，将CTU以二叉树的方式并以1:1的比例一次垂直分割为上下两个CU，每个CU的尺寸为128×64；然后再对上面的CU进行二次分割，如图14所示，以三叉树的方式并以1:2:1的比例将上面的CU二次水平分割为左中右三个CU，并对中间的CU进行三次分割， 以1:2:1的比例垂直分割为上中下三个CU。对所有的CU编号为0、1、2、3、4、5，对于CU2，由于其包含特定样本(64,32)，则该CU2包含VPDU的边界。按照该边界将该CU3水平分割为左右两个TU。另外，将CU4沿着VPDU的边界进一步分割为2个TU。
图15是本发明实施例1的对CTU进行分割的另一示意图。如图15所示，将CTU以二叉树的方式并以1:1的比例一次垂直分割为上下两个CU，每个CU的尺寸为128×64；然后再对下面的CU进行二次分割，如图15所示，以三叉树的方式并以1:2:1的比例将下面的CU二次水平分割为左中右三个CU，并对中间的CU进行三次分割，以1:2:1的比例垂直分割为上中下三个CU。对所有的CU编号为0、1、2、3、4、5，对于CU3，由于其包含特定样本(64,96)，则该CU3包含VPDU的边界。按照该边界将该CU3水平分割为左右两个TU。另外，将CU0沿着VPDU的边界进一步分割为2个TU。
图16是本发明实施例1的对CTU进行分割的另一示意图。如图16所示，将CTU以三叉树的方式并以1:2:1的比例一次水平分割为左中右三个CU，然后再对中间的CU进行二次分割，如图16所示，以三叉树的方式并以1:2:1的比例将中间的CU二次垂直分割为上中下三个CU，并对中间的CU进行三次分割，以1:2:1的比例水平分割为左中右三个CU。对所有的CU编号为0、1、2、3、4、5、6，对于CU3，由于其包含特定样本(64,64)，则该CU3包含VPDU的边界。按照该边界将该CU3垂直分割为上下两个TU。
从图3至图16的各个示例可以看出，通过步骤101和步骤102，一个VPDU包含了4096个像素的待处理样本，其不限于64×64的形式，而可以根据CU或TU的划分而灵活的设计，从而能够符合VPDU的概念且不对编解码进行过多的限制。
在步骤102中，对于包含VPDU的边界的CU，也可以将两种分割方式结合。例如，对于包含VPDU的边界的一部分CU，沿着该边界将该CU分割为2个TU；对于包含VPDU的边界的另一部分CU，沿着该边界将该CU分割为2个CU。这样，能够使得编解码更加的灵活，进一步提高编解码的效率。
例如，对于包含VPDU的边界的CU，当该CU的尺寸较大，例如为128×128、128×64或64×128时，将该CU沿着该边界分割为两个TU，当该CU的尺寸较小时，将该CU沿着该边界分割为两个CU。
在经过了步骤101和步骤102的对CTU的分割之后，在步骤103中，在该CTU中，按照CU的顺序进行编码或解码。
在按照CU的顺序进行编码或解码时，按照每个VPDU包含的待处理样本量为单位依次进行处理。例如，对于图2至图16所示的情况，按照序号0-3的顺序，以每个VPDU包含的待处理样本量(4096个像素的样本)为单位进行处理。
例如，对于图12所示的情况，第一次处理编号为0的VPDU包含的数据，即CU0、CU1和CU2的上面一个TU的数据，第二次处理编号为1的VPDU包含的数据，即CU2的下面一个TU、CU3和CU4的数据，第三次处理编号为2的VPDU包含的数据，即CU5的部分数据(CU5的上面一个TU)，第四次处理编号为3的VPDU包含的数据，即CU5的另一部分数据(CU5的下面一个TU)。
在本实施例中，按照CU的顺序进行编码或解码的具体方法可以参考现有技术，本实例不对编码或解码的具体方法进行限制。
由上述实施例可知，在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易满足现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
实施例2
本发明实施例还提供一种图像编解码装置，其对应于实施例1的图像编解码方法。图17是本发明实施例2的图像编解码装置的一示意图。如图17所示，装置200包括：
第一分割部201，其将编码树单元(CTU)分割为至少一个编码单元(CU)；
第二分割部202，其对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着该边界将该编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到该编码单元时的分割方向和累积的待处理样本量而确定；以及
处理部203，其在该编码树单元中，按照编码单元的顺序进行编码或解码。
在本实施例中，如图17所示，该装置200还可以包括：
第一确定部204，其确定将该编码树单元分割得到的该至少一个编码单元中的各 个编码单元是否包含虚拟流水线数据单元的边界。
在本实施例中，该第一确定部204当该编码单元的尺寸等于2个虚拟流水线数据单元包含的样本量时，确定该编码单元包含虚拟流水线数据单元的边界。
在本实施例中，该第一确定部204当该编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，在该编码单元包含特定样本的情况下，确定该编码单元包含虚拟流水线数据单元的边界。
例如，该特定样本包括：坐标为(32,64)、(64,32)、(64,64)、(96,64)以及(64,96)的样本。
或者，该第一确定部204当该编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，将满足以下条件的该编码单元确定为包含虚拟流水线数据单元的边界：该编码单元是经过至少一次三叉树分割后得到的中间的编码单元，并且，该编码单元的多类型树根节点是尺寸等于2个虚拟流水线数据单元包含的样本量的编码单元，该编码单元的除了多类型树根节点以外的上级节点均为三叉树分割后得到的中间的编码单元。
在本实施例中，如图17所示，该装置200还可以包括：
第二确定部205，其确定该虚拟流水线数据单元的该边界的位置和方向，使得该虚拟流水线数据单元累积的待处理样本量为4096个像素的样本，并且，使得该边界沿着分割得到该编码单元时的分割方向延伸。
在本实施例中，该第一确定部204和第二确定部205为可选部件，在图17中用虚线框表示。
在本实施例中，该处理部203在按照编码单元的顺序进行编码或解码时，按照每个虚拟流水线数据单元包含的待处理样本量依次进行处理。
在本实施例中，该第二分割部202对于包含虚拟流水线数据单元的边界的一部分编码单元，沿着该边界将该编码单元分割为2个变换单元；对于包含虚拟流水线数据单元的边界的另一部分编码单元，沿着该边界将该编码单元分割为2个编码单元。
在本实施例中，上述各个部件的功能的实现可以参见实施例1中的图像编解码方法的各个步骤的实施，此处不再赘述。
此外，为了简单起见，图17中仅示例性示出了各个部件或模块之间的连接关系，但是本领域技术人员应该清楚的是，例如可以采用总线连接等各种相关技术。上述各 个部件或模块可以通过例如处理器、存储器等硬件设施来实现；本发明实施并不对此进行限制。
在本实施例中，该图像编解码装置可以是用于对视频的图像进行编码和/或解码的装置或该装置的一部分。例如，该图像编解码装置是编码器或解码器。
由上述实施例可知，在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易满足现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
实施例3
本发明实施例还提供了一种电子设备，图18是本发明实施例3的电子设备的一示意图。如图18所示，电子设备300包括图像编解码装置301，其中，图像编解码装置301的结构和功能与实施例2中的记载相同，此处不再赘述。
图19是本发明实施例3的电子设备的系统构成的一示意框图。如图19所示，电子设备400可以包括中央处理器401和存储器402；存储器402耦合到中央处理器401。该图是示例性的；还可以使用其它类型的结构，来补充或代替该结构，以实现电信功能或其它功能。
如图19所示，该电子设备400还可以包括：输入单元403、显示器404、电源405。
在一个实施方式中，实施例2所述的图像编解码装置的功能可以被集成到中央处理器401中。其中，中央处理器401可以被配置为：将编码树单元(CTU)分割为至少一个编码单元(CU)；对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着该边界将该编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到该编码单元时的分割方向和累积的待处理样本量而确定；以及在该编码树单元中，按照编码单元的顺序进行编码或解码。
例如，该中央处理器401还可以被配置为：确定将该编码树单元分割得到的该至少一个编码单元中的各个编码单元是否包含虚拟流水线数据单元的边界。
例如，当该编码单元的尺寸等于2个虚拟流水线数据单元包含的样本量时，确定该编码单元包含虚拟流水线数据单元的边界。
例如，当该编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，在该编码单元包含特定样本的情况下，确定该编码单元包含虚拟流水线数据单元的边界。
例如，该特定样本包括：坐标为(32,64)、(64,32)、(64,64)、(96,64)以及(64,96)的样本。
例如，当该编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，将满足以下条件的该编码单元确定为包含虚拟流水线数据单元的边界：该编码单元是经过至少一次三叉树分割后得到的中间的编码单元，并且，该编码单元的多类型树根节点是尺寸等于2个虚拟流水线数据单元包含的样本量的编码单元，该编码单元的除了多类型树根节点以外的上级节点均为三叉树分割后得到的中间的编码单元。
例如，该中央处理器401还可以被配置为：确定该虚拟流水线数据单元的该边界的位置和方向，使得该虚拟流水线数据单元累积的待处理样本量为4096个像素的样本，并且，使得该边界沿着分割得到该编码单元时的分割方向延伸。
例如，在按照编码单元的顺序进行编码或解码时，按照每个虚拟流水线数据单元包含的待处理样本量依次进行处理。
例如，对于包含虚拟流水线数据单元的边界的一部分编码单元，沿着该边界将该编码单元分割为2个变换单元；对于包含虚拟流水线数据单元的边界的另一部分编码单元，沿着该边界将该编码单元分割为2个编码单元。
在另一个实施方式中，实施例2所述的图像编解码装置可以与中央处理器401分开配置，例如可以将图像编解码装置配置为与中央处理器401连接的芯片，通过中央处理器401的控制来实现图像编解码装置的功能。
在本实施例中电子设备400也并不是必须要包括图19中所示的所有部件。
如图19所示，中央处理器401有时也称为控制器或操作控件，可以包括微处理器或其它处理器装置和/或逻辑装置，中央处理器401接收输入并控制电子设备400的各个部件的操作。
存储器402，例如可以是缓存器、闪存、硬驱、可移动介质、易失性存储器、非易失性存储器或其它合适装置中的一种或更多种。并且中央处理器401可执行该存储器402存储的该程序，以实现信息存储或处理等。其它部件的功能与现有类似，此处不再赘述。电子设备400的各部件可以通过专用硬件、固件、软件或其结合来实现，而不偏离本发明的范围。
由上述实施例可知，在对CTU进行区域分割时，对于包含VPDU的边界的CU，沿着该边界将该CU进一步分割为2个TU或CU，以使得对CTU进行区域分割时的限制较少且能够符合VPDU的概念，从而提高了编解码的效率；另外，当沿着该边界将该CU分割为2个CU时，其更容易满足现有方法中的约束条件，并且，由于该分割是隐性的，因此不需要信令。
本发明实施例还提供一种计算机可读程序，其中当在用于图像编解码装置或电子设备中执行所述程序时，所述程序使得计算机在所述图像编解码装置或电子设备中执行实施例1所述的图像编解码方法。
本发明实施例还提供一种存储有计算机可读程序的存储介质，其中所述计算机可读程序使得计算机在图像编解码装置或电子设备中执行实施例1所述的图像编解码方法。
结合本发明实施例描述的在图像编解码装置中进行训练的方法可直接体现为硬件、由处理器执行的软件模块或二者组合。例如，图17中所示的功能框图中的一个或多个和/或功能框图的一个或多个组合，既可以对应于计算机程序流程的各个软件模块，亦可以对应于各个硬件模块。这些软件模块，可以分别对应于图1所示的各个步骤。这些硬件模块例如可利用现场可编程门阵列(FPGA)将这些软件模块固化而实现。
软件模块可以位于RAM存储器、闪存、ROM存储器、EPROM存储器、EEPROM存储器、寄存器、硬盘、移动磁盘、CD-ROM或者本领域已知的任何其它形式的存储介质。可以将一种存储介质耦接至处理器，从而使处理器能够从该存储介质读取信息，且可向该存储介质写入信息；或者该存储介质可以是处理器的组成部分。处理器和存储介质可以位于ASIC中。该软件模块可以存储在移动终端的存储器中，也可以存储在可插入移动终端的存储卡中。例如，若设备(例如移动终端)采用的是较大容量的MEGA-SIM卡或者大容量的闪存装置，则该软件模块可存储在该MEGA-SIM卡或者大容量的闪存装置中。
针对图17描述的功能框图中的一个或多个和/或功能框图的一个或多个组合，可以实现为用于执行本申请所描述功能的通用处理器、数字信号处理器(DSP)、专用集成电路(ASIC)、现场可编程门阵列(FPGA)或其它可编程逻辑器件、分立门或晶体管逻辑器件、分立硬件组件、或者其任意适当组合。针对图17描述的功能框图 中的一个或多个和/或功能框图的一个或多个组合，还可以实现为计算设备的组合，例如，DSP和微处理器的组合、多个微处理器、与DSP通信结合的一个或多个微处理器或者任何其它这种配置。
以上结合具体的实施方式对本发明进行了描述，但本领域技术人员应该清楚，这些描述都是示例性的，并不是对本发明保护范围的限制。本领域技术人员可以根据本发明的精神和原理对本发明做出各种变型和修改，这些变型和修改也在本发明的范围内。

Claims (19)

  1. 一种图像编解码方法，所述方法包括：
    将编码树单元(CTU)分割为至少一个编码单元(CU)；
    对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着所述边界将所述编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到所述编码单元时的分割方向和累积的待处理样本量而确定；以及
    在所述编码树单元中，按照编码单元的顺序进行编码或解码。
  2. 根据权利要求1所述的方法，其中，所述方法还包括：
    确定将所述编码树单元分割得到的所述至少一个编码单元中的各个编码单元是否包含虚拟流水线数据单元的边界。
  3. 根据权利要求2所述的方法，其中，
    当所述编码单元的尺寸等于2个虚拟流水线数据单元包含的样本量时，确定所述编码单元包含虚拟流水线数据单元的边界。
  4. 根据权利要求2所述的方法，其中，
    当所述编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，
    在所述编码单元包含特定样本的情况下，确定所述编码单元包含虚拟流水线数据单元的边界。
  5. 根据权利要求4所述的方法，其中，
    所述特定样本包括：坐标为(32,64)、(64,32)、(64,64)、(96,64)以及(64,96)的样本。
  6. 根据权利要求2所述的方法，其中，
    当所述编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，将满足以下条件的所述编码单元确定为包含虚拟流水线数据单元的边界：
    所述编码单元是经过至少一次三叉树分割后得到的中间的编码单元，并且，所述编码单元的多类型树根节点是尺寸等于2个虚拟流水线数据单元包含的样本量的编码单元，所述编码单元的除了多类型树根节点以外的上级节点均为三叉树分割后得到的中间的编码单元。
  7. 根据权利要求1所述的方法，其中，所述方法还包括：
    确定所述虚拟流水线数据单元的所述边界的位置和方向，使得所述虚拟流水线数据单元累积的待处理样本量为4096个像素的样本，并且，使得所述边界沿着分割得到所述编码单元时的分割方向延伸。
  8. 根据权利要求1所述的方法，其中，
    在按照编码单元的顺序进行编码或解码时，按照每个虚拟流水线数据单元包含的待处理样本量依次进行处理。
  9. 根据权利要求1所述的方法，其中，
    对于包含虚拟流水线数据单元的边界的一部分编码单元，沿着所述边界将所述编码单元分割为2个变换单元；
    对于包含虚拟流水线数据单元的边界的另一部分编码单元，沿着所述边界将所述编码单元分割为2个编码单元。
  10. 一种图像编解码装置，所述装置包括：
    第一分割部，其将编码树单元(CTU)分割为至少一个编码单元(CU)；
    第二分割部，其对于包含虚拟流水线数据单元(VPDU)的边界的编码单元，沿着所述边界将所述编码单元分割为2个编码单元或2个变换单元，其中，每个虚拟流水线数据单元的边界根据分割得到所述编码单元时的分割方向和累积的待处理样本量而确定；以及
    处理部，其在所述编码树单元中，按照编码单元的顺序进行编码或解码。
  11. 根据权利要求10所述的装置，其中，所述装置还包括：
    第一确定部，其确定将所述编码树单元分割得到的所述至少一个编码单元中的各个编码单元是否包含虚拟流水线数据单元的边界。
  12. 根据权利要求11所述的装置，其中，
    所述第一确定部当所述编码单元的尺寸等于2个虚拟流水线数据单元包含的样本量时，确定所述编码单元包含虚拟流水线数据单元的边界。
  13. 根据权利要求11所述的装置，其中，
    所述第一确定部当所述编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，在所述编码单元包含特定样本的情况下，确定所述编码单元包含虚拟流水线数据单元的边界。
  14. 根据权利要求13所述的装置，其中，
    所述特定样本包括：坐标为(32,64)、(64,32)、(64,64)、(96,64)以及(64,96)的样本。
  15. 根据权利要求11所述的装置，其中，
    所述第一确定部当所述编码单元的尺寸小于2个虚拟流水线数据单元包含的样本量时，将满足以下条件的所述编码单元确定为包含虚拟流水线数据单元的边界：
    所述编码单元是经过至少一次三叉树分割后得到的中间的编码单元，并且，所述编码单元的多类型树根节点是尺寸等于2个虚拟流水线数据单元包含的样本量的编码单元，所述编码单元的除了多类型树根节点以外的上级节点均为三叉树分割后得到的中间的编码单元。
  16. 根据权利要求10所述的装置，其中，所述装置还包括：
    第二确定部，其确定所述虚拟流水线数据单元的所述边界的位置和方向，使得所述虚拟流水线数据单元累积的待处理样本量为4096个像素的样本，并且，使得所述边界沿着分割得到所述编码单元时的分割方向延伸。
  17. 根据权利要求10所述的装置，其中，
    所述处理部在按照编码单元的顺序进行编码或解码时，按照每个虚拟流水线数据单元包含的待处理样本量依次进行处理。
  18. 根据权利要求10所述的装置，其中，
    所述第二分割部对于包含虚拟流水线数据单元的边界的一部分编码单元，沿着所述边界将所述编码单元分割为2个变换单元；对于包含虚拟流水线数据单元的边界的另一部分编码单元，沿着所述边界将所述编码单元分割为2个编码单元。
  19. 一种电子设备，包括根据权利要求10所述的装置。
PCT/CN2019/070434 2019-01-04 2019-01-04 图像编解码方法及装置、电子设备 WO2020140274A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/070434 WO2020140274A1 (zh) 2019-01-04 2019-01-04 图像编解码方法及装置、电子设备

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2019/070434 WO2020140274A1 (zh) 2019-01-04 2019-01-04 图像编解码方法及装置、电子设备

Publications (1)

Publication Number Publication Date
WO2020140274A1 true WO2020140274A1 (zh) 2020-07-09

Family

ID=71406827

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/070434 WO2020140274A1 (zh) 2019-01-04 2019-01-04 图像编解码方法及装置、电子设备

Country Status (1)

Country Link
WO (1) WO2020140274A1 (zh)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103957415A (zh) * 2014-03-14 2014-07-30 北方工业大学 基于屏幕内容视频的cu分割方法和装置
US20170347095A1 (en) * 2016-05-25 2017-11-30 Arris Enterprises Llc Jvet quadtree plus binary tree (qtbt) structure with multiple asymmetrical partitioning
US20180288437A1 (en) * 2017-03-31 2018-10-04 Mediatek Inc. Coding Transform Blocks

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103957415A (zh) * 2014-03-14 2014-07-30 北方工业大学 基于屏幕内容视频的cu分割方法和装置
US20170347095A1 (en) * 2016-05-25 2017-11-30 Arris Enterprises Llc Jvet quadtree plus binary tree (qtbt) structure with multiple asymmetrical partitioning
US20180288437A1 (en) * 2017-03-31 2018-10-04 Mediatek Inc. Coding Transform Blocks

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
JACKIE MA ET AL: "Summary report for CE1: Partitioning", JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16, no. L0021-v2, 12 October 2018 (2018-10-12), Macao CN, pages 1 - 16, XP030194366 *
MIN WOO PARK ET AL: "CE1-related: Split Constraint Considering Picture Boundary Condition", JOINT VIDEO EXPLORATION TEAM OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16, no. JVET-L0050_V1, 12 October 2018 (2018-10-12), Macao CN, pages 1 - 10, XP030249870 *

Similar Documents

Publication Publication Date Title
CN109792539B (zh) 用于二叉树分割模式编码的方法和装置
CN110855988B (zh) 用于视频编码的替代变换的方法及装置
CN104023241A (zh) 帧内预测编码的视频编码方法及视频编码装置
US20220078479A1 (en) Method, device and electronic equipment for coding/decoding based on restricting range of bv
CN107155093B (zh) 一种视频预览方法、装置及设备
CN105959797A (zh) 一种视频解码方法及数字电视
CN108537729B (zh) 图像无级缩放方法、计算机装置及计算机可读存储介质
CN106791919A (zh) 多媒体信息处理方法、装置和电子设备
US8582653B2 (en) Coding apparatus and coding method
EP3761646A1 (en) Context modelling method and device for partition flag bit
JP2005535198A (ja) ビデオデータをフィルタリングするための装置及び方法。
WO2020140274A1 (zh) 图像编解码方法及装置、电子设备
CN105594206B (zh) 用于视频压缩中的帧内图片区块复制的方法和装置
US20210105472A1 (en) Reducing redundancy between tree types
US10715832B2 (en) Method and apparatus of block partition for VR360 video coding
CN105721870A (zh) Hevc中编码单元分割方式的判定方法及装置
WO2022179354A1 (zh) 样点自适应补偿的边界补偿模式的数据处理方法、装置
WO2019174567A1 (zh) 划分标志位的上下文建模方法及装置
US20220217399A1 (en) Prediction method for current block and electronic device
CN114938455A (zh) 基于单元特性的编码方法、装置、电子设备及存储介质
CN110115026B (zh) 在电子装置中在矩形投影上产生360度内容的方法和系统
CN101729903B (zh) 一种读取参考帧数据的方法、系统和多媒体处理器
JP2008052522A (ja) 画像データアクセス装置及び画像データアクセス方法
WO2021056211A1 (zh) 视频编码、解码方法及装置、电子设备
CN113660490A (zh) 编码单元的划分方法、编码方法、电子装置及存储介质

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

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

Country of ref document: EP

Kind code of ref document: A1