Patent Grant
9485457
1. Field of the Invention
The present invention relates to an image processing apparatus for converting moving image data having a first frame rate into moving image data having a higher frame rate, and a method of controlling the same.
2. Description of the Related Art
Conventionally, a CRT has been synonymous with a moving image display device for, for example, television. However, so-called liquid crystal displays, plasma displays, and FED displays have been put into practical use in recent years. That is, there are now displays of various types.
The displays of these types adopt different display methods. For example, display devices based on a liquid crystal device (e.g., direct-view-type liquid crystal display device, liquid crystal rear projector, and liquid crystal front projector) use many scanning methods. In any case, the light output period in each pixel portion occupies a large part of the display period of one frame. For this reason, such a display device is called a hold-type display device.
On the other hand, in, for example, a CRT or FED, light is output in each pixel portion once in a frame. The light emission time is much shorter than the frame display period and is normally 2 msec or less. For this reason, such a display device is called an impulse-type display device.
There also exist a so-called plasma display and a field sequential display which are of types different from the above-described classes.
The display methods of the respective types have the following features.
(1) Hold-Type Display Device
A display device of this type emits light during a large part of a frame period. Hence, the temporal imbalance of light intensity is small, and flicker is rarely observed. Additionally, pursuit (i.e., the pursuit by the eyes of a moving portion of a moving image) makes motion blur relatively large in accordance with the length of the light emission period in a frame. “Motion blur” here is different from that caused by the response characteristic of a display device.
(2) Impulse-Type Display Device
A display device of this type emits light in a very short time during a frame period. Hence, the temporal imbalance of light intensity is large, and flicker synchronous with a frame is observed. However, motion blur in pursuit is rarely observed. It is therefore possible to obtain a resolution almost equal to that of a still portion.
In general, the light emission period of a display device changes depending on the display method and display device. The above-described types (1) and (2) are diametrically opposed in terms of the light emission period. The longer the light emission period (corresponding to the hold time) in each method is, the larger the motion blur in pursuit is. The shorter the light emission period is, the smaller the motion blur is. That is, the light emission period and the magnitude of motion blur are almost proportional to each other. On the other hand, concerning flicker synchronous with a frame, the longer the light emission period is, the smaller the flicker observed. The shorter the light emission period is, the larger the observed flicker. That is, the light emission period and flicker have a trade-off relationship.
A solution to the two problems is multiplying the frame frequency by N. In many case, N=2. That is, the rate is doubled. When the frame frequency is doubled, the light emission period in each double-rate frame is halved. This also almost halves the motion blur. Regarding flicker as well, if an initial frame frequency of 60 Hz is doubled to 120 Hz, the frequency of flicker falls outside the response characteristic of human eyes. Hence, no flicker is observed.
As described above, doubling the frame frequency (more generally speaking, multiplying the frame frequency by N) has a large effect but poses a new problem.
For example, when the frame frequency of an original image signal is 60 Hz, the image information is updated every 1/60 sec. If the frame frequency is doubled to display image data at 120 Hz, necessary image information is missing every other frame. As a measure, identical images are displayed, for example, twice if the frame frequency is doubled. This solves flicker but cannot improve motion blur in the original image. In an impulse-type display device, doubled images are observed in pursuit (this phenomenon will be referred to as “double-blurring” hereinafter).
To reduce the motion blur or double-blurring and prevent flicker, two methods are mainly used to double the frame frequency.
The first method detects the motion of an object in an original image and estimates images between two frames. This is generally called an intermediate image generation method by motion compensation. In this first method, an estimation error occurs under a specific condition. In addition, the amount of computation required is extremely high.
In the second method, a filter process is first performed for each frame of an input image to separate a spatial high-frequency component strongly related to motion blur and a spatial low-frequency component strongly related to flicker. The spatial high-frequency component is concentrated in one sub-frame (one of the two double-rate frames corresponding to the original frame). The spatial low-frequency component is distributed to both sub-frames (both of the two double-rate frames corresponding to the original frame).
In this specification, this second method will be called a “method of separating an image into spatial frequencies and distributing them to sub-frames for display”.
As the “method of separating an image into spatial frequencies and distributing them to sub-frames for display”, Japanese Patent Laid-Open No. 6-70288 (to be referred to as patent reference 1 hereinafter), Japanese Patent Laid-Open No. 2002-351382 (to be referred to as patent reference 2 hereinafter), and U.S. Pre-Grant Publication No. 2006/0227249A1 (to be referred to as patent reference 3 hereinafter) are known.
The present invention can further improve the latter (second method) with a relatively light processing load.
In examining the “method of separating an image into spatial frequencies and distributing them to sub-frames for display”, two problems are posed.
The first problem is that a display image in actual pursuit has distortion. The second problem is that it is impossible to make full use of the dynamic range of a display device.
The first problem is supposed to be caused when a spatial high-frequency component and a spatial low-frequency component generated from each frame of an input image are distributed to sub-frames, and the temporal centers of gravity of their components shift in display.
In pursuit, the display time of each image corresponds to the spatial position of the image observed in pursuit. If the temporal center of gravity shifts, the spatial center of gravity shifts in the image observed in pursuit. Even in an image observed in pursuit, if the spatial center of gravity of the spatial high-frequency component and that of the spatial low-frequency component have a shift relative to one another, an image having distortion such as ghosting or tail-blurring is obtained, as in a normal image.
In patent reference 1, the rate of an original image is doubled, and the spatial high-frequency component of one sub-frame (one of the two corresponding double-rate frames) is limited, and the presence/absence of the limitation is controlled in accordance with the motion of the image. Hence, when the high-frequency component is limited, its temporal center of gravity shifts to the sub-frame in which the high-frequency component is not limited. As a result, an image in which the temporal center of gravity of the high-frequency component and that of the low-frequency component of the input image have a shift is displayed, and ghosting or tail-blurring may be observed in pursuit.
In patent reference 2, the rate of an original image is doubled, and the spatial high-frequency components of two double-rate frames (two sub-frames corresponding the frame of the input image) are increased or decreased in accordance with the motion. In this case as well, the temporal center of gravity of the spatial high-frequency component shifts to the sub-frame in which the high-frequency component is increased. Hence, ghosting or tail-blurring may be observed in pursuit, like the above-described case.
In patent reference 3, the rate of an original image is doubled, and the spatial high-frequency component of one sub-frame is increased, and that of the other sub-frame is decreased by the same amount. In this case as well, the temporal center of gravity of the spatial high-frequency component shifts to the sub-frame in which the high-frequency component is increased. Hence, ghosting or tail-blurring may be observed in pursuit, like the above-described case.
The second problem, that it is impossible to make full use of the dynamic range of a display device, will be described below.
When the display level of one sub-frame is moved to the other sub-frame, the maximum display intensity of the sub-frame whose display level has risen is limited. At this time, the display intensity of the sub-frame with the lower display level has not reached the maximum value. For this reason, it is impossible to use the dynamic ranges of the two sub-frames at maximum.
The present invention has been made in consideration of the above-described problems, and has as its object to provide a technique of mitigating at least the first and/or second problems using a simple arrangement.
For example, the present invention to solve the first problem has the following arrangement.
According to one aspect of the present invention, there is provided an image processing apparatus configured to output moving image data which is input at m frames per unit time as output moving image data at N×m (N≧2) frames per unit time, comprises:
a filter unit configured to separate image data from an input frame of interest into spatial high-frequency component image data and spatial low-frequency component image data;
a storage unit configured to store the spatial high-frequency and spatial low-frequency component image data obtained by the filter unit;
a read unit configured to read the spatial high-frequency component image data and the spatial low-frequency component image data from the storage unit N times;
a multiplication unit configured to, multiply the spatial high-frequency component image data and the spatial low-frequency component image data by predetermined multiplier coefficients which are set to make a temporal center of gravity of the spatial high-frequency component image data match that of the spatial low-frequency component image data and make temporal distribution of the spatial high-frequency component image data smaller than that of the spatial low-frequency component image data;
an addition unit (3) configured to add the spatial high-frequency component image data and the spatial low-frequency component image data after multiplication by the multiplication unit every time the data is read; and
an output unit configured to output the summed image data from the addition unit.
According to another aspect of the present invention, there is provided an image processing apparatus configured to receive input moving image data at m frames per unit time and output moving image data at 2m frames per unit time, comprises:
a receiving unit configured to receive input image data of each frame;
a filter unit configured to separate image data of an input frame of interest into spatial high-frequency component image data and spatial low-frequency component image data;
a storage unit configured to store the input image data, the spatial high-frequency component image data, and the spatial low-frequency component image data;
a calculation unit configured to calculate low-frequency averaged image data that is an averaged value of low-frequency component image data of an input frame temporally adjacent the frame of interest and the low-frequency component image data of the frame of interest stored in the storage unit;
a generation unit configured to generate high-frequency emphasized image data based on the low-frequency component image data and the high-frequency component image data; and
an output unit configured to output, sequentially for each frame, the high-frequency emphasized image data and the low-frequency averaged image data obtained by the calculation unit.
According to still another aspect of the present invention, there is provided an image processing apparatus configured to output moving image data which is input at m frames per unit time as output moving image data containing N×m (N≧2) frames per unit time, comprises:
filter unit configured to separate input moving image data of a frame of interest into R (R≧2) spatial frequency band component images;
storage unit configured to store the R image data components obtained by the filter unit;
reading unit configured to read the R image data components from the storage unit N times;
multiplication unit configured to multiply the R image data components by predetermined multiplier coefficients which are set to make the temporal centers of gravity of the R image data components match, and make the temporal distribution of the R image data components smaller in ascending order of the spatial frequency of the component image;
addition unit configured to adds the R spatial frequency band image data components after multiplication by the multiplication unit every time the reading reads the R spatial frequency band image data components; and
output unit which outputs the summed image data from the addition unit.
According to yet another aspect of the present invention, there is provided an image processing apparatus configured to output moving image data which is input at m frames per unit time as output moving image data at N×m (N≧2) frames per unit time, comprises:
filter unit configured to separate an image of a frame of interest into a spatial high-frequency image data component and a spatial low-frequency image data component;
storage unit configured to store each spatial frequency image data component obtained by the filter unit;
reading unit configured to read the spatial high-frequency image data component and the spatial low-frequency image data component from the storage unit N times;
multiplication unit configured to multiply the spatial high-frequency image data component and the spatial low-frequency image data component by predetermined multiplier coefficients which are set to allocate the low-frequency image data component to a larger number of frames than the high-frequency image data component;
addition unit which adds the spatial high-frequency image data component and the spatial low-frequency image data component after multiplication by the multiplication unit every time the reading unit reads out the spatial high-frequency image data component and the spatial low-frequency image data component; and
output unit configured to output the summed image data from the addition unit.
According to still yet another aspect of the present invention, there is provided a method of controlling an image processing apparatus which outputs moving image data input at m frames per unit time as output moving image data at N×m (N≧2) frames per unit time, the method comprises:
separating an image of a frame of interest into a spatial high-frequency image data component and a spatial low-frequency image data component;
storing each spatial frequency image data component obtained in the filtering step in a storage unit;
reading the spatial high-frequency image data component and the spatial low-frequency image data component from the storage unit N times;
multiplying the spatial high-frequency image data component and the spatial low-frequency image data component by predetermined multiplier coefficients which are set to make a temporal center of gravity of the spatial high-frequency image data component match that of the spatial low-frequency image data component and make the temporal distribution of the spatial high-frequency image data component smaller than that of the spatial low-frequency image data component;
adding the spatial high-frequency image data component and the spatial low-frequency image data component after multiplication every time the spatial high-frequency image data component and the spatial low-frequency image data component are read; and
outputting the image data summed in the adding step.
According to yet still another aspect of the present invention, there is provided a method of controlling an image processing apparatus which inputs moving image data containing m frames per unit time and outputs moving image data containing 2m frames per unit time, the method comprises:
inputting image data of each frame;
separating image data of an input frame of interest into a spatial high-frequency image data component and a spatial low-frequency image data component;
storing a low-frequency image data component of an immediately preceding frame of the frame of interest in a storage unit;
calculating a low-frequency image data average that is an averaged value of the low-frequency image data component of a frame input next to the frame of interest obtained in the filtering step and the low-frequency image data component stored in the storage unit; and
sequentially outputting for each frame, high-frequency emphasized image data generated based on the low-frequency image data component and the high-frequency image data component, and the low-frequency image data average.
According to still yet another aspect of the present invention, there is provided a method of controlling an image processing apparatus which outputs moving image data input at m frames per unit time as output moving image data at N×m (N≧2) frames per unit time, the method comprises:
separating the input moving image data of a frame of interest into R (R≧2) spatial frequency band component images;
storing the R image data components obtained in a storage unit;
reading the R image data component from the storage unit N times;
multiplying the R image data components by predetermined multiplier coefficients which are set to make the temporal centers of gravity of the R image data components match, and make the temporal distribution of the R image data components smaller in ascending order of the spatial frequency of the component image;
adding the R spatial frequency band image data components after multiplication every time the R spatial frequency band image data components are read; and
outputting the summed image data from the addition.
According to yet still another aspect of the present invention, there is provided a method of controlling an image processing apparatus which outputs moving image data input at m frames per unit time as output moving image data containing N×m (N≧2) frames per unit time, the method comprises:
separating an input image of a frame of interest into a spatial high-frequency image data component and a spatial low-frequency image data component;
storing each spatial frequency image data component obtained in a storage unit;
reading the spatial high-frequency image data component and the spatial low-frequency image data component from the storage unit N times;
multiplying the spatial high-frequency image data component and the spatial low-frequency image data component by predetermined multiplier coefficients which are set to allocate the low-frequency image data component to a larger number of frames than the high-frequency image data component;
adding the spatial high-frequency image data component and the spatial low-frequency image data component after multiplication every time the spatial high-frequency image data component and the spatial low-frequency image data component are read; and
outputting the image data summed in the addition.
According to the present invention, it is possible to, for example, reduce motion blur in a hold-type display device and reduce flicker in an impulse-type display device using a simple process. It is also possible to suppress distortion such as ghosting or tail-blurring in pursuit. The invention also enables prevention of any adverse effects on image quality caused by a decrease in brightness or saturation of the level of one sub-frame.
Further features of the present invention will become apparent from the following description of exemplary embodiments (with reference to the attached drawings).
The embodiments of the present invention will now be described with reference to the accompanying drawings.
For easy understanding of the embodiments of the present invention, the relevant prior art will be described first with reference to
In the prior art arrangement shown in
In another prior art arrangement shown in
In still another prior art arrangement shown in
In these prior art arrangements, the two corresponding double-rate frames (or one of the sub-frames viewed from the input image), that is, the frames SH and SL, are generated on the basis of one input frame. When, for example, the frame SH is displayed first, and the frame SL is then displayed, the frame SH contains a large amount of spatial high-frequency component of the input image frame. Hence, the spatial high-frequency component shifts forward on a time basis. On the other hand, the spatial low-frequency component is distributed to both the frames SH and SL and does not shift at all on a time basis. Hence, the spatial high-frequency component shifts forward on a time basis relative to the spatial low-frequency component.
When pursuit is done for a moving portion of a moving image, the forward shift on a time basis is equivalent to spatial shift in the moving direction in an image observed in pursuit. Hence, the spatial high-frequency component in the image observed in pursuit shifts in the moving direction relative to the spatial low-frequency component. In this case, an image having ghosting or tail-blurring is observed.
The first embodiment can mitigate the first problem described above. More specifically, the first embodiment can enable the elimination of the relative time shift in display (output) of spatial high-frequency component image data and spatial low-frequency component image data. In the first embodiment, it is therefore possible to prevent or reduce ghosting or tail-blurring in an image observed in pursuit.
A lowpass filter 1 (to be referred to as an LPF 1 hereinafter) is a two-dimensional lowpass filter. This filter does not define a specific function. For example, a Gaussian function is usable. Alternatively, a moving average or a weighted moving average is usable. In the following description, an effective distance that is ½ the maximum value of a filter coefficient is defined as “distance constant value: d”. The distance constant value d indicates a wavelength corresponding to a spatial frequency that is equal to a cutoff frequency in limiting the bandwidth of an image by a spatial frequency filter. The unit of d is “pixel”.
The LPF 1 first cuts off (filters), from the input image A[i], upper spatial frequencies above a predetermined constant value, thereby generating the spatial low-frequency component data L[i]. A subtractor 2 calculates the spatial high-frequency component data H[i] by subtracting L[i] from the original image data A[i] in accordance with
H[i]=A[i]−L[i]
An adder 3 adds the high-frequency component data H[i] to the original image data A[i], thereby generating sub-image data (spatial high-frequency emphasized image data) SH[i] containing a large amount of spatial high-frequency components.
SH[i]=A[i]+H[i]=L[i]+2×H[i]
Each of frame delay circuits 4 and 5 delays the current frame by one frame to perform calculation between the current frame and the next frame. The frame delay circuit 4 eliminates the frame shift between a signal input to a terminal a of a switch 8 and a signal input to a terminal b.
An adder 6 adds spatial low-frequency component data L[i−1] generated by the LPF 1 and delayed by one frame to L[i] of the next frame.
A divider 7 calculates an average value by dividing the image data from the adder 6 by “2” and outputs it as low-frequency averaged image data SL[i−1].
SL[i−1]={L[i−1]+L[i]}/2
The frame delay circuit 4 delays SH[i] by one frame to generate SH[i−1] so that SH[i] calculated by the adder 3 matches SL[i−1].
The thus generated SH[i−1] and SL[i−1] are selected by the switch 8 at a frequency twice that of the input image frames, and are sequentially output. This enables output of a double-rate image signal containing a spatial high-frequency component localized in one frame. It is therefore possible to realize an image with small motion blur and small flicker.
In the embodiments of the present invention, calculations and definitions are explained for displayed brightness (displayed light intensity) as an example. In the embodiments, a timing chart showing, for example, the waveform of an image expresses brightness along the ordinate. Hence, the present invention is most effective when it is applied to image data defined as data proportional to displayed brightness (displayed light intensity). However, the present invention is not always limited to such a case. The present invention is also applicable to image data in a range generally used (image data having slight nonlinearity between data values and displayed brightness or light intensity). Even in this case, the concept of the present invention approximately holds and provides a sufficiently advantageous effect.
Reference numeral 11 in
The output images SH[i−1], SH[i], and SH[i+1] corresponds to input images A[i−1], A[i], and A[i+1], respectively. The elements of the output images are calculated from the corresponding frames of the input images. On the other hand, for example, constituent elements L[i] and L[i+1] of an output image SL[i] are calculated from A[i] and A[i+1], respectively. SL[i] is the average value of the elements.
With this relationship, ½ of L[i] that is the spatial low-frequency component data of A[i] is output (displayed) as SH[i], and the remaining ¼ components are displayed as SL[i−1] and SL[i].
Hence, the temporal center of gravity of display of L[i] is located at the intermediate point between SL[i−1] and SL[i], that is, at the center of the display period of SH[i]. On the other hand, H[i] that is calculated as the spatial high-frequency component of A[i] is wholly displayed as SH[i]. The temporal center of gravity of display of H[i] is located at the center of the display period of SH[i]. Consequently, the temporal center of gravity of display of L[i] matches that of H[i]. That is, distortion such as ghosting or tail-blurring in an image observed in pursuit can be prevented.
<Order of SH and SL>
This embodiment will be explained assuming that the two sub-frame signals SH[i] and SL[i] corresponding to one input data frame A[i] are output such that they are displayed in that order. For example,
The order that outputs SL later, as in the explanation of this embodiment, will be referred to as a “forward order”, and the order that outputs SL first will be referred to as a “reverse order” hereinafter.
In the “forward order”, SL takes an average value by referring to the low-frequency component of a frame of interest and that of an immediately succeeding frame. Actually, after waiting one frame for the immediately succeeding frame to be input, the average value between the temporarily saved current frame and the newly input frame is calculated. Hence, the output low-frequency image is expressed by
SL[i−1]=(L[i−1]+L[i])/2
In contrast, in the “reverse order”, SL takes an average value by referring to the low-frequency component of a frame of interest and that of an immediately preceding frame. Hence, the output low-frequency image is expressed by
SL[i]=(L[i]+L[i−1])/2
The two equations have the same form except that the output frame numbers differ by one.
Anyway, one low-frequency image data SL corresponds to the average value of low-frequency images reflected on two sub-frames SH adjacent to the sub-frame of interest.
As described in association with the prior art, bilaterally asymmetrical distortion occurs in a pursuit image, as shown in
In this embodiment, N=2, and the spatial frequency has two bands, a high frequency H and a low frequency L. In the present invention, however, the frame frequency of an input image may be multiplied by N (or divided into N sub-frames), and the input image may be divided into a plurality of spatial frequency bands. In this case, of the plurality of bands, a higher-frequency component is concentrated on the time basis, whereas a lower-frequency component is distributed on the time basis. Additionally, the temporal centers of gravity are arranged to match. Hence, N may be 2 or more so that an input image is divided into a plurality of spatial frequency bands.
To satisfy the above conditions of the spatial high-frequency component H and spatial low-frequency component L, and concentrate H to one sub-frame, the number of sub-frames to distribute must be odd and at least 3. In this embodiment, N=2, and display is done using sub-frames obtained by doubling the frame rate. One input image is distributed to three sub-frames. That is, the number Nd of sub-frames to distribute is 3. In this embodiment, the relationships (N=2, and Nd=3) are simultaneously achieved as frames adjacent to each other in an input image share one of the sub-frames at the ends as the sub-frame to distribute. If N is an even number, the components are distributed to Nd (Nd≧N) that is an odd number, and adjacent frames share, for example, one sub-frame. The coefficient of the sub-frame is obtained by adding the original distribution coefficients. This solves the mismatch between N and Nd. The sum value must not exceed the coefficient of another sub-frame of the same spatial frequency component.
The first line of
Frequency components corresponding to A[i] in the first line of
The block diagram in
Each of switches 58 to 61 selects its four output terminals in the order of (1)→(2)→(3)→(4)→(1) . . . step by step every time the output clk2 from the doubling circuit 50 is input. The switches 58 and 59 are connected to channels of the same number. The switches 60 and 61 are also connected to channels of the same number. However, the switches 60 and 61 are connected to channels whose number differs by two steps from that of the switches 58 and 59. The output terminals (4) of the switches are dummy connections to generate timings. For the operation shown in
A multiplier having a predetermined coefficient is connected to each channel of the switches 58 to 61. Each of adders 62, 63, 64, and 65 adds the outputs from the corresponding switch. An adder 66 adds the outputs from the adders 62 to 65.
The switches 58 and 60 have the same combination of coefficients of multipliers. The switches 59 and 61 also have the same combination of coefficients of multipliers.
The coefficients GH1 to GH3 of the multipliers of the switches 58 and 60 are related to a spatial high-frequency component and indicated by the H component in
The flow of signals in
The output terminals (0) of the switches 51 and 52 previously output the components from the immediately preceding frames H[i−1] and L[i−1] to frame memories 54 and 55 so that they temporarily store the signals.
The frame memories 54, 55, 56, and 57 receive new data from the filter 53 and update their contents every time the switches 51 and 52 are connected to corresponding terminals. Each stored data item is held for a period corresponding to two frame periods in the input image. Additionally, immediately before connections of the switches 58 to 61 change from the output terminal (4) to the output terminal (1), the contents of the corresponding frame memories are updated.
In this state, the switches 58 to 61 sequentially change the output terminals. These outputs are added to obtain the output of this embodiment. For example, when the switches 58 and 59 change the output terminals in the order of (1)→(2)→(3), it indicates that components corresponding to A[i−1] in
The output signal of this block diagram obtained in the above-described way corresponds to the eighth line (lowermost stage) of
As a result, an image having smaller motion blur and smaller flicker can be obtained, as in the first embodiment.
<Cause of Tail-Blurring>
The reason why ghosting or tail-blurring is generated when the temporal center of gravity shifts between L[i] and H[i] will be described below. An example will be explained here in which the frame frequency of the input image is 60 Hz.
Note that tail-blurring is a kind of distortion that draws a trail before or after an edge of an object in pursuit.
Consider pursuing an image which has a brightness scanning line with a rectangular waveform, and which moves V (pixels) per 1/60 sec, as shown in
In a hold-type display device having a pulse width of, for example, 1/60 sec (frame frequency: 60 Hz), motion blur with a width of V (pixels) is observed (corresponding to the tilted portions shown in
In a hold-type display device having a pulse width of, for example, 1/120 sec (frame frequency: 120 Hz), motion blur with a width of V/2 (pixels) is observed (corresponding to the tilted portions shown in
In impulse driving, the pulse width is small. Hence, a pursuit image relatively close to the waveform of a still image is obtained.
Since the display period is 1/120 sec, the waveform exhibits motion blur corresponding to the pulse width of 1/120 sec shown in
Actually, SH[i] and SL[i] in
In this embodiment, for example, SL[i] which is displayed between SH[i] and SH[i+1] is formed from the average value of spatial low-frequency components corresponding to them, that is, {L[i]+L[i+1]}/2, as shown in
As described above, in pursuit, L[i] is generated from the same frame of the input image as that of SH[i] which is displayed 1/120 sec earlier, and therefore formed with a shift in the direction opposite the moving direction of the image by ½ (V/2) of the moving distance per frame. On the other hand, L[i+l] is generated from the same frame of the input image as that of SH[i+l] which is displayed 1/120 sec later, and therefore formed with a shift in the direction opposite the moving direction of the image by ½ (V/2) of the moving distance per frame. Hence, the waveform SL[i] (={L[i]+L[i+1]}/2) obtained by adding them and dividing the sum by 2 is located almost the same position as SH[i] in terms of temporal center of gravity, as shown in
Actually, SH[i] and SL[i] in
An example has been described above in which a hold-type display device, whose pulse width equals the frame period, displays an input image with a frame frequency of 60 Hz at a double rate. Even in an impulse-type display device, the problems of the prior art and the effect of the embodiment are the same.
Assume that an impulse-type display device has a pulse width of 1/100 of the frame period, that is, the input image has a pulse width of 1/600 sec (1.67 msec) and a frame frequency of 60 Hz. Consider a case in which when the frame rate is doubled, the pulse width is ½ of it ( 1/1200 sec (=0.83 msec)).
In this case, the pursuit image of the prior art has waveforms as shown in
V/2 in
An example will be described in which a process equivalent to the first embodiment is implemented by a computer program. An apparatus for executing the computer program can be an information processing apparatus such as a personal computer (PC). The structure and features of the hardware comprising a PC are well known, so will not be described here. We assume that a moving image data file containing m frames per unit time is already stored in a storage device (or storage medium) such as a hard disk. An example will be described in which the CPU executing the application (computer program) of this modification converts the file into moving image data to be played back at twice the frame rate, that is, 2 m frames per unit time, and saves the conversion result in the hard disk as a file. The conversion target moving image data is stored in the storage device. The moving image data after double-rate conversion is also stored in the storage device. Hence, the application need not display the double-rate conversion result. That is, note that the CPU need not execute the process in synchronism with the frame rate of the moving image represented by the conversion target moving image data, either. The application of the modification is also stored in the hard disk. The CPU loads the application to the RAM and executes it.
In step S1, the CPU reads out image data A[i] of one frame from the conversion target moving image data to the RAM. If the data is encoded, the CPU executes a corresponding decoding process.
In step S2, the CPU filters the input image data frame of interest A[i] using a preset LPF to generate spatial low-frequency component data L[i].
The process advances to step S3. The CPU generates spatial high-frequency component data H[i].
H[i]=A[i]−L[i]
In step S4, the CPU generates high-frequency emphasized image data SH[i] and temporarily stores it in the RAM.
SH[i]=A[i]+H[i]=L[i]+2×H[i]
In step S5, the CPU reads out an immediately preceding frame SH[i−1] from the memory area A as a current frame.
In step S6, the CPU saves SH[i] in the memory area A to prepare for the process of the next input frame.
In step S7, the CPU reads out an immediately preceding frame SL[i−1] from the memory area B as a current frame.
In step S8, the CPU saves SL[i] in the memory area B to prepare for the process of the next input frame.
In step S9, the CPU generates low-frequency averaged image data SL[i−1].
SL[i−1]={L[i−1]+L[i]}/2
After generating the high-frequency emphasized image data SH and low-frequency averaged image data SL, the CPU advances the process to step S10. In step S10, the CPU outputs the two generated image data (sub-frames) as output moving image data.
SH[i−1] used in step S5 uses the process result in step S6 of the preceding cycle. SL[i−1] used in step S7 uses the process result in step S8 of the preceding cycle. In double-rate conversion of the first frame of the image data, no low-frequency image data of a preceding frame exists. In this case, the process is executed assuming an appropriate pixel value.
In step S11, the CPU determines whether all frames of the conversion target moving image data are converted. This process can be done by determining whether the file end of the conversion target moving image data is detected.
If NO in step S11, the variable i is incremented by “1”, and the process from step S1 is repeated.
If YES in step S11, the CPU finishes the series of double-rate conversion processes.
As described above, as compared with the first embodiment, the conversion process speed depends on the CPU. It is however possible to create a double-rate moving image data file having the same function and effect as in the first embodiment.
In the second embodiment, an example of a solution to the above-described second problem will be described.
The second problem occurs when each frame of an input image is filtered to separate a spatial high-frequency component related to motion blur and a spatial low-frequency component related to flicker. That is, in a method of displaying an image by concentrating the spatial high-frequency component to one sub-frame and distributing the spatial low-frequency component to both sub-frames, it is impossible to make full use of the dynamic range of the display device.
“One sub-frame” indicates one of two double-rate frames corresponding to the input image frame. “Both frames” indicates both of the two double-rate frames corresponding to the input image frame.
In such a display method, the spatial high-frequency component is concentrated to one sub-frame, as in a hold type shown in
To prevent any decrease in brightness, k needs to be as close to “1” as possible. To allow this, it is necessary to minimize the absolute value of the spatial high-frequency component portions in
For this purpose, a distance constant value d of the LPF or HPF is minimized. More specifically, the spatial frequency to separate the spatial low-frequency component and the spatial high-frequency component needs to be set high. In other words, the distance constant value of the filter must be made small to decrease the absolute value of the high-frequency component.
If the distance constant value d is too small, an overshoot portion shown in
In the second embodiment, a large distance constant value d is set for a portion that moves fast in an input image. A small distance constant value d is set for a portion that moves slowly. That is, in the second embodiment, the distance constant value d is determined adaptively for each area of an image in consideration of the spatial frequency distribution of the input image and the moving speed of each portion.
As shown in
The functions of blocks in
A delay circuit (DL) 21 delays input image data by one frame and outputs it. In fact, the DL 21 can be formed from a FIFO memory for storing one frame of image data. When the current frame of image data input to the adaptive multi-stage low-pass filter 20 is A[i], the DL 21 outputs the preceding frame A[i−1] of the image data.
The LPFs 22 and 23 filter the input image data in accordance with a distance constant value d1.
The LPFs 24 and 26 receive, as input data, signals L1[i−1] and L1[i] from the upstream LPFs 22 and 23 and area data AREA1 output from a difference comparator 25. A distance constant value d2 is preset for the LPFs 24 and 26. The LPFs 24 and 26 respectively filter L1[i−1] and L1[i] corresponding to the pixels in the area represented by the area data AREA1 in accordance with the distance constant value d2. Although the filtering process is done in that area, the range where the image data is changed by this process is wider than the area by the distance constant value d2. The filtering results are output as L2[i−1] and L2[i].
The LPFs 28 and 29 receive, as input data, the signals L2[i−1] and L2[i] from the LPFs 24 and 26 and area data AREA2 output from a difference comparator 27. A distance constant value d3 is preset for the LPFs 28 and 29. The LPFs 28 and 29 respectively filter L2[i−1] and L2[i] corresponding to the pixels in the area represented by the area data AREA2 in accordance with the distance constant value d3. Although the filtering process is done in that area, the range where the image data is changed by this process is wider than the area by the distance constant value d3. The filtering results are output as L3[i−1] and L3[i].
The LPF 31 receives, as input data, the signal L3[i] from the LPF 29 and area data AREA3 output from a difference comparator 30. A distance constant value d4 is preset for the LPF 31. The LPF 31 filters L3[i] corresponding to the pixels in the area represented by the area data AREA3 in accordance with the distance constant value d4. Although the filtering process is done in that area, the range where the image data is changed by this process is wider than the area by the distance constant value d4. The filtering result is output as a final result L[i] of the adaptive multi-stage low-pass filter 20.
The difference comparator 25 receives L1[i−1] and L1[i], calculates the absolute value of the difference for each pixel, and based on the result, calculates the area data AREA1. A constant value C1 for determination is preset for the difference comparator 25. AREA1 is array data with the same form as L1. Data corresponding to a pixel whose absolute value of the difference is larger than C1 is defined as “1”. Data corresponding to a pixel whose absolute value of the difference is smaller than C1 is defined as “0”.
More specifically, for each pixel (x,y),
when |L1[i](x,y)−L1[i−1](x,y)|≧C1,
AREA1(x,y)=“1” and
when |L2[i](x,y)−L1[i−1](x,y)|<C1,
AREA1(x,y)=“0”
The area data AREA1 defined in this way is output by the difference comparator 25.
The difference comparator 27 receives L2[i−1] and L2[i], calculates the absolute value of the difference for each pixel, and based on the result, calculates the area data AREA2. A constant value C2 for determination is preset for the difference comparator 27. AREA2 is array data with the same form as L2. Data corresponding to a pixel whose absolute value of the difference is larger than C2 is defined as “1”. Data corresponding to a pixel whose absolute value of the difference is smaller than C2 is defined as “0”.
More specifically, for each pixel (x,y),
when |L2[i](x,y)−L2[i−1](x,y)|≧C2,
AREA2(x,y)=“1” and
when |L2[i](x,y)−L2[i−1](x,y)|<C2,
AREA2(x,y)=“0”
The area data AREA2 defined in this way is output by the difference comparator 27.
The difference comparator 30 receives L3[i−1] and L3[i], calculates the absolute value of the difference for each pixel, and based on the result, calculates the area data AREA3. A constant value C3 for determination is preset for the difference comparator 30. AREA3 is array data with the same form as L3. Data corresponding to a pixel whose absolute value of the difference is larger than C3 is defined as “1”. Data corresponding to a pixel whose absolute value of the difference is smaller than C3 is defined as “0”.
More specifically, for each pixel (x,y),
when |L3[i](x,y)−L3[i−1](x,y)|≧C3,
AREA3(x,y)=“1” and
when |L3[i](x,y)−L3[i−1](x,y)|<C3,
AREA3(x,y)=“0”
The area data AREA3 defined in this way is output by the difference comparator 30.
Considering the above explanation, the operation of the adaptive multi-stage LPF 20 of the second embodiment shown in
The outline will briefly be described first.
The LPF 23 always performs the filtering process in all areas of every frame. If there is an area where the filtering result by the LPF 23 is insufficient, the LPF 26 executes the filtering process. If there is still an area where filtering is insufficient, the filtering process is performed by the LPF 29 and then by the LPF 31.
It is determined in the following way whether filtering by an LPF is sufficient in each area.
The LPFs 22, 24, and 28 filter the preceding frame A[i−1] of the image data. The difference between the filtering result of the current frame A[i] of the image data and the filtering result of the preceding frame is compared with a threshold. An area where the difference is larger than the threshold is determined as an area where filtering by the LPF is insufficient. In contrast, an area where the difference is less than or equal to the threshold is determined as an area where filtering by the LPF is sufficient. Information representing the area determined to have an insufficient difference is sent to the LPF of the next stage. The LPF of the next stage executes the filtering process in that area. The adaptive multi-stage LPF 20 of this embodiment is a 4-stage LPF. Hence, even if the filtering result is finally insufficient, the filtering result by the LPF 31 is output as the image data L[i] that is the output of the adaptive multi-stage LPF 20.
The filtering process of this embodiment will be described below in accordance with the sequence.
First, the input image A[i] and the immediately preceding frame A[i−1] of the image data pass through the LPFs 22 and 23, respectively. That is,
L1[i]=LPF1(A[i])
L1[i−1]=LPF1(A[i−1])
Actually, L1[i−1] is already calculated in the output process of the immediately preceding frame. Hence, the calculated data may be saved and loaded from the memory.
The difference comparator 25 calculates the absolute value of the difference between L1[i−1] and L1[i], compares the absolute value with a threshold constant value C for each pixel (x,y) to create the area data AREA1, and sends it to the LPFs 24 and 26.
The LPFs 24 and 26 execute the filtering process LPF2 of the data L1[i−1] and L1[i] sent from the upstream in the area represented by AREA1. This process can be represented by, for example,
L2=L1−(AREA1*L1)+LPF2((AREA1*L1))
(AREA1*L1) means an operation of outputting image data in which pixel data whose component in AREA1 is “1” is the same as the data in the image data L1, and pixel data whose component in AREA1 is “0” remains “0”. The thus obtained L2[i] and L2[i−1] are sent to the LPFs 28 and 29.
The LPFs 28 and 29 execute the filtering process LPF3 of the data L2[i−1] and L2[i] sent from the upstream in the area represented by AREA2. This process can be represented by, for example,
L3=L2−(AREA2*L2)+LPF3((AREA2*L2))
(AREA2*L2) means an operation of outputting image data in which pixel data whose component in AREA2 is “1” is the same as the data in the image data L2, and pixel data whose component in AREA2 is “0” remains “0”. The thus obtained L3[i] is sent to the LPF 31.
The LPF 31 executes the filtering process LPF4 of the sent data L3[i] in the area represented by AREA3. This process can be represented by, for example,
L4=L3−(AREA3*L3)+LPF4((AREA3*L3))
(AREA3*L3) means an operation of generating image data in which pixel data whose component in AREA3 is “1” is the same as the data in the image data L3, and pixel data whose component in AREA3 is “0” remains “0”.
The thus obtained L[i] is output as image data that is the output of the adaptive multi-stage LPF 20.
The adaptive multi-stage LPF 20 according to the second embodiment includes the first filter unit (LPFs 23, 26, 29, and 31) and the second filter unit (LPFs 22, 24, and 28). Sequentially from the upstream stage, the absolute value of the difference between image data obtained by the nth corresponding filters of the first and second filter units is calculated. If there is an area where the absolute value of the difference is less than or equal to a predetermined threshold Cn, only that area undergoes the LPF of the next stage. In this way, image data is finally generated, in which the absolute value of the difference is smaller than the predetermined threshold in all areas, and all areas have undergone only the minimum and necessary filtering process. This image data is output as the low-frequency image data L[i] of the frame of interest. In this embodiment, an example in which Cn can be set for each stage has been described. However, all thresholds Cn may be set to a single common value C. This is a realistic method which can also obtain a sufficient effect.
In the example described in the second embodiment, the adaptive multi-stage LPF 20 as shown in
In the second embodiment, a 4-stage LPF is used. The characteristic can be further improved by using a larger number of stages. In fact, a well-balanced number of stages is preferably set in consideration of, for example, the circuit scale and calculation load. For example, in the smallest scale, the number of stages=2, as shown in
The adaptive multi-stage low-pass filter preferably executes the filtering process in accordance with an image portion (e.g., a portion with fast motion or a portion with slow motion). However, the filtering process may be done with an entire image.
The DL 21 delays input image data by one frame and outputs it. The DL 21 can be formed from a FIFO memory for storing one frame of image data, for example. When the current frame of image data input to the adaptive multi-stage LPF 20 is A[i], the DL 21 outputs the preceding frame A[i−1] of the image data.
The LPFs 22 and 23 are always active, and filter the input image data in accordance with the distance constant value d1.
The LPFs 24 and 26 are activated when a determination signal dif_1 from the difference comparator 25 is “1” to filter the image data from the upstream LPFs 22 and 23 using the distance constant value d2. If the determination signal dif_1 from the difference comparator 25 is “0”, the LPFs 24 and 26 do not perform the filtering process.
The LPFs 28 and 29 are activated when a determination signal dif_2 from the difference comparator 27 is “1” to filter the image data from the upstream LPFs 24 and 26 using the distance constant value d3. If the determination signal dif_2 from the difference comparator 27 is “0”, the LPFs 28 and 29 do not perform the filtering process.
The LPF 31 is activated when a determination signal dif_3 from the difference comparator 30 is “1” to filter the image data from the upstream LPFs 28 and 29 using the distance constant value d4. If the determination signal dif_3 from the difference comparator 30 is “0”, the LPF 31 does not perform the filtering process.
Let X1 and X2 be pixel data output from the LPFs 22 and 23. The difference comparator 25 calculates the absolute value |X1−X2| of the difference, compares the absolute value with the threshold C1, and outputs the comparison result as the determination signal dif_1.
More specifically,
when a condition |X1−X2|≦C1 is satisfied, dif_1=“0”, and
when a condition |X1−X2|>C1 is satisfied, dif_1=“1”
This also applies to the difference comparators 27 and 30. The difference comparator 27 uses the threshold C2 and outputs the determination result as dif_2. The difference comparator 30 uses the threshold C3 and outputs the determination result as dif_3.
A switch SW1 selects the terminal “1” when the determination signal dif_1 from the difference comparator 25 is “1” and the terminal “0” when the determination signal dif_1 is “0”. This also applies to switches SW2 to SW4.
Considering the above explanation, the operation of the adaptive multi-stage LPF 20 shown in
The outline will briefly be described first.
The LPF 23 always performs the process for every frame. If the filtering result by the LPF 23 is insufficient, the LPF 26 executes the filtering process. If the filtering result is still insufficient, the filtering process is performed by the LPF 29 and then by the LPF 31.
It is determined in the following way whether filtering by an LPF is sufficient.
The LPFs 22, 24, and 28 filter the preceding frame A[i−1] of the image data. The difference between the filtering result of the current frame A[i] of the image data and the filtering result of the preceding frame is compared with a threshold. If the difference is larger than the threshold, it is determined that the filtering by the LPF is insufficient. On the other hand, if the difference is less than or equal to the threshold, it is determined the filtering by the LPF of the stage is sufficient, and the filtering process result of that stage is output as the image data L[i] that is the output of the adaptive multi-stage LPF 20. The adaptive multi-stage LPF 20 is a 4-stage LPF. Hence, if the determination result dif_3 of the final difference comparator 30 is “1”, the filtering result by the LPF 31 is output as the image data L[i] that is the output of the adaptive multi-stage LPF 20.
The filtering process of this embodiment will be described below in accordance with the sequence.
First, the input image A[i] and the immediately preceding frame A[i−1] of the image data pass through the LPFs 22 and 23, respectively. That is,
L1[i]=LPF1(A[i])
L1[i−1]=LPF1(A[i−1])
Actually, L1[i−1] is already calculated in the output process of the immediately preceding frame. Hence, the calculated data may be saved and loaded from the memory.
The difference comparator 25 calculates the absolute value of the difference between L1[i] and L1[i−1] and compares the absolute value with the threshold constant value C1.
When |L1[i]−L1[i−1]|<C1, the filtering result L1[i] of the current frame is sufficient. Hence, the difference comparator 25 outputs the determination signal dif_1=“0”. Consequently, the switch SW1 selects the output terminal “0” to output L1[i] as the output L[i] of the adaptive multi-stage LPF 20. When the determination signal dif_1=“0”, the difference comparator 27 of the next stage unconditionally sets the determination signal dif_2 to “0”. This also applies to the difference comparator 30.
On the other hand, when |L1[i]−L1[i−1]|≧C1, the filtering result L1[i] of the current frame is insufficient. Hence, the difference comparator 25 outputs the determination signal dif_1=“1”. This activates the LPFs 24 and 26. The switch SW1 selects the output terminal “1”. The LPFs 24 and 26 filter L1[i1] and L1[i−1], respectively.
The difference comparator 27 calculates the absolute value of the difference between the output L2[i] and L2[i−1] from the LPFs 24 and 26 and compares the absolute value with the threshold constant value C2.
When |L2[i]−L2[i−1]|<C2, the filtering result L2[i] of the current frame is sufficient. Hence, the difference comparator 27 outputs the determination signal dif_2=“0”. Consequently, the switch SW2 selects the output terminal “0” to output L2[i] as the output L[i] of the adaptive multi-stage LPF 20.
On the other hand, when |L2[i]−L2[i−1]|≧C2, the filtering result L2[i] of the pixel of interest of the current frame is insufficient. Hence, the difference comparator 27 outputs the determination signal dif_2=“1”. This activates the LPFs 28 and 29. The switch SW2 selects the output terminal “1”. The LPFs 28 and 29 filter L2[i1] and L2[i−1], respectively.
The difference comparator 30 calculates the absolute value of the difference between the output L3[i] and L3[i−1] from the LPFs 28 and 29 and compares the absolute value with the threshold constant value C3.
When |L3[i]−L3[i−1]|<C3, the filtering result L3[i] of the current frame is sufficient. Hence, the difference comparator 30 outputs the determination signal dif_3=“0”. Consequently, the switch SW3 selects the output terminal “0” to output L3[i] as the output L[i] of the adaptive multi-stage LPF 20.
On the other hand, when |L3[i]−L3[i−1]|≧C3, the filtering result L3[i] of the current frame is insufficient. Hence, the difference comparator 30 outputs the determination signal dif_3=“1”. This activates the LPF 31. Each of the switches SW3 and SW4 selects the output terminal “1” to output the filtering process result L4[i] by the LPF 31 as the output L[i] of the adaptive multi-stage LPF 20.
As a result, only one of the outputs from the LPFs 23, 26, 29, and 31 is output as the output L[i] of the adaptive multi-stage LPF 20.
The above-described process can be expressed as follows.
The adaptive multi-stage LPF 20 according to the second embodiment includes the first filter unit (LPFs 23, 26, 29, and 31) and the second filter unit (LPFs 22, 24, and 28). Sequentially from the upstream stage, the absolute value of the difference between image data obtained by the nth corresponding filters of the first and second filter units is calculated. The absolute value of the difference is compared with the predetermined threshold Cn to determine whether the difference is less than or equal to the threshold Cn in all areas. When the determination is achieved (when it is determined that the difference is smaller than Cn in all areas) for the first time, image data obtained by the nth filter of the first filter unit is output as the low-frequency image data L[i] of the frame of interest.
The operation of the adaptive multi-stage LPF shown in
As described above, according to the second embodiment, it is possible to mitigate the first and second problems.
In the third embodiment, a solution to the above-described second problem will be described.
In the above-described second embodiment, the distance constant value d of the LPF is appropriately controlled to suppress the ratio of the high-frequency component from becoming excessively high. That is, this prevents the brightness level of display from being saturated (i.e., SH[i]≧100%, or SH[i]<0 mathematically).
The third embodiment proposes a method of preventing a problem even when saturation of the display brightness level (i.e., SH[i]≧100%, or SH[i]<0 mathematically) still occurs after the above-described process. That is, SH[i] and SL[i] which are calculated once are corrected again to prevent any problem.
In the prior art shown in
L[i]=LPF(A[i])
H[i]=A[i]−L[i]
SH[i]=L[i]+2H[i]
SL[i]=L[i]
In the third embodiment, correction to be described later is performed for SH[i] and SL[i] obtained by calculations up to this point, thereby generating corrected images SH_0[i] and SL_0[i]. The values of SH_0[i] and SL_0[i] represent brightness levels to be actually displayed. That is, both SH_0[i] and SL_0[i] are images that are corrected to practically take a value of 0% to 100%. When a pixel value is expressed by 8 bits, “100%” is the upper limit “255” expressed by 8 bits, and “0%” is literally the lower limit “0” of an 8-bit value.
The parameters in
In the third embodiment, as shown in
This operation can actually be expressed in, for example, the C language as follows.
With this process, if the display brightness level is saturated (i.e., if SH[i]≧100%, or SH[i]<0 mathematically), the above-described correction can be performed to replace the data with SH_0[i] and SL_0[i]. It is therefore possible to prevent this problem in the image.
In the first embodiment shown in
L[i]=LPF(A[i])
H[i]=A[i]−L[i]
SH[i]=L[i]+2H[i]
SL[i]={L[i]+L[i−1]}/2
In the third embodiment, the correction process is performed for SH[i] and SL[i] obtained by calculations up to this point, thereby obtaining results SH_0[i] and SL_0[i]. The values of SH_0[i] and SL_0[i] represent brightness levels to be actually displayed and take a value of 0% to 100%.
The parameters in
In the third embodiment, as shown in
Similarly, as shown in
This operation can actually be expressed in, for example, the C language, as follows.
With this process, if the display brightness level is saturated (i.e., if SH[i]≧100%, or SH[i]<0 mathematically), the above-described correction can be done to replace the data with SH_0[i] and SL_0[i]. It is consequently possible to prevent this problem in the image. Even when the method described in this embodiment is applied, the temporal center of gravity of the spatial high-frequency component and that of the spatial low-frequency component do not change. Hence, no shift occurs between the display position of the spatial high-frequency component and that of the spatial low-frequency component in an image obtained in pursuit. It is therefore possible to prevent any operation error caused by the saturation of the brightness level while preventing distortion such as tail-blurring in an image observed in pursuit.
In the fourth embodiment, an example of a solution to the above-described first and second problems will be described.
In the fourth embodiment, an input image is separated into a plurality of spatial frequency components, and the display level is distributed (multiplied) to a plurality of sub-frames so that the temporal centers of gravity of the components match. This improves motion blur, double blurring and flicker. In the above-described first to third embodiments, one input frame is subjected to double-rate conversion (i.e., separated into two sub-frames), and spatial frequency separation is done to separate image data into a spatial high-frequency component and a spatial low-frequency component.
Let N be the magnification of the number of frames, and R be the number of frequency bands for spatial frequency separation. In the above-described embodiments, the frame frequency is doubled (N=2), or the spatial frequency band is separated into two bands (R=2), that is, a high-frequency component and a low-frequency component.
However, the present invention does not limit the number of sub-frames (i.e., does not limit N of “Nx-rate” to “2”). In spatial frequency band separation as well, the present invention does not limit the number of bands (i.e., does not limit R of “R bands” to “2”).
In this embodiment, conditions for obtaining the same effect as described above even when the frame frequency of an input image is multiplied by N (or separated into N sub-frames), and the input image is separated into R spatial frequency bands will be described. N and R are positive integers greater than or equal to 2.
N is not limited to 2 and can be 3 or more to obtain the same effect. If anything, large N is preferable for satisfying the condition of the present invention because the degree of freedom in distribution is high.
R is designed such that when an input image is separated into R spatial frequency bands, two adjacent bands (e.g., J and (J+1)) always have the above-described relationship for R=2. In this case, the same relationship holds in all bands from the first to Rth bands. That is, the R band components are made to have such a relationship that the temporal distribution of the band component images becomes smaller in descending order of spatial frequency (in other words, the temporal distribution becomes larger in ascending order of spatial frequency), and the temporal centers of gravity of all band components match. At this time, the effect of the present invention, that is, the effect of improving motion blur, preventing flicker, and reducing distortion such as tail-blurring is obtained. That is, in the present invention, even when N and R are generalized, the same effect as in the above-described arrangements with N=2 and R=2 is obtained.
Even in spatial frequency separation, the number of bands is not limited. In the fourth embodiment, N=5. This is equivalent to a process of, for example, converting the frame rate of an image having a frame frequency of 24 Hz (generally corresponding to a moving image of a movie) into a 5× frame rate of 120 Hz. The number R of bands will be exemplified as R=3 which does not make the scale of circuit and calculation so large. That is, an example in which the spatial frequency is separated into three bands: High, Middle, and Low will be described.
The operation of the arrangement in
A frame sync signal quintupling circuit 41 quintuples the frame sync signal of the input image A[i] to generate and output clk5.
Each of switches 45 and 46 is reset by the frame sync signal of the image A[i] and selects the output terminal in the order of (1)→(2)→(3)→(4)→(5) in accordance with clk5.
The H component temporarily saved in the frame memory 42 is read out five times in accordance with clk5 and sent to the switch 45. The switch 45 is connected to the output terminal (1) at the first stage of clk5. The output terminal then switches to (2), (3), (4), and (5) in this order. The M component saved in the frame memory 43 is also read out five times. The output terminal of the switch 46 sequentially switches from (1) to (5). The L component temporarily saved in the frame memory 44 is also read out five times.
Multipliers GH1 to GH5 which multiply the high-frequency components by their gains {0, 0.5, 4.0, 0.5, 0} shown in
Similarly, multipliers GM1 to GM5 which multiply the M components by their gains {0, 1.5, 2.0, 1.5, 0} shown in
That is, in reading out a component N times (in the embodiment, N=5), the gain (multiplier coefficient) gradually becomes large. The gain is maximized at the intermediate time (in the embodiment, third time) and then gradually becomes small.
A multiplier using a gain {1, 1, 1, 1, 1} is provided immediately after the frame memory 44. The gain of the low-frequency component does not change. Hence, one multiplier suffices, as shown in
Actually, the same arrangements as the switches 45 and 46 and the succeeding multipliers are necessary even immediately after the frame memory 44. However, the arrangements are not shown because the coefficient does not change in this case.
Adders 47 to 49 add the multiplied image data. As a result, S1[i], S2[i], S3[i], S4[i], and S5[i] are output from the first to fifth stages of clk in this order and displayed, which are given by
S1[i]=L[i]
S2[i]=L[i]+1.5M[i]+0.5H[i]
S3[i]=L[i]+2M[i]+4H[i]
S4[i]=L[i]+1.5M[i]+0.5H[i]
S5[i]=L[i]
(where [i] is the frame number of the corresponding input image A[i])
In this embodiment, the plurality of spatial frequency band components are set such that the temporal distribution becomes smaller in descending order of spatial frequency (in other words, the temporal distribution becomes larger in ascending order of spatial frequency), and the temporal centers of gravity of all components match, as described above.
In this display, when an object that moves in an image is pursued, the H, M, and L components of the observed image have no spatial shift. Hence, an image free from distortion such as ghosting or tail-blurring is observed.
The four embodiments of the present invention have been described above. In the embodiments, the output destination of each of the finally obtained Nx-rate frames is not mentioned specifically. The output destination can be either a hold- or impulse-type display device. The output destination is not limited to a display device. Instead, the data may be stored in a storage medium such as a DVD or a storage device such as a hard disk as a moving image file.
Like the above-described modification of the first embodiment, the second and subsequent embodiments also allow a computer program to implement an equivalent process.
Normally, a computer program is stored in a computer-readable storage medium such as a CD-ROM. The storage medium is set in the read device (e.g., CD-ROM drive) of a computer, and the program is made executable by copying or installing it in a system. Hence, such a computer-readable storage medium is also incorporated in the present invention.
While the present invention has been described with reference to exemplary embodiments, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. The scope of the following claims is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structures and functions.
This application claims the benefit of Japanese Patent Application No. 2007-207181, filed Aug. 8, 2007, which is hereby incorporated by reference herein in its entirety.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2007-207181 | Aug 2007 | JP | national |
This application is a continuation of U.S. application Ser. No. 13/797,316, filed Mar. 12, 2013, which is a continuation of U.S. application Ser. No. 12/186,582, filed on Aug. 6, 2008, now U.S. Pat. No. 8,421,917, issued Apr. 16, 2013 which claims priority to Japan Patent Application No. 2007-207181, filed Aug. 8, 2007. The entire disclosures of those applications are incorporated by reference herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6442203 | Demos | Aug 2002 | B1 |
| 6477279 | Go | Nov 2002 | B2 |
| 6900846 | Lee et al. | May 2005 | B2 |
| 7098959 | Mishima et al. | Aug 2006 | B2 |
| 7116372 | Kondo et al. | Oct 2006 | B2 |
| 7180548 | Mishima et al. | Feb 2007 | B2 |
| 8077258 | Take et al. | Dec 2011 | B2 |
| 8085848 | Kurata | Dec 2011 | B2 |
| 8384826 | Mori et al. | Feb 2013 | B2 |
| 20020015104 | Itoh et al. | Feb 2002 | A1 |
| 20040153581 | Nakaya et al. | Aug 2004 | A1 |
| 20040246374 | Mishima et al. | Dec 2004 | A1 |
| 20050163220 | Takakura et al. | Jul 2005 | A1 |
| 20060119617 | Toyooka et al. | Jun 2006 | A1 |
| 20060152443 | Song et al. | Jul 2006 | A1 |
| 20060227249 | Chen et al. | Oct 2006 | A1 |
| 20060239294 | Wogsberg | Oct 2006 | A1 |
| 20060256238 | Mishima et al. | Nov 2006 | A1 |
| 20070263121 | Take | Nov 2007 | A1 |
| 20090002559 | Poon | Jan 2009 | A1 |
| 20090040374 | Kobayashi | Feb 2009 | A1 |
| 20090040376 | Kobayashi | Feb 2009 | A1 |
| Number | Date | Country |
|---|---|---|
| 1804966 | Jul 2006 | CN |
| 1848234 | Oct 2006 | CN |
| 1 164 792 | Dec 2001 | EP |
| 1 708 488 | Oct 2006 | EP |
| 06-70288 | Mar 1994 | JP |
| 2002-351382 | Dec 2002 | JP |
| 2004-159294 | Jun 2004 | JP |
| 2004-297719 | Oct 2004 | JP |
| 1020010111740 | Dec 2001 | KR |
| Entry |
|---|
| Final Office Action dated Sep. 26, 2012 in U.S. Appl. No. 12/186,585. |
| U.S. Office Action dated Nov. 26, 2013; U.S. Appl. No. 13/979,316. |
| U.S. Office Action dated Jan. 18, 2012; U.S. Appl. No. 12/186,585. |
| Number | Date | Country | |
|---|---|---|---|
| 20140340578 A1 | Nov 2014 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13797316 | Mar 2013 | US |
| Child | 14453884 | US | |
| Parent | 12186582 | Aug 2008 | US |
| Child | 13797316 | US |
