Upload
duongque
View
225
Download
0
Embed Size (px)
Citation preview
IMPROVED IMPLEMENTATION OF DIGITAL
WATERMARKING TECHNIQUES
AHMED SABEEH YOUSIF
UNIVERSITI TEKNOLOGI MALAYSIA
i
IMPROVED IMPLEMENTATION OF DIGITAL
WATERMARKING TECHNIQUES
AHMED SABEEH YOUSIF
A project report submitted in partial fulfilment of the
requirement for the award of the degree of
Master of Engineering (Electrical-Microelectronics and Computer Engineering)
Faculty of Electrical Engineering
Universiti Teknologi Malaysia
DECEMBER 2013
iii
Dedicated to my family.
Thank you for your perseverance
iv
ACKNOWLEDGEMENT
Praise be to God, who sent his messenger with guidance and the religion of
truth to proclaim it over all religions, and make it a good example for those who
had hope for Allah, then praise be to God Almighty whom through his will and his
grace that supported the completion of this work.
I express great gratitude and thanks to my supervisor, Dr. Zaid Bin Omar for
supporting me throughout the duration of the research in spite of the difficulties.
My sincere appreciation and respect to him and I pray to God for him to be richly
rewarded.
As well I thank the members of my family who were the best help and
support for me throughout the years of study and I ask Allah to reward my parents
who gave me everything generously and without hesitation. I wish to express my
thanks to them for being tolerant with me in times of hardship.My prayers to God to
reward them with the best.
Ahmed
v
ABSTRACT
With the advancement of high speed computer networks, multimedia storage
and transmission technology, anenormous amount of information is being
communicated in digital form. There is a constant threat to copyright, ownership and
integrity of digital data. Therefore information security has become an emerging
area of research. Security of images is an area of major concern as digital images are
available all over World Wide Web. Numerous watermarking techniques have been
developed to protect images from illegal manipulations. In this project, spatial
domain and transform domain have been proposed. Histogram shifting falls under
the spatial domain method and spread spectrum falls under transform domain
method. For the proposed Histogram Shifting, modification of the histogram and
shifting is applied for embedding the stage, add to that our contribution in this
method incorporated the threshold concept to improve the visual quality of the host
image. In the proposed Spread Spectrum, a chaos-based spread spectrum
watermarking algorithm is developed in the DCT domain for still image. The most
significant feature of chaos is its sensitivity to initial conditions. This characteristic
of chaos has been used successfully for secure watermarking applications. Local
properties of the image and the features of the human visual system are considered in
order to optimize the watermark strength in addition to the incorporated luminance
masking effect of the HVS in the masking image, since the human eye is less
sensitive to change in regions with high brightness as well as in very dark regions in
comparison to mid-grey regions, where the distortion is most noticeable. The
contribution only uses luminance masking for enhancing the visual quality of images
in the embedding stage instead of using a combination of different masks and that
leads to less complexity. The performance of the proposed watermarking schemes
have been evaluated by using the watermarked images of size 512×512, and the
watermark (payload) is of the same size as the host image in the spread spectrum
with a different amount of variables "random bit streams" used in the histogram
sniffing. The simulations are performed in MATLAB 7 software environment. The
PSNR metric and SSIM with GMSD are applied to measure the degradation of the
images. A comparison is made between the results of the proposed algorithms with
each other and also compared with the best method namely Bit Plane Mapping and
demonstrates that the proposed methods are superior in performance and especially
the proposed Spread Spectrum.
vi
ABSTRAK
Dengan kemajuan rangkaian komputer berkelajuan tinggi, storan multimedia
dan teknologi transmisi, sangat banyak maklumat dikomunikasikan dalam bentuk
digital. Terdapat satu ancaman berterusan kepada hak cipta, hak milik dan integriti
data digital. Oleh itu keselamatan maklumat telah menjadi sesuatu penyelidikan
yang baru muncul. Keselamatan imej adalah sesuatu bidang yang menjadi
kebimbangan utama kerana imej digital boleh didapati di seluruh Jaringan Sejagat
(World Wide Web). Banyak teknik tera air telah dibangunkan untuk melindungi
imej dari manipulasi haram. Dalam projek ini , domain spatial dan pengubahan
domain telah dicadangkan. Peralihan Histogram berada di bawah kaedah domain
ruang dan spektrum penyebaran berada di bawah kaedah pengubahan domain.
Untuk Peralihan Histogram yang dicadangkan itu, pengubahsuaian histogram dan
peralihan digunakan untuk membenamkan pentas, disamping sokongan tambahan
dengan sumbangan kami dalam kaedah ini digabungkan dengan konsep ambang
untuk meningkatkan kualiti visual imej perumah. Dalam Serakan Spektrum yang
dicadangkan itu, spektrum penyebaran algoritma berasaskan huru-hara – tera air
dibangunkan dalam domain DCT untuk imej pegun. Ciri yang paling ketara daripada
algoritma huru-hara adalah kepekaannya terhadap keadaan awal. Ciri huru-hara Ini
telah digunakan dengan jayanya untuk aplikasi tera air yang selamat. Ciri-ciri imej
tempatan dan ciri-ciri sistem visual manusia dipertimbangkan untuk
mengoptimumkan kekuatan tera air sebagai tambahan kepada kesan pelitupan
luminans HVS yang diperbadankan dalam pelitupan imej, kerana mata manusia
adalah kurang sensitif terhadap perubahan di kawasan-kawasan dengan kecerahan
tinggi dan juga di kawasan-kawasan yang sangat gelap berbanding dengan kawasan-
kawasan separa kelabu, yang mana kesan herotan adalah yang paling ketara.
Sumbangan ini hanya menggunakan pelitupan luminans untuk meningkatkan kualiti
visual imej dalam peringkat pembenaman dan bukan menggunakan gabungan
litupan-litupan yang berbeza dan yang membawa kepada kurang kerumitan. Prestasi
skema tera air yang dicadangkan telah dinilai dengan menggunakan imej tera air
bersaiz 512 × 512, dan tera air ( muatan ) adalah saiz yang sama dengan imej
perumah dalam spektrum penyebaran dengan jumlah yang berbeza pembolehubah
"sedikit rawak aliran" yang digunakan dalam penghiduan histogram. Simulasi
dilakukan dalam persekitaran perisian MATLAB 7. Metrik PSNR dan SSIM dengan
GMSD digunakan untuk mengukur penguraian imej. Perbandingan dibuat antara
keputusan algoritma yang dicadangkan antara satu sama lain dan juga berbanding
dengan kaedah terbaik iaitu Pemetaan Satah Bit dan menunjukkan bahawa kaedah
yang dicadangkan adalah berprestasi unggul terutama Serakan Spektrum yang
dicadangkan.
vii
TABLE OF CONTENTS
CHAPTER TITLE PAGE
DECLARATION ii
DEDICATION iii
ACKNOWLEDGEMENT iv
ABSTRACT v
ABSTRAK vi
TABLE OF CONTENTS vii
LIST OF TABLES x
LIST OF FIGURES xi
LIST OF ABBREVIATIONS xiii
LIST OF APPENDICES xiv
1 INTRODUCTION 1
1.1 Overview on Data Embedding 1
1.2 Problem Statement 3
1.3 Objectives of Thesis 4
1.4 The Scope of the Work 4
1.5 Organization of the Thesis 5
2 THE BASIC OF DIGITAL WATERMARKING 7
2.1 Introduction 7
2.2 Branches of Data Embedding 8
2.1.1 Steganography 8
viii
2.2.2 Watermarking 8
2.3 Applications of Data Embedding 9
2.4 General Framework of Data Embedding 11
2.5 Reversibility vs. Irreversibility 12
2.6 Blind vs. non-Blind watermarking 14
2.7 Watermarking and theory of communication 14
2.8 Watermarking System Model 15
2.9 Mathematic Description of Watermarking Scheme 17
2.10 Watermarking Requirements 19
2.10.1 Visual Quality 20
2.10.1.1 Peak Signal to Noise Ratio
(PSNR)
21
2.10.1.2 Structural Similarity (SSIM) 22
2.10.1.3 Gradient Magnitude
Similarity Deviation (GMSD)
24
2.10.2 Robustness 26
2.10.2.1 JPEG compression 27
2.10.2.2 Blurring 27
2.10.2.3 Gaussian filtering 27
2.10.2.4 Wiener filtering 28
2.10.2.5 Image Re-Scaling 28
2.10.2.6 LSB Manipulation 28
2.10.2.7 Cropping and Rescanning 29
2.10.3 Embedding Capacity 29
3 LITERATURE SURVEY OF WATERMARKING
METHODS
31
3.1 Introduction 31
3.2 Bit Plane Mapping 31
3.3 Histogram shifting 33
3.4 Spread Spectrum 35
3.4.1 Chaos and its applications to watermarking 38
3.4.2 Human Visual System in Spread Spectrum 40
ix
4 DESIGN METHODOLOGY 41
4.1 Introduction 41
4.2 Project Methodology 41
4.3 Empirical Implementation 42
4.4 Histogram Shifting 43
4.4.1 Embedding Process 43
4.4.2 Extracting Payload 44
4.5 Proposed Spread Spectrum 47
4.5.1 Embedding Process of Proposed Method 48
4.5.2 Extract process 49
5 RESULTS AND DISCUSSION 50
5.1 Introduction 50
5.2 Set of testing images 51
5.3 Experimental environment and Set of Functions 51
5.4 Proposed Histogram Shifting Watermarking
(HSW)
53
5.5 Spread Spectrum 58
5.6 Discussion 64
5.6.1 Histogram Shifting 64
5.6.2 Spread Spectrum 66
6 CONCLUSION AND FUTURE WORK 68
6.1 Introduction 68
6.2 Summary 69
6.3 Conclusion 70
6.4 Future work 71
APPENDICES A-B 77-81
x
LIST OF TABLES
TABLE NO TITLE PAGE
1.1 The number of publications in data embedding area in
duration from 1992 to 1998
2
2.1 Classification of embedding capacity performance 28
5.1 The selected intensity levels of embedding at T=100 51
5.2 SSIM in HSW 52
5.3 PSNR (db) in HSW 52
5.4 Show the PSNR for the proposed Spread Spectrum 58
5.5 Show the GMSD for the proposed method of spread
spectrum embedding and extracting
60
5.6 SSIM for the embedding and extracting for the proposed
algorithm
60
5.7 Show the comparative between the proposed Histogram
Shifting with pervious method done in the spatial domain
62
6.1 Show the whole comparative between methods 65
xi
LIST OF FIGURES
FIGURE NO TITLE PAGE
1.1 The detailed scope of the project. 5
2.1 The general branches of data embedding area. 10
2.2 General framework of data embedding. 12
2.3 General framework of data embedding. 13
2.4 The model of image watermarking in communication
theory.
14
2.5 The classical model of communication system. 15
2.6 Watermark Embedding Scheme. 16
2.7 Watermark Extraction Scheme. 16
2.8 The three requirements of watermarking, in which a
trade-off should be made between them.
19
3.1 The algorithm of embedding a watermark using Bit
Plane Mapping method
30
3.2 Example on histogram shifting, where the zero point is
255, and peak point is 154
32
3.3 Bringing an image into DCT domain. 34
3.4 The logistic bifurcation diagram. 34
4.1 Proposed methodology 40
4.2 Embedding process using HS watermarking method. 42
4.3 Extraction process using HS watermarking method. 43
4.4 Embedding Process. 45
4.5 Algorithm for the Extracting Process. 46
5.1 The set of testing images. 48
xii
5.2 Embedding capacity in HSW at T=0, 10, 100 and 1000
respectively.
51
5.3 Refer to the amount of payload enter inside the host
image and equal to 1130 bits for the threshold equal
1000
53
5.4 Comparison between original and watermarked image
of Baboon. Watermark is achieved using HSW at
T=1000.
53
5.5 Show the extract for the payload with same data
entered in the embed process.
54
5.6 (a) Show the original image. (b) Show the proposed
luminance masking used in the embedding stage to
enhance the visual quality of the output image.
55
5.7 Logistics map to generate sequence 2d of the
watermark.
56
5.8 Show (a) is the original image and (b) is the
watermarked image with incorporate the luminance
masking, PSNR is 37.5(db).
57
5.9 Show the watermark to be inserted in the host image. 58
5.10 Watermark extract 59
5.11 Show comparative between proposed Spread Spectrum
in term of enhance the visual quality measured by
PSNR (db) with (classic Spread Spectrum, proposed
Histogram Shifting, Bit Plane Mapping).
63
xiii
LIST OF ABBREVIATIONS
DCT - Discrete Cosine Transform
DWT - Discrete wavelet transform
GMSD - Gradient Magnitude Similarity Deviation
HSW - Histogram Shifting watermarking
HVS - Human Visual Quality
JPEG - Joint Photographic Experts Group
LSB - Least Scientific Bit
PoO - Probability of Occurrence
PSNR - Peak Signal to Noise Ratio
QOS - Quality Of service
SME - Mean Squared Error
SNR - Signal to Noise Ratio
SSIM - Structural Similarity
T - Threshold
xiv
LIST OF APPENDICES
TABLE NO TITLE PAGE
A Histogram Shifting Matlab Code 77
B Spread Spectrum Matlab Code 80
1
CHAPTER 1
INTRODUCTION
1.1 Overview on Data Embedding
Digital revolution is a nowadays milestone, in which digital data almost
covers our lifestyle completely. Such a revolution is a consequence of the advances
in the technology of capturing devices, which become available at affordable prices
and better efficiency. Hence, huge amount of digital data are taken, stored and
exchanged every moment for luxury, education, commercial, security and many
other purposes that impacts directly all sides of human life. Sharing these large
amounts of digital data (or data for short) is becoming even more easy thanks to the
advances in speedy communication networks that allow transferring these data at a
low cost with more reliability.
Although that revolution increases the quality performance of our life, the
continuous production of data requires a proper management for many purposes.
Copyright protection and ownership documentation come at the top of these
purposes. Data classification/description is another requirement for efficient data
indexing. Obscuring meta-data for covert communication is highly demanded.
Embedding medical reports along with the medical images for reliable archiving
2
becomes more desirable in hospitals. Integrating properly different data of a same
object in huge databases is of high necessity for better Quality of Service (QoS). On
the other hand, as data are increasingly generated in multimedia formats, correlating
and synchronizing these data (such as images, audio and/or textual subtitles in video
streams) comes under highly demanded sector of data management. Generally, the
more data are generated, the more management is required.
Hence, it is significant developing reliable data management techniques that
achieve the aforementioned purposes. The existing techniques achieve such
management using data embedding (or data hiding [1]).
Table 1.1: The number of publications in data embedding area in duration from
1992 to 1998 [3].
Year 1992 1993 1994 1995 1996 1997 1998
Publications 2 2 4 13 29 64 103
Data embedding includes embedding external data into a host for
management purpose(s). The external data presents the management data, which are
embedded obscurely into the host. The embedding of data is an ad-hoc process, in
which the requirement(s) of application of data in question is considered while
achieving the embedding [2]. The ad-hoc nature of data embedding leads to
developing sub-research areas (or branches) under general data embedding area.
Data embedding can be considered as a newly developed branch in computer
engineering. In Table 1.1, it is shown that the contribution in this branch started in
1992, with two papers only, followed by two papers in 1993. But the number of
3
publications increased significantly after holding the first conference on data
embedding in 1995 [3].
The interest of scientific community in data embedding was increased along
with the recent development of memory, processing and communication
technologies, which emphasize the need to overcome the illegal duplication of data,
such as music, video and even electronic documents, by accommodating copyright
data into data in question.
Even though, steganography (science of hiding data into a host for covert
communication) is a branch of data embedding, in which some literatures indicate
that an early interest steganography was recorded in 15th
century, where a method
about hiding data into music scores was proposed at then [4].
1.2 Problem Statement
The visual quality of images is distorted differently by watermarking
methods. In some images, such distortion affects significantly the quality of the
watermarked image; and consequently the application of the watermarking methods
is limited practically.
Hence, the following problems that will be overcome in this project:
1. The visual quality of a watermarked image is distorted. Such distortion
should be measured and evaluated objectively.
4
2. The set of possible factors that affect the degree of distortion in
watermarked images (such as embedding capacity or selected bit-plane of
watermark insertion) should be analyzed from the performance of
watermarking methods. This analysis is significant in order to re-design
the watermarking methods of less visual quality distortion.
1.3 Objectives of Thesis
The set of objectives of this project are summarized as follows:
1. To improve the digital watermarking method in the spatial domain
namely, Histogram Shifting.
2. To improve the digital watermarking method in the frequency domain
namely, Spread Spectrum.
3. To study the efficiency of SSIM, PSNR in Histogram Shifting and
PSNR,GMSD in Spread Spectrum for evaluating the visual quality
performance for the both methods.
1.4 The scope of the work
In this project, the affect of embedding a watermark on the visual quality of
an image is studied. This affect is studied on invisible watermark, which is classified
under robust kind. A blind watermarking method is used to evaluate the visual
quality.
5
The spatial-domain based watermarking method is considered, namely, those
that are based on Histogram Shifting and another method done in the transform
domain namely Spread Spectrum. In Figure 1.1, the detailed scope is illustrated.
Figure 1.1 The detailed scope of the project.
1.5 Organization of the Thesis
Chapter One: present overview details about the Watermarking and problem
statement that we are going to solve it and the objectives for this research.
Information hiding
Fragile
Watermarking Steganography
Visible
Robust
Invisible
Blind Non-blind
Spatial domain Transform domain
6
Chapter Two: The watermarking aspects had been discussed. Starting with
the General Framework of Data Embedding and watermark schemes, requirements to
fulfill when achieved it and watermark system model, Mathematic Description of
Watermarking Scheme, Watermarking and theory of communication.
Chapter Three: literature survey of two methods in details, some of relevant.
Literatures were surveyed (up- to 56 references), which covers most of the essential
aspects of watermarking and data embedding area. This includes the methods that
are intended to be applied and evaluated according the objectives of the project. The
literature survey defines some problems that our project aims at overcome them.
Chapter Four: Include project methodology and design whole methodology in
general, in addition start to design the algorithms of two methods (Histogram
Shifting, Spread Spectrum), as result, we designed algorithms based on literature
survey (embedding and extracting )for each method in order to improve and achieve
the aim of the research.
Chapter Five: Result and analysis have been given in proper way and
discussed in details.
Chapter Six: The conclusion and the future work have been done.
72
BIBLIOGRAPHY
[1] Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999). Information hiding-a
survey. Proceedings of the IEEE, 87(7), 1062-1078.
[2] Sabu M Thampi “Information Hiding Techniques: A Tutorial Review”.
Proceeding of ISTE- STTP on Network Security & Cryptography, LBSCE
2004.
[3] Anderson R. J, ed., Information hiding: first international workshop, vol. 1174 of
Lecture Notes in Computer Science, Isaac Newton Institute, Cambridge,
England, May 1996, Springer-Verlag, Berlin, Germany.
[4] Pfitzmann B., “Information hiding terminology.” In Anderson [5], pp. 347–350
[5]. Johnson N. F., Katzenbeisser, S. "A Survey of steganographic techniques", in S.
Katzenbeisser and F. Petitco1as (Eds.): Infonnation Hiding, pp. 43- 78.
[6] Bender, W., Gruhl, D., Morimoto, N., & Lu, A. (1996). Techniques for data
hiding. IBM Systems Journal, 35(3.4), 313-336.
[7] Raja‟S. A., Ahmed A., “A Fragile Watermarking Algorithm for Content
Authentication”, International Journal of Computing & Information Sciences.
Vol.2, No.1, April 2004.
[8] Deguillaume F., Voloshynovskiy S., and Pun T., "Secure hybrid robust
watermarking resistant against tampering and copy attack", presented at
Signal Processing, 2003, pp.2133-2170.
[9] ShiguoLian, Zhongxuan Liu, Zhen Ren, Haila Wang: On the Performance of
Joint Fingerprint Embedding and Decryption Scheme CoRR abs/0706.3076:
(2007).
[10] Lino Coria, PanosNasiopoulos, Rabab Ward and Mark Pickering. “An Access
Control Video Watermarking Method that is Robust to Geometric Distortions”,
Journal of Information Assurance and Security, Vol: 2, pp: 266- 274, 2007.
73
[11] Seong Y. K., "Scene-based Video Indexing and Watermarking for Digital
Broadcast Receivers ", Department of Mechatronics vol. Doctor of Philosophy
Kwangju, Republic of Korea Kwangju Institute of Science and Technology
2003, p. 150.
[12] Bourennane M. A. H. A. M. E.-b., "A Watermarking of Medical Image-New
Approach Based On Multi-Layer Method," International Journal of Computer
Science Issues, vol. 8, pp. 33-41, 2011.
[13] Kim H. Y. and Afif A., "Secure authentication watermarking for binary
images," in Computer Graphics and Image Processing, 2003. SIBGRAPI 2003.
XVI Brazilian Symposium on, 2003, pp. 199-206.
[14] Chen, M. He, Y. Lagendijk, R. L : Error detection by fragile watermarking,
Proceedings of the 22nd Picture Coding Symposium PCS-2001, April 25-27,
2001, Seoul, Korea http://www-it.et.tudelft.nl/inald/pubs/Watermarking/fragile
watermarkPV2001.pdf.
[15] Por L. Y., Delina B., "Information Hiding: A New Approach in Text
Steganography" 7th wseas int. conf. on applied computer and applied
computational science (ACACOS '08), Hangzhou, China, April 6-8, 2008.
[16] Cox I. J., Kilian J., Leighton F. T., and Shamoon T., “Secure Spread Spectrum
Watermaking For Multimedia”, IEEE Transactions on Image Processing, Vol.
6, No. 12, pp. 1673-1687, 1997.
[17] Wong P.H.W., Au O.C., and Wong W.C., “A Data Hiding Technique in JPEG
Compressed Domain,” Proc. SPIE Security&Watermarking of Multimedia
Contents III, Vol.4314, pp.309-320, 2001.
[18] Bassia P., Pitas I., and Robust l., “Audio Watermarking in the Time Domain”, IX
European Signal Processing Conference, Vo1.1, pp.13-16, 1998.
[19] Mobasseri B.G., Berger R.J., Marcinak M.P., and NaikRaikar Y.J., “Data
Embedding in JPEG Bitstream by Code Mapping”, IEEE transactions of Image
Processing, Vol.19, pp.958-966, 2010.
[20] Ankovic S., Orovic I., Zaric N., "An Application of Multidimensional Time-
Frequency Analysis as a Base for the Unified Watermarking Approach", IEEE
Transactions on Image Processing, Vol.19, No.3, pp.736-745, 2010.
[21] Awrangjeb, M. and Kankanhalli M. S., "Reversible watermarking using a
perceptual model," Electronic Imaging, 14(1), 013014-1-8, 2005. (Pubitemid
40773601).
74
[22] Luo X., Wang D., Wang P. and Liu F. "A review on blind detection for image
steganography", Signal Process., vol. 88, pp.2138, 2008.
[23] Ahmet, B. (2002). Watermarking Capacity Improvement by Low Density Parity
Check Codes.Master thesis.Bogazici University, Turkey.
[24] Juergen, S. (2005). Digital Watermarking for Digital Media. University of
Cooperative Education Heidenheim, Germany.
[25] Gulati, K. (2003). Information Hiding Using Fractal Encoding. Master Thesis.
Indian Institute of Technology Bombay, Mumbai.
[26] Shelby, P. (2000). Robust Digital Image Watermarking. Ph.D. Thesis.
University of Geneve, Faculty of Science, Canada.
[27] Joachim, J., Eggers, J., and Bernd, G. (2000). Robustness of a blind image
watermarking scheme. ICIP 2000, Special Session on WM. Sep. 10–13.
Canada.
[28] Wu, N. (2004). A Study on Data Hiding for Gray-Level and Binary Images.
Master Thesis. Chaoyang University of Technology, Taiwan.
[29] Cheung, W. N. (2000). Digital image watermarking in spatial and transform
domains.TENCON Proceedings. 3: 374-378.
[30] Hosinger, C., and Rabbani, M. (2000). Data embedding using phase dispersion.
presented at International Conference on Information Technology: Coding and
Computing (ITCC2000).
[31] Wang Z. and Bovik A.C., The Handbook of Image and Video Processing, 2nd
ed. New York: Academic Press, June 2005, ch. Structural approaches to image
quality assessment, pp. 961–974.
[32] Voyatzis, G and Pitas, I. (1999). Protecting Digital-Image Copyrights: A
Framework. IEEE Trans. On Computer Graphics and Application. 19(1): 18-
24.
[33] Chen, W. Y. (2003). A Comparative Study of Information Hiding Schemes
Using Amplitude, Frequecy and Phase Embeddings. Ph.D.
dissertation.Department of Electrical Engineering, National Cheng Kung
University, Tainan, Taiwan, R.O.C.
[34] Ramkumar, M. (2000). Data Hiding in Multimedia - Theory and Applications.
Ph.D. Thesis. January.New Jersey Institute of Technology, Newark, New
Jersey.
75
[35] Gavrielides, M. A., ˇSikudová, E., and Pitas, I. (2006). Color-Based Descriptors
for Image Fingerprinting.IEEE Transactions on Multimedia.August.8(4).
[36] Yuan, Y. B., Vorburger, T. V., Song, J. F., and Renegar, T. B. (2000). A
Simplified Realization for the Gaussian Filter in Surface Metrology.
International Colloquium on Surfaces. 31 January – 2 February. Chemnitz,
Germany.
[37] McAndrew, A. (2004). Introduction to Digital Image Processing with
Matlab.Thomson Course Technology.
[38] Mohan, B. C., Srinivaskumar, S., and Chatterji, B. N. (2008). A Robust Digital
Image Watermarking Scheme using Singular Value Decomposition (SVD),
Dither Quantization and Edge Detection. ICGST-GVIP Journal. June. 8(1)
[39] Wu, N. I., and Hwang, M. S. (2007). Data Hiding: Current Status and Key
Issues. International Journal of Network Security.January. 4(1): 1–9.
[40] Delaigle, J. F. (2000). Protection of Intellectual Property of Images by
Perceptual Watermarking. Ph.D. Thesis. University catholique de Louvain
Louvain, Belgium.
[41] Autrusseau, F., and Le Callet, P. (2007). A robust image watermarking
technique based on quantization noise visibility thresholds.Elsevier Signal
Processing. 87 (6), 1363-1383.
[42] Piva, A., Barni, M., Bartolini, F., and Cappellini, V. (1999). Capacity of the
watermarking channel: How many bits can be hidden within a digital image.
Security and Watermarking of Multimedia Contents, Proceedings of SPIE,
Wong, Delp. San Jose, CA, 3657: 437-448.
[43] Viterbi, A. (1995). CDMA: Principles of spread spectrum communication.
Redwood City, CA, USA: Addison Wesley Longman Publishing Co. Inc.
[44] Chan C. K. and Chen L. M. "Hiding data in images by simple LSB
substitution", Pattern Recognit., vol. 37, pp.469 2004.
[45] Wu, D. C. and Tsai, W. H. (2003). A steganographic method for images by
pixel- value differencing. Pattern Recognition Letters. 24(9-10): 1613–1626.
[46] Habes, A. (2006). Information Hiding in BMP image Implementation, Analysis
and Evaluation. Information Transmissions in Computer Networks. 6(1): 1-10.
[47] Wu, M. and Liu, B. (1999). Watermarking for image authentication.
Proceedings of the IEEE International Conference on Image Processing.
76
[48] Maniccam, S. S., and Bourbakis, N. (2004). Lossless compression and
information hiding in images. Pattern Recognition. 37(3): 475–486.
[49] Chen, W. Y. (2003). A Comparative Study of Information Hiding Schemes
Using Amplitude, Frequecy and Phase Embeddings. Ph.D. dissertation.
Department of Electrical Engineering, National Cheng Kung University,
Tainan, Taiwan, R.O.C.
[50] R. Caldelli, F. Filippini, and R. Becarelli, "Reversible watermarking techniques:
An overview and a classification," EURASIP J. Inf. Security, vol.2010, 2010.
[51]Http://scholar.google.com/scholar?cites=11123322117781572712&as_sdt=2005
&sciodt=0, 5&hl=en.
[52] Cox I.J., Miller M.L., Linnartz J.M.G. and Kalker T., “A Review of
Watermarking Principles and Practices” in Digital Signal Processing for
Multimedia Systems, K.K. Parhi and T. Nishitani, New York, Marcel Dekker,
New York, pp. 461-482, 1999.
[53] Prime Core Solutions, website: http://www.pcs-ip.eu/index.php/main/edu/5 .
[54] Chikhaoui Fatima, Djebbari Ali," New chaotic binary sequences with good
correlation property using logistic maps" IOSR Journal of Electronics and
Communication Engineering (IOSR-JECE) e-ISSN: 2278-2834,p- ISSN: 2278-
8735. Volume 5, Issue 3 (Mar. - Apr. 2013), PP 59-64.
[55] Xue, W., Zhang, L., Mou, X., & Bovik, A. C. (2013). Gradient Magnitude
Similarity Deviation: A Highly Efficient Perceptual Image Quality Index. arXiv
preprint arXiv:1308.3052.
[56] Belkacem S., Dibi Z. and Bouridane A., “A masking model of HVS for image
watermarking in the DCT domain,” Electronics, Circuits and Systems, 2007.
ICECS 2007. 14th IEEE International Conference, Dec. 2007, pp. 330-334,
doi:10.1109/ICECS.2007.4510997