[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN103826134A - Image intra-frame prediction method and apparatus - Google Patents

Image intra-frame prediction method and apparatus Download PDF

Info

Publication number
CN103826134A
CN103826134A CN201410111041.8A CN201410111041A CN103826134A CN 103826134 A CN103826134 A CN 103826134A CN 201410111041 A CN201410111041 A CN 201410111041A CN 103826134 A CN103826134 A CN 103826134A
Authority
CN
China
Prior art keywords
row
partition
pixel
pixel point
column
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.)
Granted
Application number
CN201410111041.8A
Other languages
Chinese (zh)
Other versions
CN103826134B (en
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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN201410111041.8A priority Critical patent/CN103826134B/en
Publication of CN103826134A publication Critical patent/CN103826134A/en
Application granted granted Critical
Publication of CN103826134B publication Critical patent/CN103826134B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The embodiment of the invention provides an image intra-frame prediction method and an apparatus. The method comprises the steps of dividing a current coding depth unit into a first partition and a second partition; depending on distribution of pixel points in the first partition and the second partition, determining a first pixel point in a reference pixel as a CPV predicted value of the first partition, and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition; carrying out intra-frame prediction on the current coding depth unit depending on the CPV predicted value of the first partition and the CPV predicted value of the second partition. According to the embodiment of the invention, CPV predicted values of two partitions are directly determined, thus reducing complexity of selecting CPV and avoiding influence on a coding result.

Description

Image intra-frame prediction method and device
Technical Field
The present invention relates to image coding technologies, and in particular, to a method and an apparatus for intra prediction of an image.
Background
In the video coding process, a certain spatial correlation exists between adjacent coding units in a frame of image, and for a current coding unit, prediction coding can be performed by using adjacent reference pixel values around the current coding unit, which is called intra-frame prediction. The intra prediction method in the new generation of video Coding standard, i.e. High Efficiency Video Coding (HEVC) standard, is used for approximate smooth region Coding, but Coding flaws are easily generated for very sharp boundaries, and these Coding flaws may be shown in the synthesis intermediate viewpoint.
In order to better realize prediction of sharp boundaries of a Depth map, a Depth model prediction coding mode (DMM) for Depth image coding is newly added on the basis of an intra prediction mode of the HEVC standard in the 3D-HEVC (three dimensional-video coding) standard. The DMM predictive coding mode is to approximate a current coded depth unit into a block with two partitions and equal size, and all sample point values in each Partition in the block model are expressed by a Partition Constant Value (CPV). For a given partition, it is optimal to use the original depth pattern point signal mean approximation of the corresponding area as the CPV value, however, since the decoding end cannot obtain the sample point information of the original depth map, the 3D-HEVC standard further compensates the CPV value of each partition by finding the CPV difference value (Δ CPV), which requires an additional prediction of one CPV value.
In the prior art, the CPV value is obtained mainly by averaging two reference pixels, comparing the reference pixels, and the like, but these methods are complicated to operate.
Disclosure of Invention
The embodiment of the invention provides an image intra-frame prediction method and device, which are used for solving the problem of complex operation of determining a CPV value in the prior art.
A first aspect of an embodiment of the present invention provides an image intra prediction method, including:
dividing a current coded depth unit into a first partition and a second partition;
according to the distribution of the pixel points in the first partition and the second partition, determining a first pixel point in a reference pixel as a partition constant value (CPV) predicted value of the first partition, and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition;
performing intra-frame prediction on the current coding depth unit according to the CPV prediction value of the first partition and the CPV prediction value of the second partition;
wherein the current coded depth unit comprises N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
With reference to the first aspect, in a first possible implementation manner of the first aspect, the pixel point in the 1 st row and the 1 st column in the current coded depth unit and the pixel point in the 1 st row and the nth column in the current coded depth unit belong to the first partition, and the pixel point in the 1 st row and the nth column in the current coded depth unit belong to the second partition;
the determining a first pixel point in the reference pixel as a partition constant value (CPV) predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition includes:
and determining the pixel point of the N/2 th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition.
With reference to the first aspect, in a second possible implementation manner of the first aspect, the pixel point in the 1 st row and the N th column in the current coded depth unit belongs to the second partition, and the pixel point in the 1 st row and the pixel point in the 1 st column and the N th row belong to the first partition;
the determining a first pixel point in the reference pixel as a partition constant value (CPV) predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition includes:
and determining the pixel point of the (N/2) th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition.
With reference to the first aspect, in a third possible implementation manner of the first aspect, the pixel point in the line 1 and the line N in the column 1 in the current coded depth unit both belong to the first partition or both belong to the second partition;
the determining, in the reference pixel, a first pixel point as a partition constant value (CPV) prediction value of the first partition includes:
determining a pixel point of the 1 st column in the reference pixel row as a CPV predicted value of the first partition; or,
determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition;
or,
and determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in a fourth possible implementation manner of the first aspect, the pixel point in the 1 st row and the pixel point in the 1 st column and the pixel point in the 1 st row and the pixel point in the nth column in the current coded depth unit both belong to the first partition, and the pixel point in the nth row and the nth column in the current coded depth unit belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
determining a pixel point of the 2N column in the reference pixel row as a CPV predicted value of the second partition; or,
and determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, the pixel point in the 1 st row and the pixel point in the 1 st column and the pixel point in the 1 st row and the pixel point in the nth column in the current coded depth unit both belong to the first partition, and the pixel point in the nth row and the nth column in the current coded depth unit belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
comparing a first absolute value with a second absolute value, wherein the first absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point of a 1 st column, and the second absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel row and a pixel point of the 1 st column;
if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition;
and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the pixel point in the 1 st row and the pixel point in the 1 st column and the pixel point in the 1 st row and the pixel point in the nth column in the current coded depth unit both belong to the first partition, and the pixel point in the nth row and the nth column in the current coded depth unit belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
comparing a third absolute value with a fourth absolute value, wherein the third absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect;
if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition;
and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition;
or,
and determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in an eighth possible implementation manner of the first aspect, the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
comparing a fifth absolute value with a sixth absolute value, wherein the fifth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of a 1 st row, and the sixth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of the 1 st row;
if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition;
and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
With reference to the first aspect or the third possible implementation manner of the first aspect, in a ninth possible implementation manner of the first aspect, the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
comparing the magnitude of a seventh absolute value and an eighth absolute value, wherein the seventh absolute value is the absolute value of the difference value between the pixel point of the (N + 1) th column in the reference pixel row and the pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is the absolute value of the difference value between the pixel point of the (N + 1) th column in the reference pixel column and the pixel point where the reference pixel row and the reference pixel column intersect;
if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition;
and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
A second aspect of the embodiments of the present invention provides an image intra prediction apparatus, including:
a partition unit for dividing a current coded depth unit into a first partition and a second partition;
the determining unit is used for determining a first pixel point in a reference pixel as a partition constant value CPV predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition according to the distribution of the pixel points in the first partition and the second partition;
the coding unit is used for carrying out intra-frame prediction on the current coding depth unit according to the CPV predicted value of the first partition and the CPV predicted value of the second partition;
wherein the current coded depth unit comprises N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
With reference to the second aspect, in a first possible implementation manner of the second aspect, the determining unit is specifically configured to determine, when a pixel in a 1 st row and a pixel in a 1 st column in the current coded depth unit and a pixel in a 1 st row and an nth column in the 1 st row belong to the first partition, that a pixel in an N/2 th column in the reference pixel row is the CPV prediction value of the first partition, and that a pixel in an N +1 th row in the reference pixel row is the CPV prediction value of the second partition.
With reference to the second aspect, in a second possible implementation manner of the second aspect, the determining unit is specifically configured to determine, when a pixel point in a 1 st row and an nth column in the current coded depth unit belongs to the second partition, and a pixel point in a 1 st row and a pixel point in a 1 st column and an nth row in the 1 st column belong to the first partition, a pixel point in an N/2 th row in the reference pixel column is the CPV predicted value of the first partition, and a pixel point in an N +1 th column in the reference pixel row is determined to be the CPV predicted value of the second partition.
With reference to the second aspect, in a third possible implementation manner of the second aspect, the determining unit is specifically configured to determine, when both a pixel point in the 1 st row and the nth column in the current coded depth unit and a pixel point in the 1 st column and the nth row in the current coded depth unit belong to the first partition or both belong to the second partition, that a pixel point in the 1 st column in the reference pixel row is a CPV predicted value of the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition; or determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
With reference to the second aspect or the third possible implementation manner of the second aspect, in a fourth possible implementation manner of the second aspect, the determining unit is specifically configured to determine that, when a pixel point in the current coded depth unit in the 1 st row and the nth column and a pixel point in the 1 st row and the nth column both belong to the first partition and a pixel point in the current coded depth unit in the nth row and the nth column belong to the second partition, a pixel point in the 2 nth column in the reference pixel row is a CPV predicted value of the second partition; or determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
With reference to the second aspect or the third possible implementation manner of the second aspect, in a fifth possible implementation manner of the second aspect, the determining unit is specifically configured to compare a first absolute value and a second absolute value when a pixel point of a line 1 and a line N in the current coded depth unit both belong to the first partition and a pixel point of a line N in the current coded depth unit belongs to the second partition, where the first absolute value is an absolute value of a difference between a pixel point of a line 2N in the reference pixel line and a pixel point of a line 1 in the reference pixel line, and the second absolute value is an absolute value of a difference between a pixel point of a line 2N in the reference pixel line and a pixel point of a line 1 in the reference pixel line; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
With reference to the second aspect or the third possible implementation manner of the second aspect, in a sixth possible implementation manner of the second aspect, the determining unit is specifically configured to compare a third absolute value and a fourth absolute value when a pixel point in a line 1 and a line N in a line 1 in the current coded depth unit both belong to the first partition, and a pixel point in a line N and a line N in the current coded depth unit belong to the second partition, where the third absolute value is an absolute value of a difference between a pixel point in a line 2 and a line N in the reference pixel line and a pixel point where the reference pixel line and the reference pixel line intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in a line 2 and a line N in the reference pixel line and a pixel point where the reference pixel line and the reference pixel line intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
With reference to the second aspect or the third possible implementation manner of the second aspect, in a seventh possible implementation manner of the second aspect, the determining unit is specifically configured to determine, when a pixel in a line 1 and a column N in the current coded depth unit, a pixel in a line 1 and a column N in the line 1 and a pixel in a column N in the line N belong to the second partition, and a pixel in a line 1 and a column 1 in the current coded depth unit belongs to the first partition, that a pixel in a line N +1 in the reference pixel line is a CPV predicted value of the second partition; or, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
With reference to the second aspect or the third possible implementation manner of the second aspect, in an eighth possible implementation manner of the second aspect, the determining unit is specifically configured to compare a fifth absolute value and a sixth absolute value when a pixel point in a line 1 and a column N in the current coded depth unit, a pixel point in a line 1 and a column N in the line 1 and the column N in the current coded depth unit all belong to the second partition, and a pixel point in a line 1 and a column 1 in the current coded depth unit belongs to the first partition, where the fifth absolute value is an absolute value of a difference value between a pixel point in a line N +1 in the reference pixel line and a pixel point in a line 1, and the sixth absolute value is an absolute value of a difference value between a pixel point in a line N +1 in the reference pixel line and a pixel point in a line 1; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
In combination with the second aspect or the third possible embodiment of the second aspect, in a ninth possible embodiment of the second aspect, the determining unit is specifically configured to determine that the pixel point in the 1 st row and the nth column, the pixel point in the 1 st row and the nth row, and the pixel point in the nth row and the nth column in the current coded depth unit all belong to the second partition, and when the pixel point of the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, comparing the magnitude of the seventh absolute value with the magnitude of the eighth absolute value, the seventh absolute value is an absolute value of a difference value between a pixel point of an N +1 th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, the eighth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
In the embodiment of the invention, a current coding depth unit is divided into a first partition and a second partition, a first pixel point is determined in a reference pixel as a CPV predicted value of the first partition according to the distribution of pixel points in the first partition and the second partition, a second pixel point is determined as the CPV predicted value of the second partition, and the current coding depth unit is coded by adopting the CPV predicted value of the first partition and the CPV predicted value of the second partition. The CPV predicted values of the two partitions are directly determined, the complexity is reduced, and the encoding result is not influenced.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
FIG. 1 is a flowchart illustrating a first embodiment of a method for intra prediction of an image according to the present invention;
FIG. 2 is a schematic diagram of a second embodiment of a method for intra prediction of an image according to the present invention;
FIG. 3 is a pixel diagram illustrating a third embodiment of an intra prediction method according to the present invention;
FIG. 4 is a pixel diagram illustrating a fourth embodiment of an intra prediction method according to the present invention;
FIG. 5 is a schematic diagram of a fifth embodiment of an intra prediction method for an image according to the present invention;
FIG. 6 is a schematic diagram of a sixth embodiment of an intra prediction method for an image according to the present invention;
FIG. 7 is a schematic diagram of a seventh embodiment of a method for intra prediction according to the present invention;
FIG. 8 is a schematic diagram of a pixel of an eighth embodiment of an intra prediction method according to the present invention;
FIG. 9 is a schematic diagram illustrating a first embodiment of an apparatus for intra prediction according to the present invention;
fig. 10 is a schematic structural diagram of a second embodiment of an image intra prediction apparatus according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic flowchart of a first embodiment of an image intra-frame prediction method provided by the present invention, fig. 2 is a schematic pixel diagram of a second embodiment of the image intra-frame prediction method provided by the present invention, fig. 3 is a schematic pixel diagram of a third embodiment of the image intra-frame prediction method provided by the present invention, fig. 4 is a schematic pixel diagram of a fourth embodiment of the image intra-frame prediction method provided by the present invention, fig. 5 is a schematic pixel diagram of a fifth embodiment of the image intra-frame prediction method provided by the present invention, as shown in fig. 1, the method includes:
s101, dividing the current coded depth unit into a first partition and a second partition. I.e., the current coded depth unit is divided into two partitions.
And S102, according to the distribution of the pixel points in the first partition and the second partition, determining a first pixel point in a reference pixel as a CPV predicted value of the first partition, and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition.
Specifically, the CPV prediction values of the first partition and the second partition may be determined according to which pixel points are respectively included in the first partition and the second partition.
And S103, performing intra prediction on the current coding depth unit according to the CPV predicted value of the first partition and the CPV predicted value of the second partition.
It should be noted that the current coded depth unit includes N × N pixels, that is, N rows and N columns of pixels, as shown in fig. 2 to 5, the current coded depth unit of 8 × 8 is taken as an example for description, where each square represents one pixel. In the schematic diagram of the embodiment of the invention, white squares all belong to a first partition, diagonal shaded squares all belong to a second partition, and squares marked with coordinate symbols are all reference pixels.
The reference pixels include a reference pixel row and a reference pixel column, wherein the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, the 1 st row of the reference pixel row is aligned with the 1 st row of the current coded depth unit, and generally, the reference pixel row may include at most 2N +1 pixel points; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, the 1 st row of the reference pixel row is aligned with the 1 st row of the current coded depth unit, and generally, the reference pixel row may include at most 2N +1 pixel points. It should be noted that the pixel point where the reference pixel row and the reference pixel column intersect is a starting point of the reference pixel row and the reference pixel column. Taking FIG. 1 as an example, the square marked with the coordinate number is the reference pixel point, p-1,-1~p15,-1Belonging to a reference pixel row, p-1,-1~p-1,15Belonging to a reference pixel column, where p-1,-1The pixel points where the reference pixel row and the reference pixel column intersect are the pixels. For convenience of explanation, p is used in the examples of the present invention0,-1The 1 st column of pixel points as reference pixel row is p-1,0As a reference imageAnd the 1 st row pixel point of the pixel column.
In this embodiment, a current coding depth unit is divided into a first partition and a second partition, a first pixel point is determined in a reference pixel as a CPV predicted value of the first partition according to distribution of pixel points in the first partition and the second partition, a second pixel point is determined as the CPV predicted value of the second partition, and the current coding depth unit is coded by using the CPV predicted value of the first partition and the CPV predicted value of the second partition. The CPV predicted values of the two partitions are directly determined, the complexity is reduced, and the encoding result is not influenced.
Further, when the pixel point in the nth row in the 1 st line and the pixel point in the nth row in the 1 st line in the current coded depth unit both belong to the first partition or both belong to the second partition, the determining, in the reference pixel, the first pixel point as the CPV predicted value of the first partition specifically includes: and determining a first pixel point in the reference pixel row as the CPV predicted value of the first partition.
Optionally, when both the pixel point in the line 1 and the line N in the line 1 and the pixel point in the line 1 and the line N in the current coding depth unit belong to the first partition or both belong to the second partition, the determining, in the reference pixel, that the second pixel point is the CPV predicted value of the second partition may be determining, in the reference pixel line, the second pixel point as the CPV predicted value of the second partition. But not limited thereto.
On the basis of the above embodiment, (a) a distribution of pixel points is as follows: the pixel point of the line 1 nth row, the pixel point of the line 1 nth row and the pixel point of the line 1 st row in the current coding depth unit all belong to the first partition, and when the pixel point of the line N nth row in the current coding depth unit belongs to the second partition, for example, the pixel point shown in fig. 2 is distributed, the above-mentioned determining the first pixel point in the reference pixel as the CPV predicted value of the first partition specifically is: determining the pixel point of the 1 st column in the reference pixel row as the CPV predicted value of the first partition, or determining the pixel point of the reference pixel row and the reference pixel column which are intersected as the CPV of the first partitionAnd (5) predicting the value. Referring to FIG. 2, i.e. determining p0,-1For the CPV prediction value of the first partition, or, determining p-1,-1Is the CPV predicted value for the first partition.
In the foregoing (a), the determining that the second pixel point is the CPV predicted value of the second partition specifically includes: 1) and determining the pixel point of the 2N column in the reference pixel row as the CPV predicted value of the second partition. Referring to FIG. 2, p is determined15,-1And the CPV predicted value of the second partition is obtained. Or, 2) comparing the magnitude of the first absolute value and the second absolute value. Wherein the first absolute value is an absolute value of a difference between a pixel point of the 2N-th column and a pixel point of the 1 st column in the reference pixel row, refer to fig. 2, that is, the first absolute value is | p15,-1-p0,-1L, |; the second absolute value is the absolute value of the difference between the pixel point in the 2N th row and the pixel point in the 1 st row in the reference pixel column, referring to fig. 2, that is, the second absolute value is | p-1,15-p-1,0L. If the first absolute value is greater than the second absolute value, determining the pixel point in the 2N-th column in the reference pixel row as the CPV value of the second partition, referring to fig. 2, that is, determining p15,-1Is the CPV value of the second zone; if the first absolute value is less than or equal to the second absolute value, determining the pixel point in the 2N-th row in the reference pixel column as the CPV value of the second partition, referring to fig. 2, i.e. determining p-1,15The CPV value of the second partition. Or, 3) comparing the magnitudes of the third and fourth absolute values. Wherein the third absolute value is an absolute value of a difference between a pixel point in the 2 nth row in the reference pixel row and a pixel point at which the reference pixel row and the reference pixel column intersect, referring to fig. 2, that is, the third absolute value is | p15,-1-p-1,-1L, |; the fourth absolute value is the absolute value of the difference between the pixel point in the 2N-th row in the reference pixel column and the pixel point where the reference pixel row and the reference pixel column intersect, referring to fig. 2, that is, the fourth absolute value is | p-1,15-p-1,-1L. If the third absolute value is greater than the fourth absolute value, determining that the pixel point in the 2N-th column in the reference pixel row is the CPV value of the second partition, referring to fig. 2, that is, determining p15,-1The CPV value of the second partition. If the third absolute value is less than or equal to the fourth absolute value,determining the pixel point in the 2N-th row in the reference pixel column as the CPV value of the second partition, referring to FIG. 2, i.e. determining p-1,15The CPV value of the second partition.
In another embodiment, (b) a distribution of pixel points is as follows: the pixel point of the 1 st row and the nth column in the current coding depth unit, the pixel point of the 1 st row and the pixel point of the nth row in the current coding depth unit all belong to the second partition, and the pixel point of the 1 st row and the 1 st column in the current coding depth unit belongs to the first partition, for example, the pixel point distribution shown in fig. 3, and the determining of the first pixel point in the reference pixel as the CPV predicted value of the first partition specifically includes: and determining the pixel point of the 1 st column in the reference pixel row as the CPV predicted value of the first partition, or determining the pixel point of the reference pixel row intersected with the reference pixel column as the CPV predicted value of the first partition. Referring to FIG. 3, i.e. determining p0,-1For CPV prediction value of the first partition, or, determining p-1,-1Is the CPV predicted value for the first partition.
Under the condition of the step (b), determining a second pixel point in the reference pixel as the CPV predicted value of the second partition, specifically: (1) and determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition. Referring to FIG. 3, i.e. determining p8,-1Is the CPV prediction value for the second partition. Or, (2) comparing the magnitude of the fifth absolute value with the magnitude of the sixth absolute value. Wherein the fifth absolute value is an absolute value of a difference between a pixel point of the N +1 th column and a pixel point of the 1 st column in the reference pixel row, referring to fig. 3, that is, the fifth absolute value is | p8,-1-p0,-1L, |; the sixth absolute value is the absolute value of the difference between the pixel point of the N +1 th row and the pixel point of the 1 st row in the reference pixel column, referring to fig. 3, that is, the sixth absolute value is | p-1,8-p-1,0L. If the fifth absolute value is greater than the sixth absolute value, determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition, referring to FIG. 3, that is, determining p8,-1Is the CPV prediction value for the second partition. If the fifth absolute value is less than or equal to the sixth absolute value, determining that the N +1 th row of pixels in the reference pixel row refers to FIG. 3The CPV prediction value of the second partition is determined by referring to FIG. 3, i.e., p is determined-1,8Is the CPV prediction value for the second partition. Or, (3) comparing magnitudes of the seventh absolute value and the eighth absolute value. Wherein the seventh absolute value is an absolute value of a difference between a pixel point of the N +1 th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, referring to fig. 3, the fifth absolute value is | p8,-1-p-1,-1L, |; the eighth absolute value is an absolute value of a difference between a pixel point of the N +1 th row in the reference pixel row and a pixel point where the reference pixel row and the reference pixel row intersect, and referring to fig. 3, the eighth absolute value is | p-1,8-p-1,-1L. If the seventh absolute value is greater than the eighth absolute value, determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition, referring to fig. 3, that is, determining p8,-1Is the CPV prediction value for the second partition. If the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition, referring to fig. 3, that is, determining p-1,8Is the CPV prediction value for the second partition.
In the specific implementation process, the embodiments are not limited to the foregoing embodiments.
For example, in another embodiment of the present invention, for a case that both a pixel point in the line 1 and the line N of the current coded depth unit and a pixel point in the line 1 and the line N of the current coded depth unit belong to the first partition or both belong to the second partition, the determining, in the reference pixel, a first pixel point as the partition constant value CPV predicted value of the first partition includes: determining a pixel point of the 1 st column in the reference pixel row as a CPV predicted value of the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition; or determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
In another embodiment of the present invention, for a case that both the pixel in the 1 st row and the pixel in the nth column in the 1 st row in the current coded depth unit belong to the first partition and the pixel in the nth row and the pixel in the nth column in the current coded depth unit belong to the second partition, the determining, in the reference pixel, that the second pixel is the CPV prediction value of the second partition includes: determining a pixel point of the 2N column in the reference pixel row as a CPV predicted value of the second partition; or determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment of the present invention, for a case that both the pixel in the 1 st row and the pixel in the nth column in the 1 st row in the current coded depth unit belong to the first partition and the pixel in the nth row and the pixel in the nth column in the current coded depth unit belong to the second partition, the determining, in the reference pixel, that the second pixel is the CPV prediction value of the second partition includes: comparing a first absolute value with a second absolute value, wherein the first absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point of a 1 st column, and the second absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel row and a pixel point of the 1 st column; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment of the present invention, for a case that both the pixel in the 1 st row and the pixel in the nth column in the 1 st row in the current coded depth unit belong to the first partition and the pixel in the nth row and the pixel in the nth column in the current coded depth unit belong to the second partition, the determining, in the reference pixel, that the second pixel is the CPV prediction value of the second partition includes: comparing a third absolute value with a fourth absolute value, wherein the third absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment of the present invention, for a case that the pixel in the 1 st row and the nth column, the pixel in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, the determining, in the reference pixel, that the second pixel is the CPV predicted value of the second partition includes: determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition; or, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment of the present invention, for a case that the pixel in the 1 st row and the nth column, the pixel in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, the determining, in the reference pixel, that the second pixel is the CPV predicted value of the second partition includes: comparing a fifth absolute value with a sixth absolute value, wherein the fifth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of a 1 st row, and the sixth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of the 1 st row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment of the present invention, for a case that the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, comparing magnitudes of a seventh absolute value and an eighth absolute value, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
The specific implementation principle and scheme are similar to those of the foregoing embodiments, and the determined first pixel point and the second pixel point can be reasonably combined, which is not listed here.
In another embodiment, (c) a distribution of pixel points is as follows: when the pixel point in the 1 st row and the 1 st column in the current coding depth unit and the pixel point in the 1 st row and the nth column in the current coding depth unit belong to the first partition, and the pixel point distribution shown in fig. 4 can be referred to, the determining of the first pixel point in the reference pixel as the CPV prediction value of the first partition and the determining of the second pixel point in the reference pixel as the CPV prediction value of the second partition specifically include: and determining the pixel point of the N/2 th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition. Referring to FIG. 4, p is determined3,-1Determining p for CPV prediction value of first partition-1,8And the CPV predicted value of the second partition is obtained.
In another embodiment, (d) a distribution of pixel points is as follows: when the pixel point in the 1 st row and the nth column in the current coding depth unit belongs to the second partition, and the pixel point in the 1 st row and the nth column belongs to the first partition, as shown in fig. 5, the determining, in the reference pixel, the first pixel point as the CPV predicted value of the first partition and the second pixel point as the CPV predicted value of the second partition specifically includes:
and determining the pixel point of the (N/2) th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition. Referring to FIG. 5, p is determined-1,3Determining p for CPV prediction value of first partition8,-1Is the CPV prediction value for the second partition.
Fig. 6 is a schematic diagram of a pixel of a sixth embodiment of the image intra prediction method provided by the present invention, and regarding the pixel distribution of (b): the pixel point of the 1 st line and the Nth line in the current coding depth unit, the pixel point of the 1 st line and the pixel point of the Nth line and the Nth line in the current coding depth unit all belong to the second partition, and the pixel point of the 1 st line and the 1 st line in the current coding depth unit belongs to the first partition, the pixel point of the (N + 1) th line in the reference pixel line or the CPV predicted value of the second partition of the (N + 1) th line in the reference pixel line is determined, and the CPV predicted value can be further prevented from being wrong. As shown in fig. 6, in the extreme case that the pixel point distribution of the first partition and the second partition is as shown in 6A in fig. 6, the actual boundary of the current coded depth unit may extend to the "dot" shaded square part as shown in 6B in fig. 6, in which case if p is determined according to the comparison result according to the prior art, p is determined7,-1Or p-1,7If the CPV prediction value is the CPV prediction value of the second partition, the CPV prediction value may be wrong, which affects the accuracy of intra prediction. This problem does not occur with the method of the previous embodiment of the present invention.
Fig. 7 is a schematic diagram of a seventh pixel of the image intra prediction method according to the present invention, and for the pixel distribution in (c): the current coding depthAnd in the unit, the 1 st row and 1 st column pixel point and the 1 st row and N column pixel point belong to the first partition, the 1 st row and N column pixel point belong to the second partition, the pixel point of the (N + 1) th row in the reference pixel column is determined to be the CPV predicted value of the second partition, and the CPV predicted value can be prevented from being wrong. As shown in FIG. 7, in the extreme case that the pixel distribution of the first partition and the second partition is as shown in FIG. 7A, the actual boundary of the current coded depth unit may extend to the shaded square portion of the "dot" as shown in FIG. 7B, in which case if p is determined according to the prior art-1,7If the CPV prediction value is the CPV prediction value of the second partition, the CPV prediction value may be wrong, which affects the accuracy of intra prediction. This problem does not occur with the method of the previous embodiment of the present invention.
Fig. 8 is a schematic diagram of pixels of an eighth embodiment of the image intra prediction method provided by the present invention, and for the pixel distribution of (d): and the pixel point of the 1 st line and the Nth line in the current coding depth unit belongs to the second partition, the pixel point of the 1 st line and the Nth line belongs to the first partition, the pixel point of the (N + 1) th line in the reference pixel line is determined as the CPV predicted value of the second partition, and the CPV predicted value can be prevented from being wrong. As shown in FIG. 8, in the extreme case that the pixel distribution of the first partition and the second partition is as shown in 8A in FIG. 8, the actual boundary of the current coded depth unit may extend to the shaded square portion of the "dot" as shown in 8B in FIG. 8, in which case if p is determined according to the prior art7,-1If the CPV prediction value is the CPV prediction value of the second partition, the CPV prediction value may be wrong, which affects the accuracy of intra prediction. This problem does not occur with the method of the previous embodiment of the present invention.
Fig. 9 is a schematic structural diagram of a first embodiment of an image intra prediction apparatus according to the present invention, as shown in fig. 9, the apparatus includes: a partition unit 901, a determination unit 902 and an encoding unit 903. Wherein:
a partition unit 901, configured to divide the current coded depth unit into a first partition and a second partition.
A determining unit 902, configured to determine, according to the distribution of the pixel points in the first partition and the second partition, a first pixel point in the reference pixel as a partition constant value CPV predicted value of the first partition, and determine a second pixel point in the reference pixel as a CPV predicted value of the second partition.
And an encoding unit 903, configured to perform intra prediction on the current coded depth unit according to the CPV prediction value of the first partition and the CPV prediction value of the second partition.
It should be noted that the current coded depth unit includes N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
The device is used for executing the method embodiments, and the implementation principle and the technical effect are similar, and are not described herein again.
In another embodiment, the determining unit 902 may be specifically configured to determine, when both a pixel point in the line 1 and the line N in the column 1 in the current coded depth unit belong to the first partition or both belong to the second partition, a first pixel point in the reference pixel line as the CPV predicted value of the first partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when both a pixel point in the nth row in the 1 st line and a pixel point in the nth row in the 1 st line in the current coded depth unit belong to the first partition or both belong to the second partition, a second pixel point in the reference pixel row as a partition constant value CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel point in the current coded depth unit in the line 1 and the line N, a pixel point in the line 1 and the line N and a pixel point in the line 1 and the line 1 all belong to the first partition, and a pixel point in the current coded depth unit in the line N and the line N belongs to the second partition, that a pixel point in the line 1 in the reference pixel line is a CPV predicted value of the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as the CPV predicted value of the first partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel point in the nth row and the nth column in the 1 st row, a pixel point in the nth row and the pixel point in the 1 st row and the 1 st column in the current coded depth unit all belong to the first partition, and when a pixel point in the nth row and the nth column in the current coded depth unit belongs to the second partition, a pixel point in the 2 nth column in the reference pixel row is a CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare a first absolute value with a second absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the first partition, and the pixel point in the current coded depth unit in the nth row and the nth column in the current coded depth unit belongs to the second partition, where the first absolute value is an absolute value of a difference between the pixel point in the 2N th row in the reference pixel row and the pixel point in the 1 st column, and the second absolute value is an absolute value of a difference between the pixel point in the 2N th row in the reference pixel row and the pixel point in the 1 st row; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to, when a pixel point in an nth row and a pixel point in an nth column in a 1 st row, a pixel point in an nth row in a 1 st row, and a pixel point in an nth column in a 1 st row in the current coded depth unit all belong to the first partition, and a pixel point in an nth row and an nth column in the current coded depth unit belong to the second partition, compare a third absolute value with a fourth absolute value, where the third absolute value is an absolute value of a difference between a pixel point in a 2 nth row in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in a 2 nth row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel in the nth row and the nth column in the 1 st row, a pixel in the nth row and a pixel in the nth column in the current coded depth unit all belong to the second partition, and a pixel in the 1 st row and the 1 st column in the current coded depth unit belong to the first partition, that a pixel in the 1 st column in the reference pixel row is the CPV predicted value of the first partition; or determining the pixel point where the reference pixel row and the reference pixel column intersect as the CPV predicted value of the first partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when all of the pixel point in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column in the current coded depth unit belong to the second partition, and when the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, the pixel point in the N +1 th column in the reference pixel row is the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare a fifth absolute value with a sixth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, where the fifth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point in the 1 st row, and the sixth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point in the 1 st row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare magnitudes of a seventh absolute value and an eighth absolute value when the pixel point in the 1 st row and the nth column, the pixel point in the 1 st column and the pixel point in the nth row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th column in the reference pixel row and a pixel point at which the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point at which the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, in the reference pixel column, a first pixel point as the CPV predicted value of the first partition when both the pixel point in the nth row in the 1 st row and the pixel point in the nth row in the 1 st column in the current coded depth unit belong to the first partition or both belong to the second partition, and determine, in the reference pixel column, a second pixel point as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, in the reference pixel row, a first pixel point as the CPV predicted value of the first partition when both the pixel point in the nth row in the 1 st row and the pixel point in the nth row in the 1 st row in the current coded depth unit belong to the first partition or both belong to the second partition, and determine, in the reference pixel row, a second pixel point as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when both a pixel point in the nth row in the 1 st line and a pixel point in the nth row in the 1 st line in the current coded depth unit belong to the first partition or both belong to the second partition, a first pixel point in the reference pixel column to be used as the CPV predicted value of the first partition, and determine, in the reference pixel row, a second pixel point to be used as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel in a 1 st row and a 1 st column in the current coded depth unit and a pixel in a 1 st row and an nth column in the 1 st row belong to the first partition, that a pixel in an N/2 th column in the reference pixel row is the CPV predicted value of the first partition, and that a pixel in an N +1 th row in the reference pixel row is the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel point in the 1 st row and the nth column in the current coded depth unit belongs to the second partition, and a pixel point in the 1 st row and the nth row in the first partition, that a pixel point in the N/2 th row in the reference pixel column is the CPV predicted value of the first partition, and that a pixel point in the N +1 th row in the reference pixel row is the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when both a pixel point in the line 1 and the line N in the line 1 in the current coded depth unit belong to the first partition or both belong to the second partition, a pixel point in the line 1 in the reference pixel row as the CPV predicted value of the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition; or determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when both a pixel in the nth row in the 1 st line and a pixel in the nth row in the 1 st line in the current coded depth unit belong to the first partition and a pixel in the nth row in the current coded depth unit belong to the second partition, that a pixel in the 2 nth row in the reference pixel row is a CPV predicted value of the second partition; or determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare a first absolute value and a second absolute value when the pixel point in the nth row in the 1 st row and the pixel point in the nth row in the current coded depth unit both belong to the first partition and the pixel point in the nth row in the current coded depth unit belongs to the second partition, where the first absolute value is an absolute value of a difference between a pixel point in the 2 nth row in the reference pixel row and a pixel point in the 1 st row, and the second absolute value is an absolute value of a difference between a pixel point in the 2 nth row in the reference pixel row and a pixel point in the 1 st row; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to, when both a pixel point in the nth row in the 1 st row and a pixel point in the nth row in the 1 st row in the current coded depth unit belong to the first partition, and a pixel point in the nth row in the current coded depth unit belongs to the second partition, compare a third absolute value with a fourth absolute value, where the third absolute value is an absolute value of a difference between a pixel point in the 2 nth row in the reference pixel row and a pixel point at which the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in the 2 nth row in the reference pixel column and a pixel point at which the reference pixel row and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to determine, when a pixel in the 1 st row and the nth column in the current coded depth unit, a pixel in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and a pixel in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, that a pixel in the N +1 st column in the reference pixel row is a CPV predicted value of the second partition; or, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare a fifth absolute value with a sixth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coded depth unit in the 1 st row and the 1 st column belongs to the first partition, where the fifth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point in the 1 st row, and the sixth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point in the 1 st row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
In another embodiment, the determining unit 902 may be specifically configured to compare magnitudes of a seventh absolute value and an eighth absolute value when the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the second partition, and the pixel point in the 1 st row and the 1 st column in the current coded depth unit belongs to the first partition, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point at which the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point at which the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
The device is used for executing the method embodiments, and the implementation principle and the technical effect are similar, and are not described herein again.
Fig. 10 is a schematic structural diagram of a second embodiment of an image intra prediction apparatus according to the present invention, as shown in fig. 10, the apparatus includes: a memory 110 and a processor 111, wherein:
the memory 110 is used to store a set of instructions. The processor 111 is configured to call a set of instructions in the memory 110 to perform the following process: dividing a current coded depth unit into a first partition and a second partition; according to the distribution of the pixel points in the first partition and the second partition, determining a first pixel point in a reference pixel as a partition constant value (CPV) predicted value of the first partition, and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition; and performing intra-frame prediction on the current coding depth unit according to the CPV predicted value of the first partition and the CPV predicted value of the second partition.
Wherein the current coded depth unit comprises N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
The processor 111 is specifically configured to determine, in the reference pixel row, a first pixel point as the CPV predicted value of the first partition when both a pixel point in the line 1 and the line N in the line 1 in the current coding depth unit belong to the first partition or both belong to the second partition.
Optionally, the processor 111 is specifically configured to determine, in the reference pixel row, a second pixel as a partition constant value CPV predicted value of the second partition when both a pixel in the nth row in the 1 st row and a pixel in the nth row in the 1 st row in the current coded depth unit belong to the first partition or both belong to the second partition.
The processor 111 is specifically configured to determine that the pixel point in the 1 st row and the nth column in the reference pixel row is the CPV predicted value of the first partition when the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the nth column in the 1 st row and the pixel point in the 1 st row and the nth column in the current coded depth unit all belong to the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as the CPV predicted value of the first partition.
The processor 111 is specifically configured to determine, when a pixel point in the current coded depth unit in the line 1 and the line N, a pixel point in the line 1 and the line N and a pixel point in the line 1 and the line 1 all belong to the first partition, and when a pixel point in the current coded depth unit in the line N and the line N belongs to the second partition, a pixel point in the reference pixel line in the line 2 and the line N is a CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a first absolute value and a second absolute value when a pixel point in an nth row in a 1 st row, and a pixel point in a 1 st row in the current coded depth unit all belong to the first partition, and when a pixel point in an nth row in the current coded depth unit belongs to the second partition, the first absolute value is an absolute value of a difference value between a pixel point in a 2 nth row in the reference pixel row and a pixel point in a 1 st row, and the second absolute value is an absolute value of a difference value between a pixel point in a 2 nth row in the reference pixel row and a pixel point in a 1 st row; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
The processor 111 is specifically configured to compare a third absolute value with a fourth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the 1 st column all belong to the first partition, and the pixel point in the current coded depth unit in the nth row and the nth column belongs to the second partition, where the third absolute value is an absolute value of a difference between a pixel point in the 2 nd column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in the 2 nd row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
Further, the processor 111 is specifically configured to determine that the pixel point in the 1 st row and the nth column in the reference pixel row is the CPV predicted value of the first partition when the pixel point in the 1 st row and the nth column in the current coded depth unit, the pixel point in the 1 st row and the 1 st column in the 1 st row and the nth column in the current coded depth unit all belong to the second partition; or determining the pixel point where the reference pixel row and the reference pixel column intersect as the CPV predicted value of the first partition.
The processor 111 is specifically configured to determine, when all of a pixel in a line 1 and an nth column in the current coded depth unit, a pixel in a line 1 and an nth column in the line N belong to the second partition, and when a pixel in a line 1 and a column 1 in the line 1 in the current coded depth unit belongs to the first partition, a pixel in a line N +1 in the reference pixel line is a CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a fifth absolute value and a sixth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth row, the pixel point in the 1 st row and the nth row, and the pixel point in the current coded depth unit in the 1 st row and the 1 st column, belong to the first partition, where the fifth absolute value is an absolute value of a difference between a pixel point in the N +1 th row and a pixel point in the 1 st row in the reference pixel row, and the sixth absolute value is an absolute value of a difference between a pixel point in the N +1 th row and a pixel point in the 1 st row in the reference pixel row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a seventh absolute value and an eighth absolute value when the pixel point in the current coding depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coding depth unit in the 1 st row and the 1 st column belongs to the first partition, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
Optionally, the processor 111 is specifically configured to, when both a pixel point in the nth row in the 1 st row and a pixel point in the nth row in the 1 st column in the current coded depth unit belong to the first partition or both belong to the second partition, determine a first pixel point in the reference pixel column as the CPV predicted value of the first partition, and determine a second pixel point in the reference pixel column as the CPV predicted value of the second partition.
Optionally, the processor 111 is specifically configured to, when both a pixel point in the nth row in the 1 st row and a pixel point in the nth row in the 1 st column in the current coded depth unit belong to the first partition or both belong to the second partition, determine a first pixel point in the reference pixel row as the CPV predicted value of the first partition, and determine a second pixel point in the reference pixel row as the CPV predicted value of the second partition.
Optionally, the processor 111 is specifically configured to, when both a pixel point in the nth row in the 1 st row and a pixel point in the nth row in the 1 st column in the current coded depth unit belong to the first partition or both belong to the second partition, determine a first pixel point in the reference pixel row as the CPV predicted value of the first partition, and determine a second pixel point in the reference pixel row as the CPV predicted value of the second partition.
In another embodiment, the processor 111 is specifically configured to determine, when a pixel in a 1 st row and a 1 st column in the current coded depth unit and a pixel in a 1 st row and an nth column in the 1 st row belong to the first partition, that a pixel in an N/2 th column in the reference pixel row is the CPV predicted value of the first partition, and that a pixel in an N +1 th row in the reference pixel row is the CPV predicted value of the second partition.
In another embodiment, the processor 111 is specifically configured to determine, when a pixel point in a line 1 and a line N in the current coding depth unit belongs to the second partition, and a pixel point in a line 1 and a pixel point in a line N in the line 1 belong to the first partition, a pixel point in a line N/2 in the reference pixel column is a CPV predicted value of the first partition, and a pixel point in a line N +1 in the reference pixel row is a CPV predicted value of the second partition.
The processor 111 is specifically configured to determine that a pixel point in the 1 st row in the reference pixel row is a CPV predicted value of the first partition when both a pixel point in the 1 st row and a pixel point in the 1 st column in the current coded depth unit belong to the first partition or both belong to the second partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition; or determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
The processor 111 is specifically configured to determine that a pixel point in the 2N th row in the reference pixel row is the CPV predicted value of the second partition when a pixel point in the 1 st row and the N th row in the 1 st row in the current coded depth unit both belong to the first partition and a pixel point in the N th row and the N th column in the current coded depth unit belong to the second partition; or determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a first absolute value and a second absolute value when the pixel point in the 1 st row and the pixel point in the 1 st column and the pixel point in the nth row and the pixel point in the nth column in the current coded depth unit both belong to the first partition, and when the pixel point in the nth row and the pixel point in the nth column in the current coded depth unit belong to the second partition, the first absolute value is an absolute value of a difference value between the pixel point in the 2 nd column in the reference pixel row and the pixel point in the 1 st column, and the second absolute value is an absolute value of a difference value between the pixel point in the 2 nd row and the pixel point in the 1 st row in the reference pixel row; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
The processor 111 is specifically configured to compare a third absolute value with a fourth absolute value when both a pixel point in an nth row in a 1 st row and a pixel point in an nth row in the current coded depth unit belong to the first partition, and a pixel point in an nth row in the current coded depth unit belong to the second partition, where the third absolute value is an absolute value of a difference between a pixel point in a 2 nd row in the reference pixel row and a pixel point at which the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in a 2 nd row in the reference pixel column and a pixel point at which the reference pixel row and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
The processor 111 is specifically configured to determine, when a pixel point in the current coded depth unit in the 1 st row and the nth column, a pixel point in the 1 st row and the nth column and a pixel point in the nth row and the nth column all belong to the second partition, and when a pixel point in the current coded depth unit in the 1 st row and the 1 st column belongs to the first partition, a pixel point in the N +1 th column in the reference pixel row is a CPV predicted value of the second partition; or, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a fifth absolute value with a sixth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coded depth unit in the 1 st row and the 1 st column belongs to the first partition, where the fifth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and the pixel point in the 1 st row, and the sixth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and the pixel point in the 1 st row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
The processor 111 is specifically configured to compare a seventh absolute value and an eighth absolute value when the pixel point in the current coding depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coding depth unit in the 1 st row and the 1 st column belongs to the first partition, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
The device is used for executing the method embodiments, and the implementation principle and the technical effect are similar, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional unit.
The integrated unit implemented in the form of a software functional unit may be stored in a computer readable storage medium. The software functional unit is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute some steps of the methods according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (20)

