TELKOMNIKA Telecommunication Computing Electronics and Control

Vol. 99, No. 1, Month 2099, pp. 1~1x

ISSN: 1693-6930, DOI: 10.12928/TELKOMNIKA.v99i1.paperID  1

Zigzag-LSB: A Fragile Watermarking Scheme for Text Images

Authentication System

‘Aqilah Abd. Ghani1, Syifak Izhar Hisham1, Nur Alya Afikah Usop1 , Nasrul Hadi Johari2
1
Faculty of Computing, University Malaysia Pahang, Pahang, Malaysia
2
Faculty of Mechanical and Automotive Engineering Technology, University Malaysia Pahang, Pahang, Malaysia

Article Info ABSTRACT

Article history: Hackers attacks any system from a numbering pattern used by developers
which is most of the patterns implemented was basic raster pattern. Raster
Received month dd, yyyy patterns have low security due to its too simple route. Thus, to ensure the
Revised month dd, yyyy security of system is at the top, other numbering pattern need to use rather
Accepted month dd, yyyy than basic raster pattern. This paper proposed a fragile watermarking scheme
for text image authentication system. The proposed scheme is Zigzag-LSB,
using Zigzag SCAN pattern for image numbering and mapping before
Keywords: watermark embedding with Least Significant Bits (LSB) approach. For
authentication purpose, the usage of numbering pattern also helps to embed
Zigzag SCAN the watermark bits far from original image bits. This watermark bits consists
Fragile Watermarking of 3-tuple watermark which are average intensity, parity check bit, and
Text Image recovery bit. The 2-level detection also implemented at the detection and
Authentication localization phase for better result of tampered area detection. The first
Detection objective of the research is to develop an efficient digital watermarking
scheme in term of computational complexity. Hence, Zigzag-LSB results to
a fast-processing time of the system with the average of 36.8 second and
26.9 second for both PNG and BMP text image format in watermark
embedding phase. While, in others authentication phases, the longest
processing time is only 61.5 second, which is still fast. The quality of
watermarked image is also high in watermark embedding phase, up to an
average of 56 dB for PNG and 61.2 dB for BMP. From the results, it is
proven that Zigzag SCAN pattern can cover all size, dimension, types,
content, and sources of the text images.
This is an open access article under the CC BY-SA license.

Corresponding Author:
‘Aqilah Abd. Ghani
Power Electronics and Renewable Energy Research Laboratory (PEAR-L), University of Malaya
Balai Cerap UTM, Lengkok Suria, 81310 Skudai, Johor, Malaysia
Email: saad@um.edu.my

1. INTRODUCTION
Crimes related to cyber abuse such as cheating, harassment, scam, dispersion of fake news and
private data, attack almost every online user nowadays. This so called ‘complicated cybercrimes’ happen
because of an unfair technology [1]. Hence, the manipulated image is included. Taking a picture of payment
receipt, medical information, registration form, workers agreement and document related due to the
development of smart gadgets. According to [2], anyone can steal private information from the computer
screen by taking a picture without any leaving evidence. Thus, this issue needs a pivotal security such as
image authentication system. To ensure the image is original, free form any attacks, the authentication
process is need.

Journal homepage: http://journal.uad.ac.id/index.php/TELKOMNIKA

2  ISSN: 1693-6930

One of the techniques to implement the authentication process is using digital image watermarking, the act
of embedding secret data to an image for security [3]. As for the authentication purpose, fragile image
watermarking in spatial domain was chosen. As stated by [4], fragile domain watermarking suitable with
authentication demanding because of its characteristic. While, to embed the watermark, an image needs to
have some compression which most of the researchers use the conventional lossless image compression,
raster pattern before watermark embedding. The usage of raster paster causes the redundancy of an image [5]
which can affect the image output. A scheme from [6] implemented the mapping sequence method before
watermark embedding state that the hacking process will become easier when using basic raster pattern.
Thus, to ensure the security of confidential images are at the top, different numbering pattern need to
implement.

