R. M. Elaskary, Mohamed Saeed, T. Ismail, H. Mostafa, S. Gabran
{"title":"混合DCT/量化霍夫曼压缩脑电图数据","authors":"R. M. Elaskary, Mohamed Saeed, T. Ismail, H. Mostafa, S. Gabran","doi":"10.1109/JEC-ECC.2017.8305790","DOIUrl":null,"url":null,"abstract":"In this paper, We implement the Discrete Cosine Transform (DCT) coding (lossy compression method) followed by the proposed coding technique which called “Quantized Huffman Coding” in order to minimize the EEG data size. Therefore, adding a lossless compression algorithm after the lossy compression is a good idea to get a high compression ratio with acceptable distortion in the original signal. Here, we use DCT encoder followed by either quantized Huffman Coding or Run Length Encoding (RLE) then compare between them. Our work shows that, at the same Root Mean Square Error (RMSE), the quantized Huffman coding outperforms the RLE in some aspects as Compression Ratio (CR) and time consumed in compression and decompression, but Structural Similarity Index (SSIM) is the same for the two techniques.","PeriodicalId":406498,"journal":{"name":"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Hybrid DCT/Quantized Huffman compression for electroencephalography data\",\"authors\":\"R. M. Elaskary, Mohamed Saeed, T. Ismail, H. Mostafa, S. Gabran\",\"doi\":\"10.1109/JEC-ECC.2017.8305790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, We implement the Discrete Cosine Transform (DCT) coding (lossy compression method) followed by the proposed coding technique which called “Quantized Huffman Coding” in order to minimize the EEG data size. Therefore, adding a lossless compression algorithm after the lossy compression is a good idea to get a high compression ratio with acceptable distortion in the original signal. Here, we use DCT encoder followed by either quantized Huffman Coding or Run Length Encoding (RLE) then compare between them. Our work shows that, at the same Root Mean Square Error (RMSE), the quantized Huffman coding outperforms the RLE in some aspects as Compression Ratio (CR) and time consumed in compression and decompression, but Structural Similarity Index (SSIM) is the same for the two techniques.\",\"PeriodicalId\":406498,\"journal\":{\"name\":\"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JEC-ECC.2017.8305790\",\"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 Japan-Africa Conference on Electronics, Communications and Computers (JAC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEC-ECC.2017.8305790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybrid DCT/Quantized Huffman compression for electroencephalography data
In this paper, We implement the Discrete Cosine Transform (DCT) coding (lossy compression method) followed by the proposed coding technique which called “Quantized Huffman Coding” in order to minimize the EEG data size. Therefore, adding a lossless compression algorithm after the lossy compression is a good idea to get a high compression ratio with acceptable distortion in the original signal. Here, we use DCT encoder followed by either quantized Huffman Coding or Run Length Encoding (RLE) then compare between them. Our work shows that, at the same Root Mean Square Error (RMSE), the quantized Huffman coding outperforms the RLE in some aspects as Compression Ratio (CR) and time consumed in compression and decompression, but Structural Similarity Index (SSIM) is the same for the two techniques.