Int. J. Electron. Commun.

(AE) 70 (2016) 10551061

Contents lists available at ScienceDirect

International Journal of Electronics and

Communications (AE)
journal homepage: www.elsevier.com/locate/aeue

Regular Paper

A reversible image authentication scheme based on fragile

watermarking in discrete wavelet transform domain
Thai-Son Nguyen a, Chin-Chen Chang b,, Xiao-Qian Yang c
a

School of Engineering and Technology, Tra Vinh University, Tra Vinh Province, Viet Nam
Department of Information Engineering and Computer Science, Feng Chia University, Taichung 40724, Taiwan, ROC
c
Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi, Taiwan, ROC
b

a r t i c l e

i n f o

Article history:
Received 16 July 2015
Accepted 2 May 2016

Keywords:
High quality
Image authentication
Reversibility
Tamper detection
Watermarking

a b s t r a c t
Image authentication technique protects the integrity of images. Many image authentication schemes
have been proposed in recent years. However, in these schemes, the image is permanently distorted
and cannot be recovered to its original version after image authentication. In this paper, we propose a
new, reversible watermarking scheme for image authentication scheme in the DWT domain to achieve
high accuracy of tamper detection, and complete reversibility while maintaining high image quality of
watermarked images. In the proposed scheme, authentication code is randomly generated and embedded
into 2nd DWT low-frequency subbands of each image block. Our experimental results demonstrated that
the proposed scheme has ability to resist against different attacks, i.e., different sizes of tampered regions,
content tampered attack, and collage attack, with small distortion of the watermarked image. In addition,
the proposed scheme achieves reversibility that is quite important to some special fields, i.e., medical
images, military images, and fine artwork.
2016 Elsevier GmbH. All rights reserved.

1. Introduction
With the rapid development of multimedia and digital image
processing technologies, a variety of processes, i.e., copying, editing, and digital contents processing, have been used extensively.
This means that the integrity of images can be easily infringed.
For example, the content of the image can be altered illegally
and tampered maliciously during storing or transmitting over the
Internet. Therefore, the protection of such content has become a
very essential issue that attracts a great deal of attention in both
academia and industry [13]. Watermarking is the most popular
technique to protect the integrity and authenticity of the image
[4]. Depending on various applications, watermarking can be partitioned into three various categories, i.e., robust, semi-fragile,
and fragile watermarking. The first category, robust watermarking
[5,6], is used to counteract intentional and unintentional modifications, while the second one, semi-fragile watermarking [711], is
able to resist unintentional manipulations done by some common
image processing operations. The third category, fragile watermarking [1222], is sensitive to modifications and used to counter-

Corresponding author. Tel.: +886 4 24517250x3790; fax: +886 4 27066495.

E-mail addresses: thaison@tvu.edu.vn (T.-S. Nguyen), ccc@cs.ccu.edu.tw,
alan3c@gmail.com (C.-C. Chang), tiffany61706@yahoo.com.tw (X.-Q. Yang).
http://dx.doi.org/10.1016/j.aeue.2016.05.003
1434-8411/ 2016 Elsevier GmbH. All rights reserved.

feit intentional malicious attacks. Some crucial applications of the

first category are copyright protection and fingerprinting, whereas,
important applications of two other ones are image authentication
and tamper detection.
Most of image authentication algorithms [723] can be performed in the spatial and the transform domains for detecting tamper regions in watermarked images. In the spatial domain, the
watermark is concealed into the host image by directly altering a
group of selected pixels without significant distortion. In the transform domain, i.e., vector quantization (VQ), block truncation coding (BTC), discrete cosines transform (DCT), and discrete wavelet
transform (DWT), the transformed coefficients of the host image
are modified to embed the watermark.
In recent years, many image authentication schemes have been
proposed to protect the integrity of the images content and to verify its trustworthiness. In 2001, Wong and Memon [12] proposed a
fragile watermarking scheme based on both secret and public key
for image authentication to protect the ownership. In 2006, Maeno
et al. [13] proposed two semi-fragile watermarking schemes to
increase accuracy of detection and to achieve robustness against
the lossy compression. However, these schemes only focused on
the JPEG compression, and no analysis on other attacks. In 2008,
Lee and Lin [14] proposed an image authentication and recovery,
based on dual watermarking. Later on, Chan [15] introduced a

