Abstract: Techniques and mechanisms to efficiently cache data based on compression of such data. The technologies of the present disclosure include cache systems, methods, and computer readable media to support operations performed with data that is compressed prior to being written as a cache line in a cache memory. In some embodiments, a cache controller determines the size of compressed data to be stored as a cache line. The cache controller identifies a logical block address (LBA) range to cache the compressed data, where such identifying is based on the size of the compressed data and on reference information describing multiple LBA ranges of the cache memory. One or more such LBA ranges are of different respective sizes. In other embodiments, LBA ranges of the cache memory concurrently store respective compressed cache lines, wherein the LBA ranges and are of different respective sizes.

Abstract: This disclosure describes communication techniques that may be used within a multiple-processor computing platform. The techniques may, in some examples, provide software interfaces that may be used to support message passing within a multiple-processor computing platform that initiates tasks using command queues. The techniques may, in additional examples, provide software interfaces that may be used for shared memory inter-processor communication within a multiple-processor computing platform. In further examples, the techniques may provide a graphics processing unit (GPU) that includes hardware for supporting message passing and/or shared memory communication between the GPU and a host CPU.

Abstract: A vertex data compression method includes: collecting a plurality of vertices as a vertex block; extracting at least one data unit array from the vertex block, wherein each data unit array is composed of data units selected from vertex components of the vertices respectively, the data units correspond to a same channel, and each data unit is smaller than one byte; and for each data unit array, checking the data units of the data unit array to select a compression algorithm, and compressing the data units of the data unit array according to the selected compression algorithm.

Abstract: The present disclosure provides systems and methods for recording operating parameters of an intelligent electronic device (IED). A system may include a parameter acquisition module, a parameter storage module, and a memory management module. The parameter acquisition module may be configured to periodically obtain operating parameters of an IED at a first interval. The first interval may have a first time length to provide a first resolution of operation of the IED. The parameter storage module may be configured to store the operating parameters. The memory management module may be configured to delete, outside a first resolution period, a first portion of the operating parameters while maintaining a second portion of the operating parameters. The second portion may include operating parameters for each of a second interval. The second interval may have a second time length to provide a reduced second resolution of the operation of the IED.

Abstract: In accordance with some embodiments, a control surface stores the index bits in a tile using multi-sampling anti-aliasing. By determining whether all the samples in a tile point to plane 0, one can use only two bits in a control surface for the tile to indicate that all the samples on the tile point to plane 0. Otherwise more than two bits may be stored in the control surface to indicate planes pointed to by the samples of the tile.

Abstract: A method and system for applying and reading a fractal image to and from a plurality of objects to act as an identification label is provided. The system includes a printer for printing a fractal pattern to the plurality of objects and a reader for reading the printed fractal pattern. Such a fractal image is robust to printing and imaging difficulties and inconsistencies, and is difficult to copy, thus defending against counterfeiting.

Abstract: A method for rotating macro-blocks of a frame of a video stream. A degree of rotation for the video stream is accessed. A macro-block of the video stream is accessed. The macro-block is rotated according to the degree of rotation. The macro-block is repositioned to a new position within the frame, wherein the new position is based on the degree of rotation.

Abstract: A method for delivering customized navigation or interactive program guide imagery to a user by digitally splicing bitstreams bearing graphics or video imagery and bitstreams bearing navigation or IPG imagery. The resulting combined bitstream is delivered to a user or viewer.

Abstract: An image processing apparatus includes: a processor configured to receive selection of one of options including a first-kind option and a second-kind option, and receive designation of a saving format and a compression level; acquire scan data generated; and generate a compressed file by compressing the scan data, wherein in a case where the first-kind option is selected and where a specific saving format is designated as the saving format, the processor configured to generate the compressed file by using a first compression scheme, regardless of the designated compression level. In a case where the second-kind option is selected and where the specific saving format is designated as the saving format, the processor configured to select one compression scheme from the first compression scheme and the second compression scheme, according to the designated compression level, and generate the compressed file by using the selected compression scheme.

Abstract: Embodiments are directed towards employing distributed computing concepts such as peer-to-peer processing to distribute across a plurality of peer client devices, or swarm, the computations of Shape Encoding Schemes (SES) for encoding digital video content. As more peer client devices receive the content, progressively more iterations of a SES encoding is performed on various frames within the video content, thereby improving the encoding of the overall video content. Optionally, such distributed progressive processing or swarming approach may include other encoding, such as scaling corrections, scene transitions corrections, and the like.

