Abstract:
An apparatus for computing a logarithm to a base p of a floating-point number X. The floating-point number X is represented in the format of (null1)Sxnull2ExnullMx, where Mxnull(1nullfx)null(1nullAxnull2nullK)null(Bxnull2nullN), where Sx is a sign, Ex is an exponent, Mx is a mantissa, 1nullMx
Abstract:
An apparatus for calculating an exponential calculating result for a base 2 floating-point number comprises a transforming device, K exponential tables and a multiplier. The transforming device receives the floating-point number, transforms the floating-point number to an integer part and a fractional part and outputs the integer part and the fractional part. The fractional part is an N-bit number and divided into K parts which have N1, N2, . . . , NK bits respectively, wherein NnullN1nullN2null . . . nullNK. Each of the exponential tables receives one of the K parts divided from the fractional part and outputs a result. The multiplier receives all results from the exponential tables and outputs a mantissa. The integer part outputted form the transforming device is an exponent. The mantissa, the exponent and a sign whose value is 0 is used to represent an exponential calculating result which is represented in the following format: (null1)Synull2Eynullmy, where Sy is the sign whose value is 0, Ey is the integer part, my is the mantissa and lnullmy
Abstract:
A fast line drawing method. First, the coordinates of two end points are received and a current point is assigned to one of the end points. The differences of x and y coordinates (nullx and nully) and the sum of error E are computed, the integer part of nullx over nully is denoted as Q. The current point is checked to determine whether it has reached the end point. If not and the value of E is negative, a point at the current point is drawn. The y-coordinate of the current point and E are updated by (Ynull1) and (Enull2nullx) respectively if E is non-negative, a span of pixels from (X,Y) to (XnullQ-1,Y) are drawn if the coordinate of last of Q points is less than the end point. Otherwise, a span of pixels from (X,Y) to (x2,Y) are drawn.
Abstract:
A method for converting N-bit image data of a digital image into M-bit image data, in which NnullMnullK, K>0, is disclosed. The method is adapted to be used for dithering in an image processing system or a computer graphic system. For example, an N-bit red color value of each pixel of the digital image can be converted into an M-bit red color value by this method with little or no color deviation. According to the method, a difference of the most significant n bits and the least significant n bits of the N-bit image data of a pixel is used as a preliminary criterion for color value conversion, in which n is preferably equal to K. An apparatus for converting N-bit image data of a digital image into M-bit image data, in which NnullMnullK, K>0, is also disclosed. The apparatus includes a subtraction operator for realizing the difference of the most significant n bits and the least significant n bits of the N-bit image data of the pixel.
Abstract:
A method for motion pixel detection with a static counter map so as to correctly evaluate whether a missing pixel is in a static region or a non-static region, thereby reconstructing the missing pixel by an inter-field interpolation process or an intra-field interpolation process, respectively.
Abstract:
A method for motion pixel detection with adaptive thresholds, according to the global motion information among the reference video fields, so as to correctly evaluate whether a missing pixel is in a static region or a non-static region, thereby reconstructing the missing pixel by an inter-field interpolation process or an intra-field interpolation process. If the amount of motion among the reference fields is large, there is high motion information among the reference fields, so the threshold is set to be small; if the amount is small, there is less motion information between the reference fields, and so the threshold should be set to be large.