1056

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

new image authentication scheme in 2011. The scheme was based

on Hamming code to rearrange the bits of pixels and use the mostsignificant bits of the pixel to determine whether the pixel was
tampered. In the same year, Chuang and Hu [16] proposed an
adaptive image authentication on VQ-compressed images. By
using PRNG with a secret key, the scheme generated the authentication codes that are embedded into VQ indices. In 2013, to
achieve good image quality of watermarked images, Preda [10]
proposed a novel image authentication in the DWT domain. In this
scheme, the watermark bit was embedded into the set of selected
coefficients using mean quantization. Also based on DWT domain,
Al-Otum [11] implemented a modified DWT quantization-based
technique for authenticating watermarked images. The scheme
achieved high accuracy in detecting tampered regions. However,
the image quality obtained by this scheme was less than that of
Predas scheme.
From the literature, it is observed that the accuracy of tamper
detection in some of the image authentication schemes [14,16
18] was low while some other schemes [1011,15,23] provided
large distortion of watermarked images. In addition, most of these
schemes were irreversible, meaning that the host image was permanently distorted and cannot be recovered to its original version.
However, some special fields [2427], i.e., medical images, military
images, or fine artwork, require the restoration of original host
images. This means that irreversible image authentication schemes
are not suitable to apply for protecting the integrity in such fields.
In this work, we proposed a new, reversible watermarking scheme
for image authentication in the DWT domain, to achieve high accuracy of tamper detection and reversibility while maintaining high
image quality. In the proposed scheme, the authentication code
is randomly generated and embedded into the 2nd DWT lowfrequency subbands of each image block. Experimental result
demonstrated that the proposed scheme has ability to resist
against different attacks, i.e., different sizes of tampered regions,
content tampered, and collage attacks while maintaining excellent
image quality. In addition, if non modifications are found in watermarked images, their original version can be reconstructed
precisely.
The rest of this paper is organized as follows. Section 2
describes the proposed reversible watermarking scheme in detail.
Section 3 summarizes the experimental results and illustrates the
performance of the proposed scheme. Finally, we present our conclusions in Section 4.

bit into each block, three different watermark bits are embedded
in each block to increase the accuracy of the localization capacity,
it means that any modifications implemented in the image block
will determined correctly. Fig. 1 shows main processes of the proposed watermark embedding phase.
In DWT algorithm, using low and intermediate frequencies for
watermark embedding provides weak robust watermarking. However, this property is considered as an advantage for image authentication by embedding watermark into 2nd level DWT lowfrequency subbands of the image. After image blocks are transformed by the 2nd level DWT algorithm, low-frequency subbands
of LL1, LH1, and HL1 (marked as Red color in Fig. 2) are obtained
and selected for carrying watermark bits.
The watermark embedding algorithm consists of six steps,
which are described as following.
Input: A grayscale host image H, a secret key K.
Output: A watermarked image.
Step 1: The host image H is partitioned into non-overlapping
blocks Bm,n(i, j) for i = 1, 2,   , 8 and j = 1, 2,   , 8, it means that each
block has 8
8 pixels. The watermark W in binary form is randomly generated from the secret key K, which is then used as the
authentication code, and the length of W is similar to the number
of DWT blocks.
Step 2: The received Bm,n blocks are transformed by DWT algorithm to generate transformed coefficients TBm,n. Then, three subblocks LL, LH, HL of each TBm,n are continually transformed by
2nd level DWT by Eq. (1).

2. The proposed scheme

subband Dsb
m;n for embedding watermark bit using Eq. (2).

The proposed scheme is divided into two main phases, i.e.,