Recent strategy related to image watermarking for authentication purpose have detection, localization, and
recovery features [7]. Most of the scheme used block-wise approach for watermark embedding.

2. METHOD
2.1. Research Design
To complete the study in a strategic way, this research consists of three main segmentations, namely
planning and analysis, development and testing, and conclusion. more on improving the algorithm. To
illustrate this, Figure 1 shows the research design.

Figure. 1 Research Design

2.2. Spatial Domain

Digital watermarking has two general techniques which are visible and invisible watermark with
two main domains, spatial and transform [8] [9]. The main feature in transform domain is robustness, while
spatial domain usually known with fragile. As mentioned before, fragile watermarking suit with
authentication purpose because of the private key based feature, which the embedded watermark can stand
with various modifications [10]. Also, it can detect and localize the tampered area of the image itself.

The hierarchal of fragile domain as shown in Figure 2.

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  3

Figure. 2 Digital watermarking hierarchical structure

2.3. Block-based Approach

In fragile image watermarking, the popular method for image mapping and watermark embedding is
block-based approach. Block-based is a part of the image processing method which can help the
authentication process operate in an efficient way. The smaller division of an image, the higher the accuracy
of the tamper detection. The cover image can divide into block and sub-block for the generation of
watermark and detection phases. For example, the cover image is first divided into non-overlapping blocks of
size M × M pixels, which M comes from a multiple of four such as of 2 × 2 pixels, 4 × 4 pixels, and 16 × 16
pixels. As image consist of pixels, an example of 4 × 4 image block produces 16 pixels, one pixel contains 8
bits. One block in the image presented as one number, thus this number act as a mapping sequence for
watermarking embedding. Also, it can detect and localize the tampered area of the image itself.

Figure. 3 Division of image into 4 × 4 block

2.4. Block Intensity

Intensity of each block and sub-block are very useful for tamper localization, detection, and recovery
process. As the scheme used block-wise with self-recovery technique for watermark embedding, the
watermarked block has the block-wise dependency. The block-wise dependency makes the tampered area
hard to localize and detect due to the miss-matches features in each watermarked block [11]. Thus, the block-
wise dependence can be destroyed by the addition of authentication data [12]. One of the simple methods
[12][13] to generate an authentication data is by comparing the sub-block, Cs intensity with block, C
intensity from the cover image. Not only that, the average intensity of block, C also results to a fast-
Paper’s should be the fewest possible that accurately describe … (First Author)
4  ISSN: 1693-6930

processing time of localization phase. While, the intensity of each sub-block, Cs use as recovery watermark.
Watermark bits from the comparison of average intensity of block, AvgC and average intensity of sub-block,
AvgCs denote as v. If AvgC is bigger than AvgCs, v is equal to 0, while if AvgCs is lower than AvgC, v is
equal to 1 as shown in equation below:

0, 𝑖𝑓 𝐴𝑣𝑔𝐶𝑠 < 𝐴𝑣𝑔𝐶

