MMP Presentation

Signal Compression using Multiscale Recurrent Patterns
Eduardo Antonio Barros da Silva

eduardo@lps.ufrj.br
Signal Processing Laboratory Program of Electrical Engineering - COPPE Federal University of Rio de Janeiro
Signal Compression using Multiscale Recurrent Patterns p. 1/96
Summary
The LPS/UFRJ. Data compression. Approximate multiscale pattern matching. The MMP algorithm. Multidimensional extension. The three aspects of MMP R-D optimization. Source Coders using the MMP Paradigm Conclusions.
The LPS
The LPS
Signal Processing Laboratory
The LPS
Signal Processing Laboratory Linked both to Graduate and Undergraduate Departments at Universidade Federal do Rio de Janeiro (UFRJ):
The LPS
Signal Processing Laboratory Linked both to Graduate and Undergraduate Departments at Universidade Federal do Rio de Janeiro (UFRJ): Graduate: Program of Electrical Engineering/COPPE
The LPS
Signal Processing Laboratory Linked both to Graduate and Undergraduate Departments at Universidade Federal do Rio de Janeiro (UFRJ): Graduate: Program of Electrical Engineering/COPPE Undergraduate: Department of Electronics and Computer Science
The LPS
Signal Processing Laboratory Linked both to Graduate and Undergraduate Departments at Universidade Federal do Rio de Janeiro (UFRJ): Graduate: Program of Electrical Engineering/COPPE Undergraduate: Department of Electronics and Computer Science 12 full-time professors;
The LPS
Signal Processing Laboratory Linked both to Graduate and Undergraduate Departments at Universidade Federal do Rio de Janeiro (UFRJ): Graduate: Program of Electrical Engineering/COPPE Undergraduate: Department of Electronics and Computer Science 12 full-time professors; Around 40 Ph.D., 50 M.Sc. and 50 Engineering Students.
Main Research Areas

Image Processing
Main Research Areas

Image Processing Data Compression
Main Research Areas

Image Processing Data Compression Adaptive Systems
Main Research Areas

Image Processing Data Compression Adaptive Systems Signal Processing for Communications
Main Research Areas

Image Processing Data Compression Adaptive Systems Signal Processing for Communications Neural Networks
Main Research Areas

Image Processing Data Compression Adaptive Systems Signal Processing for Communications Neural Networks Voice and Audio Processing
Main Research Areas

Image Processing Data Compression Adaptive Systems Signal Processing for Communications Neural Networks Voice and Audio Processing Analog Electronics
Introduction: Data compression
Data encoding
Let x be any data set. An encoder R maps each x to a binary string representation s. x s = 00101110
R
Data encoding
Let x be any data set. An encoder R maps each x to a binary string representation s. x s = 00101110 Different data sets x can be mapped to different strings s : x s = 10011
R R
Data encoding
Let x be any data set. An encoder R maps each x to a binary string representation s. x s = 00101110 Different data sets x can be mapped to different strings s : x s = 10011 Different encoders produce different representations x s = 010110
R R R
Data compression
Lossless compression: Find an invertible encoder R that minimizes the mean length of the representations s = R(x), considering the set of all {x} of interest.
Data compression
Lossless compression: Find an invertible encoder R that minimizes the mean length of the representations s = R(x), considering the set of all {x} of interest. Lossy compression: Given a distortion metric D, nd a family of encoders Rd and a decoder R1 such that, for each d IR the mean length of the representations s = Rd (x) is minimum, subject to the constraint D(x, x) d, where x = R1 (s).
Classical solutions to the data compression problem

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes.

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes. Lossy compression: No optimal solutions are known (at least implementable ones).

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes. Lossy compression: No optimal solutions are known (at least implementable ones). A popular approach is the three step method:

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes. Lossy compression: No optimal solutions are known (at least implementable ones). A popular approach is the three step method: a transformation step

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes. Lossy compression: No optimal solutions are known (at least implementable ones). A popular approach is the three step method: a transformation step a quantization step

Lossless compression: Optimal (at least in an assymptotic sense) solutions are known. Some examples are Huffman, arithmetic and Lempel-Ziv codes. Lossy compression: No optimal solutions are known (at least implementable ones). A popular approach is the three step method: a transformation step a quantization step a lossless compression (also called entropy coding) step.
In this work we propose to deviate from the three-step encoding paradigm:
In this work we propose to deviate from the three-step encoding paradigm: We use the concept of Multiscale Recurrent Pattern Matching
In this work we propose to deviate from the three-step encoding paradigm: We use the concept of Multiscale Recurrent Pattern Matching In it, the operations of transformation, quantization and coding are interwinded
Multiscale Pattern Matching
Ordinary pattern matching

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2
Multiscale pattern matching

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2