watermark embedding phase and watermark extraction and image
authentication phase, which will be discussed in two following
Subsections 2.1 and 2.2, respectively.
2.1. Watermark embedding phase
In the proposed scheme, some following assumptions were
adopted. The host image is divided into non-overlapping 8
8
blocks, and will be further transformed by DWT algorithm. Instead
of the use of the 16
16 size, the used 8
8 size is adopted to
increase localization capacity for determining small tampered area.
The proposed scheme will embed the authentication bit into the
2nd DWT low-frequency subbands with the size of 2
2. Therefore, when using a 8
8 block size, the proposed scheme has ability to detect tampered area with the size of 8
8 pixels. However,
in the case of using 16
16, the localization capacity enable the
scheme to process only the tampered area with the size of
16
16 pixels. In addition, instead of embedding one watermark

Dsb
m;n i; j DWTTBm;n i; j

where (i, j) is the corresponding spatial location in the 2nd level

DWT, and sb is used to indicate the corresponding subbands, i.e.,
LL2, LLLH1, LLHL1, shown in Fig. 2. Then, three coefficient subbands
LLLH1
LLHL1
{DLL2
m;n , Dm;n , Dm;n }, are used to embed the watermark bits. Obviously, three coefficient subbands are the same size of 2
2. Fig. 3
shows the general illustration of three coefficient subbands. Therefore, the embedding processes of three coefficient subbands are
LL2
LLLH1
LLHL1
similar. To better explain, let Dsb
m;n be Dm;n , Dm;n , and Dm;n .
Step 3: Read two coefficients U and B from each coefficient sub-

band Dsb
m;n . In this work, we only use two coefficients, U and B, for
image authentication by embedding watermark bits to achieve
the robustness against incidental modifications and to identify
the tampered localization.
Step 4: Determine the selected coefficient X in the coefficient

X

U;

if

U>B

B;

if

U6B

After coefficient selection, the average value Avg of the coefficient subband Dsb
m;n is calculated according to three unselected coefficients. Then, compute the absolute distance value F between the
selected coefficient X and the average value Avg, and decompose it
into two portions, I and D as below.

F jAv g  Xj I  D

where I and D are the integer value and the fraction value of F,
respectively. It is noted that, before embedding watermark bit, the
order of digits in D is inverted to the value D0 as D0 = Invert(D),
where Invert() means the inverse function. We also remarked that
if the number of digits after the decimal point of F is smaller five,
these digits are used as the value of D. Otherwise, the fraction value
of F is rounded to five decimal places after the decimal point that is
used as the value of D in the proposed scheme. For example,
F = 373.67, the value of D will be 67. Thus, the inverted value

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

1057

Fig. 1. Flowchart of the watermark embedding phase.

Fig. 2. DWT implemented decomposition.

Fig. 3. General illustration of three coefficient subbands.

D0 = Invert(D) = Invert(67) = 76. The watermark bit w is embedded

into F by modifying the value D0 using Eq. (4).

D00 invertD0
2 w

Then, combine of the integer portion I and the watermarked

fractional portion D00 to construct the watermarked distance value
F0 as F0 = ID00 .
Step 5: Calculate the value of watermarked coefficient X0 using
the following equation.

8
Av g F 0 ; If X P 0 and Av g P 0
>
>
>
>
0
>
>
< Av g  F ; If X P 0 and Av g < 0
0
X Av g F 0 ; If X < 0 and Av g P 0
>
>
>
> Av g  F 0 ; If X < 0; Av g < 0 and Av g P X
>
>
:
Av g F 0 ; If X < 0; Av g < 0 and Av g < X

After updating the watermarked coefficient X0 into the coefficient subband Dsb
m;n , utilize 2nd level IDWT to generate the watermarked block B0 m,n.
Step 6: Steps 1 to 5 are repeatedly performed until the entire
image blocks have been processed completely.
To clarify our watermark embedding phase, an example is given
in Fig. 4. Assume that the original coefficient subband Dsb
m;n is
shown in Fig. 4(a) and the watermark bit w = 1 is embedded into
Dsb
m;n to generate the watermarked coefficient subband as shown
in Fig. 4(b). It can be seen in Fig. 4(a), U = 3027, and B = 2463, thus,
X = 3027 is calculated according to Eq. (2). The average value Avg is
then calculated as Av g 259724632885
2648:33, then, the abso3
lute distance value F is calculated as F jAv g  Xj
j2648:33  3027j 378:67. Since I and D are the integer portion
and the fractional portion of F, respectively, so I = 378 and D = 67.
After that, the order of digits in D is inverted to D0 = Invert(D)
= Invert(67) = 76. Eq. (4) is used to embed the watermark bit
to
generate
D00 invert76
2 1
w=1
into
D0
0
00
invert153 351. Therefore, F = ID = 378.351.