𝑣={
1, 𝑖𝑓 𝐴𝑣𝑔𝐶𝑠 > 𝐴𝑣𝑔𝐶

2.5. Parity Check Bit

Another simple operation for authentication purpose is party check bit as state by [12]. Denote as p, the
watermark bit also useful for detection of tampered block. The value of p is generated from the types of
parity number, which if the parity number is even, p is equal to 0. While, if the parity number is odd, p is
equal to 1 as shown equation below:

0, 𝑖𝑓 𝑡ℎ𝑒 𝑝𝑎𝑟𝑖𝑡𝑦 𝑛𝑢𝑚𝑏𝑒𝑟 𝑖𝑠 𝑒𝑣𝑒𝑛

𝑝= {
1, 𝑖𝑓 𝑡ℎ𝑒 𝑝𝑎𝑟𝑖𝑡𝑦 𝑛𝑢𝑚𝑏𝑒𝑟 𝑖𝑠 𝑜𝑑𝑑

2.6. Least Significant Bit

Same with the block based, Least Significant Bits (LSB) is also the popular and simple method among
fragile watermarking schemes. LSB executes direct technique [14] [15] which is the last bit of the image
sub-block, the rightmost eight bit allocate as the location of watermark bits [13]. As for example, from 16
pixels of 4 × 4 image sub-block, the last bit of each selected pixel will be replaced by the authentication
watermark bits as shown in Figure 4. Thus, any modification on the pixels of watermarked image cannot be
differentiate and results to the high level of imperceptibility. This advantage is very useful for the
authentication purpose.

Figure. 4 Watermark embedding in Least Significant Bits (LSB)

2.7. Zigzag SCAN

Zigzag SCAN is one of the 15 basic SCAN patterns which can be extended or reduced by specific
application and six transformations of SCAN patterns [16]. This pattern was also known as the Zigzag
pattern, which [17] used Zigzag order for embedding and extracting binary watermark generated by a secret
key which 2-D Cartesian pixels was mapped into 1-D position in Zigzag order. Another study of the diagonal
SCAN pattern by [18] mentioned that diagonal sub-scans scanning move constantly from top-left to the

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  5

bottom-right corner inside the transform block of the processed image. In term of image encryption, the
benefits of Zigzag SCAN is it produced good key sequence and strong enough to fight from differential
attacks [19]. Figure 5 illustrated the numbers movement of 4 × 4 image block in the text image sample using
Zigzag SCAN pattern from the workspace of MATLAB software.

Figure. 5 Zigzag numbering SCAN pattern

3. PROPOSED SCHEME
The proposed scheme of Zigzag-LSB adapted from [20] consist of block numbering and mapping,
watermark generation and embedding, tampered detection and localization, and finally the recovery phases.
Each step of those phases is elaborate as below:

1) Block numbering and mapping: This phase as shown in Fig.6 aim to ensure the watermark bits
embed far from the original bits of the cover image. The Zigzag SCAN was chosen as a mapping
sequence to give the simple yet efficient route for image block numbering. As the cover image was
first divided into 8×8, each blocks present as one number which next will follow the forward Zigzag
SCAN with 15 diagonals orientation as in Fig.7. After the numbering place is located, the 3-tuple
watermark is embedded into the LSB of each sub-block. The mapping and embedding process
occur using one dimensional transformation equation as below:

𝑩 = [(k × o) mod 𝑵𝒃 ] + 1

Paper’s should be the fewest possible that accurately describe … (First Author)
6  ISSN: 1693-6930

Figure. 6 Block numbering and mapping of Zigzag-LSB

Figure. 7 Forward Zigzag SCAN with 15 diagonals

2) Watermark generation and embedding: This phase as shown Fig.8 generate the watermark bits
from the block division, C (8 × 8) and sub-block division, Cs (4 × 4) of the cover image. The
watermark bits namely 3-tuple watermark consists of average intensity, v, parity check bit, p, and
recovery bits, r. The average intensity of C (AvgC) and average intensity of Cs (AvgCs) need to
compare before watermark embedding take place. From Cs, the parity bits, p is obtained. While the
recovery bits, r generate from the intensity bit of C after the block mapping process. The steps for
watermark generation are:

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  7

Figure. 8 Watermark generation and embedding of Zigzag-LSB

3) Detection, localization, and recovery: This phase as shown in Fig.9 operate after the
watermarked image was tampered with possible attacks. The two-level detection
implemented to get the best result of detection range and accuracy. For the first level
detection. The average v of the sub-block, Cs (4 × 4) is compared with average v to get the
value of v’ either 1 or 0. The total number of 1s in average Cs (AvgCs) state as Ps. If Ps is
even, p’ equal to 1, otherwise p’ equal to 0. Lastly, to know whether Cs was tampered, p’ is
compare with v’. If both equal, the Cs is marked as valid block. While level-2 detection is
for each valid block of C (8 × 8). The 7-bit intensity from each Cs is obtain by extracting
the Least Significant Bits (LSB) from each pixel of valid block C. Then, one zero is
padding to the end to make an 8-bit value. The valid block C is compared with AvgCs, if
the value is different, the block C mark as tampered. For recovery phase, both tampered
block C and Cs denote as T. First, the block number of recovery bits, R is calculated and
locate. The 7-bit is intensity of each Cs within block T, one zero is padding to the end to
make an 8-bit value which the new intensity of pixels will be created. Finally, the intensity
of each pixel within Cs need to replace with this new intensity to recover back all the
tampered blocks.

