49 results about "Packed pixel" patented technology

The resolution of text rendered on a display device having sub-pixel elements, such as an RGB LCD for example, and in particular, on a display device having horizontal striping is enhanced by (i) overscaling (or oversampling) character outline information in the vertical (or Y) direction, and (ii) filtering displaced information from the overscaled (or oversampled) character outline information. Metrics associated with character outline information may be appropriately adjusted. The vertical (or Y) position of the baseline of adjacent characters may be constrained by forcing the first pixel above the baseline to be composed of a full number N of scan conversion source samples, where N corresponds to an overscaling (or oversampling) factor. Groups of scan conversion source samples may be converted into packed pixel index values. Color values may be selectively filtered when the differences in the intensity of adjacent sub-pixel elements would otherwise be irritating to view. Finally, the gamma of the pixel values may be corrected so that the gamma of the display device is considered and so that intensity values of sub-pixel elements fall within a range of intensities in which gamma correction is more useful.

An image compression method for compressing groups of pixel data, including the following steps: MSB portions and LSB portions of the pixel data are compressed separately. Further, the LSB portions are grouped according to their associated MSB portions so that similar pixels are compressed together to gain higher a compression ratio. Some LSB portions are truncated to ensure a compression ratio. When performing compression, enhanced variable-length coding is adopted that predicts more accurate dividers by considering weighted combination of adjacent pixels. The quotient of each groups of compression portion is predicted and coded accordingly.

Image compression, decompression and motion detection methods are described. Two temporally adjacent frame images, a previous time frame and a current time frame, are compressed in round-off and averaging techniques. Next, according to the compressed data of two corresponding pixels of the two frame images, whether or not the pixel of the current time frame image is of a motion picture is detected. If the pixel is of a motion picture, the compressed pixel data of the previous time frame image is decompressed, and an overdrive process is performed on the decompressed pixel data and the original pixel data of the current time frame image to produce an overdrive output. If the pixel is not of a motion picture, an overdrive process is not performed.

The invention provides a Mura phenomenon compensation method. An LCD display panel is divided into multiple display subareas comprising M rows and N columns of pixel points, pixel points at the first row and the first column and pixel points at the (M/2+1)th row and the (N/2+1)th column are selected respectively in each display subarea to serve as first pre-selected pixel points and second pre-selected pixel points; according to gray compensation values of four nearest first pre-selected pixel points around the position where a solved pixel point is and gray compensation values of the second pre-selected pixel points in the display subarea where the solved pixel point is, the gray compensation value of the solved pixel point in the display subarea is calculated. Through the gray compensation values of the second pre-selected pixel points, whether tiny Mura exists in the display subareas can be accurately judged, better compensation effects can be provided for tiny Mura falling in the display subareas, that is, compressed pixel areas, Mura compensation effects are ensured while consumption of hardware storage space is reduced, the product quality is enhanced, and the operation is simple and quick.

A method and system for rendering three-dimensional graphics, including text, provide a compressed texture bitmap. The texture bitmap may represent multiple symbols, each comprised of multiple pixels. Each pixel in the texture bitmap may store information for more than one symbol, including compressed pixels corresponding to multiple distinct symbols. For example, the compressed texture bitmap may have n-bit pixels (e.g., 8-bit pixels) that each store m (e.g., four) n/m-bit (e.g., 2-bit) compressed values. The compressed texture bitmap may be configured for unpacking by a conventional pixel shader, such as a pixel shader that does not typically perform bitwise operations. The unpacking may include matching a fetched pixel to a value in a lookup table, such as a 32-bit value from a 256-color palette. The looked-up value can be separated into separate sub-values to facilitate processing by the pixel shader. For example, the looked-up value can be split into RGBA values conventionally used in processing colored pixels.

A method of dictionary coding using coding unit (CU) based processing or using string length coding by taking into account of color component aligned matched sample-strings are disclosed. In the dictionary coding using CU based processing, the pixels in each CU is converted to one-dimensional (1-D) pixel data according to an intra-block scanning pattern. A string search is then performed to determine a match condition regarding whether a current sample-string starting at a current position of the current 1-D packed pixel data matches a previously coded sample-string in the reference 1-D packed pixel data. For string length coding by taking into account of color component aligned matched sample-strings, a flag is signaled to indicate whether the string length of one previously coded sample-string is in a length group corresponding to color-component-aligned previously coded sample-strings.

A compressed pixel level for a pixel in a frame of an image is compared with the (compressed) pixel level for the same pixel in a previous image frame. If the pixel level is unchanged, then the pixel is not moving. An uncompressed pixel level is then used for that pixel in the current image. If the pixel level is changed, then the pixel is moving, and a decompressed, boosted pixel level is used for that pixel in the current image.

Methods, systems, and apparatuses for averaging data in packed format are provided. The data may be image data, such as data words containing color-specific data portions representative of pixels of a captured image. A first data word containing first image data is received. A second data word containing second image data is received. A logical AND of the first data word and the second data word is performed to generate a third data word. A logical exclusive OR (XOR) of the first data word and the second data word is performed to generate a fourth data word. A right shift of the fourth data word is performed. The third data word and the right shifted fourth data word are summed to generate a fifth data word that is an average of the first and second data words.

Systems, apparatuses, and methods for compressing pixel data are disclosed. In one embodiment, if a block of pixel data is equal to a constant value, a processor compresses the block down to a metadata value which specifies the constant value for the entire block of pixel data. The processor also detects if the constant value is equal to a video specific typical minimum or maximum value. In another embodiment, the processor receives a plurality of M-bit pixel components which are most significant bit aligned in N-bit containers. Next, the processor shifts the M-bit pixel components down into least significant bit locations of the N-bit containers. Then, the processor converts the N-bit containers into M-bit containers. Next, the processor compresses the M-bit containers to create a compressed block of pixel data which is then stored in a memory subsystem.

