Abstract:
The present invention relates to an image compression and decompression method, in particular in the areas of computer image processing and data compression. The currently, the process speed for which JPEG (Joint Photographic Experts Group, a compression standard) is applied, it&#39;s not all too satisfactory. One aspect of the present invention is simplify compression process based on particular features of an image, thus achieve the aim of accelerate the processing speed. Apply the process described in the present invention, the processing speed for JPEG compression/decompression would rise, without suffers quality reduction compare to current JPEG compression/decompression method.

Description:
TECHNICAL FIELD 
       [0001]    The present invention relates to computer image processing and data compression technology, in particular to a process of accelerated image compression and decompression. 
       BACKGROUND OF THE INVENTION 
       [0002]    Joint Photographic Experts Group (JPEG) is a committee under International Standard Organization (ISO) responsible for setting up the static image compression formats international standard which is widely used in the areas of image storage and digital cameras. JPEG proposes a number of processes for image compression and decompression based on the discrete cosine transform (DCT) and the inverse discrete cosine transform (IDCT). 
         [0003]    A known process of image compression based on the DCT comprises the following steps. 
         [0004]    Step 1 is a pre-processing step by inputting image data. The purpose of this step is to pre-process the input data so as to make the input data match the following steps, or so as to achieve desirable compression result. This step comprises splitting an original image data into a plurality of 8×8 blocks, standardizing the pixels of the input image, and performing a color space transformation, etc. 
         [0005]    Step 2 is to perform the DCT. The input of this step is 8×8 image data blocks, wherein all the values of pixels are standardized. The equation for the DCT is: 
         [0000]    
       
         
           
             
               F 
                
               
                 ( 
                 
                   u 
                   , 
                   v 
                 
                 ) 
               
             
             = 
             
               
                 1 
                 4 
               
                
               
                 C 
                  
                 
                   ( 
                   u 
                   ) 
                 
               
                
               
                 C 
                  
                 
                   ( 
                   v 
                   ) 
                 
               
                
               
                 ∑ 
                 
                   ∑ 
                   
                     
                       f 
                        
                       
                         ( 
                         
                           x 
                           , 
                           y 
                         
                         ) 
                       
                     
                      
                     cos 
                      
                     
                       
                         
                           π 
                            
                           
                             ( 
                             
                               
                                 2 
                                  
                                 x 
                               
                               + 
                               1 
                             
                             ) 
                           
                         
                          
                         u 
                       
                       16 
                     
                      
                     
                         
                     
                      
                     cos 
                      
                     
                         
                     
                      
                     
                       
                         
                           π 
                            
                           
                             ( 
                             
                               
                                 2 
                                  
                                 y 
                               
                               - 
                               1 
                             
                             ) 
                           
                         
                          
                         v 
                       
                       16 
                     
                   
                 
               
             
           
         
       
     
         [0000]    wherein: 
         [0006]    u, v, x, y=0, 1, 2 . . . 7; 
         [0007]    (x, y) represents the coordinate of a point within a block before the DCT, where (0,0) is the coordinate of the pixel on the top left corner of a block; f(x, y) is the value of the pixel at the coordinate (x, y) before the DCT; (u, v) is the coordinate of the pixel after the DCT; F(u, v) is the value of the pixel at the coordinate (u, v) after the DCT. 
         [0008]    as U, V=0, C(u), C(v)=1/sqrt(2), where sqrt means the square root calculation. 
         [0009]    Step 3 is to perform quantization. The input of this step is the data block after the DCT and a designated quantization matrix. All elements in the quantization matrix are non-zero positive integrals. Assuming that the quantization matrix is Q(x, y), the quantization is conducted according to the following equation: 
         [0000]        F ( x, y )=[ F ( x, y )/ Q ( x, y )+0.5] 
         [0000]    where x, y=0, 1, 2 . . . 7, [ ] means the result would be round off to an integral, and adding 0.5 is to help with the rounding off. 
         [0010]    Step 4 is to perform one dimensional prediction of a direct current (DC) coefficient. F (0, 0) is called as a DC coefficient and the other elements are known as Alternating Current (AC) coefficients. To process the DC coefficient, assuming P is the DC coefficient of a preceding image block, which is also the prediction value of the current DC coefficient, the equation for prediction is shown as below:
       F(0, 0)=F(0, 0)−P; //the value of DC coefficient after prediction       
 
         [0012]    The predicted value of the DC coefficient for the next image block becomes:
       P=P+F (0, 0); //the value of DC coefficient predicted for the next image block.       
 
         [0014]    Step 5 is to perform DC Entropy coding. The input of this step is the DC coefficient in the matrix which is the output of step 4. The black element on the top left corner of  FIG. 2  represents the DC coefficient. 
         [0015]    Step 6 is to perform an AC Entropy coding, the input of which are the AC coefficients in the outputting matrix of step 4, wherein AC coefficients are arranged in “zigzag” order and a run-length encoding algorithm for entropy coding is employed, referring to  FIG. 2 . Besides the black element on the top left corner of the data block, the rest of elements in  FIG. 2  are AC coefficients. The bending line indicates AC coefficients being encoded in a zigzag manner.  FIG. 3  is flow chart for showing the AC coefficient entropy run length coding process. 
         [0016]    Decompression based on the IDCT, which is the reverse of the compression, is described below. 
         [0017]    Step 1 is to perform DC coefficient entropy decoding. 
         [0018]    Step 2 is to perform AC coefficients entropy decoding. 
         [0019]    Step 3 is to perform one dimensional inverse prediction of the DC coefficient according to the following equation: 
         [0000]        P=F (0, 0)= F (0,0)+ P.    
         [0020]    Step 4 is to perform the inverse quantization process according to the following equation: 
         [0000]        F ( x, y )= F ( x, y )  Q ( x, y ). 
         [0021]    Step 5 is to perform the IDCT according to the following equation: 
         [0000]    
       
         
           
             
               f 
                
               
                 ( 
                 
                   x 
                   , 
                   y 
                 
                 ) 
               
             
             = 
             
               
                 1 
                 4 
               
                
               
                 ∑ 
                 
                   ∑ 
                   
                     C 
                      
                     
                       ( 
                       u 
                       ) 
                     
                      
                     
                       C 
                        
                       
                         ( 
                         v 
                         ) 
                       
                     
                      
                     
                       F 
                        
                       
                         ( 
                         
                           u 
                           , 
                           v 
                         
                         ) 
                       
                     
                      
                     cos 
                      
                     
                       
                         
                           π 
                            
                           
                             ( 
                             
                               
                                 2 
                                  
                                 x 
                               
                               + 
                               1 
                             
                             ) 
                           
                         
                          
                         u 
                       
                       16 
                     
                      
                     
                         
                     
                      
                     cos 
                      
                     
                         
                     
                      
                     
                       
                         
                           
                             π 
                              
                             
                               ( 
                               
                                 
                                   2 
                                    
                                   y 
                                 
                                 + 
                                 1 
                               
                               ) 
                             
                           
                            
                           v 
                         
                         16 
                       
                       . 
                     
                   
                 
               
             
           
         
       
     
         [0022]    Step 6 is a post-processing step, which is a reverse of the pre-processing. 
         [0023]      FIG. 1  shows a flowchart of JPEG compression/decompression process based on the DCT and the IDCT. Details of JPEG is disclosed by the International Telegraph and Telephone Consultative Committee (CCITT) in the document with reference number CCITT Rec.T.81(1992E) with the title “Information Technology-Digital Compression and Coding of Continuous-Tone Still Images-Requirement and Guideline”. 
         [0024]    Currently, the JPEG compression process based on the DCT is able to provide an acceptable compression rate. Moreover, when a compressed image is decompressed, the difference between the original image and the decompressed one is hard to be detectable visually. But, its processing speed is not good. It is obvious from the equations for the DCT and the IDCT that a heavy load of calculation is required. Although a lot of accelerated processes are proposed to reduce the work load of calculation, those known accelerated processes cannot be applied to process those images with high resolution. And, the processing speed is still one major obstacle for JPEG applications. 
       SUMMARY OF THE INVENTION 
       [0025]    In order to overcome the shortcomings in the prior art, the objective of present invention is to increase the processing speed of JPEG compression/decompression process based on the DCT and the IDCT without impacting the quality of the image. 
         [0026]    To achieve above mentioned objective, one aspect of present invention is to provide a process for image data compression, comprising the following steps: 
         [0027]    step 1 is to pre-process an input image, comprising splitting an original image data into a plurality of image data blocks, standardizing pixels of the image, and performing a color space transformation; 
         [0028]    step 2 is to determine whether a given data block satisfies a requirement for an accelerated compression, wherein, if yes, step 3 is carried out, otherwise step 4 is carried out; and wherein the requirement is satisfied when all pixel values in one image block are equal; 
         [0029]    step 3 is to perform a simplified DCT on the image data block and go to step 5; 
         [0030]    step 4 is to perform a DCT on the image data block; 
         [0031]    step 5 is to quantify a resulting data block after its DCT; 
         [0032]    step 6 is to perform one dimensional prediction on a DC coefficient of the data block; 
         [0033]    step 7 is to perform DC entropy coding on the DC coefficient of the data block; and 
         [0034]    step 8 is to perform AC entropy coding on AC coefficients of the data block, and end the process. 
         [0035]    Further, to improve the compression process, the determination of the above step 2 could be further improved by combing a number of image data into a “unit” for comparison, rather than one image datum at one time. 
         [0036]    Further, if the requirement is satisfied, the DCT and the quantization are merged to form a simple DCT-quantization process, the DC entropy coding and the AC entropy coding are merged to form a simple entropy coding process, a preferred workflow for accelerated compression is listed below: 
         [0037]    step 1 is to pre-process the inputted image; 
         [0038]    step 2 is to determine whether the given data block satisfies the requirement, if yes, step 8 is carried out, otherwise step 4 is carried out, wherein the requirement is satisfied when all pixel values in an image block are equal; 
         [0039]    step 3 is to perform the DCT on the image data block; 
         [0040]    step 4 is to quantify the resulting data block after its DCT; 
         [0041]    step 5 is to perform one dimensional prediction on the DC coefficient of the data block; 
         [0042]    step 6 is to perform the DC entropy coding on the DC coefficient of the data block; 
         [0043]    step 7 is to perform the AC entropy coding on the AC coefficients of the data block; 
         [0044]    step 8 is to perform the simplified DCT-quantization process; 
         [0045]    step 9 is to perform one dimensional prediction on the DC coefficient of the data block; and 
         [0046]    step 10 is to perform the simple entropy coding, and end the process. 
         [0047]    The present invention also provides a process for image data decompression, comprising the following steps: 
         [0048]    step 1 is to input a compressed image data block, performing a DC coefficient entropy decoding on the image data block; 
         [0049]    step 2 is to perform a AC coefficients entropy decoding; 
         [0050]    step 3 is to perform one dimensional inverse prediction on a DC coefficient of the image data block; 
         [0051]    step 4 is to perform a inverse quantization on a quantified image data block; 
         [0052]    step 5 is to determine whether a given image data block satisfies a first requirement of an accelerated decoding process, if yes, step 6 is carried out, otherwise, 
         [0053]    step 7 is carried out, wherein the first requirement is that all the AC coefficients in the given image data block equals to zero; 
         [0054]    step 6 is to perform a simplified DCT, then step 8 is carried out; 
         [0055]    step 7 is to perform a DCT; and 
         [0056]    step 8 is to post-process the image data and output image data that have been decompressed. 
         [0057]    Further, to improve the decompression process, the step 5 in the decompression process is farther improved by combining a number of image data into a “unit”, and performing a comparison in view of the unit, rather than one datum by one datum. 
         [0058]    Still further, when the image data is decompressed, a start point of the accelerated process is forwarded, and wherein if a second requirement for the accelerated decompression is satisfied, the AC entropy decoding process is omitted, and the inverse quantization and DCT process both are simplified, wherein a preferred workflow for the accelerated decompression is listed below: 
         [0059]    step 1 is to perform DC entropy decoding on the DC coefficients in the image data block. 
         [0060]    step 2 is to determine whether the image data block satisfies a second requirement for the accelerated decompression process, if yes, step 7 is carried out, otherwise step 3 is carried out, wherein the second requirement is that a first coded AC coefficient is an end code such as End of Block; 
         [0061]    step 3 is to perform the entropy decoding on the AC coefficients in the image data block; 
         [0062]    step 4 is to perform one dimensional inverse prediction on the DC coefficient in the image data block; 
         [0063]    step 5 is to perform the inverse quantization; 
         [0064]    step 6 is to perform an IDCT, and go to step 9 after the IDCT is completed; 
         [0065]    step 7 is to perform one dimensional inverse prediction on the DC coefficient in the image data block; 
         [0066]    step 8 is to perform a simple IDCT-inverse quantization process; and 
         [0067]    step 9 is to post-process the image data and output a decompressed image data. 
         [0068]    The present invention could accelerate the processing speed of JPEG compression/decompression based on the DCT and the IDCT, without impacting the quality of an image and without increasing the time length for the process. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWING 
         [0069]      FIG. 1  is a flow chart for a typical JPEG compression/decompression process based on the DCT and the IDCT; 
           [0070]      FIG. 2  is a layout view for the zigzag AC coefficients; 
           [0071]      FIG. 3  is a flow chart for AC coefficients entropy run length coding; 
           [0072]      FIG. 4  is a work chart of an accelerated JPEG compression/decompression process; and 
           [0073]      FIG. 5  shows a flow chart of a preferable accelerated JPEG compression/decompression process. 
       
    
    
     DETAILED DESCRIPTION 
       [0074]    The invention will be now described herein with reference to embodiments and drawings. 
         [0075]      FIGS. 4 and 5  show a basic accelerated JPEG compression process based on the DCT. 
         [0076]    Specifically, step 1 is to pre-process an input image, including splitting the input image data into a plurality of image data blocks, standardizing values of pixels of the image, and conducting a color space transformation. 
         [0077]    Step 2 is to determine whether a given image block satisfies with the requirement for accelerated compression. If yes, the procedure goes to step 3, otherwise, goes to step 4. The input of this step is a plurality of 8×8 image data blocks. And, all the values of pixels have been standardized, The mentioned requirement is that all the values of pixels in one image block are equal. JPEG can process both 8 bits and 12 bits of pixel depths according to the following pseudo-codes: 
         [0000]    
       
         
               
               
             
               
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 For 8 bits pixel depth: 
               
               
                   
                 for (int n=1; n&lt;64; n++) 
               
             
          
           
               
                   
                 if(f[0]!=f[n]) 
                 return false; 
               
             
          
           
               
                   
                 return true; 
               
               
                   
                   
               
             
          
         
       
     
         [0078]    In the worst case, the above needs 63 comparisons. 
         [0079]    For 12 bits pixel depth: 
         [0000]                                                                    int tmp=read_bit(f,12); // read 12 bits from the data stream           for (int n=1; n&lt;64; n++)                if (read(f,12)!=tmp)   return false;                return true;                        
