Abstract: One example includes an integrated circuit (IC). The IC includes non-volatile memory and logic. The logic is configured to receive repair code associated with a memory instance and assign a compression parameter to the repair code based on a configuration of the memory instance. The logic is also configured to compress the repair code based on the compression parameter to produce compressed repair code and to provide compressed repair data that includes the compressed repair code and compression control data that identifies the compression parameter. A non-volatile memory controller is coupled between the non-volatile memory and the logic. The non-volatile memory controller is configured to transfer the compressed repair data to and/or from the non-volatile memory.

Abstract: There is provided a method and apparatus for remote differential compression (RDC) and data deduplication. According to embodiments, when a sending device acquires a new target file, the following steps are performed. Initially, Jaccard segmentation is performed, followed by performing identity-based segment deduplication and similarity-based segment deduplication. The transmission of the target file in the deduplicated form to the recipient device is subsequently performed. The recipient device can then rebuild the original target file from the deduplicated form thus replicating the target file at the recipient device with the target file originally present at the sending device.

Abstract: In one embodiment, a processor of a computing device receives a query. The computing device may compare a centroid of each of a plurality of clusters to the query such that a subset of the plurality of clusters is selected, each of the plurality of clusters having a set of data points. An assignment of the subset of the plurality of clusters may be communicated to a hardware accelerator of the computing device. A plurality of threads of the hardware accelerator of the computing device may generate one or more distance tables that store results of intermediate computations corresponding to the query and the subset of the plurality of clusters. The distance tables may be stored in shared memory of the hardware accelerator. A plurality of threads of the hardware accelerator may determine a plurality of data points using the distance tables. The processor may provide query results pertaining to at least a portion of the plurality of data points.

Abstract: A method includes receiving transform coefficients corresponding to a scaled video input signal, the scaled video input signal including a plurality of spatial layers that include a base layer. The method also includes determining a spatial rate factor based on a sample of frames from the scaled video input signal. The spatial rate factor defines a factor for bit rate allocation at each spatial layer of an encoded bit stream formed from the scaled video input signal. The spatial rate factor is represented by a difference between a rate of bits per transform coefficient of the base layer and an average rate of bits per transform coefficient. The method also includes reducing a distortion for the plurality of spatial layers by allocating a bit rate to each spatial layer based on the spatial rate factor and the sample of frames.

Abstract: A dynamic data transmission format adjustment method is provided. Firstly, a peripheral device raw input data is acquired from a device main body of a wireless peripheral device. Then, the peripheral device raw input data is converted into a variable-bit-length peripheral device transmission data according to a dynamic data transmission format conversion rule. Then, a network transmission packet containing the variable-bit-length peripheral device transmission data is generated, and the network transmission packet is transmitted to a wireless receiver of the wireless peripheral device. Then, the variable-bit-length peripheral device transmission data in the network transmission packet is converted and restored into a fixed-bit-length peripheral device transmission data according to the dynamic data transmission format conversion rule. Then, the fixed-bit-length peripheral device transmission data is transmitted from the wireless receiver to a computer host.

Abstract: Accordingly the embodiments herein provide a method for adaptive data transfer in a memory system (140), the method comprising: receiving at least one of a data copy request and a data transfer request to perform at least one of a data copy and a data transfer form a first memory subsystem (142) to a second memory subsystem (144). Configuring the memory system (140) in one of a first memory mode and a second memory mode based on a time required to perform at least on of data transfer and data transfer from the first memory subsystem (142) to the second memory subsystem (144) using an enhanced system model and performing at least one of data transferring and data copying from the first memory subsystem (142) to the second memory subsystem (144) in one of the first configured memory mode and the second configured memory mode.

Abstract: A deep neural network (“DNN”) module compresses and decompresses neuron-generated activation data to reduce the utilization of memory bus bandwidth. The compression unit receives an uncompressed chunk of data generated by a neuron in the DNN module. The compression unit generates a mask portion and a data portion of a compressed output chunk. The mask portion encodes the presence and location of the zero and non-zero bytes in the uncompressed chunk of data. The data portion stores truncated non-zero bytes from the uncompressed chunk of data. A decompression unit receives a compressed chunk of data from memory in the DNN processor or memory of an application host. The decompression unit decompresses the compressed chunk of data using the mask portion and the data portion.

