Method of reducing a blocking artifact when coding moving picture

Information

  • Patent Grant
  • 8983225
  • Patent Number
    8,983,225
  • Date Filed
    Monday, October 5, 2009
    15 years ago
  • Date Issued
    Tuesday, March 17, 2015
    9 years ago
Abstract
A method of coding a moving picture is provided that reduces blocking artifacts. The method can include defining a plurality of defining pixels S0, S1, and S2, which are centered around a block boundary. If a default mode is selected then frequency information of the surroundings of the block boundary is obtained. A magnitude of a discontinuous component in a frequency domain belonging to the block boundary is adjusted based on a magnitude of a corresponding discontinuous component selected from a pixel contained entirely within a block adjacent the block boundary. The frequency domain adjustment is then applied to a spatial domain. Or, a DC offset mode can be selected to reduce blocking artifacts in smooth regions where there is little motion.
Description
TECHNICAL FIELD

The present invention relates to a moving picture process, and in particular to a method for processing blocks of a moving picture to increase a compression ratio and to improve coding efficiency.


BACKGROUND

To efficiently compress a time variable video sequence, redundancy in the temporal domain as well as in the two dimensional spatial domain must be reduced. MPEG uses a discrete cosine transform (DCT) to reduce the redundancy in the two dimensional spatial domain and a motion compensation method to reduce the redundancy in the temporal domain.


The DCT is a method of reducing the correlativity between data through a two dimensional spatial transformation. Each block in a picture is spatially transformed using the DCT after the picture is divided into blocks. Data that has been spatially transformed tends to be driven to a certain direction. Only a group of the data driven in the certain direction is quantized and transmitted.


Pictures, which are consecutive in the temporal domain, form motions of a human being or an object at the center of the frame. This property is used to reduce the redundancy of the temporal domain in the motion compensation method. A volume of data to be transmitted can be minimized by taking out a similar region from the preceding picture to fill a corresponding region, which has not been changed (or has very little change), in the present picture. The operation of finding the most similar blocks between pictures is called a motion estimation. The displacement representing a degree of motion is called a motion vector. MPEG uses a motion compensation-DCT method so that the two methods combine.


When a compression technique is combined with a DCT algorithm, the DCT transform is usually performed after input data is sampled in a unit size of 8×8, and the transform coefficients are quantized with respect to a visual property using quantization values from a quantization table. Then, the data is compressed through a run length coding (RLC). The data processed with the DCT is converted from a spatial domain to a frequency domain and compressed through the quantization with respect to the visual property of human beings, not to be visually recognized. For example, since eyes of human beings are insensitive to a high frequency, a high frequency coefficient is quantized in a large step size. Thus, a quantization table is made according to external parameters, such as a display characteristic, watching distance, and noise, to perform an appropriate quantization.


For the quantized data, the data having a relatively high frequency is coded with a short code word. The quantized data having a low frequency is coded with a long code word. Thus, the data is finally compressed.


In processing a moving picture as discussed above, blocks are individually processed to maximize the compression ratio and coding efficiency. However, the individual process causes blocking artifacts that disturb the eyes of human beings at boundaries between blocks.


Accordingly, various methods for reducing a blocking artifact in a coding system, which individually processes blocks, are presented. For example, attempts to reduce the blocking artifact by changing processes of coding and decoding have been implemented. However, this method of changing the processes of coding and decoding increases the amount of bits to be transmitted.


Another method for reducing the blocking artifact is based on the theory of projection onto convex sets (POCS). However, this method is applied to only a still picture because of an iteration structure and convergence time.


The blocking artifact is a serious problem in a low transmit rate moving picture compression. Since a real-time operation is necessary in coding and decoding a moving picture, it is difficult to reduce the blocking artifact with a small operation capacity.


Consequently, the related art methods involve various problems and disadvantages when reducing a blocking artifact created in coding a moving picture. A calculation for performing an algorithm is complicated, and the calculation amount and time become correspondingly large. Further, the blocking artifacts are not reduced in either complex regions or smooth regions in a picture. In addition, the amount of bits to be transmitted increases.


