Abstract: An image processing apparatus includes a signal processing section for processing an image signal including a first signal and a second signal. The signal processing section processes the first signal and the second signal using different interpolation programs from each other.

Abstract: In a device and system which perform processing (displaying and outputting) of image data, the amount of data transferred between a memory holding the image data and a processor processing the image data is limited, thereby a great amount of data can be processed at high speed.

Abstract: Disclosed are an arithmetic unit and an arithmetic processing method. In the arithmetic unit, in linear interpolation of a parameter of a pixel to be used to plot an object in a three-dimensional video, an operation result value can be fixed in response to a particular gradient value of the parameter and power consumption arising from charging and discharging through a clock wiring line can be reduced. The arithmetic unit includes an arithmetic operation element for linearly interpolating a parameter of a pixel in a triangle based on coordinate values of a vertex of the triangle and gradient values of the parameters in X and Y directions, a clock supply element for supplying a clock signal to the arithmetic operation element, a detection element for detecting a particular gradient value of the parameter in the X direction or/and the Y direction, and a control element for controlling the clock supply element in response to a gradient value of the parameter detection signal received from the detection element.

Abstract: The middle of line segments may be drawn on a computer display using an iterative method that reduces the number of calculations required. The process is repeated for each column. The first pixel is plotted according to a formula that allows the first pixel to best represent the location of the line in the column. A second pixel is then plotted either above, below, to the left of, or the right of the first pixel depending on the direction of the line. A normalized intensity value between 0 and 1.0 is then assigned to the first pixel according to the amount of area above, below, to the left of, or the right of the line in the first pixel depending on the direction of the line. This value may be assigned using a variable computed in plotting the first pixel. A normalized intensity value for the second pixel equal to 1.0 minus the normalized intensity value of the first pixel may then be assigned. Finally, the first and second pixels are shaded according to the normalized intensity values.

Abstract: A method corrects opacity values of samples in a rendering pipeline. The method partitions a range of uncorrected alpha values into a plurality of segments in a low to high order. Corrected alpha values for uncorrected alpha values in the highest segment are determined by direct table look-up. Corrected alpha values for uncorrected alpha values in all but the highest segment are determined by linear interpolation.

Abstract: Image alias rejection when converting a high resolution rasterized waveform to a lower resolution rasterized waveform for display uses a statistical filter. The statistical filter provides a shaped probability density function either by combining the outputs of multiple random number generators, such as linear feedback shift registers, or by using a corresponding look-up table to produce a dither signal. The statistical filter may be applied to one or both of the dimensional values for each data point of the high resolution rasterized waveform by combining the dimensional values with the dither signal. The resulting filtered dimensional values may then be subsampled, such as by truncation, to produce values for a lower resolution rasterized waveform display.

Abstract: In accordance with the present invention, the rate of change of texture addresses when mapped to individual pixels of a polygon is used to obtain the correct level of detail (LOD) map from a set of prefiltered maps. The method comprises a first determination of perspectively correct texture address values found at four corners of a predefined span or grid of pixels. Then, a linear interpolation technique is implemented to calculate a rate of change of texture addresses for pixels between the perspectively bound span corners. This linear interpolation technique is performed in both screen directions to thereby create a level of detail value for each pixel. The YUV formats described above have Y components for every pixel sample, and UN (they are also named Cr and Cb) components for every fourth sample. Every UN sample coincides with four (2×2) Y samples. This is identical to the organization of texels in U.S. Pat. No.

Abstract: A configurable filter module for providing shared filter resource between an overlay engine and a texture mapping engine of a graphics system. The configurable filter may comprise a plurality of linear blend units each of which receives data input from one of the overlay engine and a mapping engine cache, and generates a linear blend filter output respectively; and a filter output multiplexer which receives data output from the linear blend units and selects a proper byte ordering output, wherein the linear blend units serve as an overlay interpolator filter to perform linear blending of the data input from the overlay engine during a linear blend mode, and serve as a texture bilinear filter to perform bilinear filtering of the data input from the mapping engine cache during a bilinear filtering mode.

Abstract: Interpolation of a new frame between a previous frame and a current frame of a video stream by motion compensated frame rate upsampling. The interpolation method includes identifying nodes and edges of objects such as triangles present in the previous frame, constructing a superimposed triangular mesh based on the identified nodes and edges, estimating displacement such nodes in the superimposed triangular mesh from the previous frame with respect to the current frame, and rendering the new frame based on the estimated displacement of nodes. Additionally, pixels of the previous frame and the current frame may be classified according to whether a pixel's value has changed from the previous frame to the current frame. This classification may be used during rendering to reduce overall processing time. Pixel-based forward motion estimation may be used to estimate motion of pixels between the previous frame and the current frame and the estimated motion may be used in estimating node displacement.