Gottfried Wilhelm Leibniz Universitat Hannover

Jörn Ostermann

Nikolce Stefanoski

Aron Sommer

Jan Voges

Yeremia Gunawan Adhisantoso

Patrick Klie

Tri Tan Ngo

Marco Munderloh

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.

System and method of efficient coding and decoding of contact matrices

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, &#x2014;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, &#x2014;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 &#x2014;encode all determined codebook identifiers using a first entropy encoder and encode all quantized quality values using a second entropy encoder or a set of encoders.

Method for encoding and decoding of quality values of a data structure

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.

Scalable compression of time-consistent 3D mesh sequences

Growing community of inventors

Hannover, Germany

Jörn Ostermann