Paper’s should be the fewest possible that accurately describe … (First Author)
8  ISSN: 1693-6930

Figure. 9 Tampered image detection and localization of Zigzag-LSB

4. RESULT AND DISCUSSION

4.1. Experimental Setup

The chosen image formats for the experimental process are PNG and BITMAP in grayscale. Table 1
shows the example of selected samples. From the sample below, we can conclude that the text contents are
almost the same for any official organizations or groups. The document types include a logo or watermark,
full text, some special characters, lines or boxes, and figures. From our understanding, this is due to the
format of confidential formal documents establish. Besides, we selected various size and dimension of text
document that comes from different sources such as screenshot image, scanned image, and photo image.
Meanwhile, for the research instrument, we used a worldwide high-performance language software name
MATrix LABoratory (MATLAB) version R2020b first developed by Cleve Moler in 1970’s. This software
suit with our scheme with fast optimization for matrix operations, can combine within any calculation and
graphic plotting [21]. For the text image manipulation, we used Adobe Photoshop CS6 and Paint applications
to attack the watermarked images. While for hardware, we used a suitable Personal Computer, PC along with
high performance graphic card to produce accurate results. As for the measurement, Peak Signal Ratio
(PSNR) is chosen to calculate the watermarked and recovered image quality. PSNR is a common
measurement used among the researchers for image fidelity, which is high PSNR value equal to high image
fidelity [13]. The PSNR formula are as below:

𝑀𝐴𝑋𝑓
𝑃𝑆𝑁𝑅 = 20 log10 ( )
√𝑀𝑆𝐸

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  9

Table 1. The Example of Text Image Sample Type

Type of Sample Size and Source

Document Dimension
Full text Size: 94.1 KB Scanned
Dimension: 522 ×
863

Logo at the top Size: 1250 KB Photo

Dimension: 553 ×
792

Lines and boxes Size: 3010 KB Scanned

Dimension: 553 ×
792

Image and Size: 854 KB Screenshot

figure Dimension: 453 ×
643

Other language Size: 1170 KB Screenshot

Dimension: 640 ×
640

4.2. Transparency
Transparency is one of the characteristics of efficient digital watermarking scheme, which is the quality
of the host images remain the same after watermark embedding [22]. Hence, to know the transparency of the
watermarked image, the comparison between original cover image and its watermarked image need to
validate. From the naked eyes, there are no different between them in term of the image’s interface. The
original content of the host image can be seen clearly after the watermarking process occur. Table 2 shows
the comparison of example PNG and BMP formats between original host image and watermarked image in
different sizes, dimensions, contents, and types of text document.

Paper’s should be the fewest possible that accurately describe … (First Author)
10  ISSN: 1693-6930

Table 2. Original Cover Image and Watermarked Image Example

.
Text Image Watermarked Image
Original Cover Image
Format

PNG

BMP

4.3. Robustness
To know the proposed scheme can detect, locate, and recover the tampered area of the cover image, the
watermarked image needs to manipulate with appropriate attacks. The benchmark study for selected attacks
is come from [23], which is general tampering attack (insertion), collage attack (image splicing and deletion).
Table 3 shows the explanations and examples of each attack mentioned with tampered areas detection. The
tampered area is red in color. Whereas, to prove that the proposed Zigzag-LSB can cover overall size and
dimension of the cover images, the implementation of attacks occurs in three different locations. The
locations are at the top, at the center, and the top. The results show that each location of attacks can be detect
and localize clearly. Table IV shows the example results of tampered area detection. The tampered area red
in color.

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  11

