Results 1 to 10 of about 3,187 (246)
Recursive Least Squares for Near-Lossless Hyperspectral Data Compression
Applied Sciences, 2022 The hyperspectral image compression scheme is a trade-off between the limited hardware resources of the on-board platform and the ever-growing resolution of the optical instruments.
Tie Zheng +3 more
doaj +1 more source
Error-Control Truncated SVD Technique for In-Network Data Compression in Wireless Sensor Networks
IEEE Access, 2021 In-network data compression plays an important role in the elimination of redundant time-series data in a wireless sensor network (WSN). Inconsistency of data and high computational process in cluster formation remain to be challenging issues of in ...
Md Khorshed Alam +3 more
doaj +1 more source
Enhanced Binary MQ Arithmetic Coder with Look-Up Table
Information, 2021 Binary MQ arithmetic coding is widely used as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000.
Hyung-Hwa Ko
doaj +1 more source
Compressed CNN Plant Leaf Ｒecognition Model Fused with Bayesian
Journal of Harbin University of Science and Technology, 2021 Aiming at the problem that there are many parameters in the process of plant leaf recognition and it is easy to produce over-fitting，in order to reduce the cost of storage and calculation，this paper proposes a plant leaf recognition convolutional ...
YAN Ming, ZHU Liang-kuan, JING Wei-peng
doaj +1 more source
Recursion-theoretic ranking and compression [PDF]
Journal of Computer and System Sciences, 2019 For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $ ^*$? And for which sets A does there exist such a mapping that respects the lexicographical ordering within A? Both cases are types of perfect, minimal hash functions.
Lane A. Hemaspaandra, Daniel Rubery
openaire +2 more sources
Probability Distribution on Full Rooted Trees
Entropy, 2022 The recursive and hierarchical structure of full rooted trees is applicable to statistical models in various fields, such as data compression, image processing, and machine learning.
Yuta Nakahara +3 more
doaj +1 more source
A theory of memory for binary sequences: Evidence for a mental compression algorithm in humans.
PLoS Computational Biology, 2021 Working memory capacity can be improved by recoding the memorized information in a condensed form. Here, we tested the theory that human adults encode binary sequences of stimuli in memory using an abstract internal language and a recursive compression ...
Samuel Planton +9 more
doaj +1 more source
Universal triple encoding for compression and protecting binary data
Безопасность информационных технологий, 2021 The paper is devoted to the actual problem of compression of processed and transmitted data, as well as of the data storage and protection. The analysis and features of data compression methods are presented.
Victor A. Shurygin, Igor M. Yadykin
doaj +1 more source
Improving Compressed Video Using Single Lightweight Model with Temporal Fusion Module
Sensors, 2023 Video compression algorithms are commonly used to reduce the number of bits required to represent a video with a high compression ratio. However, this can result in the loss of content details and visual artifacts that affect the overall quality of the ...
Tien-Ying Kuo +3 more
doaj +1 more source
Parallel Recursive State Compression for Free [PDF]
, 2011 This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a tree-based multi-core compression method, which works by leveraging sharing among sub-vectors of state vectors. An algorithmic analysis of both worst-case and optimal compression ratios shows the
Laarman, Alfons +2 more
openaire +4 more sources