Lossy Data Compression Using Logarithm

نویسندگان

  • Vivek Kumar
  • Srijita Barthwal
  • Rishabh Kishore
  • Ruchika Saklani
  • Anuj Sharma
  • Sandeep Sharma
چکیده

Lossy compression algorithms take advantage of the inherent limitations of the human eye and discard information that cannot be seen. [1] In the present paper a technique termed as Lossy Data Compression using Logarithm (LDCL) is proposed to compress incoming binary data in the form of a resultant matrix containing the logarithmic values of different chosen numeric sets. The proposed method is able to achieve compression ratio up to 60 in many major cases.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Miminum Entropy Set Cover Problem for Lossy Data Compression

Classical minimum entropy set cover problem relies on the finding the most likely assignment between the set of observations and the given set of their types. The solution is described by such partition of data space which minimizes the entropy of the distribution of types. The problem finds a natural application in the machine learning, clustering and data classification. In this paper we show...

متن کامل

Lossless Source Coding Lecture Notes & Examples

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...

متن کامل

A class of authentication digital watermarks for secure multimedia communication

A new approach to digital signatures for imaging, which adapts well to multimedia communications in lossy channels is introduced. Rather than attaching the signature's bit-string as a file-header, it is invisibly etched into the image using a new watermarking algorithm. The watermark is "nonfragile," tolerating small distortions but not malicious tampering aimed at modifying the image's content...

متن کامل

Effect of lossy compression of quality scores on variant calling

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...

متن کامل

فشرده‌سازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر

Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1604.02035  شماره 

صفحات  -

تاریخ انتشار 2016