Table 3. Original Cover Image and Detected Image Example

.

Types of Attack Tampered Image Detection Image

General tampering
(Tampered both
image content and
watermark)

Example: Insertion
Attack

Collage attack
(Tampered based on
block-independent)

Example: Image
Splicing Attack

Collage attack
(Tampered based on
block-independent)

Example: Deletion
Attack

Table 4. Attacks For Tampered Detection and Localization

Tampered Area Tampered Image Result

Top Success

Paper’s should be the fewest possible that accurately describe … (First Author)
12  ISSN: 1693-6930

Centre Success

Bottom Success

4.4. Tampered Image Recovery

For the authentication purpose in Zigzag-LSB, recovery phase is needed to restore back the original
cover image after being tampered by various attacks. In this phase, the block numbering from Zigzag SCAN
pattern is using back to determine the recovery bits block. From the results analysis, most of the tampered
areas recovered very nicely without any missed data from the original cover image contents. Figure 10 and
11 shows the example of detection for hybrid attack and recovered image in PNG and BMP.

(a) (b)

Figure. 10 PNG image format: (a) Tampered detection and localization image (b) Recovery image.

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  13

(a) (b)

Figure. 11 BMP image format: (a) Tampered detection and localization image (b) Recovery image .

4.5. Computational Complexity

As stated by [22], an efficient digital watermarking scheme needs to have five characteristics, which are
transparency, robustness, capacity, security, and computational complexity. Therefore, all these
characteristics need to be achieved. The time duration for watermarking algorithm to complete process in real
time applications is definition of computational complexity characteristic. Hence, a relevant processing time
for the proposed Zigzag-LSB is one of the main goals. The experiment results shows that the average
processing time for watermark embedding, detection, and localization phase for both PNG and BMP image
format is quite fast which is below than 60 second. While in the recovery phase, only image splicing attack
for PNG image format result to an average of 61.5 second. To compare between PNG and BMP image
format, the result shows that the processing time of BMP is faster than PNG. Table V and VII shows the
comparison time between both formats with different phases and type of attacks in term of computational
complexity.
Both PNG and BMP text image samples have different size depending on the types, contents, and sources
of the text image. For example, the full text document has bigger size, which logically will result to much
more longer processing time. But there are also some samples have bigger size but results to shorter
processing time because of the text image sources. The different trend between PNG and BMP results of the
watermark embedding processing time are shown in Figure 10 and 11. While Figure 12 and 13 shows the
results in detection and localization phase with different type of attacks for both PNG and BMP. For PNG,
the shortest processing time is from deletion attack (green color dot) while image splicing attack (red color
dot) is for BMP. The longest processing time is from insertion attack (blue color dot), which as we know that
insertion attack is come from outside element that will increase the size of watermarked image.

Paper’s should be the fewest possible that accurately describe … (First Author)
14  ISSN: 1693-6930

Table 5. Average Processing Time for Watermark Embedding and Tampered Detection Phases

Text Image Average Processing Time (s)

Format
Watermark Detection and Localization
Embedding Insertion Image Splicing Deletion
Attack Attack Attack
PNG 36.8 45.8 25.7 51.6

BMP 21.9 33.2 22.7 20.1

Table 6. Average Processing Time for Recovery Phase of Each Attacks

Text Image Average Processing Time (s)

Format
Recovery of Tampered Image
Insertion Image Splicing Deletion
PNG 54.4 61.5 51.9

BMP 18.3 24.7 25.0

Figure. 12 The graph of watermark embedding processing time for PNG image format.

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  15

Figure. 13 The processing time of watermark embedding for PNG image format.

Figure. 14 The processing time of watermark embedding for PNG image format.

Figure. 15 The processing time of detection and localization for BMP image format

Paper’s should be the fewest possible that accurately describe … (First Author)
16  ISSN: 1693-6930