Abstract: Methods and systems for providing a three-dimensional (3D) image viewer in a webpage are provided. According to an example method, a webpage may be provided, and the webpage may include embedded language that identifies a 3D image viewer to be provided within the webpage. Based on the embedded language, a computer having a processor and a memory may request information associated with rendering a 3D object data model in the 3D image viewer. The method may also include providing the 3D image viewer within the webpage, and receiving information associated with rendering the 3D object data model. Additionally, the 3D object data model may be rendered in the 3D image viewer based on the received information. Additional example systems and methods are described herein.

Abstract: Various apparatuses and methods are disclosed for processing texture data compressed with a first compression algorithm and texture data compressed with a second compression algorithm. A processing system may be used to determine whether the compressed texture data is compressed with the first or second compression algorithm, and process the compressed texture data using a decompression algorithm corresponding to the compression algorithm used to compress the texture date.

Abstract: This invention relates to a method of processing a plurality of graphical programs on a centralized computer system whereby the images produced by the programs are compressed and transmitted to remote processing devices where they are decompressed. Compression assistance data (CAD) is produced by inspecting instructions outputted by the programs and the CAD is then used in the compression step.

Abstract: Each of a plurality of timing controllers has a synchronization reference signal output terminal from which a synchronization reference signal is output and a synchronization reference signal input terminal to which the synchronization reference signal is input. A master timing controller outputs a predetermined signal of display signals which are input from an external device, from the synchronization reference signal output terminal of the master timing controller as the synchronization reference signal, and the synchronization reference signal is input to the synchronization reference signal input terminals of the master timing controller and a slave timing controller. Accordingly, a luminance difference can be prevented from occurring between divided regions of a display panel due to asynchronization between display signals input to respective timing controllers in a display device in which a plurality of timing controllers are used and the display panel is divided into a plurality of regions.

Abstract: A semiconductor device may include a plurality of banks; and a control unit configured to receive a command from an external device and independently control the plurality of banks according to the received command. Each bank comprises a pixel array including a plurality of pixels; a row decoder configured to activate word lines connected to the plurality of pixels under control of the control unit; a column decoder configured to activate bit lines connected to the plurality of pixels under control of the control unit; a sense amplifier and write driver configured to control and detect respective voltages of the activated bit lines to provide respective amplified voltages; and an input/output buffer configured to output data states of the pixels based on the respective amplified voltages. Related methods of operation are also discussed.

Abstract: Devices, methods, and other embodiments associated with processing rasterized data are described. In one embodiment, an apparatus includes translation logic for converting lines of rasterized pixel data of a compressed image to a plurality of two-dimensional data blocks. The lines of rasterized pixel data are stored in consecutive memory locations. Each data block is stored in a consecutive memory location. The apparatus includes decompression logic for at least partially decompressing the compressed image based, at least in part, on the two-dimensional data blocks.

Abstract: An image data encoding device includes a data block generating unit configured to split image data into a plurality of data blocks, and a compressing unit configured to generate compressed data with respect to each of the plurality of data blocks, the compressed data including position information regarding positions of first pixels each having a gray scale value equal to a reference gray scale value, and difference values between the reference scale value and gray scale values of second pixels, which are different from the reference gray scale value.

Abstract: A compression device includes a first compressor section, a second compressor section, and a selector. The first compressor section outputs a first compression result or a second compression result as a middle compression result. The first compression result includes a first compression pixel value generated by compressing pixel values of compression target pixels without referring to pixel values of pixels belonging to a line different from a current line. The second compression result includes a second compression pixel value generated by compressing pixel values of the compression target pixels based on a correlation among pixel values of the compression target pixels and reference approximate pixel values. The second compressor section outputs a third compression result based on the correlation among the pixel values of the compression target pixels. The selector outputs one of the middle compression result or the third compression result as a final compression result.

Abstract: Each block of texture data elements is encoded as a block of texture data that includes a set of integer values to be used to generate a set of base data values for the block, and a set of index values indicating how to use the base data values to generate data values for the texture data elements that the block represents. The integer values and the index values are both encoded in an encoded texture data block using a combination of base-n values, where n is greater than two, and base-2 values. Predefined bit representations are used to represent plural base-n values (n>2) collectively, and the bits of the bit representations representing the base-n values are interleaved with bits representing the base-2 values in the encoded texture data block.

Abstract: A display driver includes a video data conversion unit, a data compression unit, a memory unit, and a data restoration unit. The video data conversion unit converts first video data that includes RGB data to second video data that includes pentile data. The data compression unit compresses at least a portion of the second video data. The memory unit stores at least the compressed second video data. The data restoration unit restores the compressed second video data.

Abstract: Embodiments are disclosed for distributing processing tasks during a start up routine for a computing device between a central processing unit (CPU) and a graphics processing unit (GPU). In some embodiments, a method of loading an operating system for a computing device with a CPU includes receiving power from a power supply and locating a master boot record in a non-volatile storage device. The method further includes copying a first portion of a compressed operating system image from an address indicated by the master boot record to a location in a volatile storage device and instructing a GPU to decompress the first portion of the compressed operating system image in the volatile storage device.

Abstract: A rendering apparatus and method are provided. The rendering method includes: reading a block, corresponding to a fragment, from among compressed blocks stored in a depth buffer, by considering frequency information corresponding to the fragment and prepared in advance; and performing a depth test for the fragment by considering the restored block.

Abstract: 3D models often have a large number of small to medium sized connected components, with small numbers of large triangles, often with arbitrary connectivity. The efficiency of compact representation of large multi-component 3D models can be improved by detecting and representing similarities between components thereof, even if the components are not exactly equal. The invention uses displacement maps for encoding two or more different but similar geometry patterns differentially, based on clustering and a cluster representative surface. A method for encoding a plurality of geometry patterns comprises detecting and encoding identical copies of geometrical patterns, detecting and clustering similar geometry patterns, and detecting partial similarity. The detecting partial similarity comprises generating a cluster representative surface, generating for at least one clustered geometry pattern a displacement map, and encoding the common surface and the displacement maps.

Abstract: Disclosed are a method for compression, decompression and progressive transmission of spatial data and a device thereof. A compression method for spatial data comprises: according to a preset view control parameter, acquiring a compression parameter Z; according to the view control parameter, determining a reference point P; according to the compression parameter Z, converting the coordinate values of the coordinate points of the spatial data and the coordinate value of the reference point P into integers; and using the differences of the values resulting from conversion of the coordinate values of the coordinate points of the spatial data into the integers and the values resulting from conversion of the coordinate values of the reference point P into integers as compressed data. Also disclosed are a method for determining the maximum data bit for storing spatial data, a method for inserting incremental data, a method for compressing and decompressing incremental data and a device thereof.

Abstract: An image processing apparatus and method including an encoder circuitry for generating encoded data blocks from input data blocks of an image, and write circuitry for storing the encoded data blocks to memory for subsequent access by decoding circuitry. For each input data block, identifier generation circuitry generates an identifier value that is dependent on the input data block. A lookup storage stores predetermined information relating to at least one encoded data block and stored within the lookup storage in association with the identifier value for the corresponding input data block. For a current input data block, a check is performed to determine whether a match exists between the identifier value generated for the current input data block and an identifier value stored in the lookup storage. In a match, the predetermined information is used by the write circuitry when performing the required write operation.

Abstract: Techniques related to graphics rendering including techniques for color compression and/or decompression using adaptive quantization are described.

Abstract: A data processing apparatus includes a compression circuit and an 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. The output interface records indication information in an output bitstream, and outputs the output bitstream via a display interface. The output bitstream is derived from the compressed pixel data groups. The indication information is set in response to the pixel data grouping setting employed by the compression circuit.

Abstract: An apparatus is provided for decoding last position information indicating a horizontal position and a vertical position of a last non-zero coefficient in a predetermined order within a current block to be decoded, the current block being included in a picture and including a plurality of coefficients. The apparatus includes one or more processors, a communication unit, and storage coupled to the one or more processors and the communication unit. The communication unit is configured to transmit a request for a bitstream to an external system, and receive the bitstream from the external system. The one or more processors are configured to obtain the bitstream, perform first arithmetic decoding, perform second arithmetic decoding, derive a horizontal component of the last position information, and derive a vertical component of the last position. A system for decoding and a displaying method are also provided.

Abstract: A data compression system for a liquid crystal display (LCD) includes a host and a drive circuit. The host is utilized for outputting image data in a first data format or a second data format according to an operation mode of the LCD. The drive circuit includes a bypass path, for transmitting the image data according to the operation mode; a compression unit, coupled to the host, for receiving the image data and performing a compression procedure on the image data to generate a compression data according to the operation mode; a storage unit, coupled to the compression unit, for storing the compression data and the image data; a de-compression unit, coupled to the storage unit, for receiving the compression data and performing a de-compression procedure on the compression data to recover the image data according to the operation mode; and a display unit, for displaying the image data.

