in this paper, an object-based, highly scalable, lossy-to-lossless 3d wavelet coding approach for volumetric medical image data (e.g. mr and ct) is proposed. the new method, called 3dobhs-spiht, is based on the well known set partitioning in hierarchical trees (spiht) algorithm and supports both quality and resolution scalability. the 3d input data is grouped into groups of slices (gos) and eac...

An imposing number of lossy compression techniques used in medicine, represents a challenge for the developers of a Picture Archiving and Communication System (PACS). How to choose an appropriate lossy medical image compression technique for PACS? The question is not anymore whether to compress medical images in lossless or lossy way, but rather which type of lossy compression to use. The numbe...

We demonstrate experimentally and explain theoretically polarization-preserving imaging through a lossy amplitude-distorting medium. This is accomplished by propagating the beam, before its arrival at the lossy distorting medium, through a (multi) mode- and polarization-scrambling fiber and reflecting the signal, after it has passed the lossy distorting medium, from a photorefractive phase-conj...

Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory. For the first 25 years of its existence, rate-distortion theory had relatively little impact on the methods and system...

Recent advancements in sequencing technology have led to a drastic reduction in genome sequencing costs. This development has generated an unprecedented amount of data that must be stored, processed, and communicated. To facilitate this effort, compression of genomic files has been proposed. Specifically, lossy compression of quality scores is emerging as a natural candidate for reducing the gr...

In lossless data compression, given a sequence of observations (Xn)n≥1 and a family of probability distributions {Qθ}θ∈Θ, the estimators (θ̃n)n≥1 obtained by minimizing the ideal Shannon code-lengths over the family {Qθ}θ∈Θ, θ̃n := arg min θ∈Θ [ − logQθ(X 1 ) ] , whereXn 1 := (X1, X2, . . . , Xn), coincide with the classical maximum-likelihood estimators (MLEs). In the corresponding lossy compres...

variously referred to as source coding, lossless coding, noiseless coding or entropy coding exactly and without error, the original message. Lossless coding implies that the message may be decoded back to the original sequence of symbols. The converse of lossless coding (“lossy” coding) implies some degree of approximation of the original message. lossless coding may augment lossy coding, eg VQ...

Because of the vast volume of data being produced by today’s scientific simulations, lossy compression allowing user-controlled information loss can significantly reduce the data size and the I/O burden. However, for large-scale cosmology simulation, such as the Hardware/Hybrid Accelerated Cosmology Code (HACC), where memory overhead constraints restrict compression to only one snapshot at a ti...

Department of Computer Science, University of Edinburgh, JCMB, Edinburgh EH9 3JZ, UK. e-mail: [email protected] Abstract. Lossy counter machines are defined as Minsky n-counter machines where the values in the counters can spontaneously decrease at any time. While termination is decidable for lossy counter machines, structural termination (termination for every input) is undecidable. This und...