数据压缩方法的历史透视

V. Nikam, S. Dhande
{"title":"数据压缩方法的历史透视","authors":"V. Nikam, S. Dhande","doi":"10.11648/j.mcs.20230803.11","DOIUrl":null,"url":null,"abstract":": Several data compression algorithms are investigated in this study. Data compression is commonly utilized in the community. Because data compression allows us to conserve storage space, it can also assist to speed up data transport from one point to another. It is vital to have a compression tool on hand when compressing from one person to another. This method can be used to make data smaller. In addition to text data, images and video may be saved. Lossy and non-lossy compressions are the two types of compression techniques. Compression (lossless) and compression (lossy) which is, nevertheless, the most widely used? It is necessary to conduct lossless compression. Huffman, Shannon Fano, and other lossless compression techniques, as well as Tunstall, Lempel, Ziv Welch, and run-length encoding, are all instances of runlength encoding. This article explains how a compression strategy works and which approach is most typically used in data compression. A form of compression is text compression. The consequences of this process may be seen in the compressed file size, which is less than the original file. In this article, many data compression techniques are surveyed, including those developed by Shannon, Fano, and Huffman. Data compression seeks to increase active data density by minimizing redundant information in data that is stored or sent. Storage and distributed systems are two domains where data compression is crucial. Information theory ideas are thoroughly examined in relation to the objectives and assessment of data compression techniques. The algorithms that are presented are subjected to a framework that is created for the evaluation and comparison of approaches.","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":"61 1","pages":""},"PeriodicalIF":2.0000,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Historical Perspective on Approaches to Data Compression\",\"authors\":\"V. Nikam, S. Dhande\",\"doi\":\"10.11648/j.mcs.20230803.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\": Several data compression algorithms are investigated in this study. Data compression is commonly utilized in the community. Because data compression allows us to conserve storage space, it can also assist to speed up data transport from one point to another. It is vital to have a compression tool on hand when compressing from one person to another. This method can be used to make data smaller. In addition to text data, images and video may be saved. Lossy and non-lossy compressions are the two types of compression techniques. Compression (lossless) and compression (lossy) which is, nevertheless, the most widely used? It is necessary to conduct lossless compression. Huffman, Shannon Fano, and other lossless compression techniques, as well as Tunstall, Lempel, Ziv Welch, and run-length encoding, are all instances of runlength encoding. This article explains how a compression strategy works and which approach is most typically used in data compression. A form of compression is text compression. The consequences of this process may be seen in the compressed file size, which is less than the original file. In this article, many data compression techniques are surveyed, including those developed by Shannon, Fano, and Huffman. Data compression seeks to increase active data density by minimizing redundant information in data that is stored or sent. Storage and distributed systems are two domains where data compression is crucial. Information theory ideas are thoroughly examined in relation to the objectives and assessment of data compression techniques. The algorithms that are presented are subjected to a framework that is created for the evaluation and comparison of approaches.\",\"PeriodicalId\":45497,\"journal\":{\"name\":\"Journal of Mathematics and Computer Science-JMCS\",\"volume\":\"61 1\",\"pages\":\"\"},\"PeriodicalIF\":2.0000,\"publicationDate\":\"2023-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematics and Computer Science-JMCS\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11648/j.mcs.20230803.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematics and Computer Science-JMCS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11648/j.mcs.20230803.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

本研究探讨了几种数据压缩算法。数据压缩在社区中被广泛使用。因为数据压缩允许我们节省存储空间,它还可以帮助加速数据从一个点到另一个点的传输。当从一个人压缩到另一个人时,手边有一个压缩工具是至关重要的。这种方法可以使数据更小。除了文本数据外,还可以保存图像和视频。有损压缩和非有损压缩是两种类型的压缩技术。然而,压缩(无损)和压缩(有损)哪一种应用最广泛?进行无损压缩是必要的。Huffman、Shannon Fano和其他无损压缩技术,以及Tunstall、Lempel、Ziv Welch和游程编码,都是游程编码的实例。本文解释了压缩策略是如何工作的,以及哪种方法在数据压缩中最常用。压缩的一种形式是文本压缩。这个过程的后果可以从压缩文件的大小中看出,它比原始文件小。在本文中,考察了许多数据压缩技术,包括Shannon、Fano和Huffman开发的技术。数据压缩旨在通过最小化存储或发送的数据中的冗余信息来增加活动数据密度。存储和分布式系统是数据压缩至关重要的两个领域。信息理论的思想在数据压缩技术的目标和评估方面进行了彻底的检查。所提出的算法服从于一个框架,该框架是为评估和比较方法而创建的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Historical Perspective on Approaches to Data Compression
: Several data compression algorithms are investigated in this study. Data compression is commonly utilized in the community. Because data compression allows us to conserve storage space, it can also assist to speed up data transport from one point to another. It is vital to have a compression tool on hand when compressing from one person to another. This method can be used to make data smaller. In addition to text data, images and video may be saved. Lossy and non-lossy compressions are the two types of compression techniques. Compression (lossless) and compression (lossy) which is, nevertheless, the most widely used? It is necessary to conduct lossless compression. Huffman, Shannon Fano, and other lossless compression techniques, as well as Tunstall, Lempel, Ziv Welch, and run-length encoding, are all instances of runlength encoding. This article explains how a compression strategy works and which approach is most typically used in data compression. A form of compression is text compression. The consequences of this process may be seen in the compressed file size, which is less than the original file. In this article, many data compression techniques are surveyed, including those developed by Shannon, Fano, and Huffman. Data compression seeks to increase active data density by minimizing redundant information in data that is stored or sent. Storage and distributed systems are two domains where data compression is crucial. Information theory ideas are thoroughly examined in relation to the objectives and assessment of data compression techniques. The algorithms that are presented are subjected to a framework that is created for the evaluation and comparison of approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.10
自引率
4.00%
发文量
77
期刊最新文献
On F-Frobenius-Euler polynomials and their matrix approach On Reich and Chaterjea type cyclic weakly contraction mappings in metric spaces Global stability of a diffusive Leishmaniasis model with direct and indirect infection rate https://www.isr-publications.com/jmcs/articles-12886-numerical-finite-difference-approximations-of-a-coupled-parabolic-system-with-blow-up A note on degenerate Euler polynomials arising from umbral calculus
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1