Abstract: Sequential write operations to a unit of compressed memory, known as a compression tile, are examined to see if the same compression tile is being written. If the same compression tile is being written, the sequential write operations are coalesced into a single write operation and the entire compression tile is overwritten with the new data. Coalescing multiple write operations into a single write operation improves performance, because it avoids the read-modify-write operations that would otherwise be needed.

Abstract: A circuit includes an image decompression circuit configured to receive compressed image data which are generated by compressing image data of a set of pixels of a target block by using a selected compression method selected from a plurality of compression methods based on a correlation among said image data of said set of pixels of said target block, and to generate decompressed image data by decompressing said compressed image data by using a decompression method corresponding to said selected compression method.

Abstract: A liquid crystal display (LCD) device comprises an image signal processing unit that selectively compensates a current frame upon determining that it is part of a sequence of changing images as opposed to a sequence of still images. The image signal processing device comprises an encoding/decoding unit that generates comparison frame decoding data by encoding and decoding comparison frame data, generates reference frame decoding data by encoding and decoding reference frame data, and a determining unit that sets a comparison range based on effective bits in the comparison frame decoding data and effective bits in the reference frame decoding data, and compares the comparison frame decoding data and the reference frame decoding data within the comparison range.

Abstract: In an embodiment, there is provided a video processing component comprising a compensation engine configured to generate pixels of a first video frame from a second video frame based at least in part on specified pixel motion; and an access buffer configured to store pixel data corresponding to pixels of the second video frame for reference by the compensation engine, wherein the pixel data is stored by the access buffer at different vertical resolutions depending on vertical distances of the pixels corresponding to the pixel data from a target pixel that is indicated by the compensation engine.

Abstract: A decoding method decodes last position information indicating horizontal and vertical positions of a last non-zero coefficient in a predetermined order within a current block to be decoded, the current block including plural coefficients. The decoding includes obtaining a bitstream including first, second, third and fourth partial signals, in this order, performing first arithmetic decoding on the first and the third partial signals respectively to obtain decoded first and decoded third partial signals, performing second arithmetic decoding on the second and the fourth partial signals respectively to obtain decoded second and decoded fourth partial signals, the second arithmetic decoding being different from the first arithmetic decoding, deriving a horizontal component of the last position information from the decoded first and decoded third partial signals, and deriving a vertical component of the last position information from the decoded second and decoded fourth partial signals.

Abstract: Techniques related to graphics rendering including techniques for compression and/or decompression of graphics data by use of pixel region bit values are described.

Abstract: Techniques related to graphics rendering including techniques for compression and/or decompression of graphics data by use of indexed subsets are described.

Abstract: A method, apparatus, system, and computer program product provide the ability to utilize a distributed scene graph. A database of hashes and corresponding location identifiers (for asset locations) is maintained. An export of a scene (including scene assets) is initiated and hash values for the scene assets are computed. If the hash value is not in the database, it is added to the database. If the hash value is in the database, the corresponding location identifier is used to identify the location of the scene asset. The hash value and corresponding location identifier are stored in a scene graph file that is traversed. During the traversal, for each hash value in the scene graph file, the scene asset is retrieved from the location identified in the scene graph file and processed.

Abstract: An image signal modifying device includes a pixel, a memory which stores compressed information in which a three-dimensional (“3-D”) lookup table is coded, an image signal modifying unit which decodes the compressed information to generate a restored 3-D lookup table and generates a modified signal based on a first image signal of a first frame, a second image signal of a second frame, a third image signal of a third frame and the restored 3-D lookup table, and a data driver which converts the modified signal into the data voltage and supplies the data voltage to the pixel.

Abstract: Methods and computer graphics systems are provided for compressing vertex parameter data. The vertex parameter data comprises a data block comprising data of vertices relating to at least one parameter. The data of each of the vertices includes multiple data segments at respective positions. The data in the data block is analysed to determine a compression grouping scheme according to which data segments of the vertices are grouped together into segment blocks for compression. The analysis of the data determines a compression grouping scheme which is suited to the distribution of the data in the data block, to thereby improve the compression ratio which can be achieved when compressing the data block.