Fig. 4. Example of original coefficient subband Dsb

m;n and the watermarked coefficient subband.

After obtaining the value of F0 , according to Case 1 of Step 5, the

watermarked coefficient X0 is determined as X0 = 2648.33
+ 378.351 = 3026.681. Fig. 4(b) shows the result of the watermarked coefficient subband after finishing the embedding process.
2.2. Watermark extraction and image authentication phase
Once a published image is suspected to be modified, the watermark extraction and image authentication algorithm is used to
authenticate whether any modifications are performed in watermarked images or not. Fig. 5 shows the flowchart of the proposed
watermark extraction and image authentication phase.
The watermark extraction and image authentication algorithm
can be divided into seven steps, in which three first steps are same
as done in the watermark embedding phase. The details of watermark extraction and image authentication algorithm are shown as
followings.
Input: The watermarked image H and the secret key K.
Output: The detected image and the reconstructed image.
Step 1: The host image H0 is divided into non-overlapping 8
8
blocks Bm,n(i, j). The watermark W is randomly generated using the
secret key K.
Step 2: The received blocks Bm,n are transformed by DWT algorithm to generate transformed coefficients. Then, three sub-blocks
LL, LH, HL of each TBm,n are continually transformed using 2nd level
DWT defined in Eq. (1) to generate the subband
LL2
LLLH1
LLHL1
Dsb
m;n fDm;n ; Dm;n ; Dm;n g.

Step 3: For each coefficient subband, Dsb

m;n read two coefficients
U and B.
Step 4: Determine the watermarked coefficient X0 in the coefficient subband Dsb
m;n that is currently carried one watermark bit
using Eq. (2).
After selecting X0 , according to three remaining coefficients, the
average value Avg of the coefficient subband Dsb
m;n is calculated.
Then, compute the absolute distance value F0 as below.

1058

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

Fig. 5. Flowchart of the watermark extraction and image authentication phase.

(a) Case 1

(b) Case 2

(c) Case 3

(d) Case 4

Fig. 6. Four cases of the refinement process.

Table 1
Comparison of visual quality between obtained images and the original host image.
Images
PSNR

Airplane

Lena

Peppers

Watermarked image
Reconstructed image

83.54 dB
Infinite

83.52 dB
Infinite

83.58 dB
Infinite

Images

Airplane

Lena

Peppers

(a)

(b)

(c)

(d) 83.54 dB

(e) 83.52 dB

(f) 83.58 dB

Original

Watermarked
and PNSRs

Fig. 7. Watermarks invisibility.

1059

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

Size of tampered
region

Small

Median

Large

(a)

(b)

(c)

(d)

(e)

(f)

Watermarked
images

Tampered
images

Fig. 8. Watermarked and tampered images with different sizes of tampered regions.

Size of tampered
region

Small

Median

Large

( a)

(b )

( c)

(d )

( e)

(f)

Binary version of
raw detected
images

Binary version
refined detected
images

Fig. 9. Detection results with different sizes of tampering.

F 0 jAv g  Xj I  D00
00

6
0

where I and D are the integer value and the fraction value of F ,
respectively.
To extract the watermark bit w0 from F0 , the inverted value D0 is
calculated as D0 = Invert(D00 ). Then, the watermark bit w is
extracted, and the original fractional portion D is reconstructed
by Eqs. (7) and (8), respectively:

w0 D0 mod 2

D invertD0  w=2

According to the value of D, the original distance value F is

determined as F = ID. Then, reconstruct the original coefficient X
using the following equation.

8
Av g F; If X 0 P 0 and Av g P 0
>
>
>
>
0
>
>
< Av g  F; If X P 0 and Av g < 0
X Av g F; If X 0 < 0 and Av g P 0
>
>
>
Av g  F; If X 0 < 0; Av g < 0 and Av g P X 0
>
>
>
:
Av g F; If X 0 < 0; Av g < 0 and Av g < X 0

Step 5: To authenticate whether the current block is tampered,

we read w from the watermark W. If w0 = w, the current block is
indicated as a valid block, this result means that no any modification are made in the block; otherwise, the block is represented as
an invalid block or a tampered block.
Step 6: Steps 2 to 5 are repeatedly processed until the entire
blocks of the watermarked image have been authenticated completely. The raw detected image is constructed by combining all
the valid blocks with invalid blocks generated in Step 5.
Step 7: If none tampered blocks are determined, the original
host image H can be reconstructed by using 2nd level IDWT. Otherwise, the raw detected image should be further processed by using
refinement process to increase the accuracy of detected images.
Specifically, the refinement process is implemented iteratively on
the raw detected image. For each round, each white block is
checked to determine whether the color of the block is changed
to black or not. Fig. 6 shows four test cases that were implemented
sequentially, where B is the current white block to be checked.
Take Case 1 shown in Fig. 6(a) as an example. In this case, if
upper-left and lower-right adjacent blocks of B are black, then
the color of B will be marked as black. After all white blocks in

1060

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

To estimate the image quality, the peak signal-to-noise ratio

(PSNR) was used and it was calculated in Eq. (8):

PSNR 10log10

(a) Watermark image

2552
PM
1=M i1 Hi  H0i

10

where M is the size of the original image, and Hi and H0 i are the pixel
values before and after embedding the watermark, respectively.
Table 1 shows the comparison of the image quality between the
watermarked image or the reconstructed image and the original
host image. Obviously, the proposed scheme guarantees that if none
of modification is performed in the host image that can be reconstructed to its original version correctly. Fig. 7 shows that, three
images before and after the watermark was embedded. As can be
seen in Fig. 7, the proposed scheme made the watermark invisible
when the values of PSNR is greater than 83 dB for different images.

(b) Tampered image

3.1. Performance with different sizes of tampered region

(c) Binary version of raw

detected image

(d) Binary version of

refined detected image

Fig. 10. Content tampered attack of the proposed scheme.

the raw detected image were examined completely; the refined

detected image is obtained.

3. Experimental results
In this section, extensive experiments were conducted to
demonstrate the performance of the proposed scheme. Four
512
512 images, including Airplane, Lena, Peppers, and Barbara,
were used in the experiment. The proposed technique is evaluated
in terms of image quality and tamper detection under different
attacks, i.e., different sizes of tampered region, content tampered
and collage attacks.

Fig. 8 shows the performance of the proposed scheme with

three different sizes of tampered region, which are described as
follows.
 Small tampered region: As shown in Fig. 8(d), the tampered
region in the watermarked image has been altered with the size
of 2361 pixels, which is around 0.9% of the watermarked image.
 Median tampered region: Fig. 8(e) shows the median tampered
region in the watermarked image. Here, 18522 pixels have been
modified, and the size is around 7.1% of the watermarked
image.
 Large tampered region: The large region sized of 336
350 pixels has been tampered in the watermarked image as shown in
Fig. 8(f).This size is larger than 44% of the watermarked image.
Fig. 9 shows the corresponding detection results of tampered
images in Fig. 8. Fig 9(ac) present three raw detected images
obtained by the proposed scheme before using refinement process.
It is clear that the entire blocks in tampered images were localized,
except for large tampered size, where some tampered blocks were
falsely detected. Fig. 9(df) show the refined detected image of the

(a) Watermarked image

Barbara

(b) Watermarked image

Lena

(c) Collaged image

(d) Binary representation of

collaged object

(e) Binary version of raw

detected image

(f) Binary version of refined

detected image