The above references are incorporated by reference herein where appropriate for appropriate teachings of additional or alternative details, features and/or technical background.


SUMMARY

An object of the present invention is to provide a method for reducing a blocking artifact appearing when coding a moving picture that substantially obviates one or more of the limitations and disadvantages of the related art.


Another object of the present invention is to provide an MPEG-4 video coding method that reduces a blocking artifact in a real-time moving picture using a frequency property around boundaries between blocks.


A further object of the present invention is to provide a method for reducing a blocking artifact that increases a compression ration and increases a coding efficiency.


To achieve these and other advantages in whole or in parts, and in accordance with the purpose of the present invention as embodied and broadly described, a blocking artifact reduction method includes defining pixels centered around a block boundary and setting a default mode. Frequency information of the surroundings of the block boundary is obtained for each pixel using a 4-point kernel. A magnitude of a discontinuous component that belongs to the block boundary is adjusted in a frequency domain to a minimum value of a magnitude of a discontinuous component that belongs to the surrounding of the block boundary. The adjusting operation is then applied to a spatial domain. In addition, a DC offset mode is established, and in the DC offset mode the blocking artifact is also reduced, for example, in a smooth region where there is little motion.


Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objects and advantages of the invention may be realized and attained as particularly pointed out in the appended claims.





DESCRIPTION OF DRAWINGS

The invention will be described in detail with reference to the following drawings in which like reference numerals refer to like elements wherein:



FIG. 1 is a diagram that illustrates horizontal and vertical block boundaries;



FIG. 2 is a diagram that illustrates a 4-point DCT kernel; and,



FIG. 3 is a flow chart that illustrates a preferred embodiment of a method that reduces a blocking artifact when coding a moving picture according to the present invention.





DETAILED DESCRIPTION

Reference will now be made to preferred embodiments of the present invention, examples of which are illustrated in the accompanying drawings. FIG. 1 illustrates typical horizontal and vertical block boundaries.


As shown in FIG. 1, in the dimensional image formed with respective four points of S0, S1, and S2 located around the block boundary, S1 and S2 are individually processed with a block-unit compression method. Thus, S1 and S2 are not influenced by the blocking artifact. However, S0 is located across a block boundary. Thus, S0 is directly influenced by the blocking artifact. The blocking artifact appears at the boundary between fixed block patterns in the form of a line of discontinuity.


Preferred embodiments of the present invention use, for example, a frequency property to preserve complex regions at block boundaries. The frequency property around the boundary is preferably obtained by using a 4-point DCT kernel, which can be easily calculated. However, the present invention is not intended to be limited to this. In this case, the complex region at a block boundary can be effectively processed by extending the smoothness of a picture from a frequency domain to a spatial domain.


As shown in FIG. 1, S0 is located across the block boundary. Thus, S0 is directly influenced by the blocking artifact. To reduce the blocking artifact from S0, a first preferred embodiment of the present invention uses frequency information in S1 and S2. The blocking artifact can be removed from S0 by replacing the frequency component in S0, which is influenced by the blocking artifact, with the frequency components of S1 and S2. In other words, S0 contains a discontinuity. However, S1 and S2, which are completely included inside respective blocks, are not related to the discontinuity. Since S1 and S2 are not involved with the discontinuity at a block boundary, S1 and S2 can accurately represent features of the respective neighboring blocks.


When images change smoothly, image features of S0, S1 and S2 are similar. This means that frequency domains of S0, S1 and S2 have similar features. The preferred embodiments use a DCT, or the like as a frequency analysis tool. DCT is widely used in an image compression technique.



FIG. 2 is a diagram illustrating a 4-point DCT basis. As shown in FIG. 2, the 4-point DCT kernel basis has symmetric and anti-symmetric properties around the center of 4 points. In FIG. 2, a0,0, a1,0, a2,0, and a3,0 are defined as the 4-point DCT coefficients of S0. Although both a2,0, and a3,0 are high frequency components, a2,0 is symmetric, and a3,0 is anti-symmetric around the center.


