A survey plan is designed and potentially adjusted so that seismic data acquired during the survey include inline and cross-line seismic data irregularities suitable for compressive sensing reconstruction. At least one of the inline and cross-line irregularities is dynamic and may be due to source, vessel(s) and/or streamer steering.

Techniques involve storing data. In particular, such techniques involve: obtaining first data to be stored; determining whether the first data is able to be compressed in a compression ratio exceeding a predetermined threshold; and storing, based on the determined result, the first data into a storage device. Accordingly, such techniques can execute corresponding processing for data in a predicted compression ratio, so as to store the data into a storage device. In this manner, such techniques can significantly cut down the overheads for processing data while minimizing a storage space required for storing data.

An image processing apparatus includes a memory configured to store compressed data; and frame buffer compressing circuitry which includes encoder circuitry configured to compress at least some of source data to generate the compressed data and transmit the compressed data to the memory, and decoder circuitry configured to read and decompress the compressed data from the memory, in which the compressed data includes a payload and a header including actual compressed data and flag, the frame buffer compressing circuitry is configured to reflect a result obtained by comparing an accumulated compressibility corresponding to the compressed data with a reference compressibility in the flag, and is configured to perform compression or decompression in a lossy mode or a lossless mode depending on the flag.

The invention relates to a method for compressing a set of input binary data values x, all coded in a same number B of bits, into a corresponding set of output data values x′, all coded in a smaller number b of bits, obtainable by (i) computing a quantization step size dq

[00001]$\mathrm{dq}=\frac{2^{B+1}}{2^{b+1}-1}$ (ii) dividing the range of values [0, 2.sup.B−1[, into 2.sup.b subranges, the first subrange being [0, INT(dq/2)[ the i.sup.th subrange being [INT((i−3/2)*dq)+1, INT((i−1/2)*dq)[, for i going from 2 to 2.sup.b

The invention also relates to a method for decompressing data and to applications of said method for compressing/decompressing video data, and to devices for performing these operations.

Methods for converting an n-bit number into an m-bit number for situations where n>m and also for situations where n<m, where n and m are integers. The methods use truncation or bit replication followed by the calculation of an adjustment value which is applied to the replicated number.

A decoder includes circuitry configured to receive a bitstream identify, in the bitstream, a current frame, wherein the current frame includes a first region and a third region, detect, in the bitstream, an indication that the first region is encoded according to a lossless encoding protocol, and decode the current frame, wherein decoding the current frame further comprises decoding the first region using a lossless decoding protocol corresponding to the lossless encoding protocol.

An image processing apparatus includes a memory configured to store compressed data; and frame buffer compressing circuitry which includes encoder circuitry configured to compress at least some of source data to generate the compressed data and transmit the compressed data to the memory, and decoder circuitry configured to read and decompress the compressed data from the memory, in which the compressed data includes a payload and a header including actual compressed data and flag, the frame buffer compressing circuitry is configured to reflect a result obtained by comparing an accumulated compressibility corresponding to the compressed data with a reference compressibility in the flag, and is configured to perform compression or decompression in a lossy mode or a lossless mode depending on the flag.

Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.

Methods, systems, and computer programs for compressing nucleic acid sequence data. A method can include obtaining nucleic acid sequence data representing: (i) a read sequence, and (ii) a plurality of quality scores, determining whether the read sequence includes at least one “N” base, based on a determination that the read sequence does not include at least one “N” base, generating a first encoded data set by using a first encoding process to encode each of the quality scores of the read sequence using a base-(x minus 1) number, where x is an integer representing a number of different quality scores used by the nucleic acid sequencing device, and using a second encoding process to encode the first encoded data set, thereby compressing the data to be compressed.

Video coding systems or apparatus utilizing context-based adaptive binary arithmetic coding (CABAC) during encoding and/or decoding, are configured according to the invention with an enhanced binarization of non-zero Delta-QP (dQP). During binarization the value of dQP and the sign are separately encoded using unary coding and then combined into a binary string which also contains the dQP non-zero flag. This invention capitalizes on the statistical symmetry of positive and negative values of dQP and results in saving bits and thus a higher coding efficiency.