Abstract: Methods and apparatuses for encoding and decoding an intra prediction mode of a prediction unit of a chrominance component based on an intra prediction mode of a prediction unit of a luminance component are provided. When an intra prediction mode of a prediction unit of a luminance component is the same as an intra prediction mode in an intra prediction mode candidate group of a prediction unit of a chrominance component, reconstructing the intra prediction mode candidate group of the prediction unit of the chrominance component by excluding or replacing an intra prediction mode of the prediction unit of the chrominance component which is same as an intra prediction mode of the prediction unit of the luminance component from the intra prediction mode candidate group, and encoding the intra prediction mode of the prediction unit of the chrominance component by using the reconstructed intra prediction mode candidate group.

Abstract: Enhanced techniques for communicating with an integrated circuit chip card are disclosed. An integrated circuit chip card may include a processor, a memory storing a plurality applications executable by the processor, an input/output (I/O) interface, and a network interface coupled to the (I/O) interface. The network interface may implement a plurality of logical ports, and the network interface can be configurable to select between multiple communication protocols to communicate with an external device in a socket communication mode. The network interface can be configured to establish a plurality of communication channels between the external device the integrated circuit chip card using the plurality of logical ports, and each of the communication channels may support communication with one of the plurality of applications.

Abstract: It is configured to include a video signal compression unit that compresses a video signal for displaying, on an image inspection monitor, an image inspection screen including a first area for displaying a medical image and a second area for displaying information other than the medical image, and a transmitting unit that transmits, via a communication network, the video signal having been compressed, and the video signal compression unit compresses, in each frame of the video signal, the second area of the image inspection screen at a compression rate higher than a compression rate of the first area.

Abstract: Data encoded in multiple languages, such as single byte languages and multi-byte languages, may be generated and stored in a single indexable information/data profile in a database. The information/data profile may comprise indexable information/data fields configured for storing information/data in a standardized language encoding and non-indexable information/data fields configured for storing information/data in a language different from the standardized language. The standardized language may be generated by translating the information/data stored in the non-indexable information/data fields to enable indexing of the entire information/data profile. The information/data profile may be utilized to generate various information/data outputs, such as shipping labels including at least one of the standardized language or the other language while enabling the information/data profile to be indexed based at least in part on the standardized language.

Abstract: Approaches in accordance with various embodiments provide for the processing of sparse matrices for mathematical and programmatic operations. In particular, various embodiments enforce sparsity constraints for performing sparse matrix multiply-add instruction (MMA) operations. Deep neural networks can exhibit significant sparsity in the data used in operations, both in the activations and weights. The computational load can be reduced by excluding zero-valued data elements. A sparsity constraint is applied across all submatrices of a sparse matrix, providing fine-grained structured sparsity that is evenly distributed across the matrix. The matrix may then be compressed since a minimum number of elements of the matrix are known to have zero value. Matrix operations are then performed using these matrices.

Abstract: The disclosure is directed at a method of data compression using inferred data. By determining the number of leading zeroes for each data structure, a general header presenting all leading zeros can be generated and use to compress the data.

Abstract: A method for compressing a quantum state vector includes: aggregating a group of several neighboring states of the vector into a cluster of states of the vector, a parameter representative of the probability of this cluster being associated with it and corresponding to the sum of the probabilities of the aggregated neighboring states in this cluster, the probability of each aggregated neighboring state being below a given aggregation threshold, and/or the sum of the probabilities of the aggregated neighboring states in a cluster being below another given aggregation threshold; and preserving a state of the vector not aggregated in a cluster, the parameter representative of its probability remaining unchanged. The method includes several steps of aggregating several distinct groups of several neighboring states of the vector, respectively into several clusters of states of the vector, and/or an aggregation step and a preservation step.

