Abstract: A system and method relate to encoding and decoding a contact matrix data structure. A system includes a processor and a computer-readable storage device storing a contact matrix data structure. The contact matrix data structure includes a header containing an interval of a contact matrix, a list of interval multipliers, a tile size, a list of chromosomes with a corresponding identifier and length, a list of sample identifiers, zero or more names of methods of normalization performed on the contact matrix tiles; zero or more bin payload having an interval multiplier; at least one parameter set; and at least one matrix payloads.

Abstract: A system and method relate to encoding and decoding a contact matrix data structure. A system includes a processor and a computer-readable storage device storing a contact matrix data structure. The contact matrix data structure includes a header containing an interval of a contact matrix, a list of interval multipliers, a tile size, a list of chromosomes with a corresponding identifier and length, a list of sample identifiers, zero or more names of methods of normalization performed on the contact matrix tiles; zero or more bin payload having an interval multiplier; at least one parameter set; and at least one matrix payloads.

Abstract: The invention relates to a method for encoding of quality values of a data structure, whereby said data structure includes a plurality of continuous fragments, each continuous fragment comprises a sequence of symbols derived from a symbol alphabet and corresponds to a segment of one reference sequence of one or more reference sequences, whereby each continuous fragment is aligned to locus indexes of one of said reference sequence and at least a portion of said continuous fragments overlap at an aligned locus index, and includes, further, a plurality of quality values, each quality value is derived from a quality value alphabet and is assigned to a corresponding symbol of one of the continuous fragments, whereby each quality value indicates a likelihood that the corresponding symbol in the corresponding continuous fragment is correct, wherein the method comprises the steps executable by a data processing system: —determine the quality values at a specific locus index, which are assigned to symbols of continuou

Abstract: Method for encoding of quality values of a data structure, whereby said data structure comprises a set of genomic reads, wherein the method comprises the following steps executable by a data processing system: ascertain the quality values of each read covering a certain index locus, —determine a codebook identifier identifying a specific codebook from a plurality of codebooks for said certain index locus based on the ascertained quality values of said certain index locus, whereby each code-book provides a mapping from a quality value of said quality value alphabet to a corresponding quantized quality value of a quantized quality value alphabet, —quantizing all ascertained quality values at said certain index locus using the specific codebook identified by the codebook identifier at said certain index locus in order to obtain for each quality value at said certain index locus a corresponding quantized quality value, and —encode all determined codebook identifiers using a first entropy encoder and encode all qu

Abstract: Method for encoding of quality values of a data structure, whereby said data structure comprises a set of genomic reads, wherein the method comprises the following steps executable by a data processing system: ascertain the quality values of each read covering a certain index locus, determine a codebook identifier identifying a specific codebook from a plurality of codebooks for said certain index locus based on the ascertained quality values of said certain index locus, whereby each code-book provides a mapping from a quality value of said quality value alphabet to a corresponding quantized quality value of a quantized quality value alphabet, quantizing all ascertained quality values at said certain index locus using the specific codebook identified by the codebook identifier at said certain index locus in order to obtain for each quality value at said certain index locus a corresponding quantized quality value, and encode all determined codebook identifiers using a first entropy encoder and encode all quant

Abstract: Coding of screen content includes identifying corresponding areas in one or more previously coded frames to code unchanged areas in current frames. An unchanged area in a current frame is coded by copying a corresponding area from a previously coded frame or several previously coded frames. Usage of a copy mode to be applied to the unchanged areas is signaled in an encoding bitstream. The copy mode can be signaled for each unchanged area or a single copy mode is signaled for a group of unchanged areas. The copy mode can be automatically applied to one or more unchanged areas contiguous to the group of unchanged areas without further signaling the copy mode. Copying the corresponding area from the previously coded frame includes copying palette entries from the previously coded frame. Palette entries copied from the previously coded frame are reordered according to frequency of appearance.

Abstract: We present a method for predictive compression of time-consistent 3D mesh sequences supporting and exploiting scalability. The applied method decomposes each frame of a mesh sequence in layers, which provides a time-consistent multi-resolution representation. Following the predictive coding paradigm, local temporal and spatial dependencies between layers and frames are exploited for layer-wise compression. Prediction is performed vertex-wise from coarse to fine layers exploiting the motion of already encoded neighboring vertices for prediction of the current vertex location. Consequently, successive layer-wise decoding allows to reconstruct frames with increasing levels of detail.

Abstract: We present a method for predictive compression of time-consistent 3D mesh sequences supporting and exploiting scalability. The applied method decomposes each frame of a mesh sequence in layers, which provides a time-consistent multi-resolution representation. Following the predictive coding paradigm, local temporal and spatial dependencies between layers and frames are exploited for layer-wise compression. Prediction is performed vertex-wise from coarse to fine layers exploiting the motion of already encoded neighboring vertices for prediction of the current vertex location. Consequently, successive layer-wise decoding allows to reconstruct frames with increasing levels of detail.

Abstract: A method of concealing a packet loss during video decoding is provided. An input stream having a plurality of network abstraction layer units NAL is received. A loss of a network abstraction layer unit in a group of pictures in the input stream is detected. A valid network abstraction layer unit order from the available network abstraction layer units is outputted. The network abstraction layer unit order is received by a video coding layer (VCL) and data is outputted.

Abstract: A 3-D wireframe model expressed in terms of nodes and vertices receives a 3-D video or like signal representative of a scene expressed in terms of a reference model, I frames and P frames. A DPCM coder takes advantage of the temporal correlation of the displacement of each vertex along every axis in the 3-D space. The 3-D signal is a set of non-zero displacements of all vertices and all nodes (sl[n, v]) at time tl. The decoded set (animation frame) of the previous instance is used as the predicted value (si-l[n, v]). The prediction error el[n, v], i.e. the difference between the current displacement set and the predicted one, is computed and quantised (el[n, v]). Finally, the quantised samples are entropy coded (ci[n, v]) using an adaptive arithmetic coding algorithm to handle the unknown data statistics. The predictive scheme described above prevents quantization error accumulation. A DPCM decoder first decodes arithmetically the received samples (‘e’ [n, v]) and computers the decoded samples (si? [n, v]).