1. An image intra prediction method, comprising:
dividing a current coded depth unit into a first partition and a second partition;
according to the distribution of the pixel points in the first partition and the second partition, determining a first pixel point in a reference pixel as a partition constant value (CPV) predicted value of the first partition, and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition;
performing intra-frame prediction on the current coding depth unit according to the CPV prediction value of the first partition and the CPV prediction value of the second partition;
wherein the current coded depth unit comprises N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
2. The method of claim 1, wherein the pixels in line 1, column 1 and line 1, column N of the current coded depth unit belong to the first partition, and the pixels in line 1, column N belong to the second partition;
the determining a first pixel point in the reference pixel as a partition constant value (CPV) predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition includes:
and determining the pixel point of the N/2 th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition.
3. The method of claim 1, wherein the pixel in line 1 and line N of the current coded depth unit belongs to the second partition, and the pixel in line 1 and line N of line 1 belong to the first partition;
the determining a first pixel point in the reference pixel as a partition constant value (CPV) predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition includes:
and determining the pixel point of the (N/2) th row in the reference pixel row as the CPV predicted value of the first partition, and determining the pixel point of the (N + 1) th row in the reference pixel row as the CPV predicted value of the second partition.
4. The method according to claim 1, wherein the pixel point in line 1 and line N of the current coded depth unit and the pixel point in line 1 and line N belong to the first partition or belong to the second partition;
the determining, in the reference pixel, a first pixel point as a partition constant value (CPV) prediction value of the first partition includes:
determining a pixel point of the 1 st column in the reference pixel row as a CPV predicted value of the first partition; or,
determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition;
or,
and determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
5. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N and the pixel point in the line 1, the line N belong to the first partition, and the pixel point in the current coded depth unit in the line N belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
determining a pixel point of the 2N column in the reference pixel row as a CPV predicted value of the second partition; or,
and determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
6. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N and the pixel point in the line 1, the line N belong to the first partition, and the pixel point in the current coded depth unit in the line N belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
comparing a first absolute value with a second absolute value, wherein the first absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point of a 1 st column, and the second absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel row and a pixel point of the 1 st column;
if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition;
and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
7. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N and the pixel point in the line 1, the line N belong to the first partition, and the pixel point in the current coded depth unit in the line N belongs to the second partition;
the determining, in the reference pixel, a second pixel point as the CPV prediction value of the second partition includes:
comparing a third absolute value with a fourth absolute value, wherein the third absolute value is an absolute value of a difference value between a pixel point of a 2N-th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference value between a pixel point of the 2N-th column in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect;
if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition;
and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
8. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N, the pixel point in the line 1, and the pixel point in the line N belong to the second partition, and the pixel point in the current coded depth unit in the line 1, the line 1 belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
determining the pixel point of the (N + 1) th column in the reference pixel row as the CPV predicted value of the second partition;
or,
and determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
9. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N, the pixel point in the line 1, and the pixel point in the line N belong to the second partition, and the pixel point in the current coded depth unit in the line 1, the line 1 belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
comparing a fifth absolute value with a sixth absolute value, wherein the fifth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of a 1 st row, and the sixth absolute value is an absolute value of a difference value between a pixel point of an N +1 th row in the reference pixel row and a pixel point of the 1 st row;
if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition;
and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
10. The method according to claim 1 or 4, wherein the pixel point in the current coded depth unit in the line 1, the line N, the pixel point in the line 1, and the pixel point in the line N belong to the second partition, and the pixel point in the current coded depth unit in the line 1, the line 1 belongs to the first partition;
the determining a second pixel point in the reference pixel as the CPV predicted value of the second partition includes:
comparing the magnitude of a seventh absolute value and an eighth absolute value, wherein the seventh absolute value is the absolute value of the difference value between the pixel point of the (N + 1) th column in the reference pixel row and the pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is the absolute value of the difference value between the pixel point of the (N + 1) th column in the reference pixel column and the pixel point where the reference pixel row and the reference pixel column intersect;
if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition;
and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
11. An image intra prediction apparatus, comprising:
a partition unit for dividing a current coded depth unit into a first partition and a second partition;
the determining unit is used for determining a first pixel point in a reference pixel as a partition constant value CPV predicted value of the first partition and determining a second pixel point in the reference pixel as a CPV predicted value of the second partition according to the distribution of the pixel points in the first partition and the second partition;
the coding unit is used for carrying out intra-frame prediction on the current coding depth unit according to the CPV predicted value of the first partition and the CPV predicted value of the second partition;
wherein the current coded depth unit comprises N × N pixel points; the reference pixel comprises a reference pixel row and a reference pixel column; the reference pixel row does not belong to the current coded depth unit, the reference pixel row is a row of pixel points adjacent to the 1 st row of pixel points of the current coded depth unit, and the 1 st column of the reference pixel row is aligned with the 1 st column of the current coded depth unit; the reference pixel column does not belong to the current coded depth unit, the reference pixel column is a column of pixel points adjacent to the 1 st column of pixel points of the current coded depth unit, and the 1 st row of the reference pixel column is aligned with the 1 st row of the current coded depth unit; and the pixel point where the reference pixel row and the reference pixel column intersect is the starting point of the reference pixel row and the reference pixel column.
12. The apparatus according to claim 11, wherein the determining unit is specifically configured to determine, when a pixel point in a 1 st row and a 1 st column in the current coded depth unit and a pixel point in a 1 st row and an nth column in the current coded depth unit belong to the first partition, that a pixel point in an N/2 th column in the reference pixel row is the CPV prediction value of the first partition, and that a pixel point in an N +1 th row in the reference pixel row is the CPV prediction value of the second partition.
13. The apparatus according to claim 11, wherein the determining unit is specifically configured to determine, when a pixel point in a 1 st row and an nth column in the current coded depth unit belongs to the second partition, and a pixel point in a 1 st row and a pixel point in a 1 st column and an nth row in the 1 st column belong to the first partition, a pixel point in an N/2 th row in the reference pixel column is a CPV predicted value of the first partition, and a pixel point in an N +1 th column in the reference pixel row is a CPV predicted value of the second partition.
14. The apparatus according to claim 11, wherein the determining unit is specifically configured to determine, when both a pixel in a line 1 and a line N in the current coded depth unit belong to the first partition or both belong to the second partition, a pixel in a line 1 in the reference pixel row as the CPV predicted value of the first partition; or determining a pixel point where the reference pixel row and the reference pixel column intersect as a CPV predicted value of the first partition; or determining the pixel point of the 1 st row in the reference pixel column as the CPV predicted value of the first partition.
15. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to determine, when a pixel point in a line 1 and a line N in the current coded depth unit and a pixel point in a line 1 and a line N in the line 1 both belong to the first partition and a pixel point in a line N in the current coded depth unit belongs to a second partition, a pixel point in a line 2N in the reference pixel line as the CPV prediction value of the second partition; or determining the pixel point of the 2N-th row in the reference pixel column as the CPV predicted value of the second partition.
16. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to compare a first absolute value with a second absolute value when the pixel point in the current coded depth unit in the 1 st row and the pixel point in the 1 st column and the pixel point in the 1 st row and the pixel point in the nth column both belong to the first partition, and the pixel point in the current coded depth unit in the nth row and the pixel point in the nth column belong to the second partition, where the first absolute value is an absolute value of a difference between the pixel point in the 2N th column in the reference pixel row and the pixel point in the 1 st column, and the second absolute value is an absolute value of a difference between the pixel point in the 2N th row in the reference pixel row and the pixel point in the 1 st row; if the first absolute value is larger than the second absolute value, determining that the pixel point of the 2N-th column in the reference pixel row is the CPV value of the second partition; and if the first absolute value is less than or equal to the second absolute value, determining that the pixel point of the 2N-th row in the reference pixel column is the CPV value of the second partition.
17. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to, when both a pixel point in a line 1 and a line N in the line 1 in the current coded depth unit belong to the first partition, and a pixel point in a line N and a line N in the line 1 in the current coded depth unit belong to the second partition, compare a third absolute value with a fourth absolute value, where the third absolute value is an absolute value of a difference between a pixel point in a line 2N in the reference pixel line and a pixel point at which the reference pixel line and the reference pixel column intersect, and the fourth absolute value is an absolute value of a difference between a pixel point in a line 2N in the reference pixel column and a pixel point at which the reference pixel line and the reference pixel column intersect; if the third absolute value is greater than the fourth absolute value, determining that the pixel point of the 2N column in the reference pixel row is the CPV value of the second partition; and if the third absolute value is less than or equal to the fourth absolute value, determining that the pixel point in the 2N-th row in the reference pixel column is the CPV value of the second partition.
18. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to determine, when a pixel point in line 1 and column N in the current coded depth unit, a pixel point in line 1 and column N and a pixel point in line N and column N in the current coded depth unit all belong to the second partition, and a pixel point in line 1 and column 1 in the current coded depth unit belongs to the first partition, a pixel point in line N +1 in the reference pixel line is a CPV predicted value of the second partition; or, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
19. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to compare a fifth absolute value with a sixth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coded depth unit in the 1 st row and the 1 st column belongs to the first partition, where the fifth absolute value is an absolute value of a difference between a pixel point in the N +1 st column in the reference pixel row and a pixel point in the 1 st row, and the sixth absolute value is an absolute value of a difference between a pixel point in the N +1 st row in the reference pixel row and a pixel point in the 1 st row; if the fifth absolute value is greater than the sixth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the fifth absolute value is less than or equal to the sixth absolute value, determining the N +1 th row of pixel points in the reference pixel column as the CPV predicted value of the second partition.
20. The apparatus according to claim 11 or 14, wherein the determining unit is specifically configured to compare magnitudes of a seventh absolute value and an eighth absolute value when the pixel point in the current coded depth unit in the 1 st row and the nth column, the pixel point in the 1 st row and the nth column all belong to the second partition, and the pixel point in the current coded depth unit in the 1 st row and the 1 st column belongs to the first partition, where the seventh absolute value is an absolute value of a difference between a pixel point in the N +1 th column in the reference pixel row and a pixel point where the reference pixel row and the reference pixel column intersect, and the eighth absolute value is an absolute value of a difference between a pixel point in the N +1 th row in the reference pixel column and a pixel point where the reference pixel row and the reference pixel column intersect; if the seventh absolute value is greater than the eighth absolute value, determining that the pixel point of the (N + 1) th column in the reference pixel row is the CPV predicted value of the second partition; and if the seventh absolute value is less than or equal to the eighth absolute value, determining the pixel point of the (N + 1) th row in the reference pixel column as the CPV predicted value of the second partition.
CN201410111041.8A 2014-03-21 2014-03-21 Image intra prediction method and device Active CN103826134B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410111041.8A CN103826134B (en) 2014-03-21 2014-03-21 Image intra prediction method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410111041.8A CN103826134B (en) 2014-03-21 2014-03-21 Image intra prediction method and device

