{"title":"基于压缩感知和熵编码的联合图像压缩与加密","authors":"Mohab Mostafa, M. Fakhr","doi":"10.1109/CSPA.2017.8064937","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a joint image compression and encryption technique based on Compressed Sensing (CS). Our work is based on JPEG standard. After the quantization stage, blocks in the DCT domain become sparse, however, if we use CS on the whole block the Entropy coding compression is severely affected. As a result, we split the DCT coefficients between Entropy coding path and CS path followed by its Entropy coder. As an added value for CS, partial encryption is achieved. To split the DCT coefficients to Entropy and CS paths, we developed five different algorithms; each algorithm uses a unique method to split every 8×8 block in the image into two parts. First part is encoded using Huffman coding, while the second part goes through compression stage using CS, then encoded using Huffman coding. At the end, we combine encoded parts to get the compressed and encrypted image. To strengthen the image encryption, we use the CS secret key to shuffle image blocks using Arnold Cat Map. The five algorithms are tested on 15 popular images and the results show that 2 techniques can achieve compression gain over JPEG as well as the partial encryption, all at a PSNR very close to JPEG.","PeriodicalId":445522,"journal":{"name":"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Joint image compression and encryption based on compressed sensing and entropy coding\",\"authors\":\"Mohab Mostafa, M. Fakhr\",\"doi\":\"10.1109/CSPA.2017.8064937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a joint image compression and encryption technique based on Compressed Sensing (CS). Our work is based on JPEG standard. After the quantization stage, blocks in the DCT domain become sparse, however, if we use CS on the whole block the Entropy coding compression is severely affected. As a result, we split the DCT coefficients between Entropy coding path and CS path followed by its Entropy coder. As an added value for CS, partial encryption is achieved. To split the DCT coefficients to Entropy and CS paths, we developed five different algorithms; each algorithm uses a unique method to split every 8×8 block in the image into two parts. First part is encoded using Huffman coding, while the second part goes through compression stage using CS, then encoded using Huffman coding. At the end, we combine encoded parts to get the compressed and encrypted image. To strengthen the image encryption, we use the CS secret key to shuffle image blocks using Arnold Cat Map. The five algorithms are tested on 15 popular images and the results show that 2 techniques can achieve compression gain over JPEG as well as the partial encryption, all at a PSNR very close to JPEG.\",\"PeriodicalId\":445522,\"journal\":{\"name\":\"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSPA.2017.8064937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 13th International Colloquium on Signal Processing & its Applications (CSPA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSPA.2017.8064937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint image compression and encryption based on compressed sensing and entropy coding
In this paper, we propose a joint image compression and encryption technique based on Compressed Sensing (CS). Our work is based on JPEG standard. After the quantization stage, blocks in the DCT domain become sparse, however, if we use CS on the whole block the Entropy coding compression is severely affected. As a result, we split the DCT coefficients between Entropy coding path and CS path followed by its Entropy coder. As an added value for CS, partial encryption is achieved. To split the DCT coefficients to Entropy and CS paths, we developed five different algorithms; each algorithm uses a unique method to split every 8×8 block in the image into two parts. First part is encoded using Huffman coding, while the second part goes through compression stage using CS, then encoded using Huffman coding. At the end, we combine encoded parts to get the compressed and encrypted image. To strengthen the image encryption, we use the CS secret key to shuffle image blocks using Arnold Cat Map. The five algorithms are tested on 15 popular images and the results show that 2 techniques can achieve compression gain over JPEG as well as the partial encryption, all at a PSNR very close to JPEG.