A method, computer program, and computer system is provided for point cloud coding. The method includes receiving, from a bitstream, data corresponding to a point cloud; reconstructing, based on the data, a first attribute value of a first duplicate point from among a plurality of duplicate points corresponding to a single geometry position; obtaining at least one prediction residual corresponding to at least one remaining attribute value of at least one remaining duplicate point from among the plurality of duplicate points; reconstructing the at least one remaining attribute value based on the reconstructed first attribute and the at least one prediction residual; and decoding the data corresponding to the point cloud based on the reconstructed first attribute value and the reconstructed at least one remaining attribute value.

The present disclosure relates to an image processing apparatus and a method that enable decoding of encoded data of an octree in various processing orders. The octree corresponding to point cloud data is encoded after the context is initialized for each layer of the octree. Further, a breadth-first order or a depth-first order is selected as the decoding order for the encoded data of the octree corresponding to point cloud data, and the encoded data is decoded in the selected decoding order. The present disclosure can be applied to an image processing apparatus, an electronic apparatus, an image processing method, a program, or the like, for example.

Compressing files is disclosed. An input file to be compressed is first aligned. Aligning the file includes splitting the file into sequences that can be aligned. The result is a compression matrix, where each row of the matrix corresponds to part of the file. The compression matrix may also serve as a warm start if additional compression is desired. Compression may be performed in stages, where an initial compression matrix is generated in a first stage using larger letter sizes for alignment and then a second compression stage is performed using smaller letter sizes. A consensus sequence id determined from the compression matrix. Using the consensus sequence, pointer pairs are generated. Each pointer pair identifies a subsequence of the consensus matrix. The compressed file includes the pointer pairs and the consensus sequence.

A method for compressing digital data, including: extrapolating a value of each sample of data to be compressed as a function of a value of at least one preceding sample, to produce an extrapolated sample; differentiating between each extrapolated sample and the corresponding sample of data to be compressed, to produce a differentiated sample; and deleting redundancy between successive differentiated samples produced by the differentiating stage.

The systems and methods discussed herein implement a volumetric approach to point cloud representation, compression, decompression, communication, or any suitable combination thereof The volumetric approach can be used for both geometry and attribute compression and decompression, and both geometry and attributes can be represented by volumetric functions. To create a compressed representation of the geometry or attributes of a point cloud, a suitable set of volumetric functions are transformed, quantized, and entropy-coded. When decoded, the volumetric functions are sufficient to reconstruct the corresponding geometry or attributes of the point cloud.

According to one embodiment, a conversion device includes a demultiplexer, first to Nth extractors and a deinterleave unit. The demultiplexer extracts first to Nth substreams from a first compressed stream. The first to Nth substreams are placed in order in the first compressed stream and include first variable-length codes to Nth variable-length codes into which first symbols to Nth symbols of a symbol string have been converted. The first to Nth extractors extract the first variable-length codes to the Nth variable-length codes from the first to Nth substreams. The deinterleave unit reorders the first variable-length codes to the Nth variable-length codes in accordance with the symbol string and outputs a second compressed stream.

A compression coding method, apparatus, and program suitable for continuously coding pieces of fixed length data are provided. The compression coding method includes: dividing, into columns each with a predetermined bit width, records consisting of a fixed-length bit string that includes one or more fields, pieces of data of the same type being contained in the same field among fields determined in advance; and determining, for each column, a probability of occurrence of a bit value in the column at the same position among a plurality of records, and coding the plurality of records on the basis of the probability of occurrence using an entropy coding method.

A computer-implemented method for content-agnostic referencing of a binary data file, the method comprising: determining a length of the binary data file, the length comprising the number of bits of the binary data file; for the determined length, generating all permutations of data of the determined length; locating an index within the generated permutations, wherein the index is the starting position of the binary data file within the generated permutations; and using the length and the index to indicate the binary data file.

Methods for estimating cost savings in a storage system using an external host system. One method includes accessing over a communication network data from a unit of storage of a data storage system, wherein each of the blocks of data is uncompressed. A plurality of blocks is parsed from the data. A plurality of fingerprints is generated from the blocks using a hash algorithm. A deduplication ratio is estimated for the plurality of blocks stored in the unit of storage using a hyperloglog algorithm and a first plurality of buckets compartmentalizing the plurality of blocks, wherein the first plurality of buckets is defined by precision bits of the plurality of fingerprints. An effective compression ratio is estimated for the plurality of blocks stored in the unit of storage using the hyperloglog algorithm and a second plurality of buckets compartmentalizing the plurality of blocks, wherein the second plurality of buckets is defined by ranges of compression ratios.

Systems and methods are provided for compressing data structures. One exemplary method includes accessing a target data structure defining multiple columns, and filtering the columns based on a cardinality of terms in each of the columns. The method also includes, for each filtered column, sorting the data structure by the column, compressing the sorted data structure, and identifying the filtered column as a candidate column when the size of the compressed and sorted data structure is less than a baseline size. The method further includes, for each pair of candidate columns, sorting the data structure by the pair of candidate columns, compressing the pair-sorted data structure, and designating the compressed pair-sorted data structure as an object data structure and the pair of candidate columns as a sorting column pair, when said compressed pair-sorted data structure includes a smallest size compared to sizes of other compressed pair-sorted data structures.