# Lossless Medical Image Compression by Integer Wavelet and Predictive Coding

Authors: T. G. Shirsat; V. K. Bairagi
Journal: ISRN Biomedical Engineering
 (2013)

---

## Abstract

The future of healthcare delivery systems and telemedical applications will undergo a radical change due to the developments in wearable technologies, medical sensors, mobile computing, and communication techniques. When dealing with applications of collecting, sorting and transferring medical data from distant locations for performing remote medical collaborations and diagnosis we required to considered many parameters for telemedical application. E-health was born with the integration of networks and telecommunications. In recent years, healthcare systems rely on images acquired in two-dimensional domains in the case of still images or three-dimensional domains for volumetric video sequences and images. Images are acquired by many modalities including X-ray, magnetic resonance imaging, ultrasound, positron emission tomography, and computed axial tomography (Sapkal and Bairagi, 2011). Medical information is either in multidimensional or multiresolution form, which creates enormous amount of data. Retrieval, efficient storage, management, and transmission of these voluminous data are highly complex. One of the solutions to reduce this complex problem is to compress the medical data without any loss (i.e., lossless). Since the diagnostics capabilities are not compromised, this technique combines integer transforms and predictive coding to enhance the performance of lossless compression. The proposed techniques can be evaluated for performance using compression quality measures.


---

## Body

## 1. Introduction

Applications involve image transmission within and among health care organizations using public networks. In addition to compressing the data, this requires handling of security issues when dealing with sensitive medical information system. Compressing medical data includes high compression ratio and the ability to decode the compressed data at various resolutions.In order to provide a reliable and efficient means for storing and managing medical data computer-based archiving systems such as Picture Archiving and Communication Systems (PACSs) and Digital Imaging and Communications in Medicine (DICOM), standards were developed with the explosion in the number of images acquired for diagnostic purposes; the importance of compression has become invaluable in developing standards for maintaining and protecting medical images and health records. Compression offers a means to reduce the cost of storage and to increase the speed of transmission. Thus, medical images have attained a lot of attention towards compression. These images are very large in size and require a lot of storage space. Image compression, can be lossless and lossy. In lossless compression, the recovered data is identical to the original, whereas in the case of lossy compression the recovered data is a close replica of the original with minimal loss of data [1–3].The most common lossless compression algorithms are run-length encoding, LZW, DEFLATE, JPEG, JPEG 2000, JPEG-LS, LOCO-I, and so forth. Lempel-Ziv-Welch is a lossless data compression [4, 5].


## 2. System Overview

### 2.1. IWT Followed by Predictive Coding

Figure1 shows that the integer wavelet transform method is applied on the image F(a) which divides the image into four subbands ss, sd, ds, and dd. Now predictive coding is applied on the four different bands separately giving outputs D1, D2, D3, and D4.Figure 1
IWT followed by predictive coding.The reconstruction process involves applying the predictive decoding followed by inverse integer transform tof10, f11, f12, and f13 decoded bands. The reconstructed image is represented by “X.” To verify the perfect reconstruction, the original and the reconstructed images are subtracted and the output is a dark image with maximum values as zero.In this first technique, IWT is performed first (Figure1) followed by predictive coding technique on the transformed image, while in the second technique method, the predictive coding technique is applied first followed by the integer wavelet transform [6]. These methods use Haar filter in the lifting scheme and the filter coefficients which are given by Type I as follows:
(1)h1=[-1991](16),h2=[0011](-4),
where h1 is the prediction filter coefficient and h2 is the update filter coefficient in the lifting scheme.The filter coefficients of reduction are given by Type-II(2)h1=[-1991](16*1.5),h2=[0011](-4*1.5).
The implementation can be done by using other filters in the lifting scheme [7].


## 2.1. IWT Followed by Predictive Coding