Abstract: A specification of an operation to perform one or more element-wise sums of specified portions of a matrix is received. The specification of the operation is analyzed to select a type of processing load partitioning to be applied. Based on the selected type of processing load partitioning to be applied, processing required to perform the operation is partitioned across a plurality of physical processing elements in parallel. The partitioned processing is distributed to the physical hardware processing elements to perform in parallel the element-wise sums of the specified portions of the matrix.

Abstract: A matrix compression/decompression accelerator (MCA) system/method that coordinates lossless data compression (LDC) and lossless data decompression (LDD) transfers between an external data memory (EDM) and a local data memory (LDM) is disclosed. The system implements LDC using a 2D-to-1D transformation of 2D uncompressed data blocks (2DU) within LDM to generate 1D uncompressed data blocks (1DU). The 1DU is then compressed to generate a 1D compressed superblock (CSB) in LDM. This LDM CSB may then be written to EDM with a reduced number of EDM bus cycles. The system implements LDD using decompression of CSB data retrieved from EDM to generate a 1D decompressed data block (1DD) in LDM. A 1D-to-2D transformation is then applied to the LDM 1DD to generate a 2D decompressed data block (2DD) in LDM. This 2DD may then be operated on by a matrix compute engine (MCE) using a variety of function operators.

Abstract: A fingerprint trie is used to store fingerprints for data portions stored on a storage system for use in implementing data deduplication on a storage system. The fingerprint trie may be used to compare fingerprint values to determine duplicate data portions, for example, in response to I/O operations. Leaf nodes of the fingerprint trie may be keyed by fingerprints, and a value of each leaf node may be a reference to the physical storage location of the data portion from which the fingerprint was generated. When an I/O operation is received, a fingerprint may be generated for each of one or more data portions included in the I/O operation. A fingerprint trie may be searched, for example by traversing multiple nodes of the trie according to pointers provided by the nodes, to determine whether there is any matching fingerprint specified in the fingerprint trie.

Abstract: In an embodiment, a matrix computation engine is configured to perform matrix computations (e.g. matrix multiplications). The matrix computation engine may perform numerous matrix computations in parallel, in an embodiment. More particularly, the matrix computation engine may be configured to perform numerous multiplication operations in parallel on input matrix elements, generating resulting matrix elements. In an embodiment, the matrix computation engine may be configured to accumulate results in a result memory, performing multiply-accumulate operations for each matrix element of each matrix.

Abstract: Video quality analysis may be used in many multimedia transmission and communication applications, such as encoder optimization, stream selection, and/or video reconstruction. An objective VQA metric that accurately reflects the quality of processed video relative to a source unprocessed video may take into account both spatial measures and temporal, motion-based measures when evaluating the processed video. Temporal measures may include differential motion metrics indicating a difference between a frame difference of a plurality of frames of the processed video relative to that of a corresponding plurality of frames of the source video. In addition, neural networks and deep learning techniques can be used to develop additional improved VQA metrics that take into account both spatial and temporal aspects of the processed and unprocessed videos.

Abstract: An outer product multiplier (GPM) system/method that integrates compute gating and input/output circular column rotation functions to balance time spent in compute and data transfer operations while limiting overall dynamic power dissipation is disclosed. Matrix compute gating (MCG) based on a computation decision matrix (CDM) limits the number of computations required on a per cycle basis to reduce overall matrix compute cycle power dissipation. A circular column rotation vector (CRV) automates input/output data formatting to reduce the number of data transfer operations required to achieve a given matrix computation result. Matrix function operators (MFO) utilizing these features are disclosed and include: matrix-matrix multiplication; matrix-matrix and vector-vector point-wise multiplication, addition, and assignment; matrix-vector multiplication; vector-vector inner product; matrix transpose; matrix row permute; and vector-column permute.

Abstract: Techniques are disclosed for coding image data adaptively at different levels of downscaling. Such techniques may involve partitioning input data into pixel blocks for coding and performing content analysis on the pixel blocks. The pixel blocks may be input to block coders that operate at different pixel block sizes, which may code the pixel blocks input to them at their respective sizes. Except when a block coder operates at the partitioning size, block coders that operate at different pixel block sizes may perform downscaling of the pixel blocks to match their size with the block coders' respective coding size. A block decoder may invert the coding operations performed by the block coders, decoding coded image data at respective pixel block sizes, then upscaling decoded image data obtained therefrom to a common pixel block size. Image reconstruction may synthesize a resultant image from the decode pixel block data output by the decoders.