The source driver for use in an active matrix liquid crystal display includes an input block for generating a pixel data sequence having pixel data transmitted through N numbers of channels as a unit pixel data, a multiplexing block for compressing the pixel data sequence to thereby output through a data bus having data lines corresponding to N/L numbers of channels, a shift register for generating a latch enable signal, and a line latch circuit constituted M numbers of latches receiving the pixel data inputted when the corresponding latch enable signal is inputted, wherein L, M, N are natural numbers, N is multiple number of L, and M is lager than N.

A pixel block (300) is compressed by sub-sampling at least a portion of the pixels (310) into subblocks (320, 330). Predictions are determined for the property values of these subblocks (320, 330) by calculating a variance measure based on property values of neighboring pixels (310) /subblocks (320, 330) in two prediction directions in the block (300) relative to a current subblock (320, 330). Ifthe variance is below a threshold, the prediction is calculated based on neighboring property values in both directions. If the measure exceeds the threshold, the neighboring property values in only one of the two predictions directions are used for calculating the prediction. A guiding bit (450) descriptive of the selected direction is also provided. A prediction error is calculated based on theproperty value and the calculated prediction. The compressed block (400) comprises an encoded representation (460) of the prediction error and any guiding bit (470).

An acquiring unit divides one line of image data in a main scan direction into blocks for every n consecutive pixels to acquire compressed pixel data generated by compressing each of the divided blocks. A first switching unit alternately switches a first or second data retaining unit defined as a write destination of the decompressed pixel data. A second switching unit alternately switches the first or second data retaining unit defined as a readout source of pixel data such that the pixel data are read out from the first or second data retaining unit not defined as the write destination of the pixel data by the first switching unit. A controller controls output of the pixel data from the first or second data retaining unit.

Techniques are disclosed relating to compression of pixel data using different quantization for different regions of a block of pixels being compressed. In some embodiments, compression circuitry is configured to determine, for multiple components included in pixels of the block of pixels being compressed, respective smallest and greatest component values in respective regions of the block of pixels. The compression circuitry may determine, based on the determined smallest and greatest component values, to use a first number of bits to represent delta values relative to a base value for a first component in a first region and a second, different number of bits to represent delta values relative to a base value for a second component in the first region. The compression circuitry may then quantize delta values for the first and second components of pixels in the first region of the block of pixels using the determined first and second numbers of bits. In some embodiments, the compression circuitry determines whether to provide cross-component bit sharing within a region.

A data processing apparatus includes a compression circuit and a first output interface. The compression circuit generates a plurality of compressed pixel data groups by compressing pixel data of a plurality of pixels of a picture based on a pixel data grouping setting of the picture, and generates indication information indicative of at least one boundary each between consecutive compressed pixel data groups. The first output interface packs the compressed pixel data groups into at least one output bitstream, and outputs the at least one output bitstream via a camera interface.

Disclosed are an image decompression method and a device for executing the same. Taking the first row of original pixel data in a frame of image as initial reference data, the image decompression method comprises the following steps: step 1, reading and judging whether each compressed pixel data in the i row after the frame of image is compressed is within a preset threshold range; if so, adding the compressed pixel data with the data at the same address in the reference data; otherwise, reading non-compressed pixel data corresponding to the pixel address of the compressed pixel data, and adding the non-compressed pixel data with the data at the same address in the reference data; and step 2, judging whether the value of i is equal to the total row number in the frame of image, if so, completing decompression of the frame of image, otherwise, setting i=i+1, and returning to step 1, wherein the initial value of i is set to 2. The image decompression method is simple in level, definite in significance and easy to implement, and can fast realize non-destructive recovery and reconstruction for an image of specific compressed data stream.

Techniques are disclosed relating to data compression. In some embodiments, compression circuitry determines, at least partially in parallel for multiple different lossless compression techniques, a number of bits needed to represent a least compressible pixel, using that technique, in a set of pixels being compressed. The compression techniques may include neighbor, origin, and gradient techniques, for example. The compression circuitry may select one of the compression techniques based on the determined numbers of bits for the multiple compression techniques and corresponding header sizes. In some embodiments, the compression circuitry determines, for multiple regions of pixels in the set of pixels, for ones of the compression techniques, a region number of bits needed to represent a least compressible pixel, using that technique. The selection of a compression technique may be further based on region numbers of bits.

One embodiment of the present invention discloses a method for processing video data within a video data processing path of a processing unit. The video data processing path includes three stages. In the first stage, source operands are extracted from a local register file and are ordered to map efficiently onto the downstream data path. In the second stage, arithmetic operations are performed on the source operands based on video processing instructions to generate intermediate results. In the third stage, additional operations are performed on the intermediate results based on the video processing instructions. In some embodiment, the intermediate results are combined with additional operands retrieved from the local register file.

The invention provides an electronic ink screen picture byte compression method and system, electronic equipment and a storage medium, and relates to the technical field of image transmission, and the method comprises the following steps: S1, obtaining to-be-displayed electronic ink screen original picture information from an upper computer; s2, segmenting the original picture information of the electronic ink screen to obtain a plurality of pieces of byte information; s3, representing a plurality of pieces of byte information in a byte stream mode; wherein one byte represents eight pixel points, and each pixel point is represented by one bit; s4, compressing low six-bit pixel points in one byte through a preset compression process to obtain a target compressed pixel point data packet; and S5, combining the compressed target compressed pixel point data packets into a target compressed picture data packet, and transmitting the target compressed picture data packet to the electronic ink screen. According to the method, the communication time of the picture data of the electronic ink screen can be shortened, the picture data transmission reliability is improved, and the communication power consumption is reduced.