Publications (2)

Publication Number Publication Date
CN103826134A true CN103826134A (en) 2014-05-28
CN103826134B CN103826134B (en) 2017-08-18

Family

ID=50760926

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410111041.8A Active CN103826134B (en) 2014-03-21 2014-03-21 Image intra prediction method and device

Country Status (1)

Country Link
CN (1) CN103826134B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050141615A1 (en) * 2003-12-29 2005-06-30 Samsung Electronics Co., Ltd. Motion vector estimating method and motion vector estimating apparatus using block matching process
CN101217669A (en) * 2008-01-15 2008-07-09 北京中星微电子有限公司 An intra-frame predictor method and device
CN101262607A (en) * 2008-04-11 2008-09-10 浙江大学 Two-folded prediction video coding and decoding method and device
CN101527848A (en) * 2008-03-07 2009-09-09 佳能株式会社 Image encoding apparatus
US20110096826A1 (en) * 2009-10-23 2011-04-28 Samsung Electronics Co., Ltd. Method and apparatus for decoding video according to individual parsing or decoding in data unit level, and method and apparatus for encoding video for individual parsing or decoding in data unit level
CN102685506A (en) * 2011-03-10 2012-09-19 华为技术有限公司 Intra-frame predication method and predication device
WO2013068567A1 (en) * 2011-11-11 2013-05-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Effective prediction using partition coding
CN103392341A (en) * 2010-12-23 2013-11-13 三星电子株式会社 Method and device for encoding intra prediction mode for image prediction unit, and method and device for decoding intra prediction mode for image prediction unit

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050141615A1 (en) * 2003-12-29 2005-06-30 Samsung Electronics Co., Ltd. Motion vector estimating method and motion vector estimating apparatus using block matching process
CN101217669A (en) * 2008-01-15 2008-07-09 北京中星微电子有限公司 An intra-frame predictor method and device
CN101527848A (en) * 2008-03-07 2009-09-09 佳能株式会社 Image encoding apparatus
CN101262607A (en) * 2008-04-11 2008-09-10 浙江大学 Two-folded prediction video coding and decoding method and device
US20110096826A1 (en) * 2009-10-23 2011-04-28 Samsung Electronics Co., Ltd. Method and apparatus for decoding video according to individual parsing or decoding in data unit level, and method and apparatus for encoding video for individual parsing or decoding in data unit level
CN103392341A (en) * 2010-12-23 2013-11-13 三星电子株式会社 Method and device for encoding intra prediction mode for image prediction unit, and method and device for decoding intra prediction mode for image prediction unit
CN102685506A (en) * 2011-03-10 2012-09-19 华为技术有限公司 Intra-frame predication method and predication device
WO2013068567A1 (en) * 2011-11-11 2013-05-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Effective prediction using partition coding

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
GERHARD TECH ET.AL.: "3D-HEVC Test Model4", 《JCT3V CODING EXTENSION DEVELOPMENT OF ITU-T SG WP 3 AND ISO/IEC JTC 1/SC 29/WG 11》 *
SHUJIE LIU ET AL.: "New Depth Coding techniques With Utilization of Corresponding Video", 《IEEE TRANSATIONS ON BROADCASTING》 *