Abstract: A data compression system includes: (a) a data compression module that receives a sequence of input vectors and that provides a sequence of compressed vectors; (b) a data decompression module that receives the compressed vectors to provide a sequence of output vectors; and (c) a parameter update module that receives the sequence of input vectors and the sequence of output vectors, and which learns the data compression module and data decompression module based on evaluating a loss function of the input vectors, the output vectors, and the parameters controlling the compression module and the decompression module. Each input vector and its corresponding output vector may represent digitized time-domain signals (e.g., speech, audio or video signals) over a predetermined time period. The loss function may be evaluated for each of a sequence of predetermined time periods.

Abstract: A technique for performing in-line compression includes receiving data into a data log that temporarily holds the data and aggregating the data into batches, where each batch includes multiple blocks of received data. For each batch of data, a storage system performs a compression operation, which proceeds block-by-block, compressing each block and comparing a total compressed size of all blocks compressed so far against a budget. The storage system increments the budget for successive blocks, such that a per-block budget is greater for a first block in the batch than it is for a last block in the batch, thus allowing earlier blocks to meet budget even if they are relatively incompressible.

Abstract: The choice of a transmit (Tx)-Receive (Rx) beam pair out of many available beam pairs between a base station and a millimeter wave (mmW)-capable UE is directly related to the performance of transmission between the base station and the UE. A method, apparatus, and computer-readable medium at a transmitting user equipment (UE) capable of (mmW) communication are disclosed to determine a new serving Tx-Rx beam pair using an artificial neural network. The UE may predict a set of good Tx-Rx beam pairs using the artificial neural network, wherein the artificial neural network comprises an input layer, a middle layer, and an output layer. The UE may then determine the new serving Tx-Rx beam pair based on the set of good Tx-Rx beam pairs.

Abstract: A system and method are provided for use with streaming blocks of data, each of the streaming blocks of data including a number bits of data. The system includes a first compressor and a second compressor. The first compressor can receive and store a number n blocks of the streaming blocks of data, can receive and store a block of data to be compressed of the streaming blocks of data, can compress consecutive bits within the block of data to be compressed based on the n blocks of the streaming blocks of data, can output a match descriptor and a literal segment. The match descriptor is based on the compressed consecutive bits. The literal segment is based on a remainder of the number of bits of the data to be compressed not including the consecutive bits. The second compressor can compress the literal segment and can output a compressed data block including the match descriptor and a compressed string of data based on the compressed literal segment.

Abstract: A hardware module which operatively carries out a method of compressing mass spectral data, the method comprising: receiving a first signal output from an ion detector of a mass spectrometer; processing the first signal to a digital signal at an output being data frame types representative of the first signal output; temporarily storing the data frame types in a memory block and reading a data frame from the memory block and determining its data frame type and according to its data frame type compressing the data frame according to one or more compression algorithms to generate a compressed data output stream.

Abstract: A method for efficient transmission of coefficients examines a coefficient list, presents the coefficients as binary floating point representation, and transmits the list of coefficients as a header having an exponent prefix, a fractional suffix, and each coefficient value as an exponent suffix and fractional prefix. A method for reception of coefficients receives a header including an exponent prefix, a fractional suffix, thereafter receiving each value as a sign bit, an exponent suffix and a fractional prefix, reconstituting an approximation of the original value, in sequence, as a sign bit, exponent prefix exponent suffix, fraction prefix, and fraction suffix, thereby greatly reducing the amount of information to be transmitted or received.

Abstract: A method for compressing multiple original convolution parameters into a convolution operation chip includes steps of: determining a range of the original convolution parameters; setting an effective bit number for the range; setting a representative value, wherein the representative value is within the range; calculating differential values between the original convolution parameters and the representative value; quantifying the differential values to a minimum effective bit to obtain a plurality of compressed convolution parameters; and transmitting the effective bit number, the representative value and the compressed convolution parameters to the convolution operation chip.

