52 results about "Packed pixel" patented technology

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.

Methods and devices for compressing and uncompressing three color component graphics and / or digital video data for storage to and retrieval from a reduced memory space, while allocating memory space for pixel data special attribute, such as a transparency attribute. 24 bit video data, for example, may be compressed and stored along with 2 bits of transparency data in a 16-bit memory space, without undue loss of fidelity relative to the original graphics and / or video data. The stored and compressed video data may be uncompressed and a correction factor may be selectively applied to each of the three component pixel data. The resulting uncompressed pixel data matches or closely resembles the video data prior to compression and storage. The correction factor may vary depending upon the color space of the graphics and / or video pixel data.

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.

An image coding method includes: a predictive pixel generation step of generating a predictive value from at least one surrounding pixel located near a compression target pixel; a code conversion step of code-converting the pixel data to generate a Gray code; and quantizing bit change information (exclusive OR) between the generated Gray code and a Gray code of the predictive value to a quantization value, to compress the pixel data. This prevents significant image quality degradation, so that high image quality can be achieved.

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 discloses a lossless video compression method and system for a digital KVM switcher having low delay and low complexity. The lossless video compression method comprises the following steps of: (1), writing frame-level coding information of a screen video image in a code stream; (2), sequentially inputting RGB data of pixels to be compressed in the screen video image; (3), calculating the prediction mode of the current pixels according to the spatio-temporal correlation; (4), calculating the coding mode of the current pixels according to the prediction mode of the current pixels; (5), writing a compression bit in the code stream according to the coding mode of the current pixels; (6), repeating the steps (2)-(5), such that coding of all the pixels in the screen video image of the current frame is completed; and (7), performing byte alignment filling of the code stream of the current frame, such that coding of the screen video image of the current frame is completed. The method disclosed by the invention is applied to compression of the screen video image of the digital KVM switcher; the compression processing delay and the code stream data volume of the screen video image can be effectively reduced under the limited calculation complexity; and simultaneously, lossless video quality can be kept.

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).

Embodiments of the present invention may provide a apparatus and method for compressing image data by dividing the data into color components data streams, taking the differences between successive pixels in the data streams, and coding these differences into a compressed data stream using a Huffman coding scheme. The compressed data may be transmitted to a decompressor over an interface. The decompressor may divide the compressed data stream back into color component data streams and decompress the pixels by adding the coded differences to reference values corresponding to previously decompressed pixels of the same color component to generate successive pixels of that color component. Merge registers may then recombined the decompressed data into the original image data. According to embodiments of the present invention, the compression / decompression process may be lossless.

A system and method of performing digital image compression comprises comparing pixels in various locations in a digital picture image frame; coding a position of pixels located in a foreground of the digital picture image frame; sending the coded positions of the pixels located in a foreground of the digital picture image frame to a frame buffer of a sprite controller; separating a background pixel group from a foreground pixel group in the digital picture image frame based on the coded positions; compressing the pixels in the foreground pixel group; and transmitting a frame number and a frame buffer parameter dimension corresponding to the compressed pixels to a digital picture image display viewer.

A data processing apparatus includes a compression circuit, a rate controller, and an output interface. The compression circuit generates compressed pixel data groups, each derived from applying a compression operation to pixel data of a pixel group, wherein the pixel group includes a portion of a plurality of pixels in a picture. The rate controller applies bit rate control to each compression operation, wherein the rate controller adjusts the bit rate control according to a position of each pixel boundary between different pixel groups. The output interface outputs the compressed pixel data groups via a plurality of camera ports of a camera interface, respectively.

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.

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.

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.