Also Published As

Publication number Publication date
CN103826134B (en) 2017-08-18

Similar Documents

Publication Publication Date Title
US10666977B2 (en) Methods and apparatuses for coding and decoding depth map
US20170374379A1 (en) Picture prediction method and related apparatus
US11979578B2 (en) Method and apparatus for encoding or decoding video data in FRUC mode with reduced memory accesses
US10455229B2 (en) Prediction mode selection method, apparatus and device
US10735761B2 (en) Method and apparatus of video coding
US9288492B2 (en) Motion prediction or compensation method
BR112012025309B1 (en) METHOD OF ENCODING A VIDEO BY PERFORMING MESH FILTRATION BASED ON ENCODING UNITS, METHOD OF DECODING A VIDEO BY PERFORMING MESH FILTRATION BASED ON ENCODING UNITS, VIDEO ENCODING EQUIPMENT TO ENCODE A VIDEO BY PERFORMING FILTRATION IN MESH BASED ON ENCODING UNITS, VIDEO DECODING EQUIPMENT TO DECODE A VIDEO BY PERFORMING MESH FILTRATION BASED ON ENCODING UNITS, AND COMPUTER READable RECORDING MEDIA.
US20160080766A1 (en) Encoding system using motion estimation and encoding method using motion estimation
KR20140016385A (en) Encoding/decoding method and device
CN111246212B (en) Geometric partitioning mode prediction method and device based on encoding and decoding end, storage medium and terminal
CN103618911A (en) Video streaming providing method and device based on video attribute information
KR102231975B1 (en) Techniques for performing a forward transformation by a video encoder using a forward transform matrix
CN102857768B (en) Equipment and method for determining chromaticity prediction mode candidate set
US9020283B2 (en) Electronic device and method for splitting image
JP6187826B2 (en) Moving picture coding apparatus and moving picture coding method
CN103826134B (en) Image intra prediction method and device
JP7194539B2 (en) Encoding device, decoding device and program
EP3922018A1 (en) Systems and methods for image coding
US20140254664A1 (en) Methods to perform intra prediction for compression of cfa data
US20150092835A1 (en) Methods for Comparing a Target Block to a Reference Window for Motion Estimation during Video Encoding
JP6308409B2 (en) Moving picture coding apparatus and moving picture coding method
CN110446050A (en) Intra-frame prediction method, device, equipment and computer readable storage medium
US20140133769A1 (en) Electronic device and image block merging method

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant