一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復。謝謝您的支持!

姓名
郵箱
手機號碼
標題
留言內(nèi)容
驗證碼

破損壓縮文件的修復還原

王剛,  彭華,  唐永旺

王剛, 彭華, 唐永旺. 破損壓縮文件的修復還原[J]. 電子與信息學報, 2019, 41(8): 1831-1837. doi: 10.11999/JEIT180942
引用本文: 王剛, 彭華, 唐永旺. 破損壓縮文件的修復還原[J]. 電子與信息學報, 2019, 41(8): 1831-1837. doi: 10.11999/JEIT180942
Gang WANG, Hua PENG, Yongwang TANG. Repair and Restoration of Corrupted Compressed Files[J]. Journal of Electronics & Information Technology, 2019, 41(8): 1831-1837. doi: 10.11999/JEIT180942
Citation: Gang WANG, Hua PENG, Yongwang TANG. Repair and Restoration of Corrupted Compressed Files[J]. Journal of Electronics & Information Technology, 2019, 41(8): 1831-1837. doi: 10.11999/JEIT180942

破損壓縮文件的修復還原

doi: 10.11999/JEIT180942

  • 解放軍信息工程大學? ?鄭州? ?450000

基金項目: 國家自然科學基金(61572518, 61501516)
詳細信息
    作者簡介:

    王剛：男，1981年生，副教授，研究方向為信號分析、信息處理、模式識別

    彭華：男，1973年生，教授，研究方向為通信信號處理、軟件無線電

    唐永旺：男，1981年生，講師，研究方向為信息處理、協(xié)議分析

    通訊作者:

    彭華　phzttyw@126.com

  • 中圖分類號: TP301

Repair and Restoration of Corrupted Compressed Files

  • PLA Information Engineering University, Zhengzhou 450000, China

