# Patent

## Title
Pixel data generating method

## Abstract

A method of generating pixel data of a missing block in an image frame is disclosed. Edge points are detected from neighboring image side adjacent to the missing block. A direction is calculated for each edge point. Edge lines are formed from edge points based on the direction thereof to partition the missing block into a plurality of missing regions. Data for missing pixels in each missing region are then calculated using reference pixels from neighboring image sides adjacent to the missing region.

## Background
BACKGROUND
The invention is related to an image processing method, and more particularly, to methods generating pixel data for a missing block in an image frame.
FIG. 1 shows a conventional method of generating a missing block pixel matrix 12 in an image frame 10. The surrounding reference pixels 111, 112, 113 and 114 could easily acquired for a missing pixel 121 of the missing block pixel matrix 12. These reference pixels 111, 112, 113 and 114 can be generated by finding pixels with matching vertical or horizontal position, on the neighboring image boundary 11 adjacent to missing block 12. A reference pixel contributes the recovery of missing data depending on distance from the missing pixel. Combining contributions from all reference pixels regenerates a missing pixel data. The missing block is a linear color gradient filling of the neighboring image boundary, vertically and horizontally.
For images with non-vertical or non-horizontal patterns, the conventional method cannot efficiently regenerate missing block data with satisfaction. FIG. 2A shows an image before a block is lost. FIG. 2B shows a resulting image generated by the conventional method from the image of FIG. 2A. The patterns of the image are cut vertically and horizontally. It is necessary to have a method that can regenerate patterns of images.
SUMMARY
A method of generating pixel data of a missing block in an image frame is disclosed. Edge points are detected from neighboring image sides adjacent to the missing block. A direction is calculated for each edge point. Edge lines are formed from edge points based on the direction thereof to partition the missing block into a plurality of missing regions. Data for missing pixels in each missing region are then calculated using reference pixels from neighboring image sides that adjacent to the missing region.



DESCRIPTION OF THE DRAWINGS
The accompanying drawings incorporated in and constitute a part of this specification, illustrate embodiments of the invention and, together with the description, serve to explain the features, advantages, and principles of the invention.
FIG. 1 shows a conventional method of generating a missing block pixel matrix 12 in an image frame 10.
FIG. 2A shows an image before a block is lost.
FIG. 2B shows a resulting image generated by the conventional method from the image of FIG. 2A.
FIG. 3A is a flow chart of a method according to an embodiment of the invention.
FIG. 3B ̃3H illustrate the method shown in FIG. 3A.



DETAILED DESCRIPTION
Patterns in images are distinguished by color change. Edges are formed between colors, and outline the patterns. By detecting edges from neighboring images of a missing block and extending edges into the missing block, patterns of an image can be rebuilt.
FIG. 3A is a flow chart of a method according to an embodiment of the invention. First, edge points are detected from the neighboring image sides adjacent to the missing block (Step S1). Second, a direction is calculated for each edge point (Step S2). Third, edge lines are formed from edge points based on the direction thereof to partition the missing block into a plurality of missing regions (Step S3). Data of missing pixels in each missing region is then calculated using reference pixels from neighboring image sides adjacent to the missing region (Step S4).
FIG. 3B shows an image 30 with missing block 31. Edge points are detected from the neighboring image side adjacent to the missing block according to Step S1 of FIG. 3A. FIG. 3C illustrates steps of edge point detection from side 310 of FIG. 3B. Illustration 310A shows edge points 3101, 3102, 3103 and 3104 detected from side 310, when the adjacent pixel difference exceeds maximum of 2*MAD (mean absolute difference) and QP/2 such as;




  
    
    
      
        x
        i
      
      -
      
        x
        
          i
          -
          1
        
      
    
    
  
  >
  
    max
    ⁡
    
      (
      
        
          
            2
            N
          
          ·
          
            
              ∑
              
                k
                =
                1
              
              N
            
            ⁢
            
              
              
                
                  x
                  i
                
                -
                
                  x
                  
                    i
                    -
                    1
                  
                
              
              
            
          
        
        ,
        
          QP
          2
        
      
      )
    
  