wherein f represents a data stream. The worst case for the above operation is to perform 64 iterations and 63 comparisons. The return value “true” means the satisfaction of the requirement, while the return value “false” means the dissatisfaction of the requirement.
 
         [0080]    Step 3 is to perform a simplified DCT and proceed to step 5 after completing the transformation. 
         [0081]    An equation for performing a simplified DCT is listed below: assuming f(x, y) is a matrix before the DCT, F(x, y) is a matrix after the IDCT, where x, y=0, 1, 2 . . . 7, 
         [0000]      For  x, y= 0 , F ( x, y )= f (0, 0)×8; 
         [0000]      For x!=0 or y!=0, F(x, y)=0. 
         [0082]    Step 4 is to perform the DCT as mentioned in the Background. 
         [0083]    Step 5 is to perform the quantization process as mentioned in the BACKGROUND 
         [0084]    Step 6 is to perform one dimensional prediction on a DC coefficient as mentioned in the Background. 
         [0085]    Step 7 is to perform the DC coefficient entropy coding as mentioned in the Background. 
         [0086]    Step 8 is to perform AC coefficients entropy coding as mentioned in the Background. 
         [0087]    Above process is shown in  FIG. 4 . 
         [0088]    To achieve a better result than the prior art, step 2 of the present embodiment further comprises a step of combining a number of data to form a large “unit” and perform comparison in view of the unit, rather than performing the comparison one datum by one datum. 
         [0089]    In view of the requirement of accelerated compression process of step 2, the following pseudo-code provides a quicker determination than the basic process: 
         [0000]    
       
         
               
               
             
               
             
               
               
             
               
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 unsigned int*p = (unsigned int*)f; 
               
               
                   
                 unsigned int temp = circle_left_shift(p[0],8); // circle to the left by 
               
             
          
           
               
                 shifting 8 bits (of course, it would work as well if shifting to the right by 
               
               
                 8 bits); 
               
             
          
           
               
                   
                 for ( int n = 0; n&lt;64/sizeof(int); n++) 
               
             
          
           
               
                   
                 if(temp ! = p[n]) 
                 return false 
               
             
          
           
               
                   
                 return true; 
               
               
                   
                   
               
             
          
         
       
     
         [0090]    It is provable that the above is equivalent to step 2 of the basic accelerated compression process. For the majority of 32-bit CPU currently in use, even in the worst scenario, it only needs one circle shift operation and 16 comparisons. At the worst case, the time-consumption of the above is ¼ of that of step 2 of the basic process. To those CUPs with 64 or 128 bits of registers (i.e. Intel CUP with MMX), the time-consumption of the above would only be ⅛ or 1/16 in comparing with step 2 of the basic process. 
         [0091]    In the condition of satisfaction of the requirement of accelerated compression, the optimization is not limited to the DCT. The step of performing the quantization and the step of performing entropy coding may be also optimized, too. A preferred accelerated compression process is shown as below: 
         [0092]    step 1 is to pre-process, which is conducted identically to the step of pre-processing in the background portion; 
         [0093]    step 2 is to determine whether a given image data block satisfies with a requirement of the accelerated compression. If yes, the procedure goes to step 8, otherwise to step 3; wherein the said requirement of accelerated compression is the same as the requirement mentioned in step 2 of the basic process. The determination of satisfaction of the requirement could be done according to the above step 2 as well as the improved step 2; 
         [0094]    step 3 is to perform the DCT as mentioned in the background portion; 
         [0095]    step 4 is to perform the quantization process as mentioned in the background portion; 
         [0096]    step 5 is to perform one dimensional prediction one DC coefficient as mentioned in the background portion; 
         [0097]    step 6 is to perform DC coefficient entropy coding as mentioned in the background portion; 
         [0098]    step 7 is to perform AC coefficients entropy coding as mentioned in the background portion; 
         [0099]    step 8 is to perform a simplified DCT-quantization process, wherein
       assuming F is a matrix before the process, f represents a matrix after the transformation, Q is a quantization matrix       
 
         [0000]        F (0, 0)= f (0, 0)*(8 /Q (0, 0));       since (8/Q(0, 0) is actually a constant, this step conducts once only;         
         [0102]    step 9 is to perform one dimensional prediction on the DC coefficient as mentioned in the background portion; and 
         [0103]    step 10 is to simplify the entropy coding and ending the procedure, wherein the entropy coding only needs to perform twice as below: 
         [0000]    
       
         
               
               
               
             
               
             
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 DC_code (F(0, 0)); 
                 //DC entropy coding for DC coefficient after 
               
             
          
           
               
                 prediction 
               
             
          
           
               
                   
                 AC_code(EOB); 
                 //code word for ending the encoding. 
               
               
                   
                   
               
             
          
         
       
     
         [0104]      FIG. 5  shows the compression process in detail. It is noted that there are dash lines in  FIG. 5 , which represents that the above procedure could return to the process as mentioned in the background portion at any appropriate time. This is regarded as a variation of the accelerated compression process of the present invention. 
         [0105]    For the JPEG decompression process based on the IDCT, a basic accelerated decompression process is given as follows: 
         [0106]    step 1 is to perform a DC coefficient decoding as mentioned in the background; 
         [0107]    step 2 is to perform AC coefficients decoding as mentioned in the background; 
         [0108]    step 3 is to perform one dimensional DC coefficient inverse prediction as mentioned in the background; 
         [0109]    step 4 is to perform the inverse quantization as mentioned in the background; 
         [0110]    step 5 is to determine whether a given image block satisfies with the first requirement of accelerated decompression. If yes, the procedure goes to step 6, otherwise to step 7; wherein the input of this step is a data block of 64 bits including AC and DC coefficients; the first requirement is that all AC coefficients in the input data block equals to zero. The following is the pseudo-code that determines whether the first requirement of accelerated decompression is satisfied. Assuming that F is the inputted data block, 
         [0000]    
       
         
               
               
             
               
               
             
               
               
               
             
               
               
               
             
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 for ( int n =1 ; n&lt;64; n++) 
               
             
          
           
               
                   
                 if(F[0]!=0) 
               
             
          
           
               
                   
                 return false; 
                 //the requirement is not satisfied 
               
             
          
           
               
                   
                 return true 
                 //the requirement is satisfied 
               
             
          
           
               
                   
                 in the worst case, 63 iterations in above pseudo-code are needed; 
               
               
                   
                   
               
             
          
         
       
     
         [0111]    step 6 is to perform a simplified the IDCT and then proceeding to step 8, wherein the performing is conducted according to an equation as follows: assume F(x, y) represents a matrix before the IDCT, and f(x, y) represents a matrix after the IDCT, where x, y=0, 1, 2 . . . 7, 
         [0000]        f ( x, y )= F (0, 0)/8, for x, y=0, 1, 2 . . . 7; 
         [0112]    step 7 is to perform the IDCT as mentioned in the background; and 
         [0113]    step 8 is to perform the post-processing as mentioned in the background. 
         [0114]    The detailed process is shown in  FIG. 4 . 
         [0115]    In order to achieve a better result than the prior art, step 5 of the present embodiment could be improved by further comprising a step of combining a number of data to form a lager “unit” and perform the comparison thereof, rather than performing the comparison one datum by one datum. 
         [0116]    In view of step 5 of the present embodiment (the first requirement of accelerated decompression process), the following pseudo-code provides a quicker determination than the basic process: 
         [0000]    
       
         
               
               
               
             
               
               
             
               
               
             
               
               
             
               
               
             
               
               
               
             
               
               
             
               
               
             
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 unsigned int temp = F[0]; 
                 // storing DC coefficient 
               
               
                   
                 F[0]=0; 
                 //clearing DC coefficient 
               
             
          
           
               
                   
                 unsigned int*p = (unsigned int*)(&amp;F(0, 0)); 
               
               
                   
                 for (int n=0, n&lt;64*sizeof(short)/sizeof(int); n++) 
               
             
          
           
               
                   
                 if(p[n]!=0) 
               
             
          
           
               
                   
                 { 
               
             
          
           
               
                   
                 F[0]=temp; 
               
             
          
           
               
                   
                 Return false; 
                 //the requirement is not satisfied 
               
             
          
           
               
                   
                 } 
               
             
          
           
               
                   
                 F[0] = temp; 
               
             
          
           
               
                   
                 Return true; 
                 //the requirement is satisfied 
               
               
                   
                   
               
             
          
         
       
     
         [0117]    It is provable that the above is equivalent to step 5 of the basic accelerated compression process. For the majority of 32-bit CPUs currently in use, even in the worst case, the time-consumption of the above is ½ of that of the counterpart of the basic process. To CPUs with 64 or 128 bits registers (i.e. Intel CUP with MMX), the time-consumption would be ¼ or ⅛ in comparing with the step 5 of the basic process. 
         [0118]    Although step 5 of the basic accelerated decompression process is optimized already according to the invention, the other steps of the basic process may be optimized, too, in a condition of satisfaction of the second requirement of accelerated decompression. 
         [0119]    A preferable accelerated decompression process is shown as follows: 
         [0120]    step 1 is to perform DC coefficient entropy decoding as mentioned in the background; 
         [0121]    step 2 is to determine whether a given image data block satisfies with the second requirement of accelerated decompression, and if yes, the procedure goes to step 7, otherwise, goes to step 3; wherein the second requirement is that the first AC coefficients entropy coding is the flag of end of the block with the following pseudo-code: 
         [0000]    
       
         
               
               
               
             
               
               
               
             
           
               
                   
                   
               
             
             
               
                   
                 R = DECODE ( ); 
                 //decoding the first encoded AC coefficient 
               
               
                   
                 if( R == EOB) 
                 //checking if it is the flag of end of the block 
               
             
          
           
               
                   
                 return true; 
                 // the requirement is satisfied 
               
               
                   
                 return false; 
                 // the requirement is not satisfied 
               
               
                   
                   
               
             
          
         
       
     
         [0122]    it is noted that, when the second requirement is satisfied, the AC coefficients entropy decoding will be omitted; 
         [0123]    step 3 is to perform AC coefficients entropy decoding as mentioned in the background; 
         [0124]    step 4 is to perform one dimensional inverse DC coefficient prediction as mentioned in the background; 
         [0125]    step 5 is to perform the inverse quantization as mentioned in the background; 
         [0126]    step 6 is to perform the IDCT and then proceed to step 9 as mentioned in the background; 
         [0127]    step 7 is to perform one dimensional DC coefficient inverse prediction as mentioned in the background; 
         [0128]    step 8 is to perform a simplified the IDCT-quantization process, wherein, assuming that F represents a matrix before the transformation, f represents a matrix after the transformation, and Q represents a quantization matrix, 
         [0000]        F ( x, y )= F (0, 0)*( Q (0, 0)/8), for x, y 0, 1, 2 . . . 7.       Note Q(0, 0) is a constant; and         
         [0130]    step 9 is to perform the post-processing as mentioned in the background. 
         [0131]    Please refer to the decompression section of  FIG. 5  for details. It is noted that dash lines occur in  FIG. 5 , which represents that the procedure could return to the process as mentioned in the background at an appropriate timing. It is regarded as a variation of the accelerated decompression process of the present invention.