Fig. 11. Collage attack of the proposed scheme.

T.-S. Nguyen et al. / Int. J. Electron. Commun. (AE) 70 (2016) 10551061

Table 2
Performance comparison of the proposed scheme with previous image authentication
schemes.
Schemes

Block
size

Average PSNR
of watermarked
image

Reversibility

The number
of skipped
blocks for
embedding

Nguyen et al. [18]

Hu et al. [20]
Lo and Hu [23]
Proposed

4
4
4
4
4
4
8
8

40.58 dB
38.87 dB
51.62 dB
83.54 dB

No
No
Yes
Yes

0
0
6493
0

1061

DWT domain. In the proposed scheme, the authentication code is

randomly generated and embedded into the 2nd DWT lowfrequency subbands of each image block. Experimental results
demonstrated that the proposed scheme has ability to resist
against different attacks, i.e., different sizes of tampering, content
tampered attack, and collage attack. In addition, the proposed
scheme achieves the invisibility of the watermark.
However, the proposed scheme cannot be directly used to
authenticate color images. In future research, more efforts will be
concentrated on addressing this issue.
References

proposed scheme based on refinement process. Compared the

refined results with those before refining, detection results of the
proposed scheme were improved significantly for large tampered
region.
3.2. Content tampered attack
In this attack, attacker intentionally alters a certain region in the
watermarked image but keeps LSBs of the watermarked image
unchanged. Fig. 10(a) shows the watermarked image, Lena. Then,
an image editing software, such as Adobe Photoshop CS2, was used
to generate a pre-tampered image by pasting a flower on the hat.
To obtain the tampered image, LSBs of the pre-tampered image
were substituted by those of the watermarked image. Fig. 10(c
d) show detected results before and after refining. Definitely, the
proposed scheme has ability to resist the content tampered attack.
3.3. Collage attack
In this experiment, two watermarked images, Barbara, and
Lena, as shown in Fig. 11(ab) were used. Then, Barbaras face
was replaced by Lenas face; while unchanging all other regions
of the watermarked image Barbara. Fig. 11(c) presents the tampered image after attacking. Fig. 11(d) is the binary representation
of Lenas face. Fig 11(ef) show the results of detected images
obtained by our proposed scheme before and after refining, respectively. These results mean that the proposed scheme achieved high
accuracy of tamper detection under the collage attack.
3.4. Comparisons with image authentication schemes
To demonstrate the superiority of the proposed scheme, we
compared the proposed scheme to three previous image authentication schemes [18,20,23]. Table 2 shows that the proposed
scheme and the scheme in [23] both have ability to reconstruct
the original image losslessly. However, the average PSNR obtained
by the proposed scheme is dramatically higher than that of the
scheme in [23]. In addition, the large number of image blocks is
skipped from embedding authentication code in [23]. The major
reason is that their scheme used the histogram-shifting algorithm
for embedding authentication code. This means that the more of
authentication bits is embedded, the more of pixels are modified
by shifting. In contrast, by embedding authentication code into
2nd level DWT low-frequency subbands of each image block, the
proposed scheme maintained high image quality of watermarked
images. Moreover, by doing so, the authentication bits are spread
over the entire of the cover image.
4. Conclusions
This paper proposed a new, reversible watermarking scheme to
accurately authenticate tampered regions in watermarked images.
The watermark embedding and extracting are performed in the

