Documente Academic
Documente Profesional
Documente Cultură
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 205
Abstract—A digital library of ancient documents makes the information accessible for everyone via the web and permits
conserving, preserving and enhancing the value of the cultural and scientific heritage. Nevertheless, with a digital form, these
types of documents are threatened to be hacked, modified or even diffused illegally. As a consequence, we risk losing the
intellectual property of these documents. To curb these frauds, watermarking represents a promising method to protect these
images. In this context, our work makes part of protecting essentially ancient documents. In this paper, we have proposed a
method of watermarking ancient documents, which is based on the wavelet packet transform and on a convolutional error
correcting code. The insertion is performed in the coefficients of maximum amplitude being in the best basis decomposition,
according to an entropy criterion. This method proves noticeable signature invisibility and robustness against attacks of type to
signal processing attacks (noise, filter and compression) as a first contribution to watermarking ancient documents.
Index Terms—Ancient documents, Best base of Wavelet packets, Error correcting code, Watermarking.
—————————— ——————————
1 INTRODUCTION
selecting this base is to run through the entropic tree of a 2.1.3 Selecting the Signature Carrier Points
letter decomposition level N-1 towards the 0 level, we Choosing the signature carrier points is very important
compare the entropy value of a father node with entropy and influences intensively the degree of robustness of a
values of its four sons. We detail this strategy by the fol- watermarking method. Literature has proved that the
lowing algorithm: choice of signature insertion coefficients depends on the
insertion domain. In the spatial domain, the Harris Cor-
If (Entropy (father) > Sum_Entropy (sons)) ner Detector, which is based on the local auto-correlation
Keep_sons () function of a signal that measures the local changes of the
Entropy (father) Sum_Entropy (sons) signal with patches shifted by a small amount in different
else directions [26], has been used in the majority of algo-
Select_father () rithms in order to detect the carrier points [2]. In the fre-
level level+1 quency domain, the signature has been integrated within
the coefficients of medium frequencies of discrete Fourier
with: transform [18] or discrete cosine transform [11]. These
function Entropy: calculates the entropic value of a coefficients represent the contour of an image. Also, in the
node multiresolution domain based on the DWT, the signature
function Sum_ Entropy: calculates the sum of entropic has been sometimes added to the sub-bands of approxi-
values of four sons nodes mation [12, 9] and most of the time the sub-bands of de-
procedure Keep_sons: allows to keep the four sons tails [1].
nodes As we are watermarking ancient documents which
procedure Select_father: selects only the father node. admit essentially a text and/or a well-contrasted draw-
ing, we propose inserting the signature into the points
It is well known that the entropy varies proportionally which represent the contours of the image in a sub-band.
to the noise. Since we treat images of ancient documents Indeed, according to [19], there exists a sleek function ω in
which are generally noisy, it will be smarter to insert the such a way that:
signature into the less noisy zones. Consequently, in this 1 ( x, y ) ( x, y ) x , 2 ( x, y ) ( x, y ) y and
paper, we have tried to determine the sub-band of wave-
let packet carrying the signature based on the minimum
(t )dt 0 , where ( x, y) 2 ( x, y )
1
and have one
entropy criterion.
Fig. 3 shows an example of selecting a better entropic
base of an image of ancient documents (fig. 4.a) after de- null moments and a compact support. Wavelet transform
composing them into WPD at level 2. The terminal nodes of f ( x, y ) L2 ( R 2 ) at scale s can be written as a mul-
of the second tree represent the carrier nodes of the signa- tiscale differential operator:
ture (fig. 3.b).
From the experimental results, we can conclude that W21j f ( x, y) f 21j ( x, y)
2 2 j ( f w j )( x, y) (2)
W j f ( x, y) f 2 ( x, y) 2
2 2 j
where 2 j ( x, y ) 2 j ( x, y ), k 1, 2 and denotes
k k
the gradient.
The modulus of this gradient vector is proportional to
the wavelet transform (3).
(a) 2 2
Mf 2 j ( x, y ) W21j f ( x, y ) W22j f ( x, y ) (3)
Then, the local maximum of the wavelet transform
Mf 2i ( x, y ) at point ( xk , yk ) can be calculated by
solving the partial differential at both x and y directions
Mf 2i ( x, y ) 0 [10, 19]. These points of which the
(b)
signature will be inserted are called carrier points.
Fig. 3. Exemple of selecting the entropic best base of wavelet
packets: (a) entropic tree of WPD; (b) Best base of entropic tree. 2.1.4 Coding the Signature
We have exploited an ECC used in data transmission in
our watermarking algorithm to increase the level of ro-
the insertion in sub-bands of low entropy value does not
bustness. The usefulness of an ECC for a watermarking
influence the quality of the watermarked image and of-
algorithm is to insert data in a redundant way. In fact,
fers a remarkable robustness agiant attacks. The results
this redundancy will be exploited in detecting and cor-
are illustrated in Table 1.
recting the erroneous bits in order to reconstruct the in-
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 4, APRIL 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 208
serted data in the detection phase. Many watermarking a decision is calculated by a correlation between the orig-
algorithms of standard and medical image have used dif- inal signature and the decoded one to determine the level
ferent ECC [8, 16, 7, 20]. In general, choosing a coder for a of robustness. We have noticed, after different tests, that
watermarking algorithm is based on experimental heads. the minimal correlation value should be higher than 0.5 to
According to the main experiments conducted on the im- guarantee the existence of the inserted signature. This
ages of ancient documents, it has been shown that the decision is defined by (5).
convolutional code offers the best results at the level of
invisibility and robustness in relation to attacks. In fact, 1 if correlation(S,Soriginal )>0.5
Decision= (5)
this coder has a great capacity of correcting and detecting
the erroneous bits of the inserted signature. 0 if not
In this paper, a convolutional code of memory order m
is supported [17]. For this class of code, each sequence of S : decoded signature, Soriginal : inserted signature
n bits in the encoder output depends not only on the se-
quence of k binary elements present at its input but also
on m sequences which were present previously. Such a 3 EXPERIMENTATIONS AND RESULTS
code is called systematic if the k bits of information In this section, we describe the main experiments con-
present at the input of the encoder are actually issued, ducted and the main results obtained. First, we will
which is to be found intact in the sequence of n binary present the metrics used in evaluating our approach.
elements in the encoder output. The yield on code is de- Then, we will present our different results of our ap-
fined by the ratio k/n with n>k, where C(n, k, m) is the proach developed at the best base stability, invisibility
notation of this code. and robustness to attacks applied on the watermarked
ancient image. Finally, we will make a comparison of our
2.1.5 Inserting the Signature
approach with some watermarking algorithms of stan-
The signature insertion in each node is realized in accor- dard images in order to prove the importance of our con-
dance with (4): tribution for watermarking ancient documents.
X *Wi * sign( Xi ) if Xi is a carrier point
Yi i (4) 3.1 Metrics Evaluation
Xi else In order to evaluate the performance of our approach, we
with Yi : watermarked image packet coefficient have used metrics most known in the field watermarking:
the PSNR (Peak Signal to Noise Ratio) for the evaluation
X i : original packet coefficient of the insertion phase and the correlation for the evalua-
W : watermark tion of the detection phase.
: signature force parameter PSNR
The parameter is a factor of a good compromise be- The PSNR is used to evaluate the watermark invisibility
tween invisibility and better robustness. Indeed, when the after the insertion phase. It is based on the Mean Square
value of is high the robustness increases and invisibili- Error (MSE). It is expressed in decibels and is defined by
ty decreases. Conversely, when is small, the robust- (6).
ness decreases and the invisibility increases. This value 2
X max
will be determined experimentally. PSNR 10 log10 ( )
MSE
2.1.6 Reconstructing the Watermarked Image 255 2 (6)
=10 log10 ( )
After inserting the signature, the image is reconstructed MSE
by an inverse WPT. 1
2.2 Detection Phase
where MSE = ( I m ,n I m' ,n ) 2
M N m ,n
In this phase, the three first steps of insertion scheme are where I(m,n) is the reference image and I'(m, n) is the
used as the starting steps to extract a signature S which watermarked image. The two images are of size M * N.
will thereafter be decoded.
Among the techniques for decoding convolutional Correlation
codes we can mention the sequential, Viterbi and syn-
To evaluate the degree of resistance of a watermarking
drome decodings. In general, decoding in the family code
algorithm, we must to calculate the similarity between the
consists in searching the binary sequence that can be the
original signature and the detected signature. For this, a
most likely received sequence in the trellis or tree coding.
correlation function is used (7). The value of this function
The application of this decoding rule is very complicated
varies between 0 and 1.
when there is a large number of a possible sequence. It is
due to this complexity that we have conceived of search-
ing the most likely sequence using the Viterbi decoding
algorithm [21].
After the extraction phase and the signature decoding,
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 4, APRIL 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 209
S is stable if k as sk S and sk S
'
1 1
Img 1 0.8
0.8
Img 2
Img 1
detection
Img 3 0.6
detection
0.6
Img 2
Img 4
0.4 0.4 Img 3
Img 4
0.2 0.2
0 0
0 50 100 0 50 100
Force parameter Force parameter
a b
(b)
(a)
1
0.8
Img 1
detection
0.6 Img 2
Img 3
0.4
Img 4
0.2
0
0 50 100
Force parameter
(c)
C
Fig. 5. Percentage of the number of detected nodes for several Fig. 7. Experiment results against adding Salt and Pepper noise attack
attacks: (a) 3x3 median filter; (b) 12% Gaussian noise; (c) Salt with density of: (a) 0.002; (b) 0.005; and (c) 0.01.
and Pepper noise with density of 0.01; and (d) JPEG
compression with 20 quality factor.
1 1
80 Img 1
0.8 Img 2 0.8
Img 1
70 Img 1
Img 3 Img 2
detection
0.6
detec tion
Img 2 0.6
Img 4 Img 3
60 Img 3
PSNR
40 0 0
0 20 40 60 80 100 0 20 40 60 80 100
30 Force parameter Force parameter
0 20 40 60 80 100
Force parameter
ab
(b)
(a)
Fig. 6. Evolution of PSNR according to the inserting force of four
Fig. 8. Experiment results against adding Gaussian noise attached of:
images in Fig. 4.
(a) 10 varaiance; and (b) 12 variance.
is a 10% and 12% Gaussian noise. Fig. 7 and Fig. 8 dem- Img 2
onstrate that a new scheme has great robustness to these 0.4
Img 3
Img 4
attacks.
0.2
The median filter is one of the most used steps in the
preprocessing phase of our images that have a very poor 0
0 50 100
quality. Our algorithm shows its robustness against the Force parameter
3x3 median filter for our test images for a value of
1 1 TABLE 1
0.8 Img 1 0.8
COMPARISON OF THE PROPOSED METHOD WITH OTHER METHODS
Img 2 Img 1
detection
detection
0 0
0 50 100 0 50 100
Force parameter Force parameter
(a)
a (b)
b
1 1
0.8 0.8
Img 1
detection
detection
4 CONCLUSION
In this paper, we have proposed an approach for
additive watermarking of images of ancient docu-
ments stemming from the BNT. A specific signature
carrying the BNT initials has been inserted into points
of interest of a better basis for the WPD. To keep the
same quality of the original image and have a better
robustness of the chosen signature, we have deter-
mined the parameters of the transformation into wave-
let packets and exploited the convolutional ECC with
the Viterbi decoding used in coding the signature. Our
approach has proved that the watermark is still robust
under several attacks such as compression, salt and
pepper noise, Gaussian noise, and median filter, and
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 4, APRIL 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 212
Fig. 11. Examples of images of watermarked ancient documents and detected signature of these attacked images with
α = 45.
JOURNAL OF COMPUTING, VOLUME 3, ISSUE 4, APRIL 2011, ISSN 2151-9617
HTTPS://SITES.GOOGLE.COM/SITE/JOURNALOFCOMPUTING/
WWW.JOURNALOFCOMPUTING.ORG 213
[20] A.K. Salwa, N. Elsheimy, A.S. Tolba, F.M. Abdelkader, and M.
Elhindy, “Wavelet Packets-Based Blind Watermarking for Medi-
cal Image Management," The Open Biomed Engineering Journal,
REFERENCES vol. 4, pp. 93–98, Mar. 2010.
[21] A.J. Viterbi, “Error Bounds for Convolutional Codes and an
Asymptotically Optimum Decoding Algorithm," IEEE Trans.
[1] M. Barni, F. Bartolini, V. Cappellini, A. Lippi, and A. Piva, “A Information Theory, vol. 13, no. 2, pp. 260-269, Apr. 1967.
Dwt-based Technique for Spatio-frequency Masking of Digital [22] L. Likforman-Sulem, A. Zahour, and B. Taconet, “Text Line
Signatures," Proc International Society for optical engineering Segmentation of Historical Documents: a Survey," International
(SPIE), Security and Watermarking of Multimedia Contents I Journal on Document Analysis and Recognition, Vol.9, no. 2, pp.
(SWMCI’99), pp. 31-39, 1999. 123-138, Apr. 2007.
[2] P. Bas, J.M. Chassery and B. Macq, “Méthode de Tatouage Fon- [23] A. Kricha, A.G. Lasmar, and N. E. Ben Amara, “Exploration des
dée sur le Contenu," Signal Processing (Traitement du Signal), Ondelettes en Prétraitement des Documents Anciens," Proc. In-
vol. 19, no. 1, pp. 11-18, 2002. ternational Francophone about the Written and the Document.
[3] http://www.bnt.nat.tn. (International Francophone sur l'Ecrit et le Document)
[4] R.V. Schyndel, A. Tirkel, and C. Osborne, “A Digital Dater- (CIFED’06), pp. 157-162, Nov. 2006.
mark,” Proc. IEEE International Conf. Image Processing, pp. 86– [24] N. Saito, “Local Feature Extraction and Its Applications Using a
90, Nov. 1994. Library of Bases," Ph.D dissertation, Dep. of Mathematics, Yale
[5] C. Chemak, J.C. Lapayre, and M.S. Bouhlel, “A New Scheme of Univ., New Haven, 1994.
Image Watermarking Based on 5/3 Wavelet Decomposition and [25] D. Vautrin, X. Artusi, M-F. Lucas, and D. Farina, “ A Novel
Turbo-code," WSEAS Transactions on Biology and Biomedicine, Criterion of Wavelet Packet Best Basis Selection for Signal Clas-
vol. 4, no. 4, pp. 45-52, Apr. 2007. sification With Application to Brain–Computer Interfaces," IEEE
[6] R.R. Coifman, M.V. Wickerhauser, “Entropy Based Algorithms Trans. Biomedical Engineering, vol. 56, no. 11, pp. 2734-2738,
for Best Basis Selection," IEEE Trans. Information Theory, vol. Nov. 2009.
38, no. 2, pp. 713-719, Mar. 1992. [26] C. Harris, M.J. Stephens, “A Combined Corner and Edge Detec-
[7] C.T. Hsieh and Y.K. Wu, “ Digital Image Multiresolution Wa- tor," Proc. Alvey Vision Conference, pp. 147–152, 1988.
termark Based on Human Visual System Using Error Correcting
Code," Tamkang Journal of Science and Engineering, Vol. 4, No. Mohamed Neji Maatouk. is a PhD candidate student at the Depart-
3, pp. 201-208, 2001. ment of Department of Electrical Engineering in National engineering
[8] H. Zhu, W.A. Clarke, and H.C. Ferreira, “Watermarking for School in Sfax, University of Sfax, Tunisia.He received a Computing
JPEG Image Using Error Correction Coding," SAIEE AFRICA diploma from Faculty of Sciences in Monastir, University of Monastir,
Research Journal, vol. 99, no. 4, pp. 98-103, Dec. 2004. Tunisia. He is working as assistant in the Department of Computing
[9] C. Jin, L. Pan, and S. Ting, “A Blind Watermarking Scheme in Faculty of Sciences in Monastir, University of Monastir, Tunisia.
Based on Visual Model for Copyright Security," Proc. Multime- His research interests are in the areas of image processing (water-
dia Content Analysis and Mining (MCAM’07), pp. 454–463, marking).
Jun. 2007.
[10] A. Kricha, S. Brini, and N.E. Ben Amara, “Contribution au Ta- Anis Kricha. is a PhD candidate student at the Department of Elec-
touage Des Documents Anciens," Proc. Electrotechnic and Au- trical Engineering in National engineering School in Tunis, University
tomatic Tunisian Days (Journées Tunisiennes de l'Electrotechni- El Manar, Tunisia. He received an Electrical Engineer diploma from
que et Automatique (JTEA’08)), May. 2008. National engineering School in Tunis, University El Manar, Tunisia.
[11] M. Lee, M. Horng, and B. Chang, “A DC-based Approach to Ro- He is working as assistant in the Department of Electrical Engineer-
bust Watermarking with Hamming-Code," Proc. International ing in National engineering School in Monastir, University of Monas-
Conf. Intelligent Information Hiding and Multimedia Signal tir, Tunisia. His research interests are in the areas of image
Processing (IIHMSP’07), vol. 2, pp. 369–372, Nov. 2007. processing.
[12] C. Lin, J. Pan, and B. Liao, “Parity Modulation Based Water-
Najoua Essoukri Ben Amara. received the B.Sc., M.S., Ph.D. and
marking Resisting to Cropping," Proc. Innovative Computing,
HDR degrees in Electrical Engineering, Signal Processing, System
Information and Control, (ICICIC’07), pp. 294, Sep. 2007.
Analysis and Pattern Recognition from the National School of Engi-
[13] M.N. Maatouk, O. Jedidi, and N.E. Ben Amara, “Watermarking neers of Tunis, University El Manar, Tunisia, in 1985, 1986, 1999,
Ancient Documents Based on Wavelet Packets," Proc. Interna- 2004 respectively. From 1985 to 1989, she was a researcher at the
tional Society for optical engineering (SPIE) Conf. Document Regional Institute of Informatics Sciences and Telecommunications,
Recognition and Retrieval XVI (DRR), pp. 7238-7247, Jan. 2009, Tunis, Tunisia. In September 1989, she joined the Electrical Engi-
doi:10.1117/12807790. neering Department of the National School of Engineers of Monastir,
[14] J.L. Vehel, A. Manoury, “Wavelet Packet Based Digital Water- University of Monastir, Tunisia, as an assistant professor. She be-
marking," Proc. IEEE. International Conf. Pattern Recognition, comes a senior lecturer in July 2004 and a Professor in October
(ICPR'00), vol. 3, pp. 413-416, 2000. 2009 in Electrical Engineering at the National School of Engineers of
[15] Y. Meyer, R.R. Coifman, and M.V. Wikerhauser, “Wavelet Sousse-ENISo, University of Sousse, Tunisia. Since July 2008, she
Analysis and Signal Processing," Proc. wavelets and their Appli- is the Director of the ENISo. Her research interests include mainly
cations, Boston, pp. 153–178, 1992. pattern recognition applied to Arabic documents, ancient image
[16] J.K. Joseph, T. Pun, “Rotation Scale and Translation Invariant processing, compression, watermarking, segmentation, biometric
Spread Spectrum Digital Image Watermarking, Signal and the use of stochastic models and hybrid approaches in the
Processing," vol. 66, no.3, pp. 303-317, May. 1998. above domains.
[17] R. Johannesson, K.S. Zigangirov, “Fundamentals of Convolu-
tional Coding," IEEE Trans. Information Theory, vol. 46, no. 3,
pp. 1178-1179, May. 2000.
[18] R. Ridzon, D. Levicky, “Robust Digital Watermarking Bbased on
the Log-polar Mapping," Radio engineering, vol. 16, no. 4, pp.
78-81, 2007.
[19] T. Luo, G. Xing, and L. Shi, “Mutual Information Based Water-
marking Detection in Wavelet Domain for Copyright Protec-
tion," Proc. IEEE Asia-Pacific Trusted Infrastructure Technolo-
gies Conference (APTC’08), pp. 113-119, Oct. 2008.