Results 31 to 40 of about 2,963,905 (354)

Efficient Data Compression for CVSLAM Based on Arithmetic Coding in ORB-SLAM2 Framework

open access: yesTaiyuan Ligong Daxue xuebao, 2023
Purposes Collaborative Visual Simultaneous Localization and Mapping (CVSLAM) has attracted more and more researchers’ attention in the field of robotics owing to its low cost of required sensors, the ability to acquire rich environmental information, and
Yinggang WANG   +4 more
doaj   +1 more source

A Progressive Universal Noiseless Coder [PDF]

open access: yes, 1994
The authors combine pruned tree-structured vector quantization (pruned TSVQ) with Itoh's (1987) universal noiseless coder. By combining pruned TSVQ with universal noiseless coding, they benefit from the “successive approximation” capabilities of TSVQ ...
Eve A. Riskin   +4 more
core   +1 more source

Modifikasi Algoritme J-Bit Encoding untuk Meningkatkan Rasio Kompresi

open access: yesJurnal Nasional Teknik Elektro dan Teknologi Informasi, 2017
J-bit encoding is a lossless data compression algorithm that manipulates each bit of file data in order to minimize the size by dividing data into two outputs and combining data into two outputs.
Johanes K.M. Lobang, Pranowo, Suyoto
doaj   +1 more source

Highly reliable and efficient encoding systems for hexadecimal polypeptide-based data storage

open access: yesFundamental Research, 2023
Polypeptides consisting of amino acid (AA) sequences are suitable for high-density information storage. However, the lack of suitable encoding systems, which accommodate the characteristics of polypeptide synthesis, storage and sequencing, impedes the ...
Yubin Ren   +9 more
doaj   +1 more source

Motion estimation and CABAC VLSI co-processors for real-time high-quality H.264/AVC video coding [PDF]

open access: yes, 2010
Real-time and high-quality video coding is gaining a wide interest in the research and industrial community for different applications. H.264/AVC, a recent standard for high performance video coding, can be successfully exploited in several scenarios ...
Casula, M.   +4 more
core   +1 more source

Arithmetic Coding with Folds and Unfolds [PDF]

open access: yes, 2003
Arithmetic coding is a method for data compression. Although the idea was developed in the 1970’s, it wasn’t until the publication of an “accessible implementation” that it achieved the popularity it has today. Over the past ten years arithmetic coding has been refined and its advantages and disadvantages over rival compression schemes, particularly ...
Bird, R, Gibbons, J
openaire   +3 more sources

Tradeoff between compression ratio and decoding delay of distributed source coding for uplink transmissions in machine-type communication

open access: yesInternational Journal of Distributed Sensor Networks, 2018
Rapid growth of machine-type communications devices challenges the future network with a significant aggregated data traffic. Distributed source coding is a promising technique that compresses data sources and decreases required aggregated data ...
Wen Wang   +3 more
doaj   +1 more source

Enabling error-resilient internet broadcasting using motion compensated spatial partitioning and packet FEC for the dirac video codec [PDF]

open access: yes, 2008
Video transmission over the wireless or wired network require protection from channel errors since compressed video bitstreams are very sensitive to transmission errors because of the use of predictive coding and variable length coding. In this paper, a
Cosmas, J, Loo, KK, Tun, M
core   +2 more sources

High-Speed Architecture for Hybrid Arithmetic–Huffman Data Compression

open access: yesTechnologies
This paper proposes a hardware–software co-design for adaptive lossless compression based on Hybrid Arithmetic–Huffman Coding, a table-driven approximation of arithmetic coding that preserves near-optimal compression efficiency while eliminating the ...
Yair Wiseman
doaj   +1 more source

Combined coding of bit planes of images

open access: yesСистемный анализ и прикладная информатика, 2019
The aim of this work is to reduce the computational complexity of lossless compression in the spatial domain due to the combined coding (arithmetic and Run-Length Encoding) of a series of bits of bit planes.
B. J.S. Sadiq   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy