test.jpg.rar

  • 121510949
    了解作者
  • VHDL
    开发工具
  • 4KB
    文件大小
  • rar
    文件格式
  • 0
    收藏次数
  • 1 积分
    下载积分
  • 0
    下载次数
  • 2021-03-26 10:11
    上传日期
huffman compression VHDL 4
test.jpg.rar
  • test.jpg.txt
    30.5KB
内容介绍
JPEGsnoop 1.4.1 by Calvin Hass http://www.impulseadventure.com/photo/ ------------------------------------- Filename: [H:\snoop\test.jpg] Filesize: [412] Bytes Start Offset: 0x00000000 *** Marker: SOI (xFFD8) *** OFFSET: 0x00000000 *** Marker: APP0 (xFFE0) *** OFFSET: 0x00000002 length = 16 identifier = [JFIF] version = [1.1] density = 72 x 72 DPI (dots per inch) thumbnail = 0 x 0 *** Marker: APP1 (xFFE1) *** OFFSET: 0x00000014 length = 22 Identifier = [Exif] Identifier TIFF = 0x[4D4D002A 00000008] Endian = Motorola (big) TAG Mark x002A = 0x002A EXIF IFD0 @ Absolute 0x00000026 Dir Length = 0x0000 Offset to Next IFD = 0x00000000 *** Marker: COM (Comment) (xFFFE) *** OFFSET: 0x0000002C Comment length = 19 Comment=Created with GIMP *** Marker: DQT (xFFDB) *** Define a Quantization Table. OFFSET: 0x00000041 Table length = 67 ---- Precision=8 bits Destination ID=0 (Luminance) DQT, Row #0: 5 3 3 5 7 12 15 18 DQT, Row #1: 4 4 4 6 8 17 18 17 DQT, Row #2: 4 4 5 7 12 17 21 17 DQT, Row #3: 4 5 7 9 15 26 24 19 DQT, Row #4: 5 7 11 17 20 33 31 23 DQT, Row #5: 7 11 17 19 24 31 34 28 DQT, Row #6: 15 19 23 26 31 36 36 30 DQT, Row #7: 22 28 29 29 34 30 31 30 Approx quality factor = 84.93 (scaling=30.13 variance=1.05) *** Marker: DQT (xFFDB) *** Define a Quantization Table. OFFSET: 0x00000086 Table length = 67 ---- Precision=8 bits Destination ID=1 (Chrominance) DQT, Row #0: 5 5 7 14 30 30 30 30 DQT, Row #1: 5 6 8 20 30 30 30 30 DQT, Row #2: 7 8 17 30 30 30 30 30 DQT, Row #3: 14 20 30 30 30 30 30 30 DQT, Row #4: 30 30 30 30 30 30 30 30 DQT, Row #5: 30 30 30 30 30 30 30 30 DQT, Row #6: 30 30 30 30 30 30 30 30 DQT, Row #7: 30 30 30 30 30 30 30 30 Approx quality factor = 84.93 (scaling=30.15 variance=0.29) *** Marker: SOF0 (Baseline DCT) (xFFC0) *** OFFSET: 0x000000CB Frame header length = 17 Precision = 8 Number of Lines = 8 Samples per Line = 8 Image Size = 8 x 8 Raw Image Orientation = Landscape Number of Img components = 3 Component[1]: ID=0x01, Samp Fac=0x22 (Subsamp 1 x 1), Quant Tbl Sel=0x00 (Lum: Y) Component[2]: ID=0x02, Samp Fac=0x11 (Subsamp 2 x 2), Quant Tbl Sel=0x01 (Chrom: Cb) Component[3]: ID=0x03, Samp Fac=0x11 (Subsamp 2 x 2), Quant Tbl Sel=0x01 (Chrom: Cr) *** Marker: DHT (Define Huffman Table) (xFFC4) *** OFFSET: 0x000000DE Huffman table length = 21 ---- Destination ID = 0 Class = 0 (DC / Lossless Table) Codes of length 01 bits (001 total): 00 Codes of length 02 bits (001 total): 06 Codes of length 03 bits (000 total): Codes of length 04 bits (000 total): Codes of length 05 bits (000 total): Codes of length 06 bits (000 total): Codes of length 07 bits (000 total): Codes of length 08 bits (000 total): Codes of length 09 bits (000 total): Codes of length 10 bits (000 total): Codes of length 11 bits (000 total): Codes of length 12 bits (000 total): Codes of length 13 bits (000 total): Codes of length 14 bits (000 total): Codes of length 15 bits (000 total): Codes of length 16 bits (000 total): Total number of codes: 002 Expanded Form of Codes: Codes of length 01 bits: 0 = 00 (EOB) (Total Len = 1) Codes of length 02 bits: 10 = 06 (Total Len = 8) *** Marker: DHT (Define Huffman Table) (xFFC4) *** OFFSET: 0x000000F5 Huffman table length = 31 ---- Destination ID = 0 Class = 1 (AC Table) Codes of length 01 bits (000 total): Codes of length 02 bits (001 total): 01 Codes of length 03 bits (003 total): 00 03 04 Codes of length 04 bits (004 total): 02 05 06 07 Codes of length 05 bits (003 total): 11 13 31 Codes of length 06 bits (001 total): 22 Codes of length 07 bits (000 total): Codes of length 08 bits (000 total): Codes of length 09 bits (000 total): Codes of length 10 bits (000 total): Codes of length 11 bits (000 total): Codes of length 12 bits (000 total): Codes of length 13 bits (000 total): Codes of length 14 bits (000 total): Codes of length 15 bits (000 total): Codes of length 16 bits (000 total): Total number of codes: 012 Expanded Form of Codes: Codes of length 02 bits: 00 = 01 (Total Len = 3) Codes of length 03 bits: 010 = 00 (EOB) (Total Len = 3) 011 = 03 (Total Len = 6) 100 = 04 (Total Len = 7) Codes of length 04 bits: 1010 = 02 (Total Len = 6) 1011 = 05 (Total Len = 9) 1100 = 06 (Total Len = 10) 1101 = 07 (Total Len = 11) Codes of length 05 bits: 11100 = 11 (Total Len = 6) 11101 = 13 (Total Len = 8) 11110 = 31 (Total Len = 6) Codes of length 06 bits: 111110 = 22 (Total Len = 8) *** Marker: DHT (Define Huffman Table) (xFFC4) *** OFFSET: 0x00000116 Huffman table length = 21 ---- Destination ID = 1 Class = 0 (DC / Lossless Table) Codes of length 01 bits (001 total): 05 Codes of length 02 bits (001 total): 06 Codes of length 03 bits (000 total): Codes of length 04 bits (000 total): Codes of length 05 bits (000 total): Codes of length 06 bits (000 total): Codes of length 07 bits (000 total): Codes of length 08 bits (000 total): Codes of length 09 bits (000 total): Codes of length 10 bits (000 total): Codes of length 11 bits (000 total): Codes of length 12 bits (000 total): Codes of length 13 bits (000 total): Codes of length 14 bits (000 total): Codes of length 15 bits (000 total): Codes of length 16 bits (000 total): Total number of codes: 002 Expanded Form of Codes: Codes of length 01 bits: 0 = 05 (Total Len = 6) Codes of length 02 bits: 10 = 06 (Total Len = 8) *** Marker: DHT (Define Huffman Table) (xFFC4) *** OFFSET: 0x0000012D Huffman table length = 31 ---- Destination ID = 1 Class = 1 (AC Table) Codes of length 01 bits (000 total): Codes of length 02 bits (001 total): 01 Codes of length 03 bits (003 total): 02 03 04 Codes of length 04 bits (004 total): 00 05 06 11 Codes of length 05 bits (003 total): 07 21 41 Codes of length 06 bits (001 total): 61 Codes of length 07 bits (000 total): Codes of length 08 bits (000 total): Codes of length 09 bits (000 total): Codes of length 10 bits (000 total): Codes of length 11 bits (000 total): Codes of length 12 bits (000 total): Codes of length 13 bits (000 total): Codes of length 14 bits (000 total): Codes of length 15 bits (000 total): Codes of length 16 bits (000 total): Total number of codes: 012 Expanded Form of Codes: Codes of length 02 bits: 00 = 01 (Total Len = 3) Codes of length 03 bits: 010 = 02 (Total Len = 5) 011 = 03 (Total Len = 6) 100 = 04 (Total Len = 7) Codes of length 04 bits: 1010 = 00 (EOB)
评论
    相关推荐
    • Huffman编码
      利用构建Huffman树实现对文本文件的压缩功能(C++实现)。
    • huffman编码
      huffman编码,ajax读取文件二进制,对读取的数据进行huffman编码 压缩、解压
    • Huffman编码
      用贪心算法求解Huffman编码,建立Huffman树,进行编码译码。
    • Huffman 编码
      实现了Huffman编码算法: 1、使用链表结构。 2、使用《数据结构》(严蔚敏,C语言版)中给出的算法; 3、增加预先排序的功能的算法
    • Huffman编码
      1.要求对文件进行Huffman编码的算法,以及对一编码文件进行解码的算法 2.熟练掌握二叉树的应用;具体要求如下: 最小冗余码/哈夫曼码
    • huffman编码
      huffman编码(编码加解码三个),这个编码是信息论以及各种数据结构的实验,都有用的东西
    • Huffman_encoding.rar
      Huffman encoding uses a specific method to choose the representation of each symbol, which results in a prefix code (that is, the string of bits that represents a particular symbol is never prefixed ...
    • Huffman.zip
      huffman编码代码,用于进行哈夫曼编码,并将结果放入数组,其中不包括译码功能
    • huffman.zip
      数据结构中二叉树算法中哈夫曼树的实现。给定n个权值作为n个叶子结点,构造一棵二叉树,若该树的带权路径长度达到最小,称这样的二叉树为最优二叉树,也称为哈夫曼树。哈夫曼树是带权路径长度最短的树,权值较大的...
    • Huffman.zip
      利用Huffman树实现的文件编码以及对编码文件实现解码