Abstract: An image processing apparatus which compares a first frame rate of a first moving image and a second frame rate of a second moving image each moving image having temporal scalability, converts a temporal hierarchical structure of the second moving image, when the first frame rate is higher than the second frame rate, by copying and inserting a picture included in a first temporal layer of the second moving image into a second temporal layer of the second moving image, and when the first frame rate is lower than the second frame rate, by discarding a picture, of pictures belonging to temporal layers of the second moving image, which belongs to a temporal layer with a frame rate higher than the first frame rate, and combines the first moving image with the converted second moving image.

Abstract: A system and method for efficient sparse matrix processing are provided in one embodiment. A compressed representation of a sparse matrix, the sparse matrix including one or more non-zero entries in one or more of a plurality of portions of the matrix, is obtained by at least one server including one or more streaming multiprocessors, each of the streaming multiprocessors including one or more graphics processing unit (GPU) processor cores. Each of the portions are assigned into one of a plurality of partitions based on a number of the non-zero entries in that portion. For each of the partitions, a predefined number of the GPU processor cores are assigned for processing each of the portions assigned to that partition based on the numbers of the non-zero entries in the portions assigned to that partition. For each of the partitions, each of the portions associated with that partition are processed.

Abstract: A method for compressing flow data, including: generating multiple line segments according to flow data and a predefined maximum error that are acquired; obtaining a target piecewise linear function according to the multiple line segments, where the target piecewise linear function includes multiple linear functions, and an intersection set of value ranges of independent variables of every two linear functions among the multiple linear functions includes a maximum of one value; and outputting a reference data point according to the target piecewise linear function, where the reference data point includes a point of continuity and a point of discontinuity of the target piecewise linear function. In this way, a maximum error, a target piecewise linear function is further determined according to the multiple line segments, and a point of continuity and a point of discontinuity of the target piecewise linear function are used to represent compressed flow data.

Abstract: Generating non-compressible data streams is disclosed, including: receiving an initialization parameter; determining a constrained prime number, wherein the constrained prime number comprises a plurality of component values, wherein each of the plurality of component values comprises a prime number, wherein each of the plurality of component values is different; and generating a non-compressible sequence based at least in part on the initialization parameter and the constrained prime number.

Abstract: Lossless content-aware compression and decompression techniques are provided for floating point data, such as seismic data. A minimum-length compression technique exploits an association between an exponent and a length of the significand, which corresponds to the position of the least significant bit of the significand. A reduced number of bits from the significand can then be stored. A prediction method is also optionally previously applied, so that residual values with shorter lengths are compressed instead of the original values. An alignment compression technique exploits repetition patterns in the floating point numbers when they are aligned to the same exponent. Floating point numbers are then split into integral and fractional parts. The fractional part is separately encoded using a dictionary-based compression method, while the integral part is compressed using a delta-encoding method.

Abstract: The invention relates to an ion source (50) for generating elemental ions and/or ionized metal oxides from aerosol particles, comprising: a reduced pressure chamber (61) having an inside; an inlet (56) and a flow restricting device (60) for inserting the aerosol particles in a dispersion comprising the aerosol particles dispersed in a gas, in particular in air, into the inside of the reduced pressure chamber (61), the inlet (60) fluidly coupling an outside of the reduced pressure chamber (61) via the flow restricting device (60) with the inside of the reduced pressure chamber (60); a laser (62) for inducing in a plasma region (63) in the inside of the reduced pressure chamber (61) a plasma in the dispersion for atomizing and ionizing the aerosol particles to elemental ions and/or ionized metal oxides; wherein the reduced pressure chamber (61) is adapted for achieving and maintaining in the inside of the reduced pressure chamber (61) a pressure in a range from 0.01 mbar to 100 mbar.

Abstract: A method of encoding a video data including a plurality of pictures includes storing data of at least one picture in the video data that is already encoded, and referring to the stored data and using intra-prediction to encode blocks in a current picture.