Figure1 shows that the integer wavelet transform method is applied on the image F(a) which divides the image into four subbands ss, sd, ds, and dd. Now predictive coding is applied on the four different bands separately giving outputs D1, D2, D3, and D4.Figure 1
IWT followed by predictive coding.The reconstruction process involves applying the predictive decoding followed by inverse integer transform tof10, f11, f12, and f13 decoded bands. The reconstructed image is represented by “X.” To verify the perfect reconstruction, the original and the reconstructed images are subtracted and the output is a dark image with maximum values as zero.In this first technique, IWT is performed first (Figure1) followed by predictive coding technique on the transformed image, while in the second technique method, the predictive coding technique is applied first followed by the integer wavelet transform [6]. These methods use Haar filter in the lifting scheme and the filter coefficients which are given by Type I as follows:
(1)h1=[-1991](16),h2=[0011](-4),
where h1 is the prediction filter coefficient and h2 is the update filter coefficient in the lifting scheme.The filter coefficients of reduction are given by Type-II(2)h1=[-1991](16*1.5),h2=[0011](-4*1.5).
The implementation can be done by using other filters in the lifting scheme [7].


## 3. Overview of Approach

### 3.1. Implementation of IWT (Lifting Scheme)

In integer wavelet transform, there is a mapping between integers to integers. The simplest lifting scheme is the lazy wavelet transform [8, 9].


### 3.2. Forward Lifting Scheme

In this technique, the input signal is first split into even and odd indexed samples (Figure2) as follows:
(3)(Oddj-1,evenj-1)=split(sj).
The samples are correlated, so it is possible to predict odd samples from even samples which in the case of Haar transform are even values themselves.Figure 2
Forward lifting scheme [10].The difference between the actual samples, odd samples, and the prediction becomes the wavelet coefficients which is called lifting scheme. The update step follows the prediction step, where the even values are updated from the input even samples and the updated odd samples. Now this becomes the scaling coefficients, which will be passed  on to the next stage of transform. The second lifting step is as follows:(4)Dj-1=Oddj-1-P(evenj-1),Sj-1=Evenj-1+U(dj-1).
Finally, the odd elements are replaced by the difference and the even elements by the averages. The lifting scheme provides integer coefficients, and so it is exactly reversible. Computations in the lifting scheme are done to saves a lot of memory and computation time. The total number of coefficients before and after the transform remains the same.


### 3.3. Reverse Lifting Scheme

Figure3 shows that the inverse transform gets back the original signal by exactly reversing the operations of the forward transform with a merge operation in place of a split operation. Here, the number of the input signal must be a power of two, and these samples are reduced by half in each succeeding step until the last step which produces one sample.Figure 3
Reverse lifting scheme [10].Reverse lifting scheme (Figure3) is exactly reverse process of encoding which is exactly reversing the operations of the forward transform with a merge operation in place of a split operation as follows:
(5)Evenj-1=sj-1-U(dj-1),Oddj-1=dj-1+P(Evenj-1),Sj=merge(evenj-1,Oddj-1).
The Haar wavelet transform uses predict and update operations of order one. Using different predict and update operations of higher order, other wavelet transforms can be built using the lifting scheme [10–12].Basic steps involved in the decomposition are firstly, the image/signal is sent through a low pass filter and band-pass filter simultaneously (predict and update in case of lifting) and then downsampled by a factor of 2.This process is repeated, and the final four outputs are combined to form the transformed image. The image is transformed in different subbands of which the first subband is called LL (which represents the low resolution version of the image), the second subband is called LH (which represents the horizontal fluctuations), the third band is called the HL (which represents the vertical fluctuations), and the fourth subband is called the HH (which represents the diagonal fluctuations) (Figure4) [10].Figure 4
Decomposition.The same procedure can be followed to obtain different levels of image decomposition, where we need the inputs given to the lifting or implementing with filter bank techniques.


### 3.4. Predictive Coding-Based Image Compression

