A video encoding method and apparatus is shown wherein image information is represented as a plurality of pixels, the pixels are organized into blocks, pixels transposition is performed on image information at the boundaries of the blocks, the blocks are transform coded and quantized. pixel transposition involves transposition of alternate pixels at the boundaries of blocks with pixels of neighboring blocks found in a pre-determined direction. The pre-determined direction may be fixed by a system or may be applied on an image by image basis. In the event that the pre-determined direction is not established by a system, a pixel transposition circuit includes a transposition keyword in the output bit stream which is used by a decoded to determine the direction of pixel transposition.
|
0. 29. A method of encoding image data, comprising the steps of:
receiving blocks of image data, each block including an array of pixels;
converting each block of image data into blocks of luminance pixel data and chrominance pixel data;
transposing selected pixel data of adjacent luminance blocks;
transposing selected pixel data of adjacent chrominance blocks;
transforming pixel data of the transposed luminance blocks to luminance coefficients;
transforming pixel data of the transposed chrominance blocks to chrominance coefficients; and
scaling the transformed luminance coefficients and the transformed chrominance coefficients.
0. 40. A method of decoding blocks of encoded luminance and chrominance data, comprising:
scaling blocks of encoded luminance data to obtain blocks of coefficient luminance data;
scaling blocks of encoded chrominance data to obtain blocks of coefficient chrominance data;
transforming the blocks of coefficient luminance data to blocks of luminance data;
transforming the blocks of coefficient chrominance data to blocks of chrominance data;
transposing selected alternate pixels of adjacent luminance blocks;
transposing selected alternate pixels of adjacent chrominance blocks; and
converting luminance blocks and chrominance blocks obtained from the transposings into blocks of image data.
0. 52. A video coder, comprising:
an image block conversion circuit that receives blocks of image data, each block including image data of an array of pixels, said image block conversion circuit converting the received blocks of image data into luminance blocks and chrominance blocks;
a pixel transposition circuit that transposes selected pixels of adjacent luminance blocks and transposes selected pixels of adjacent chrominance blocks;
a transform circuit that generates luminance coefficients representative of data of the transposed luminance blocks, and generates chrominance coefficients representative of data of the transposed chrominance blocks; and
a quantizer that scales the luminance coefficients and the chrominance coefficients.
0. 70. A bitstream generated by a process comprising the steps of:
receiving blocks of image data, each block including an array of pixels;
converting each block of image data into blocks of luminance pixel data and chrominance pixel data;
transposing selected pixels on a boundary edge of a first block of luminance pixel data with selected pixels from blocks neighboring the first block of luminance pixel data;
transposing selected pixels on a boundary edge of a first block of chrominance pixel data with selected pixels from blocks neighboring the first block of chrominance pixel data;
transforming pixel data of the transposed luminance blocks to luminance coefficients;
transforming pixel data of the transposed chrominance blocks to chrominance coefficients; and
scaling the transformed luminance coefficients and the transformed chrominance coefficients.
0. 61. A video decoder, comprising:
a dequantizer that receives blocks of scaled luminance coefficient information and reconstructs luminance coefficients therefrom, and also receives blocks of scaled chrominance coefficient information and reconstructs chrominance coefficients therefrom;
an inverse transform circuit that reconstructs blocks of luminance pixel data from the blocks of reconstructed luminance coefficients, and also reconstructs blocks of chrominance pixel data from the blocks of reconstructed chrominance coefficients;
a pixel transposition circuit that generates blocks of luminance image data by transposing pixels on a boundary of a first block of luminance pixel data with boundary pixels of a plurality of blocks of luminance pixel data neighboring said first block of luminance pixel data, and also generates blocks of chrominance image data by transposing pixels on a boundary of a first block of chrominance pixel data with boundary pixels of a plurality of blocks of chrominance pixel data neighboring said first block of chrominance pixel data; and
an image block conversion circuit that generates blocks of image data from blocks of luminance image data and blocks of chrominance image data.
0. 1. A video coder, comprising:
a pixel transposition circuit that receives blocks of image data, each block including image data of an array of pixels, said pixel transposition circuit transposing selected pixels on a boundary of a first block with selected boundary pixels of a plurality of blocks neighboring said first block,
a transform circuit that generates coefficients representative of data of the transposed blocks, and
a quantizer that scales the coefficients.
0. 2. The video coder of
0. 3. The video coder of
0. 4. The video coder of
0. 5. The video coder of
0. 6. A video decoder, comprising:
a dequantizer that receives blocks of scaled coefficient information and reconstructing coefficients therefrom,
an inverse transform circuit that reconstructs blocks of pixel data from the blocks of reconstructed coefficients, and
a pixel transposition circuit that transposes pixels on a boundary of a first block with boundary pixels of a plurality of blocks neighboring said first block and generating blocks of image data for display.
0. 7. The video decoder of
0. 8. The video decoder of
0. 9. The video decoder of
0. 10. The video decoder of
0. 11. A method of encoding image data, comprising the steps of:
receiving blocks of image data, each block including data for an array of pixels,
transposing selected pixels on a boundary edge of a first block with selected pixels from a plurality of blocks neighboring said first block,
transforming pixel data of the blocks from the step transposing to coefficients, and
scaling the transformed blocks.
0. 12. The method of
0. 13. The method of
0. 14. The method of
0. 15. The method of
0. 16. The method of
0. 17. A method of decoding blocks of encoded image data, comprising the steps of:
scaling the coded blocks to obtain blocks of coefficient data,
transforming the coefficient data of the blocks to pixel data, and
transposing selected pixels on a boundary edge of a first block with selected pixels from a plurality of blocks neighboring said first block.
0. 18. The method of
0. 19. The method of
0. 20. The method of
0. 21. The method of
0. 22. The method of
0. 23. A bitstream generated by a process comprising the steps of:
receiving blocks of image data, each block including data for an array of pixels,
transposing selected pixels on a boundary edge of a first block with selected pixels from blocks neighboring the first block,
transforming pixel data of the transposed blocks to coefficients, and
scaling the transformed blocks.
0. 24. The method of
0. 25. The method of
0. 26. The method of
0. 27. The method of
0. 28. The method of
0. 30. The method of
0. 31. The method of
0. 32. The method of
0. 33. The method of
0. 34. The method of
0. 35. The method of
0. 36. The method of
0. 37. The method of
0. 38. The method of
0. 39. The method of
0. 41. The method of
0. 42. The method of
0. 43. The method of
0. 44. The method of
0. 45. The method of
0. 46. The method of
0. 47. The method of
0. 48. The method of
0. 49. The method of
0. 50. The method of
0. 51. The method of
0. 53. The video coder of
0. 54. The video coder of
0. 55. The video coder of
0. 56. The video coder of
0. 57. The video coder of
0. 58. The video coder of
0. 59. The video coder of
0. 60. The video coder of
0. 62. The video decoder of
0. 63. The video decoder of
0. 64. The video decoder of
0. 65. The video decoder of
0. 66. The video decoder of
0. 67. The video decoder of
0. 68. The video decoder of
0. 69. The video decoder of
0. 71. The bitstream of
0. 72. The bitstream of
0. 73. The bitstream of
0. 74. The bitstream of
0. 75. The bitstream of
0. 76. The bitstream of
0. 77. The bitstream of
0. 78. The bitstream of
0. 79. The bitstream of
0. 80. The bitstream of
|
|||||||||||||||||||||||||
The present invention relates to block based video coding schemes and, most particularly, to a method of eliminating artifacts at block boundaries by transposing pixels at block boundaries with pixels from boundaries of neighboring blocks before coding.
Known systems for coding video information advantageously employ transform coding of a plurality of blocks or macro blocks. In such systems, image data often are filtered, broken down into a luminance component and two chrominance components, and organized into blocks of image data. For example, according to the proposed MPEG-4 video standard, image data are organized first into blocks, each containing an 8 pixel by 8 pixel array of data, then into macro blocks including up to four luminance blocks and two chrominance blocks. The blocks of image data are then transform coded from a pixel domain to an array of transform coefficients and scaled by a quantization parameter and transmitted in an output bit stream.
Block-based transform coding is preferred over other known coding schemes, such as wavelet coding, because it is relatively less complex to implement. However, such block-based transform coding causes annoying artifacts in the reconstructed image. Quantization parameters may be established for each block or macro block of image data. Differences in quantization parameters among the various blocks or macro blocks result in distortion at the block boundaries. For instance, in flat image areas, such distortions impose a patchwork effect on reconstructed image data. Similar artifacts appear in image areas having heavy texture, but are less noticeable. Block based coding with variable quantization causes additional artifacts to arise, such as chromo-bleeding, “mosquito-noise” and “ringing” artifacts.
Prior systems have attempted to ameliorate the effect of such artifacts by low pass filtering reconstructed image data at block boundaries. However, while low pass filtering reduces block artifacts, it also causes blurring of image data. Low pass filtering impairs image quality.
There is a need in the art for an image coder that advantageously employs block-based transform coding and quantization but reduces image artifacts at block boundaries. Further, there is a need in the art for a coding scheme that reduces artifacts without unnecessarily blurring image data.
The disadvantages of the prior art are alleviated to a great extent by an image coding scheme that employs block-based transform coding and quantization. An encoder transposes pixels across block boundaries in a predetermined direction prior to transform coding. For example, alternate pixels along a boundary of a first block may be transposed with adjacent pixels in a diagonal direction of neighboring blocks. After transposition, each reformed block undergoes transform coding and quantization.
A decoder performs reverse operations of those employed by the encoder. Each coded block is dequantized and coded by an inverse transform to reconstruct blocks of pixel information. At the conclusion of the inverse transform, pixels that were subject to transposition are returned to the neighboring blocks from which they originated. After transposition, each block may be processed further for display.
The pixel transposition reduces image artifacts at block boundaries and improves image quality, particularly in flat image areas. By including cross border pixels in the transform coding and quantization, the transform coding and quantization are performed with greater uniformity on image data.
FIGS. 1(a) and 1(b) respectively illustrate an encoder 100 and a decoder 200 according to an embodiment of the present invention.
FIGS. 2(a) and 2(b) respectively illustrate the pixel transposition operation of the present invention as applied to blocks and macro blocks of image data.
Turning to FIG. 1(a), circuitry of an encoder 100 is illustrated therein constructed in accordance with an embodiment of the present invention. Blocks or macro blocks of image data are input to a pixel transposition circuit 110. Each block possesses one of luminance or chrominance image data. The pixel transposition circuit 110 transposes specific pixels from the boundary of each block or macro block with pixels from its neighbors. The pixel transposition circuit 110 then outputs reconstituted blocks of pixel data to a transform coder 120. The transform coder 120 performs a transform of the block data from a pixel domain to a domain of coefficients representative of the pixel data. For example, the transform coder 120 may perform a discrete cosine transform as is known in the art. The transform coder 120 outputs blocks of coefficient data to a quantizer 130. For each block or macro block, the quantizer 130 generates a quantizer parameter (Qp) based upon the bandwidth of a channel available to transmit the coded image data. The quantizer 130 scales the coefficients of the block by the quantization parameter. The quantizer 130 outputs blocks of scaled coefficient information and the quantization parameters generated for each for further processing and transmission.
FIG. 1(b) illustrates circuitry of a decoder 200 constructed in accordance with an embodiment of the present invention. Blocks of scaled coefficients are isolated from the transmitted bit stream and input to a dequantizer 230. The dequantizer 230 identifies the quantization parameter for each block and scales the scaled coefficients of the block by the quantization parameter. Where the quantizer 130 may have divided each coefficient by Qp, the dequantizer multiplies the scaled coefficients by the same Qp to obtain the original coefficients. The dequantizer 230 outputs reconstructed coefficient data to an inverse transform coding circuit 220. The inverse transform coding circuit 220 transforms the coefficients back to the pixel domain, such as by discrete transform coding. The inverse transform coding circuit 220 outputs blocks or macro blocks of reconstructed pixel data to an inverse pixel transposition circuit 210. For each block or macro block, the inverse pixel transposition circuit 210 transposes pixels along its boundary with pixels of its neighbors in a direction complementary to the process applied by the pixel transposition circuit 110. The inverse pixel transposition circuit 210 returns pixels to their original position in the neighboring blocks or macro blocks. The inverse pixel transposition circuit 110 outputs blocks of pixel information for further processing and display.
An example of a pixel transposition process is shown in FIG. 2(a) applied on a block by block basis. For each block A, the pixel transposition circuit 110 stores, in memory, pixel information from a plurality of surrounding Blocks 1-8. The pixel transposition circuit 110 transposes pixel information in a predetermined direction. In the example of FIG. 2(a), the pixels are transposed along a diagonal direction from high-left to low-right and vice versa.
Under the pixel transposition process, each alternate pixel on the edge of a given block A is transposed with a pixel across the block boundary in the predetermined direction. In the example of FIG. 2(a), the pixel in the upper left-hand corner of block A is transposed with a pixel in the lower right-hand corner of block 1. Three pixels along the upper edge of block A are transposed with pixels on the lower edge of block 2 in the same diagonal direction. Alternate pixels found on the right-hand edge of block A are transposed with pixels on the left-hand edge of block 4 in the diagonal direction. The pixel in the lower right-hand corner of block A is transposed with a pixel in the upper left-hand corner of block 5. Alternate pixels on the lower edge of block A are transposed with pixels on the upper edge of block 6 in the diagonal direction. Finally, alternate pixels on the left hand edge of block 8 are transposed with pixels found on the right-hand edge of block 8 in the diagonal direction.
Pixel transposition is performed only on like-kind data. When performing pixel transposition on a luminance block, the pixel transposition circuit 110 considers only neighboring luminance blocks for transposition. Similarly, for blocks of each of the two chrominance signals, pixel transposition is performed only with neighboring chrominance image blocks of the same type.
FIG. 2(b) illustrates an example where pixel transposition is performed on a macro block by macro block basis. In the event that the quantizer circuit 130 computes quantization parameters for each macro block rather than for each block, it is preferable to perform a pixel transposition on a macro block by macro block basis. In this example, a macro block consists of four blocks of image information, Blocks A-D. The macro block is surrounded by twelve neighboring blocks, Blocks 1-12. For the macro block, pixel transposition is performed on alternate pixels on the boundary of the macro block with pixel information of neighboring macro blocks along a pre-determined direction. In this example, the predetermined direction is from low-left to high-right and vice versa. As shown in FIG. 2(b), the pixel in the upper right-hand corner of Block B is transposed with a pixel in the lower left-hand corner of Block 4. Similarly, a pixel in a lower left-hand corner of Block C is transposed with a pixel in the upper right-hand corner of Block 10. Alternate pixels on the top edge of the macro block, the top edges of Blocks A and B, are transposed with pixels on the bottom edges of Blocks 2 and 3 in a diagonal direction. Pixels on the right-hand edge of the macro block, the right-hand edges of Blocks B and D, are transformed on the left-hand edges of Blocks 5 and 6 in the diagonal direction. Blocks on the lower edge of the macro block, the lower edges of Blocks C and D, are transposed with pixels found in the diagonal direction on the upper edges of Blocks 8 and 9. Finally, pixels found on the left-hand edge of the macro block, the left-hand edges of Blocks A and C, are transposed with pixels found in a diagonal direction in the right-hand edges of Blocks 11 and 12.
The direction of transposition is arbitrary. Any direction may be applied. In addition to high-left to low-right and low-left to high-right, horizontal (right to left) and vertical (above to below) directions may be applied. The direction may be predetermined by the system or defined for each coded video frame. If the direction of transposition is variable, the pixel transposition circuit 110 includes a transposition keyword in the output bitstream identifying the direction of transposition. The decoder identifies the transposition keyword and identifies a direction of transposition therefrom.
So, too, the pattern of transposition may varied. In addition to selection of alternate pixels for transposition, every third or every fourth pixel may be selected for transposition. Further, the pattern may varied so as to select pixels at a first rate, such as every other pixel, in a first region of data, then a second rate, such as every fourth pixel, in a second region of data.
The encoder 100 and decoder 200 shown in FIGS. 1(a) and 1(b) are not full video coders. Preprocessing is generally performed on pixels before they are input to the pixel transposition circuit 110, which generally involves sampling of image data, conversion to a digital format, filtering, and component isolation. Preprocessing also includes organization of the component signals into blocks. However, in a preferred embodiment, preprocessing functions may be merged into the pixel transposition circuit 110. In this case, the pixel transposition circuit may be programmed to reorder pixels before they are organized into blocks.
Haskell, Barin Geoffry, Puri, Atul, Schmidt, Robert Louis
| Patent | Priority | Assignee | Title |
| Patent | Priority | Assignee | Title |
| 5367385, | May 07 1992 | Polycom, Inc | Method and apparatus for processing block coded image data to reduce boundary artifacts between adjacent image blocks |
| 5454051, | Aug 05 1991 | Eastman Kodak Company | Method of reducing block artifacts created by block transform compression algorithms |
| 5619591, | Aug 23 1995 | VTech Electronics, Ltd | Encoding and decoding color image data based on mean luminance and an upper and a lower color value |
| 5757969, | Feb 28 1995 | QUARTERHILL INC ; WI-LAN INC | Method for removing a blocking effect for use in a video signal decoding apparatus |
| 5764805, | Oct 23 1996 | MEDIATEK, INC | Low bit rate video encoder using overlapping block motion compensation and zerotree wavelet coding |
| 5818532, | May 03 1996 | AVAGO TECHNOLOGIES GENERAL IP SINGAPORE PTE LTD | Micro architecture of video core for MPEG-2 decoder |
| 5850294, | Dec 18 1995 | THE CHASE MANHATTAN BANK, AS COLLATERAL AGENT | Method and apparatus for post-processing images |
| 5852682, | Feb 28 1995 | QUARTERHILL INC ; WI-LAN INC | Post-processing method and apparatus for use in a video signal decoding apparatus |
| 5881180, | Feb 08 1996 | Sony Corporation; Sony Electronics, Inc. | Method and apparatus for the reduction of blocking effects in images |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Date | Maintenance Fee Events |
| Sep 23 2011 | M1553: Payment of Maintenance Fee, 12th Year, Large Entity. |
| Date | Maintenance Schedule |
| Feb 02 2013 | 4 years fee payment window open |
| Aug 02 2013 | 6 months grace period start (w surcharge) |
| Feb 02 2014 | patent expiry (for year 4) |
| Feb 02 2016 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Feb 02 2017 | 8 years fee payment window open |
| Aug 02 2017 | 6 months grace period start (w surcharge) |
| Feb 02 2018 | patent expiry (for year 8) |
| Feb 02 2020 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Feb 02 2021 | 12 years fee payment window open |
| Aug 02 2021 | 6 months grace period start (w surcharge) |
| Feb 02 2022 | patent expiry (for year 12) |
| Feb 02 2024 | 2 years to revive unintentionally abandoned end. (for year 12) |