The center of S0 is located at a block boundary as shown in FIG. 1. Thus, a factor directly affecting the block discontinuity is not the symmetric component but the anti-symmetric component. The magnitude of a3,0 in a frequency domain is thus adjusted based on the anti-symmetric component being a major factor affecting the discontinuity. Accordingly, the proper adjustment of a3,0 is directly related to the reduction of block discontinuity in the spatial domain. Reduction of the block discontinuity will now be described.


In a first preferred embodiment, the magnitude of a3,0 is replaced with the minimum value of the magnitudes of a3,1 and a3,2, which are contained in a single block in an area surrounding a block boundary. By doing this, a large blocking artifact that appears when one side of the block boundary to be processed is smooth can be reduced. For a complex image where both S1 and S2 are the objects of motion (i.e., all the values of the magnitudes of a3,0, a3,1 and a3,2 are large), there is little influence on the block boundary.


A method for reducing a blocking artifact in a default mode is as follows:

v3′=v3−d;
v4′=v4+d; and
d=CLIP(c2(a3,0′−a3,0)//c3,0, (v3−v4)/2)*δ(|a3,0|<QP).


In the method, a3,0′=SIGN(a3,0)*MIN(|a3,0|,|a3,1|,|a3,2|), and q is the component of DCT kernel. The condition |a3,0|<QP is used to count the influence of the quantization parameter on the blocking artifact. The |a3,0|<QP condition also prevents over-smoothing when the blocking artifact is not very serious. The clipping operation on the compensated value prevents the direction of the gradient at the boundary from being large or changed in an opposite direction. The boundary pixel values, v3 and v4, are replaced with v3′ and v4′. QP is the quantization parameter of the macroblock where v4 belongs. Values, c1, c2, and c3 are kernel constants used in the 4-point DCT. To simplify an equation according to a first preferred embodiment of the present invention, the values of c1 and c2 are approximated to an integer, and the value of c3 is approximated to a multiple of 2. The values of a1, a2, and a3 are evaluated from the simple inner product of the DCT kernel and pixels, S0, S1, and S3.

a3,0=([c1−c2 c2−c1]*[v2 v3 v4 v5]T)/c3
a3,0=([c1−c2 c2−c1]*[v0 v1 v2 v3]T)/c3
a3,0=([c1−c2 c2−c1]*[v4 v5 v6 v7]T)/c3


Such processes are performed in both horizontal and vertical block boundaries. In this manner, the blocking artifacts in the whole frame can be reduced.


The first embodiment reduces a blocking artifact in the default mode. However, in the default mode, only the boundary pixel values, v3 and a4, are compensated. Thus, the default mode is not sufficient to reduce the blocking artifact in a very smooth region, such as a setting in a picture.


To reduce the blocking artifact in the smooth region, a second preferred embodiment of a method for reducing blocking artifacts in a moving picture according to the present invention includes a DC offset mode. The method in the DC offset mode is as follows:

v3′=v3−d;
v4′=v4+d;
v2′=v2−d2;
v5′=v5+d2;
v1′=v1−d3; and
v6′=v6+d3.


In the second preferred embodiment,

d1=(3(v3−v4)/8)*δ(|a3,0|<QP),
d2=(3(v3−v4)/16)*δ(|a3,0|<QP), and
d3=(3(v3−v4)/32)*δ(|a3,0|<QP).


The blocking artifact in the region where there is little motion, or which is a very small setting, is reduced through the above-described method or the like in the DC offset mode. An appropriate mode between the DC offset mode and default mode can be determined using the following conditional expression:

If (v0==v1&&v1==v2&&v2==v3&&v4==v5&&v5==v6&&v6==v7)


DC offset mode is applied; Else Default mode is applied.


When the DC offset mode or the default mode is selected according to the above conditional expression, the blocking artifacts are reduced in each mode. After determining the proper mode between the DC offset mode and the default mode, the block discontinuity at the boundary is compensated to form a consecutive line, which reduces the blocking artifact. In the second preferred embodiment, the DC offset mode and the default mode are set using S0, S1 and S2. However, the present invention is not intended to be limited to this. Alternative sets of points or the like can be used.


An exemplary method for reducing a blocking artifact when coding a moving picture, according to the second preferred embodiment of the present invention, is described with reference to the flow chart shown in FIG. 3.


After beginning in FIG. 3, control continues to step 101. In step 101, a plurality of pixels, S0, S1, and S2 are defined centering around a block boundary. From step 101, control continues to step 102. In step 102, if a mode is selected, a default mode is set, and control continues to step 103.


In step 103, frequency information of the surroundings of the block boundary for each pixel is obtained using, for example, the 4-point DCT kernel. From step 103, control continues to step 104. In step 104, the magnitude of discontinuous component belonging to the block boundary is replaced with the minimum magnitude of the discontinuous components belonging to the surroundings of the block boundary in the frequency domain. From step 104, control continues to step 105, where the adjusting operation is applied to the spatial domain. The default mode is effective in reducing the blocking artifact in a complex region of a picture. However, the default mode is less successful in a smooth region such as a setting in a picture.


Therefore, in a smooth region it is necessary to reduce the blocking artifact in another mode, the DC offset mode. In step 106, the DC offset mode is established. From step 106, control continues to step 107. In step 107, the blocking artifact in the region where there is little motion, such as a setting, is reduced. From step 107, the process ends. Thus, the overall blocking artifacts can be reduced according to the preferred embodiments.


As described above, the blocking artifact reduction methods according to the preferred embodiments of the present invention have various advantages and effects. The blocking artifact is more easily and effectively reduced using features of the frequency domain. The preferred embodiments provide a visually finer quality of a picture by reducing the blocking artifacts in both the complex and smooth regions. Further, calculations are simple. Accordingly, the amount of bits does not increase.


The foregoing embodiments are merely exemplary and are not to be construed as limiting the present invention. The present teaching can be readily applied to other types of apparatuses. The description of the present invention is intended to be illustrative, and not to limit the scope of the claims. Many alternatives, modifications, and variations will be apparent to those skilled in the art.

Claims
  • 1. A computer-implemented method comprising: obtaining, a first block including a first boundary pixel and a second block including a second boundary pixel, wherein the first and second boundary pixels are neighboring to each other and separated by a boundary between the first and second blocks; andperforming a filtering operation on the boundary between the first and second blocks, wherein the filtering operation includes: obtaining a parameter based on four successive pixels including the first and second boundary pixels, andadjusting each of the first and second boundary pixels using an adjustment value when an absolute value of the parameter is less than a value representing quantization information, and wherein the adjustment value is determined using a difference between the first and second boundary pixels.
  • 2. The method of claim 1, wherein the adjustment value is determined using a clipping operation.
  • 3. A device comprising a deblocking filter configured to: obtain, a first block including a first boundary pixel and a second block including a second boundary pixel, wherein the first and second boundary pixels are neighboring to each other and separated by a boundary between the first and second blocks; andperform a filtering operation on the boundary between the first and second blocks, wherein the filtering operation includes: obtaining a parameter based on four successive pixels including the first and second boundary pixels, andadjusting each of the first and second boundary pixels using an adjustment value when an absolute value of the parameter is less than a value representing quantization information, and wherein the adjustment value is determined using a difference between the first and second boundary pixels.
  • 4. The device of claim 3, wherein the adjustment value is determined using a clipping operation.
Priority Claims (1)
Number Date Country Kind
97-36231 Jul 1997 KR national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/105,324, filed Apr. 18, 2008, which is a continuation of U.S. application Ser. No. 11/770,260, filed Jun. 28, 2007, now U.S. Pat. No. 7,391,921, which is a continuation of U.S. application Ser. No. 09/506,728, filed Feb. 18, 2000, now U.S. Pat. No. 7,239,755, which is a continuation of U.S. application Ser. No. 09/010,446, filed Jan. 22, 1998, now U.S. Pat. No. 6,028,967, which claims the benefit of a foreign priority application filed in KOREA on Jul. 30, 1997, as Serial No. 36231/1997. This application claims priority to all of these applications, and all of these applications are incorporated by reference.

US Referenced Citations (106)
Number Name Date Kind
4903138 Aragaki Feb 1990 A
4941043 Jass Jul 1990 A
5229864 Moronaga et al. Jul 1993 A
5337088 Honjo Aug 1994 A
5367385 Yuan Nov 1994 A
5384849 Jeong Jan 1995 A
5422964 Devimeux Jun 1995 A
5454051 Smith Sep 1995 A
5555029 Kim Sep 1996 A
5565921 Sasaki et al. Oct 1996 A
5590064 Astle Dec 1996 A
5596659 Normile et al. Jan 1997 A
5608652 Astale Mar 1997 A
5629778 Reuman May 1997 A
5677736 Suzuki et al. Oct 1997 A
5680477 Asada Oct 1997 A
5740283 Meeker Apr 1998 A
5787204 Fukuda Jul 1998 A
5787210 Kim Jul 1998 A
5796875 Read Aug 1998 A
5852682 Kim Dec 1998 A
5903679 Park May 1999 A
5911008 Niikura et al. Jun 1999 A
5923376 Pullen et al. Jul 1999 A
5933542 Chang et al. Aug 1999 A
5937101 Jeon et al. Aug 1999 A
5949917 Kawasaka Sep 1999 A
5974196 Chang et al. Oct 1999 A
6028867 Rawson et al. Feb 2000 A
6028967 Kim et al. Feb 2000 A
6040879 Park Mar 2000 A
6052490 Haskell et al. Apr 2000 A
6104434 Nakagawa et al. Aug 2000 A
6144700 Kim Nov 2000 A
6151420 Wober et al. Nov 2000 A
6167164 Lee et al. Dec 2000 A
6188799 Tan et al. Feb 2001 B1
6240135 Kim May 2001 B1
6314209 Kweon et al. Nov 2001 B1
6317522 Rackett Nov 2001 B1
6320905 Konstantinides Nov 2001 B1
6463182 Onishi et al. Oct 2002 B1
6614946 Edgar Sep 2003 B1
6724944 Kalevo Apr 2004 B1
6922492 Yu et al. Jul 2005 B2
7003170 Martucci Feb 2006 B1
7003174 Kryukov Feb 2006 B2
7006255 Sun et al. Feb 2006 B2
7031393 Kondo Apr 2006 B2
7054503 Ishikawa May 2006 B2
7209594 Martucci Apr 2007 B1
7233706 Kim Jun 2007 B1
7239755 Kim et al. Jul 2007 B1
7262886 Kim et al. Aug 2007 B2
7277593 Kim Oct 2007 B2
7283681 Kim Oct 2007 B2
7283682 Kim Oct 2007 B2
7289682 Kim Oct 2007 B2
7292733 Monobe et al. Nov 2007 B2
7305142 Kim Dec 2007 B2
7305143 Kim Dec 2007 B2
7359569 Kim Apr 2008 B2
7359570 Kim Apr 2008 B2
7362913 Kim Apr 2008 B2
7362914 Kim Apr 2008 B2
7379616 Kim May 2008 B2
7379617 Kim May 2008 B2
7382930 Kim et al. Jun 2008 B2
7391921 Kim Jun 2008 B2
7391922 Kim Jun 2008 B2
7391923 Kim Jun 2008 B2
7391924 Kim Jun 2008 B2
7394945 Kim Jul 2008 B2
7397853 Kwon et al. Jul 2008 B2
7397965 Kim Jul 2008 B2
7397966 Kim Jul 2008 B2
7397967 Kim Jul 2008 B2
7400780 Kim Jul 2008 B2
7403667 Kim et al. Jul 2008 B2
7406209 Kim Jul 2008 B2
7437015 Kim Oct 2008 B2
7454082 Kim Nov 2008 B2
7463786 Kim Dec 2008 B2
7492959 Kim Feb 2009 B2
7492960 Kim Feb 2009 B2
7492961 Kim Feb 2009 B2
7496239 Kim Feb 2009 B2
7499598 Kim Mar 2009 B2
7706627 Frishman et al. Apr 2010 B2
8135232 Kimura Mar 2012 B2
8295367 Tang et al. Oct 2012 B2
20030138160 Ishikawa Jul 2003 A1
20030194013 Alvarez Oct 2003 A1
20050196066 Kim et al. Sep 2005 A1
20050243911 Kwon Nov 2005 A1
20050243912 Kwon Nov 2005 A1
20050243913 Kwon Nov 2005 A1
20050243914 Kwon Nov 2005 A1
20050243915 Kwon Nov 2005 A1
20050243916 Kwon Nov 2005 A1
20050244063 Kwon Nov 2005 A1
20060159351 Bae et al. Jul 2006 A1
20060274959 Piastowski Dec 2006 A1
20070071095 Lim Mar 2007 A1
20070223835 Yamada et al. Sep 2007 A1
20080037893 Okumichi et al. Feb 2008 A1
Foreign Referenced Citations (3)
Number Date Country
0808068 Nov 1997 EP
2002-232889 Aug 2002 JP
WO-02096117 Nov 2002 WO
Non-Patent Literature Citations (13)
Entry
E, Barzykina et al., “Removal of Blocking Artifacts using Random Pattern Filtering”, Image Processing, 1999 ICIP 99. Proceedings. 1999 International Conference, vol. 3 1999, 904-908 vol. 2.
Haan, G. De et al., “IC for Motion-Compensation 100Hz TV with Natural-Motion Movie-Mode”, IEEE Transactions on Consumer Electronics, vol. 42 Feb. 1996, 165-174.
Jeon, Byeungwoo et al., “Blocking Artifacts Reduction in Image Compression with Block Boundary Discontinuity Criterion”, Circuits and System for Video Technology, IEEE Transactions on, vol. 8 Jun. 1998, 345-357.
Kasezawa, T et al., “Blocking Artifacts Reduction using Discrete Cosine Transform,”, Consumer Electronics, IEEE Transactions on, vol. 43 issue 1 Feb. 1997, 48-55.
Lai, Yung-Kai et al., “Image Enhancement for Low Bit-rate JPEG and MPEG Coding via Postprocessing”, IEEE Transactions on Consumer Electronics, vol. 42, 1484-1494.
Lai, Yung-Kai et al., “Removal of Blocking Artifacts of DCT Transform by Classified Space-Frequency Filtering”, Signal, Systems, and Computers, 1995, Conference Record of the Twenty-Nine Asilomar Conference on, vol. 2 1996, 1457-1461.
Minami, Shigenobu et al., “An Optimization Approach for Removing Blocking Effects in Transform Coding”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 5 No. 2 Apr. 1995, 74-82.
Nakajima, Yasuyuki et al., “A PEL Adaptive Reduction of Coding Artifacts for MPEG Video Signals”, IEEE 1994, 928-932.
Ozcelik, Taner et al., “Image and Video Compression Algorithms Based on Recovery Techniques Using Mean Field Annealing”, Proceedings of the IEEE, vol. 83, No. 2 Feb. 1995, 304-316.
Shen, Mei-Yin et al., “Fast compression artifact reduction technique based on nonlinear filter”, Circuits and Systems, 1999. ISCAS '99. Proceedings of the 1999 IEEE international Symposium on, vol. 4 1999, 179-182.
Sullivan, Gary J. et al., “Motion Compensation for Video Compression Using Control Grid Interpolation”, IEEE International Conference 1991, 2713-2716.
Yang, Yongyi et al., “Regularized Reconstruction to Reduce Blocking Artifacts of Block Discrete Cosine Transform Compressed Images”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 3, No. 6 Dec. 1993 , 421-432.
Zakhor, Avideh et al., “Iterative Procedures for Reduction of Blocking Effects in Transform Image Coding”, IEEE Transaction on Circuits and Systems for Video Technology, vol. 2, No. 1 Mar. 1992, 91-95.
Related Publications (1)
Number Date Country
20100086058 A1 Apr 2010 US
Continuations (4)
Number Date Country
Parent 12105324 Apr 2008 US
Child 12573531 US
Parent 11770260 Jun 2007 US
Child 12105324 US
Parent 09506728 Feb 2000 US
Child 11770260 US
Parent 09010446 Jan 1998 US
Child 09506728 US