There is no particular condition for invertible filters for prediction but broad statements can be made about sufficient conditions for lossless filtering. The condition as given in [8] says “The digital implementation of a filter is lossless if the output is the result of a digital one-to-one operation on the current sample and the recovery processor is able to construct the inverse operator.” It is important to note that the operations must be one-to-one not only on paper but also on the computer. Integer addition of the current sample and a constant is one-to-one under some amplitude constraints on all computer architectures [7].Integer addition can be expressed as(6)e(n)=fof(x(n)+s(n)),
where fof is the overflow operator, x(n) is the current sample, s(n) an integer value which defines the transformation at time n, and e(n) is the current filter output.The reverse operation is given by the following equation:(7)x(n)=fof(e(n)-s(n)).
This process always leads to an increase in the number of bits required. To overcome this, rounding operation on the predictor output is performed making the predictor lossless. The lossless predictive encoder and decoder are shown in Figures 5 and 6.Figure 5
Predictive encoder [5].Figure 6
Predictive decoder [5].Generally, the second-order predictor is used which is also called finite impulse response (FIR) filter. The simplest predictor is the previous value; in this experiment, the predicted value is the sum of the previous two values with alpha and beta being the predictor coefficients,(8)f∧(n)=〈f(n-1)〉.
In the process of predictive coding, input image is passed through a predictor where it is predicted with its two previous values,
(9)f∧(n)=α*f(n-1)+β*f(n-2),
where f∧(n) is the rounded output of the predictor, f(n-1) and f(n-2) are the previous values, and α and β are the coefficients of the second-order predictor ranging from 0 to 1. The output of the predictor is rounded and is subtracted from the original input. This difference is given by
(10)d(n)=f(n)-f∧(n).
Now this difference is given as an input to the decoder part, of the predictive coding technique. In the decoding part the difference is added with the f∧(n) to give the original data as follows:
(11)f(n)=d(n)+f∧(n).Algorithm
(
1
)
Read the original image.
(
2
)
Get size of image inM×N.
(
3
)
Get a new matrix with first two columns and rows with zeros padded to the original matrix.
(
4
)
MultiplyNth and N+1th element in row with alpha and beta, respectively. After rounding it off, add those predicted values with their original values.
(
5
)
Repeat steps(3) and (4) for M×N iterations.Haar wavelet transformation is used in lifting scheme to perform the operation of averaging and differencing to arrive at a new matrix representing the same image in a more concise manner asaveraging:(64+2)/2=33, (3+61)/2=32, (60+6)/2=33, (7+57)/2=32,differencing:64-33=31, 3-32=-29, 60-33=27 and 7-32=-25.2D array representing the 8 × 8 image [13]:
(12)(64236160675795554121351501617474620214342244026273736303133323435292838392541232244451918484915145253111056858595462631).Transformed array after operation on each row of 8 × 8 image [13]:
(13)(32.500.50.531-2927-2532.50-0.5-0.5-2321-191732.50-0.5-0.5-1513-11932.500.50.57-53-132.500.50.5-13-5732.50-0.5-0.59-1113-1532.50-0.5-0.517-1921-2332.500.50.5-2527-2931).Final transformed matrix after one step [13]:
(14)(32.500000000000000000004-44-400004-44-4000.50.527-2523-2100-0.5-0.5-119-75000.50.5-57-91100-0.5-0.521-2325-27).


### 3.5. Predictive Coding Techniques

Various predictive-based coding techniques are analyzed for their effectiveness as in Table1.Table 1
Comparison of available techniques.
Predictive-based coding methods
Comments
LJPEG
(
1
) Predictive algorithm used (2) Huffman or arithmetic entropy    algorithm (3) Highest compression ratio
JPEG LS
(
1
)
Nearly lossless (2) High speed and compression ratio,    mostly used (3) JPEG-LS algorithm is more scalable    than JPEG and JPEG 2000
JPEG 2000
(
1
) Wavelet-based method (2) High noise compensation ratio (3) JPEG 2000 delivers a typical    compression gain in the range of 20%,    depending on the image characteristics (4) Higher-resolution images tend to    benefit more, where JPEG-2000’s   spatial-redundancy prediction can   contribute more to the compression    process (5) JPEG 2000 has quality advantage over    JPEG
MED
(
1
) Belongs to the group of switching    predictors (2) MMSE performs the adaptation    prediction coefficient on the basis of a    training set of causal pixels    this approach can achieve better results (3) Redundancy between frames is    reduced by the prediction of each pixel    based
GAP
(
1
) Gradient estimation around    the current pixel (2) Gradient estimation is estimated by the    context of current pixel
GED
(
1
) GED predictor is a simple combination   of gradient and median predictors (2) Pixel in context of horizontal edge,    vertical edge or smooth region
CALIC
(
1
) Poor performance (2) High-compression ratio (3) More complex algorithm with more    resources
Blending predictor(model based)
(
1
) Models for particular pixel designed    by combination of linear subpredictors (2) Bayesian model averaging used    (BMA), risk associated with this model (3) Better performance
[13–15].


### 3.6. Comparative Analysis