Abstract: Methods and apparatus are provided for content-aware compression of data. An exemplary method comprises obtaining a plurality of floating point numbers each comprising a sign, an exponent at a given base and a significand; grouping a plurality of exponents of the plurality of floating point numbers using a transformation that provides a transformed exponent to reduce a number of distinct exponents in the plurality of floating point numbers to be encoded; and encoding the given floating point number by encoding the transformed exponent and the length of the given floating point number as a single class code. A substantially optimal number of output class codes that need to be encoded is optionally automatically selected. A linear prediction algorithm, such as a first derivative or a second derivative, is optionally applied to the floating point numbers to generate a prediction, wherein the first or second derivative is selected based on an analysis of the data to be compressed.

Abstract: A method of compensating for image compression errors is presented. The method comprises: receiving an image frame Fn during a frame period n, where n is a natural number; adding a compensation frame Cn to the image frame Fn to generate a compensated frame En; compressing the compensated frame En to generate a compressed frame CEn; decompressing the compressed frame CEn to generate a decompressed frame Dn; and subtracting the decompressed frame Dn from the compensated frame En to generate a next compensation frame Cn+1.

Abstract: Systems for the generation of discovery ion currents. One of the systems includes a mass spectrometer providing ion current measurement. The system includes a controller coupled to the mass spectrometer. The system also includes a liquid handler coupled to the controller and the mass spectrometer. The controller is configured to identify a base average ion current of each mass to charge interval, the mass to charge interval comprising at least one mass to charge channel. The controller is configured to calculate a relative change between a current ion current measurement for a charge interval to the base average for the charge interval. The controller is configured to compare the relative change to a threshold. The controller is also configured to, in response to determining that the relative change exceeds the threshold, start fraction collection using the liquid handler.

Abstract: An apparatus, according to one embodiment, includes: one or more memory devices, each memory device comprising non-volatile memory configured to store data, and a memory controller connected to the one or more memory devices. The memory controller is configured to: detect at least one read of a logical page straddled across codewords, store an indication of a number of detected reads of the straddled logical page, and relocate the straddled logical page to a different physical location in response to the number of detected reads of the straddled logical page, wherein the logical page is written to the different physical location in a non-straddled manner. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A time-of-flight (TOF) mass spectrometer analyzes a sample producing a time series of data points representing amounts of detected ions per unit time. A spectrometer resolution, a spectrometer digitization time period, and a minimum number points per peak needed to maintain the information content of a peak are received. A peak width value is calculated for each point from the resolution and a time of each point. The calculated peak width value for each point is divided by the minimum number points per peak. A maximum time difference between points for each point is produced. A point is selected based on the digitization time period. Adjacent points of the selected point are found. If a difference between the adjacent points does not exceed a sum of a maximum time differences of the adjacent points, the selected point is deleted to compress the time series.

Abstract: Lossless content-aware compression and decompression techniques are provided for floating point data, such as seismic data. A minimum-length compression technique exploits an association between an exponent and a length of the significand, which corresponds to the position of the least significant bit of the significand. A reduced number of bits from the significand can then be stored. A prediction method is also optionally previously applied, so that residual values with shorter lengths are compressed instead of the original values. An alignment compression technique exploits repetition patterns in the floating point numbers when they are aligned to the same exponent. Floating point numbers are then split into integral and fractional parts. The fractional part is separately encoded using a dictionary-based compression method, while the integral part is compressed using a delta-encoding method.

Abstract: A method is provided for reading data relating to a tire, in which the data is stored in an electronic device integrated into the tire, and in which the tire is identified by a serial number and a manufacturing week number. A storage unit of the electronic device includes a data storage zone having a storage range formed of a number of bits. The storage range is also referred to as a restricted range, and the number of bits of the restricted range is less than or equal to 38. According to the method, the data stored in the restricted range is read, and the data read from the restricted range is decoded in order to determine the serial number and the manufacturing week number of the tire.

Abstract: A method of updating data compression software. The method comprises using real-time data to train upgraded compression/decompression software. A compressor and/or decompressor function processes and delivers the real-time data using an existing compression/decompression software. Following completion of the training process, the compressor and/or decompressor deactivates the existing compression/decompression software and activates the upgraded compression/decompression software to process and deliver the real-time data.

