SYSTEM AND METHOD FOR ADAPTIVE INTERPOLATION OF IMAGE DATA

Abstract: A system and method for adaptive interpolation of image data selects one of a plurality of different interpolation kernel functions based on one or more variables, such as a selected format for the visible presentation of the interpolated image data on an output imaging media, a selected type of the output imaging media for visible presentation of the interpolated image data, and an appearance characteristic, such as sharpness or smoothness, of the visible presentation of the interpolated image data. The system and method select an appropriate interpolation kernel function to improve an appearance of the visible presentation of the interpolated image data on the output imaging media.

Description: SYSTEM AND METHOD FOR ADAPTIVE INTERPOLATION OF IMAGE DATA Field of the Invention The present invention relates to image processing techniques, and, more particularly, to interpolation techniques for expansion of digital image data for presentation on output media. Discussion of Related Art A digital laser imager forms a visible representation of an image on imaging media, such as photosensitive film, based on a set of image data representative of the image. The image data contains a plurality of digital image values acquired by an input imaging device. In a medical imaging environment, the input imaging device may comprise, for example, a diagnostic device, such as a magnetic resonance (MR), computed tomography (CT), conventional radiography (X-ray), or ultrasound device. Thus, the image data may represent an image of a physiological object obtained for diagnostic purposes. Each of the digital image values corresponds to one of a plurality of pixels in the original image, and represents an optical density associated with the respective pixel. The laser imager processes the digital image values to generate laser drive values. Each of the laser drive values represents an exposure level calculated to reproduce, on the imaging media, the optical density of a pixel in the original image. The laser drive values are used to modulate the intensity of a scanning laser, thereby exposing imaging media with a particular level of exposure. The laser imager subsequently develops the imaging media to form the visible representation of the original image. The number of pixels represented by the image data can be significantly less than the resolution of the imaging media. For example, laser imagers include scanning lasers capable of producing an output resolution of 300 pixels per inch on the imaging media. Depending on the resolution of the input imaging device, however, the original image may be represented by image data comprising as little as a 256 by 256 array of pixels. The laser imager may provide different formats that enable a user to select the number of images to be formed. The number of images formed on the imaging media determines the size of each image. If a particular format requires that the laser imager form an image in a two inch (4.08 cm) by two inch (4.08 cm) area on the imaging media, a 512 by 512 pixel set of image data must be expanded by at least twenty-five percent to match the 300 pixels per inch resolution of the laser imager. With formats requiring larger sizes, it is necessary to expand the image data by much greater amounts. An eight inch (20.32 cm) by ten inch (25.4 cm) format for an entire sheet of imaging media, for example, would require eight-times expansion of the 512 by 512 pixel set of image data, resulting in a 4096 by 4096 pixel set of image data. In contrast, formats producing smaller sizes require that the image data be reduced. Expansion involves resampling of the originally sampled image data at a higher rate dependent on the amount of expansion required. Reduction involves resampling of the originally sampled image data at a lower rate dependent on the amount of reduction required. Resampling is carried out by performing interpolation on the original image data to effectively fit a curve to the original image data. For expansion, the curve is resampled at a higher rate than the original image data to create intermediate pixel points between those available from the originally sampled image data. For reduction, the curve is resampled at a lower rate than the original image data. The resampling process transforms the image data into an image having a higher spatial resolution for expansion and a lower spatial resolution for reduction. Unfortunately, the resampling rates for expansion can degrade image quality by loss of high frequency information, introducing perceived blurring and other artifacts into the expanded image data. To preserve image quality, it would be desirable to have an interpolation function that exhibits an ideal low-pass filter spectrum. The ideal low-pass filter would remove replicates of the frequency introduced by the resampling. The implementation of an ideal low-pass filter is not feasible, however, because it would require the availability of many surrounding data points for each interpolated pixel. Several proposed interpolation functions seek to approximate the effect of an ideal low-pass filter. Such interpolation functions generally fall into two categories, commonly referred to as (1) "two-point" interpolation and (2) "four- point" interpolation. One type of "two-point" interpolation involves "pixel replication" interpolation, whereby sample points between two adjacent original pixels are simply assigned the intensity values of the closest adjacent original pixel. Another type of "two-point" interpolation involves "bilinear" interpolation, whereby sample points between two adjacent original pixels are assigned linearly weighted intensity values based on distance from the closest adjacent original pixel. Other "two-point" interpolation techniques are implemented by third order, fifth order, seventh order, etc., polynomial kernel functions. "Four-point" interpolation may involve the application of a cubic spline function. The four-point interpolation carried out by application of the cubic spline function involves much more computation than two-point interpolation. The cubic spline function has been found to produce a better spatial frequency response than two-point interpolation functions in most cases, providing a closer approximation of the ideal low-pass filter spectrum. For certain types of image data, however, a cubic spline interpolation function may produce a less than optimum interpolated image, relative to two-point interpolation functions such as bilinear interpolation or pixel replication. To improve interpolation results for image data representing alphanumeric information, for example, it may be necessary to use a different type of interpolation than that used for data representing pictorial information. Some existing interpolation techniques enable switching between different interpolation functions based on the type of image data to be interpolated. United States Patent No. 5,008,752 discloses an interpolator for applying two different types of interpolation fiinctions depending on the type of image data present. This technique switches between different inteφolation functions when a difference between successive pixel values exceeds a predetermined threshold, indicating a transition from pictorial to text information. United States Patent No. 4,468,693 discloses an inteφolation apparatus that allows a user to manually switch between cubic spline inteφolation, bilinear inteφolation, and pixel replication inteφolation according to the user's preference. United States Patent No. 5, 327,257 discloses an apparatus that applies more than one inteφolation function to a set of image data to achieve a desired appearance. This apparatus creates both a shaφ inteφolated image and a smooth inteφolated image by applying a cubic spline function to a set of image data, and then creating a third image by combining the shaφ and smooth inteφolated images with selected weighting coefficients to produce a shaφ or smooth resultant image. The above patent disclosures generally address the effectiveness of different types of inteφolation functions for different types of image data. However, the effect of other image processing variables has not been adequately addressed. For example, the effectiveness of a particular inteφolation function may vary according to the degree of expansion required by the format of the image data on the imaging media. If a format requires a large image expansion factor for an image, it is, of course, necessary to create a greater number of intermediate pixels between adjacent original unexpanded pixels. As a result, there will be a higher chance of introducing imaging artifacts such as blurring. If the format selection calls for an smaller expansion rate, however, the blurring will be less perceptible. Hence, an inteφolation function considered inappropriate for use with larger expansion rates, due to high incidence of blurring, may nevertheless be appropriate for use with smaller expansion rates. In addition, the response characteristics of different imaging media can greatly affect the visible results of the inteφolation. It has been observed, for example, that dry silver film has a development speed that is significantly slower than that of conventional silver halide film, in both toe and shoulder speeds. This slower development speed can render inteφolation functions previously considered effective for silver halide films less effective for dry silver film. The slower development speed requires that the scanning laser transmit a higher exposing energy to the imaging media to achieve a desired maximum optical density. The higher exposing energy translates to a larger dynamic range for the scanning laser in order to expose every gradation on the imaging media. However, the available dynamic range of existing, commercially available scanning lasers, such as laser diodes, may be limited for required exposing wavelengths in the infra-red regions. As a result, the scanning laser may be incapable of producing the desired number of gradations. The slower development speed of the dry silver film, given the limitations of the scanning laser, can result in loss of high spatial frequencies. The visible manifestation of the loss of high spatial frequencies may be a loss of apparent edge shaψness producing an undesirable blurring in high contrast areas. The blurring is particularly apparent in those areas involving a transition from image data representing alphanumeric text at a minimum density to image data representing pictorial information at much higher densities approaching maximum density. Therefore, an inteφolation function considered appropriate for silver halide film may produce inadequate results with a dry silver film. As a further variation, presentation of the image data on alternate output media such as a cathode ray tube (CRT) display monitor, having a different response characteristic than film, can also affect the visible results of inteφolation functions. A CRT monitor medium has several problems when compared to a print film for image presentation. For example, a CRT monitor suffers from severe dynamic range limitations (maximum intensity to minimum intensity range). relative to film. The dynamic range of a CRT monitor limits perceptible image gradation presentation to about 100 - 150 levels as compared to print films, which may provide 1500-2000 levels of gradation. Thus, like dry silver film, CRT monitors may suffer blurring in high contrast areas. It is noted, however, that the blurring suffered by a CRT monitor may be much more pronounced than that on dry silver film. In addition, a CRT monitor produces viewing glare and geometric distortion not present in films. Thus, the perception of fine edges and detail is much more difficult for CRT monitors than for print films. Due to the smaller number of gradation levels, and the glare and distortion in a CRT monitor, an inteφolation function appropriate for a film may be inappropriate for a CRT monitor. Existing inteφolation techniques generally fail to address the effect of format and/or media variations on inteφolation results. Consequently, image quality continues to be a concern for inteφolated images formed with different formats on different imaging media. Accordingly, there is a need for an inteφolation system capable of selecting inteφolation functions appropriate for particular formats and/or different imaging media. Summary of the Invention In view of the limitations of existing inteφolation techniques, the present invention is directed to a system and method for adaptive inteφolation of image data. The system and method of the present invention are capable of selecting one of a plurality of different inteφolation kernel lookup tables based on a format selected for the image data. The system and method of the present invention also are capable of selecting one of a plurality of different inteφolation kernel lookup tables based on an imaging media selected for presentation of the image data. By addressing variations in format and media, the system and method of the present invention enable application of an appropriate inteφolation kernel to the image data to improve visible results. As a further advantage, the system and method of the present invention are capable of selecting one of the inteφolation kernel lookup tables to achieve a particular appearance characteristic based on a degree of shaφness or smoothness desired by a user. Additional features and advantages of the present invention will be set forth in part in the description that follows, and in part will be apparent from the description, or may be learned by practice of the present invention. The advantages of the present invention will be realized and attained by means particularly pointed out in the written description and claims hereof, as well as in the appended drawings. To achieve the foregoing advantages, as broadly embodied and described herein, the present invention provides, in a first embodiment, a system for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data representing inteφolated pixels, the system comprising media selection means for selecting one of a plurality of imaging media for presentation of the image, format selection means for selecting one of a plurality of formats for presentation of the image on the imaging media, appearance characteristic selection means for selecting one of a plurality of appearance characteristics of the presentation of the image on the imaging media, a memory storing a plurality of different inteφolation kernel lookup tables, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, inteφolation kernel selection means for selecting, based on a combination of the format selected by the format selection means, the media selected by the media selection means, and the appearance characteristic selected by the appearance characteristic selection means, one of the inteφolation kernel lookup tables stored in the memory, and inteφolating means for applying the inteφolation coefficients contained in the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. In a second embodiment, the present invention provides a system for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, the system comprising format selection means for selecting one of a plurality of formats for presentation of the image on imaging media, a memory storing a plurality of different inteφolation kernel lookup tables, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, inteφolation kernel selection means for selecting, based on the format selected by the format selection means, one of the inteφolation kernel lookup tables stored in the memory, and inteφolation means for applying the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. In a third embodiment, the present invention provides a system for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, the system comprising media selection means for selecting one of a plurality of imaging media for presentation of the image, a memory storing a plurality of different inteφolation kernel lookup tables, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, inteφolation kernel selection means for selecting, based on the media selected by the media selection means, one of the inteφolation kernel lookup tables stored in the memory, and inteφolation means for applying the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. In a fourth embodiment, the present invention provides a method for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data representing inteφolated pixels, the method comprising the steps of selecting one of a plurality of imaging media for presentation of the image, selecting one of a plurality of formats for presentation of the image on the imaging media, selecting one of a plurality of appearance characteristics of the presentation of the image on the imaging media, selecting one of a plurality of different inteφolation kernel lookup tables based on a combination of the selected media, the selected format, and the selected appearance characteristic, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, and applying the inteφolation coefficients contained in the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. In a fifth embodiment, the present invention provides a method for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, the method comprising the steps of selecting one of a plurality of formats for presentation of the image on imaging media, selecting one of a plurality of different inteφolation kernel lookup tables based on the selected format, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, and inteφolation means for applying the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. In a sixth embodiment, the present invention provides a method for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, the method comprising the steps of selecting one of a plurality of imaging media for presentation of the image, selecting one of a plurality of different inteφolation kernel lookup tables based on the selected media, each of the inteφolation kernel lookup tables containing a plurality of inteφolation coefficients, and inteφolation means for applying the selected inteφolation kernel lookup table to the image data to produce the inteφolated image data. It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only, and not restrictive of the present invention, as claimed. Brief Description of the Drawings The accompanying drawings are included to provide a further understanding of the present invention and are incoφorated in and constitute a part of this specification. The drawings illustrate exemplary embodiments of the present invention and together with the description serve to explain the principles of the invention. Fig. 1 is a functional block diagram of a system for adaptive inteφolation of image data, in accordance with the present invention; Fig. 2 is a functional block diagram of an inteφolation processor for incoφoration in the system of Fig. 1, in accordance with the present invention; and Fig. 3 is a flow diagram illustrating a method for adaptive inteφolation of image data, in accordance with the present invention. Detailed Description of the Preferred Embodiments Fig. 1 is a functional block diagram of a system 10 for adaptive inteφolation of digital image data, in accordance with the present invention. As shown in Fig. 1, system 10 includes a format selector 12, an appearance characteristic selector 14, an output media selector 16, an inteφolation kernel lookup table memory 18, an inteφolation processor 20, and a formatting processor 22. The system 10 further includes one or more output media provided by a cathode ray tube (CRT) display monitor 24 and a digital laser imager 26. The inteφolation processor 20 receives image data, as indicated by block 28, from an input imaging device. In a medical imaging environment, the input imaging device may comprise, for example, a diagnostic device, such as a magnetic resonance (MR), computed tomography (CT), conventional radiography (X-ray), or ultrasound device. Thus, image data 28 may represent an image of a physiological object obtained for diagnostic puφoses. The image data 28 received by inteφolation processor 20 is representative of a plurality of pixels within the image. The number of pixels represented by image data 28 can be significantly less than the output resolution of output imaging media used for visible presentation of the image. The system 10 is configured to perform inteφolation on image data 28 to produce inteφolated image data representing the original pixels and inteφolated pixels. The system 10 selects one of a plurality of inteφolation kernel lookup tables based on a combination of a selected format, a selected output media, and a selected appearance characteristic of the image. The inteφolation kernel lookup tables contain inteφolation coefficients that are applied to the original pixels in image data 28 to produce inteφolated pixels, thereby transforming the spatial resolution of image data 28 to match the resolution of the output media. The format selector 12 selects one of a plurality of formats for presentation of an image on imaging media. The format selector 12 enables a system user to select a format representing a number of images to be formed on a single page of the output imaging media. As an example, system 10 may provide formats for as many images as can be accommodated by a single page of media or, as a practical matter, as many images as can be viewed for useful diagnostic puφoses. The term "page," as used herein, may refer to a sheet of photosensitive media such as film printed by laser imager 26, or a screen displayed by CRT display monitor 24. The format selector 12 can be realized, for example, by a user interface associated with a display panel on laser imager 26 or by a manual control panel on laser imager 26. The number of images specified by the selected format determines the size of each individual image to be formed on the imaging media. The size of each image determines the amount of expansion necessary to match the resolution of image data 28 to that of the output media. The appearance characteristic selector 14 selects one of a plurality of appearance characteristics of the presentation of the image on the imaging media. The appearance characteristics may include a plurality of degrees of apparent shaφness of the image relative to a degree of apparent smoothness, when viewed by a human observer. The terms "shaφness" and "smoothness," as used herein, refer to degrees of apparent edge contrast between original pixels and inteφolated pixels in the image, when viewed by a human observer. The appearance characteristic selector 14 enables a user to select a degree of apparent edge contrast in the visible representation of the image when formed on the imaging media to provide a more pleasing or diagnostically useful appearance. The format selector 12 can be realized, for example, by a user interface associated with a display panel on laser imager 26 or by a manual control panel on laser imager 26. The media selector 16 selects one of a plurality of imaging media for visible presentation of the image represented by image data 28. Specifically, media selector 16 enables the user to select either CRT monitor 24 or laser imager 26, and also the type of imaging media printed by the laser imager. For example, laser imager 26 may be configured to print the image on either wet chemically processed silver halide film or thermographic dry silver film. The laser imager 26 conceivably could be configured to print images on other types of thermographic film. The media selector 16 can be realized, for example, by a user interface associated with a display panel on laser imager 26 or by a manual control panel on laser imager 26. Alternatively, media selector 16 may be configured to respond automatically to media selection information sent with image data 28 from an input imaging device. The inteφolation kernel lookup table memory 18 stores a plurality of different inteφolation kernel lookup tables. Each of the inteφolation kernel lookup tables contains a plurality of inteφolation coefficients calculated according to particular inteφolation kernel functions. The inteφolation kernel lookup tables may include, for example, at least one inteφolation kernel lookup table containing a plurality of two-point inteφolation coefficients and at least one inteφolation kernel lookup table containing a plurality of four-point inteφolation coefficients. In particular, memory 18 may store a variety of inteφolation kernel lookup tables including an inteφolation kernel lookup table containing a plurality of pixel replication inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of bilinear inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of third order polynomial inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of fifth order polynomial inteφolation coefficients, and one or more inteφolation kernel lookup tables containing a plurality of cubic spline inteφolation coefficients. The inteφolation processor 20 selects one of the inteφolation kernel lookup tables stored in memory 18 based on a combination of the format selected by format selector 12, the media selected by media selector 16, and the appearance characteristic selected by appearance characteristic selector 14. The particular inteφolation kernel lookup table selected by inteφolation processor 20 produces inteφolated image data having an optimum visible appearance, given the format, media, and appearance characteristic specified by the user. The inteφolation processor 20 determines a sampling increment based on the amount of pixels required by the selected format and the amount of original pixels provided by image data 28. The inteφolation processor 20 then applies inteφolation coefficients contained in the selected inteφolation kernel lookup table that correspond to the sampling increment to image data 28 to produce the inteφolated image data. The format processor 22 receives the inteφolated image data produced by inteφolation processor 20, and prepares the inteφolated image data for presentation on a single page of output imaging media. Specifically, format processor 22 assembles the inteφolated image data produced for each of a number of images to be printed or displayed on a single page according to a format selected by the user. The format processor 22 assigns the inteφolated image data for each image to a particular area of the page, and then rasterizes the assembled image data for application to drive either display monitor 24 or laser imager 26. Fig. 2 is a functional block diagram of the inteφolation processor 20 shown in Fig. 1, in accordance with the present invention. As shown in Fig. 2, processor 20 includes an input image data buffer 30, a row inteφolator 32, a column inteφolator 34, and an output image data buffer 36. The input image data buffer 30 receives image data 28 from an input imaging device. The row inteφolator 32 processes original pixel values along each row of image data 28 and inteφolates them based on inteφolation coefficients retrieved from the selected inteφolation kernel table, as indicated by block 38. The row inteφolator 32 multiplies the original pixel values by corresponding inteφolation coefficients 38, selected according to the sampling rate, and sums the product to produce inteφolated row pixel values. The resulting inteφolated row pixel values each correspond to an inteφolated pixel in the image, and represent an intensity of that inteφolated pixel. The inteφolated row pixel values create additional columns of inteφolated pixels between columns of original pixels in image data 28. The intensity of each inteφolated pixel is a function of the intensities of the original pixel values to which the inteφolation coefficients were applied, and the values of the inteφolation coefficients. Once a plurality of rows of original pixels have been inteφolated by row inteφolator 32, column inteφolator 34 processes them to produce inteφolated column pixel values. Specifically, column inteφolator 34 inteφolates both the original row pixels and the inteφolated row pixels along a column based on inteφolation coefficients 38 retrieved from the selected inteφolation kernel table. The column inteφolator 34 multiplies the original row pixels and the inteφolated row pixels along a column by corresponding inteφolation coefficients, and sums the product to produce inteφolated column pixel values. The inteφolated column pixel values create additional rows of inteφolated pixels between rows of original pixels and inteφolated pixels. Again, the intensity of each inteφolated column pixel is a function of the intensities of the original column pixel values to which the inteφolation coefficients were applied, and the values of the inteφolation coefficients. After processing by row inteφolator 32 and column inteφolator 34, the inteφolated image data is sent to output image data buffer 36. The image data is stored in output image data buffer 36 until retrieved by format processor 22. The row inteφolator 32 and column inteφolater 34 perform inteφolation of image data 28 in a well known manner. The following FORTRAN code is provided, however, for puφoses of illustration. The code illustrates the computation involved in a four-point inteφolation process using a cubic spline inteφolation kernel function, a two-point inteφolation process using a fifth order polynomial function, and a two-point inteφolation process using bilinear inteφolation. c Four-point inteφolation Cubic Spline c Parameter " ca " is set to " -1. " c ul, u2, u3, u4 are the calculated coefficients from c Cubic Spline kernel function c In this example, a 200% inteφolation is shown. ca = -l. do 100 i=0,4 cl = float(i)/4.0 ul(i) = ca*(cl **3)-(2.*ca*(cl**2))+ca*cl u2(i) = (ca+2)*(cl**3) -(ca+3.)*(cl **2)+l. u3(i) = -(ca+2.)*(cl **3)+((2.*ca+3)*(cl**2))-ca*cl u4(i) = -ca*(cl **3)+ca*(cl **2) 100 continue c c c Two point inteφolation using a 5th order polynomial c In this example, a 200% inteφolation is shown c= do 200 i=0,4 cl = float(i)/4.0 ul(i) = 0. u2(i) =l-(10.*(cl**3))+(15.*(cl**4))-(6.*(cl **5)) u3(i)= l-(10.*((l-cl)**3))+(15.*((l-cl)**4))-(6.*((l-cl)**5)) u4(i) = 0. c= c Two point inteφolation using Bilinear c In this example a 200% inteφolation is shown c — cl = float(i)/4.0 ul(i) = 0. u2(i) = l-cl u3(i) = cl u4(i) = 0. 200 continue c= ■ ■ c In this example "mbb(i,k)" are the expanded image data c and "mnb(i,k)" are the unexpanded original image data. c *************** interoolation Row ************** c do 301 i = 1,4 do 301 k = 0,3 mbb(i,k+l)=ul(k)*mnb(i, l)+u2(k)*mnb(i,2)+u3(k)*mnb(i,3) 1 +u4(k)*mnb(i,4) if(mbb(i,k+l) .ge. 4095)mbb(i,k+l)=4095 if(mbb(i,k+l) .le. 0)mbb(i,k+l)=0 301 continue c c ********** # **** Interpo , ation Co ] umn #************ c do 302 i=l,4 do 302 k=0,3 mb(k+l,i)=ul(k)*mbb(l,i)+u2(k)*mbb(2,i)+u3(k)*mbb(3,i) 1 +u4(k)*mbb(4,i) if(mb(k+l,i) .ge. 4095)mb(k+l,i)=4095 if(mb(k+l,i) .le. 0)mb(k+l,i)=0 302 continue c An example of the inteφolation kernel lookup tables stored in memory 18 and the manner in which inteφolation processor 20 selects one of the inteφolation kernel lookup tables will now be described. In this example, memory 18 stores inteφolation lookup tables containing inteφolation coefficients that represent the following inteφolation kernel functions: A. Two-Point Inteφolation Kernel Functions. 1. Pixel Replication Kernel Function. This two-point inteφolation kernel lookup table contains inteφolation coefficients representative of a conventional pixel replication inteφolation kernel function Kι(x), whereby inteφolated pixels between two adjacent original pixels are simply assigned the intensity values of the closest original pixel. This inteφolation kernel function can be expressed as: K,(x) = 1 |x| <= 0.5 K,(x) = 0 |x| > 0.5 where x is a variable representing a location of the inteφolated pixel relative to the original pixels. The pixel replication inteφolation kernel produces a shaφ apparent edge contrast between pixels in the inteφolated image data. 2. Bilinear Inteφolation Kernel Function. This two-point inteφolation kernel lookup table contains inteφolation coefficients representative of a conventional bilinear inteφolation kernel function K (x), whereby inteφolated pixels between two adjacent original pixels are assigned linearly weighted intensity values based on distance from the closest adjacent original pixel. This inteφolation kernel function K 2 (x) can be expressed as: K 2 (x) = 1 - |x| 0 <= |x| <= 1 K 2 (x) = 0 |x| > 1 This bilinear inteφolation kernel function produces a smoother apparent edge contrast between pixels in the inteφolated image data, relative to pixel replication. 3. Third Order Polynomial Kernel Function. This two-point inteφolation kernel lookup table contains inteφolation coefficients representative of a conventional third order polynomial kernel function K 3 (x), whereby inteφolated pixels between two adjacent original pixels are assigned intensity values based on the following expression: K 3 (x) = 2|x| 3 - 3|x| 2 + 1 0 <= |x| <= 1 K 3 (x) = 0, |x| > l This third-order polynomial kernel function produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the bilinear inteφolation kernel function K 2 (x), but smoother than that produced by the pixel replication inteφolation kernel function Kι(x). 4. Fifth Order Polynomial Kernel Function. This two-point inteφolation kernel lookup table contains inteφolation coefficients representative of a conventional fifth order polynomial kernel function K*(x), whereby inteφolation pixels between two adjacent original pixels are assigned intensity values based on the following expression: K,(x) = -6|x| 5 + 15|x| 4 - 10|x| 3 + 1 0 < |x| < 1 K,(x) = 0 |χ| > 1 The fifth order polynomial kernel function produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by both the third order polynomial inteφolation kernel function K 3 (x) and the bilinear replication inteφolation kernel function K (x), but smoother than that produced by the pixel replication inteφolation kernel function Kι(x). B. Four-Point Inteφolation Kernel Functions. 5. Cubic Spline Function a = 0). This four-point inteφolation kernel lookup table contains inteφolation coefficients representative of a conventional cubic spline kernel function Ks(x), whereby inteφolation pixels between two adjacent original pixels are assigned intensity values based on the following expression: K 5 (x) = (a + 2)|x| 3 - (a + 3)|x| 2 + 1 0 <= |x| <= 1 Kj(x) = α|x| 3 - 5σ|x| 2 + 8a|x| - 4a |x| > 1 K,(x) = 0 |x| > 2 With the coefficient a = 0, the above inteφolation kernel function K $ (x) provides a relatively smooth apparent edge contrast between pixels in the inteφolated image. 6. Cubic Spline Function ( = -.2). This four-point inteφolation kernel lookup table corresponds to the above expression Kj(x) with the coefficient a = -0.2 to realize an inteφolation kernel function K$(x). With a = -0.2, the inteφolation kernel function K«(x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function K 5 (x). 7. Cubic Spline Function (a = -.4). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a = -0.4 to realize an inteφolation kernel function K 7 (x). With a = -0.4, the inteφolation kernel function K 7 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function K«(x). 8. Cubic Spline Function (a = -.6). This four-point inteφolation kernel lookup table corresponds to the above expression Ks(x) with the coefficient a = -0.6 to realize an inteφolation kernel function K g (x). With a = -0.6, the inteφolation kernel function K 8 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function K (x). 9. Cubic Spline Function (σ = -.8). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a = -0.8 to realize an inteφolation kernel function K9(x). With a = -0.8, the inteφolation kernel function K 9 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Kg(x). 10. Cubic Spline Function (a = -1.0). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a = -1.0 to realize an inteφolation kernel function Kιo(x). With a = -1.0, the inteφolation kernel function K l0 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function K^x). 11. Cubic Spline Function ( = - 1.2). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a - -1.2 to realize an inteφolation kernel function Kπ(x). With a = -1.2, the inteφolation kernel function Kn(x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Kι 0 (x). 12. Cubic Spline Function ( = -1.4). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a = -1.4 to realize an inteφolation kernel function Kι 2 (x). With a = -1.4, the inteφolation kernel function K !2 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Ku(x). 13. Cubic Spline Function (a = -1.6). This four-point inteφolation kernel lookup table corresponds to the above expression K s (x) with the coefficient a = -1.6 to realize an inteφolation kernel function K I3 (x). With a = -1.6, the inteφolation kernel function K_ (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Kι 2 (x). 14. Cubic Spline Function (a = -1.8). This four-point inteφolation kernel lookup table corresponds the above expression K$(x) with the coefficient a = -1.8 to realize an inteφolation kernel function K (x). With a = -1.8, the inteφolation kernel function Ku(x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Kι 3 (x). 15. Cubic Spline Function (a = -2.0). This four-point inteφolation kernel lookup table corresponds to the above expression K $ (x) with the coefficient a = -2.0 to realize an inteφolation kernel function Kιs(x). With a = -2.0, the inteφolation kernel function Kιs(x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Ku(x). 16. Cubic Spline Function (a = -2.2). This four-point inteφolation kernel lookup table corresponds to the above expression K 5 (x) with the coefficient a = -2.2 to realize an inteφolation kernel function Kι 6 (x). With a = -2.2, the inteφolation kernel function Kι 6 (x) produces an apparent edge contrast between pixels in the inteφolated image that is shaφer than that produced by the inteφolation kernel function Kιs(x). The inteφolation processor 20 selects one of the above inteφolation kernel lookup tables Kι-K ]6 to improve the appearance of a visible representation of the inteφolated image data based on the selected format, the selected media, and the selected appearance characteristic. The selection is made by inteφolation processor 20 in recognition that the results of an inteφolation kernel function can vary depending on the degree of expansion or reduction required by the format selected by format selector 12, and the response characteristic of the output media selected by output media selector 14. The processor 20 also bases the selection on an appearance characteristic, e.g., shaφness or smoothness, selected by appearance characteristic selector 14. In this manner, inteφolation processor 20 selects from memory 18 the best available inteφolation kernel function K Ki 6 for the present conditions. In this example, inteφolation processor 20 first narrows the field of inteφolation kernel lookup tables stored in memory 18 according to the format selected by format selector 12. For selected formats requiring smaller expansion rates, inteφolation processor 20 selects one of the two-point inteφolation kernel lookup tables K1-K , in view of the lower incidence of blurring with small-scale expansion. Because the smaller expansion rate produces less blurring, a two-point inteφolation kernel lookup table can provide acceptable visible results. In this manner, the selection of a two-point, rather than four-point, inteφolation kernel lookup table by inteφolation processor 20 reduces the amount of computational effort necessary to produce the inteφolated image data. The computation time required for two-point inteφolation will be less than that required for four-point inteφolation by at least a factor of four. For formats requiring higher expansion rates, inteφolation processor 20 selects one of the four-point inteφolation kernel tables K-rKι 6 . The inteφolation processor 20 thereby produces better spatial frequency when needed to avoid the higher incidence of blurring that can occur with larger expansion. The four-point inteφolation kernel requires added computation, but is necessary to ensure a pleasing or diagnostically useful visible presentation of the inteφolated image data on the output media. As an example of the criteria applied by inteφolation processor 20 to select a type of inteφolation kernel lookup table, satisfactory visible results have been observed for the use of two-point inteφolation kernel tables with selected formats requiring expansion rates that do not exceed a factor of three in both horizontal and vertical directions. For selected formats that require expansion rates of greater than a factor of three in both horizontal and vertical directions, inteφolation processor 20 should be configured to select one of the four-point inteφolation kernel tables. At expansion rates of less than a factor of three, the degree of blurring that may occur with a two-point inteφolation kernel has been found to be acceptable, particularly in view of the computational savings gained. At expansion rates of greater than a factor of three, the incidence of blurring generally dictates the use of an inteφolation kernel producing better spatial frequency. Thus, the improved visible results achieved by use of a four-point inteφolation kernel are considered to be worth the added computational effort. Of course, the question of whether the visible presentation of the inteφolated image data is acceptable will ultimately be a subjective matter for the human observer. Therefore, other criteria for selecting between a two-point or four-point inteφolation kernel are conceivable. After inteφolation processor 20 has narrowed the selection process to either the set of two-point inteφolation kernel lookup tables or the set of four- point inteφolation kernel lookup tables, the process turns to selection of a subset of lookup tables appropriate for the type of output imaging media selected by output media selector 16. Both the set of two-point inteφolation lookup tables K1-K4 and the set of four-point inteφolation kernel lookup tables Ks-K ]6 include inteφolation coefficients representing inteφolation kernel functions designed to produce different appearance characteristics, i.e., different degrees of shaφness or smoothness. For example, the set of two-point inteφolation kernel tables includes, in descending order of apparent shaφness, the pixel replication inteφolation kernel table Ki, the fifth order polynomial inteφolation kernel table Id, the third order polynomial inteφolation kernel table K 3 , and the bilinear inteφolation kernel table K 2 . Similarly, the set of four-point inteφolation kernel tables includes, in descending order of apparent shaφness, cubic spline inteφolation kernel tables K 5 -Kι 6 modified by the value of coefficient a to adjust shaφness. The inteφolation processor 20 selects a subset of appropriate inteφolation kernel lookup tables by considering the response characteristics of the output imaging media, which can greatly affect the visible results of the inteφolation. Thermographic dry silver film has a development speed that is significantly slower than that of conventional silver halide film, in both toe and shoulder speeds. The scanning laser in laser imager 26 may have an insufficient dynamic range to compensate for the slower development speed. Consequently, blurring can result in high contrast areas of the visible presentation of the inteφolated image data, such as those areas involving a transition from image data representing alphanumeric text at a minimum density to image data representing pictorial information at much higher densities approaching maximum density. Similarly, a CRT display monitor suffers from severe dynamic range limitations, and therefore can also exhibit blurring in high contrast areas. When the media selected by output media selector 16 is conventional silver halide film, inteφolation processor 20 selects one of the inteφolation kernel lookup tables Kj-Kiβ producing a relatively smooth apparent edge contrast. The inteφolation processor 20 selects an inteφolation kernel lookup table producing a relatively smooth apparent edge contrast in recognition of the faster development speed of the silver halide film, and hence the smaller dynamic range required to reproduce the desired optical densities. As an example, if a selected format requires an expansion rate of less than three in both horizontal and vertical directions, and the selected media is silver halide film, inteφolation processor 20 selects one of two-point inteφolation kernel tables Ki-I providing a relatively smooth apparent edge contrast, such as the bilinear inteφolation kernel table K 2 . In contrast, if a selected format requires an expansion rate of greater than three in both horizontal and vertical directions, and the selected media is silver halide film, inteφolation processor 20 selects one of the four-point inteφolation kernel tables K 3 -Ki6 providing a relatively smooth apparent edge contrast. For example, the sixth four-point inteφolation kernel table Kβ, with coefficient a set to -0.2, provides a particularly smooth apparent edge contrast when applied to the inteφolated image data. When the media selected by output media selector 16 is a thermographic dry silver film, inteφolation processor 20 selects one of the inteφolation kernel lookup tables Ki-Ku producing a shaφer apparent edge contrast than that for silver halide film. The inteφolation processor 20 selects an inteφolation kernel lookup table producing a relatively shaφ appearance in recognition of the slower development speed of the dry silver film, and hence the larger dynamic range required to reproduce the desired optical densities. The shaφer inteφolation kernel lookup table provides a mechanism for improving the visible appearance of the presentation of the inteφolated image data on the dry silver film. Specifically, the shaφness produced by the selected inteφolation kernel lookup table produces an "overshoot undershoot" effect that compensates for the slower development speed of the dry silver film. However, the overshoot and undershoot are clipped in high contrast areas by the minimum density Dmin and the maximum density Dmax. The shaφness of the selected inteφolating kernel lookup table increases the apparent spatial frequency of the inteφolated image data by increasing the apparent slope between adjacent inteφolated pixels. In particular, the selected inteφolating kernel lookup table increases the apparent slope between minimum density Dmin and maximum density Dmax in high contrast areas, such as those involving a transition from image data representing alphanumeric text at a minimum density to image data representing pictorial information at much higher densities approaching maximum density. Of course, the other areas of the visible presentation having varying densities also will be affected by the shaφer inteφolation kernel lookup table. The effect is not readily apparent, however, for inteφolation with formats requiring smaller expansion factors. Further, the four- point inteφolation kernel lookup tables selected for formats requiring larger expansion factors conceal the effect by avoiding the introduction of a large amount of high spatial frequency artifact and aliasing. As an example, if a selected format requires an expansion rate of less than three in both horizontal and vertical directions, and the selected media is dry silver film, inteφolation processor 20 selects one of the two-point inteφolation kernel tables K1-K4 providing a relatively shaφ apparent edge contrast, such as the pixel replication inteφolation kernel table K t , the third order polynomial kernel table K , or the fifth order polynomial kernel table t. In contrast, if a selected format requires an expansion rate of greater than three in both horizontal and vertical directions, and the selected media is dry silver film, inteφolation processor 20 selects one of four-point inteφolation kernel tables K 5 -Kι 6 providing relatively shaφer apparent edge contrasts. For example, the inteφolation kernel table Kι , with coefficient a set to -1.8, provides a very high degree of overshoot and undershoot, producing a very shaφ apparent edge contrast when applied to the inteφolated image data. In areas in which pixels transition from Dmin to Dmax, however, the overshoot and undershoot are clipped. Thus, the shaφer inteφolation kernel lookup table provides the benefits of higher apparent slope between Dmin and Dmax, compensating for the slow development speed of the dry silver film, but does not suffer significantly from the overshoot and undershoot effect, which would ordinarily be undesirable. When the media selected by output media selector 16 is CRT display monitor 24, inteφolation processor 20 selects one of the inteφolation kernel lookup tables Ki-Kiβ producing an even shaφer apparent edge contrast than that required by the dry silver film. The inteφolation processor 20 selects an inteφolation kernel lookup table producing a relatively shaφ appearance in recognition of the severely limited dynamic range of the CRT monitor. As with the dry silver film, the shaφer inteφolation kernel lookup table provides a mechanism for improving the visible appearance of the presentation of the inteφolated image data on the CRT monitor. Specifically, the shaφness produced by the selected inteφolation kernel lookup table produces the overshoot and undershoot effect to provide a higher apparent slope between maximum intensity and minimum intensity on the monitor. The overshoot/undershoot effect compensates for the limited dynamic range of the CRT monitor, but is clipped in high contrast areas by the minimum and maximum intensities. The shaφness of the selected inteφolating kernel lookup table increases the apparent spatial frequency of the inteφolated image data by increasing the apparent slope between adjacent inteφolated pixels in high contrast areas, such as those involving a transition from image data representing alphanumeric text at a minimum intensity to image data representing pictorial information at much higher intensities approaching maximum intensity. As an example, if a selected format requires an expansion rate of less than three in both horizontal and vertical directions, and the selected media is CRT monitor 24, inteφolation processor 20 selects one of the two-point inteφolation kernel tables K K_ι providing a shaφ apparent edge contrast. The pixel replication inteφolation kernel table Ki and the fifth order polynomial kernel table K«, in particular, produce inteφolated image data having shaφer apparent edge contrasts. If a selected format requires an expansion rate of greater than three in both horizontal and vertical directions, however, and the selected media is CRT monitor 24, inteφolation processor 20 selects one of the four-point inteφolation kernel tables K 5 -Kι 6 providing relatively shaφer apparent edge contrasts. For example, the inteφolation kernel table Kiβ, with coefficient a set to -2.2, provides a maximum degree of overshoot and undershoot, producing a very shaφ apparent edge contrast when applied to the inteφolated image data. The shaφer inteφolation kernel lookup table provides a higher apparent slope to compensate for the limited dynamic range of CRT monitor 24, thereby improving the visible presentation of the inteφolated image data to a human viewer. After inteφolation processor 20 has narrowed the selection process to either the set of two-point inteφolation kernel lookup tables K 1 -K or the set of four-point inteφolation kernel lookup tables K5-K16 based on the selected format, and to a particular subset of the inteφolation kernel lookup tables Ki-Kiβ based on the selected media the process turns to selection of a particular inteφolation kernel lookup table based on the appearance characteristic selected by appearance characteristic selector 14. Thus, even though the selection by inteφolation processor 20 is largely driven by format and media considerations, it still may be desirable to allow a system user some latitude for shaφness and smoothness. As a first example, if a selected format requires an expansion rate of greater than three in both horizontal and vertical directions, and the selected media is dry silver film, inteφolation processor 20 selects one of the four-point inteφolation kernel tables K5-K16 providing a shaφ apparent edge contrast. The apparent shaφness produced by each of inteφolation kernel tables K5-K16 increases in response to an increase in the coefficient a. Thus, if it is determined that inteφolation kernel table Kg produces a sufficient overshoot/undershoot effect to improve the visible presentation of the inteφolated image data, but the system user still desires a shaφer appearance, inteφolation processor 20 selects a higher-numbered inteφolation kernel lookup table having a coefficient a that corresponds to the desired shaφness. Fig. 3 is a flow diagram illustrating a method for adaptive inteφolation of image data, in accordance with the present invention. It will be recognized that the method of the present invention can be readily implemented by the system 10 described above. As shown in the flow diagram of Fig. 3, the method includes a step of selecting one of a plurality of formats for presentation of an image on an imaging media, as indicated by block 40. A particular imaging media is selected for presentation of an image, as indicated by block 42. Further, one of a plurality of appearance characteristics, representing shaφness or smoothness, are selected for the presentation of the image on the imaging media, as indicated by block 44. As indicated by block 46, one of a plurality of different inteφolation kernel lookup tables then is selected based on a combination of the selected format, the selected media, and the selected appearance characteristic. Each of inteφolation kernel lookup tables contains a plurality of inteφolation coefficients representing the inteφolation carried by a different inteφolation kernel functions, as described above with respect to system 10. Finally, as indicated by block 48, the inteφolation coefficients contained in the selected inteφolation kernel lookup table are applied to the image data to produce the inteφolated image data. EXAMPLE The following example is provided to illustrate a system and method for adaptive inteφolation of image data, in accordance with the present invention. In particular, the following example illustrates one possible implementation of the selection process carried out by the system and method of the present invention. In this example, one of inteφolation kernel lookup tables Ki-K* is selected if the selected format requires an expansion factor of less than or equal to three in horizontal and vertical directions, and one of inteφolation kernel lookup tables K 5 -Kπ is selected if the selected format requires an expansion factor of greater than three in horizontal and vertical direction. If the selected media is silver halide and the selected format requires an expansion factor of less than or equal to three, one of inteφolation kernel lookup tables K 1 -K4 is selected according to the selected appearance characteristic, with Ki representing the shaφest appearance and K 2 the smoothest. If the selected media is silver halide and the selected format requires an expansion factor of greater than three, one of inteφolation kernel lookup tables in the subset K 5 -K 12 is selected according to the selected appearance characteristic, with K5 representing the smoothest appearance in the subset and Kι 2 the shaφest. If the selected media is dry silver and the selected format requires an expansion factor of less than or equal to three, one of inteφolation kernel lookup tables K 1 -K- 1 is selected according to the selected appearance characteristic, with K] representing the shaφest appearance and K 2 the smoothest. If the selected media is dry silver and the selected format requires an expansion factor of greater than three, one of inteφolation kernel lookup tables in the subset Kg-Kι is selected according to the selected appearance characteristic, with Kg representing the least shaφ appearance in the subset and Kι 4 the shaφest. If the selected media is CRT monitor 24 and the selected format requires an expansion factor of less than or equal to three, one of inteφolation kernel lookup tables K 1 -K4 is selected according to the selected appearance characteristic, with Ki representing the shaφest appearance and K the smoothest. If the selected media is CRT monitor 24 and the selected format requires an expansion factor of greater than three, one of inteφolation kernel lookup tables in the subset Kio-Kiβ is selected according to the selected appearance characteristic, with K10 representing the least shaφ appearance in the subset and K J6 the shaφest. Having described the exemplary embodiments of the invention, additional advantages and modifications will readily occur to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. Therefore, the specification and examples should be considered exemplary only, with the true scope and spirit of the invention being indicated by the following claims.