[1] Luo L, Chen Z, Chen M, Zeng X, Xiong Z. Reversible image watermarking using
interpolation technique. IEEE Trans Inf Forensics Secur 2011;5(1):18793.
[2] Lin PY, Lee JS, Chang CC. Dual digital watermarking for internet media based on
hybrid strategies. IEEE Trans Circuits Syst Video Technol 2009;19(8):116971.
[3] Swaminathan A, Mao YN, Wu M. Robust and secure image hashing. IEEE Trans
Inf Forensics Secur 2006;1(2):21530.
[4] Zhu BB, Swanson MD, Tewfik AH. When seeing isnt believing. IEEE Signal
Process Mag 2004;3:409.
[5] Minamoti T, Ohura R. A blind digital image watermarking method based on the
dyadic wavelet transform and interval arithmetic. Appl Math Comput
2014;236:30619.
[6] Yeo DG, Lee HY, Kim BM. High capacity reversible watermarking using
differential histogram shifting and predicted error compensation. J Electron
Imaging 2011;20(1):013001.
[7] Qi X, Xin X. A quantization-based semi-fragile watermarking scheme for image
content authentication. J Visual Commun Image Represent 2011;22
(2):187200.
[8] Zhang W, Frank YS. Semi-fragile spatial watermarking based on local binary
pattern operators. Opt Commun 2011;284(1617):390412.
[9] Zhu X, Ho ATS, Marziliano P. A new semi-fragile image watermarking with
robust tampering restoration using irregular sampling. Signal Process Image
Commun 2007;22(5):51528.
[10] Preda RO. Semi-fragile watermarking for image authentication with sensitive
tamper localization in the wavelet domain. Measurement 2013;46(1):36773.
[11] Al-Otum HM. Semi-fragile watermarking for grayscale image authentication
and tamper detection based on an adjusted expanded-bit multiscale
quantization-based technique. J Visual Commun Image Represent 2014;25
(5):106481.
[12] Wong PW, Memon N. Secret and public key image watermarking schemes for
image authentication and ownership verification. IEEE Trans Image Process
2001;10(10):1593601.
[13] Maeno K, Sun Q, Suto M. New semi-fragile image authentication watermarking
techniques using random bias and nonuniform quantization. IEEE Trans
Multimedia 2006;8(1):3245.
[14] Lee TY, Lin SFD. Dual watermark for image tamper detection and recovery.
Pattern Recognit 2008;41(11):3497506.
[15] Chan CS. An image authentication method by applying Hamming code on
rearranged bits. Pattern Recognit Lett 2011;32(14):167990.
[16] Chuang JC, Hu YC. An adaptive image authentication scheme for vector
quantization compressed image. J Visual Commun Image Represent 2011;22
(5):4409.
[17] Zhang XP, Wang SZ. Statistical fragile watermarking capable of locating
individual tampered pixels. IEEE Signal Process Lett 2007;14(10):72730.
[18] Nguyen TS, Chang CC, Chung TF. A tamper-detection scheme for BTCcompressed images with high-quality images. KSII Trans Internet Inf Syst
2014;8(6):200521.
[19] Hu YC, Chen WL, Lo CC, Wu CM. A novel tamper detection scheme for BTC
compressed images. Opto-Electron Rev 2013;21(1):13746.
[20] Hu YC, Lo CC, Chen WL, Wen CH. Joint image coding and image authentication
based on absolute moment block truncation coding. J Electron Image 2013;22
(1):112.
[21] Qin C, Chang CC, Chen KN. Adaptive self-recovery for tampered images based
on VQ indexing and inpainting. Signal Process 2013;93:93346.
[22] Zhang X, Qian Z, Ren Y, Feng G. Watermarking with flexible self-recovery
quality based on compressive sensing and compositive reconstruction. IEEE
Trans Inf Forensics Secur 2011;6(4):122332.
[23] Lo CC, Hu YC. A novel reversible image authentication scheme for digital
images. Signal Process 2014;98:17485.
[24] Tian J. Reversible data embedding using different expansion. IEEE Trans
Circuits Syst Video Technol 2003;13(8):8906.
[25] Chang CC, Nguyen TS, Lin CC. A reversible compression code hiding using SOC
and SMVQ indices. Inf Sci 2015;300:8599.
[26] Ni Z, Shi YQ, Ansari N, Su W. Reversible data hiding. IEEE Trans Circuits Syst
Video Technol 2006;16(3):35462.
[27] Caoa F, Huanga HK, Zhoub XQ. Medical image security in a HIPAA mandated
PACS environment. 4650 Sunset Boulevard Mailstop 81,Los Angeles, CA 90027,
USA: Department of Radiology, Childrens Hospital of Los Angeles, University of
Southern California; 2002.