D X V 0 V V
1 2
Theoretical analysis
It can be shown that the approximate multiscale pattern matching can outperform the ordinary approximate pattern matching at low rates, in the Gaussian memoryless source case.
Theoretical analysis
It can be shown that the approximate multiscale pattern matching can outperform the ordinary approximate pattern matching at low rates, in the Gaussian memoryless source case. The theoretical determination of the performance with other sources is an open problem.
The MMP Algorithm
Multidimensional Multiscale Parser - MMP

The MMP (Multi-dimensional Multiscale Parser ) algorithm is a universal data compression algorithm based on multiscale pattern matching

The MMP (Multi-dimensional Multiscale Parser ) algorithm is a universal data compression algorithm based on multiscale pattern matching It uses a dictionary of patterns that is adaptively built while the input data is encoded.

The MMP (Multi-dimensional Multiscale Parser ) algorithm is a universal data compression algorithm based on multiscale pattern matching It uses a dictionary of patterns that is adaptively built while the input data is encoded. The dictionary is updated by the inclusion of concatenations (in a Lempel-Ziv fashion) of dilated/contracted versions of input blocks previously encoded.

The MMP (Multi-dimensional Multiscale Parser ) algorithm is a universal data compression algorithm based on multiscale pattern matching It uses a dictionary of patterns that is adaptively built while the input data is encoded. The dictionary is updated by the inclusion of concatenations (in a Lempel-Ziv fashion) of dilated/contracted versions of input blocks previously encoded. It can perform lossless compression.
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
MMP
Segmentation Tree
X0
Segmentation Tree
X0
node 0
Segmentation Tree
X0
node 0
node 1
node 2
X1
X2
Segmentation Tree
X0
node 0
node 1
node 2
X1
X2 X
5
node 5
node 6
X1
X6
Output sequence
X0
node 0
node 1
node 2
node 5
node 6
Output sequence
X0
node 0
node 1
node 2
node 5
node 6
Output: 0
Output sequence
node 0
X1
node 1
node 2
node 5
node 6
Output: 0
Output sequence
node 0
X1
node 1
node 2
node 5
node 6
Output: 0, 1
Output sequence
X1
node 0
X1
node 1
node 2
node 5
node 6
Output: 0, 1, i1
Output sequence
X2
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1
Output sequence
X2
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0
Output sequence
node 0
X5
node 1 node 2
node 5
node 6
Output: 0, 1, i1 , 0
Output sequence
node 0
X5
node 1 node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1
Output sequence
X5
node 0
X5
node 1 node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5
Output sequence
node 0
X6
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5
Output sequence
node 0
X6
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5 , 1
Output sequence
X6
node 0
X6
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5 , 1, i6
Output sequence
X0
node 0
X0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5 , 1, i6
Decoding
node 0
Decoding
node 0
node 1
node 2
Output: 0
Decoding
node 0
node 1
node 2
Output: 0, 1
Decoding
X1
node 0
node 1
node 2
Output: 0, 1, i1
Decoding
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0
Decoding
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1
Decoding
X5
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5
Decoding
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5 , 1
Decoding
X6
node 0
node 1
node 2
node 5
node 6
Output: 0, 1, i1 , 0, 1, i5 , 1, i6
Decoding
X0
node 0
X5
X6
X2
node 1 node 2
X1
X2
X0
node 5 node 6
Output: 0, 1, i1 , 0, 1, i5 , 1, i6
Block coding
Block coding
Block coding
Block coding
Block coding
Block coding
Block coding
Implementation issues
The block size M = 2K is a power of 2.
The block size M = 2K is a power of 2. There are only K + 1 different scales.
The block size M = 2K is a power of 2. There are only K + 1 different scales. To avoid the computation of scale transformations at each mach attempt, we can use several copies of the dictionary, one at each possible scale.
The block size M = 2K is a power of 2. There are only K + 1 different scales. To avoid the computation of scale transformations at each mach attempt, we can use several copies of the dictionary, one at each possible scale. Therefore we have K + 1 dictionaries, D (0) , D(1) , . . . , D(K)
Output entropy coding