Wherein Xi is pixel data and QP is a quantization parameter associated with the image frame.
In general, multiple edge points are detected around a true edge except sharp step edges, such as edge points 3102, 3103 and 3104 detected for just one real edge. In order to determine a true single edge point, edge thinning is performed such that one edge point with maximum edge magnitude is chosen. Illustration 310B shows edge point 3103 chosen to represent a real edge point.
FIG. 3D shows a k*k pixel matrix 33, where k is odd number between 1 and 16, and k is chosen as 5 in this embodiment, containing the edge point 3101 chosen for direction calculation according to step 2 of FIG. 3A. 3*3 Sobel Filter is chosen in this embodiment to calculate the direction of the edge point. Calculating row and column gradients, GR(n) and GC(n), of the k*k pixel matrix using 3*3 Sobel Filter results (k−2)*(k−2) set of GR(n) and GC(n). Edge angles and magnitudes can then be calculated from the GR(n) & GC(n). For example, an edge angle can be calculated as




  
    
      tan
      
        -
        1
      
    
    ⁡
    
      (
      
        
          
            G
            R
          
          ⁡
          
            (
            n
            )
          
        
        
          
            G
            C
          
          ⁡
          
            (
            n
            )
          
        
      
      )
    
  
  ,




and an edge magnitude can be calculated as √{square root over ((GR(n))2+(GC(n))2)}{square root over ((GR(n))2+(GC(n))2)}. An edge angle is increased by π when the edge angle is lower than zero, making the edge angle positive. An average edge angle and magnitude of k*k pixel matrix are then calculated as the direction of the edge point. A set of edge angle and magnitude is discarded from calculating the average edge angle and magnitude when the edge magnitude is less than 2*MAD. Adaptive size of pixel matrix can provide more accurate edge direction property for the context adaptive edge points.

