Search Results for "compression"

Image processing tool that encodes pixel data as indices within the first 16.7 million digits of PI (π). Features high-performance Numba-accelerated search and a signature 'film-grain' aesthetic upon reconstruction. ZIP also include 16 MB file with 16,7 mil numbers of PI Benchmark(Single-Thread): Hardware & Environment Apple Silicon: Apple M2 (Mac mini/MacBook) x86_64 Platform: Intel Core Ultra 5 225F (Arrow Lake, 10 Cores) OS 1: Fedora 43 (GNOME) OS 2: Windows 11 Pro...

ASYMPTOTICALLY RECURSIVE DATA COMPRESSION (v0.0.0.1)

...Example: instead of building a class to hold a header and then data, represent all of that as Bits, subranges of them, and ints for sizes of its parts. Expansion ability for other kinds of compression, since Bits is a Java interface. Main functions on bits are substring, concat, number of 0 or 1 bits, and number of bits (size). All those operations can be done millions of times per second regardless of size because the AVL forest reuses existing branches recursively. Theres a scalar (originally for copy/pasting subranges of sounds) and a bit Java package. ...

libfgen is a library that implements an efficient and customizable genetic algorithm (GA). It also provides particle swarm optimization (PSO) functionality and an interface for real-valued function minimization or model fitting. It is written in C, but can also be compiled with a C++ compiler. Both Linux and Windows are supported.

M-S Lab is a free software for statistical computing and graphics. M-S Lab is available in two distributions: The built-in language support is implemented in "Own" version. And for users who like to code in Lua scripting language we made a "Lua" version. Both versions are available for free download in the Downloads page.

Aricom is a file compressor. It is based on arithmetic coding compression. Just a proof of concept of the implementation of a statistical compressor. Aimple Java GUI interface provided. Best efficiency than huffman compressor. Entropy and information

The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(

Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.

Fingerprint Imaging Software -- fingerprint pattern classification, minutae detection, Wavelet Scalar Quantization(wsq) compression, ANSI/NIST-ITL 1-2000 reference implementation, baseline and lossless jpeg, image utilities, math and MLP neural net libs