Professional Documents
Culture Documents
on Concepts
Presenter
Guan-Chen Pan
Research Advisor
Outlines
Introductions
Basic
Introduction
Lossless
or lossy(widely used)
YCbCr
Y
Cb
Cr
0.500 0.419 0.081
R
G
0
128
128
Chrominance Subsampling
The
Compression
ratio ()
Root
where H and W are the height and the width of the images
respectively
6
Peak-to-signal
We
ratio (PSNR)
coding
Coordinate rotation
Karhunen-Loeve transform
Discrete cosine transform
Discrete wavelet transform
Predictive
coding
Coordinate rotation
Draw
Heigh
t
9
do
10
Karhunen-Loeve transform(K
LT)
The
ng.
We represent the autocorrelation ma
trix of the output vector =as
we can substitute with , and assume =0
11
We
12
13
14
We
Predictive Coding
Predictive
Quantization
DCT coefficient F(u,v) is divided
by the corresponding quantization m
atrix Q(u,v) and rounded to the neare
st integer.
Each
17
Luminance
quantization matrix
16
12
14
14
18
24
11
12
13
17
22
35
61
55
56
62
77
92
10
49 64 78 87 103 121 120
1
11 10 10
72 92 95 98
99
2 0 3
Chrominance
Removes
10
14
16
22
37
55
16
19
24
29
56
64
24
26
40
51
68
81
40 51
58 60
57 69
87 80
109 103
104 113
quantization matrix
Huffman Coding
Difference Coding (DC)
Zero Run Length Coding (AC)
Arithmetic Coding
3. Golomb Coding
2.
19
Huffman Coding
Huffman
JPEG(fixed,
not optimal)
20
21
Difference Coding
For
DC coefficients
The DC coefficients is very close to its
neighbors and usually have much larg
er value than AC coefficients.
-
22
24
Arithmetic Coding
Arithmetic
26
Symbol
Probability
Sub-interval
0.05
[0.00,0.05)
0.2
[0.05,0.25)
0.1
[0.25,0.35)
w
e
0.05
0.3
[0.35,0.40)
[0.40,0.70)
0.2
[0.70,0.90)
0.1
[0.90,1.00)
l
First
Second l
27
Symbol
Probability
Sub-interval
0.05
[0.00,0.05)
0.2
[0.05,0.25)
0.1
[0.20,0.35)
0.05
[0.35,0.40)
0.3
[0.40,0.70)
0.2
[0.70,0.90)
0.1
[0.90,1.00)
For
0.071334
interval 0.05~0.25
Symbol
Probability
Sub-interval
0.05
[0.05,0.06)
l
u
0.2
0.1
[0.06,0.1)
[0.1,0.12)
0.05
[0.12,0.13)
0.3
[0.13,0.19)
0.2
[0.19,0.23)
0.1
[0.23,0.25)
0.071334
28
Golomb Coding
Golomb
table
29
determine m from p ,
a = qm + r
Convert q into the prefix. The prefix is co
mposed of q 1 bits followed by a 0 bit.
Convert r into the suffix using the binary c
ode. Threshold parameter (m) = 2^ m.
First,
1.
2.
3.
4.
30
Example
p = 0.93,m = 10, a = 19
q = 1, r = 9
Prefix = 10
Threshold parameter (m) = 2^ m = 6
r threshold
r = r + threshold = 9 + 6 = 15
encode 15 into a -length suffix, =4
Suffix = 1111
Code = 101111
31
Decode
101111
= 1, r = 9
a = 10*1+9 = 19
32
However,
Without
codeword
table
Huffman
Golomb
Adaptive
Golomb
NO
YES
YES
Flexibility
and
adaptatio
n
GOOD
MIDDLE
GOOD
33
An
34
Standard
pe of f
35
The
37 arbitrary-shape orthonormal
DCT bases by Gram-Schmidt process
W 1 H 1
36
Quantization
Q ( k ) Qa k Qc ,
for k 1, 2,..., M
F (k )
Fq (k ) Round
, where k 1, 2,..., M
Q( k )
45
40
35
30
25
20
15
10
100
200
300
400
500
600
37
38
JPEG2000
JPEG
JPEG
2000 encoder
JPEG
2000 decoder
40
41
and real-to-real
0.587
0.114 U 0 x, y
V0 x, y
0.299
U x, y
V
x
,
y
0.5
0.41869
0.08131
1
1
V2 x, y
0.16875 0.33126
0.5 U 2 x, y
.
, and are just like , and ,respectively
.
Y 0.299 0.587 0.114
R 0
Cb
0.169 0.334 0.500
Cr 0.500 0.419 0.081
G 128
B 128
42
and integer-to-integer
U 0 x, y 2U1 x, y U 2 x, y
V0 x, y
V1 x, y U 2 x, y U1 x, y
V2 x, y U 0 x, y U1 x, y
43
44
Irreversible
n
0
10
108
45
46
Tier-1 Encoder
Each
zero coding
sign coding
magnitude refinement coding
run length coding
47
Bit-plane Conversion
Converts
48
17
22
33
48
64
80
96
11
2
22
28
38
52
67
81
96
11
2
33
38
48
62
75
86
10
0
11
6
48
52
62
70
83
96
11
0
12
5
64
67
75
83
96
10
8
11
8
13
2
80
81
86
96
10
8
11
7
12
8
14
2
96
96
10
0
11
0
11
8
12
8
14
0
15
0
11
2
11
2
11
6
12
5
13
2
14
2
15
0
16
0
17
= 000100012
160 = 101000002
49
50
Zero Coding
D
d v d
h D h
d v d
1
h :0~2 v :0~2 d :0~4
51
Sign Coding
h,
v
h D h
v
v: neighborhood si
gn status
:,
= XOR
52
53
Run-Length Coding
For
54
D
(0,1)
CX
(total 19)
Arithmet
ic
encoder
Compressed
data
55
56
Tier-2 Encoder
Rate/Distortion
optimized truncation
57
58
1 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 1
0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 0 0
0 0 1 1 0 1 1 1 1 0
0 0 1 0 0 1 1 1 0 0
0 0 0 0 0 0 1 1 0 0
0 0 0 0 0 0 1 1 0 0
1
1
1
1
2
2
1
1
sections
sections
sections
sections
sections
sections
sections
sections
Zone
Zone
Zone
59
-distance
< threshold
60
Corner
too close
Trapezoid
61
N = 10
= K(m) + K(M-1-m)
62
Construct
1.
2.
3.
the rectan
gular region and obt
ain the orthonormal
DCT basis
Select the DCT basis
that satisfies p+q=ev
en
=
63
Reference:
1.
2.
3.
4.
5.
6.
7.
J.D Huang "Image Compression by Segmentation and Boundary Description , " 2008.
G. Roberts, "Machine Perception of Three-Dimensional Solids," in Optical and Electro- Opt
ical Information Processing, J. T. T. e. al., Ed. Cambridge, MA: MIT Press, 1965, pp. 159-197
.
J. Canny, "A Computational Approach to Edge Detection," IEEE Trans. Pattern Analysis and
Machine Intelligence, vol. 8, pp. 679-698, Nov. 1986.
D. Comaniciu and P. Meer, "Mean Shift: A Robust Approach toward Feature Space Analysi
s, " IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, pp. 603-619, 2002.
J.J Ding, P.Y Lin, S.C Pei, and Y.H Wang, "The Two-Dimensional Orthogonal DCT Expansion i
n Triangular and Trapezoid Regions and Modified JPEG Image Compression, ",VCIP2010
J.J Ding, S.C Pei, W.Y Wei, H.H Chen, and T.H Lee , "Adaptive Golomb Code for Joint Geomet
rically Distributed Data and Its Application in Image Coding", APSIPA 2010
W.Y Wei, "Image Compression", available in http://disp.ee.ntu.edu.tw/tutorial.php
K. R. Rao and P. Yip, Discrete Cosine Transform, Algorithms, Advantage, Applications , New
York: Academic, 1990.
9. S.S. Agaian, Hadamard Matrices and Their Applications , New York, Springer-Verlag, 1985.
10. H. F. Harmuth, Transmission of information by orthogonal functions , Springer, New York,
1970.
8.
64
11. R.
65