Optimization of Error-Bounded Lossy Compression for Hard-to-Compress HPC Data
نویسندگان
چکیده
منابع مشابه
Lossy compression for PDE-constrained optimization: adaptive error control
For the solution of optimal control problems governed by nonlinear parabolic PDEs, methods working on the reduced objective functional are often employed to avoid a full spatio-temporal discretization of the problem. The evaluation of the reduced gradient requires one solve of the state equation forward in time, and one backward solve of the adjoint equation. The state enters into the adjoint e...
متن کاملStatistical mechanical approach to error exponents of lossy data compression
We provide a scheme by which to accurately evaluate the error exponents of a lossy data compression problem, which characterize average probabilities over a code ensemble of compression failure and success above and below a critical compression rate, respectively, utilizing the replica method (RM). Although the existing method used in information theory (IT) is, in practice, limited to only ens...
متن کاملLossy Compression of Elevation Data
Generic lossy image compression algorithms, such as Said & Pearlman's, perform excellently on gridded terrain elevation data. For example, an average DEM compressed down to 0.1 bits per point has an RMS elevation error of 3 meters, although di erent DEMs ranged from 0.25 to 15 meters. This performance compares favorably to compressing with Triangulated Irregular Networks. Preliminary tests also...
متن کاملLossy Compression of Turbulence Data
A number of Grand Challenge applications are capable of generating such large quantities of data that data output may affect the applications performance. An example of such an application is modeling of turbulent convection. One means of dealing with this situation is data compression. This thesis examines applying wavelet based lossy compression techniques to turbulent convection data. It als...
متن کاملMaximum Likelihood Estimation for Lossy Data Compression∗
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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems
سال: 2018
ISSN: 1045-9219
DOI: 10.1109/tpds.2017.2749300