BACKGROUND OF THE INVENTION 
   1. Field of the Invention 
   The present invention relates to an image interpolating method for interpolating an image. 
   2. Description of the Prior Art 
   Conventionally in cases such as a case where an interlace image is converted into a progressive image, a case where an image is enlarged, and a case where the resolution of an image is enhanced, various methods for interpolating an image have been proposed using pixel data on adjacent original pixels (corresponding to the amount of data representing luminance on a display). 
   Typical examples of an image interpolating method are a simple interpolating method and a linear interpolating method. The simple interpolating method is a method of giving pixel data on either one of pixels adjacent to a pixel to be interpolated on the upper and lower sides (or on the right and left sides) to the pixel to be interpolated as pixel data. The linear interpolating method is a method of giving the average of pixel data on pixels adjacent to a pixel to be interpolated on the upper and lower sides (or on the right and left sides) to the pixel to be interpolated as pixel data. 
   In the simple interpolating method, however, the pixel data on the pixel adjacent to the pixel to be interpolated is given as it is. When there is a diagonal edge portion in an image reproduced on a display or the like, therefore, backlash occurs in the edge portion. On the other hand, in the linear interpolating method, the average of the pixel data on the pixels adjacent to the pixel to be interpolated on the upper and lower sides (on the right and left sides) is given. Accordingly, the vicinity of the pixel to be interpolated is an edge portion. When the difference between the pixel data on the pixels adjacent to the pixel to be interpolated on the upper and lower sides (on the right and left sides) is large, the interpolated pixel takes an intermediate value, so that the edge portion is blurred. 
   Therefore, the applicants of the present invention already have developed an image interpolating method capable of preventing, in interpolating an image, backlash and blur from occurring in an edge portion of the image as well as capable of reproducing a smooth image. 
   Description is made of an image interpolating method already developed by the applicants of the present invention (hereinafter referred to as the conventional method). 
   A two-dimensional image has a two-dimensional expanse in the horizontal direction and the vertical direction. In order to simplify the description, however, description is made of a method of one-dimensional interpolation in the vertical direction. 
     FIG. 1  illustrates the relationship between original pixels and a pixel to be interpolated. 
   In  FIG. 1 , lines (n−1), n, (n+1), and (n+2) are horizontal lines in the original image, and lines (i−1), i, and (i+1) are horizontal lines to be interpolated. Description is herein made of a case where a pixel (hereinafter referred to as an interpolation pixel X) on the line i is interpolated. 
   In the following description, pixel data on original pixels D 01  to D 35  and the interpolation pixel X are respectively denoted by d 01  to d 35  and x. In this example, the pixel data shall be composed of eight bits, and black data and white data shall be respectively “0” and “255”. 
     FIG. 2  shows the procedure for finding the pixel data x on the interpolation pixel X by the conventional method. 
   First, an edge component E is calculated in order to judge whether or not the interpolation pixel X exists in the vicinity of an edge of an original image (step  1 ). That is, the edge component E is found from the following equation (1) using the pixel data on the two original pixels D 01  and D 13  just above the interpolation pixel X and the two original pixels D 23  and D 33  just below the interpolation pixel X:
 
 E=−d 03+ d 13+ d 23− d 33  (1)
 
   The edge component E takes a relatively large negative value when the interpolation pixel X exists in the vicinity of a black edge of the original image, while taking a relatively large positive value when the interpolation pixel X exists in the vicinity of a white edge of the original image. 
   A range S where the pixel data x on the interpolation pixel X is settable is then determined on the basis of the edge component E (step  2 ). 
   Description is made of a method of determining the settable range S on the basis of  FIGS. 3   a  and  3   b . In  FIGS. 3   a  and  3   b , d max  denotes the larger one of the pixel data d 13  and d 23  on the original pixels D 13  and D 23 , and d min  denotes the smaller one of the pixel data d 13  and d 23 . Further, dc denotes the average (d max +d min )/2 of d max  and d min . 
   (1) Range S Where Pixel Data x is Settable When E≧0 
   When E≧0, the range S where the pixel data x is settable shall be a range of d min ×α+dc×(1−α)≦S≦d max ×α+dc×(1−α)+E×γ, where α and γ are variables which can be controlled from the exterior. 
   That is, when the edge component E is not less than zero, the range S where the pixel data x is settable is a range expanded upward by the value of γ·E from a range [d min ×α+dc×(1−α)≦x≦d max ×α+dc×(1−α)] centered around dc. 
   In this case, it is presumed that the interpolation pixel X exists in the vicinity of the white edge of the original image, to set the settable range S to a range close to d max  in the range of d min  to d max.    
   (2) Range S Where Pixel Data x is Settable When E&lt;0 
   When E&lt;0, the range S where the pixel data x is settable shall be a range of d min ×α+dc×(1−α)+E×γ≦S≦d max ×α+dc×(1−α). 
   That is, when the edge component E is less than zero, the range S where the pixel data x is settable is a range expanded downward by the value of γ·E from a range [d min ×α+dc×(1−α)≦x≦d max ×α+dc×(1−α)] centered around dc. 
   In this case, it is presumed that the interpolation pixel X exists in the vicinity of the black edge of the original image, to set the settable range S to a range close to d min  in the range of d min  to d max . 
   Candidates for the pixel data x on the interpolation pixel X are then found from the range S where the pixel data x is settable on the basis of the pixel data on the opposed pixels between which the interpolation pixel X is sandwiched diagonally (step  3 ). 
   In finding the candidates for the pixel data x on the interpolation pixel X, a correlation value L 1  between the pixel data on the opposed pixels D 12  and D 24  and the pixel data x on the interpolation pixel X and a correlation value R 1  between the pixel data on the opposed pixels D 14  and D 22  and the pixel data x on the interpolation pixel X are employed. Therefore, methods of respectively calculating the correlation values L 1  and R 1  will be first described. 
   The correlation value L 1  between the pixel data on the opposed pixels D 12  and D 24  and the pixel data x on the interpolation pixel X is expressed by the following equation (2), and the correlation value R 1  between the pixel data on the opposed pixels D 14  and D 22  and the pixel data x on the interpolation pixel X is expressed by the following equation (3):
 
 L=|d 12− x|+|d 24− x|+β 1 ×Hl−β 2 ×Vl   (2)
 
 R=|d 14− x|+|d 22− x|+β 1 ×Hr−β 2 ×Vr   (3)
 
   In the foregoing equations (2) and (3), β1 and β2 are valuables which can be controlled from the exterior. In the foregoing equation (2), Hl denotes a horizontal correlation intensity, and is expressed by the following equation (4). Further, Vl denotes a vertical correlation intensity, and is expressed by the following equation (5).
 
 Hl =MAX(| d 11− d 12|+| d 12− d 13|, | d 23− d 24|+| d 24− d 25|)  (4)
 
 Vl =MIN(| d 02− d 12|+| d 12− d 22|, | d 14− d 24|+| d 24− d 34|)  (5)
 
   MAX (a, b) is a sign indicating that the larger one of a and b is selected. MIN (a, b) is a sign indicating that the smaller one of a and b is selected. 
   Hl denotes the larger one of a primary differential value (|d 11 −d 12 |+|d 12 −d 13 |) in the horizontal direction corresponding to the pixel D 12  and a primary differential value (|d 23 −d 24 |+|d 24 −d 25 |) in the horizontal direction corresponding to the pixel D 24 . Further, Vl denotes the smaller one of a primary differential value (|d 02 −d 12 |+|d 12 −d 22 |) in the vertical direction corresponding to the pixel D 12  and a primary differential value (|d 14 −d 24 |+|d 24 −d 34 |) in the vertical direction corresponding to the pixel D 24 . 
   In the foregoing equation (3), Hr denotes a horizontal correlation intensity, and is expressed by the following equation (6), and Vr denotes a vertical correlation intensity, and is expressed by the following equation (7):
 
 Hr =MAX(| d 13− d 14|+| d 14− d 15|, | d 21− d 22|+| d 22− d 23|)  (6)
 
 Vr =MIN(| d 04− d 14|+| d 14− d 24|, | d 12− d 22|+| d 22− d 32|)  (7)
 
   Hr denotes the larger one of a primary differential value (|d 13 −d 14 |+|d 14 −d 15 |) in the horizontal direction corresponding to the pixel D 14  and a primary differential value (|d 21 −d 22 |+|d 22 −d 23 |) in the horizontal direction corresponding to the pixel D 22 . Further, Vr denotes the smaller one of a primary differential value (|d 12 −d 22 |+|d 22 −d 32 |) in the vertical direction corresponding to the pixel D 22  and a primary differential value (|d 04 −d 14 |+ 51  d 14 −d 24 |) in the vertical direction corresponding to the pixel D 14 . 
   There are two methods of finding the candidates for the pixel data x on the interpolation pixel X. The methods will be described. 
   (1) Description of First Method 
   All the pixel data x in the settable range S are respectively substituted in the foregoing equation (2) expressing a correlation value L between the pixel data on the two opposed pixels D 12  and D 24  between which the interpolation pixel X is sandwiched diagonally (diagonally to the upper left) and the pixel data x on the interpolation pixel X, to find the minimum correlation value L min  and pixel data xl in a case where the minimum correlation value L min  is given. 
   Similarly, all the pixel data x in the settable range S are respectively substituted in the foregoing equation (3) expressing a correlation value R between the pixel data on the two opposed pixels D 14  and D 22  between which the interpolation pixel X is sandwiched diagonally (diagonally to the upper right) and the pixel data x on the interpolation pixel X, to find the minimum correlation value R min  and pixel data xr in a case where the minimum correlation value R min  is given. 
   The found pixel data xl and xr are thus candidates for the pixel data x on the interpolation pixel X. In such a way, however, a plurality of pixel data may, in some cases, be applicable as the pixel data xl in the case where the minimum correlation value L min  is given. Similarly, a plurality of pixel data may, in some cases, be applicable as the pixel data xr in the case where the minimum correlation value R min  is given. 
   When the plurality of pixel data are applicable as the pixel data xl in the case where the minimum correlation value L min  is given, the average of the pixel data may be determined as the pixel data xl in the case where the minimum correlation value L min  is given. Similarly, when the plurality of pixel data are applicable as the pixel data xr in the case where the minimum correlation value R min  is given, the average of the pixel data may be determined as the pixel data xr in the case where the minimum correlation value R min  is given. 
   (2) Description of Second Method 
     FIG. 4  illustrates the relationship between the correlation value L and the pixel data x. In  FIG. 4 , x min  denotes the smaller one of the pixel data d 12  and d 24 , and x max  denotes the larger one of the pixel data d 12  and d 24 . Further, xd=x max −x min +β1×Hl−β2×Vl. 
   If xd=x max −x min +β1×Hl−β2×Vl, the correlation value L in the foregoing equation (2) can be changed, as expressed by the following equation (8). The correlation value R can be also similarly changed. 
   
     
       
         
           
             
               
                 
                   
                     
                       L 
                       = 
                       
                         xd 
                         + 
                         
                           2 
                           ⁢ 
                           
                             ( 
                             
                               x 
                               - 
                               
                                 x 
                                 max 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       ( 
                       
                         x 
                         &gt; 
                         
                           x 
                           max 
                         
                       
                       ) 
                     
                   
                 
                 
                   
                     
                       L 
                       = 
                       xd 
                     
                   
                   
                     
                       ( 
                       
                         
                           x 
                           min 
                         
                         ≦ 
                         x 
                         ≦ 
                         
                           x 
                           
                             max 
                             ⁢ 
                             
                                 
                             
                           
                         
                       
                       ) 
                     
                   
                 
                 
                   
                     
                       L 
                       = 
                       
                         xd 
                         + 
                         
                           2 
                           ⁢ 
                           
                             ( 
                             
                               
                                 x 
                                 min 
                               
                               - 
                               x 
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       ( 
                       
                         x 
                         &lt; 
                         
                           x 
                           min 
                         
                       
                       ) 
                     
                   
                 
               
             
             
               
                 ( 
                 8 
                 ) 
               
             
           
         
       
     
   
   Description is now made of methods of respectively finding the minimum correlation values L min  and R min  and the pixel data xl and xr (the second method). Description is herein made of the method of finding the minimum correlation value L min  and the pixel data xl. 
     FIGS. 5   a  to  5   f  show graphs of the correlation value L against the pixel data x and a range where the pixel data x is settable. 
   In  FIGS. 5   a  to  5   f , xa denotes the minimum of the pixel data x in the settable range, and xb denotes the maximum of the pixel data x in the settable range. 
   {circle around (1)} In the case of xb≦x min    
   When the range where the pixel data x is settable is not more than x min , as shown in  FIG. 5   a , the correlation value L is the minimum in the pixel data xb. Consequently, the minimum correlation value L min  is xd+2(x min −xb). Further, the pixel data xl at this time is xb. 
   {circle around (2)} In the case of x max ≦xa 
   When the range where the pixel data x is settable is not less than x min , as shown in  FIG. 5   b , the correlation value L is the minimum in the pixel data xa. Consequently, the minimum correlation value L min  is xd+2 (xa−x max ). Further, the pixel data xl at this time is xa. 
   {circle around (3)} In the case of x min ≦xa and xb≦x max    
   When the range where the pixel data x is settable is from the pixel data x min  to x max , as shown in  FIG. 5   c , the correlation value L is the minimum xd in the arbitrary pixel data x in the settable range. Consequently, the minimum correlation value L min  is xd. In this case, a value (xa+xb)/2 at the center of the settable range is determined as the pixel data xl. 
   {circle around (4)} In the case of xa&lt;x min  and x max &lt;xb 
   When the range where the pixel data x is settable is a range wider than the range of the pixel data x min  to x max , as shown in  FIG. 5   d , the correlation value L is the minimum xd in the arbitrary pixel data x in the range of the pixel data x min  to x max . Consequently, the minimum correlation value L min  is xd. In this case, the average (x min +x max )/2 of the pixel data x min  and x max  is determined as the pixel data xl. 
   {circle around (5)} In the case of xa&lt;x min  and x min &lt;xb≦x max    
   When the range where the pixel data x is settable is shifted leftward from the range of the pixel data x min  to x max , as shown in  FIG. 5   e , the correlation value L is the minimum xd in the arbitrary pixel data x in the range of the pixel data x min  to xb. Consequently, the minimum correlation value L min  is xd. In this case, the average (x min +xb)/2 of the pixel data x min  and xb is determined as the pixel data xl. 
   {circle around (6)} In the case of x min ≦xa&lt;x max  and x max ≦xb 
   When the range where the pixel data x is settable is shifted rightward from the range of the pixel data x min  to x max , as shown in  FIG. 5   f , the correlation value L is the minimum xd in the arbitrary pixel data x in the range of the pixel data xa to x max . Consequently, the minimum correlation value L min  is xd. In this case, the average (xa+x max )/2 of the pixel data xa and x max  is determined as the pixel data xl. 
   The minimum correlation value L min  and the pixel data xl are thus found. The minimum correlation value R min  and the pixel data xr are also found in the same manner as the minimum correlation value L min  and the pixel data xl. 
   When the minimum correlation values L min  and R min  and the pixel data xl and xr in cases where the minimum correlation values are respectively given are found in the step  3 , the pixel data in the case where the smaller one of the minimum correlation values L min  and R min  is given is extracted (step  4 ). 
   When the minimum correlation values L min  and R min  differ from each other, one pixel data is extracted. When the minimum correlation values L min  and R min  are the same, two pixel data are extracted. 
   When one pixel data xl or xr is extracted in the step  4  (YES in step  5 ), the extracted pixel data is determined as the pixel data x on the interpolation pixel X (step  6 ). When two (a plurality of) pixel data xl and xr are selected in the step  4  (NO in step  5 ), the average of the pixel data xl and xr is determined as the pixel data x on the interpolation pixel X (step  7 ). 
   The details are as follows: 
   {circle around (1)} if L min &lt;R min , then x=xl 
   {circle around (2)} if L min &gt;R min , then x=xr 
   {circle around (3)} if L min =R min , then x=(xl+xr)/2 
   Although in the foregoing step  3 , two sets are selected as the set of opposed pixels between which the interpolation pixel X is sandwiched diagonally, two or more sets may be selected. For example, six sets of opposed pixels, for example, D 10  and D 26 , D 11  and D 25 , D 12  and D 24 , D 14  and D 22 , D 15  and D 21 , and D 16  and D 20  may be selected, as shown in  FIG. 6 . In this case, pixel data in a case where the minimum correlation value is given is found in the step  3  for each of the sets of opposed pixels. That is, six candidates for the pixel data are found. 
   When the number of minimums of the minimum correlation values corresponding to the six sets of opposed pixels is three or more, three or more pixel data are extracted from the six candidates for the pixel data in the step  4 . 
   When three or more pixel data are selected in the step  4 , there are three methods, as described below, as a method of determining the pixel data x on the interpolation pixel X. 
   The first method is one for calculating the average of three or more pixel data selected in the step  4  and determining the result of the calculation as the pixel data x on the interpolation pixel X. The second method is one for extracting the maximum and the minimum of three or more pixel data selected in the step  4 , calculating the average of the maximum and the minimum, and determining the result of the calculation as the pixel data x on the interpolation pixel X. 
   The third method is one for selecting, out of three or more pixel data selected in the step  4 , the pixel data obtained from the opposed pixels in closest proximity to the interpolation pixel X, and determining the selected pixel data as the pixel data x on the interpolation pixel X. When there exist two pixel data obtained from the opposed pixels in closest proximity to the interpolation pixel X, however, the average of the pixel data is calculated, and the result of the calculation is determined as the pixel data x on the interpolation pixel X. 
   When six sets of opposed pixels are selected, as shown in  FIG. 6 , as the set of opposed pixels between which the interpolation pixel X is sandwiched diagonally, the correlation values L 2  and R 2  are respectively expressed by the following equations (9) and (10), for example:
 
 L 2=| d 11− x|+|d 25− x |+β1 ×Hl   2 −β2 ×Vl   2   (9)
 
 R 2=| d 15− x|+|d 21− x |+β1 ×Hr   2 −β2 ×Vr   2   (10)
 
   Hl 2  and Vl 2  in the foregoing equation (9) are respectively expressed by the following equations (11) and (12):
 
 Hl   2 =MAX(| d 10− d 11|+| d 11− d 12|, | d 24− d 25|+| d 25− d 26|)  (11)
 
 Vl   2 =MIN(| d 01− d 11|+| d 11− d 21| , |d 15− d 25|+| d 25− d 35|)  (12)
 
   Hr 2  and Vr 2  in the foregoing equation (10) are respectively expressed by the following equations (13) and (14):
 
 Hr   2 =MAX(| d 14− d 15|+| d 15− d 16|, | d 20− d 21|+| d 21− d 22|)  (13)
 
 Vr   2 =MIN(| d 05− d 15|+| d 15− d 25|, | d 11− d 21|+| d 21− d 31|)  (14)
 
   SUMMARY OF THE INVENTION 
   The present invention is an improvement of a conventional method, and has for its object to provide an image interpolating method capable of preventing, in interpolating an image, backlash and blur from occurring in an edge portion of the image as well as capable of reproducing a smooth image. 
   In an image interpolating method for interpolating a pixel at an intermediate position between a first original pixel and a second original pixel adjacent to the first original pixel, a first image interpolating method according to the present invention is characterized by comprising a first step of calculating an edge component for judging whether or not an interpolation pixel exists in the vicinity of an edge position of original image data; a second step of finding a range where pixel data on the interpolation pixel is settable on the basis of the edge component and pixel data on the first and second original pixels; a third step of selecting a plurality of sets of opposed pixels between which the interpolation pixel is sandwiched diagonally, and finding for each of the sets the pixel data on the interpolation pixel in a case where a correlation value represented by the sum of the absolute values of the differences between the pixel data on the interpolation pixel and pixel data on the opposed pixels and a correction value calculated on the basis of the pixel data on the original pixel peripheral to each of the opposed pixels is the minimum in the range where the pixel data on the interpolation pixel is settable and the minimum correlation value; a fourth step of finding temporary pixel data on the interpolation pixel on the basis of the pixel data on the interpolation pixel in the case where the correlation value is the minimum and the minimum correlation value which are found for each of the sets; a fifth step of calculating a linear correlation value and a linear interpolation value between the first original pixel and the second original pixel; and a sixth step of calculating the final pixel data on the interpolation pixel on the basis of the minimum correlation value found in the third step, the linear correlation value calculated in the fifth step, the temporary pixel data calculated in the fourth step, and the linear interpolation value calculated in the fifth step. 
   The second image interpolating method according to the present invention is characterized in that in the first image interpolating method, assuming an original pixel adjacent to the first original pixel and opposite to the second original pixel is a third original pixel, and an original pixel adjacent to the second original pixel and opposite to the first original pixel is a fourth original pixel, and letting d 1  be the pixel data on the first original pixel, d 2  be the pixel data on the second original pixel, d 3  be pixel data on the third original pixel, and d 4  be pixel data on the fourth original pixel, a first edge component E is calculated on the basis of an equation for operation E=−d 3 +d 1 +d 2 −d 4 , and a second edge component Es is calculated on the basis of an equation for operation Es=|d 3 +d 1 −d 2 −d 4 | in the first step. 
   The third image interpolating method according to the present invention is characterized in that in the second image interpolating method, letting E be the first edge component found in the first step, Es be the second edge component found in the first step, dc be the average of the pixel data on the first original pixel and the pixel data on the second original pixel, and γ s and γ be predetermined factors, a range S where the pixel data on the interpolation pixel is settable is found on the basis of the following expressions in the second step:
 
if  E≧ 0, then  dc−Es×γs≦S≦dc+Es×γs+E×γ, 
 
if  E&lt; 0, then  dc−Es×γs+E×γ≦S≦dc+Es×γs   (15)
 
   The fourth image interpolating method according to the present invention is characterized in that in the third image interpolating method, when a direction connecting the first original pixel and the second original pixel is defined as an up-and-down direction, and a direction perpendicular to the up-and-down direction is defined as a right-and-left direction, assuming that the first original pixel is just above the second original pixel, and letting D 12  and D 24  be respectively the upper opposed pixel and the lower opposed pixel in the set of opposed pixels between which the interpolation pixel is sandwiched diagonally, d 12  and d 24  be respectively the pixel data on the opposed pixels D 12  and D 24 , β1 and β2 be respectively predetermined factors, Hl be the larger one of a horizontal correlation intensity on the side of the one opposed pixel D 12  and a horizontal correlation intensity on the side of the other opposed pixel D 24 , Vl be the smaller one of a vertical correlation intensity on the side of the one opposed pixel D 12  and a vertical correlation intensity on the side of the other opposed pixel D 24 , and x be the pixel data in the settable range S found in the third step, an equation for calculating a correlation value L corresponding to the set is expressed by the following equation:
 
 L=|d 12− x|+|d 24− x|+β 1 ·Hl−β 2 ·Vl   (16)
 
   The fifth image interpolating method according to the present invention is characterized in that in the fourth image interpolating method, the vertical correlation intensity on the side of the upper opposed pixel D 12  is a primary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel D 24  is a primary differential value in the vertical direction corresponding to the opposed pixel. 
   The sixth image interpolating method according to the present invention is characterized in that in the fourth image interpolating method, the vertical correlation intensity on the side of the upper opposed pixel D 12  is a secondary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel D 24  is a secondary differential value in the vertical direction corresponding to the opposed pixel. 
   The seventh image interpolating method according to the present invention is characterized in that in the fifth or sixth image interpolating method, when the sum of a primary differential value in the horizontal direction corresponding to an original pixel just above a target original pixel, a value which is two times a primary differential value in the horizontal direction corresponding to the target original pixel, and a primary differential value in the horizontal direction corresponding to an original pixel just below the target original pixel is defined as a horizontal correlation intensity in a predetermined region centered around the target original pixel, in a case where the upper opposed pixel D 12  is the first pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the first pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 24 . 
   The eighth image interpolating method according to the present invention is characterized in that in the seventh image interpolating method, when the upper opposed pixel D 12  is the n-th pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the n-th pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the first original pixel and the opposed pixel D 12  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the second original pixel and the opposed pixel D 24  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 24 . 
   The ninth image interpolating method according to the present invention is characterized in that in the fifth or sixth image interpolating method, when the sum of a secondary differential value in the horizontal direction corresponding to an original pixel just above a target original pixel, a value which is two times a secondary differential value in the horizontal direction corresponding to the target original pixel, and a secondary differential value in the horizontal direction corresponding to an original pixel just below the target original pixel is defined as a horizontal correlation intensity in a predetermined region centered around the target original pixel, in a case where the upper opposed pixel D 12  is the first pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the first pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 24 . 
   The tenth image interpolating method according to the present invention is characterized in that in the ninth image interpolating method, when the upper opposed pixel D 12  is the n-th pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the n-th pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the first original pixel and the opposed pixel D 12  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the second original pixel and the opposed pixel D 24  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 24 . 
   The eleventh image interpolating method according to the present invention is characterized in that in the third image interpolating method, when a direction connecting the first original pixel and the second original pixel is defined as an up-and-down direction, and a direction perpendicular to the up-and-down direction is defined as a right-and-left direction, assuming that the first original pixel is just above the second original pixel, and letting D 12  and D 24  be respectively the upper opposed pixel and the lower opposed pixel in the set of opposed pixels between which the interpolation pixel is sandwiched diagonally, d 12  and d 24  be respectively the pixel data on the opposed pixels D 12  and D 24 , β1 and β2 be respectively predetermined factors, Hl be the sum of a horizontal correlation intensity on the side of the one opposed pixel D 12  and a horizontal correlation intensity on the side of the other opposed pixel D 24 , Vl be the sum of a vertical correlation intensity on the side of the one opposed pixel D 12  and a vertical correlation intensity on the side of the other opposed pixel D 24 , and x be the pixel data in the settable range S found in the third step, an equation for calculating a correlation value L corresponding to the set is expressed by the following equation:
 
 L=|d 12− x|+|d 24− x |+β1 ·Hl−β 2 ·Vl   (17)
 
   The twelfth image interpolating method according to the present invention is characterized in that in the eleventh image interpolating method, the vertical correlation intensity on the side of the upper opposed pixel D 12  is a secondary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel D 24  is a secondary differential value in the vertical direction corresponding to the opposed pixel. 
   The thirteenth image interpolating method according to the present invention is characterized in that in the twelfth image interpolating method, when the sum of a secondary differential value in the horizontal direction corresponding to an original pixel just above a target original pixel, a value which is two times a secondary differential value in the horizontal direction corresponding to the target original pixel, and a secondary differential value in the horizontal direction corresponding to an original pixel just below the target original pixel is defined as a horizontal correlation intensity in a predetermined region centered around the target original pixel, in a case where the upper opposed pixel D 12  is the first pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the first pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a horizontal correlation intensity in a predetermined region centered around the opposed pixel D 24 . 
   The fourteenth image interpolating method according to the present invention is characterized in that in the thirteenth image interpolating method, when the upper opposed pixel D 12  is the n-th pixel in the horizontal direction from the first original pixel, and the lower opposed pixel D 24  is the n-th pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the first original pixel and the opposed pixel D 12  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 12 , and the horizontal correlation intensity on the side of the lower opposed pixel D 24  is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the second original pixel and the opposed pixel D 24  to the horizontal correlation intensity in the predetermined region centered around the opposed pixel D 24 . 
   The fifteenth image interpolating method according to the present invention is characterized in that in the first to fourteenth image interpolating methods, the fourth step comprises the steps of selecting the minimum of the minimum correlation values found for the sets in the third step, extracting the pixel data on the interpolation pixel in a case where the selected minimum of the minimum correlation values is given, determining, when the number of minimums of the minimum correlation values is one, the pixel data on the interpolation pixel in a case where the minimum of the minimum correlation values is given as the temporary pixel data on the interpolation pixel, and determining, when there are a plurality of minimums of the minimum correlation values, the average of the pixel data on the interpolation pixel in cases where the minimums of the minimum correlation values are respectively given as the temporary pixel data on the interpolation pixel. 
   The sixteenth image interpolating method according to the present invention is characterized in that in the first to fourteenth image interpolating methods, the fourth step comprises the steps of selecting the minimum of the minimum correlation values found for the sets in the third step, extracting the pixel data on the interpolation pixel in a case where the selected minimum of the minimum correlation values is given, determining, when the number of minimums of the minimum correlation values is one, the pixel data on the interpolation pixel in a case where the minimum of the minimum correlation values is given as the temporary pixel data on the interpolation pixel, and extracting, when there are a plurality of minimums of the minimum correlation values, the maximum and the minimum of the pixel data on the interpolation pixel in cases where the minimums of the minimum correlation values are respectively given, and determining the average of the extracted maximum and minimum as the pixel data on the interpolation pixel. 
   The seventeenth image interpolating method according to the present invention is characterized in that in the first to fourteenth image interpolating methods, the fourth step comprises the steps of selecting the minimum of the minimum correlation values found for the sets in the third step, extracting the pixel data on the interpolation pixel in a case where the selected minimum of the minimum correlation values is given, determining, when the number of minimums of the minimum correlation values is one, the pixel data on the interpolation pixel in a case where the minimum of the minimum correlation values is given as the temporary pixel data on the interpolation pixel, and selecting, when there are a plurality of minimums of the minimum correlation values, the pixel data obtained from the opposed pixel in closest proximity to the interpolation pixel out of the pixel data on the interpolation pixel in cases where the minimums of the minimum correlation values are respectively given, and determining, when the number of selected pixel data is one, the pixel data as the pixel data on the interpolation pixel, while determining, when the number of selected pixel data is two, the average of the pixel data as the pixel data on the interpolation pixel. 
   The eighteenth image interpolating method according to the present invention is characterized in that in the first to seventeenth image interpolating methods, the sixth step is one of selecting, when the linear correlation value calculated in the fifth step is not more than the minimum correlation value found in the third step, the linear interpolation value calculated in the fifth step as final pixel data on the interpolation pixel, while selecting, when the linear correlation value calculated in the fifth step is more than the minimum correlation value found in the third step, the temporary pixel data calculated in the fourth step as final pixel data on the interpolation pixel. 
   The nineteenth image interpolating method according to the present invention is characterized in that in the first to seventeenth image interpolating methods, the sixth step is one of weighting and adding the linear interpolation value calculated in the fifth step and the temporary pixel data calculated in the fourth step depending on the linear correlation value calculated in the fifth step and the minimum correlation value found in the third step, to calculate the final pixel data on the interpolation pixel. 
   The foregoing and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. 


   
     BRIEF DESCRIPTION OF THE DRAWINGS 
       FIG. 1  is a schematic view showing the relationship between original pixels and an interpolation pixel; 
       FIG. 2  is a flow chart showing the procedure for finding pixel data x on an interpolation pixel X by a conventional method; 
       FIGS. 3   a  and  3   b  are schematic views showing a range S where pixel data x on an interpolation pixel X is settable; 
       FIG. 4  is a graph of a correlation value L against pixel data x; 
       FIGS. 5   a  to  5   f  are graphs of a correlation value L against pixel data x and schematic views showing a range S where the pixel data x is settable; 
       FIG. 6  is a schematic view showing the relationship between original pixels and an interpolation pixel; 
       FIG. 7  is a flow chart showing the procedure for finding pixel data x on an interpolation pixel X by a first proposed method; 
       FIGS. 8   a  and  8   b  are schematic views showing a range S where pixel data x on an interpolation pixel X is settable; 
       FIG. 9  is a graph of a correlation value L against pixel data x; 
       FIG. 10  is a block diagram showing the configuration of an image interpolating device; 
       FIG. 11  is a schematic view showing a specific example for comparing a conventional method and a first proposed method; 
       FIG. 12  is a schematic view showing a specific example for comparing a conventional method and a first proposed method; 
       FIG. 13  is a schematic view showing another specific example for comparing a conventional method and a first proposed method; 
       FIG. 14  is a schematic view showing a specific example for comparing a first proposed method and a second proposed method; and 
       FIG. 15  is a schematic view for explaining modified examples of a first proposed method and a second proposed method. 
   


   DESCRIPTION OF THE PREFERRED EMBODIMENTS 
   Referring now to  FIGS. 1 ,  5 ,  6 ,  7  to  15 , embodiments of the present invention will be described. 
   [1] Description of First Embodiment 
   An image interpolating method according to a first embodiment of the present invention (hereinafter referred to as a first proposed method) will be described. 
   [1-1] Description of Relationship Between Original Pixels and Pixel to be Interpolated 
     FIG. 1  illustrates the relationship between original pixels and a pixel to be interpolated. 
   In  FIG. 1 , lines (n−1), n, (n+1), and (n+2) are horizontal lines in an original image, and lines (i−1), i, (i+1) are horizontal lines to be interpolated. Description is herein made of a case where a pixel (hereinafter referred to as an interpolation pixel) X on the line i is interpolated. 
   In the following description, pixel data on original pixels D 01  to D 35  and the interpolation pixel X are respectively denoted by d 01  to d 35  and x. In this example, the pixel data shall be composed of eight bits, and black data and white data shall be respectively “0” and “255”. 
   [1-2] Description of Procedure for Finding Pixel Data x on Interpolation Pixel X 
     FIG. 7  shows the procedure for finding the pixel data x on the interpolation pixel X by the first proposed method. 
   [1-2-1] Description of Step  11   
   In order to judge whether or not the interpolation pixel X exists in the vicinity of an edge of the original image, a first edge component E and a second edge component Es are first calculated (step  11 ). That is, the pixel data on the two original pixels D 03  and D 13  just above the interpolation pixel X and the pixel data on the original pixels D 23  and D 33  just below the interpolation pixel X are used, to find the first edge component E from the following equation (18) as well as to find the second edge component Es from the following equation (19):
 
 E=−d 03+ d 13+ d 23− d 33  (18)
 
 Es=|d 03+ d 13− d 23− d 33|  (19)
 
   The first edge component E takes a relatively large negative value when the interpolation pixel X exists in the vicinity of a black edge of the original image, while taking a relatively large positive value when the interpolation pixel X exists in the vicinity of a white edge of the original image. On the other hand, the second edge component Es takes a relatively large value when the interpolation pixel X exists in the vicinity of an edge (an edge at a boundary between white and black) of the original image, while taking a relatively small value when the interpolation pixel X does not exist in the vicinity of the edge of the original image. 
   [1-2-2] Description of Step  12   
   A range S where the pixel data x on the interpolation pixel X is settable is then determined on the basis of the edge components E and Es (step  12 ). 
   Description is made of a method of determining the settable range S on the basis of  FIGS. 8   a  and  8   b . In  FIGS. 8   a  and  8   b , d max  denotes the larger one of the pixel data d 13  and d 23  on the original pixels D 13  and D 23 , and d min  denotes the smaller one of the pixel data d 13  and d 23 . Further, dc denotes the average (d max +d min )/2 of d max  and d min . 
   (1) Range S Where Pixel Data x is Settable When E≧0 
   When E≧0, the range S where the pixel data x is settable shall be a range of dc−(Es×γs)≦S≦dc+(Es×γs)+(E×γ) as shown in  FIG. 8   a , where γ s and γ are variables which can be controlled from the exterior. 
   That is, when the edge component E is not less than zero, the range S where the pixel data x is settable is a range expanded upward by the value of γ·E from a range [dc−(Es×γs)≦x≦dc+(Es×γs)] centered around dc. 
   In this case, it is presumed that the interpolation pixel X exists in the vicinity of the white edge of the original image, and the settable range S is set to a range near d max  in the range of d min  to d max . 
   (2) Range S where Pixel Data x is Settable When E&lt;0 
   When E&lt;0, the settable range S shall be a range of dc−(Es×γs)+(E×γ)≦S≦dc+(Es×γs), as shown in  FIG. 8   b.    
   That is, when the edge component E is less than zero, the range S where the pixel data x is settable is a range expanded downward by the value of γ·E from a range [dc−(Es×γs)≦x≦dc+(Es×γs)] centered around dc. 
   In this case, it is presumed that the interpolation pixel X exists in the vicinity of the black edge of the original image, and the settable range S is set to a range near d min  in the range of d min  to d max . 
   [1-2-3] Description of Step  13   
   Candidates for the pixel data x on the interpolation pixel X are then found from the range S where the pixel data x on the interpolation pixel X is settable on the basis of the pixel data on the opposed pixels between which the interpolation pixel X is sandwiched diagonally (step  13 ). 
   Although a method of finding the candidates for the pixel data x on the interpolation pixel X is approximately the same as that in the step  3  shown in  FIG. 2 , methods of respectively calculating correlation values L and R differ from those in the step  3  shown in  FIG. 2 . 
   A correlation value L between the pixel data on the opposed pixels D 12  and D 24  and the pixel data x on the interpolation pixel X shown in  FIG. 1  is expressed by the following equation (20), and a correlation value R between the pixel data on the opposed pixels D 14  and D 22  and the pixel data x on the interpolation pixel X shown in  FIG. 1  is expressed by the following equation (21):
 
 L=|d 12− x|+|d 24− x |+β1 ×Hl−β 2 ×Vl   (20)
 
 R=|d 14− x|+|d 22− x |+β1 ×Hr−β 2 ×Vr   (21)
 
   In the foregoing equations (20) and (21), β1 and β2 are valuables which can be controlled from the exterior. Although the foregoing equations (20) and (21) are the same as the foregoing equations (2) and (3) in the conventional method, methods of respectively calculating horizontal correlation intensities Hl and Hr differ from those in the conventional example. 
   Description is herein made of the basic ideas of the methods of respectively calculating Hl and Hr. Since the basic ideas of the methods of respectively calculating Hl and Hr are the same, description is herein made of the basic idea of the method of calculating Hl. 
   Hl is defined as the larger one of a horizontal correlation intensity on the side of the upper opposed pixel (D 12  shown in  FIG. 1  in this example) and a horizontal correlation intensity on the side of the lower opposed pixel (D 24  shown in  FIG. 1  in this example). 
   The sum of a primary differential value in the horizontal direction corresponding to an original pixel just above a target original pixel, a value which is two times a primary differential value in the horizontal direction corresponding to the target original pixel, and a primary differential value in the horizontal direction corresponding to an original pixel just below the target original pixel is defined as a horizontal correlation intensity in a predetermined region (a region of 3 pixels by 3 pixels) centered around the target original pixel. 
   Suppose a pixel just above the interpolation pixel X is a first original pixel, and a pixel just below the interpolation pixel X is a second original pixel. In this case, when the upper opposed pixel is the first pixel in the horizontal direction from the first original pixel, and the lower opposed pixel is the first pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel is a horizontal correlation intensity in a predetermined region centered around the opposed pixel, and the horizontal correlation intensity on the side of the lower opposed pixel is a horizontal correlation intensity in a predetermined region centered around the opposed pixel. 
   When the upper opposed pixel is the n-th pixel in the horizontal direction from the first original pixel, and the lower opposed pixel is the n-th pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the first original pixel and the opposed pixel to the horizontal correlation intensity in the predetermined region centered around the opposed pixel. The horizontal correlation intensity on the side of the lower opposed pixel is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the second original pixel and the opposed pixel to the horizontal correlation intensity in the predetermined region centered around the opposed pixel. 
   Consequently, the horizontal correlation intensity Hl in the foregoing equation (20) is expressed by the following equation (22), letting AL 1  be a horizontal correlation intensity in the predetermined region centered around the upper opposed pixel D 12  and letting BL 1  be a horizontal correlation intensity in the predetermined region centered around the lower opposed pixel D 24 :
 
 Hl =MAX[ AL 1, BL 1]=MAX[{(| d 03− d 02|+| d 02− d 01|)+2( |d 13− d 12|+| d 12− d   11|)+(|   d 23− d 22|+| d 22− d 21 51  )}, {(| d 13− d 14|+| d 14− d 15|)+2(| d 23− d 24|+| d 24− d 25|)+(| d 33− d 34|+| d 34− d 35|)}]  (22)
 
   That is, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is equal to the horizontal correlation intensity AL 1  in the predetermined region centered around the upper opposed pixel D 12 , and is represented by the sum of a primary differential value (|d 03 −d 02 |+|d 02 −d 01 |) in the horizontal direction corresponding to the pixel D 02  just above the opposed pixel D 12 , a value which is two times a primary differential value (|d 13 −d 12 |+|d 12 −d 11 |) in the horizontal direction corresponding to the opposed pixel D 12 , and a primary differential value (|d 23 −d 22 |+|d 22 −d 21 |) in the horizontal direction corresponding to the pixel D 22  just below the opposed pixel D 12 . 
   The horizontal correlation intensity on the side of the lower opposed pixel D 24  is equal to the horizontal correlation intensity BL 1  in the predetermined region centered around the lower opposed pixel D 24 , and is represented by the sum of a primary differential value (|d 13 −d 14 |+|d 14 −d 15 |) in the horizontal direction corresponding to the pixel D 14  just above the opposed pixel d 24 , a value which is two times a primary differential value (|d 23 −d 24 |+|d 24 −d 25 |) in the horizontal direction corresponding to the opposed pixel D 24 , and a primary differential value (|d 33 −d 34 |+|d 34 −d 35 |) in the horizontal direction corresponding to the pixel D 34  just below the opposed pixel D 24 . 
   A vertical correlation intensity Vl is defined as the smaller one of a vertical correlation intensity on the side of the upper opposed pixel and a vertical correlation intensity on the side of the lower opposed pixel. The vertical correlation intensity on the side of the upper opposed pixel is a primary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel is a primary differential value in the vertical direction corresponding to the opposed pixel. Consequently, the vertical correlation intensity Vl is expressed by the following equation (23):
 
 Vl =MIN(| d 02− d 12|+| d 12− d 22|, | d 14− d 24|+| d 24− d 34|)  (23)
 
   That is, the vertical correlation intensity on the side of the upper opposed pixel D 12  is represented as a primary differential value (|d 02 −d 12 |+|d 12 −d 22 |) in the vertical direction corresponding to the pixel D 12 , and the vertical correlation intensity on the side of the lower opposed pixel D 24  is represented as a primary differential value (|d 14 −d 24 |+|d 24 −d 34 |) in the vertical direction corresponding to the pixel D 24 . 
   The vertical correlation intensity on the side of the upper opposed pixel may be a secondary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel may be a secondary differential value in the vertical direction corresponding to the opposed pixel. In this case, the vertical correlation intensity Vl is expressed by the following equation (24):
 
 Vl =MIN(|− d 02+2 *d 12− d 22|, |− d 14+2 *d 24− d 34|)  (24)
 
   The horizontal correlation intensity Hr in the foregoing equation (21) is expressed by the following equation (25), letting AR 1  be a horizontal correlation intensity in the predetermined region centered around the upper opposed pixel D 14  and letting BR 1  be a horizontal correlation intensity in the predetermined region centered around the lower opposed pixel D 22 . Further, the vertical correlation intensity Vr is expressed by the following equation (26):
 
 Hr =MAX[ AR 1, BR 1]=MAX[{(| d 03− d 04|+| d 04− d 05|)+2(| d 13− d 14|+| d 14− d 15|)+(| d 23− d 24|+| d 24− d 25|)}, {(| d 13− d 12|+| d 12− d 11|)+2(| d 23− d 22|+| d 22− d 21|)+(| d 33− d 32|+| d 32− d 31|)}]  (25)
 
 Vr =MIN(| d 04− d 14|+| d 14− d 24|, | d 12− d 22|+| d 22− d 32|)  (26)
 
   The vertical correlation intensity Vr may be calculated by the following equation (27):
 
 Vr =MIN(| d 04+2 *d 14− d 24|, |− d 12+2 *d 22− d 32|)  (27)
 
     FIG. 9  illustrates the relationship between the correlation value L and the pixel data x. In  FIG. 9 , x min  denotes the smaller one of the pixel data d 12  and d 24 , and x max  denotes the larger one of the pixel data d 12  and d 24 . Further, xd=x max −x min +β1×Hl−β2×Vl. 
   When xd=x max −x min +β1×Hl−β2×Vl, the correlation value L in the foregoing equation (20) can be changed, as expressed by the following equation (28) The correlation value R in the foregoing equation (21) can be also similarly changed: 
   
     
       
         
           
             
               
                 
                   
                     
                       L 
                       = 
                       
                         xd 
                         + 
                         
                           2 
                           ⁢ 
                           
                             ( 
                             
                               x 
                               - 
                               
                                 x 
                                 max 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       ( 
                       
                         x 
                         &gt; 
                         
                           x 
                           max 
                         
                       
                       ) 
                     
                   
                 
                 
                   
                     
                       L 
                       = 
                       xd 
                     
                   
                   
                     
                       ( 
                       
                         
                           x 
                           min 
                         
                         ≦ 
                         x 
                         ≦ 
                         
                           x 
                           
                             max 
                             ⁢ 
                             
                                 
                             
                           
                         
                       
                       ) 
                     
                   
                 
                 
                   
                     
                       L 
                       = 
                       
                         xd 
                         + 
                         
                           2 
                           ⁢ 
                           
                             ( 
                             
                               
                                 x 
                                 min 
                               
                               - 
                               x 
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       ( 
                       
                         x 
                         &lt; 
                         
                           x 
                           min 
                         
                       
                       ) 
                     
                   
                 
               
             
             
               
                 ( 
                 28 
                 ) 
               
             
           
         
       
     
   
   The minimum correlation values L min  and R min  and the pixel data xl and xr can be found by the second method described in the step  3  shown in  FIG. 2 , that is, the same method as that described using  FIG. 5 . 
   [1-2-4] Description of Steps  14  to  17   
   When the minimum correlation values L min  and R min  and the pixel data xl and xr in cases where the minimum correlation values are respectively given are found in the step  13 , pixel data in a case where the smaller one of the minimum correlation values L min  and R min  (a diagonal minimum correlation value Cmin) is given is extracted (step  14 ). 
   When the minimum correlation values L min  and R min  differ from each other, one pixel data is extracted. When both the minimum correlation values L min  and R min  are the same, two pixel data are extracted. 
   When one pixel data xl or xr is extracted in the step  14  (YES in step  15 ), the extracted pixel data is determined as temporary pixel data Dp on the interpolation pixel X (step  16 ). The program then proceeds to the step  19 . When two (a plurality of) pixel data xl and xr are selected in the step  14  (NO in step  15 ), the average of the pixel data xl and xr is determined as temporary pixel data Dp on the interpolation pixel X (step  17 ). The program then proceeds to the step  19 . 
   The details are as follows: 
   {circle around (1)} if L min &lt;R min , then Dp=xl 
   {circle around (1)} if L min &gt;R min , then Dp=xr 
   {circle around (3)} if L min =R min , then Dp=(xl+xr)/2 
   [1-2-5] Description of Step  18   
   On the other hand, in the step  18 , a linear correlation value Clin (Clin=|d 13 −d 23 |) and a linear interpolation value Avg (Avg=(d 13 +d 23 )/2) using the pixel data d 13  and d 23  on the pixels D 13  and D 23  above and below the interpolation pixel X are calculated. 
   [1-2-6] Description of Step  19   
   In the step  19 , the final pixel data x on the interpolation pixel X is calculated on the basis of the temporary pixel data Dp on the interpolation pixel X obtained in the step  16  or  17 , the diagonal minimum correlation value Cmin obtained in the step  14 , and the linear interpolation value Avg and the linear correlation value Clin, which correspond to the interpolation pixel X, obtained in the step  18 . 
   That is, when the linear correlation value Clin is not more than the diagonal minimum correlation value Cmin, the linear interpolation value Avg is taken as the final pixel data x on the interpolation pixel X. When the linear correlation value Clin is more than the diagonal minimum correlation value Cmin, the temporary pixel data Dp is taken as the final pixel data x on the interpolation pixel X. 
   Furthermore, the final pixel data x may be also calculated on the basis of the following equation (29).
 
 x=Dp×K +Avg×(1 −K )
 
 K=Clin/ ( Clin+Cmin )
 
   where K=1 when Cmin&lt;0 or Clin=Cmin=0
 
K=0 when Cmin&gt;Th  (29)
 
   Th is set to 255, for example, when the pixel data is composed of eight bits. 
   [1-3] Description of Case Where Number of Types of Diagonal Correlation is Increased 
   Although two sets are selected as the set of opposed pixels between which the interpolation pixel X is sandwiched diagonally in the foregoing step  13 , two or more sets may be selected. For example, six sets of opposed pixels, for example, D 12  and D 28 , D 13  and D 27 , D 14  and D 26 , D 16  and D 24 , D 17  and D 23 , and D 18  and D 22  may be selected, as shown in  FIG. 6 . In this case, pixel data in a case where the minimum of the correlation value is given is found in the step  13  for each of the sets of opposed pixels. That is, six candidates for the pixel data are found. 
   When the number of the minimums of the minimum correlation values corresponding to the six sets of opposed pixels is three or more, three or more pixel data are extracted from the six candidates for the pixel data in the step  14 . 
   When three or more pixel data are selected in the step  14 , there are three methods, as described in the conventional method, as a method of determining the temporary pixel data Dp on the interpolation pixel X. 
   When six sets of opposed pixels are selected, as shown in  FIG. 6 , as the set of opposed pixels between which the interpolation pixel X is sandwiched diagonally, the correlation values L 2  and R 2 , for example, are respectively expressed by the following equations (30) and (31):
 
 L 2=| d 11− x|+|d 25− x |+β1 ×Hl   2 −β2 ×Vl   2   (30)
 
 R 2=| d 15− x|+|d 21− x |+β1 ×Hr   2 −β2 ×Vr   2   (31)
 
   Letting AL 1  be a horizontal correlation intensity in a predetermined region centered around the pixel D 12 , AL 2  be a horizontal correlation intensity in a predetermined region centered around the pixel D 11 , BL 1  be a horizontal correlation intensity in a predetermined region centered around the pixel D 24 , and BL 2  be a horizontal correlation intensity in a predetermined region centered around the pixel D 25 , Hl 2  in the foregoing equation (30) is expressed by the following equation (32) in accordance with the basic idea of the above-mentioned calculating method. Further, Vl 2  is expressed by the following equation (33) when a primary differential value is used:
 
 Hl   2 =MAX[ AL 1+ AL 2, BL 1+ BL 2]=MAX[{ AL 1+(| d 02− d 01|+| d 01− d 00|)+2(| d 12− d 11|+| d 11− d 10|)+(| d 22− d 21|+| d 21− d 20|)}, { BL 1+(| d 14− d 15|+| d 15− d 16|)+2(| d 24− d 25|+| d 25− d 26|)+(| d 34&#39; d 35|+| d 35− d 36|)}]  (32)
 
 Vl   2 =MIN(| d 01− d 11|+| d 11− d 21|, | d 15− d 25|+| d 25− d 35|)  (33)
 
   Hr 2  in the foregoing equation (31) is expressed by the following equation (34), letting AR 1  be a horizontal correlation intensity in a predetermined region centered around the pixel D 14 , AR 2  be a horizontal correlation intensity in a predetermined region centered around the pixel D 15 , BR 1  be a horizontal correlation intensity in a predetermined region centered around the pixel D 22 , and BR 2  be a horizontal correlation intensity in a predetermined region centered around the pixel D 21 . Further, Vr 2  is expressed by the following equation (35) when a primary differential value is used:
 
 Hr   2 =MAX[ AR 1+ AR 2, BR 1+ BR 2]=MAX[{ AR 1+(| d 04− d 05|+| d 05− d 06|)+2(| d 14− d 15|+| d 15− d 16|)+(| d 24− d 25|+| d 25− d 26|)}, { BR 1+(| d 12− d 11|+| d 11− d 10|)+2(| d 22− d 21|+| d 21− d 20|)+(| d 32− d 31|+| d 31− d 01|)}]  (34)
 
 Vr   2 =MIN(| d 05− d 15|+| d 15− d 25|, | d 11− d 21|+| d 21− d 31|)  (35)
 
   [1-4] Description of Image Interpolating Device Using First Proposed Method 
     FIG. 10  illustrates the configuration of an image interpolating device. 
   Description is herein made of a case where the number of sets of diagonally opposed pixels is four, and diagonal correlation values L 1 , L 2 , R 1 , and R 2  shown in  FIG. 6  are calculated. 
   A memory unit  1  stores pixel data on an original pixel inputted through an input terminal IN. A correlation value operating unit  2  performs the processing in the steps  11  to  13  shown in  FIG. 7  using the pixel data on the original pixel stored in the memory unit  1 , to calculate four minimum correlation values L 1   min , L 2   min , R 1   min , and R 2   min  which are obtained from four sets of opposed pixels and pixel data x 1   l , x 2   l , x 1   r , and x 2   r  on the interpolation pixel X in cases where the four minimum correlation values are respectively given. 
   A minimum extracting unit  3  and a pixel data selecting unit  4  perform the processing in the step  14  shown in  FIG. 7 . The minimum extracting unit  3  identifies the minimum correlation value which is the minimum of the four minimum correlation values L 1   min , L 2   min , R 1   min , and R 2   min  calculated by the correlation value operating unit  2 . The minimum extracting unit  3  outputs control signals Flag 1  to Flag 4  respectively corresponding to the minimum correlation values L 1   min , L 2   min , R 1   min , and R 2   min  of the correlation values L 1 , L 2 , R 1 , and R 2 . The control signal corresponding to the smallest one of the minimum correlation values L 1   min , L 2   min , R 1   min , and R 2   min  of the correlation values L 1 , L 2 , R 1 , and R 2  is considered to be High, and the control signals corresponding to the other minimum correlation values are considered to be Low. The minimum extracting unit  3  gives the minimum correlation value Cmin to a correlation value comparing unit  7 . 
   The pixel data selecting unit  4  selects, out of the four pixel data x 1   l , x 2   l , x 1   r , and x 2   r  which are fed from the correlation value operating unit  2 , the pixel data which are candidates for the pixel data x on the interpolation pixel X on the basis of the control signals Flag 1  and Flag 4  fed from the minimum extracting unit  3 . Specifically, the pixel data selecting unit  4  outputs to a temporary interpolation pixel data extracting unit  5  the pixel data corresponding to the control signal, which will be High, out of the control signals fed from the minimum extracting unit  3 . 
   The temporary interpolation pixel data extracting unit  5  performs the processing in the step  16  or  17  shown in  FIG. 7  depending on the number of pixel data selected by the pixel data selecting unit  4 , to calculate temporary pixel data Dp and feed the calculated temporary pixel data Dp to an interpolation pixel data extracting unit  8 . 
   A linear correlation value/linear interpolation value operating unit  6  performs the processing in the step  18  shown in  FIG. 7  using the pixel data on the original pixel stored in the memory unit  1 , thereby calculating a linear correlation value Clin and a linear interpolation value Ag. The linear correlation value/linear interpolation value operating unit  6  feeds the obtained linear correlation value Clin to the correlation value comparing unit  7  as well as to feed the obtained linear interpolation value Avg to the interpolation pixel data extracting unit  8 . 
   The correlation value comparing unit  7  compares the diagonal minimum correlation value Cmin given from the minimum extracting unit  3  with the linear correlation value Clin given from the linear correlation value/linear interpolation value operating unit  6 , and feeds a signal representing the result of the comparison to the interpolation pixel data extracting unit  8 . 
   The interpolation pixel data extracting unit  8  performs the processing in the step  19  shown in  FIG. 7 , to select one of the temporary pixel data Dp fed from the temporary interpolation pixel data extracting unit  5  and the linear interpolation value Avg given from the linear correlation value/linear interpolation value operating unit  6  on the basis of the comparison result signal from the correlation value comparing unit  7  and feed the selected one to a switching unit  9 . 
   That is, the interpolation pixel data extracting unit  8  outputs the linear interpolation value Avg when the linear correlation value Clin is not more than the diagonal minimum correlation value Cmin, while outputting the temporary pixel data Dp when the linear correlation value Clin is more than the diagonal minimum correlation value Cmin. 
   The pixel data on the original pixel is fed to the switching unit  9  through the memory unit  1  and the correlation value operating unit  2 . That is, pixel data on original pixels on n lines are outputted to an output unit OUT from the switching unit  9  when the pixel data are outputted, while pixel data on interpolation pixels on i lines are outputted to the output terminal OUT from the switching unit  9  when the pixel data are outputted. 
   [2] Comparison between First Proposed Method and Conventional Method 
   [2-1] First Specific Example 
   Suppose a case where the pixel values of the pixels peripheral to the interpolation pixel X are pixel values as shown in  FIG. 11 . In  FIG. 11 , a black circle indicates black (a pixel value 0), and a white circle indicates white (a pixel value 1). In the example shown in  FIG. 11 , the pixel data x on the interpolation pixel X in the conventional method will be compared with that in the first proposed method. 
   In the conventional method, the edge component E, dmax (the larger one of d 13  and d 23 ), d min  (the smaller one of d 13  and d 23 ), dc (the average of dmax and dmin), the minimum xa in the settable range S, and the maximum xb in the settable range S are as follows:
 
 E=−d 03+ d 13+ d 23− d 33=−0+1+0−1=0
 
 d min=0 , d max=1 , dc= 0.5
 
 xa=d min×α+ dc ×(1−α)=0×α+0.5×(1−α)=0.5×(1−α)
 
                 xb   =         d   ⁢           ⁢   max   ×   α     +     dc   ×     (     1   -   α     )       +     E   ×   γ       =       1   ×   α     +     0.5   ×     (     1   -   α     )       +     0   ×   γ                     =     α   +     0.5   ×     (     1   -   α     )                     0.25 ≦S≦ 0.75 when α=0.5 
   In the case shown in  FIG. 11 , correlation in a direction indicated by an arrow is strong (a correlation value is the minimum). Consequently, xmin=xmax=0 in  FIG. 5 . In the case shown in  FIG. 11 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   b , so that the pixel data x is xa(0.25). 
   That is, in the example shown in  FIG. 11 , the pixel on the left side of the interpolation pixel X takes a linear interpolation value (0.5). However, the pixel data x on the interpolation pixel X is 0.25 close to black, whereby a step occurs in a white line. 
   Contrary to this, in the first proposed method, the first edge component E, the second edge component Es, dmax, dmin, dc, the minimum xa in the settable range S, and the maximum xb in the settable range S are as follows:
 
 E=−d 03+ d 13+ d 23− d 33=−0+1+0−1=0
 
 Es=|d 03+ d 13− d 23− d 33|=|0+1−0−1|=0
 
 d min=0 , d max=1 , dc= 0.5
 
 xa=dc−Es×γs= 0.5−0 ×γs= 0.5
 
 Xb=dc+Es×γs+E×γ= 0.5+0 ×γs+ 0×γ=0.5
 
0.5 ≦S ≦=0.5
 
   In the case shown in  FIG. 11 , correlation in a direction indicated by an arrow is strong (a correlation value is the minimum). Consequently, xmin=xmax=0 in  FIG. 5 . In the case shown in  FIG. 11 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   b , so that the pixel data x is xa(0.5). 
   That is, in the first proposed method, a pixel on the left side of the interpolation pixel X takes a linear correlation value (0.5), and the pixel data x on the interpolation pixel X is also 0.5 by the restriction of the settable range, whereby no step occurs in a white line. 
   [2-2] Second Specific Example 
   Suppose a case where the pixel values of the pixels peripheral to the interpolation pixel X are pixel values as shown in  FIG. 13 . In  FIG. 13 , a black circle indicates black (a pixel value 0), and a white circle indicates white (a pixel value 1). In the example shown in  FIG. 13 , the pixel data x on the interpolation pixel X in the conventional method will be compared with that in the first proposed method. However, we would like to herein explain the difference in the pixel data x on the interpolation pixel X depending on the difference between methods of respectively calculating diagonal correlation values L and R. In the conventional method, therefore, the calculation method by the first proposed method shall be also used for the settable range S. 
   The first edge component E, the second edge component Es, dmax (the larger one of d 13  and d 23 ), dmin (the smaller one of d 13  and d 23 ), dc (the average of dmax and dmin), the minimum xa in the settable range S, and the maximum xb in the settable range S are as follows:
 
 E=−d 03+ d 13+ d 23− d 33=−1+1+0−0=0
 
 Es=|d 03+ d 13− d 23− d 33|=|1+1−0−0|=2
 
 d min=0 , d max=1 , dc= 0.5
 
 xa=dc−Es×γs= 0.5−2 ×γs 
 
 xb=dc+Es×γs+E×γ= 0.5+2 ×γs+ 0×γ=0.5
 
−0.5 ≦S≦ 1.5 when γ s= 0.5
 
   In the conventional method, a diagonal correlation value is the minimum 0 (xd=xmax−xmin+β1×Hl−β2×Vl=(0−0)+β1×0−β2×0=0) in a direction of an arrow indicated by a broken line in  FIG. 13 . Consequently, xmin=xmax=0 in  FIG. 5 . In the case shown in  FIG. 13 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   d , so that the pixel data x is (xmin+xmax)/2)=0. 
   That is, in the example shown in  FIG. 13 , the interpolation pixel X exists between a white portion and a black portion. Accordingly, it is preferable that the pixel data x is 0.5. In the conventional method, however, the correlation value in the direction of the arrow indicated by the broken line is the minimum. Accordingly, the pixel data x is black (0), whereby a step occurs in an interpolated portion. 
   Contrary to this, in the first proposed method, a correlation value xd in a direction of an arrow indicated by a broken line in  FIG. 13  is as follows:
 
 Xd=x max− x min+β1 ×Hl−β 2 ×Vl =(0−0)+β1×3−β2×0=3β1
 
   Furthermore, a correlation value xd in a direction of an arrow indicated by a solid line is as follows:
 
 xd=x max− x min+β1 ×Hl−β 2 ×Vl =(1−0)+β1×1−β2×0=1+β1
 
   When β1&gt;0.5 is set, the correlation value in the direction of the arrow indicated by the broken line &gt; the correlation value in the direction of the arrow indicated by the solid line, so that the correlation value in the direction of the arrow indicated by the solid line is the minimum. Consequently, xmin=0 and xmax=1. In the case shown in  FIG. 13 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   d  as in the conventional method. However, the pixel data x is (xmin+xmax)/2=0.5, whereby no step occurs in an interpolated portion. 
   [3] Description of Second Embodiment 
   Description is now made of an image interpolating method according to a second embodiment of the present invention (hereinafter referred to as a second proposed method). 
   The second proposed method is approximately the same as the first proposed method except for only methods of respectively calculating horizontal correlation intensities Hl and Hr used in calculating diagonal correlation values L and R. 
   Description is made of the basic ideas of the methods of respectively calculating Hl and Hr. Since the basic ideas of the methods of respectively calculating Hl and Hr are the same, description is herein made of the basic idea of the method of calculating Hl. 
   Hl is defined as the larger one of a horizontal correlation intensity on the side of an upper opposed pixel (D 12  shown in  FIG. 1  in this example) and a horizontal correlation intensity on the side of a lower opposed pixel (D 24  shown in  FIG. 1  in this example). 
   The sum of a secondary differential value in the horizontal direction corresponding to an original pixel just above a target original pixel, a value which is two times a secondary differential value in the horizontal direction corresponding to the target original pixel, and a secondary differential value in the horizontal direction corresponding to an original pixel just below the target original pixel is defined as a horizontal correlation intensity in a predetermined region (a region of 3 pixels by 3 pixels) centered around the target original pixel. 
   Suppose a pixel just above an interpolation pixel X is a first original pixel, and a pixel just below the interpolation pixel X is a second original pixel. In this case, when the upper opposed pixel is the first pixel in the horizontal direction from the first original pixel, and the lower opposed pixel is the first pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel is a horizontal correlation intensity in a predetermined region centered around the opposed pixel, and the horizontal correlation intensity on the side of the lower opposed pixel is horizontal correlation intensity in a predetermined region centered around the opposed pixel. 
   When the upper opposed pixel is the n-th pixel in the horizontal direction from the first original pixel, and the lower opposed pixel is the n-th pixel in the horizontal direction from the second original pixel, the horizontal correlation intensity on the side of the upper opposed pixel is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the first original pixel and the opposed pixel to the horizontal correlation intensity in the predetermined regions centered around the opposed pixel. The horizontal correlation intensity on the side of the lower opposed pixel is a value obtained by adding the sum of horizontal correlation intensities in predetermined regions centered around the original pixels between the second original pixel and the opposed pixel to the horizontal correlation intensity in the predetermined region centered around the opposed pixel. 
   Description is made of horizontal correlation intensities Hl 1 , Hl 2 , Hr 1 , and Hr 2  used for respectively calculating correlation values L 1 , L 2 , R 1 , and R 2  shown in  FIG. 6 . 
   Hl 1  is expressed by the following equation (36), letting AL 1  be a horizontal correlation intensity in a predetermined region centered around the upper opposed pixel D 12  and letting BL 1  be a horizontal correlation intensity in a predetermined region centered around the lower opposed pixel D 24 :
 
 Hl   1 =MAX[ AL 1, BL 1]=MAX[{(|− d 03+2 *d 02− d 01|)+2(|− d 13+2 *d 12− d 11|)+(|− d 23+2 *d 22− d 21|)}, {(|− d 13+2 *d 14− d 15|)+2(|− d 23+2 *d 24− d 25|)+(|− d 33+2 *d 34− d 35|)}]  (36)
 
   That is, the horizontal correlation intensity on the side of the upper opposed pixel D 12  is equal to the horizontal correlation intensity AL 1  in the predetermined region centered around the upper opposed pixel D 12 , and is represented by the sum of a secondary differential value (|−d 03 +2*d 02 −d 01 |) in the horizontal direction corresponding to the pixel D 02  just above the opposed pixel D 12 , a value which is two times a secondary differential value (|−d 13 +2*d 12 −d 11 |) in the horizontal direction corresponding to the opposed pixel D 12 , and a secondary differential value (|−d 23 +2*d 22 −d 21 |) in the horizontal direction corresponding to the pixel D 22  just below the opposed pixel D 12 . 
   The horizontal correlation intensity on the side of the lower opposed pixel D 24  is equal to the horizontal correlation intensity BL 1  in the predetermined region centered around the lower opposed pixel D 24 , and is represented by the sum of a secondary differential value (|−d 13 +2*d 14 −d 15 |) in the horizontal direction corresponding to the pixel D 14  just above the opposed-pixel D 24 , a value which is two times a secondary differential value (|−d 23 +2*d 24 −d 25 |) in the horizontal direction corresponding to the opposed pixel D 24 , and a secondary differential value (|−d 33 +2*d 34 −d 35 |) in the horizontal direction corresponding to the pixel D 34  just below the opposed pixel D 24 . 
   Furthermore, Hl 2  is expressed by the following equation (37) in accordance with the basic idea of the above-mentioned calculation method, letting AL 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 12 , AL 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 11 , BL 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 24 , and BL 2  be a horizontal correlation intensity in a predetermined region centered around a pixel  25 :
 
 Hl   2 =MAX[ AL 1+ AL 2, BL 1+ BL 2]=MAX[{ AL 1+(|− d 02+2 *d 01− d 00 |)+2(|− d 12+2 *d 11− d 10|)+(|− d 22+2 *d 21− d 20|)}, { BL 1+(|− d 14+2 *d 15− d 16|)+2(|− d 24+2 *d 25− d 26|)+(|− d 34+2 *d 35− d 36|)}]  (37)
 
   Hr 1  is expressed by the following equation (38), letting AR 1  be a horizontal correlation intensity in a predetermined region centered around an upper opposed pixel D 14  and letting BR 1  be a horizontal correlation intensity in a predetermined region centered around a lower opposed pixel D 22 :
 
 Hr   1 =MAX[ AR 1, BR 1]=MAX[{(|− d 03+2 *d 04− d 05|)+2(|− d 13+2 *d 14− d 15|)+(|− d 23+2 *d 24− d 25|)}, {(|− d 13+2 *d 12− d 11|)+2(|− d 23+2 *d 22− d 21|)+(|− d 33+2* d 32− d 31|)}]  (38)
 
   Furthermore, Hr 2  is expressed by the following equation (39) in accordance with the basic idea of the above-mentioned calculation method, letting AR 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 14 , AR 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 15 , BR 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 22 , and BR 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 21 :
 
 Hr   2 =MAX[ AR 1+ AR 2, BR 1+ BR 2]=MAX[{ AR 1+(|− d 04+2 *d 05− d 06|)+2(|− d 14+2 *d 15− d 16|)+(|− d 24+2 *d 25− d 26|)}, { BR 1+(|− d 12+2 *d 11− d 10|)+2(|− d 22+2 *d 21− d 20|)+(|− d 32+2 *d 31− d 01|)}]  (39)
 
   [4] Comparison between First Proposed Method and Second Proposed Method 
   Suppose a case where the pixel values of pixels peripheral to an interpolation pixel X are pixel values as shown in  FIG. 14 . In  FIG. 14 , a black circle indicates black (a pixel value 0), and a white circle indicates white (a pixel value 1). Pixel data d 13  and d 23  on pixels D 13  and D 23  are respectively 0 and 25, pixel data d 14  and d 22  on pixels D 14  and D 22  are 0.5, and pixel data d 15  and d 21  on pixels D 15  and D 21  are 0.75. In the example shown in  FIG. 14 , the pixel data x on the interpolation pixel X in the first proposed method will be compared with that in the second proposed method. 
   In both the first proposed method and the second proposed method, a first edge component E, a second edge component Es, dmax (the larger one of d 13  and d 23 ), dmin (the smaller one of d 13  and d 23 ), dc (the average of dmax and dmin), the minimum xa in a settable range S, and the maximum xb in the settable range S are as follows:
 
 E=−d 03+ d 13+ d 23− d 33=−0+0.25+0.25−0=0.5
 
 Es=|d 03+ d 13− d 23− d 33|=|0+0.25−0.25−0|=0
 
 d min=0.25 , d max=0.25 , dc= 0.25
 
 xa=dc−Es×γs =0.25−0×γ s =0.25
 
 xb=dc+Es×γs+E×γ= 0.25+0×γ s+ 0.5×γ=0.25+0.5×γ
 
0.25≦= S≦= 0.5 when γ=0.5
 
   In the first proposed method, Hr and Vr used for respectively calculating the correlation values in the direction of the arrow indicated by the broken line in  FIG. 13  and the correlation value xd are as follows:
 
 Hr =MAX[2(|0.25−0.5|+|0.5−0.75|)+|0.25−0|, |0.25−0|+2(|0.25−0.5|+|0.5−0.75|)]=1.25
 
 Vr =MIN(|0.5−0|+|0.5−0|, |0.5−0|+|0.5−0|)=1.0
 
 xd=x max− x min+β1 ×Hr−β 2 ×Vr =(0.5−0.5)+1.25×β1−1.0×β2=1.25×β1−1.0×β2
 
   Furthermore, in the first proposed method, Hl and Vl used for respectively calculating the correlation values in the direction of the arrow indicated by the solid line in  FIG. 13  and the correlation value xd are as follows:
 
 Hl =MAX[|0.25−0.5|+|0.5−0.75|+2(|0.25−0|), |0.25−0.5|+|0.5−0.75|+2(|0.25−0|)]=1.0
 
 Vl =MIN(|0.5−0|, |0.5−0|)=0.5
 
   
     
       
         
           
             
               
                 xd 
                 = 
                 
                   
                     x 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     max 
                   
                   - 
                   
                     x 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     min 
                   
                   + 
                   
                     β 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     1 
                     × 
                     H1 
                   
                   - 
                   
                     β2 
                     × 
                     V1 
                   
                 
               
             
           
           
             
               
                 = 
                 
                   
                     ( 
                     
                       0 
                       - 
                       0 
                     
                     ) 
                   
                   + 
                   
                     1.0 
                     × 
                     β1 
                   
                   - 
                   
                     0.5 
                     × 
                     β2 
                   
                 
               
             
           
           
             
               
                 = 
                 
                   
                     1.0 
                     × 
                     β1 
                   
                   - 
                   
                     0.5 
                     × 
                     β2 
                   
                 
               
             
           
         
       
     
   
   When β2&lt;(β1/2) is set, the correlation value in the direction of the arrow indicated by the solid line is the minimum. Consequently, xmin=xmax=0 in  FIG. 5 . In the case shown in  FIG. 13 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   b , so that the pixel data x is xa=0.25 (a value close to black) whereby a fractured portion occurs in a white diagonal line. 
   On the other hand, in the second proposed method, Hr and Vr used for respectively calculating correlation values in the direction of an arrow indicated by a broken line in  FIG. 13  and the correlation value xd are as follows: 
                 Hr   =     MAX   [     |       -   0     +     2   ×   0     -   0     |         +   2     ⁢     (     |       -   0.25     +     2   ×   0.5     -   0.75     |     )       +                       |       -   0.25     +     2   ×   0     -   0     |     ,     |       -   0.25     +     2   ×   0     -   0     |   +                     2   ⁢     (     |       -   0.25     +     2   ×   0.5     -   0.75     |     )       +     |       -   0     +                         2   ×   0     -   0     |     ]     =   0.25                 Vr =MIN(|0.5−0|+|0.5−0|, |0.5−0|+|0.5−0|)=1.0   xd=x max− x min+β1 ×Hr−β 2 ×Vr =(0.5−0.5)+0.25×β1−1.0×β2=0.25×β1−1.0×β2 
   Furthermore, in the second proposed method, Hl and Vl used for respectively calculating correlation values in the direction of an arrow indicated by a solid line in  FIG. 13  and the correlation value xd are as follows:
 
 Hl =MAX[|−0+2×0−0|+2(|−0.25+2×0−0|)+|−0.25+2×0.5−0.75|, |−0.25+2×0.5−0.75|+2(|−0.25+2×0−0|)+|−0+2×0−0|]=0.5
 
 Vl =MIN(|0.5−0|, |0.5−0|)=0.5
 
   
     
       
         
           xd 
           = 
           
             
               
                 x 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 max 
               
               - 
               
                 x 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 min 
               
               + 
               
                 β1 
                 × 
                 H1 
               
               - 
               
                 β2 
                 × 
                 V1 
               
             
             = 
             
               
                 
                   ( 
                   
                     0 
                     - 
                     0 
                   
                   ) 
                 
                 + 
                 
                   0.5 
                   × 
                   β1 
                 
                 - 
                 
                   0.5 
                   × 
                   β2 
                 
               
               = 
               
                 
                   0.5 
                   × 
                   β1 
                 
                 - 
                 
                   0.5 
                   × 
                   β2 
                 
               
             
           
         
       
     
   
   Therefore, the correlation value in the direction of the arrow indicated by the broken line is the minimum irrespective of the values of β1 and β2. Consequently, xmin=xmax=0.5 in  FIG. 5 . In the case shown in  FIG. 13 , therefore, the relationship between the correlation value and the pixel data x corresponds to  FIG. 5   a , so that the pixel data x is xb=0.5, whereby no fractured portion occurs in a white diagonal line. 
   [3] Description of Third Embodiment 
   Description is now made of an image interpolating method according to a third embodiment of the present invention (hereinafter referred to as a third proposed method). 
   The third proposed method is approximately the same as the second proposed method except for only methods of respectively calculating horizontal correlation intensities Hl, Hr, Vl, and Vr used in calculating diagonal correlation values L and R. 
   In the third proposed method, each of the horizontal correlation intensities Hl and Hr is defined as the sum of a horizontal correlation intensity on the side of an upper opposed pixel and a horizontal correlation intensity on the side of a lower opposed pixel. The definition of the horizontal correlation intensity on the side of the upper opposed pixel and the horizontal correlation intensity on the side of the lower opposed pixel is the same as that in the second proposed method. 
   Description is made of horizontal correlation intensities Hl 1 , Hl 2 , Hr 1 , and Hr 2  used for respectively calculating correlation values L 1 , L 2 , R 1 , and R 2  shown in  FIG. 6 . 
   Hl 1  is expressed by the following equation (40), letting AL 1  be a horizontal correlation intensity in a predetermined region centered around an upper opposed pixel D 12  and letting BL 1  be a horizontal correlation intensity in a predetermined region centered around a lower opposed pixel D 24 :
 
 Hl   1   =[AL 1+ BL 1]=[{(|− d 03+2 *d 02− d 01|)+2(|− d 13+2 *d 11|)+(|− d 23+2 *d 22− d 21|)}+{(|− d 13+2* d 14− d 15|)+2(|− d 23+2 *d 24− d 25|)+(|− d 33+2 *d 34− d 35|)}]  (40)
 
   Furthermore, Hl 2  is expressed by the following equation (41), letting AL 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 12 , AL 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 11 , BL 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 24 , and BL 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 25 :
 
 Hl   2   =[AL 1+ AL 2+ BL 1+ BL 2]=[{ AL 1+(|− d 02+2 *d 01− d 00|)+2(|− d 12+2 *d 11− d 10|)+(|− d 22+2 *d 21− d 20|)}+{ BL 1+(|− d 14+2 *d 15− d 16|)+2(|− d 24+2 *d 25− d 26|)+(|− d 34+2 *d 35− d 36|)}]  (41)
 
   Hr 1  is expressed by the following equation (42), letting AR 1  be a horizontal correlation intensity in a predetermined region centered around an upper opposed pixel D 14  and letting BR 1  be a horizontal correlation intensity in a predetermined region centered around a lower opposed pixel D 22 :
 
 Hr   1   =[AR 1+ BR 1]=[{(|− d 03+2 *d 04− d 05|)+2(|− d 13+2 *d 14− d 15|)+(|− d 23+2 *d 24− d 25|)}+{(|− d 13+2 *d 12− d 11|)+2(|− d 23+2 *d 22− d 21|)+(|− d 33+2 *d 32− d 31|)}]  (42)
 
   Furthermore, Hr 2  is expressed by the following equation (43), letting AR 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 14 , AR 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 15 , BR 1  be the horizontal correlation intensity in the predetermined region centered around the pixel D 22 , and BR 2  be a horizontal correlation intensity in a predetermined region centered around a pixel D 21 :
 
 Hr   2   =[AR 1+ AR 2+ BR 1+ BR 2]=[{ AR 1+(|− d 04+2 *d 05− d 06|)+2(|− d 14+2 *d 15− d 16|)+(|− d 24+2 *d 25− d 26|)}+{ BR 1+(|− d 12+2 *d 11− d 10|)+2(|− d 22+2 *d 21− d 20|)+(|− d 32+2 *d 31− d 01|)}]  (43)
 
   In the third proposed method, each of the vertical correlation intensities Vl and Vr is defined as the sum of a vertical correlation intensity on the side of the upper opposed pixel and a vertical correlation intensity on the side of the lower opposed pixel. The vertical correlation intensity on the side of the upper opposed pixel is a secondary differential value in the vertical direction corresponding to the opposed pixel, and the vertical correlation intensity on the side of the lower opposed pixel is a secondary differential value in the vertical direction corresponding to the opposed pixel. 
   Description is made of the vertical correlation intensities Vl 1  and Vr 1  used for respectively calculating the correlation values L 1  and R 1  shown in  FIG. 6 . 
   The vertical correlation intensity Vl 1  is expressed by the following equation (44):
 
Vl 1 =(|− d 02+2 *d 12− d 22|+|− d 14+2 *d 24− d 34|)  (44)
 
   Furthermore, the vertical correlation intensity Vr 1  is expressed by the following equation (45):
 
Vr 1 =(|− d 04+2 *d 14− d 24|+|− d 12+2 *d 22− d 32|)  (45)
 
   [6] As to Modified Examples of First Proposed Method and Second Proposed Method 
   In the first proposed method or the second proposed method, a diagonal correlation intensity, as described below, may be added in calculating diagonal correlation values L and R. 
   That is, the diagonal correlation intensity is the larger one of diagonal correlation values positioned above and below a diagonal line currently referred to. 
   In calculating the correlation value L in a direction of an arrow indicated by a broken line in  FIG. 15 , for example, the diagonal correlation intensity is the larger one of a correlation value |d 02 −d 14 | on a diagonal line (D 02 −D 14 ) above a diagonal line indicated by the broken line and a correlation value |d 22 −d 34 | on a diagonal line (D 22 −D 34 ) below the diagonal line. 
   Although the present invention has been described and illustrated in detail, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, the spirit and scope of the present invention being limited only by the terms of the appended claims.
Assuming that an original pixel adjacent to a first original pixel and opposite to a second original pixel is a third original pixel, and an original pixel adjacent to the second original pixel and opposite to the first original pixel is a fourth original pixel, and letting d 1  be pixel data on the first original pixel, d 2  be pixel data on the second original pixel, d 3  be pixel data on the third original pixel, and d 4  be pixel data on the fourth original pixel, a first edge component E is calculated on the basis of an equation for operation E=−d 3 +d 1 +d 2 −d 4  in the first step, and a second edge component Es is calculated on the basis of an equation for operation Es=|d 3 +d 1 −d 2 −d 4|.