Abstract:
An interpolator for processing an image having, an array of pixels, the interpolator comprising a feature extractor for processing a pixel sequence contained in the array of pixels to extract visually significant features therein; a feature comparator for determining similarities between the extracted features in adjacent pixel sequences and; an alignment controller using said matched features to select visually most relevant source pixels to generate a target pixel.

Description:
[0001]    The present invention relates to the field of image displays, and more particularly to a system and method for improved interpolation in digitized image displays.  
         BACKGROUND OF THE INVENTION  
         [0002]    Traditional raster display devices such as television monitors, video displays have offered few display option features such as image zooming, picture-in-picture and such like. However with the increase in digitization of video images there is an expectation that raster display devices offer such features. In the case of image zooming, the resolution of the image being displayed is seldom limited by the raster display resolution capabilities, but by the source image pixel resolution. Accordingly, many techniques have been implemented to improve the perceived resolution of digitized images, both to support the additional features demanded by users and to improve the overall clarity of the perceived image to the user.  
           [0003]    A digitized image consists of a rectangular array of pixels having Rs row pixels and Cs column pixels. During image enlargement the information in a source image is used to create a now target image having RT row pixels and CT column pixels where typically Rs         RT and Cs         CT. That is, more pixels per row and per column are needed to satisfy the requirement of the new target image. Target pixels are usually generated by using interpolation, look-up tables or other known techniques.  
           [0004]    Referring to FIG. 1 there is shown a two-dimensional array of source pixels (circles) and an anticipated target pixel (x) to be generated in a target row between successive rows of the source pixels. One way to generate the target pixel x would be to take one quarter of the value of the immediate neighbors and sum the result. However, it is difficult to decide on the ideal combination of source pixels and their associated weights. “Ideal” in this case depends on the strategy, rule, algorithm or method implemented to ensure that the enlarged image is most visually pleasing.  
           [0005]    Often when computing the target pixel, in the absence of more suggestive information about the nature of the pixel data in a row, an assumption is made that the source pixels that are physically close to one another contain information that is the most similar. And, by extension, it is often assumed that the closer the source pixel is to the target, the more meaning it can impart on the final value of the target pixel&#39;s intensity. For example U.S. Pat. No. 5,703,968 describes a method and apparatus for detecting and computing the level difference between pairs of pixels surrounding the target pixel on an upper and lower line. The level differences are compared with each other and a line having a smallest level difference is detected an effective interpolation line information is generated. Similarly, in U.S. Pat. No. 5,991,463 there is described a multi point “filter” interpolator, or four-tap filter wherein interpolated unsampled target pixels are calculated as a function of four source pixels and a parameter representing the distance of the desired pixel from a source pixel.  
           [0006]    This technique is limited however when applied to a solid diagonal line that has been digitized and displayed on a raster-imaging device. Closer inspection of the components that comprise the diagonal line reveals that the line is made up of a series of shifted horizontal line segments as shown in FIG. 2( a ). In many applications, and in image enlargement in particular, it is very important to identify the horizontal (vertical) offset between rows (columns) so the data in the image can be properly interpreted.  
           [0007]    Although the problem of maintaining the perceived resolution of an image using a correlation-based algorithm is applicable to progressive scan and interlaced images, its proper use most strongly influences the quality of an image when an image is interlaced such as is the case in interlaced video. For instance, an interlaced image frame of 2N lines has two fields of N lines per field. When the image content is static in both fields, the effective resolution is 2N lines. But when the image content is in motion, the effective resolution drops to N lines in general, due to the temporal latency between fields. In regions where the image content contains less detail, the loss in resolution is less perceptually significant. In regions where the image content has detail, i.e. where the correlation function between row or column pixel data is sensitive to a spatial displacement the reduction in perceived resolution can be quite noticeable.  
           [0008]    For example as shown schematically in FIG. 2( a ), if we were to interpolate vertically by taking a linear combination of the pixel immediately above and immediately below the gaps between the lines in FIG. 2( a ), we would end up with a deinterlaced (or scaled) image as shown in FIG. 2( b ). Clearly this is an unacceptable image quality. Thus, the different ways in which data is interpolated has a large impact on the perceived resolution of the image.  
           [0009]    Accordingly, there is a need for a system and method that allows the deinterlacing of images for enlargement while maintaining its perceived resolution when redisplayed.  
         SUMMARY OF THE INVENTION  
         [0010]    The present invention seeks to provide a method of interpolation for maintaining the perceived resolution of a digitized image when the image is enlarged.  
           [0011]    In accordance with the invention there is provided an interpolator for processing an image having an array of pixels, the interpolator comprising a feature extractor for processing a pixel sequence contained in the array of pixels to extract visually significant features therein; a correlator for determining similarities between the extracted features in adjacent pixel sequences and; an alignment controller for generating a position of a target pixel based on the output of the correlator, such that the interpolated target pixel is generated from the visually most relevant source pixel data.  
           [0012]    In a preferred embodiment the feature extractor is implemented with a state machine. The features are identified by observing pixel sequences of row or column pixel data. The method of interpolation is similar to identifying regions of correlation between pixels, but it does so by first extracting features and then determining whether those features belong together. The similarity, or correlation, between extracted features is due to a visually significant structure, such as a for example, a line, edge or ramp, of arbitrary orientation.  
           [0013]    The interpolation process uses feature-based comparison to maximum visual benefit and includes a process for identifying and storing specific characteristics of an image for later use. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0014]    An embodiment of the present invention will now be described by way of example only with reference to the following drawings in which:  
         [0015]    [0015]FIG. 1 is a schematic diagram of a pixel array;  
         [0016]    FIGS.  2 ( a ) and ( b ) are schematic diagrams of a digitized diagonal line;  
         [0017]    [0017]FIG. 2( c ) is an interpolated image of the line using a vertical filter interpolator according to the prior art;  
         [0018]    [0018]FIG. 3 is a flowchart of the process of interpolation according to the present invention;  
         [0019]    [0019]FIG. 4 is a schematic diagram of the digitized diagonal line of FIG. 2( a ) generated in accordance with an interpolation process of the present invention;  
         [0020]    [0020]FIG. 5 is a schematic diagram showing increasing intensity values in a pixel sequence characterizing an upward ramp feature;  
         [0021]    FIGS.  6 ( a ) and ( b ) are schematic diagrams of a flow chart and bubble diagram for a state machine for processing an upward ramp feature;  
         [0022]    [0022]FIG. 7 is a schematic diagram showing intensity values in a pixel sequence characterizing a level segment feature;  
         [0023]    FIGS.  8 ( a ) and ( b ) are schematic diagrams of a flow chart and bubble diagram for a state machine for processing a level segment feature;  
         [0024]    FIGS.  9 ( a ) and ( b ) show a flow chart and bubble diagram for implementing downward  
         [0025]    FIGS.  10 ( a ) and ( b ) are graphical representations of an intensity profile in adjacent lines of pixels in an image;  
         [0026]    [0026]FIG. 11 is a flow chart showing a matching algorithm;  
         [0027]    [0027]FIG. 12 is a schematic diagram showing the interpolating process using a pivot pixel;  
         [0028]    [0028]FIG. 13 is a schematic diagram showing sub-pixel interpolation using a target pixel;  
         [0029]    [0029]FIG. 14 is a flow chart showing a process for computing relative shifts; and  
         [0030]    [0030]FIG. 15 is a schematic diagram of an interpolator according to an embodiment of the present invention.  
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0031]    In the following description like numerals refer to like structures in the drawings. The schematic diagram of a pixel array shown in FIG. 1 will be used in the following description to more clearly illustrate the concepts of the subject invention Referring now to FIG. 3 there is shown a generally at  300  a block diagram of an interpolator according to an embodiment of the present invention. The interpolator  300  comprises a feature extractor  302  for identifying visually significant features in a pixel sequence contained in an array of pixels  304  and based on predetermined threshold criteria  308 , a feature comparator  306  for generating a correlation between the extracted features in adjacent rows or columns of pixels and an alignment controller  310  for determining pixels to be used in generating the target pixel T based on the output of the feature comparator  306 , such that correlation is used to maximum visual benefit in computing the value of the target pixel. In the following description each component of the interpolator  300  is described in detail along with worked examples of their operation.  
         [0032]    Referring back to FIG. 2( a ) there is shown a schematic diagram of a portion of an image  200  containing a solid diagonal line that has been digitized and displayed on a raster-imaging device shown schematically in FIG. 2( b ) The image generally consists of an N by M pixel array. Closer inspection of the component pixels that comprise the diagonal line reveals that the line is made up of a series of shifted horizontal line segments  202 ,  203 ,  204  and  206 . In many applications, and in image enlargement in particular, gaps between the lines have to be filled-in. It is important to identify the horizontal (or vertical) offset between rows (or columns) so the data in the image can be properly interpreted by the viewer. During interpolation, for example, the perceived resolution will be better if the orientation of the line is known and an interpolation filter is aligned to take advantage of the image or feature orientation.  
         [0033]    The present invention provides an improved interpolation system that uses pixels whose information content is the most alike, and not necessarily pixels that are physically close. Accordingly, if a filter is applied to the original pixel with an understanding that pixels in subsequent rows are misaligned by five pixels horizontally, computing the intermediate row by interpolation results in the image shown in FIG. 4. Clearly this directional interpolation method results in an image that recovers the digitized line more faithfully than the interpolation used to derive the image shown in FIG. 2( c ). The perceived resolution has been maintained during deinterlacing (enlargement). This requires that the relative shift in the feature of interest in the image is determined. That is, pixels whose content is alike, or more precisely, belong to the same feature, must be identified and connected during interpolation. In order for this to happen, many difficult problems must be overcome and as will be described below.  
         [0034]    For the purposes of the present discussion we will assume that, as shown in FIG. 1, pixel data enters from the top right, P(0,3), and exits at the top left P(0,0). Once a row of pixel data has passed across the top row, it is re-circulated and appears on the second row, P(1,*), again entering from the far right, P(1,3), and exiting at the left, P(1,0). In this way, a row of pixel data, held in a line store register, becomes the next row of pixel data after a one-line delay.  
         [0035]    In order to generate the feature information, a difference circuit component  301  computes the change in intensity between adjacent pixels in the same row. That is, Δ=P(R i ,C j )−P(R i ,C j-1 ), where R i  is the  i th row and C j  is  j th column. Thus, for the first two pixels in row 1: Δ=P(0,1)−P(0,0).  
         [0036]    The value of Δ is used throughout the feature extraction process.  
         [0037]    The feature extractor  302  (FE), or as it is also known, Feature Identification, performs a process whereby specific characteristics of the image are identified and which may be recorded for later use. When enlarging an arbitrary image, the most important features in an image, on a line-by-line basis, are usually, but not limited to, a ramp (a succession of either increasing or decreasing intensities), edges (a large change in intensity, sometimes called a step) and a level segment (a series of successive intensities that are relatively constant). There are other features such as noise, spikes and so on, which can also be identified and stored for subsequent use.  
         [0038]    In one embodiment a state machine (SM) is used to detect a specific feature. The targeted feature for extraction is user-definable and, therefore, programmable, so alternative definitions of specific features can be changed in a dynamic manner. In the following description, we will restrict the discussion of feature extraction to a row of data, but it is acknowledged that the method described herein applies equally well to column data.  
         [0039]    In FIG. 2( b ) a single row of pixel data may be used to illustrate the operation of a state machine. The row of pixel intensity data  202  in FIG. 2( a ) has three components: a downward segment (white to black ramp), a level segment (Black-Black) and an upward segment (black to white). Here the terms “downward” and “upward” are merely used to describe increases or decreases in pixel intensity. A state machine is used to extract specific portions of the intensity data. Separate state machines are used to identify specific features such as level segments and upward ramps. Other segments may also be identified, however, for illustrative purposes, the following discussion will be limited to the segment types described above.  
         [0040]    The state machine uses basic hardware components such as adders and comparators to perform the feature extraction operations. The state machine flow control decisions use these components in any way, thereby rendering the state machine fully programmable. Thus, alternative flow control algorithms can be programmed in the state machine to look for level segments, or other features of interest, in a flexible manner.  
         [0041]    In general, if N different features are to be identified, N state machines are required, although depending on the precise definition of the features will need to be identified, fewer state machine may be needed. The state machines are independent and operate concurrently so the approach lends itself to easy expandability. Adding more state machines, as required, it easy within the current framework provided it is accompanied by the necessary hardware. This approach also lends itself easily to a software implementation.  
         [0042]    Referring to FIG. 5 there is shown a sequent of pixels  510  and a trajectory of its intensities  506  characterizing an upward ramp. The trajectory  506  is bounded above and below by thresholds  502  and  504 . These thresholds are user-defined. For the purposes of discussion, we can define an upward ramp so that it must satisfy the constraints:  
         [0043]    a. successive intensities must be increasing by a positive minimum threshold;  
         [0044]    b. the above must bold for some minimum number of pixels;  
         [0045]    c. there may be a finite number of exceptions to (a)  
         [0046]    d. the trajectory of intensities must be contained within an upper and a lower threshold; and  
         [0047]    e. there may be a finite number of exceptions to (d).  
         [0048]    Referring to FIG. 6( a ), there is shown a flow chart of state machine for implementing an upward ramp  506 .  
         [0049]    Nu is a user-defined parameter that sets the maximum number of violations permissible before the candidate upward segment is rejected. A violation, in the context of the flowchart, is a set of pixels that do not meet the criterion: p(i)−p(i−1)&gt;Tup; Tup is a user-defined parameter that defines the threshold value for a upward step;  
         [0050]    Referring to FIG. 6( b ), there is shown a bubble diagram for implementing the flow chart of FIG. 6( a ). The states have the following behaviour for the upward ramp state machine.  
         [0051]    State 0  
         [0052]    N=0  
         [0053]    Ps=p(i)  
         [0054]    is=i  
         [0055]    State 1  
         [0056]    i=i+1  
         [0057]    State 2  
         [0058]    Save the values that correspond to the starting point (is,ps) and ending point (ie,pe) where ie=i−1 and pe=p(i−1) before returning to state 0.  
         [0059]    Note that Nu is the number of consecutive upward steps needed to qualify as a ramp. Tup is the size of each step.  
         [0060]    In a similar way in which the ramp was defined above, we can define a level segment. Although there is no unique way to define a Level segment, an example of one definition is given below.  
         [0061]    Referring to FIG. 7( a ) there is shown a typical row of pixels defining level sequent  702 , and accompanied by a threshold plot  704 . In general, a level segment may be determined by applying the following list of criteria:  
         [0062]    (a) the locus of intensities (the intensity trajectory) following a staring point (ps) must lie within a band defined by (ps−TV,ps+TV) for at least NL pixels, where ps is the potential start location of the level segment; TV is a user-defined violation threshold (typically this is set to about three and is useful to counter the effects of noise);  
         [0063]    (b) there may be at most NT violations of the band threshold. Here NT is a user-defined threshold that places a maximum number of threshold violations of condition (a);  
         [0064]    (c) there may be no more than NCT consecutive intensity values beyond the threshold band defined in (a). NCT is a user-defined threshold that places a maximum number of consecutive allowable violations before the candidate level segment is rejected; and  
         [0065]    (d) if at any time the trajectory of intensities ventures beyond the confines of the threshold band defined by (ps−TD,ps+TD) the candidate level-segment is ended. TD is a user-defined threshold defining the permissible region in which a level segment must lie as defined by ps before it is rejected (disqualified).  
         [0066]    The band defined in (a) above provides the ability to build in a flexible forgiveness factor. This is useful in the event the intensity values are corrupted by noise and more noise immunity is required. If the locus of intensities has satisfied all constraints, then a Level feature is deemed to have occurred. Its starting (is) and ending (ie) locations and starting and end intensities (ps) and (pe) are stored for later analysis.  
         [0067]    Referring to FIGS.  8 ( a ) and ( b ), there is shown a flow diagram  800  and a bubble diagram  810  for implementing a Level segment feature extraction according to an embodiment of the present invention In FIG. 8( b ), the following operations take place in each of the states:  
         [0068]    State 0  
         [0069]    Cv=0  
         [0070]    Ps=p(i)  
         [0071]    is=i  
         [0072]    State 1, 2, and 3  
         [0073]    i=u+1  
         [0074]    State 4  
         [0075]    Cv=Cv+1  
         [0076]    State 5  
         [0077]    Store the starting point location and ending locations is and ie, and the respective starting and ending pixel intensities ps and pe.  
         [0078]    Referring to FIGS.  9 ( a ) and  9 ( b ), there is shown a flow chart and bubble diagram for an algorithm executed by a state machine used to detect the presence of a downward segment. The following parameters are used in the diagrams.  
         [0079]    NV is a user-defined parameter that sets the maximum number of violations permissible before the candidate downward segment is rejected. A violation, in the context of the flowchart, is a set of pixels that do not meet the criterion: p(i)−p(i−1)&gt;Tdown;  
         [0080]    Cv is the count that contains the current number of violations.  
         [0081]    Tdown is a user-defined parameter that defines the threshold value for a downwards step;  
         [0082]    Ndown is a variable that contains the number of downwards steps taken in the current candidate downward segment.  
         [0083]    The upward trend state machine uses the same logic, except the polarity of the thresholds and comparisons is reversed.  
         [0084]    The states in FIGS.  9 ( a ) and  9 ( b ), have the following behaviour for the downward ramp state machine.  
         [0085]    State 0  
         [0086]    N=0  
         [0087]    Ps=p(i)  
         [0088]    is=i  
         [0089]    State 1  
         [0090]    i=i+1  
         [0091]    State 2  
         [0092]    Save the values that correspond to the starting point (is,ps) and ending point (ie,pe) where ie=i−1 and pe=p(i−1) before returning to state 0.  
         [0093]    Note that Nd is the number of consecutive downward steps needed to qualify as a ramp. The magnitude of Tdown is the size of each step.  
         [0094]    The operation of the interpolator  300 , can be more clearly understood by referring to a specific example. Referring to FIGS.  10 ( a ) and  10 ( b ), there is shown a series of pixel intensities that correspond to image segments in FIG. 2( b ).  
         [0095]    The Feature Extractors (FE)  302  processes pixel data arranged in a two-dimensional array or matrix having elements P(ij). Each row in the matrix is denoted by P(i,*),—a one-dimensional sequence of intensities similar to those shown in FIG. 2( b ).  
         [0096]    The Feature Extractors  302  log the Downward, Level and Upward segments to a feature table (Table 1) for rows 1 and 2, where the number represent intensity values on an arbitrary scale of 0 to 255.  
                                                                                         TABLE 1                                   S1   E1   S2   E2   S3   E3   S4   E4                                    Intensity   255    5    5    5    5   255    —   —       (Row 1)       Intensity   255   255    255     5    5    5    5   255       (Row 2)       Position    6   19   19   25   25   42   —   —       (Row 1)       Position    3   17   17   30   30   36   36    53       (Row 2)                  
 
         [0097]    The elements in the table comprise a pair-wise grouping of numbers (start position S1, start intensity E1) and (end position S2, end intensity E2) in Table 1 correspond to a feature that has been extracted and logged to the Feature Table. For example in row 1, positions 7 through 20 correspond to a downward ramp. Each time a feature is identified in the source data, it is logged to the Feature Table. Should the Feature Table become full, a “Feature Table Full” flag will be set. Usually, eight (8) bits are needed to represent intensity data and eleven (11) bits are needed for the pixel positioning. These numbers are format dependent in general.  
         [0098]    Once the feature table is compiled, the Feature Comparator  306  attempts to match like features held in two adjacent rows in the Feature Table 1.  
         [0099]    After the first row of pixel data has passed, all features of interest have been extracted and logged to the Feature Table. Immediate thereafter, the second row of pixel data arriving at P(0,2) is examined and the features it contains are extracted. And at the same time, the Feature Comparator  306  is attempting to match like features. If a match is found, it is stored in a Matched Table (Table 2). The information in the Matched Table is used later on by the Alignment Controller  310 .  
         [0100]    The operation of the Feature Comparator  306  maybe understood by comparing the set of intensities FIG. 10( a ) with those of FIG. 10( b ). FIG. 10( b ) shows the intensity profile on row 2 which is one line store in advance (earlier in time) of row 1. Table 2 shown the corresponding extracted feature information.  
         [0101]    The Feature Comparator  306  implements an algorithm that attempts to determine whether rows ‘0’ and ‘1’ are correlated, and further, which segments or features belong together (constitute a match). Clearly the pixel data in row ‘0’ and row ‘1’ is correlated, since their intensity profiles are very similar except for the horizontal positional shift. Some restrictions may be placed on the search so that only segments within a window of N pixels are compared.  
         [0102]    Referring to FIG. 11, there is shown a flow chart of a matching algorithm  1160  according to one embodiment of the present invention. The matching algorithm may be described as follows: Let P(0,i), P(1,j), I(0,i) and I(1,j) represent the pixel position and pixel intensities for rows 0 and 1, respectively. Let the window N size that limits the search region be equal to twenty five (25) pixel. Then the possible matches for the segment (S1,E1) from row 1 are (S1,E1), (S2,E2) and (S3,E3) from row 2 as S1(row 1)-S2(row 2)&lt;25. To determine whether a match exists, each pair of intensities must match to within a chosen tolerance T. If T=20, then clearly, abs[I(0,0)-I(1,0)] and abs[I(0,1)-I(1,1)]&gt;T so no match exits for these segments. The next candidate segments for reveals that abs[I(0,1)-I(1,1)] and abs[I(0,2)-I(1,2)]&lt;T so there is a match.  
         [0103]    To ensure that the nearest matched pair has been found, another search must take place over the alternate row keeping the segment in row 2 constant and finding the nearest matching segments in row 1. If another match is found, then the nearest positional match is deemed the match.  
         [0104]    It is not difficult to extend the matching algorithm to include three rows (columns) of pixel data. In addition, a predictive circuit can be employed that estimates the next correlated feature based on the previous two matches.  
         [0105]    The matching indices are stored in the Matched Table as shown in Table 2. Table 2 contains paired indices of matching segments for Table 1.  
                                       TABLE 2                           Position Row 1    6   19   19   25   25   44       Position Row 2   17   30   30   36   36   53                  
 
         [0106]    The matching algorithm finds the initial bearing of the segments in the Feature Table. It must be run at the onset of new row data or when the trend bearing is lost. Once the bearing has been established, it is possible to match segments without resorting to a two-sided iterative search. As long as trend segments are properly tracked, the bearing portion of the match need not be invoked. Matched segments are removed from consideration in subsequent matching.  
         [0107]    In general, Table 2 will contain one extra bit of information indicating whether or not a region corresponds to a non-transition segment and possibly information needed for sub-pixel interpolation. Sub-pixel interpolation is explained later. In our example, such an overlap is absent.  
         [0108]    Once the features in adjacent rows are matched, an alignment controller (AC)  310  computes the sequence of relative horizontal shifts that are needed between adjacent rows in order to bring matched transition segments into alignment. The aligned segments may then be processed using one of many standard interpolation methods or filters to determine the value of the target pixel.  
         [0109]    After the trend bearing is found, and the Matched Table is populated, phase information is used to compute the relative shift needed to align matching transition segments. In order to understand how the alignment controller computes the sequence of relative shits, we will need to introduce two terms namely: Transition Segment and Pivot Pixel.  
         [0110]    A Transition Segment (TS) is a segment that exhibits changes in intensity that is not a Level. Thus upward or downward ramps or variations thereof may be characterized as Transition Segments. A matched Transition Segment is distinct from a non-Transition Segment in that it is only when such segments are actively participating in interpolation that the desired relative shift between rows is not necessarily zero. Alternatively, the desired alignment of a filter input is not necessarily vertical.  
         [0111]    The pivot pixel (PP) is a pixel in the matched segment that defines the beginning or end of a matched transition segment. For example, referring back to Table 2, the matching segments are A2 and B3. A2 is the pivot pixel position because I0(i)=1&lt;I1(j)=11.  
         [0112]    Referring to FIG. 12, there is shown a schematic diagram or a pair of adjacent lines of source pixel  1202  and  1204 . A line of target pixels  1206  is shown bounded on the top by the top pixel row  1202  and at the bottom by the bottom pixel row  1204 . As may be seen, in order to generate a value for successive target pixel, the pivot pixel is used repeatedly with the bottom row pixels until the pivot pixel in the bottom row has been shifted into alignment with the top row pivot pixel. Following alignment, the orientation of interpolator filter is maintained throughout the transition segment until either the next pivot pixel or a matched non-transition segment is encountered.  
         [0113]    The operation of the alignment may be described as follows. A straight line is cast from the pivot pixel (PP(i)) through a target pixel (x). The line intercepts the adjacent source row at a bounding pixel. The bounding pixel location will not always coincide with a source pixel. In order to generate the desired bounding pixel, a technique known as sub-pixel interpolation is used.  
         [0114]    Sub-pixel interpolation is used to generate an effective bounding source pixel where there is none. To generate such a pixel, interpolation is performed in a non-separable manner. This means that horizontal and vertical interpolation takes place concurrently. To better understand why sub-pixel interpolation is required consider the equation of a line originating at the pivot pixel PP(i) and which passes through a target pixel. The equation for this line is:  
           K   1 ( K   p )=( K   p   −K   0 )/φ+ K   0   , K   0             K   p           K 1 .  
         [0115]    Where K p  the column index of the target pixel, K 0  is the pivot pixel and K 1  is the end of the transition segment. Sub-pixel interpolation is needed when K 1 (K p ) is not an integer. The phase φ has a large influence on the value of K 1 (K p ). For example, referring to Table 1, the equation of the line that described the feature frontier is Y(K)=(K p −6)/11.  
         [0116]    Sub-pixel interpolation arises in two situations:  
         [0117]    i) when Y(1) is not an integer, and  
         [0118]    ii) when (K p ,φ) is too close to the target pixel boundary.  
         [0119]    Condition ii) is most dramatic when, for example, φ=0.5, and the number of pixels between K 0  and K 1  is a small even number. In what follows we will focus on i).  
         [0120]    Let φ be the phase between 0 and 1. Let K p  be the column position of the target pixel. Let us assume that matching segments have been shifted so the transitions regions are aligned to within one pixel . The target pixel can be thought of as lying anywhere within the four bounding pixels. The weights of the four bounding pixels must be chosen so that they coincide with the location of the target pixel.  
         [0121]    Given the pixels values P(1,1), P(1,2), P(2,1) and P(2,2), the phase φ, we want to compute the target by interpolation between P(1,1) and P(1,2) and between P(2,1) and P(2,2). Therefore, we must compute:  
         [0122]    Z 1 =(1−a)*P(1,1)+a*P(1,2)  
         [0123]    Z 2 =(1−b)*P(2,1)+b*P(2,2)  
         [0124]    Target=(1−φ)*Z 1 +φ*Z 2    
         [0125]    Where a and b are weights such that 0         a, b         1. These conditions will give a target pixel with twice the desired intensity. In addition, sub-pixel interpolation, as written above, is a two-step procedure. We can rewrite the above so that  
         Target=(1−φ)*((1 −a )* P (1,1)+ a*P (1,2))+φ*((1 −b )* P (2,1)+ b*P (2,2)).  
         [0126]    This is interpolation that takes one step. It allows the target pixel to reside anywhere within the four corner points (P(1,1), P(1,2), P(2,1), P(2,2)). In general, the weights a and b are related to the phase φ which can lead to simplifications, but there are still problems with which we must contend. Namely,  
         [0127]    i) additional run-time multiplies are required;  
         [0128]    ii) the resultant weights may no longer have unity gain.  
         [0129]    Two alternative solutions are suggested.  
         [0130]    A first alternative may use an existing low pass filter (on chip) to approximate the location of the target pixel. Then, by independently flipping the filter weights associated with pixels P(1,0) and P(1,1), P(2,1) and P(2,2), it is possible to reach a much larger region of potential target pixel locations. The phase φ will determine the tap weights, and K 1 (K p ) determines the horizontal intercept, which in turn, determines whether the weights should be flipped. Flipping the weights requires multiplexors.  
         [0131]    A second alternative is similar to the first alternative, but it employs a dedicated m by n coefficient matrix whose entries act to quantize the square [0,1]×[0,1] into discrete cells. The fractional portion of the shift, i.e. K1(Kp)−└K1(Kp)┘, where └t┘ is the largest integer less than t, and the phase φ are used to address the coefficient cell in which the target resides. Table 3 shows a small table of coefficients that can be used for sub-pixel interpolation.  
                                     TABLE 3                           Sub-pixel interpolation weights with pivot pixel located at w0 for       φ = 0.5.            Index   w 0     w 1     w 2     w 3                 0   4/8   0   4/8   0       1   4/8   0   1/8   3/8       2   4/8   0   2/8   2/8       3   4/8   0   3/8   1/8       4   4/8   0   0   4/8                  
 
         [0132]    The weights w 0 , w 1 , w 2  and w 3  in Table 3 coincide with pixels P(1,1), P(1,2), P(2,1) and P(2,2) in FIG. 1. The index entry in Table 3 and FIG. 13 shows how to attain various targets. Due to a horizontal shift the pixels P(2,1) and P(2,2) may actually correspond to P(2,1+R) and P(2,2+R) for R&gt;0.  
         [0133]    The second alternative is preferred because it provides more control over the exact location of the target.  
         [0134]    In conjunction with Table 3, we can see how the weights and pivot pixel P(0,0) are used in sub-pixel interpolation. The pivot pixel provides the total contribution for row 1. The phase of the target pixel is 180 degrees because w 0 +w 1 =w 2 +w 3 . Table 3 can be further reduced to three rows and half the number of columns by exploiting the property of skew symmetry. Added multiplexors will be required as a consequence to independently toggle the weights.  
         [0135]    The effect of phase is an important input into the Alignment Controller  310 . In this section two examples are given that demonstrate how to compute bounding and target pixels. We show how the relative shifts are generated with and without the use of sub-pixel interpolation.  
         [0136]    Let K p  be the current column index of the interpolated pixel. Let AS be the accumulated shift, S be the shift and TS be the total shift. In order to determine the shift required for a given K p , we must solve for Y(K p )=1. Then,  
           K   1 ( K   p )=( K   p   −K   0 )/φ+ K   0   , K   0             K   p             K   1    
         [0137]    Here K 1  is the beginning or end of the transition segment at row 2.  
       EXAMPLE 1  
       [0138]    Segment alignment  
         [0139]    In this example, K 0 =6, K 1 =17 so TS=17−6=11, φ=0.25; RS=TS=11, AS=0.  
                                                           TABLE 4                           Computation of relative shifts for Table 3 with φ = 0.5 (180 degrees)                K p     S   RS   AS                            6   0   11   0           7   4   7   4           8   4   3   8           9   3   0   11                      
 
         [0140]    The details of the computation are as follows:  
         [0141]    K p =6.  
         [0142]    K 1 (6)=(6−6)/0.25+6=6;  
         [0143]    S=K 1 (6)−K 0 −AS=0.  
         [0144]    RS=RS−S=11;  
         [0145]    AS=AS+S=0;  
         [0146]    K p =7.  
         [0147]    K 1 (7)=(7−6)/0.25+6=10;  
         [0148]    S=K 1 (7)−K 0 −AS=4.  
         [0149]    RS=RS−S=7;  
         [0150]    AS=AS+S=0+4=4;  
         [0151]    K p =8.  
         [0152]    K 1 (8)=(8−6)/0.25+6=14;  
         [0153]    S=K 1 (8)−K 0 −AS=4.  
         [0154]    RS=RS−S=7−4=3;  
         [0155]    AS=AS+S= 4 + 4 = 8 ;  
         [0156]    K p =9.  
         [0157]    K 1 (9)=(9−6)/0.25+6=18&gt;K 1 =17 so S=K 1 −14=17−14=3.  
         [0158]    S=3  
         [0159]    RS=RS−S=0;  
         [0160]    AS=AS+S= 4 + 4 = 11 ;  
         [0161]    In this example, Transition Segment alignment requires two shifts of four pixels and one shift of three pixels. The third shift brings the intercept location (for row 2) past the segment boundary, and so the final shift is three, and not four. After four successive shifts the matched segments are aligned. These steps are summarized in Table 4 above.  
         [0162]    The Alignment Controller entries are shown in Table 5 for Alignment Controller entries for phase adjusted feature alignment for Table 3 for φ+0.25 (90 degrees).  
                                       TABLE 5                                       Index   6   7   8   9                       Shift Row 1   0   0   0   0           Shift Row 2   0   4   4   3                      
 
       EXAMPLE 2  
       [0163]    Segment alignment with sub-pixel interpolation  
         [0164]    In this example we introduce the notion of sub-pixel interpolation. This is required when the relative shifts required for alignment are not whole numbers.  
         [0165]    Let K 0 =6 and K 1 =17, then TS=17−6=11, RS=11, AS=0 and φ=0.22. Without loss of generality, we assume that K 0  is the origin.  
         [0166]    K p =0.  
         [0167]    AS 0 =0;  
         [0168]    ┌AS 0 ┐=0;  
         [0169]    S 0 =┌AS 0 ┐=0  
         [0170]    RS 0 =11  
         [0171]    K p =1.  
         [0172]    AS 1 =AS 0 +1/0.22=4.5454  
         [0173]    X 1 =round(AS 1 )=5  
         [0174]    P 1 =X 1 −X 0 =5−0=5  
         [0175]    S 1 =min(P 1 ,RS 0 )=min(5,11)=5  
         [0176]    RS 1 =RS 0 −S 1 =11−5=7;  
         [0177]    K p =2.  
         [0178]    AS 2 =AS 1 +1/0.22=9.0909  
         [0179]    X 2 =round(AS 2 )=9  
         [0180]    P 2 =X 2 −X 1 =9−5=4  
         [0181]    S 2 =min(P 2 ,RS 1 )=min(4,7)=4  
         [0182]    RS 2 =RS 1 −S 2 =7−4=3;  
         [0183]    K p =3.  
         [0184]    AS 3 =AS 2 +1/0.22=13.6363  
         [0185]    X 3 =round(AS 2 )=14  
         [0186]    P 3 =X 3 −X 2 =14−9=5  
         [0187]    S 3 =min(5,RS)=min(5,3)= 3   
         [0188]    RS 3 =RS 2 −S 3 =3−4=0;  
         [0189]    At K p =1, a shift of 4.5454 is needed, but it is not possible to shift by this amount. In order to produce an effective shift of 4.5454, we must first shift by 4, and use sub-pixel interpolation to produce an effective shift of 0.5454. The target point is given by:  
         Target=(1−φ)* P (1,1)+φ*((1−0.5454)* P (2,1)+0.5454* P (2,2)).  
         [0190]    As φ=0.22, we have  
         Target=0.78 P (1,1)+0.1 P (2,1)+0.12 P (2,2).  
         [0191]    As discussed with respect to Table 4, the cell into which (Y(1),φ) falls is used to address the weights. Depending on the latency with which the weights are chosen, it may be necessary to store the address of the weights used for sub-pixel interpolation along with the relative shift.  
         [0192]    Table 6 lists the relative incremental shifts needed to achieve transition segment alignment for the first matched segment.  
                                             TABLE 6                       Shift Table for Alignment Controller entries for phase adjusted       feature alignment for φ = 0.22 (79.2 degrees).                                    Index (K p )   5   6   7   8   9           Row 1   0   0   0   0   0           (Shift)           Row 2   0   4   5   4   1           (Shift)                      
 
         [0193]    In this section we will examine the behavior of one aspect of the shift computation in more detail. The relative shift is governed by the equation  
           K   1 ( K   p )=( K   p   −K   0 )/φ+ K   0   , K   0             K   p             K   1 .  
         [0194]    We may, without loss of generality, assume that K 0 =0. The equation can be simplified to read  
           K   1 ( K   p )= K   p /φ, 0           K   p             K   1 .  
         [0195]    Clearly, in order to compute the required (relative) shift, the phase φ must be inverted. Inversion is expensive, so instead, inverted values of the phase are quantized and stored as shown in Table 7 where we have cut the interval 0 to 1 into 8 segments of equal width. Each row contains an approximation to the inverted phase for a segment. The numbers are stored on chip in binary format.  
                                           TABLE 7                           Inverted phase shift table.                Quantized Phase φ   Inverse of Quantized Phase 1/φ                            (0,1/8]   8           (1/8,2/8]   4           (2/8,3/8]   2.66666           (3/8,4/8]   2           (4/8,5/8]   1.6           (5/8,6/8]   1.33333           (6/8,7/8]   1.14285           (7/8,1)   0                      
 
         [0196]    The inverted phase table is stored in fixed-point representation, but can be also stored in another representation, such as floating point. The inverted phase is the required relative shift used to align the features. The Accumulated Shift (AS) is used to sum up successive shifts and is also used to determine when shifting should cease. Shifting ceases when the subsequent pivot pixel is encountered. Logic is used to determining the relative shift at the boundary conditions, namely, at 0 and at 1. For example, if the phase is 0, then we may to forgo a shift entirely, or alternatively, we could decide to shift by K 1 −K 0  in one step. When the phase is 1, similar logic can decide the desired amount of the relative shift.  
         [0197]    Alignment Recovery (AR) is the process of bringing the filter back to vertical Restoring the default orientation means that the relative shifts initially used to align transitions segments must now be undone. This occurs immediately following the alignment of a transition segment. The alignment recover process is opposite to the alignment process. The subsequent pivot pixel is used to steer the filter towards a nominal orientation. Thereafter, barring the emergence of other matched transition segments, the default step size (time increment) is one pixel horizontally (vertically) when interpolating vertically (horizontally).  
         [0198]    Other anticipated alignment strategies can be envisioned that generalize the role of the pivot pixel. For instance, rather than to use the pivot pixel repeatedly in the transition region, we can also stagger the pivot about a number of pixels both before and after the pivot pixel. This is sometimes useful when smoother transitions are required between features.  
         [0199]    An important element of the foregoing discussion is the role of noise. There are many types of noise with which we must contend during the feature extraction, comparison and alignment processes. For instance, we can refer to pulse noise which is noise of a certain magnitude and duration. Pulse noise is not a feature and as such should not influence the behavior of the Alignment Controller.  
         [0200]    A Feature Extractor will search for Pulse noise. This kind of noise rejection serves to establish the degree to which the current image is noisy. This information can be incorporated into the selection of filters and threshold dynamically rendering the entire chip truly adaptive in nature.  
         [0201]    It is important to identify noise either using a separate Feature Extractor or as part of the current feature extractors so that noise is not classified as a feature This may result in a Matched Table entry that may result in a possible unwanted shift alignment.  
         [0202]    Texture Noise is characterized by frequent changes in the direction (changes in Δ) of the image data on a row of a specific size and duration. These changes may be considered visually insignificant because they are of short duration or of small magnitude as measured by user-defined thresholds. A Feature Extractor can be designed and used to determine the degree to which the surface is textured.  
         [0203]    Referring to FIG. 15 there is shown a circuit diagram depicting the relationship between the major functional components described above. The Feature Extractor (FE) is comprised of N storage locations for the Segment Table each containing: a starting pixel intensity; a starting pixel index; an ending pixel intensity and an ending pixel location.  
         [0204]    Each specific feature of interest, which is to be identified, requires a specific state machine. The Feature Comparator (FC) consists of M storage locations for the Matched Table containing: matched trend segments in pairs and a flag indicating a non-transition segment. The feature comparator implements the match acquisition process flow described with reference to FIG. 11. The Alignment Controller (AC) consists of P storage locations for the Alignment Table each containing: the relative shift needed for row 1 or row 2; the relative positions at which the relative shift is to occur, information to choose the correct weights for sub-pixel interpolation; A phase inversion table for relative shift computation and accumulators and decision circuitry for alignment decisions.  
         [0205]    The circuit to implement the relative shifts consists of fixed-point division addition and logic circuits for implementing the flow described with reference to FIG. 14.  
         [0206]    The terms and expressions which have been employed in the specification are used as terms of description and not of limitations, there is no intention in the use of such terms and expressions to exclude any equivalents of the features shown and described or portions thereof, but it is recognized that various modifications are possible within the scope of the claims to the invention.