36 skills found · Page 2 of 2
heatherprince / CosmopedCompressed CMB likelihood code that uses the MOPED (Multiple/Massively Optimised Parameter Estimation and Data compression) compression scheme to compress the Planck power spectrum
sellibitze / Packagemerge RsImplementation of the package-merge algorithm in Rust. The package-merge algorithm is a tool for data compression and can compute an optimal length-limited prefix-free code.
linuxaged / Idc5thsource code and data sets of <Introduction to Data Compression> 5th edition
wangke517 / RDH EI Using Global Compression Of Zero Valued High Bit Planes And Block RearrangementThis code is the implementation of the paper "Reversible Data Hiding in Encrypted Images Using Global Compression of Zero-valued High Bit-planes and Block Rearrangement".
txtatech / Qr Data CompressorA simple encoder/decoder multi-tool for qr code data compression that utilizes gzip, base64 and hex.
Zakaria-Fakhri / Efficient Data Compression And Decompression With Huffman CodingThis project implements the Huffman coding algorithm for efficient data compression and decompression
Dan8991 / CACTUS Content Aware Compression And Transmission Using Semantics For Automotive LiDAR DataCode for paper: Content-Aware Compression and Transmission Using Semantics for Automotive LiDAR Data
josgard94 / Hamming Codes GeneratorThis repository contains the source code of the Hamming code generator that uses a generating matrix of Hamming 7 (Matrix H7)
panne027 / AppliedEnergy2021This repository contains the test data and code used for the paper titled "Physics-Based Machine Learning Framework for Predicting NOx Emissions from Compression-Ignition Engine Powered Vehicles" that is submitted to the Applied Energy Journal
arsalanjabbari / Image Compressor HuffmanThis project addresses image's efficiency storage challenge by introducing a novel, efficient lossless compression method using Huffman coding. This method not only simplifies implementation but also reduces memory consumption, making it well-suited for resource-limited environments and aiming to revolutionize streamlined image data management.
benrayfield / QuineforgeA quine is a software which outputs its own source code. Quineforge is a very experimental data format for the lossless compression of quines and for translating all possible non-quines (such as pictures of cats, videos, games, GPU matrix multiply algorithms, or nearly anything) into quine form. It uses the (wikipedia page) Chain_rule_for_Kolmogorov_complexity and a 5-way gametree (like a chess or go gametree) to navigate the space of all possible lambda functions. Its security level is planned to be, eventually after the bugs are worked out, enough for the operation of industrial machines and low lag enough to satisfy hardcore gamers. TODO I should copy some of the "fntape" (5 way tree) theory from occamsfuncer readme and various parts of kolmogorov theory. Basically, for example, if we are using sha3_256 (with some pre and post processing of a merkle forest node (or its faster lazy merkle form), then at some few points in a sequence of bits will occur those 256 bits, and the 256 bit ids of other functions, sparsely, and between those are 1 bit at a time opcodes (or 3 or 4 bit opcodes, or something like that), with some opcodes being to say that what follows is a variable size number of 1 bits followed by a 0 bit, then a powOf2 number of bits is a complete binary tree of bits (cbt) which is a lambda function of Lx.Ly.Lz.zxy aka the church encoding of the pair function whose "leafs" are Lx.Ly.x (true) and Lx.L.y.y (false), which goes into the "register" of "fntape" which is basically a lambda datastruct of 2 linkedlists with 5 possible actions from each possible state: move turingtape left (whose cell contents are each a function), move it right, copy register to center of tape, copy center of tape to register, or (heres the only turing complete part) call register on whats at center of turing tape and replace register with what that returns (and using various statistical methods if there is an infinite loop or other nonhalting lambda call it will be given up on quickly before that happens, within some approx specified low lag limits, but compressed forms are expected not to have nonhalters or overly expensive operations etc else they are not shared in the network as often as cheaper faster more useful data structures). So basically theres a bunch of functions, in the space of all possible lambda functions sparsely explored among many computers and people (some of which may be cat memes, minigames, compressed random bitstrings, or whatever) and fntape kind of opcodes aka small bitstrings from one id256 to another id256 such as to say its left child (a few bits of fntape) or its right child etc, or various combinator on eachother, leads to what else. Its a space where, as the name quineforge implies, the distance of bitstring from any function, or from any small set of functions, to any other function, has bigO that is certainly within the distance predicted by kolmogorov complexity theory and which in practice may be able to compete with zip files, 7z files, wavelet sound compression, neuralnet video compression, AIXI compression, andOr any other imaginable kind of compression, and trading compression efficiency for low lag and scalability etc, you might build low lag high voxel count massively multiplayer games with it, or various experiments somewhere within that.
Khaled-Abdelhamid / Arithmetic Codethis is a full impolementation of finite precision Arthimetic encoder / decoder done by integer operations the algorithm is based upon stanford paper Arethmetic coding for data compression by IAN H. WIllEN, RADFORD M. NEAL, and JOHN G. CLEARY A very helpful tutorial I found on Youtube
Mostapha-El-Kaddaoui / Huffman Compression Algorithm CppThis C++ project applies Huffman coding for data compression, utilizing classes for tree nodes and operations. It efficiently encodes input text and decodes the compressed data. However, integrating error handling could fortify its stability and handling of unforeseen scenarios.
smijares / Mbhs2025Code repository from "Learned spectral and spatial transforms for multispectral remote sensing data compression", by S. Mijares, J. Bartrina-Rapesta, M. Hernández-Cabronero, and J. Serra-Sagristà, submitted to the IEEE Geoscience and Remote Sensing Letters in 2025. This repository contains the scripts to train and run the proposed models.
tarunsharma1 / Text Compression Using Huffman CodingThis java project uses data structures like Binary Search Trees, Linked Lists, Priority Queues etc. and implements Huffman coding algorithm , to achieve a maximum compression rate of 46%. Code efficiency for big text files has been kept in mind and by the use of classes such as StringBuffer etc. , a file of size 50mb can be compressed in a mere 180 seconds.
hassanyousuf / H Yousuf A Chugh AutoAppAUTO BUILD Part 1: Project Description: The basis of this assignment is to create an interactive application using 3D, video, audio and still images. Design and develop an engaging experience for the end user with which they can view video, explore specs, etc for a car of your choice. This project will be a collaborative effort between the MMED-3001 class and MMED-1012 class. The assets you develop in MMED-3001 will be implemented, manipulated and controlled dynamically in the MMED-1012 class. Project Requirements: • All 3D elements must be created in Cinema 4D – no exceptions. • Animation and timing are to be created by you. • Brand consistent animation of your chosen car • A final video rendered out in web ready .mp4 format • Video size for final demo reel render will be 1280 pixels wide by 720 pixels high, with 100% H.264 codec compression Pass/Fail Grading Scheme: Pass/Fail Grading Scheme: Overall Accuracy, Design, Editing, Following Directions: 25 marks Split-Screen Animation/Video Look: 20 marks Use of Object Buffers: 10 marks Texturing: 10 marks Camera Angles: 10 marks Lighting Setup: 10 marks Timing to Music: 10 Batch Render Setting Set-up: 5 marks Part 2 Each team will develop a responsive mobile-first application to showcase an interactive implementation of your design. Please note that this means that you can consider how the graphics and interactivity evolve as a web app. Start with a splash page with a “hero shot” - but use a video produced in 3001 instead. See the provided example as a reference. Include some UI elements for navigation - you’ll need to move from this page to an interactive “details” page that showcases selected features. The “details” page should also have controls to navigate and view product details. DESIGNER (Apurav): Create the look and feel of the application. Start at mobile, and evolve your design for tablet and desktop. You are responsible for prototyping the application with a tool of your choice (Adobe XD, InVision, etc). Your prototype will assist the developer to create interactive elements and how to access remote data (text, video clips, images, etc). Remember that you’ll need a few different videos / sizes depending on device. DEVELOPER (Hassan): Create a repository on Github including a detailed Readme file. Put the appropriate information in the Readme file - you will likely have to update throughout the lifecycle of the project. Features Interactive specs info 360 view of car Built With: CSS Grid CSS Flexbox Javascript - Used for custom video player Progress Create WireFrames Create Gui for Thermo Create Thermo Model in C4D Code HTML Code CSS Code JS Implement Back-end elements Clean Up Folders Submit Authors Hassan - Developer Apurav - 3D Designer References