An image with complicated information contains many small color patterns. Edge points may be found for small patterns on the sides of the missing block. Connecting edge points of small patterns with compatible direction of edges but different colors may crumble the missing block image. An edge point with statistic lower than a statistic threshold, which is 30% in this embodiment, then can be discarded. The statistic is calculated by: quantizing the (k−2)*(k−2) edge angles and the average angle of k*k pixel matrix with a quantizing parameter π/32, accumulating edge magnitudes with corresponding quantized edge angle equals to the quantized average edge angle, and dividing the accumulated edge magnitudes by sum of all edge magnitudes. An edge magnitude lower than MAD will be discarded from statistic calculation. Low statistic of an edge point means the neighboring image has low edge angel consistency and should not be connected to other side of the missing block.
A method of forming edge lines from edge points based on the direction thereof to partition the missing block into a plurality of missing regions according to step S3 of FIG. 3A is described here. A linked edge line is defined for each pair of edge points with compatible directions, and an isolated edge line is defined from each unpaired edge point into the missing block along the direction of the unpaired edge point ending on a linked edge line.
A pair of edge points with compatible directions is chosen based on edge angles and magnitudes. All directions of edge points are normalized by dividing edge angles by Π and dividing edge magnitudes by a maximum storable value, such as 256 for an 8-bit image data system. Selecting edge point pairs with a normalized edge magnitude difference lower than 4*QP/N2 and normalized edge angle difference lower than Π/8 forms a linked edge line. Thresholds like 4*QP/N2 or Π/8 can be defined as other values to adapt to different image process requirements.
FIG. 3E shows a linked edge line formed by connecting edge point A and B according to an embodiment of the invention. The linked edge line has a slope S and the edge points A and B have directions DA and DB respectively. The linked edge line is formed due to DA and DB compatibility. However, if angle difference of slope S to DA or DB is significant, inconsistent data is generated in the missing block. An angle difference of slope S to DA and DB is calculated. If the angle difference exceeds a threshold 0.125*Π, the linked edge line is discarded and both edge points are deemed unpaired.
FIG. 3F shows detected edge points and formed edge lines for missing region 31 in image 30 of FIG. 3B according to an embodiment of the invention. Edge point pairs (3101, 3131) and (3103, 3122) form linked lines 1 and 2 respectively, and unpaired edge points 3111 and 3121 form the isolated edge lines 4 and 3 respectively. By treating the horizontal position as x and the vertical position as y and setting one corner of the missing block as (0, 0), a ax+by+c=0 function can represent each edge line.
FIG. 3G shows a binary tree structure representing edge lines and edge regions of the missing block 31 of FIG. 3F. Nodes 1, 2, 3 and 4 are created to represent edge lines 1, 2, 3 and 4. Each node has a first branch to link a node in the positive region of the edge line (ax+by+c≧0) and a second branch to link a node in the negative region of the edge line (ax+by+c≦0). Linked nodes are connected first then isolated nodes. Unconnected branches A, B, C, D and E on the binary tree structure represent missing regions A, B, C, D and E, respectively.
A linked node of edge points with minimum of √{square root over ((Pi-Pj)2+ ω{square root over ((Pi-Pj)2+ ωθ·(θi-θj)2)} can be chosen as a starting node of the binary tree structure; wherein Pi and Pj are normalized edge magnitudes of 2 edge points and θi and θj are normalized edge angles of the 2 edge points, and ωθ is a predetermined weight coefficient. ωθ=2 is chosen to favor the edge angle contribution in this embodiment.
FIG. 3H shows a method of locating reference pixels from neighboring image sides adjacent to the missing region H for missing pixel 340, according to step S4 of FIG. 3A. Missing pixel 340 is located in the missing region associated to linked edge line 341 and isolated edge line 342. Virtual line functions are generated past missing pixel 340 with slopes the same as line 342 and 341, such as dashed lines 344 and 343 connecting neighboring image sides in pixels 3401, 3402, 3403 and 3404. Pixels 3401 and 3403 are discarded not being adjacent to the missing region H. Pixels 3402 and 3403 are then chosen as reference pixels. All missing pixels have different numbers of reference pixels on 4 sides.
Data of a missing pixel is then calculated as the sum of the contributions of each reference pixel, wherein the contribution of each reference pixel being the pixel data times a weight coefficient. Missing pixel data {circumflex over (x)}j can be calculated as:




  
    
      
        x
        ^
      
      j
    
    =
    
      
        ∑
        
          i
          =
          1
        
        
          N
          j
        
      
      ⁢
      
        
          a
          i
        
        ⁢
        
          y
          i
        
      
    
  
  ,
  
    

  
  ⁢
  
    
      a
      i
    
    =
    
      
        1
        /
        
          d
          i
        
      
      
        ∑
        
          1
          /
          
            d
            k
          
        
      
    
  




Wherein ai is a weight coefficient equaling a normalized distance between the missing pixel and reference pixels.
The invention discloses methods of generating pixel data for a missing block in an image frame, providing smoothness and consistency applicable in macro-block lost error concealment in video communication or image manipulation. An unwanted block in an image can be deleted, and then regenerated using data from the neighborhood image by methods according to the invention.
While the invention has been described by way of example and in terms of preferred embodiment, it is to be understood that the invention is not limited thereto. Those skilled in this technology can still make various alterations and modifications without departing from the scope and spirit of this invention. Therefore, the scope of the present invention shall be defined and protected by the following claims and their equivalents.

## Claims

1. A method of generating pixel data of a missing block in an image frame, comprising:
detecting edge points from neighboring image sides adjacent to the missing block;
calculating a direction of each edge point;
forming edge lines from edge points based on the directions thereof to partition the missing block into a plurality of missing regions, wherein the edge lines comprise a linked edge line defined by a pair of edge points with compatible directions and an isolated edge line defined by a direction of an unpaired edge point extending from the unpaired edge point into the missing block and ending on a linked edge line; and
calculating data of missing pixels in each missing region using reference pixels from neighboring image sides adjacent to the missing region;
wherein definition of a linked edge line for each pair of edge points with compatible directions comprises:
normalizing all directions of edge points by dividing edge angles and edge magnitudes by values normalizing of edge angles and edge magnitudes with minimum value 0 and maximum 1, wherein the edge angles and magnitudes representing directions of an edge points; and
selecting edge point pairs with Pi-Pj lower than an link magnitude threshold and θi-θj lower than an link angle threshold to form a linked edge line, where Pi and Pj are normalized edge magnitudes of 2 edge points and θi and θj are normalized edge angles of the 2 edge points.

2. The method as claimed in claim 1, wherein an edge point is detected when the adjacent pixel difference exceeds a threshold.

3. The method as claimed in claim 2, wherein the threshold is a maximum of 2*MAD (mean absolute difference) and QP/2, and QP is a quantization parameter associated with the image frame.

4. The method as claimed in claim 1, wherein an edge line is discarded when the angle difference between the slope of the edge line and the direction of associated edge points exceeds an angle threshold.

5. The method as claimed in claim 4, wherein the angle threshold is 0.125π.

6. The method as claimed in claim 1 wherein the link angle threshold is 4*QP/N2, and the link magnitude threshold is π/8, N is the number of the edge points, and QP is a quantization parameter associated with the image frame.

7. The method as claimed in claim 1 further comprising:
creating a linked node representing each linked edge line, and an isolated node for each isolated edge line; wherein each linked or isolated node has a first and second branch linking to a node in positive and negative region of the node respectively;
sequentially linking the linked nodes to form a binary tree structure; wherein a linked node in positive or negative region of a former lined node connected to the first or second branch of the former linked node respectively;
sequentially connecting the isolated nodes to the linked nodes; the isolated nodes ends on the same linked node connected sequentially thereto; wherein an isolated node in positive or negative region of a former node connected to the first or second branch of the former node respectively; and
assigning each unconnected branch to identify a missing region.

8. The method as claimed in claim 7 further comprising:
normalizing all directions of edge points by dividing edge angles by π and dividing edge magnitudes by a maximum storable value; wherein the edge angle and magnitude are vectors representing the direction of an edge point; and
choosing a linked node with a pair of edge points with minimum of √{square root over ((Pi-Pj)2+ ω{square root over ((Pi-Pj)2+ ωθ·(θi-θj)2)} as a starting node of the binary tree structure, wherein Pi, and Pj are normalized edge magnitudes of 2 edge points and θi and θj, are normalized edge angles of the 2 edge points, and ωθ is a predetermined weight coefficient.

9. The method as claimed in claim 8, wherein the weight coefficient ωθ=2.

10. The method as claimed in claim 1, wherein calculation of a direction of each edge point comprises:
choosing a k*k pixel matrix containing the edge point on one side, wherein k is a positive odd integer no less than 3;
calculating row and column gradients of the k*k pixel matrix using a 3*3 Sobel Filter;
calculating edge angles and magnitudes of the row and column gradients;
calculating an average edge angle and magnitude of all edge angles and magnitudes as a direction of the edge point.

11. The method as claimed in claim 10, wherein the edge angle equals tan−1(GR/GC), where GR is the row gradient and GC is the column gradient.

12. The method as claimed in claim 11, wherein an edge angle is increased by π when the edge angle is less than zero.

13. The method as claimed in claim 10, wherein the edge magnitude equals √{square root over ((GR)2+(GC)2)}{square root over ((GR)2+(GC)2)}, where GR is the row gradient and GC is the column gradient.

14. The method as claimed in claim 10, wherein a set of edge angle and magnitude is excluded from calculations of the average edge angle and magnitude, when the edge magnitude is less than 2*MAD.

15. The method as claimed in claim 10, further comprising steps of excluding edge point with statistic lower than a statistic threshold; the statistic calculated by:
quantizing the edge angles and the average angle with a quantizing parameter;
accumulating edge magnitudes with corresponding quantized angle the same as the quantized average edge angle; and
dividing the accumulated edge magnitudes by the sum of all edge magnitudes.

16. The method as claimed in claim 15, wherein the statistic threshold is 30%.

17. The method as claimed in claim 15, wherein an edge magnitude lower than MAD is excluded from statistic calculation.

18. The method as claimed in claim 15, wherein the quantizing parameter is π/32.

19. The method as claimed in claim 1, wherein reference pixels for each missing pixel are obtained from neighboring image sides adjacent to the missing region by generating virtual line functions, passing the missing pixel with the same slopes as the associated edge lines, and crossing the neighborhood image side at the reference pixels.

20. The method as claimed in claim 19, wherein data of each missing pixel is the sum of the contributions of each reference pixel.

21. The method as claimed in claim 20, wherein the contribution of each reference pixel is the data of the reference pixel times a weight coefficient.

22. The method as claimed in claim 21, wherein the weight coefficient is a reciprocal of the distance of a reference pixel to the missing pixel, divided by the sum of reciprocal of the distance of each reference pixel to the missing pixel.