The output is encoded by an adaptive arithmetic coder.

The output is encoded by an adaptive arithmetic coder. There are K + 1 independent models to enconde the ags dening the segmentation tree, each one corresponding to a different scale.

The output is encoded by an adaptive arithmetic coder. There are K + 1 independent models to enconde the ags dening the segmentation tree, each one corresponding to a different scale. There are k + 1 independent models used to encode the indices in D.
Multidimensional extensions
MMP segmentation
When the imput signal is one-dimensional, MMP can split an input block of lenght N in two sub-blocks of length N/2. This is equivalent to choose a segmentation point p in a one dimensional-space as p = N/2.
MMP segmentation
When the imput signal is one-dimensional, MMP can split an input block of lenght N in two sub-blocks of length N/2. This is equivalent to choose a segmentation point p in a one dimensional-space as p = N/2. When the input signal is multi-dimensional, we just have to choose a segmentation point p in a multi-dimensional space.
2D segmentation: quad-tree
MMP segmentation variations

There are many different ways to choose the segmentation point in the multi-dimensional space.
MMP segmentation variations

There are many different ways to choose the segmentation point in the multi-dimensional space. The two-dimensional segmentation presented previously does not preserve the binary tree segmentation structure.
2D segmentation: binary tree
Scale Transformations
The scale transformations are simple sampling rate change operations.
The scale transformations are simple sampling rate change operations. Good results are usually obtained with linear interpolation and decimation.
The scale transformations are simple sampling rate change operations. Good results are usually obtained with linear interpolation and decimation. Zero order interpolation also works. More sophisticated interpolation schemes, like splines, make little difference in the performance.
Initial Dictionary
Initial Dictionary
MMP builds the dictionary as it encodes the data.
Initial Dictionary
MMP builds the dictionary as it encodes the data. Therefore, the initial dictionary can be very simple, with no need for any kind of training.
Initial Dictionary
MMP builds the dictionary as it encodes the data. Therefore, the initial dictionary can be very simple, with no need for any kind of training. For images, it is common to initialize the dictionary at scale 1 1 (D0 ) with the impulses having all integer amplitudes from 0 to 255.
Initial Dictionary
MMP builds the dictionary as it encodes the data. Therefore, the initial dictionary can be very simple, with no need for any kind of training. For images, it is common to initialize the dictionary at scale 1 1 (D0 ) with the impulses having all integer amplitudes from 0 to 255. The initial dictionaries at other scales can be derived from the one at scale D0 by the scale transformations. Thus, they will be composed of two-dimensional rectangular pulses.
Initial Dictionary
Using this initial dictionary, MMP can have good results for a large class of image data, ranging from smooth images to document and graphics images. It even works for white gaussian noise.
Initial Dictionary
Using this initial dictionary, MMP can have good results for a large class of image data, ranging from smooth images to document and graphics images. It even works for white gaussian noise. One can thus say that MMP has a universal character.
Initial Dictionary
Using this initial dictionary, MMP can have good results for a large class of image data, ranging from smooth images to document and graphics images. It even works for white gaussian noise. One can thus say that MMP has a universal character. Also using this initial dictionary, one can achieve lossless compression.
Initial Dictionary
Using this initial dictionary, MMP can have good results for a large class of image data, ranging from smooth images to document and graphics images. It even works for white gaussian noise. One can thus say that MMP has a universal character. Also using this initial dictionary, one can achieve lossless compression. For lossy image compression, it sufces to quantize the amplitudes of the initial dictionaries with step size 4.
Dictionary Updating
Dictionary Updating
In MMP, the dictionary is updated by concatenations of previously encoded segments.
Dictionary Updating
In MMP, the dictionary is updated by concatenations of previously encoded segments.
Dictionary Updating
However, the dictionary can be updated using other criteria, depending of the source to be encoded.
Dictionary Updating
However, the dictionary can be updated using other criteria, depending of the source to be encoded. For example, for smooth images, a deblocking lter could be applied to a block before it is included in the dictionary, or a block could be included or not according to perceptual criteria.
Dictionary Updating
The dictionary could also be updated using displaced blocks belonging to the blocks causal neighborhood
Dictionary Updating
Dictionary Updating
Dictionary Updating
Dictionary Updating
Dictionary Updating
Rotated blocks could also be used.

d

Dictionary Updating
d

Rotated blocks could also be used.
Other option is to only insert words that are sufciently distant from the others.
d