4.6. Peak-to-Signal-Ratio (PSNR) Values

To prove the quality of the watermarked image, both Peak Signal Ratio (PSNR) and Mean Square Error
(MSE) need to measure in watermark embedding and recovery phase. This to ensure the quality of
watermarked and recovered image is at the top and acceptable. In watermark embedding phase, both PNG
and BMP image samples archive the highest PSNR value which is an average of 56.0 dB and 61.2 dB. This
results can consider as the good visual quality of watermarked image because above than 40 dB [24].
Despite in the recovery phase, the PSNR value is quite low for all three attacks: insertion, image splicing, and
deletion. Table VII shows the overall results. While Figure 16 illustrate the comparison of PSNR value in
watermark embedding phase between PNG and BMP samples.

Table 7. Average PSNR Value for Watermark Embedding and Recovery Phase

Text Average PSNR Value (dB)

Image
Format
Watermark Recovery of Tampered Image
Embedding Insertion Image Deletion
Splicing
PNG 56.0 55.1 29.6 23.7
BMP 61.2 17.0 27.5 26.6

Figure. 16 The PSNR value of watermark embedding for PNG and BMP image format.

5. CONCLUSION

This research proves that Zigzag-LSB result to an efficient digital image watermarking scheme especially
in term of computational complexity and transparency. The average processing time of watermark
embedding for both PNG and BMP image format are less than 60 second. While the average processing time
for detection, localization, and recovery phase are also quite fast. The PSNR value for watermarked images is
also high with an average of 56.0 dB for PNG and 61.2 dB for BMP. Hence, the usage of Zigzag SCAN
pattern for image mapping and numbering before watermark embedding is good to authenticate the text
image samples with different size, dimension, contents, and sources. The implementation of 3-tuple
watermark (v,p,r), Least Significant Bit (LSB), and 2-level detection also contribute to the successfully of the

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x
TELKOMNIKA Telecommun Comput El Control  17

proposed scheme for authentication purpose. As Zigzag-LSB is develop for PC-based only, developing a
scheme for mobile application is considered as future work.

ACKNOWLEDGEMENTS (10 PT)

Authors This work is funded by a Ministry of Higher Education RACER grant,
RACER/2019/ICT04/UMP//2(RDU), entitled ‘A New Embedding Algorithm using Hilbert-Peano Pattern in
Enhancing Authentication Systems for Textual Documents’ and PGRS200369 grant of Universiti Malaysia
Pahang.