Predictor is the first and the most important step which removes a large amount of spatial redundancy. The most representative predictors are median edge detection (MED) predictor used in JPEG-LS standard and gradient adjusted predictor (GAP) used in CALIC. But novel threshold controlled required, gradient edge detection (GED) predictor which combines simplicity of MED and efficiency of GAP. Analysis shows that GED gives comparable entropies with much complicated GAP. Hence, the suggested method provides efficient way by reducing complexity for X-ray, CT, and MRI images.Lossless image compression has to preserve the exact value of each pixel, regardless of whether there is noise or not. Measure performance predictor can be expressed over the degree of compression. Predictor only eliminates redundancy, and, in fact, does not do compression. Linear predictor is easy and efficient method among this for medical image.


## 3.1. Implementation of IWT (Lifting Scheme)

In integer wavelet transform, there is a mapping between integers to integers. The simplest lifting scheme is the lazy wavelet transform [8, 9].


## 3.2. Forward Lifting Scheme

In this technique, the input signal is first split into even and odd indexed samples (Figure2) as follows:
(3)(Oddj-1,evenj-1)=split(sj).
The samples are correlated, so it is possible to predict odd samples from even samples which in the case of Haar transform are even values themselves.Figure 2
Forward lifting scheme [10].The difference between the actual samples, odd samples, and the prediction becomes the wavelet coefficients which is called lifting scheme. The update step follows the prediction step, where the even values are updated from the input even samples and the updated odd samples. Now this becomes the scaling coefficients, which will be passed  on to the next stage of transform. The second lifting step is as follows:(4)Dj-1=Oddj-1-P(evenj-1),Sj-1=Evenj-1+U(dj-1).
Finally, the odd elements are replaced by the difference and the even elements by the averages. The lifting scheme provides integer coefficients, and so it is exactly reversible. Computations in the lifting scheme are done to saves a lot of memory and computation time. The total number of coefficients before and after the transform remains the same.


## 3.3. Reverse Lifting Scheme

Figure3 shows that the inverse transform gets back the original signal by exactly reversing the operations of the forward transform with a merge operation in place of a split operation. Here, the number of the input signal must be a power of two, and these samples are reduced by half in each succeeding step until the last step which produces one sample.Figure 3
Reverse lifting scheme [10].Reverse lifting scheme (Figure3) is exactly reverse process of encoding which is exactly reversing the operations of the forward transform with a merge operation in place of a split operation as follows:
(5)Evenj-1=sj-1-U(dj-1),Oddj-1=dj-1+P(Evenj-1),Sj=merge(evenj-1,Oddj-1).
The Haar wavelet transform uses predict and update operations of order one. Using different predict and update operations of higher order, other wavelet transforms can be built using the lifting scheme [10–12].Basic steps involved in the decomposition are firstly, the image/signal is sent through a low pass filter and band-pass filter simultaneously (predict and update in case of lifting) and then downsampled by a factor of 2.This process is repeated, and the final four outputs are combined to form the transformed image. The image is transformed in different subbands of which the first subband is called LL (which represents the low resolution version of the image), the second subband is called LH (which represents the horizontal fluctuations), the third band is called the HL (which represents the vertical fluctuations), and the fourth subband is called the HH (which represents the diagonal fluctuations) (Figure4) [10].Figure 4
Decomposition.The same procedure can be followed to obtain different levels of image decomposition, where we need the inputs given to the lifting or implementing with filter bank techniques.


## 3.4. Predictive Coding-Based Image Compression