Abstract: Remote desktop servers include a display encoder that maintains a secondary framebuffer that contains display data to be encoded and transmitted to a remote client display and a list of display primitives effectuating updated display data in the secondary framebuffer. The display encoder submits requests to receive the list of drawing primitives to a video adapter driver that receives and tracks drawing primitives that, when executed, update a primary framebuffer.

Abstract: Techniques related to coding data including techniques for coding data using a universal codec are generally described.

Abstract: A data processing method that includes: detecting a maximum data cell having a maximum value and a minimum data cell having a minimum value in a compression unit cell; converting the maximum data cell and the minimum data cell into a non-compressed data format; converting remaining data cells of the compression unit cell except for the maximum and minimum data cells into a compressed data format; and generating stream data in which the converted data cells are arranged, wherein the non-compressed data format and the compressed data format include a header field with different values and the non-compressed data format includes a data field corresponding to the value of the converted maximum or minimum data cell.

Abstract: Embodiments of the present invention provide graphic processing techniques and configurations including an apparatus comprising a storage medium having stored therein a table comprising information about respective positions and sizes of a number of rectangular blocks, the rectangular blocks to substantially form at least one plane having an arbitrary shape object, and at least one overlay engine operatively coupled with the table and associated with the at least one plane to request the information about the respective positions and the sizes of the number of rectangular blocks to provide graphics overlay of the arbitrary shape object. Other embodiments may be described and/or claimed.

Abstract: Three-dimensional data is compressed at a high compression ratio without deteriorating resolution and accuracy, by computing a coupling coefficient from input three-dimensional data and a three-dimensional base data group obtained from a plurality of objects and outputting the coupling coefficient as compressed data. Specifically, the three-dimensional data is input to corresponding point determination means. The corresponding point determination means generates three-dimensional data to be synthesized in which vertexes of the three-dimensional data are made to correspond to vertexes of three-dimensional reference data serving as a reference to determine association relationship between vertexes. Coefficient computation means computes a coupling coefficient for coupling a three-dimensional base data group used for synthesis of three-dimensional data to synthesize three-dimensional data to be synthesized, and outputs the computed coupling coefficient as the compressed data of the three-dimensional data.

Abstract: In a navigation system, e.g., for a motor vehicle, for determining the route from a location of the navigation system to a destination point, the navigation system includes a display device for displaying the route in a map display or a map-type display, and/or a direction indication that corresponds to the route, and it is possible to simultaneously display a canonically oriented graphic or image of a prominent route point with the aid of the display device.

Abstract: A system improves the performance of buffering frames. After a buffer flip occurs when double buffering the frames, the system may update some portions of dirty buffer regions in a back buffer with changes between a source frame and an intermediate frame. The system may update other portions of the dirty buffer regions with changes between the intermediate frame and a target frame. An application may write to an application buffer or a display buffer depending on whether the application controls a region of the display buffer that corresponds to the application buffer.

Abstract: A display control device is connected to and controls a display device. The display control device comprises a frame buffer store, and a control component. The display control device is arranged to receive (S1) compressed display data, store (S2) the received compressed display data in the frame buffer store, and for each frame refresh of the display device access (S3) stored compressed display data, decompress (S4) the accessed display data, and output S5 the decompressed display data.

Abstract: An image displaying device with an image cache data storage unit, including: an image cache identifier generating unit that obtains a hash value of a fixed length from sampling data of original image data and generates an image cache identifier unique to said original image data based on the hash value of a fixed length; an image cache searching unit that checks whether image cache data to which the generated image cache identifier is added is stored in said image cache memory or not; and an image cache generating unit that, when the image cache data has been not stored in said image cache memory, generates image cache data by adding the image cache identifier generated by said image cache identifier generating unit to the original image data and stores the image cache data in said image cache memory.

Abstract: There is set forth herein a computer program product, device, and method. In an example method, at least one of one or more processors of a device including one or more wired connectors and a wireless communication device receive a video output from a computing device via at least one of one or more wired connectors. At least one of the one or more processors send the video output to a wireless-enabled device via the wireless communication device using a wireless communication protocol. At least one of the one or more processors receive a keyboard or mouse input from the wireless-enabled device via the wireless communication device using the wireless communication protocol. At least one of the one or more processors send the keyboard or mouse input to the computing device via at least one of the one or more wired connectors.

Abstract: A method for compressing a cloud of points with imposed error constraints at each point is disclosed. Surfaces are constructed that approach each point to within the constraint specified at that point, and from the plurality of surfaces that satisfy the constraints at all points, a surface is chosen which minimizes the amount of memory required to store the surface on a digital computer.