REFERENCES
[1] H. Aldawood and G. Skinner, “Educating and Raising Awareness on Cyber Security Social Engineering: A Literature
Review,” Proc. 2018 IEEE Int. Conf. Teaching, Assessment, Learn. Eng. TALE 2018, no. December, pp. 62–68, 2019, doi:
10.1109/TALE.2018.8615162.
[2] H. Fang, W. Zhang, H. Zhou, H. Cui, and N. Yu, “Screen-Shooting Resilient Watermarking,” IEEE Trans. Inf. Forensics
Secur., vol. 14, no. 6, pp. 1403–1418, 2019, doi: 10.1109/TIFS.2018.2878541.
[3] S. A. Pinjari and N. N. Patil, “A pixel based fragile watermarking technique using LBP (Local Binary Pattern),” Proc. - Int.
Conf. Glob. Trends Signal Process. Inf. Comput. Commun. ICGTSPICC 2016, pp. 194–196, 2017, doi:
10.1109/ICGTSPICC.2016.7955296.
[4] H. Zhang, C. Wang, and X. Zhou, “Fragile Watermarking Based on LBP for Blind Tamper Detection in Images.pdf.”
Information Procssing System, pp. 385–399, 2017.
[5] T. Ouni, A. Lassoued, and M. Abid, “Adapted scan based lossless image compression,” Commun. Comput. Inf. Sci., vol. 260
CCIS, pp. 82–91, 2011, doi: 10.1007/978-3-642-27183-0_10.
[6] C. C. Chang, Y. H. Fan, and W. L. Tai, “Four-scanning attack on hierarchical digital watermarking method for image tamper
detection and recovery,” Pattern Recognit., vol. 41, no. 2, pp. 654–661, 2008, doi: 10.1016/j.patcog.2007.06.003.
[7] C. Li, F. Yang, and C. Lee, “An efficient . fragile watermarking scheme intended for image authentication and integrity
verification is proposed in this work . To watermark the underlying image , the gray scale of each pixel is adjusted by an
imperceptible quantity according to the c,” pp. 3445–3448.
[8] R. K. Singh, D. K. Shaw, and M. J. Alam, “Experimental Studies of LSB Watermarking with Different Noise,” Procedia
Comput. Sci., vol. 54, pp. 612–620, 2015, doi: 10.1016/j.procs.2015.06.071.
[9] B. S. Rahman, C. Saha, and T. A. Tamal, “Integer Wavelet Transform based Dual Watermarking Technique using Tent Map
and Local Binary Pattern,” vol. 18, no. 3, 2018.
[10] H. Zhang, C. Wang, and X. Zhou, “Fragile watermarking for image authentication using the characteristic of SVD,”
Algorithms, vol. 10, no. 1, 2017, doi: 10.3390/a10010027.
[11] H. He, F. Chen, H. M. Tai, T. Kalker, and J. Zhang, “Performance analysis of a block-neighborhood-based self-recovery
fragile watermarking scheme,” IEEE Trans. Inf. Forensics Secur., vol. 7, no. 1 PART 2, pp. 185–196, 2012, doi:
10.1109/TIFS.2011.2162950.
[12] P. L. Lin, C. K. Hsieh, and P. W. Huang, “A hierarchical digital watermarking method for image tamper detection and
recovery,” Pattern Recognit., vol. 38, no. 12, pp. 2519–2529, 2005, doi: 10.1016/j.patcog.2005.02.007.
[13] S. I. Hisham, “Enhanced Lsb Watermarking Methods Based on Scanning Patterns for Authentication of Medical Images
Syifak Izhar Hisham Faculty of Computer System and,” Phd Thesis, Univ. Malaysia Pahang, 2015.
[14] J. M. Zain, “DIGITAL WATERMARKING IN MEDICAL IMAGES A Thesis Submitted for the Degree of Doctor of
Philosophy,” no. November, 2005.
[15] “Tamper Localization and Recovery Watermarking Schemes for,” no. July, 2011.
[16] S. S. Maniccam and N. G. Bourbakis, “Lossless image compression and encryption using SCAN,” Pattern Recognit., vol. 34,
no. 6, pp. 1229–1245, 2001, doi: 10.1016/S0031-3203(00)00062-5.
[17] C. Li and F. Yang, “One-dimensional neighborhood forming strategy for fragile watermarking,” J. Electron. Imaging, vol. 12,
no. 2, p. 284, 2003, doi: 10.1117/1.1557156.
[18] T. Nguyen, H. Schwarz, H. Kirchhoffer, D. Marpe, and T. Wiegand, “IMPROVED CONTEXT MODELING FOR CODING
QUANTIZED TRANSFORM COEFFICIENTS IN VIDEO COMPRESSION Fraunhofer Institute for Telecommunications
Department of Telecommunication Systems,” pp. 378–381, 2010.
[19] R. Vidhya, M. Brindha, and N. A. Gounden, “Analysis of zig-zag scan based modified feedback convolution algorithm against
differential attacks and its application to image encryption,” Appl. Intell., 2020, doi: 10.1007/s10489-020-01697-1.
[20] S. I. Hisham, J. M. Zain, N. W. Arshad, and S. C. Liew, “HILBERT-LSB-C as authentication system for color medical
images,” 2015 4th Int. Conf. Softw. Eng. Comput. Syst. ICSECS 2015 Virtuous Softw. Solut. Big Data, pp. 15–20, 2015, doi:
10.1109/ICSECS.2015.7333114.
[21] D. Houcque, “Introduction To Matlab for Engineering Students,” no. August, 2005.
[22] A. Dixit and R. Dixit, “A Review on Digital Image Watermarking Techniques,” Int. J. Image, Graph. Signal Process., vol. 9,
no. 4, pp. 56–66, 2017, doi: 10.5815/ijigsp.2017.04.07.
[23] O. Hemida, Y. Huo, H. He, and F. Chen, “A restorable fragile watermarking scheme with superior localization for both natural
and text images,” Multimed. Tools Appl., vol. 78, no. 9, pp. 12373–12403, May 2019, doi: 10.1007/s11042-018-6664-3.
[24] L. Rakhmawati, W. Wirawan, and S. Suwadi, “A recent survey of self-embedding fragile watermarking scheme for image
authentication with recovery capability,” Eurasip J. Image Video Process., vol. 2019, no. 1, 2019, doi: 10.1186/s13640-019-
0462-3.