There is no particular condition for invertible filters for prediction but broad statements can be made about sufficient conditions for lossless filtering. The condition as given in [8] says “The digital implementation of a filter is lossless if the output is the result of a digital one-to-one operation on the current sample and the recovery processor is able to construct the inverse operator.” It is important to note that the operations must be one-to-one not only on paper but also on the computer. Integer addition of the current sample and a constant is one-to-one under some amplitude constraints on all computer architectures [7].Integer addition can be expressed as(6)e(n)=fof(x(n)+s(n)),
where fof is the overflow operator, x(n) is the current sample, s(n) an integer value which defines the transformation at time n, and e(n) is the current filter output.The reverse operation is given by the following equation:(7)x(n)=fof(e(n)-s(n)).
This process always leads to an increase in the number of bits required. To overcome this, rounding operation on the predictor output is performed making the predictor lossless. The lossless predictive encoder and decoder are shown in Figures 5 and 6.Figure 5
Predictive encoder [5].Figure 6
Predictive decoder [5].Generally, the second-order predictor is used which is also called finite impulse response (FIR) filter. The simplest predictor is the previous value; in this experiment, the predicted value is the sum of the previous two values with alpha and beta being the predictor coefficients,(8)f∧(n)=〈f(n-1)〉.
In the process of predictive coding, input image is passed through a predictor where it is predicted with its two previous values,
(9)f∧(n)=α*f(n-1)+β*f(n-2),
where f∧(n) is the rounded output of the predictor, f(n-1) and f(n-2) are the previous values, and α and β are the coefficients of the second-order predictor ranging from 0 to 1. The output of the predictor is rounded and is subtracted from the original input. This difference is given by
(10)d(n)=f(n)-f∧(n).
Now this difference is given as an input to the decoder part, of the predictive coding technique. In the decoding part the difference is added with the f∧(n) to give the original data as follows:
(11)f(n)=d(n)+f∧(n).Algorithm
(
1
)
Read the original image.
(
2
)
Get size of image inM×N.
(
3
)
Get a new matrix with first two columns and rows with zeros padded to the original matrix.
(
4
)
MultiplyNth and N+1th element in row with alpha and beta, respectively. After rounding it off, add those predicted values with their original values.
(
5
)
Repeat steps(3) and (4) for M×N iterations.Haar wavelet transformation is used in lifting scheme to perform the operation of averaging and differencing to arrive at a new matrix representing the same image in a more concise manner asaveraging:(64+2)/2=33, (3+61)/2=32, (60+6)/2=33, (7+57)/2=32,differencing:64-33=31, 3-32=-29, 60-33=27 and 7-32=-25.2D array representing the 8 × 8 image [13]:
(12)(64236160675795554121351501617474620214342244026273736303133323435292838392541232244451918484915145253111056858595462631).Transformed array after operation on each row of 8 × 8 image [13]:
(13)(32.500.50.531-2927-2532.50-0.5-0.5-2321-191732.50-0.5-0.5-1513-11932.500.50.57-53-132.500.50.5-13-5732.50-0.5-0.59-1113-1532.50-0.5-0.517-1921-2332.500.50.5-2527-2931).Final transformed matrix after one step [13]:
(14)(32.500000000000000000004-44-400004-44-4000.50.527-2523-2100-0.5-0.5-119-75000.50.5-57-91100-0.5-0.521-2325-27).


## 3.5. Predictive Coding Techniques

Various predictive-based coding techniques are analyzed for their effectiveness as in Table1.Table 1
Comparison of available techniques.
Predictive-based coding methods
Comments
LJPEG
(
1
) Predictive algorithm used (2) Huffman or arithmetic entropy    algorithm (3) Highest compression ratio
JPEG LS
(
1
)
Nearly lossless (2) High speed and compression ratio,    mostly used (3) JPEG-LS algorithm is more scalable    than JPEG and JPEG 2000
JPEG 2000
(
1
) Wavelet-based method (2) High noise compensation ratio (3) JPEG 2000 delivers a typical    compression gain in the range of 20%,    depending on the image characteristics (4) Higher-resolution images tend to    benefit more, where JPEG-2000’s   spatial-redundancy prediction can   contribute more to the compression    process (5) JPEG 2000 has quality advantage over    JPEG
MED
(
1
) Belongs to the group of switching    predictors (2) MMSE performs the adaptation    prediction coefficient on the basis of a    training set of causal pixels    this approach can achieve better results (3) Redundancy between frames is    reduced by the prediction of each pixel    based
GAP
(
1
) Gradient estimation around    the current pixel (2) Gradient estimation is estimated by the    context of current pixel
GED
(
1
) GED predictor is a simple combination   of gradient and median predictors (2) Pixel in context of horizontal edge,    vertical edge or smooth region
CALIC
(
1
) Poor performance (2) High-compression ratio (3) More complex algorithm with more    resources
Blending predictor(model based)
(
1
) Models for particular pixel designed    by combination of linear subpredictors (2) Bayesian model averaging used    (BMA), risk associated with this model (3) Better performance
[13–15].


## 3.6. Comparative Analysis

