Books
in black and white
Main menu
Home About us Share a book
Books
Biology Business Chemistry Computers Culture Economics Fiction Games Guide History Management Mathematical Medicine Mental Fitnes Physics Psychology Scince Sport Technics
Ads

- Acharya T.

Acharya T. - John Wiley & Sons, 2000. - 292 p.
ISBN 0-471-48422-9
Download (direct link): standardforImagecompressioncon2000.pdf
Previous << 1 .. 71 72 73 74 75 76 < 77 > 78 79 80 81 82 83 .. 100 >> Next

00 OC 06 02 00 00 01 03 03 00 00 00
FF 90 (SOT) 0 78
00 OA 00 00 00 00 OC 32 00 01
FF 93 (SOD) <5 90
FF 91 (SOP) <5 92, Packet sequence number = 0 00 04 00 00 C7 DF A6 EO
FF 92 (EPH) <5 102
FF 91 (SOP) <5 415, Packet sequence number = 1 00 04 00 01 C7 D9 70 47 D9 76 C7 DB 66 00 FF 92 (EPH) 0 431
FF 91 (SOP) <5 1098, Packet sequence number = 2
00 04 00 02 E3 F6 F4 A9 3E 7B OE 3F 6F 4D 93 E7 B2 67 FO E9 12 3E 7A 88
FF 92 (EPH) <5 1124
FF D9 (EOC) <5 3200
206
CODING ALGORITHMS IN JPEG2000
The first packet header with sequence index number 0 contains information only for the LL2 subbands; it starts at byte 92 with start-of-packet marker (SOP) FF 91, and can be decoded as follows:
FF 91 ==> SOP marker (start at byte 92)
00 04 ==> 4 bytes length for marker segment, excluding the marker 00 00 ==> packet sequence number = 0
C7 DF A6 E0
(1)(1)(00 01)(11 1101 111) (1 10)(10 0110 11)0 0000 0 1 2 3 4 5
LL2 with lxl code-block
Tag Tree 1 Tag Tree 2 # of Coding Pass
Inclusion Zero-Bit-Plane
mm®
0: “1” means nonzero packet;
1: “1” inclusion bit, Tag Tree 1 decode, layer # = 0;
2: “0001” Tag Tree 2 decode, # of zero bit-planes = 3;
3: “111101111” decode # of coding passes with Table 7.10; 6 + 15 = 21;
4: “110” has 2 indicators; LBlock = 3 + 2 = 5; decode length, 5+ [log22l\ = 9;
5: “1 0011 0111” = (01 37) h = 311 (bytes).
The second packet header with sequence index number 1 contains information for three different subbands, HL2, LH2, and HH2, and can be decoded as follows:
FF 91 ==> SOP marker (start at byte 415)
00 04 ==> 4 bytes length for marker segment, excluding the marker
00 01 ==> packet sequence number = 1
C7 D9 70 47
(1)(1)(00 01)(11 1101 100) (1 0)(1U 0000 0) (1) (00 00(11
0 1 2 3 4 5 6 7
Length
(bytes)
311
TIER-2 CODING IN JPEG2000
207
D9 76 C7 DB
1101 100)(1 0)(111 0110 1)(1)(00 01)(11 1101 101)(1
8 9 10 11 12 13 14
66 00
0)(110 0110 0)000 0000 15
HL2 with lxl code-block
Tag Tree 1 Tag Tree 2 # of Coding Pass Length
Inclusion Zero-Bit-Plane (bytes)
|~0~| |~3~] ] 18 | 1 224
0: “1” means nonzero packet;
1 2
3
4
5 LH2 with lxl code-block
“1” inclusion bit, Tag Tree 1 decode, layer # = 0;
“0001” Tag Tree 2 decode, # of zero bit-planes = 3;
“111101100” decode # of coding passes with Table 7.10; 6 -I- 12 = 18; “10” has 1 indicator; LBlock = 3+1=4; decode length, 4+ [log2l&\ = 8; “1110 0000” = (EO)^ = 224 (bytes);
Tag Tree 1 Tag Tree 2 # of Coding Pass Length
Inclusion Zero-Bit-Plane (bytes)
|~0~1 f~3~| ] 18 | | 237
“1” inclusion bit, Tag Tree 1 decode, layer # = 0;
“0001” Tag Tree 2 decode, # of zero bit-planes = 3;
“111101100” decode # of coding passes with Table 7.10; 6 -I- 12 = 18;
9: “10” has 1 indicator; LBlock = 3 + 1=4; decode length, 4+ [/052I8J = 8; 10: “1110 1101” = (ED)^ = 237 (bytes);
HH2 with lxl code-block
Tag Tree 1 Tag Tree 2 # of Coding Pass Length
Inclusion Zero-Bit-Plane (bytes)
PH [~3~| ] 19 1 | 204
208 CODING ALGORITHMS IN JPEG2000
11: “1” inclusion bit, Tag Tree 1 decode, layer # = 0;
12: “0001” Tag Tree 2 decode, # of zero bit-planes = 3;
13: “111101101” decode # of coding passes with Table 7.10; 6 + 13 = 19;
14: “10” has 1 indicator; LBlock = 3 + 1=4; decode length, 4+[іо^2І9] = 8;
15: “1100 1100” = (CC)h = 204 (bytes).
The third packet header with sequence index number 2 contains information for the last three subbands, HLl, LH1, and HH1, and can be decoded as follows:
FF 91 ==> SOP marker (start at byte 1098)
00 04 ==> 4 bytes length for marker segment, excluding the marker
00 02 ==> packet sequence number = 2
E3 F6 F4 A9
(1)(1)(1)(0 001)(1) (1111 0110 1) (111 0)(100 1010 100)(1) 01234 5 6 7 8
3E 7B 0E 3F
(001)(1 1110 0111)(10)(11 0000 1)(1)(1)(0 001)(1) (1111
9 10 11 12 13 14 15 16 17
6F 4D 93 E7
0110 1) (111 0)(100 1101 100)(1) (001)(1 1110 0111)
18 19 20 21 22
B2 67 F0 E9
(10)(11 0010 0)(1)(1)(0 01)(1)(1 1111 0000) (1110) (1001 23 24 25 26 27 28 29 30
12 3E 7 A 88
0001 00)(1)(0 001)(1 1110 0111)(10)(10 1000 1)000 31 32 33 34 35 36
HLl with 2x1 code-block
TIER-2 CODING IN JPEG2000
209
Tag Tree 1 Inclusion
Tag Tree 2 Zero-Bit-Plane
# of Coding Pass
Length
(bytes)
0
0
gi (0,0) gi(l,0) *i(0,0) ^(1,0)
19
13
596 97
0
9o(0,0) 20 (0,0)
0: “1” means nonzero packet;
1: (Inclusion) Tag Tree 1 decode; upper-level node 9o(0,0) need decode first; “1” 9o(0,0) = 0;
2: “1” 9i (0,0) =0;
3: (Zero bit-plane) Tag Tree 2 decode; upper-level node zo(0,0) need decode first; “0001” 2O(0,0) = 3;
4: “1” *i(0,0) = 3;
5: “111101101” decode # of coding passes with Table 7.10; 6 + 13 = 19;
6: “1110” has 3 indicators; LBlock = 3 + 3 = 6; decode length, 6+ IJ052I9J = 10;
7: “10 0101 0100” = (02 54),, = 596 (bytes);
8: “1” (Inclusion) gi(l,0) = 0;
9: “001” zi(0,0) = z0(0,0) + l + l=5;
10: “111100111” decode # of coding passes with Table 7.10; 6 + 7 = 13;
11: “10” has 1 indicator; LBlock = 3 + 1=4; decode length, 4+ [log^l^l = 7; 12: “110 0001” = (61)h = 97 (bytes);
Previous << 1 .. 71 72 73 74 75 76 < 77 > 78 79 80 81 82 83 .. 100 >> Next