Abstract: A hardware module which operatively carries out a method of compressing mass spectral data, the method comprising: receiving a first signal output from an ion detector of a mass spectrometer; processing the first signal to a digital signal at an output being data frame types representative of the first signal output; temporarily storing the data frame types in a memory block and reading a data frame from the memory block and determining its data frame type and according to its data frame type compressing the data frame according to one or more compression algorithms to generate a compressed data output stream.

Abstract: A network system includes a management apparatus and multiple apparatuses. The management apparatus includes a preparation instruction unit to transmit an instruction to prepare a certificate request to the apparatuses; a collection unit to collect the certificate requests; a request unit to request issuance of certificates to a certificate authority; a resetting instruction unit to transmit the issued certificates to the apparatuses and to instruct resetting of certificates. The apparatus includes a storing unit including an operation area for storing a first certificate and a provisional operation area; a provisionally operating unit to transfer the first certificate to the provisional operation area, and to generate a certificate request, and to transmit the certificate request to the management apparatus; a setting unit to store a second certificate, issued by the certificate authority, in the operation area, and to instruct a communication unit to conduct the communication by switching a certificate.

Abstract: Systems and methods for decompressing compressed data that has been compressed by way of a lossless compression algorithm are described herein. In a general embodiment, a graphics processing unit (GPU) is programmed to receive compressed data packets and decompress such packets in parallel. The compressed data packets are compressed representations of an image, and the lossless compression algorithm is a Rice compression algorithm.

Abstract: Some embodiments include two-dimensional compressed data sets that can be re-aligned while preserving compression of the data. A set of one or more shifts and a corresponding set of one or more first dimension indices into a two-dimensional compressed data set for re-aligning the two-dimensional compressed data set are determined. Impact of re-aligning upon each vector in the second dimension of the two-dimensional compressed data set is determined while the two-dimensional compressed data set remains compressed. New compressed vectors are created in the second dimension resulting from re-aligning. Compression information is modified for each of the original vectors of the two-dimensional compressed data set that remain after re-aligning based, at least in part, on the new compressed vectors. A re-aligned version of the two-dimensional compressed data set is created with the new compressed vectors, and the remaining original vectors with their modified compression information.

Abstract: Some embodiments include an apparatus and a computer program product configured to re-align two-dimensional compressed data sets while preserving compression of the data. A set of one or more shifts and a corresponding set of one or more first dimension indices into a two-dimensional compressed data set for re-aligning the two-dimensional compressed data set are determined. Impact of re-aligning upon each vector in the second dimension of the two-dimensional compressed data set is determined while the two-dimensional compressed data set remains compressed. New compressed vectors are created in the second dimension resulting from re-aligning. Compression information is modified for each of the original vectors of the two-dimensional compressed data set that remain after re-aligning based, at least in part, on the new compressed vectors.

Abstract: A method for producing 3D multi-view visual contents including capturing a visual scene from at least one first point of view for generating a first bidimensional image of the scene and a corresponding first depth map indicative of a distance of different parts of the scene from the first point of view. The method further includes capturing the visual scene from at least one second point of view for generating a second bidimensional image; processing the first bidimensional image to derive at least one predicted second bidimensional image predicting the visual scene captured from the at least one second point of view; deriving at least one predicted second depth map predictive of a distance of different parts of the scene from the at least one second point of view by processing the first depth map, the at least one predicted second bidimensional image and the second bidimensional image.

Abstract: Methods and apparatuses for performing inter-color-plane prediction with adaptability to various existing video content representations are provided. A plurality of predetermined rescaling schemes based on a color plane format is selected. A first block of original samples of a first color plane is encoded into a compressed bitstream. A block of reconstructed samples of the first color plane is reconstructed. An inter-color-plane prediction process is performed to produce samples of a second color plane. Said block of prediction samples of the second color plane is subtracted from a second block of original samples of the second color plane to produce a block of residual samples of the second color plane where the positions of the first block and the second block of original samples are aligned. Finally, the block of residual samples of the second color plane is encoded.