Paper’s should be the fewest possible that accurately describe … (First Author)
18  ISSN: 1693-6930

BIOGRAPHIES OF AUTHORS

‘Aqilah Abd. Ghani received her bachelor’s degree in Graphic and Multimedia
Technology from University Malaysia Pahang, Malaysia in 2017. She started to learn official
computing courses at Pahang Matriculation College (KMPh) and continue her study at
University Malaysia Pahang (UMP) until now. Currently, she is doing a Master of Research
in Image & Signal Processing at Faculty of Computing, UMP. Actively involved in
conferences and research presentation, she had done two Scopus indexed research papers,
ongoing paper journal and finishing her master study. She also aims to pursue her academic
journey as a Postdoctoral, Ph.D. researcher one day. She can be contacted at email:
aqilahghani.edu@gmail.com.

Syifak Izhar Hisham received the doctoral degree (Ph.D.) in computer science
from University Malaysia Pahang, Malaysia, with the Dissertation “Enhanced LSB
Watermarking Methods Based on Scanning Patterns for Authentication of Medical Images”.
She is a lecturer of Data Security in the Faculty of Computing, University Malaysia Pahang.
She believes that she has strong background in researching, academic writing and presenting
in various viva, speech conference, and product competition sessions. Her research
concentrations include Data Security, Digital Watermarking, Image Processing, E-Learning,
Multimedia Technology, and Images Authentication. She has experiences in lecturing and
teaching with 5 years experiences in various institutions and various field. She can be
contacted at email: syifakizhar@ump.edu.my

Nur Alya Afikah Usop graduated from Universiti Malaysia Sarawak (UNIMAS)
in 2019 with bachelor’s degree of Computational Science. Currently furthering master’s
degree in Universiti Malaysia Pahang (UMP) in Research of Multimedia which focusing on
image processing security. She actively involved in conferences and research presentation,
she had done two reviewed research papers, ongoing paper journal and finishing her master
study. She can be contacted at email:

Nasrul Hadi Johari is a senior lecturer and a researcher at Faculty of

Mechanical and Automotive Engineering Technology in Universiti Malaysia Pahang. He
obtained his PhD in Mechanical Engineering (Biofluids Mechanics) from Imperial College
London, United Kingdom. Prior to that, he completed his master’s degree at Universiti
Teknologi Malaysia and Bachelor at Universiti Malaysia Pahang. Nasrul started his
engineering profession with Perodua Manufacturing Sdn Bhd as R&D engineer in 2008
before he pursuing to teaching and research field. His research interests include computational
modelling of blood flow, tissue mechanics and mass transport in the cardiovascular system,
with applications ranging from evaluating the hemodynamic performance of medical devices
to predict the outcome of endovascular interventional procedures. He is also interested in
computational and experimental modelling of the interaction between human and sports
equipment particularly in improving training aid system and injury preventionHe can be
contacted at email: nhadi@ump.edu.my

TELKOMNIKA Telecommun Comput El Control, Vol. 99, No. 1, Month 2099: 1-1x