{"title":"新的JPEG无损压缩方法","authors":"W. Wang","doi":"10.1109/PACCS.2009.154","DOIUrl":null,"url":null,"abstract":"Universal lossless algorithms of data compression are always efficient to text and inefficient to JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG. In the end, using the typical example as experiment has been carried out and obtained a preferable compression ratio with little time cost.","PeriodicalId":320447,"journal":{"name":"Pacific-Asia Conference on Circuits, Communications and Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"New Lossless Compression Method for JPEG\",\"authors\":\"W. Wang\",\"doi\":\"10.1109/PACCS.2009.154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Universal lossless algorithms of data compression are always efficient to text and inefficient to JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG. In the end, using the typical example as experiment has been carried out and obtained a preferable compression ratio with little time cost.\",\"PeriodicalId\":320447,\"journal\":{\"name\":\"Pacific-Asia Conference on Circuits, Communications and Systems\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pacific-Asia Conference on Circuits, Communications and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PACCS.2009.154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pacific-Asia Conference on Circuits, Communications and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACCS.2009.154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Universal lossless algorithms of data compression are always efficient to text and inefficient to JPEG data. According to the characteristic of JPEG, a new shuffle algorithm is proposed to resize the JPEG, and then use the universal lossless algorithms to compress the resize JPEG. In the end, using the typical example as experiment has been carried out and obtained a preferable compression ratio with little time cost.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