Source of blockiness in MMP

MMP parses the input signal in variable sized blocks. As a lossy compressor, MMP replaces each input block by a distorted version of it. Each block is independently processed. This means that even if the dictionary is composed of smooth functions, MMP makes no attempt to control the smoothness of the concatenation of blocks. In image compression applications at moderate compression ratios, the resulting blockiness tends to become highly visible.
X0
X1
X2
X5
X6
(a)
(a) Before coding;

X0
^0
X
X1
X2
X1
^2
X
X5
X6
^5
X
^6
X
(a)
(b)
(a) Before coding;
(b) After Coding.

The three aspects of MMP
Quantization Method
Since MMP encodes segments of a signal with vectors from a dictionary, it can be regarded as a vector quantizer.
Quantization Method
Since MMP encodes segments of a signal with vectors from a dictionary, it can be regarded as a vector quantizer. It is an adaptive, multiscale vector quantizer.
Encoding Method
Since MMP encodes segments of an image using concatenations of previously occurred patterns, it can be regarded as a method based on recurrent pattern matching, as Lempel-Ziv encoders.
Encoding Method
Since MMP encodes segments of an image using concatenations of previously occurred patterns, it can be regarded as a method based on recurrent pattern matching, as Lempel-Ziv encoders. It is a multiscale, lossy recurrent pattern matching method.
Transform-based Method
The dictionary in MMP grows with concatenations of words previously present in the dictionary.
The dictionary in MMP grows with concatenations of words previously present in the dictionary. If the initial dictionary has only pulse functions with several amplitudes and scales, then the dictionary is built by functions that are concatenations of pulses with several scales.
The dictionary in MMP grows with concatenations of words previously present in the dictionary. If the initial dictionary has only pulse functions with several amplitudes and scales, then the dictionary is built by functions that are concatenations of pulses with several scales. Then the signal is eventually approximated with concatenations of expansions and contractions of pulses
X(t) =
k
t k k
X(t) =
k
t k k
X(t) =
k
t k k
(t), its expansions, contractions and translations form an orthogonal basis.
(t)
Using this knowledge, one can devise a post-processing method that can greatly reduce the blockiness inherent in MMP-based methods.
Using this knowledge, one can devise a post-processing method that can greatly reduce the blockiness inherent in MMP-based methods.
One lters the decoded signal with a smoothing lter whose kernel depends on the support of the basis function it is ltering.
One lters the decoded signal with a smoothing lter whose kernel depends on the support of the basis function it is ltering.
The best results are usually obtained with a gaussian kernel
Without post-lter - PSNR = 30.02dB@0.15bpp;
Without post-lter: PSNR = 30.02dB@0.15bpp With post-lter: PSNR = 31.21dB@0.15bpp
R-D optimization
Segmentation tree
The segmentation tree described so far was built considering local decisions based on distortion calculations.
Segmentation tree
The segmentation tree described so far was built considering local decisions based on distortion calculations. We can expect an improved compression performance if we build the segmentation tree using a global criterium based on distortion and rate evaluations.
Notation
node 0
node 1
node 2
node 5
node 6
Segmentation tree: S = {0, 1, 2, 5, 6}
Notation
node 0
node 1
node 2
node 5
node 6
Segmentation tree: S = {0, 1, 2, 5, 6} Distortion of node l: D(l) = Xl Sil
Notation
node 0
node 1
node 2
node 5
node 6
Segmentation tree: S = {0, 1, 2, 5, 6} Distortion of node l: D(l) = Xl Sil Rate of index il : R(l) = log2 (Pr(il |kl ))
Notation
node 0
node 1
node 2
node 5
node 6
Segmentation tree: S = {0, 1, 2, 5, 6} Distortion of node l: D(l) = Xl Sil Rate of index il : R(l) = log2 (Pr(il |kl )) Distortion of the Segmentation tree: D(S) =
lSF
D(l)
Notation
node 0
node 1
node 2
node 5
node 6
Segmentation tree: S = {0, 1, 2, 5, 6} Distortion of node l: D(l) = Xl Sil Rate of index il : R(l) = log2 (Pr(il |kl )) Distortion of the Segmentation tree: D(S) =
lSF
D(l) R(l)
Rate of the segmentation tree: RA (S) +

lSF
The optimization problem

Given a target rate R , nd S such that minimize D(S) constrained to R(S) = R