Funds: The National Natural Science Foundation of China (61572518, 61501516)
  • 摘要: 數(shù)據(jù)壓縮和解壓縮已廣泛應(yīng)用于現(xiàn)代通信和數(shù)據(jù)傳輸領(lǐng)域。但是如何解壓縮損壞的無損壓縮文件仍然是一個挑戰(zhàn)。針對在通用編碼領(lǐng)域廣泛使用的無損數(shù)據(jù)壓縮算法，該文提出一種能夠修復誤碼并解壓還原損壞的LZSS文件的有效方法，并給出了理論依據(jù)。該方法通過利用編碼器留下的殘留冗余攜帶校驗信息，在不損失任何壓縮性能的情況下，能夠修復LZSS壓縮數(shù)據(jù)中的錯誤。所提方法不需要增加額外比特，也不改變編碼規(guī)則和數(shù)據(jù)格式，所以與標準算法完全兼容。即采用具有錯誤修復能力的LZSS方案壓縮的數(shù)據(jù)，仍然可以通過標準LZSS解碼器進行解壓。實驗結(jié)果驗證了所提算法的有效性和實用性。
    Abstract: Data compression and decompression are widely used in modern communication and data transmission. However, how to decompress the damaged lossless compressed files is still a challenge. For the lossless data compression algorithm widely used in the general coding field, an effective method is proposed to repair the error and decompress and restore the corrupted LZSS files, and the theoretical basis is given. By using the residual redundancy left by the encoder to carry the check information, the method can repair the errors in LZSS compressed data without loss of any compression performance. The proposed method does not require additional bits or changes in coding rules and data formats, thus it is fully compatible with standard algorithms. That is, the data compressed by LZSS with error repair capability can still be decompressed by standard LZSS decoder. The experimental results verify the validity and practicability of the proposed algorithm.
    • HTML全文

  • 圖  1  LZSS算法

    圖  2  最長匹配前綴的多重性

    圖  3  LZSR編碼器(RSn表示分組Gn的校驗碼)

    圖  4  LZSRD編碼器(RSn表示分組Gn的校驗碼)

    圖  5  最長匹配短語數(shù)量的平均值與文件長度的關(guān)系

    圖  6  嵌入的比特數(shù)量與文件長度的關(guān)系

    圖  7  錯誤修復能力的比較

    圖  8  糾錯率與壓縮文件長度的關(guān)系

  • DRMOTA M and SZPANKOWSKI W. Redundancy of lossless data compression for known sources by analytic methods[J]. Foundations and Trends in Communications and Information Theory, 2016, 13(4): 277–417. doi: 10.1561/0100000090
    DAS S, BULL D M, and WHATMOUGH P N. Error-resilient design techniques for reliable and dependable computing[J]. IEEE Transactions on Device and Materials Reliability, 2015, 15(1): 24–34. doi: 10.1109/TDMR.2015.2389038
    MENGHWAR G D and MECKLENBRAUKER C F. Cooperative versus non-cooperative communications[C]. The 2nd International Conference on Computer, Control and Communication, Karachi, Pakistan, 2009: 1–3.
    HAMSCHIN B M, FERGUSON J D, and GRABBE M T. Interception of multiple low-power linear frequency modulated continuous wave signals[J]. IEEE Transactions on Aerospace and Electronic Systems, 2017, 53(2): 789–804. doi: 10.1109/TAES.2017.2665140
    KWON B, GONG M, and LEE S. Novel error detection algorithm for LZSS compressed data[J]. IEEE Access, 2017, 5: 8940–8947. doi: 10.1109/ACCESS.2017.2704900
    WANG Digang, ZHAO Xiaoqun, and SUN Qingquan. Novel fault-tolerant decompression method of corrupted Huffman files[J]. Wireless Personal Communications, 2018, 102(4): 2555–2574. doi: 10.1007/s11277-018-5277-5
    KOSTINA V, POLYANSKIY Y, and VERDú S. Variable-length compression allowing errors[J]. IEEE Transactions on Information Theory, 2015, 61(8): 4316–4330. doi: 10.1109/TIT.2015.2438831
    ZHANG Jie, YANG Enhui, and KIEFFER J C. A universal grammar-based code for lossless compression of binary trees[J]. IEEE Transactions on Information Theory, 2014, 60(3): 1373–1386. doi: 10.1109/TIT.2013.2295392
    KLEIN S T and SHAPIRA D. Practical fixed length Lempel-Ziv coding[J]. Discrete Applied Mathematics, 2014, 163: 326–333. doi: 10.1016/j.dam.2013.08.022
    KITAKAMI M and KAWASAKI T. Burst error recovery method for LZSS coding[J]. IEICE Transactions on Information and Systems, 2009, E92.D(12): 2439–2444. doi: 10.1587/transinf.e92.d.2439
    PEREIRA Z C, PELLENZ M E, SOUZA R D, et al. Unequal error protection for LZSS compressed data using Reed-Solomon codes[J]. IET Communications, 2007, 1(4): 612–617. doi: 10.1049/iet-com:20060530
    LAKHANI G. Reducing coding redundancy in LZW[J]. Information Sciences, 2006, 176(10): 1417–1434. doi: 10.1016/j.ins.2005.03.007
    PARK B, SAVOLDI A, GUBIAN P, et al. Recovery of damaged compressed files for digital forensic purposes[C]. 2008 International Conference on Multimedia and Ubiquitous Engineering, Busan, South Korea, 2008: 365–372. doi: 10.1109/MUE.2008.49.
    KOSTINA V, POLYANSKIY Y, and VERD S. Joint source-channel coding with feedback[J]. IEEE Transactions on Information Theory, 2017, 63(6): 3502–3515. doi: 10.1109/TIT.2017.2674667
    KEMPA D and KOSOLOBOV D. LZ-end parsing in compressed space[C]. 2017 Data Compression Conference, Snowbird, USA, 2017: 350–359.
    徐金甫, 劉露, 李偉, 等. 一種基于陣列配置加速比模型的無損壓縮算法[J]. 電子與信息學報, 2018, 40(6): 1492–1498. doi: 10.11999/JEIT170900

    XU Jinfu, LIU Lu, LI Wei, et al. A new lossless compression algorithm based on array configuration speedup model[J]. Journal of Electronics &Information Technology, 2018, 40(6): 1492–1498. doi: 10.11999/JEIT170900
    DO H H, JANSSON J, SADAKANE K, et al. Fast relative Lempel-Ziv self-index for similar sequences[J]. Theoretical Computer Science, 2014, 532: 14–30. doi: 10.1016/j.tcs.2013.07.024
    ATALLAH M J and LONARDI S. Augmenting LZ-77 with authentication and integrity assurance capabilities[J]. Concurrency and Computation: Practice and Experience, 2004, 16(11): 1063–1076. doi: 10.1002/cpe.804
    REED I S and SOLOMON G. Polynomial codes over certain finite fields[J]. Journal of the Society for Industrial and Applied Mathematics, 1960, 8(2): 300–304. doi: 10.1137/0108018
    WARD M D and SZPANKOWSKI W. Analysis of a randomized selection algorithm motivated by the LZ'77 scheme[C]. The 1st Workshop on Analytic Algorithmics and Combinatorics, New Orleans, USA, 2004: 153–160.
    JACQUET P and SZPANKOWSKI W. Analytical depoissonization and its applications[J]. Theoretical Computer Science, 1998, 201(1/2): 1–62. doi: 10.1016/S0304-3975(97)00167-9
    The Canterbury corpus[EB/OL]. http://corpus.canterbury.ac.nz/descriptions/#cantrbry, 2018.
    The Calgary corpus[EB/OL]. http://corpus.canterbury.ac.nz/descriptions/#calgary, 2018.
  • 加載中
圖(8)
計量
  • 文章訪問數(shù):  3139
  • HTML全文瀏覽量:  1245
  • PDF下載量:  64
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2018-10-10
  • 修回日期:  2019-02-11
  • 網(wǎng)絡(luò)出版日期:  2019-02-26
  • 刊出日期:  2019-08-01

目錄

    /

    返回文章
    返回