Methods and systems for image intra-prediction mode estimation, communication, and organization
Abstract
This record has no abstract on file.
Term
Term ended
Expired 27 May 2023, 3.3 years ago.
- Priority
- Filed
- Granted
- Expired
- Today
7 claims: 4 independent, 3 dependent
- 1An image encoding system for encoding a digital image comprising:means for encoding each of the blocks into which an image is divided;intra-prediction means for predicting a pixel value of a target block to be coded by using at least one pixel value of a block adjacent to the target block;and prediction mode estimating means for estimating a prediction mode for the target block, wherein the intra-prediction means includes means to perform a vertical prediction mode using prediction values being the pixel values of a first block located adjacent to and above the target block, means to perform a horizontal prediction mode using prediction values being the pixel values of a second block located adjacent to and to the left side of the target block, and means to perform a DC prediction mode using a prediction value being an average of the pixel values of the first and second blocks, characterized by : the prediction modes being numbered with serially larger numbers, in order of the vertical prediction mode, the horizontal prediction mode and the DC prediction mode, or in order of the horizontal prediction mode, the vertical prediction mode and the DC prediction mode, and wherein the prediction mode estimating means determines a prediction mode to have the lower mode number among the prediction mode of the first block and the prediction mode of the second block as the estimated prediction mode for the target block, and prediction mode encoding means for encoding a first information and a second information, wherein the first information indicates whether an actual prediction mode for the target block is equivalent to the estimated prediction mode and the second information indicates the actual prediction mode if the actual prediction mode is not equivalent to the estimated prediction mode.
- 2An image decoding system for decoding an encoded digital image comprising:means for decoding each of the blocks into which an image is divided;intra-prediction means for predicting a pixel value of a target block to be decoded by using at least one pixel value of a block adjacent to the target block;and prediction mode estimating means for estimating a prediction mode for the target block, wherein the intra-prediction means includes means to perform a vertical prediction mode using prediction values being the pixel values of a first block located adjacent to and above the target block, means to perform a horizontal prediction mode using prediction values being the pixel values of a second block located adjacent to and to the left side of the target block, and means to perform a DC prediction mode using a prediction value being an average of the pixel values of the first and second blocks, characterized by : the prediction modes being numbered with serially larger numbers, in order of the vertical prediction mode, the horizontal prediction mode and the DC prediction mode, or in order of the horizontal prediction mode, the vertical prediction mode and the DC prediction mode, and wherein the prediction mode estimating means determines a prediction mode to have the lower mode number among the prediction mode of the first block and the prediction mode of the second block as the estimated prediction mode for the target block, and prediction mode decoding means for decoding a first information and a second information, wherein the first information indicates whether an actual prediction mode for the target block is equivalent to the estimated prediction mode and the second information indicates the actual prediction mode if the actual prediction mode is not equivalent to the estimated prediction mode.
- 4A method of encoding a digital image comprising:dividing the image into blocks and encoding each of the blocks, wherein the encoding of each block involves intra-prediction for predicting a pixel value of a target block to be coded by using at least one pixel value of a block adjacent to the target block and estimating a prediction mode for the target block, the prediction modes including a vertical prediction mode using prediction values being the pixel values of a first block located adjacent to and above the target block, a horizontal prediction mode using prediction values being the pixel values of a second block located adjacent to and to the left side of the target block, and a DC prediction mode using a prediction value being an average of the pixel values of the first and second blocks;characterized in that : the prediction modes are numbered with serially larger numbers, in order of the vertical prediction mode, the horizontal prediction mode and the DC prediction mode, or in order of the horizontal prediction mode, the vertical prediction mode and the DC prediction mode, and wherein the step of estimating the prediction mode comprises determining (56, 66, 76, 92) a prediction mode to have the lower mode number among the prediction mode of the first block and the prediction mode of the second block as the estimated prediction mode for the target block, and the prediction mode is encoded by a first information and a second information, wherein the first information indicates whether an actual prediction mode for the target block is equivalent to the estimated prediction mode, and the second information indicates the actual prediction mode if the actual prediction mode is not equivalent to the estimated prediction mode.
- 5A method of decoding a digital image comprising:decoding each of the encoded blocks into which an image is divided, wherein the decoding of each block involves intra-prediction for predicting a pixel value of a target block to be decoded by using at least one pixel value of a block adjacent to the target block and estimating a prediction mode for the target block, the prediction modes including a vertical prediction mode using prediction values being the pixel values of a first block located adjacent to and above the target block, a horizontal prediction mode using prediction values being the pixel values of a second block located adjacent to and to the left side of the target block, and a DC prediction mode using a prediction value being an average of the pixel values of the first and second blocks;characterized in that : the prediction modes are numbered with serially larger numbers, in order of the vertical prediction mode, the horizontal prediction mode and the DC prediction mode, or in order of the horizontal prediction mode, the vertical prediction mode and the DC prediction mode, and wherein the step of estimating the prediction mode comprises determining (56, 66, 76, 92) a prediction mode to have the lower mode number among the prediction mode of the first block and the prediction mode of the second block as the estimated prediction mode for the target block, and the prediction mode is decoded from a first information and a second information, wherein the first information indicates whether an actual prediction mode for the target block is equivalent to the estimated prediction mode , and the second information indicates the actual prediction mode if the actual prediction mode is not equivalent to the estimated prediction mode.
Independent claims5
72 paragraphs in 3 sections, as filed
BACKGROUND
0001Embodiments of the present invention relate to intra-prediction for an image.
0002Digital video requires a large amount of data to represent each and every frame of a digital video sequence (e.g., series of frames) in an uncompressed manner. It is not feasible for most applications to transmit uncompressed digital video across computer networks because of bandwidth limitations. In addition, uncompressed digital video requires a large amount of storage space. The digital video is normally encoded in some manner to reduce the storage requirements and reduce the bandwidth requirements.
0003One technique for encoding digital video is interframe encoding. Interframe encoding exploits the fact that different frames of video typically include regions of pixels, normally selected as x by x blocks, that remain substantially the same. During the encoding process a motion vector interrelates the movement of a block of pixels in one frame to a block of similar pixels in another frame. Accordingly, the system is not required to encode the block of pixels twice, but rather encodes the block of pixels once and provides a motion vector to predict the other block of pixels.
0004Another technique for encoding digital video is intraframe encoding. Intraframe encoding encodes a frame or a portion thereof without reference to pixels in other frames. Typically intraframe encoding encodes the frame, or portions thereof, on a block by block basis. For example, in MEPG-2 the intraframe encoding makes use of discrete cosine transforms of a block of pixels and subsequent encoding of the transformed coefficients. Other intraframe encoding techniques exist, such as for example, wavelet encoding. In general, these techniques employ relatively large data tables for referencing prediction modes. Memory for these data tables can be burdensomely expensive for many low cost machines. Moreover, it is also burdensomely expensive to provide sufficient memory within processing devices to store the data table. Also, the resulting system has increased complexity with the large data table.
0005"H.26L Test Model Long Term Number 6 (TML-6) draft0" ITU-TELECOMMUNICATIONS STANDARDIZATION SECTOR STUDY GROUP 16 VIDEO CODING EXPERTS GROUP (VCEG), 2001, pages 11-14 relates to a method of coding images using six kinds of intra-prediction modes. DC prediction mode is labelled 0 and the other modes are labelled as set out on page 11 of D1. For a target block, an order of modes is given as set out in Table 2, depending on the prediction mode of adjacent blocks A and B. The ordering is said to be an ordering of "the most probable, next most probable etc. of C" meaning prediction modes, based on the known prediction modes of A and B.
0006Aspects of the invention are set out in the accompanying claims.
BRIEF DESCRIPTION OF THE DRAWINGS
0007The following drawings depict only typical embodiments of the present invention and are not therefore to be considered to be limiting of its scope, and the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings in which: <ul id="ul0001" list-style="none" compact="compact"><li>FIG. 1 illustrates some forms of block adjacency;</li><li>FIG. 2 illustrates a block of pixels and the adjacent pixels for prediction</li><li>FIG. 3 illustrates general prediction mode directions;</li><li>FIG. 4 illustrates the general directions of prediction modes in an embodiment of the present invention;</li><li>FIG. 5 illustrates the general directions of prediction modes in an embodiment of the present invention;</li><li>FIG. 6 illustrates the general directions of prediction modes in an embodiment of the present invention;</li><li>FIG. 7 illustrates the general directions of prediction modes in an embodiment of the present invention;</li><li>FIG. 8 illustrates the general directions of prediction modes in an embodiment of the present invention;</li><li>FIG. 9 is a block diagram illustrating mode estimation in some embodiments of the present invention;</li><li>FIG. 10 is a block diagram illustrating mode estimation in embodiments with an ordered set of prediction modes;</li><li>FIG. 11 is a block diagram illustrating mode estimation with ordered sets associated with numerical values;</li><li>FIG 12 is a block diagram illustrating mode estimation options when some adjacent block data is unavailable;</li><li>FIG. 13 is a block diagram illustrating mode order modification in some embodiments of the present invention;</li><li>FIG. 14 is a block diagram illustrating the methods of an embodiment of the present invention in which an estimated mode is used to modify mode order usage; and</li><li>FIG. 15 is a block diagram illustrating the method of an embodiment of the present invention in which an estimate mode is used to modify mode order using specific designators.</li></ul>
DETAILED DESCRIPTION
0008Embodiments of the present invention comprise methods and systems related to intra-prediction of images. As all embodiments are related to intra-prediction, the terms "intra-prediction" and "prediction" may be used interchangeably to refer to intra-prediction processes.
0009Embodiments of the present invention use intraframe coding or intracoding to exploit spatial redundancies within a video image. Because adjacent blocks generally have similar attributes, the efficiency of the coding process is improved by referencing the spatial correlation between adjacent blocks. This correlation may be exploited by prediction of a target block based on prediction modes used in adjacent blocks.
0010A digital image may be divided into blocks for more efficient processing or for other reasons. As illustrated in Figure 1, a target block "C" 12 may be situated adjacent to adjacent block "A" 14 which is located immediately above target block "C" 12. Another adjacent block "B" 16 is located immediately to the left of target block "C" 12. Other blocks that share boundaries with target block "C" 12 may also be considered to be adjacent blocks to block "C" 12.
0011Blocks may comprise various numbers of pixels in different configurations. For example, a block may comprise a 4x4 array of pixels. A block may also comprise a 16x16 array of pixels or an 8x8 array. Other pixel configurations, including both square and rectangular arrays may also make up a block.
0012Each pixel in a target block may be predicted with reference to data regarding pixels in adjacent blocks. This adjacent pixel data or adjacent block data comprises the prediction modes used to predict those adjacent blocks or adjacent pixels. Specific adjacent pixels and pixels within a target block may be referenced using an alphanumeric index as illustrated in Figure 2. Figure 2 illustrates a 4x4 target block, such as block "C" 12 comprising 16 pixels designated by lower case alphabetic characters 22. Pixels in an adjacent block immediately above the target block are designated by capital alphabetic characters 24. Pixels in an adjacent block immediately to the left of the target block are designated by capital alphabetical characters 26.
0013Prediction modes may comprise instructions or algorithms for predicting specific pixels in a target block. These modes may refer to one or more adjacent block pixels as described in the following mode descriptions.
Prediction Modes
Mode 0: vertical prediction
0014<ul id="ul0002" list-style="none" compact="compact"><li>a, e, i, m may be predicted by A</li><li>b, f, j, n, may be predicted by B,</li><li>c, g, k, o, may be predicted by C</li><li>d, j, I, p may be predicted by D</li></ul>
Mode 1: horizontal prediction
0015<ul id="ul0003" list-style="none" compact="compact"><li>a, b, c, d, may be predicted by I</li><li>e, f, g, h, may be predicted by J</li><li>i, j, k, l, may be predicted by K</li><li>m, n, o, p, may be predicted by L</li></ul>
Mode 2: DC prediction
0016If all samples A, B, C, D, I, J, K, L, are available, all samples may be predicted by (A+B+C+D+I+J+K+L+4)>>3. If A, B, C, and D are not available and I, J, K, and L are available, all samples may be predicted by (I+J+K+L+2)>>2. If I, J, K, and L are not available and A, B, C, and D are available, all samples may be predicted by (A+B+C+D+2)>>2. If all eight samples are not available, the prediction for all luma samples in the block may be 128. A block may be always predicted in this mode.
Mode 3: diagonal down/left prediction
0017<tables id="tabl0001" num="0001"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="45mm" /><colspec colnum="2" colname="col2" colwidth="43mm" /><tbody><row><entry>a may be predicted by</entry><entry>(A+2B+C+I+2J+K+4)>>3</entry></row><row><entry>b, e may be predicted by</entry><entry>(B+2C+D+J+2K+L+4)>>3</entry></row><row><entry>c, f, i may be predicted by</entry><entry>(C+2D+E+K+2L+M+4)>>3</entry></row><row><entry>d, g, j, m may be predicted by</entry><entry>(D+2E+F+L+2M+N+4)>>3</entry></row><row><entry>h, k, n may be predicted by</entry><entry>(E+2F+G+M+2N+O+4)>>3</entry></row><row><entry>l, o may be predicted by</entry><entry>(F+2G+H+N+2O+P+4)>>3</entry></row><row><entry>p may be predicted by</entry><entry>(G+H+O+P+2)>>2</entry></row></tbody></tgroup></table></tables>
Mode 4: diagonal down/right prediction
0018<tables id="tabl0002" num="0002"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="43mm" /><colspec colnum="2" colname="col2" colwidth="29mm" /><tbody><row><entry>m may be predicted by</entry><entry>(J+2K+L+2)>>2</entry></row><row><entry>i, n may be predicted by</entry><entry>(1+2J+K+2)>>2</entry></row><row><entry>e, j, o may be predicted by</entry><entry>(Q+2I+J+2)>>2</entry></row><row><entry>a, f, k, p may be predicted by</entry><entry>(A+2Q+I+2)>>2</entry></row><row><entry>b, g, l may be predicted by</entry><entry>(Q+2A+B+2)>>2</entry></row><row><entry>c, h may be predicted by</entry><entry>(A+2B+C+2)>>2</entry></row><row><entry>d may be predicted by</entry><entry>(B+2C+D+2)>>2</entry></row></tbody></tgroup></table></tables>
Mode 5: vertical-left prediction
0019<tables id="tabl0003" num="0003"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="38mm" /><colspec colnum="2" colname="col2" colwidth="29mm" /><tbody><row><entry>a, j may be predicted by</entry><entry>(Q+A+1)>>1</entry></row><row><entry>b, k may be predicted by</entry><entry>(A+B+1)>>1</entry></row><row><entry>c, l may be predicted by</entry><entry>(B+C+1)>>1</entry></row><row><entry>d may be predicted by</entry><entry>(C+D+1)>>1</entry></row><row><entry>e, n may be predicted by</entry><entry>(I+2Q+A+2)>>2</entry></row><row><entry>f, o may be predicted by</entry><entry>(Q+2A+B+2)>>2</entry></row><row><entry>g, p may be predicted by</entry><entry>(A+2B+C+2)>>2</entry></row><row><entry>h may be predicted by</entry><entry>(B+2C+D+2)>>2</entry></row><row><entry>i may be predicted by</entry><entry>(Q+2I+J+2)>>2</entry></row><row><entry>m may be predicted by</entry><entry>(I+2J+K+2)>>2</entry></row></tbody></tgroup></table></tables>
Mode 6: horizontal-down prediction
0020<tables id="tabl0004" num="0004"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="38mm" /><colspec colnum="2" colname="col2" colwidth="29mm" /><tbody><row><entry>a, g may be predicted by</entry><entry>(Q+I+1)>>1</entry></row><row><entry>b, h may be predicted by</entry><entry>(I+2Q+A+2)>>2</entry></row><row><entry>c may be predicted by</entry><entry>(Q+2A+B+2)>>2</entry></row><row><entry>d may be predicted by</entry><entry>(A+2B+C+2)>>2</entry></row><row><entry>e, k may be predicted by</entry><entry>(I+J+1)>>1</entry></row><row><entry>f, l may be predicted by</entry><entry>(Q+2I+J+2)>>2</entry></row><row><entry>i, o may be predicted by</entry><entry>(J+K+1)>>1</entry></row><row><entry>j, p may be predicted by</entry><entry>(I+2J+K+2)>>2</entry></row><row><entry>m may be predicted by</entry><entry>(K+L+1)>>1</entry></row><row><entry>n may be predicted by</entry><entry>(J+2K+L+2)>>2</entry></row></tbody></tgroup></table></tables>
Mode 7: vertical-right prediction
0021<tables id="tabl0005" num="0005"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="38mm" /><colspec colnum="2" colname="col2" colwidth="42mm" /><tbody><row><entry>a may be predicted by</entry><entry>(2A+2B+J+2K+L+4)>>3</entry></row><row><entry>b, i may be predicted by</entry><entry>(B+C+1)>>1</entry></row><row><entry>c, j may be predicted by</entry><entry>(C+D+1)>>1</entry></row><row><entry>d, k may be predicted by</entry><entry>(D+E+1)>>1</entry></row><row><entry>I may be predicted by</entry><entry>(E+F+1)>>1</entry></row><row><entry>e may be predicted by</entry><entry>(A+2B+C+K+2L+M+4)>>3</entry></row><row><entry>f, m may be predicted by</entry><entry>(B+2C+D+2)>>2</entry></row><row><entry>g, n may be predicted by</entry><entry>(C+2D+E+2)>>2</entry></row><row><entry>h, o may be predicted by</entry><entry>(D+2E+F+2)>>2</entry></row><row><entry>p may be predicted by</entry><entry>(E+2F+G+2)>>2</entry></row></tbody></tgroup></table></tables>
Mode 8: horizontal-up prediction
0022<tables id="tabl0006" num="0006"><table frame="none"><tgroup cols="2" colsep="0" rowsep="0"><colspec colnum="1" colname="col1" colwidth="40mm" /><colspec colnum="2" colname="col2" colwidth="41mm" /><tbody><row><entry>a may be predicted by</entry><entry>(B+2C+D+2I+2J+4)>>3</entry></row><row><entry>b may be predicted by</entry><entry>(C+2D+E+I+2J+K+4)>>3</entry></row><row><entry>c, e may be predicted by</entry><entry>(J+K+1)>>1</entry></row><row><entry>d, f may be predicted by</entry><entry>(J+2K+L+2)>>2</entry></row><row><entry>g, i may be predicted by</entry><entry>(K+L+1)>>1</entry></row><row><entry>h, j may be predicted by</entry><entry>(K+2L+M+2)>>2</entry></row><row><entry>l, n may be predicted by</entry><entry>(L+2M+N+2)>>2</entry></row><row><entry>k, m may be predicted by</entry><entry>(L+M+1)>>1</entry></row><row><entry>o may be predicted by</entry><entry>(M+N+1)>>1</entry></row><row><entry>p may be predicted by</entry><entry>(M+2N+O+2)>>2</entry></row></tbody></tgroup></table></tables>
0023The ordering process, which is based upon the likelihood of producing a lesser prediction error for each of the modes, increases the coding efficiently, reduces the memory requirements, and may be at least partially mathematically defined.
0024Each prediction mode may be described by a general direction of prediction as described verbally in each of the mode titles above (i.e., horizontal up, vertical and diagonal down left). A prediction mode may also be described graphically by an angular direction. This angular direction may be expressed through a diagram with arrows radiating outward from a center point as shown in Figure 3. In this type of diagram, each arrow and the center point may represent a prediction mode. The angle corresponding to a prediction mode has a general relationship to the direction from the weighted average location of the adjacent pixels used to predict the target pixel to the actual target pixel location. However, the modes are more precisely defined in the definitions above and in the JVT standard. In Figure 3, the center point 32 represents no direction so this point may be associated with a DC prediction mode. A horizontal arrow 34 may represent a horizontal prediction mode. A vertical arrow 36 may represent a vertical prediction mode. An arrow extending from the center point diagonally downward to the right at approximately a 45 degree angle from horizontal 38 may represent a Diagonal Down/Right (DDR) prediction mode. An arrow extending from the center point diagonally downward to the left at approximately a 45 degree angle from horizontal 40 may represent a Diagonal Down/Left (DDL) prediction mode. Both the DDR and DDL prediction modes may be referred to as diagonal prediction modes.
0025An arrow extending from the center point diagonally upward to the right at approximately a 22.5 degree angle from horizontal 42 may represent a Horizontal Up (HU) prediction mode. An arrow extending from the center point diagonally downward to the right at approximately a 22.5 degree angle from horizontal 44 may represent a Horizontal Down (HD) prediction mode. An arrow extending from the center point diagonally downward to the right at approximately a 67.5 degree angle from horizontal 46 may represent a Vertical Right (VR) prediction mode. An arrow extending from the center point diagonally downward to the left at approximately a 67.5 degree angle from horizontal 48 may represent a Vertical Left (VL) prediction mode. The HU, HD, VR and VL prediction modes may be referred to collectively as intermediate angle prediction modes.
0026Many other prediction modes may be created and described using this angular description scheme.
Prediction Mode Order
0027The present inventors have determined that prediction modes may be ordered in a manner generally consistent with their likelihood of producing a reduced prediction error. With the prediction modes ordered according to their general likelihood of producing a lesser prediction error, the resulting data itself may have a greater tendency to be more consistently ordered. Furthermore, communication of modes may take advantage of coding techniques that reduce memory and bandwidth requirements. For example, the present inventors determined that the horizontal prediction mode and the vertical prediction mode are generally more likely than diagonal prediction modes, which are generally more likely than intermediate angle prediction modes. In addition, a DC prediction mode (e.g., when an adjacent block is coded in inter mode) is generally less likely than horizontal and vertical prediction modes and generally more likely than diagonal prediction modes.
0028For blocks that do not border discontinuities such as image edges or swipe/swath boundaries, the order established in some embodiments of the present invention may be expressed, in general terms, as follows: vertical and horizontal prediction modes are more likely to produce a reduced prediction error than a DC prediction mode and that a DC prediction mode is more likely to produce a reduced prediction error than diagonal prediction modes and that diagonal prediction modes are more likely to produce a reduced prediction error than intermediate angle prediction modes.
0029For blocks near edges or boundaries or where adjacent block or pixel prediction mode data is not available, the order established in some embodiments of the present invention may be expressed, in general terms, as follows: DC prediction mode is more likely to produce a reduced prediction error than vertical and horizontal prediction modes and vertical and horizontal prediction modes are more likely to produce a reduced prediction error than diagonal prediction modes and that diagonal prediction modes are more likely to produce a reduced prediction error than intermediate angle prediction modes.
0030In a first set of embodiments as illustrated in Figure 4, modes may be defined in order as follows: <ul id="ul0004" list-style="none" compact="compact"><li>Mode 0: Vertical prediction</li><li>Mode 1: Horizontal prediction</li><li>Mode 2: DC prediction</li><li>Mode 3: Diagonal Down/Left prediction</li><li>Mode 4: Diagonal Down/Right prediction</li><li>Mode 5: Horizontal Down prediction</li><li>Mode 6: Vertical Right prediction</li><li>Mode 7: Vertical Left prediction</li><li>Mode 8: Horizontal Up prediction</li></ul>
0031In a second set of embodiments, as illustrated in Figure 5, modes may be defined in order as follows: <ul id="ul0005" list-style="none" compact="compact"><li>Mode 0: Horizontal prediction</li><li>Mode 1: Vertical prediction</li><li>Mode 2: DC prediction</li><li>Mode 3: Diagonal Down/Left prediction</li><li>Mode 4: Diagonal Down/Right prediction</li><li>Mode 5: Horizontal Down prediction</li><li>Mode 6: Vertical Right prediction</li><li>Mode 7: Vertical Left prediction</li><li>Mode 8: Horizontal Up prediction</li></ul>
0032In a third set of embodiments, as illustrate in Figure 6, modes may be defined in order as follows: <ul id="ul0006" list-style="none" compact="compact"><li>Mode 0: Vertical prediction</li><li>Mode 1: Horizontal prediction</li><li>Mode 2: DC prediction</li><li>Mode 3: Diagonal Down/Left prediction</li><li>Mode 4: Diagonal Down/Right prediction</li><li>Mode 5: Vertical Right prediction</li><li>Mode 6: Horizontal Down prediction</li><li>Mode 7: Vertical Left prediction</li><li>Mode 8: Horizontal Up prediction</li></ul>
0033In a fourth set of embodiments, as illustrated in Figure 7, modes may be defined in order as follows: <ul id="ul0007" list-style="none" compact="compact"><li>Mode 0: Horizontal prediction</li><li>Mode 1: Vertical prediction</li><li>Mode 2: DC prediction</li><li>Mode 3: Diagonal Down/Left prediction</li><li>Mode 4: Diagonal Down/Right prediction</li><li>Mode 5: Vertical Right prediction</li><li>Mode 6: Horizontal Down prediction</li><li>Mode 7: Vertical Left prediction</li><li>Mode 8: Horizontal Up prediction</li></ul>
0034In a fifth set of embodiments, as illustrated in Figure 8, modes may be defined in order as follows: <ul id="ul0008" list-style="none" compact="compact"><li>Mode 0: DC prediction</li><li>Mode 1: Vertical prediction</li><li>Mode 2: Horizontal prediction</li><li>Mode 3: Diagonal Down/Left prediction</li><li>Mode 4: Diagonal Down/Right prediction</li><li>Mode 5: Vertical Right prediction</li><li>Mode 6: Horizontal Down prediction</li><li>Mode 7: Vertical Left prediction</li><li>Mode 8: Horizontal Up prediction</li></ul>
0035It should be noted that the mode order may vary beyond these exemplary orders in various other embodiments of the present invention.
0036In some embodiments of the present invention, the horizontal prediction (mode 0) and the vertical prediction (mode 1) may be reversed, if desired. Also, it is to be understood that the diagonal down/left prediction mode and the horizontal down prediction mode may be reversed, if desired. In addition, it is to be understood the diagonal down/right prediction (mode 5), the vertical right prediction (mode 6), the vertical left prediction (mode 7), and the horizontal up prediction (mode 8) may be reordered, if desired. Further, it is desirable that the DC prediction is between the mode 0/mode 1 set and the mode 3/mode 4 set, but may be located between mode 3/mode 4 set and mode 5/mode 6/mode 7/mode 8 set, if desired, or any other location. Moreover, the angled modes 3-8 may be renumbered as desired without significant impact on the encoding efficiency.
0037In some embodiments of the present invention, the prediction modes may be reordered for all of the respective blocks (e.g., those blocks using the described prediction scheme) using such a prediction basis. In addition, less than all of the respective blocks (e.g., those blocks using the described prediction scheme) may use such a prediction basis, for example, more than 50%, 75% or 90%, if desired. Also, the order of the prediction modes may be the same or varied for different blocks. Further, the reordering of each of the modes of such a prediction basis (e.g., in a predetermined consistent manner) is preferably at least 5 modes, 6 modes, or 7 modes, with the remaining being ordered in any other manner. In addition, the order of the prediction modes is preferably 0, 1, 2, 3, 4, 5, 6, 7, 8. Other predefined ordering of the prediction modes may likewise be employed.
0038Some embodiments of the present invention may comprise one or more data tables for organization of mode data. With the modes being generally arranged in an ordered manner, this may be used together with each cell in a data table, to provide a more ordered set. For example, each entry in the data table may include the ordered set of numbers 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9. Alternatively, the ordered set of numbers in the data table may include 5, 6, 7, 8, or 9 sets of ordered numbers for each entry in the data table. For example, the data table entries may include the following sets of data entries {1, 2, 3, 5, 7}; {0, 1, 2, 3, 4, 5, 6}; {0, 1, 3, 5, 6, 7, 8}, where each of the numbers in the set are of increasing numerical value. Alternatively for example, the data table entries may include the following sets of data entries {1, 2, 3, 5, 7}; {0, 1, 2, 3, 4, 5, 6}; {0, 1, 3, 5, 6, 7, 8}, where each set is included in at least 25%, or 35%, or 50%, or 75%, or 90%, or more, of the cells. In this manner, the table will have significantly more predictability than known data table methods, which decreases memory requirements.
0039The predetermined manner of the ordering of the sets of data entries should be independent of the prediction modes of adjoining sets of pixels (e.g. macroblocks). It is to be understood that the data table may be "static" in nature or may be effectively dynamically generated, in whole or in part, when needed based upon patterns in the data. Accordingly, a mathematical equation or an algorithm may be used to determine the entries, which in this case the "table" could be created by such a technique. Accordingly, a "data table" as used herein is not merely restricted to a static table, but further includes such a set of values, however determined, that are used for such prediction.
0040Unfortunately, the substitution of the previous mode numbers with the new mode numbers (e.g., a substitution of numbers into the cells of known data tables), while perhaps an improvement, still results in a generally unordered set of data.
Estimating a Pixel Prediction Mode Based on Adjacent Block Data
0041In contrast to the generally unordered set of data shown, even with substitutions, the present inventors came to the further realization that the most likely prediction mode should be ordered first, the second most likely prediction mode ordered second, if desired, followed by the remaining modes in a predetermined manner. The predetermined manner should be independent of the prediction modes of adjoining macroblocks. The preferred order of the remaining modes should be in a decreasing likelihood of occurrence of the remaining modes (most likely prediction mode, and if desired, second most likely prediction mode).
0042Based on the intra prediction modes of block A and block B, as shown in Figure 1, the intra prediction mode order for block C may be defined as follows: <ol id="ol0001" compact="compact" ol-style=""><li>(1) If both block A and block B are "outside" (e.g., not available), only DC prediction (mode 2) is permitted, therefore the intra prediction mode order for block C is {2}.</li><li>(2) If block A is "outside" (e.g., not available) and block B is not "outside", only DC prediction (mode 2) and horizontal prediction (mode 0) are permitted for block C, therefore; <ol id="ol0002" compact="compact" ol-style=""><li>(i) if block B is 2, intra prediction mode order for block C is {2, 0};</li><li>(ii) otherwise, intra prediction mode order for block C is {0, 2}.</li></ol></li><li>(3) If block A is not "outside" but block B is "outside", only DC prediction (mode 2) and vertical prediction (mode 1) are permitted for block C, therefore <ol id="ol0003" compact="compact" ol-style=""><li>(i) if block A is 2, intra prediction mode order for block C is {2, 1};</li><li>(ii) otherwise, intra prediction mode order for block C is {1,2}.</li></ol></li><li>(4) If neither block A nor block B is "outside", <ol id="ol0004" compact="compact" ol-style=""><li>(i) if the prediction mode of block A is less than the prediction mode of block B, then intra prediction mode order for block C is {intra prediction block mode A, intra prediction block mode B, other modes in ascending order};</li><li>(ii) if the prediction mode of block A is greater than the prediction mode of block B, then intra prediction mode order for block C is {intra prediction block mode B, intra prediction block mode A, other modes in ascending order};</li><li>(iii) if the prediction mode of block A equals the prediction mode of block B, then intra prediction mode order for block C is {intra prediction block mode A, other modes in ascending order}.</li></ol></li></ol>
0043For example, if the prediction mode of block A is 3 and the prediction mode of block B is 1, then intra prediction mode order for block C is {1, 3, 0, 2, 4, 5, 6, 7, 8}. With the modes arranged in a generally decreasing likelihood (or increasing) of occurrence, then the automatic arrangement of the remaining modes of occurrence will still be generally arranged in the proper sequence. The ordering of the sequence from higher to lower probability increases the likelihood of the proper prediction toward the front. With entropy encoding this decreases the resulting encoded bit stream. Other arrangements may likewise be used.
0044Conceptually the aforementioned selection scheme is based upon the principle that if the prediction of block A is X and the prediction of block B is Y, then it is likely the prediction of block C is X or Y. The prediction for X and/or Y is located at the start of the list and the remaining modes are sequentially listed thereafter.
0045Stated another way, when the prediction modes of A and B are known (including the case that A or B or both are outside the slice) the most probable mode of C is given, namely, the minimum of the modes used for blocks A and B. If one of the blocks A or B is "outside" the most probable mode is equal to prediction mode 2. The ordering of prediction modes assigned to blocks C is therefore the most probable mode followed by the remaining modes in the ascending order.
0046Embodiments of the present invention may be described with reference to Figure 9. In these embodiments, a target block is selected 50 for prediction. A prediction mode used for prediction of a first adjacent block, which is immediately adjacent to said target block, is then determined 52. A prediction mode used for prediction of a second adjacent block, which is also adjacent to said target block is also determined 54. These adjacent block prediction modes are then examined 56 to determine which is more likely to produce a lesser prediction error.
0047In other embodiments of the present invention, as illustrated in Figure 10, a set of prediction modes is ordered 58 according to the modes' likelihood of producing a lesser prediction error. A target block is selected 60. The prediction mode used for a first adjacent block is determined 62 and the prediction mode used for a second adjacent block is also determined 64. These two prediction modes are then examined 66 to determine which occurs first in the ordered set of modes thereby corresponding to the mode with the higher likelihood of producing a lesser prediction error.
0048In further embodiments of the present invention, as illustrated in Figure 11, a set of prediction modes is ordered 68 by likelihood of producing a lesser prediction error. These modes in the ordered set are then associated 70 with numerical values such that modes with a higher likelihood of producing a lesser prediction error are associated with lower numerical values. The mode used to predict a first adjacent block is then determined 72 and the mode used to predict a second adjacent block is also determined 74. These adjacent block modes are then examined to determine which mode is associated with a lower numerical value. This mode is designated as the estimated mode for prediction of the target block.
0049In still further embodiments, as illustrated in Figure 12, a set of prediction modes is ordered 78 by likelihood of producing a lesser prediction error. These modes in the ordered set are then associated 80 with numerical values such that modes with a higher likelihood of producing a lesser prediction error are associated with lower numerical values. An attempt 82 is made to determine the mode used to predict a first adjacent block and an attempt 84 is made to determine the mode used to predict a second adjacent block. If the prediction mode used to predict the first adjacent block is not available 86, a default prediction mode, such as a DC prediction mode, may be designated 90 as an estimated prediction mode for the target block. Also, if the prediction mode used to predict the second adjacent block is not available 88, a default prediction mode, such as a DC prediction mode, may be designated 90 as an estimated prediction mode for the target block. When the adjacent block prediction modes are available, these adjacent block modes may be examined to determine which mode is associated with a lower numerical value. This mode is then designated 92 as the estimated mode for prediction of the target block.
Modification of Prediction Mode Order Based on Adjacent Block Data
0050In some embodiments of the present invention the prediction mode orders described above, which have been determined independently of the adjacent block data, may be modified with adjacent block data. Prediction mode estimates determined with reference to adjacent block data can be inserted into prediction mode orders to modify the orders to reflect the additional information obtained from adjacent block data.
0051In some of these embodiments, a prediction mode estimate, based on adjacent block data, can be inserted directly into a prediction mode order set. Typically, the prediction mode estimate will be inserted or prepended at the front of the prediction mode order at the position of the mode most likely to produce a reduced prediction error. However, in some embodiments the estimate may be inserted at different positions in the mode order.
0052In some embodiments of the present invention, as shown in Figure 13, a prediction mode order is selected 102 wherein the prediction mode order elements may be arranged according to their likelihood of producing a lesser prediction error. In other words, the first element in the order represents the prediction mode most likely to yield a lesser prediction error, the next element in the order represents the prediction mode that is the next most likely to yield a lesser prediction error and so on to the last element in the order, which represents the prediction mode in the order that is least likely to yield a lesser prediction error.
0053A prediction mode estimate is also determined 104, as described above. This estimate is determined using adjacent block data. Generally, the estimate is the prediction mode used in one or more adjacent blocks that is likely to yield a lesser prediction error. However, the estimate may be determined in other ways. When sufficient adjacent block prediction mode data is not available, such as at an image edge or a slice boundary, a prediction mode for the target block may be estimated based on the lack of one or more adjacent blocks or their prediction mode data. In many cases, a DC prediction mode will be estimated when adjacent block data is limited or unavailable.
0054In some embodiments, once the estimated prediction mode is estimated, the estimated prediction mode may be placed 106 into the mode order as the mode most likely to yield a lesser prediction error. In some embodiments, this will be the first mode in the order or the mode associated with the lowest numerical value.
0055In other embodiments, the estimated prediction mode may take precedence over the pre-selected mode order. In some of these embodiments, as illustrated in Figure 14, a pre-selected mode order is designated 110 at the encoder and the decoder. This order comprises a set of prediction modes arranged in order of likelihood of yielding a lesser prediction error or some other order. An estimated prediction mode is also determined 112 based on adjacent block data. This estimated prediction mode is determined at the encoder and the decoder according to the same algorithm or method. The encoder also determines the actual best prediction mode 114 for predicting a pixel based on motion vectors or other known techniques. The encoder may, then, compare 116 the actual best prediction mode to the estimated prediction mode to determine whether they are the same. If the estimated prediction mode is the same mode as the actual best prediction mode, the encoder may signal to the decoder that the estimated prediction mode is to be used 118. In some embodiments, this estimated prediction mode signal may be performed with a 1-bit flag to signify whether the estimated mode is to be used on not.
0056If the estimated prediction mode is not the actual best prediction mode, the encoder may signal to the decoder that another mode may be used 120. This may be performed by reference to the pre-established mode order. The encoder may determine which mode in the mode order is most equivalent to the actual best prediction mode and signal the decoder to use that mode.
0057When an ordered set of prediction modes is used, the set order may be rearranged once further data is obtained. For example, an ordered set of prediction modes may be reordered when an estimated prediction mode is determined or when a best actual prediction mode is determined. In these cases, the modifying mode may be interjected into the ordered set, placed ahead of the ordered set or, in some cases, removed from the ordered set.
0058In some embodiments of the present invention, each mode in the mode order may be associated with a numerical value according to the order. In these embodiments, the numerical value associated with the mode to be used may be sent to the decoder to signal the decoder to use that prediction mode. In some of these embodiments, as illustrated in Figure 15, a mode order comprising 9 prediction modes may be selected 130. An estimated prediction mode based on adjacent block data, and which is one of the 9 modes in the order, may also be determined 132. A best prediction mode may also be determined 134 by motion vector methods or other methods. The best prediction mode may then be compared to the estimated prediction mode 136. If the estimated prediction mode is substantially the same as the best prediction mode, the decoder may be signaled with a 1-bit designator to use the estimated prediction mode, which is already identified at the decoder. If the estimated prediction mode is not equivalent to the best prediction mode, the estimated prediction mode is essentially eliminated from the mode order 140. This elimination may be performed by re-ordering the set, skipping the estimated mode in the order or by other means. The remaining order will effectively comprise 8 modes, which can be represented by a 3-bit designator. This 3-bit designator may be sent to the decoder 142 to designate which mode to use for prediction.
0059The terms and expressions employed in the foregoing specification are used therein as terms of description and not of limitation, and there is no intention in the use of such terms and expressions of excluding equivalents of the features shown and described or portions thereof, it being recognized that the scope of the invention is defined and limited only by the claims that follow.
Contents3
10 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10
Every citation, both ways
| Document | Relation | Office |
|---|---|---|
| JP5183758A | Cites | Japan |
| JP8186823A | Cites | Japan |
| WIEGAND T: "JOINT MODEL NUMBER 1, REVISION 1(JM-IRL)" ITU STUDY GROUP 16 - VIDEO CODING EXPERTS GROUP, 3 December 2001 (2001-12-03), pages 1,3-75, XP001086627 | Non-patent | – |
| PAN F ET AL: "Fast Mode Decision for Intra Prediction" JOINT VIDEO TEAM (JVT) OF ISO/IEC MPEG & ITU-T VCEG (ISO/IEC JTC1/SC29/WG11 AND ITU-T SG16 Q.6), DOCUMENT JVT-G013, [Online] 7 March 2003 (2003-03-07), pages 1-22, XP002325066 Retrieved from the Internet: URL:http://ftp3.itu.int/av-arch/jvt-site/2 003_03_Pattaya/JVT-G013.doc> [retrieved on 2005-03-23] | Non-patent | – |
| 'H.26L Test Model Long Term Number 6 (TML-6) draft0' ITU-TELECOMMUNICATIONS STANDARDIZATION SECTOR STUDY GROUP 16 VIDEO CODING EXPERTS GROUP(VCEG), [Online] 2001, pages 11 - 14, XP002973806 Retrieved from the Internet: <URL:http://kbs.cs.tu-berlin.de/~stewe/vceg /TMLDocs/VCEG-L45d0.doc> [retrieved on 2003-05-28] | Non-patent | – |
| RICHARDSON IAIN E.G.: 'H.264/MPEG-4 part 10: Intra Prediction' H.264/MPEG-4 PART 10 WHITE PAPER, [Online] 07 October 2002, pages 1 OF 7 - 7 OF 7, XP002973807 Retrieved from the Internet: <URL:http://218.30.21.30/sc/jywd/h264_intra pred-pdf> [retrieved on 2003-09-22] | Non-patent | – |
| RICHARDSON IAIN E.G.: 'H.264/MPEG-4 part 10 Tutorials' VCODEX:H.264 TUTORIAL WHITE PAPERS, [Online] 30 April 2003, pages 1 OF 6 - 6 OF 6, XP002973808 Retrieved from the Internet: <URL:http://www.vcodex.fsnet.co.uk/h.264.ht ml> [retrieved on 2003-09-22] | Non-patent | – |
| BOJUN MENG, AU OSCAR C.: 'Fast intra-prediction mode selection for 4x4 blocks in H.264' ICASSP 2003 IEEE INTERNATIONAL CONFERENCE 06 April 2003 - 10 April 2003, pages III-389 - III-392, XP002973809 | Non-patent | – |
100 members in 11 offices
Priority claims23
| Document | Office | Kind | Date |
|---|---|---|---|
| 319272P | United States of America | – | |
| 31927202 | United States of America | P | |
| 319390P | United States of America | – | |
| 31939002 | United States of America | P | |
| 404211 | United States of America | – | |
| 40421103 | United States of America | A | |
| 404293 | United States of America | – | |
| 40429303 | United States of America | A | |
| 404298 | United States of America | – | |
| 40429803 | United States of America | A | |
| 0306623 | Japan | W | |
| 319272P | – | – | – |
| 319390P | – | – | – |
| 404211 | – | – | – |
| 404293 | – | – | – |
| 404298 | – | – | – |
| JP2003006623 | – | – | – |
| US20020319272P | – | – | – |
| US20020319390P | – | – | – |
| US20030404211 | – | – | – |
| US20030404293 | – | – | – |
| US20030404298 | – | – | – |
| WO2003JP06623 | – | – | – |
Members100
| Document | Office | Kind | |
|---|---|---|---|
| US2003223495A1 | United States of America | A1 | |
| US2003223496A1 | United States of America | A1 | |
| US2003223645A1 | United States of America | A1 | |
| WO03101117A1 | World Intellectual Property Organization (WIPO) | A1 | |
| AU2003241177A1 | Australia | A1 | |
| TW200402661A | Taiwan Province of China | A | |
| WO03101117B1 | World Intellectual Property Organization (WIPO) | B1 | |
| KR20050012762A | Republic of Korea | A | |
| EP1510078A1 | European Patent Office (EPO) | A1 | |
| EP1510078A4 | European Patent Office (EPO) | A4 | |
| JP2005184857A | Japan | A | |
| EP1553782A2 | European Patent Office (EPO) | A2 | |
| JP2005192232A | Japan | A | |
| EP1553782A3 | European Patent Office (EPO) | A3 | |
| CN1656818A | China | A | |
| JP2005528047A | Japan | A | |
| TWI241532B | Taiwan Province of China | B | |
| JP3734492B2 | Japan | B2 | |
| JP3734494B2 | Japan | B2 | |
| KR20060115404A | Republic of Korea | A | |
| EP1746843A2 | European Patent Office (EPO) | A2 | |
| KR100685264B1 | Republic of Korea | B1 | |
| EP1510078B1This record | European Patent Office (EPO) | B1 | |
| KR20070051807A | Republic of Korea | A | |
| DE60313454D1 | Germany | D1 | |
| US7236524B2 | United States of America | B2 | |
| KR100754972B1 | Republic of Korea | B1 | |
| EP1746843A3 | European Patent Office (EPO) | A3 | |
| JP2007282256A | Japan | A | |
| US7289672B2 | United States of America | B2 | |
| ES2283776T3 | Spain | T3 | |
| CN101087422A | China | A | |
| CN101087423A | China | A | |
| CN101087424A | China | A | |
| DE60313454T2 | Germany | T2 | |
| KR100820132B1 | Republic of Korea | B1 | |
| US7386048B2 | United States of America | B2 | |
| EP1944977A2 | European Patent Office (EPO) | A2 | |
| US2008175318A1 | United States of America | A1 | |
| US2008175319A1 | United States of America | A1 | |
| US2008175320A1 | United States of America | A1 | |
| US2008175321A1 | United States of America | A1 | |
| HK1111547A1 | Hong Kong, China | A1 | |
| HK1111548A1 | Hong Kong, China | A1 | |
| HK1111549A1 | Hong Kong, China | A1 | |
| CN100473164C | China | C | |
| JP2009147968A | Japan | A | |
| CN101489136A | China | A | |
| CN101568035A | China | A | |
| JP4357427B2 | Japan | B2 | |
| JP4357543B2 | Japan | B2 | |
| JP4357590B2 | Japan | B2 | |
| CN100591135C | China | C | |
| CN101087423B | China | B | |
| HK1136430A1 | Hong Kong, China | A1 | |
| CN101873493A | China | A | |
| EP1944977A3 | European Patent Office (EPO) | A3 | |
| EP2290989A1 | European Patent Office (EPO) | A1 | |
| EP2290990A1 | European Patent Office (EPO) | A1 | |
| EP2309757A1 | European Patent Office (EPO) | A1 | |
| CN101087422B | China | B | |
| CN101568035B | China | B | |
| US8228986B2 | United States of America | B2 | |
| US8233538B2 | United States of America | B2 | |
| USRE43567E | United States of America | E | |
| US8279927B2 | United States of America | B2 | |
| US8331450B2 | United States of America | B2 | |
| US2013064296A1 | United States of America | A1 | |
| CN101873493B | China | B | |
| EP2290990B1 | European Patent Office (EPO) | B1 | |
| ES2467696T3 | Spain | T3 | |
| CN101489136B | China | B | |
| EP2309757B1 | European Patent Office (EPO) | B1 | |
| ES2525557T3 | Spain | T3 | |
| EP1944977B1 | European Patent Office (EPO) | B1 | |
| EP2290989B1 | European Patent Office (EPO) | B1 | |
| ES2530204T3 | Spain | T3 | |
| ES2532326T3 | Spain | T3 | |
| EP2860977A1 | European Patent Office (EPO) | A1 | |
| EP2860978A1 | European Patent Office (EPO) | A1 | |
| EP2860979A1 | European Patent Office (EPO) | A1 | |
| US2016044318A1 | United States of America | A1 | |
| HK1209543A1 | Hong Kong, China | A1 | |
| HK1209544A1 | Hong Kong, China | A1 | |
| HK1209546A1 | Hong Kong, China | A1 | |
| US2016150246A1 | United States of America | A1 | |
| US9374590B2 | United States of America | B2 | |
| US2016295212A1 | United States of America | A1 | |
| EP3139606A1 | European Patent Office (EPO) | A1 | |
| US2017142423A1 | United States of America | A1 | |
| US9774868B2 | United States of America | B2 | |
| US2018007368A1 | United States of America | A1 | |
| US9973762B2 | United States of America | B2 | |
| US9979963B2 | United States of America | B2 | |
| EP3139606B1 | European Patent Office (EPO) | B1 | |
| US10368066B2 | United States of America | B2 | |
| ES2747368T3 | Spain | T3 | |
| EP2860978B1 | European Patent Office (EPO) | B1 | |
| US10715799B2 | United States of America | B2 | |
| ES2788534T3 | Spain | T3 |
53 legal events, as 6 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| Patent expired after termination of 20 yearsExpiredPE20 | PE20 | GB | |
| Announcement of lapse in spainLapsedFD2A | FD2A | ES | |
| Patent expired because of reaching the maximum lifetime of a patentExpiredMK | MK | NL | |
| Expiry of rightR071 | R071 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Fee paymentPLFP | PLFP | FR | |
| Transfer of patentPC2A | PC2A | ES | |
| Transmission of propertyTP | TP | FR | |
| Amendments to the register in respect of changes of name or changes affecting rights (sect. 32/1977)REGISTERED BETWEEN 20161006 AND 20161012732E | 732E | GB | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of applicant/patenteeR081 | R081 | DE | |
| Change of representativeR082 | R082 | DE | |
| Fee paymentPLFP | PLFP | FR | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Definitive protectionFG2A | FG2A | ES | |
| Fr: translation filedET | ET | EP | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| Corresponds to:REF | REF | EP | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| Designated contracting states (corrected)RBV | RBV | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Supplementary search report drawn up and despatchedA4 | A4 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: H04N0007320000R079 | R079 | DE | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 1510078
- Publication, DOCDB
- 1510078
- Publication, EPODOC
- EP1510078
- Application
- 3730648
- Application, DOCDB
- 03730648
- Application, EPODOC
- EP20030730648
Titles3
- German
- VERFAHREN UND SYSTEME ZUR BILDINTRAPRÄDIKTIONS-MODUSSCHÄTZUNG, KOMMUNIKATION UND ORGANISATION
- English
- METHODS AND SYSTEMS FOR IMAGE INTRA-PREDICTION MODE ESTIMATION, COMMUNICATION, AND ORGANIZATION
- French
- PROCEDES ET SYSTEMES POUR L'ESTIMATION, LA COMMUNICATION ET L'ORGANISATION DE MODES D'INTRA-PREDICTION D'IMAGES
Classification
- CPC, 10
- H04N19/11
- H04N19/198
- H04N19/105
- H04N19/154
- H04N19/176
- H04N19/197
- H04N19/593
- H04N19/60
- H04N19/63
- H04N19/51
- IPC, 4
- H04N19 51
- H03M7 36
- H04N1 41
- H04N7 34
Designated states1
- Contracting states, 1
- Netherlands (Kingdom of the)