Given a target rate R , nd S such that minimize D(S) constrained to R(S) = R Introducing the Lagrange multiplier 0 we have the equivalent unconstrained problem: minimize J(S) = D(S) + R(S)

Given a target rate R , nd S such that minimize D(S) constrained to R(S) = R Introducing the Lagrange multiplier 0 we have the equivalent unconstrained problem: minimize J(S) = D(S) + R(S) Dening J(l) = D(l) + R(l), we have J(S) = RA (S) +
lSF
J(l)
Sub-Trees
Tree S node 0
node 1
node 2
node 5
node 6
Sub-Trees
Tree S node 0
node 1 The sub-tree S(2)
node 2
node 5
node 6
Sub-Trees
Tree S node 0
node 1 The sub-tree S(2)
node 2
node 5
node 6
J(S(l)) = RA (S(l)) +
lSF S(l)
J(l)
Lagrangian costs
If l is a leaf node,
1 J(S(l)) = D(l) + (Rl + R(l))
Lagrangian costs
1 J(S(l)) = D(l) + (Rl + R(l))
If l is not a leaf node,

0 J(S(l)) = Rl + J(S(2l + 1)) + J(S(2l + 2))
Lagrangian costs
1 J(S(l)) = D(l) + (Rl + R(l))
If l is not a leaf node,

0 J(S(l)) = Rl + J(S(2l + 1)) + J(S(2l + 2))
Then we must prune S(2l + 1) andS(2l + 2) whenever

1 0 D(l) + (Rl + R(l)) < Rl + J(S(2l + 1)) + J(S(2l + 2))
Coupling through D
The previous strategy is sub-optimal in the sense that it assumes that the costs of the nodes are not coupled. This is not true because of the dictionary updating procedure.
node 0
node 1
node 2
node 3
node 4
Coupling through D
The previous strategy is sub-optimal in the sense that it assumes that the costs of the nodes are not coupled. This is not true because of the dictionary updating procedure.
node 0
node 1
node 2
node 3
node 4
Therefore we must consider the impact of the pruning of a sub-tree in the costs of the remaining nodes before we decide whether to prune it or not.
Optimization procedure
We initialize S as a full tree.
We initialize S as a full tree. The tree is traversed from the leaf nodes towards the root node.
We initialize S as a full tree. The tree is traversed from the leaf nodes towards the root node. We must prune the descendants of the node l if J(l)+Rl1 +Jl < J(S(2l+1))+J(S(2l+2))+Rl0 where Jl =
rS l
J (r)
rS l
J(r).
We initialize S as a full tree. The tree is traversed from the leaf nodes towards the root node. We must prune the descendants of the node l if J(l)+Rl1 +Jl < J(S(2l+1))+J(S(2l+2))+Rl0 where Jl =
rS l
J (r)
rS l
J(r).
The procedure is repeated until convergence
Source Coders using the MMP Paradigm
Side-Match MMP
Uses a subset of the dictionary D, the state dictionary Ds , to encode a given input block.
Side-Match MMP
Uses a subset of the dictionary D, the state dictionary Ds , to encode a given input block. Ds is composed of vectors that comply to a smoothness criterion, considering a causal neighborhood.
Side-Match MMP
Uj Lj Xj
Side-Match MMP
Uj Lj Xj
Ds is evaluated prior to the processing of each block.
Experimental results
Simulation Parameters:
Simulation Parameters: Two-dimensional MMP was applied to compress gray scale images.
Simulation Parameters: Two-dimensional MMP was applied to compress gray scale images. Maximum input block size 16 16.
Simulation Parameters: Two-dimensional MMP was applied to compress gray scale images. Maximum input block size 16 16. Maximum dictionary size 32768
Simulation Parameters: Two-dimensional MMP was applied to compress gray scale images. Maximum input block size 16 16. Maximum dictionary size 32768 Initial dictionary at scale 0: Range from 0 to 255; step size 4.
Images used
PSNR x rate for image Lena