Predictor is the first and the most important step which removes a large amount of spatial redundancy. The most representative predictors are median edge detection (MED) predictor used in JPEG-LS standard and gradient adjusted predictor (GAP) used in CALIC. But novel threshold controlled required, gradient edge detection (GED) predictor which combines simplicity of MED and efficiency of GAP. Analysis shows that GED gives comparable entropies with much complicated GAP. Hence, the suggested method provides efficient way by reducing complexity for X-ray, CT, and MRI images.Lossless image compression has to preserve the exact value of each pixel, regardless of whether there is noise or not. Measure performance predictor can be expressed over the degree of compression. Predictor only eliminates redundancy, and, in fact, does not do compression. Linear predictor is easy and efficient method among this for medical image.


## 4. Experimental Result

For more details, see Tables2 and 3.Table 2
Compression ratio of Type I scheme.
Serial number
Name of image
Format
Original size
Encoded size
Compression ratio
1
Ulsar
bmp
263 kb
175 kb
1 : 1.50
jpg
54.1 kb
13.2 kb
1 : 4.00
2
Skull
bmp
516 kb
289 kb
1 : 1.78
jpg
27.5 kb
13.9 kb
1 : 1.97
3
MRI
bmp
168 kb
129 kb
1 : 1.30
jpg
10.2 kb
9.56 kb
1 : 1.06
4
Infrared
bmp
3 mb
395 kb
1 : 7.77
jpg
596 kb
59.8 kb
1 : 9.90
5
Boat
bmp
768 kb
395 kb
1 : 1.94
jpg
83.6 kb
39.8 kb
1 : 2.10
6
Ulsar_infrared
bmp
263 kb
175 kb
1.50 : 1
jpg
20 kb
9.28 kb
2.15 : 1Table 3
Compression ratio of Type II scheme.
Serial number
Name of image
Format
Original size
Encoded size
Compression ratio
1
Ulsar
bmp
263 kb
175 kb
1 : 1.50
jpg
54.1 kb
13.2 kb
1 : 4.00
2
Skull
bmp
516 kb
289 kb
1 : 1.78
jpg
27.5 kb
13.9 kb
1 : 1.97
3
MRI
bmp
168 kb
129 kb
1 : 1.30
jpg
10.2 kb
9.56 kb
1 : 1.06
4
Infrared
bmp
3 mb
395 kb
1 : 7.77
jpg
596 kb
59.8 kb
1 : 9.90
5
Boat
bmp
768 kb
395 kb
1 : 1.94
jpg
83.6 kb
39.8 kb
1 : 2.10
6
Ulsar_infrared
bmp
263 kb
175 kb
1.50 : 1
jpg
20 kb
9.28 kb
2.15 : 1


## 5. Discussion

With the previous available technique of compression, exact inverse is possible so as to recover the original image without any loss. However, due to the finite number representation of computers and rounding off the floating point numbers, exact lossless version of original image after reconstruction is not possible. IWT is the solution form, in which it is seen that using lifting scheme by the perfect reconstruction is possible. Also hardware Design of 2-D High Speed DWT by using Multiplier Wavelet Filters easier [16].These methods for lossless medical image compression performing integer wavelet transform using lifting technique and then lossless predictive coding technique give efficient compression; different combinations of transformed and predicted images are inspected. IWT is giving the smallest file size with Haar wavelet.α and β are the coefficients of the second-order predictor ranging from 0 to 1, giving better result at values 0.5.


## 6. Future Scope

The lifting scheme used is only a two-level lifting scheme. In order to improve the entropy of the transformed image, a multilevel lifting scheme is to be implemented. The performance of the predictive coding can be increased by using higher order predictors with two-dimensional predictions. Another possibility for improving the performance would be to use model-based and adaptive approaches.The performance for lossless compression techniques can also be improved by performing different combinations of various transforms and coding techniques involving IWT and predictive coding, for example, IWT followed by predictive or predictive followed by IWT, and by realizing the most optimal combination that gives the least entropy.


## 7. Conclusion

Among various methods of wavelet transform, it is suggested that the predictive method gives more compression rather than plane wavelet-based compression.In lossless predictive coding technique, we take the difference or prediction error into consideration rather than taking into account the original sample or image; hence, very little amount of data can be lost while predicting, but with acceptable limit of image quality. Entropy and scaled entropy are used to calculate the performance of the system for compressed images.



---

*Source: 832527-2013-06-04.xml*