Claims: What is claimed is: 1. A method for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, said method comprising the steps of: selecting one of a plurality of formats for presentation of said image on imaging media; selecting one of a plurality of different inteφolation kernel lookup tables based on the selected format, each of said inteφolation kernel lookup tables containing a plurality of inteφolation coefficients; and inteφolation means for applying the selected inteφolation kernel lookup table to said image data to produce said inteφolated image data. 2. The method of claim 1, wherein said plurality of inteφolation kernel lookup tables includes at least one inteφolation kernel lookup table containing a plurality of two-point inteφolation coefficients and at least one inteφolation kernel lookup table containing a plurality of four-point inteφolation coefficients. 3. The method of claim 1, wherein said plurality of inteφolation kernel lookup tables includes an inteφolation kernel lookup table containing a plurality of pixel replication inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of bilinear inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of third order polynomial inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of fifth order polynomial inteφolation coefficients, and an inteφolation kernel lookup table containing a plurality of cubic spline inteφolation coefficients. 4. The method of claim 1, further comprising the step selecting one of a plurality of appearance characteristics of said presentation of said image on said imaging media, said step of selecting one of said inteφolation kernel lookup tables further including a step of selecting one of said inteφolation kernel lookup tables based on both the selected format and the selected appearance characteristic. 5. The method of claim 4, wherein said plurality of appearance characteristics includes a plurality of degrees of apparent shaφness of said image relative to a degree of apparent smoothness of said image. 6. The method of claim 1, further comprising the step of selecting one of a plurality of imaging media for presentation of said image, said step selecting one of said inteφolation kernel lookup tables including selecting one of said inteφolation kernel lookup tables based on both the selected and the selected media. 7. The method of claim 6, wherein said plurality of media includes a silver halide film, a thermographic film, and a cathode ray tube monitor. 8. The method of claim 1, wherein said image is one of a plurality of images, each of said plurality of formats specifying a number of said images on said imaging media, said number of said images determining a size of each of said images. 9. A method for performing inteφolation on image data representative of a plurality of pixels within an image to produce inteφolated image data, said method comprising the steps of: selecting one of a plurality of imaging media for presentation of said image; selecting one of a plurality of different inteφolation kernel lookup tables based on the selected media, each of said inteφolation kernel lookup tables containing a plurality of inteφolation coefficients; and inteφolation means for applying the selected inteφolation kernel lookup table to said image data to produce said inteφolated image data. 10. The method of claim 9, wherein said plurality of inteφolation kernel lookup tables includes at least one inteφolation kernel lookup table containing a plurality of two-point inteφolation coefficients and at least one inteφolation kernel lookup table containing a plurality of four-point inteφolation coefficients. 11. The method of claim 9, wherein said plurality of inteφolation kernel lookup tables includes an inteφolation kernel lookup table containing a plurality of pixel replication inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of bilinear inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of third order polynomial inteφolation coefficients, an inteφolation kernel lookup table containing a plurality of fifth order polynomial inteφolation coefficients, and an inteφolation kernel lookup table containing a plurality of cubic spline inteφolation coefficients. 12. The method of claim 9, further comprising the step selecting one of a plurality of appearance characteristics of said presentation of said image on said imaging media, said step of selecting one of said inteφolation kernel lookup tables including selecting one of said inteφolation kernel lookup tables based on both the selected media and the selected appearance characteristic. 13. The method of claim 12, wherein said plurality of appearance characteristics includes a plurality of degrees of apparent shaφness of said image relative to a degree of apparent smoothness of said image. 14. The method of claim 9, wherein said plurality of media includes a silver halide film, a thermographic film, and a cathode ray tube monitor.

Inventors: MAHMOODI ABOLGHASSEM B, MAHMOODI, ABOLGHASSEM, B.
Applicants: MINNESOTA MINING & MFG, MINNESOTA MINING AND MANUFACTURING COMPANY
Application year: 1995
Main classification: G06T3
IPC codes: G06T3