42 40 38 36 PSNR (dB) 34 32 30 28 26 24 SM-MMP-RD MMP-RD MMP SPIHT JPEG
0.2
0.4
0.6 R (bits/pixel
0.8
1.2
PSNR x rate for image Cameraman

38 36 34 32 PSNR (dB) 30 28 26 24 22
SMMMPRD JPEG2000
0.1
0.2
0.3
0.4
0.5
0.6 R (bpp)
0.7
0.8
0.9
1.1
PSNR x rate for image F-16

44 42 40 38 36 PSNR (dB) 34 32 30 28 26 24 22 0 0.2 0.4 0.6 R (bits/pixel
SM-MMP-RD MMP-RD MMP SPIHT JPEG
0.8
1.2
PSNR x rate for image pp1205

36 34 32 30 PSNR (dB) 28 26 24 22 20 18 0.1 SM-MMP-RD MMP-RD MMP SPIHT JPEG
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.1
1.2
R (bits/pixel

36 34 32 30 PSNR (dB) 28 26 24 22 20 0.1 SM-MMP-RD MMP-RD MMP SPIHT JPEG
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1.1
1.2
R (bits/pixel
MMP x SM-MMP - Lena
Left: MMP; Right - SM-MMP

MMP x SPIHT - Lena
MMP x SPIHT - pp1205
MMP x SPIHT - pp1209
MMP-Intra
It encodes with MMP the residual of the an Intra prediction similar to the one used in H.264.
MMP-Intra
It encodes with MMP the residual of the an Intra prediction similar to the one used in H.264.
Vertical
Horizontal
45
Directional Modes
MMP-Intra
Mi : partition for prediction; ii : partition for MMP encoding
M1 M2 i1 i0 i2 i3
MMP-Intra
Mi : partition for prediction; ii : partition for MMP encoding
M1 M2 i1 i0 i2 i3
They are optimized according to RD criteria

PSNR x rate for image Lena

42 40 38 36 34 32 30 MMPIntra w/ new Dic design H.264/AVC High JPEG2000 0 0.2 0.4 0.6 bpp
PSNR (dB)
0.8
1.2
1.4
PSNR x rate for image Gold

42 40 38 PSNR (dB) 36 34 32 30 28 0 0.2 0.4 0.6 MMPIntra w/ new Dic design H.264/AVC High JPEG2000 0.8 1 bpp
1.2
1.4
1.6
1.8
PSNR x rate for image Cameraman

44 42 40 38 PSNR (dB) 36 34 32 30 28 26 0 0.2 0.4 MMPIntra w/ new Dic design H.264/AVC High JPEG2000 0.6 0.8 bpp
1.2
1.4
1.6

40 38 36 PSNR (dB) 34 32 30 28 26 24 0.3 0.4 0.5 0.6
MMPIntra w/ new Dic design H.264/AVC High JPEG2000 0.7 0.8 bpp
0.9
1.1
1.2
1.3

36 34 32 PSNR (dB) 30 28 26 24 MMPIntra w/ new Dic design H.264/AVC High JPEG2000 0 0.2 0.4 0.6 bpp
0.8
1.2
MMP-Video
The universal character of MMP makes it a good candidate for encoding displaced frame differences.
MMP-Video
The universal character of MMP makes it a good candidate for encoding displaced frame differences. The initial dictionary at frame n + 1 is the same as the one at the end of encoding frame n.
MMP-Video
The universal character of MMP makes it a good candidate for encoding displaced frame differences. The initial dictionary at frame n + 1 is the same as the one at the end of encoding frame n. Different probability models are used for vectors entering the dictionary during the encoding of P, B, luminance and chrominance frames.
MMP-Video
This proposal has been tested by replacing the INTER encoding of displaced frame differences in an H.264 encoder by the MMP.
MMP-Video
This proposal has been tested by replacing the INTER encoding of displaced frame differences in an H.264 encoder by the MMP. We have used as a starting point the JM9.6 H.264 software.
Results for Foreman - P Slices

Foreman.cif P slices 50 48 46 44 Average PSNR 42 40 38 36 34 32 30 28 0 MMPVideo Y H.264 high Y MMPVideo U H.264 high U MMPVideo V H.264 high V 10000 20000 30000 40000 50000 60000 70000 80000 90000100000 Average bits/frame
Results for Foreman - B Slices

Foreman.cif B slices 50 48 46 44 Average PSNR 42 40 38 36 34 32 30 28 0 MMPVideo Y H.264 high Y MMPVideo U H.264 high U MMPVideo V H.264 high V 2000 4000 6000 8000 10000 12000 14000 16000 18000 20000 Average bits/frame
Other Developments
MMP for Stereo Pairs
The dictionary learnt while encoding the left view is used to encode the right view.
The dictionary learnt while encoding the left view is used to encode the right view. Good results have been reported.
MMP for ECG

1250 1200 1150 1100 1050 1000 950 900 850 0 0.5 1 1.5 t (seconds) 2 2.5 3
MMP for ECG

1250 1200 1150 1100 1050 1000 950 900 850 0 0.5 1 1.5 t (seconds) 2 2.5 3
The quasi-periodic nature of the ECG makes it a good candidate for encoding with MMP.
MMP for ECG

1250 1200 1150 1100 1050 1000 950 900 850 0 0.5 1 1.5 t (seconds) 2 2.5 3
The quasi-periodic nature of the ECG makes it a good candidate for encoding with MMP. Good results have been reported.
Conclusions
Conclusions
We developed the MMP, an universal lossy/lossless compressor based on multiscale pattern matching.
Conclusions
We developed the MMP, an universal lossy/lossless compressor based on multiscale pattern matching. Differently from many other coders, MMP does not rely on the transformation-quantization-entropy coding paradigm.
Conclusions
We developed the MMP, an universal lossy/lossless compressor based on multiscale pattern matching. Differently from many other coders, MMP does not rely on the transformation-quantization-entropy coding paradigm. It was succesfully applied to lossy compress different sets of data, such as still images, mixed compounds (graphics+text+still images), video, stereo pairs and ECG data.
Conclusions
Its complexity is equivalent to the one of vector quantization.
Conclusions
Its complexity is equivalent to the one of vector quantization. Therefore, its computational complexity is an important issue.
Future work
Development of fast versions of MMP.
Future work
Development of fast versions of MMP. Development of speech and audio codecs using the MMP paradigm.
Future work
Development of fast versions of MMP. Development of speech and audio codecs using the MMP paradigm. Further improvement in its coding efciency in image and video coding.
Future work
Development of fast versions of MMP. Development of speech and audio codecs using the MMP paradigm. Further improvement in its coding efciency in image and video coding. Theoretical analysis of MMP performance with sources other than the memoryless Gaussian source.
References
References
Can be found in http://www.lps.ufrj.br/profs/eduardo/ Alternatively, email eduardo@lps.ufrj.br
Thank you!
Back to Summary

MMP Presentation

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

MMP Presentation

Încărcat de

Drepturi de autor:

Formate disponibile

Signal Compression using Multiscale Recurrent Patterns

Eduardo Antonio Barros da Silva

Signal Compression using Multiscale Recurrent Patterns p. 3/96

Signal Compression using Multiscale Recurrent Patterns p. 4/96

Signal Compression using Multiscale Recurrent Patterns p. 4/96

Signal Compression using Multiscale Recurrent Patterns p. 4/96

Signal Compression using Multiscale Recurrent Patterns p. 4/96

Signal Compression using Multiscale Recurrent Patterns p. 4/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Main Research Areas

Signal Compression using Multiscale Recurrent Patterns p. 5/96

Introduction: Data compression

Signal Compression using Multiscale Recurrent Patterns p. 6/96

Signal Compression using Multiscale Recurrent Patterns p. 7/96

Signal Compression using Multiscale Recurrent Patterns p. 7/96

Signal Compression using Multiscale Recurrent Patterns p. 7/96

Signal Compression using Multiscale Recurrent Patterns p. 8/96

Signal Compression using Multiscale Recurrent Patterns p. 8/96

Classical solutions to the data compression problem

Signal Compression using Multiscale Recurrent Patterns p. 9/96

Classical solutions to the data compression problem

Signal Compression using Multiscale Recurrent Patterns p. 9/96

Classical solutions to the data compression problem

Signal Compression using Multiscale Recurrent Patterns p. 9/96

Classical solutions to the data compression problem

Signal Compression using Multiscale Recurrent Patterns p. 9/96

Classical solutions to the data compression problem

Signal Compression using Multiscale Recurrent Patterns p. 9/96

Classical solutions to the data compression problem

In this work we propose to deviate from the three-step encoding paradigm:

Signal Compression using Multiscale Recurrent Patterns p. 10/96

Signal Compression using Multiscale Recurrent Patterns p. 10/96

Signal Compression using Multiscale Recurrent Patterns p. 10/96

Multiscale Pattern Matching

Signal Compression using Multiscale Recurrent Patterns p. 11/96

Ordinary pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 12/96

Ordinary pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 12/96

Ordinary pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 12/96

Ordinary pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 12/96

Ordinary pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 12/96

Multiscale pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 13/96

Multiscale pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 13/96

Multiscale pattern matching

Signal Compression using Multiscale Recurrent Patterns p. 13/96