{'fraction_non_alphanumeric': 0.01966955153422502, 'fraction_numerical': 0.006294256490952006, 'mean_word_length': 4.916279069767442, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Predictive-DCT Coding for 3D Mesh Sequences Compression

JVRB, 5(2008), no. 6. - This paper proposes a new compression algorithm for
dynamic 3d meshes. In such a sequence of meshes,
neighboring vertices have a strong tendency to behave
similarly and the degree of dependencies between their
locations in two successive frames is very large which can
be efficiently exploited using a combination of Predictive
and DCT coders (PDCT). Our strategy gathers mesh
vertices of similar motions into clusters, establish a
local coordinate frame (LCF) for each cluster and
encodes frame by frame and each cluster separately. The
vertices of each cluster have small variation over a
time relative to the LCF. Therefore, the location of
each new vertex is well predicted from its location in
the previous frame relative to the LCF of its cluster.
The difference between the original and the predicted
local coordinates are then transformed into frequency
domain using DCT. The resulting DCT coefficients are
quantized and compressed with entropy coding. The
original sequence of meshes can be reconstructed from only a few non-zero DCT coefficients without
 significant loss in visual quality. Experimental results
 show that our strategy outperforms or comes close to other
 coders.