The digital revolution has increased the production and exchange of high-value documents between institutions, businesses and the general public. In order to secure these exchanges, it is essential to
guarantee the authenticity, integrity and ownership of these documents. Digital watermarking is a possible solution to this challenge as it has already been used for copyright protection, source tracking and video authentication. It also provides integrity protection, which is useful for many types of documents (official documents, medical images). In this paper, we propose a new watermarking solution applicable to images and based on the hyperbolic geometry. Our new solution is based on existing work in the field of digital watermarking.
Quality - Security Uncompromised and Plausible Watermarking for Patent Infrin...CSCJournals
The most quoted applications for digital watermarking is in the context of copyright-protection of digital (multi-)media. In this paper we offer a new digital watermarking technique, which pledges both Security and Quality for the image for the Patent protection. This methodology uses tale techniques like Shuffling, Composition & Decomposition, and Encryption & Decryption to record the information of a protected primary image and the allied watermarks. The quadtree can aid the processing of watermark and AES provides added security to information. Besides that, we intend a novel architecture for Patent Protection that holds promise for a better compromise between practicality and security for emerging digital rights management application. Security solutions must seize a suspicious version of the application-dependent restrictions and competing objectives.
Image steganography using least significant bit and secret map techniques IJECEIAES
In steganography, secret data are invisible in cover media, such as text, audio, video and image. Hence, attackers have no knowledge of the original message contained in the media or which algorithm is used to embed or extract such message. Image steganography is a branch of steganography in which secret data are hidden in host images. In this study, image steganography using least significant bit and secret map techniques is performed by applying 3D chaotic maps, namely, 3D Chebyshev and 3D logistic maps, to obtain high security. This technique is based on the concept of performing random insertion and selecting a pixel from a host image. The proposed algorithm is comprehensively evaluated on the basis of different criteria, such as correlation coefficient, information entropy, homogeneity, contrast, image, histogram, key sensitivity, hiding capacity, quality index, mean square error (MSE), peak signal-to-noise ratio (PSNR) and image fidelity. Results show that the proposed algorithm satisfies all the aforementioned criteria and is superior to other previous methods. Hence, it is efficient in hiding secret data and preserving the good visual quality of stego images. The proposed algorithm is resistant to different attacks, such as differential and statistical attacks, and yields good results in terms of key sensitivity, hiding capacity, quality index, MSE, PSNR and image fidelity.
A Generalized Image Authentication Based On Statistical Moments of Color Hist...idescitation
Designing low cost and high speed authentication
solution for digital images is always an attractive area of
research in image processing. In past few years because of
widespread use of internet and network technology, concept
of information distribution has been become habit rather than
exception in daily life. In same aspects challenges involved
with distribution of authenticate information has been
increased manifolds. In this paper a generalize image
authentication method has proposed by hybridization of color
histogram and associated first four statistical moments to
achieve the objectives of low cost and high speed. Proposed
method can apply for both gray and color images having any
size and any format. Solution generates a very small
authentication code with an ease means which is use to analyze
the characteristics of received image from tampering
perspective.
A Hybrid Digital Watermarking Approach Using Wavelets and LSB IJECEIAES
The present paper proposed a novel approach called Wavelet based Least Significant Bit Watermarking (WLSBWM) for high authentication, security and copyright protection. Alphabet Pattern (AP) approach is used to generate shuffled image in the first stage and Pell’s Cat Map (PCM) is used for providing more security and strong protection from attacks. PCM applied on each 5×5 sub images. A wavelet concept is used to reduce the dimensionality of the image until it equals to the size of the watermark image. Discrete Cosign Transform is applied in the first stage; later N level Discrete Wavelet Transform (DWT) is applied for reducing up to the size of the watermark image. The water mark image is inserted in LH Sub band of the wavelet image using LSB concept. Simulation results show that the proposed technique produces better PSNR and similarity measure. The experimental results indicate that the present approach is more reliable and secure efficient. The robustness of the proposed scheme is evaluated against various image-processing attacks.
High Capacity and Security Steganography Using Discrete Wavelet TransformCSCJournals
The secure data transmission over internet is achieved using Steganography. In this paper High Capacity and Security Steganography using Discrete wavelet transform (HCSSD) is proposed. The wavelet coefficients of both the cover and payload are fused into single image using embedding strength parameters alpha and beta. The cover and payload are preprocessed to reduce the pixel range to ensure the payload is recovered accurately at the destination. It is observed that the capacity and security is increased with acceptable PSNR in the proposed algorithm compared to the existing algorithms
Impact of Message Size on Least Significant Bit and Chaotic Logistic Mapping ...ijtsrd
Steganography is the technique of hiding information in other objects. Although many carrier objects can be used, digital images are the most popular because of their usage over the internet. For this purpose, many types of images steganographic techniques have been invented. Each of them has both pros and cons. It depends on the complexity, hiding capacity, security, and so on. In our research, we studied the two most popular techniques of image steganography, least significant bit LSB and chaotic logistic mapping to find the similarities, dissimilarities, and many other factors. In this paper, we presented a detailed comparison of the LSB and chaotic logistic mapping based image steganography for various carrier images and messages. Tokey Ahmmed | Ipshita Tasnim Raha | Faizah Safwat | Nakib Aman Turzo "Impact of Message Size on Least Significant Bit and Chaotic Logistic Mapping Steganographic Technique" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42494.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42494/impact-of-message-size-on-least-significant-bit-and-chaotic-logistic-mapping-steganographic-technique/tokey-ahmmed
Quality - Security Uncompromised and Plausible Watermarking for Patent Infrin...CSCJournals
The most quoted applications for digital watermarking is in the context of copyright-protection of digital (multi-)media. In this paper we offer a new digital watermarking technique, which pledges both Security and Quality for the image for the Patent protection. This methodology uses tale techniques like Shuffling, Composition & Decomposition, and Encryption & Decryption to record the information of a protected primary image and the allied watermarks. The quadtree can aid the processing of watermark and AES provides added security to information. Besides that, we intend a novel architecture for Patent Protection that holds promise for a better compromise between practicality and security for emerging digital rights management application. Security solutions must seize a suspicious version of the application-dependent restrictions and competing objectives.
Image steganography using least significant bit and secret map techniques IJECEIAES
In steganography, secret data are invisible in cover media, such as text, audio, video and image. Hence, attackers have no knowledge of the original message contained in the media or which algorithm is used to embed or extract such message. Image steganography is a branch of steganography in which secret data are hidden in host images. In this study, image steganography using least significant bit and secret map techniques is performed by applying 3D chaotic maps, namely, 3D Chebyshev and 3D logistic maps, to obtain high security. This technique is based on the concept of performing random insertion and selecting a pixel from a host image. The proposed algorithm is comprehensively evaluated on the basis of different criteria, such as correlation coefficient, information entropy, homogeneity, contrast, image, histogram, key sensitivity, hiding capacity, quality index, mean square error (MSE), peak signal-to-noise ratio (PSNR) and image fidelity. Results show that the proposed algorithm satisfies all the aforementioned criteria and is superior to other previous methods. Hence, it is efficient in hiding secret data and preserving the good visual quality of stego images. The proposed algorithm is resistant to different attacks, such as differential and statistical attacks, and yields good results in terms of key sensitivity, hiding capacity, quality index, MSE, PSNR and image fidelity.
A Generalized Image Authentication Based On Statistical Moments of Color Hist...idescitation
Designing low cost and high speed authentication
solution for digital images is always an attractive area of
research in image processing. In past few years because of
widespread use of internet and network technology, concept
of information distribution has been become habit rather than
exception in daily life. In same aspects challenges involved
with distribution of authenticate information has been
increased manifolds. In this paper a generalize image
authentication method has proposed by hybridization of color
histogram and associated first four statistical moments to
achieve the objectives of low cost and high speed. Proposed
method can apply for both gray and color images having any
size and any format. Solution generates a very small
authentication code with an ease means which is use to analyze
the characteristics of received image from tampering
perspective.
A Hybrid Digital Watermarking Approach Using Wavelets and LSB IJECEIAES
The present paper proposed a novel approach called Wavelet based Least Significant Bit Watermarking (WLSBWM) for high authentication, security and copyright protection. Alphabet Pattern (AP) approach is used to generate shuffled image in the first stage and Pell’s Cat Map (PCM) is used for providing more security and strong protection from attacks. PCM applied on each 5×5 sub images. A wavelet concept is used to reduce the dimensionality of the image until it equals to the size of the watermark image. Discrete Cosign Transform is applied in the first stage; later N level Discrete Wavelet Transform (DWT) is applied for reducing up to the size of the watermark image. The water mark image is inserted in LH Sub band of the wavelet image using LSB concept. Simulation results show that the proposed technique produces better PSNR and similarity measure. The experimental results indicate that the present approach is more reliable and secure efficient. The robustness of the proposed scheme is evaluated against various image-processing attacks.
High Capacity and Security Steganography Using Discrete Wavelet TransformCSCJournals
The secure data transmission over internet is achieved using Steganography. In this paper High Capacity and Security Steganography using Discrete wavelet transform (HCSSD) is proposed. The wavelet coefficients of both the cover and payload are fused into single image using embedding strength parameters alpha and beta. The cover and payload are preprocessed to reduce the pixel range to ensure the payload is recovered accurately at the destination. It is observed that the capacity and security is increased with acceptable PSNR in the proposed algorithm compared to the existing algorithms
Impact of Message Size on Least Significant Bit and Chaotic Logistic Mapping ...ijtsrd
Steganography is the technique of hiding information in other objects. Although many carrier objects can be used, digital images are the most popular because of their usage over the internet. For this purpose, many types of images steganographic techniques have been invented. Each of them has both pros and cons. It depends on the complexity, hiding capacity, security, and so on. In our research, we studied the two most popular techniques of image steganography, least significant bit LSB and chaotic logistic mapping to find the similarities, dissimilarities, and many other factors. In this paper, we presented a detailed comparison of the LSB and chaotic logistic mapping based image steganography for various carrier images and messages. Tokey Ahmmed | Ipshita Tasnim Raha | Faizah Safwat | Nakib Aman Turzo "Impact of Message Size on Least Significant Bit and Chaotic Logistic Mapping Steganographic Technique" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-4 , June 2021, URL: https://www.ijtsrd.compapers/ijtsrd42494.pdf Paper URL: https://www.ijtsrd.comcomputer-science/computer-security/42494/impact-of-message-size-on-least-significant-bit-and-chaotic-logistic-mapping-steganographic-technique/tokey-ahmmed
STEGANOGRAPHIC SUBSTITUTION OF THE LEAST SIGNIFICANT BIT DETERMINED THROUGH A...ijcsit
ABSTRACT
The present workproposes to perform an analysis of the similarities between the least significant two bits of the cover image and multiple series of two-bit-length encrypted frames, all of them from the cryptomessage. After finding the most similar frame, we proceed to substitute it into the cover image; nevertheless, to provide a proof of the improvement from using itor the least similar one, the statistics from both cases are obtained.Providing information that the more similar the frame is, the better statistics the stego-image has. Moreover, the statistics obtained from our work are also compared with other works, finding that we provide a good scheme for hiding information.
Survey on Different Image Encryption Techniques with Tabular Formijsrd.com
Rapid growth of digital communication and multimedia application increases the need of security and it becomes an important issue of communication and storage of multimedia. Image Encryption is one of the techniques that are used to ensure high security. Various fields such as medical science military in which image encryption can be used. Recent cryptography provides necessary techniques for securing information and protective multimedia data. In last some years, encryption technology has been developed quickly and many image encryption methods have been used to protect confidential image data from illegal way in. Within this paper survey of different image encryption techniques have been discussed from which researchers can get an idea for efficient techniques to be used.
Transmission of cryptic text using rotational visual cryptographyeSAT Journals
Abstract Today security is an important thing when we need to transmit data from one location to another safely. In this paper we are proposing an empirical model of secure data transmission technique with a hybrid approach of Cryptography, Stegnography and rotational analysis. In the initial phase, data is encrypted with DES algorithm with the help of Session key which is generated by the Diffie-Hellman Key exchange Algorithm. In the second phase Cipher Data is hidden into the cover image’s LSB to form the stego image, by considering security as the optimal security parameter. In the third phase, the Stego image is rotated with specific angle. At the receiver end, the image is de-rotated and the cipher information from the LSB is retrieved and the cipher information is decrypted with session key. This scheme achieves lossless recovery and is difficult to decrypt by the attackers. Keywords: Cryptography, Stegnography, Visual Cryptography, DES, Diffie-Hellman Algorithm, Session Key
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Abstract: Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. The cloud computing, users have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy preserving classification techniques are not applicable. On solving the classification problem over encrypted data. A secure k-NN classifier over encrypted data in the cloud. The k-NN protocol protects the confidentiality of the data, user’s input query, and data access patterns. To develop a secure k-NN classifier over encrypted data under the standard semi-honest model. Also, we empirically analyze the efficiency of our solution through various experiments.
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
We follow "Rigorous Publication" model - means that all articles appear on IJERD after full appraisal, effectiveness, legitimacy and reliability of research content. International Journal of Engineering Research and Development publishes papers online as well as provide hard copy of Journal to authors after publication of paper. It is intended to serve as a forum for researchers, practitioners and developers to exchange ideas and results for the advancement of Engineering & Technology.
A COMPARISON BETWEEN PARALLEL AND SEGMENTATION METHODS USED FOR IMAGE ENCRYPT...ijcsit
Preserving confidentiality, integrity and authenticity of images is becoming very important. There are so many different encryption techniques to protect images from unauthorized access. Matrix multiplication
can be successfully used to encrypt-decrypt digital images. In this paper we made a comparison study between two image encryption techniques based on matrix multiplication namely, segmentation and parallel methods.
Image Steganography Techniques: An OverviewCSCJournals
Steganography is one of the methods used for the hidden exchange of information. It is the art and science of invisible communication, which strives to hide the existence of the communicated message. In this way, if successfully it is achieved, the message does not attract attention from eavesdroppers and attackers. Using steganography, information can be hidden in different embedding mediums, known as carriers. These carriers can be images, audio files, video files, and text files. The focus in this paper is on the use of an image file as a carrier, and hence, the taxonomy of current steganographic techniques for image files has been presented. These techniques are analyzed and discussed in terms of their ability to hide information in image files, the amount of the information that can be hidden, and the robustness to different image processing attacks.
A secure image steganography based on burrows wheeler transform and dynamic b...IJECEIAES
In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence. In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.
Hungarian-Puzzled Text with Dynamic Quadratic Embedding SteganographyIJECEIAES
Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding sequence. The embedding technique is also text dependent and has non-bounded inputs, making the possibilities of decoding infinite. Due to the exponential growth of and quadratic embedding, a novel cyclic technique is also introduced for the sequence that goes beyond the limits of the cover medium. The proposed method also aims to reduce the noise arising from embedding the secret message by reducing bits changed. This is done by partitioning the cover medium and the secret message into N partitions and artificially creating an assignment problem based on bit change criteria. The assignment problem will be solved using the Hungarian algorithm that will puzzle the secret message partition for an overall least bit change.
MEANINGFUL AND UNEXPANDED SHARES FOR VISUAL SECRET SHARING SCHEMESijiert bestjournal
In today�s internet world it is very essential to secretly share biometric data stored in the central database. There are so many options to secretly share biometri c data using cryptographic computation. This work reviews and applies a perfectly secure method to secretly share biometric data,for possible use in biometric authentication and protection based on conc ept of visual cryptography. The basic concept of proposed approach is to secretly share private imag e into two meaningful and unexpanded shares (sheets) that are stored in two separate database servers such that decryption can be performed only when both shares are simultaneously available;at the same ti me,the individual share do not open identity of the private image. Previous research,such as Arun Ross et al. in 2011,was using pixel expansion for encryption,which causes the waste of storage space and transmission time. Furthermore,some researcher such as Hou and Quan�s research in 2011,producing m eaningless shares,which causes visually revealing existence of secret image. In this work,we review visual cryptography scheme and apply them to secretly share biometric data such as fingerprint,face images for the purpose of user authentication. So,using this technique we can secretly share biometric data over internet and only authorized user can decrypt the information.
High Capacity Image Steganography Using Adjunctive Numerical Representations ...ijcisjournal
LSB steganography is a one of the most widely used methods for implementing covert data channels in
image file exchanges [1][2]. The low computational complexity and implementation simplicity of the algorithm are significant factors for its popularity with the primary reason being low image distortion. Many attempts have been made to increase the embedding capacity of LSB algorithms by expanding into the second or third binary layers of the image while maintaining a low probability of detection with minimal distortive effects [2][3][4]. In this paper,we introduce an advanced technique for covertly embedding data within images using redundant number system decomposition over non -standard digital bit planes. Both grayscale and bit-mapped images are equally effective as cover files. It will be shown that this unique steganography method has minimal visual distortive affects while also preserving the cover file statistics, making it less susceptible to most general steganography detection algorithms.
Using SVD and DWT Based Steganography to Enhance the Security of Watermarked ...TELKOMNIKA JOURNAL
Watermarking is the process of embedding information into a carrier file for the protection of ownership/copyright of digital media, whilst steganography is the art of hiding information. This paper presents, a hybrid steganographic watermarking algorithm based on Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) transforms in order to enhance the security of digital fingerprint images. A facial watermark is embedded into fingerprint image using a method of singular value replacement. First, the DWT is used to decompose the fingerprint image from the spatial domain to the frequency domain and then the facial watermark is embedded in singular values (SV’s) obtained by application of SVD. In addition, the original fingerprint image is not required to extract the watermark. Experimental results provided demonstrate the methods robustness to image degradation and common signal processing attacks, such as histogram and filtering, noise addition, JPEG and JPEG2000 compression with various levels of quality.
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A Quick Glance over the Digital Watermarkingijsrd.com
Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Watermarking is the art of imperceptibly embedding a message into a work. More than 700 years ago in Fabriano (Italy), paper watermarks appeared in handmade paper, in order to identify its provenance, format, and quality. In this context, the watermark is a kind of invisible signature that allows identifying the creator or the owner of a document, and to detect possible copyright violations, and especially non-authorized copying [1]. More recently, different watermarking techniques and strategies have been proposed in order to solve a number of problems, ranging from the detection of content manipulations, to information hiding (steganography), to document usage tracing. In particular, the insertion of multiple watermarks to trace a document during its lifecycle is a very interesting and challenging application [1]. The main property of the proposed method is that it allows the insertion of multiple watermarks by different users, who sequentially come into play one after the other and do not need any extra information besides the public keys. This characteristic makes the present approach more attractive than previously available solutions.
Comparative Study on Watermarking & Image Encryption for Secure CommunicationIJTET Journal
Over the past decades, research in security has concentrated on the development of algorithms and protocols for authentication, encryption and integrity of data. Despite tremendous advances, several security problems still afflict system’s. In this android app watermarking and encryption is being applied on images and data. Because of the human visual system’s low sensitivity to small changes and the high flexibility of digital media, anyone can easily make small changes in digital data with low perceptibility. Here watermarking and encryption are being performed in wavelet domain. Here in watermarking, the coefficients of watermarks are being embedded with the coefficients of the original image. Encryption is being done in wavelet domain so that the probability of an intruder trying to access the contents is very much minimized. Thus, this model provides a high level of security.
STEGANOGRAPHIC SUBSTITUTION OF THE LEAST SIGNIFICANT BIT DETERMINED THROUGH A...ijcsit
ABSTRACT
The present workproposes to perform an analysis of the similarities between the least significant two bits of the cover image and multiple series of two-bit-length encrypted frames, all of them from the cryptomessage. After finding the most similar frame, we proceed to substitute it into the cover image; nevertheless, to provide a proof of the improvement from using itor the least similar one, the statistics from both cases are obtained.Providing information that the more similar the frame is, the better statistics the stego-image has. Moreover, the statistics obtained from our work are also compared with other works, finding that we provide a good scheme for hiding information.
Survey on Different Image Encryption Techniques with Tabular Formijsrd.com
Rapid growth of digital communication and multimedia application increases the need of security and it becomes an important issue of communication and storage of multimedia. Image Encryption is one of the techniques that are used to ensure high security. Various fields such as medical science military in which image encryption can be used. Recent cryptography provides necessary techniques for securing information and protective multimedia data. In last some years, encryption technology has been developed quickly and many image encryption methods have been used to protect confidential image data from illegal way in. Within this paper survey of different image encryption techniques have been discussed from which researchers can get an idea for efficient techniques to be used.
Transmission of cryptic text using rotational visual cryptographyeSAT Journals
Abstract Today security is an important thing when we need to transmit data from one location to another safely. In this paper we are proposing an empirical model of secure data transmission technique with a hybrid approach of Cryptography, Stegnography and rotational analysis. In the initial phase, data is encrypted with DES algorithm with the help of Session key which is generated by the Diffie-Hellman Key exchange Algorithm. In the second phase Cipher Data is hidden into the cover image’s LSB to form the stego image, by considering security as the optimal security parameter. In the third phase, the Stego image is rotated with specific angle. At the receiver end, the image is de-rotated and the cipher information from the LSB is retrieved and the cipher information is decrypted with session key. This scheme achieves lossless recovery and is difficult to decrypt by the attackers. Keywords: Cryptography, Stegnography, Visual Cryptography, DES, Diffie-Hellman Algorithm, Session Key
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Abstract: Data Mining has wide applications in many areas such as banking, medicine, scientific research and among government agencies. Classification is one of the commonly used tasks in data mining applications. The cloud computing, users have the opportunity to outsource their data, in encrypted form, as well as the data mining tasks to the cloud. Since the data on the cloud is in encrypted form, existing privacy preserving classification techniques are not applicable. On solving the classification problem over encrypted data. A secure k-NN classifier over encrypted data in the cloud. The k-NN protocol protects the confidentiality of the data, user’s input query, and data access patterns. To develop a secure k-NN classifier over encrypted data under the standard semi-honest model. Also, we empirically analyze the efficiency of our solution through various experiments.
International Journal of Engineering Research and Development is an international premier peer reviewed open access engineering and technology journal promoting the discovery, innovation, advancement and dissemination of basic and transitional knowledge in engineering, technology and related disciplines.
We follow "Rigorous Publication" model - means that all articles appear on IJERD after full appraisal, effectiveness, legitimacy and reliability of research content. International Journal of Engineering Research and Development publishes papers online as well as provide hard copy of Journal to authors after publication of paper. It is intended to serve as a forum for researchers, practitioners and developers to exchange ideas and results for the advancement of Engineering & Technology.
A COMPARISON BETWEEN PARALLEL AND SEGMENTATION METHODS USED FOR IMAGE ENCRYPT...ijcsit
Preserving confidentiality, integrity and authenticity of images is becoming very important. There are so many different encryption techniques to protect images from unauthorized access. Matrix multiplication
can be successfully used to encrypt-decrypt digital images. In this paper we made a comparison study between two image encryption techniques based on matrix multiplication namely, segmentation and parallel methods.
Image Steganography Techniques: An OverviewCSCJournals
Steganography is one of the methods used for the hidden exchange of information. It is the art and science of invisible communication, which strives to hide the existence of the communicated message. In this way, if successfully it is achieved, the message does not attract attention from eavesdroppers and attackers. Using steganography, information can be hidden in different embedding mediums, known as carriers. These carriers can be images, audio files, video files, and text files. The focus in this paper is on the use of an image file as a carrier, and hence, the taxonomy of current steganographic techniques for image files has been presented. These techniques are analyzed and discussed in terms of their ability to hide information in image files, the amount of the information that can be hidden, and the robustness to different image processing attacks.
A secure image steganography based on burrows wheeler transform and dynamic b...IJECEIAES
In modern public communication networks, digital data is massively transmitted through the internet with a high risk of data piracy. Steganography is a technique used to transmit data without arousing suspicion of secret data existence. In this paper, a color image steganography technique is proposed in spatial domain. The cover image is segmented into non-overlapping blocks which are scattered among image size window using Burrows Wheeler transform before embedding. Secret data is embedded in each block according to its sequence in the Burrows Wheeler transform output. The hiding method is an operation of an exclusive-or between a virtual bit which is generated from the most significant bit and the least significant bits of the cover pixel. Results of the algorithm are analyzed according to its degradation of the output image and embedding capacity. The results are also compared with other existing methods.
Hungarian-Puzzled Text with Dynamic Quadratic Embedding SteganographyIJECEIAES
Least-Significant-Bit (LSB) is one of the popular and frequently used steganography techniques to hide a secret message in a digital medium. Its popularity is due to its simplicity in implementation and ease of use. However, such simplicity comes with vulnerabilities. An embedded secret message using the traditional LSB insertion is easily decodable when the stego image is suspected to be hiding a secret message. In this paper, we propose a novel secure and high quality LSB embedding technique. The security of the embedded payload is employed through introducing a novel quadratic embedding sequence. The embedding technique is also text dependent and has non-bounded inputs, making the possibilities of decoding infinite. Due to the exponential growth of and quadratic embedding, a novel cyclic technique is also introduced for the sequence that goes beyond the limits of the cover medium. The proposed method also aims to reduce the noise arising from embedding the secret message by reducing bits changed. This is done by partitioning the cover medium and the secret message into N partitions and artificially creating an assignment problem based on bit change criteria. The assignment problem will be solved using the Hungarian algorithm that will puzzle the secret message partition for an overall least bit change.
MEANINGFUL AND UNEXPANDED SHARES FOR VISUAL SECRET SHARING SCHEMESijiert bestjournal
In today�s internet world it is very essential to secretly share biometric data stored in the central database. There are so many options to secretly share biometri c data using cryptographic computation. This work reviews and applies a perfectly secure method to secretly share biometric data,for possible use in biometric authentication and protection based on conc ept of visual cryptography. The basic concept of proposed approach is to secretly share private imag e into two meaningful and unexpanded shares (sheets) that are stored in two separate database servers such that decryption can be performed only when both shares are simultaneously available;at the same ti me,the individual share do not open identity of the private image. Previous research,such as Arun Ross et al. in 2011,was using pixel expansion for encryption,which causes the waste of storage space and transmission time. Furthermore,some researcher such as Hou and Quan�s research in 2011,producing m eaningless shares,which causes visually revealing existence of secret image. In this work,we review visual cryptography scheme and apply them to secretly share biometric data such as fingerprint,face images for the purpose of user authentication. So,using this technique we can secretly share biometric data over internet and only authorized user can decrypt the information.
High Capacity Image Steganography Using Adjunctive Numerical Representations ...ijcisjournal
LSB steganography is a one of the most widely used methods for implementing covert data channels in
image file exchanges [1][2]. The low computational complexity and implementation simplicity of the algorithm are significant factors for its popularity with the primary reason being low image distortion. Many attempts have been made to increase the embedding capacity of LSB algorithms by expanding into the second or third binary layers of the image while maintaining a low probability of detection with minimal distortive effects [2][3][4]. In this paper,we introduce an advanced technique for covertly embedding data within images using redundant number system decomposition over non -standard digital bit planes. Both grayscale and bit-mapped images are equally effective as cover files. It will be shown that this unique steganography method has minimal visual distortive affects while also preserving the cover file statistics, making it less susceptible to most general steganography detection algorithms.
Using SVD and DWT Based Steganography to Enhance the Security of Watermarked ...TELKOMNIKA JOURNAL
Watermarking is the process of embedding information into a carrier file for the protection of ownership/copyright of digital media, whilst steganography is the art of hiding information. This paper presents, a hybrid steganographic watermarking algorithm based on Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) transforms in order to enhance the security of digital fingerprint images. A facial watermark is embedded into fingerprint image using a method of singular value replacement. First, the DWT is used to decompose the fingerprint image from the spatial domain to the frequency domain and then the facial watermark is embedded in singular values (SV’s) obtained by application of SVD. In addition, the original fingerprint image is not required to extract the watermark. Experimental results provided demonstrate the methods robustness to image degradation and common signal processing attacks, such as histogram and filtering, noise addition, JPEG and JPEG2000 compression with various levels of quality.
Entropy based Digital Watermarking using 2-D Biorthogonal WAVELETpaperpublications3
Abstract: The Security is the most important aspect of Database, for maintain the integrity and as well as security of the system image watermarking is technique proposed at the year of 1996, in this paper we also implement image watermarking using 2-D biorthogonal Wavelt. The importance of transmitting digital information in digital watermarking system and the dissymmetric digital watermarking framework lived on media content communication is also being discussed in this paper. Then we apply watermarking embedding algorithm to keep the balance between watermarks’ imperceptibility and its robustness while the data is being sent on the communication channel.Keywords: Discrete Wavelet Transform (DWT), Gray Scale, Peak Signal to Noise Ratio (PSNR).
Title: Entropy based Digital Watermarking using 2-D Biorthogonal WAVELET
Author: Abhinav Kumar
ISSN 2350-1022
International Journal of Recent Research in Mathematics Computer Science and Information Technology
Paper Publications
A Quick Glance over the Digital Watermarkingijsrd.com
Digital watermarking is a process for modifying physical or electronic media to embed a machine-readable code into the media. The media may be modified such that the embedded code is imperceptible or nearly imperceptible to the user, yet may be detected through an automated detection process. Watermarking is the art of imperceptibly embedding a message into a work. More than 700 years ago in Fabriano (Italy), paper watermarks appeared in handmade paper, in order to identify its provenance, format, and quality. In this context, the watermark is a kind of invisible signature that allows identifying the creator or the owner of a document, and to detect possible copyright violations, and especially non-authorized copying [1]. More recently, different watermarking techniques and strategies have been proposed in order to solve a number of problems, ranging from the detection of content manipulations, to information hiding (steganography), to document usage tracing. In particular, the insertion of multiple watermarks to trace a document during its lifecycle is a very interesting and challenging application [1]. The main property of the proposed method is that it allows the insertion of multiple watermarks by different users, who sequentially come into play one after the other and do not need any extra information besides the public keys. This characteristic makes the present approach more attractive than previously available solutions.
Comparative Study on Watermarking & Image Encryption for Secure CommunicationIJTET Journal
Over the past decades, research in security has concentrated on the development of algorithms and protocols for authentication, encryption and integrity of data. Despite tremendous advances, several security problems still afflict system’s. In this android app watermarking and encryption is being applied on images and data. Because of the human visual system’s low sensitivity to small changes and the high flexibility of digital media, anyone can easily make small changes in digital data with low perceptibility. Here watermarking and encryption are being performed in wavelet domain. Here in watermarking, the coefficients of watermarks are being embedded with the coefficients of the original image. Encryption is being done in wavelet domain so that the probability of an intruder trying to access the contents is very much minimized. Thus, this model provides a high level of security.
27 5 jun17 28apr 15859 ammar final (edti ari baru))IAESIJEECS
The transition from analog technologies to digital technologies has increased the ever-growing concern for protection and authentication of digital content and data. Owners of digital content of any type are seeking and exploring new technologies for the protection of copyrighted multimedia content. Multimedia protection has become an issue in recent years, and to deal with this issue, researchers are continuously searching for and exploring new effective and efficient technologies. This thesis study has been prepared in order to increase the invisibility and durability of invisible watermarking by using the multilayer Discrete Wavelet Transform (DWT) in the frequency plane and embedding two marks into an image for the purpose of authentication and copyright when digital content travels through an unsecured channel. A novel watermarking algorithm has been proposed based on five active positions and on using two marks. In addition to the extraction process, watermarking images will be subjected to a set of attack tests. The evaluation criteria have been the bases of assessing the value of SNR, PNSR, MAE and RMSE for both the watermarking images and the watermarking images after attacks, followed by the invisibility of the watermarking being measured before and after the attacks. Our lab results show high robustness and high quality images obtaining value for both SNR and PNSR.
An Architectural Approach of Data Hiding In Images Using Mobile Communicationiosrjce
IOSR Journal of Computer Engineering (IOSR-JCE) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of computer engineering and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in computer technology. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Cryptography Based MSLDIP Watermarking AlgorithmCSCJournals
In recent years, internet revolution resulted in an explosive growth in multimedia applications. The rapid advancement of internet has made it easier to send the data accurate and faster to the destination. Aside to this, it is easier to modify and misuse the valuable information through hacking at the same time. Digital watermarking is one of the proposed solutions for copyright protection of multimedia data. In this paper cryptography based MSLDIP watermarking method (Modified Substitute Last Digit in Pixel) is proposed. The main goal of this method is to increase the security of the MSLDIP technique besides to hiding the watermark in the pixels of digital image in such a manner that the human visual system is not able to differentiate between the cover image and the watermarked image. Also the experimental results showed that this method can be used effectively in the field of watermarking.
A New Watermarking Approach Based on Combination of Reversible Watermarking a...CSCJournals
Image watermarking can be defined as a technique that allows insertion of imperceptible and indelible digital data into an image. In addition to its initial application which is the copyright, watermarking can be used in other fields, particularly in the medical field in order to contribute to secure images shared on the network for telemedicine applications. In this report we study some watermarking methods and the comparison result of their combination, the first one is based on the CDMA (Code Division Multiple Access) in DWT and spatial domain and its aim is to verify the image authenticity whereas the second one is the reversible watermarking (the least significant bits LSB and cryptography tools) and the reversible carte mapping RCM its objective is to check the integrity of the image and to keep the Confidentiality of the patient data. A new scheme of watermarking is the combination of the reversible watermarking method based on LSB and cryptography tools and the method of CDMA in spatial and DWT domain to verify the three security properties Integrity, Authenticity and confidentiality of medical data and patient information .In the end ,we made a comparison between these methods within the parameters of quality of medical images. Initially, an in-depth study on the characteristics of medical images would contribute to improve these methods to mitigate their limits and to optimize the results. Tests were done on IRM kind of medical images and the quality measurements have been done on the watermarked image to verify that this technique does not lead to a wrong diagnostic. The robustness of the watermarked images against attacks has been verified on the parameters of PSNR, SNR, MSE and MAE which the experimental result demonstrated that the proposed algorithm is good and robust in DWT than in spatial domain.
Ijri ece-01-01 joint data hiding and compression based on saliency and smvqIjripublishers Ijri
Global interconnect planning becomes a challenge as semiconductor technology continuously scales. Because of the increasing wire resistance and higher capacitive coupling in smaller features, the delay of global interconnects becomes large compared with the delay of a logic gate, introducing a huge performance gap that needs to be resolved A novel equalized global link architecture and driver– receiver co design flow are proposed for high-speed and low-energy on-chip communication by utilizing a continuous-time linear equalizer (CTLE). The proposed global link is analyzed using a linear system method, and the formula of CTLE eye opening is derived to provide high-level design guidelines and insights.
Compared with the separate driver–receiver design flow, over 50% energy reduction is observed.
Advanced Fuzzy Logic Based Image Watermarking Technique for Medical ImagesIJARIIT
The segmentation algorithms vary for the types of medical images such as MRI, CT, US, etc.The current study work
can further be extended to develop a GUI tool based approach for separating the ROI. Additionally, a new technique of
separating ROI form the original image that will be applicable for all type of medical images can be evolved. Separated ROI
can be stored with xmin, xmax, ymin and ymax value so that at the end of embedding process before transmitting watermarked
image, the segmented ROI can be attached with watermarked image. Any medical image watermarking approach will be
suitable, if we segment the ROI from medical image with the four values, then embedding of watermark can be done on whole
medical image, in this paper work on different scan like ctscan ,brain scan etc. our results significant high than other.
IRJET-Security Based Data Transfer and Privacy Storage through Watermark Dete...IRJET Journal
Gowtham.T ,Pradeep Kumar.G " Security Based Data Transfer and Privacy Storage through Watermark Detection ", International Research Journal of Engineering and Technology (IRJET), Volume2,issue-01 April 2015.e-ISSN:2395-0056, p-ISSN:2395-0072. www.irjet.net .published by Fast Track Publications
Abstract
Digital watermarking has been proposed as a technology to ensure copyright protection by embedding an imperceptible, yet detectable signal in visual multimedia content such as images or video. In every field key aspect is the security Privacy is a critical issue when the data owners outsource data storage or processing to a third party computing service. Several attempts has been made for increasing the security related works and avoidance of data loss. Existing system had attain its solution up to its level where it can be further able to attain the parameter refinement. In this paper improvising factor been made on the successive compressive sensing reconstruction part and Peak Signal-to-Noise Ratio (PSNR).Another consideration factor is to increase (CS) rate through de-emphasize the effect of predictive variables that become uncorrelated with the measurement data which eliminates the need of (CS) reconstruction.
Lightweight digital imaging and communications in medicine image encryption f...TELKOMNIKA JOURNAL
Diagnosis in healthcare systems relies heavily on the use of medical images. Images such as X-rays, ultrasounds, computed tomography (CT) scans, magnetic resonance imaging (MRIs), and other scans of the brain and other internal organs of patients include private and personal information. However, these images are vulnerable to unauthorized users who unlawfully use them for non-diagnostic reasons due to the lack of security in communication routes and the gaps in the storage systems of hospitals or medical centers. Image encryption is a prominent technique used to protect medical images from unauthorized access in addition to enhancing the security of communication networks. In this paper, researchers offer a lightweight cryptosystem for the secure encryption of medical images that makes use of the present block cipher and a five-dimensional chaotic map. More than 25 images from the open science framework (OSF) public database of patients with coronavirus disease 2019 (COVID-19) were used to evaluate the proposed system. DICOM stands for “digital imaging and communications in medicine”. The efficiency of the proposed system is proved in terms of adjacent pixels’ correlation analysis, National Institute of Standards and Technology (NIST) analysis, mean square error, information entropy, unified average changing intensity, peak-to-signal noise ratio, entropy, and structure similarity index image.
STAGE STAFFING SCHEME FOR COPYRIGHT PROTECTION IN MULTIMEDIAIJNSA Journal
Copyright protection has become a need in today’s world. To achieve a secure copyright protection we embedded some information in images and videos and that image or video is called copyright protected. The embedded information can’t be detected by human eye but some attacks and operations can tamper that information to breach protection. So in order to find a secure technique of copyright protection, we have analyzed image processing techniques i.e. Spatial Domain (Least Significant Bit (LSB)), Transform Domain (Discrete Cosine Transform (DCT)), Discrete Wavelet Transform (DWT) and there are numerous algorithm for watermarking using them. After having a good understanding of the same we have proposed a novel algorithm named as Stage Staffing Algorithm that generates results with high effectiveness, additionally we can use self extracted-watermark technique to increase the security and automate the process of watermark image. The proposed algorithm provides protection in three stages. We have implemented the algorithm and results of the simulations are shown. The various factors affecting spatial domain watermarking are also discussed.
Hybrid information security system via combination of compression, cryptogra...IJECEIAES
Today, the world is experiencing a new paradigm characterized by dynamism and rapid change due to revolutions that have gone through information and digital communication technologies, this raised many security and capacity concerns about information security transmitted via the Internet network. Cryptography and steganography are two of the most extensively that are used to ensure information security. Those techniques alone are not suitable for high security of information, so in this paper, we proposed a new system was proposed of hiding information within the image to optimize security and capacity. This system provides a sequence of steps by compressing the secret image using discrete wavelet transform (DWT) algorithm, then using the advanced encryption standard (AES) algorithm for encryption compressed data. The least significant bit (LSB) technique has been applied to hide the encrypted data. The results show that the proposed system is able to optimize the stego-image quality (PSNR value of 47.8 dB) and structural similarity index (SSIM value of 0.92). In addition, the results of the experiment proved that the combination of techniques maintains stego-image quality by 68%, improves system performance by 44%, and increases the size of secret data compared to using each technique alone. This study may contribute to solving the problem of the security and capacity of information when sent over the internet.
This paper proposes an encryption-based image watermarking scheme for medical images using a
customized quantization of wavelet coefficient and a crypto system based on the chaotic cipher of
Singular Value Decomposition (SVD). In order to spread the robustness of our algorithm and provide extra
security, an improved SVD-CHAOS embedding and extraction procedure has been used to scramble the
watermark logo in the preprocessing step of the proposed method. In the process of watermark embedding,
an R-level discrete wavelet transform was applied to the host image.
ENCRYPTION BASED WATERMARKING TECHNIQUE FOR SECURITY OF MEDICAL IMAGEijcsit
This paper proposes an encryption-based image watermarking scheme for medical images using a customized quantization of wavelet coefficient and a crypto system based on the chaotic cipher of Singular Value Decomposition (SVD). In order to spread the robustness of our algorithm and provide extra security, an improved SVD-CHAOS embedding and extraction procedure has been used to scramble the watermark logo in the preprocessing step of the proposed method. In the process of watermark embedding, an R-level discrete wavelet transform was applied to the host image. The high frequency wavelet coefficients are selected to carry these scrambled-watermarks by using adaptive quantization low bit modulation (LBM). The proposed image watermarking method endures entirety attacks and rightly extracts the hidden watermark without significant degradation in the image quality, Thus, when the Peak Signal to Noise Ratio (PSNR) and Normalized Correlation (NC) performance of the proposed algorithm is compared with other related techniques.
encryption based lsb steganography technique for digital images and text dataINFOGAIN PUBLICATION
Digital steganography is the art and science of hiding communications; a steganographic system thus embeds secret data in public cover media so as not to arouse an eavesdropper’s suspicion. A steganographic system has two main aspects: steganographic capacity and imperceptibility. However, these two characteristics are at odds with each other. Furthermore, it is quite difficult to increase the steganographic capacity and simultaneously maintain the imperceptibility of a steganographic system. Additionally, there are still very limited methods of Steganography to be used with communication protocols, which represent unconventional but promising Steganography mediums. Digital image Steganography, as a method of secret communication, aims to convey a large amount of secret data, relatively to the size of cover image, between communicating parties. Additionally, it aims to avoid the suspicion of non-communicating parties to this kind of communication. Thus, this research addresses and proposes some methods to improve these fundamental aspects of digital image Steganography. Hence, some characteristics and properties of digital images have been employed to increase the steganographic capacity and enhance the stego image quality (imperceptibility). Here, the research aim is identified based on the established definition of the research problem and motivations. Unlike encryption, Steganography hides the very existence of secret information rather than hiding its meaning only. Image based Steganography is the most common system used since digital images are widely used over the Internet and Web. However, the capacity is mostly limited and restricted by the size of cover images. In addition, there is a tradeoff between both steganographic capacity and stego image quality. Therefore, increasing steganographic capacity and enhancing stego image quality are still challenges, and this is exactly our research main aim. To get a high steganographic capacity, novel Steganography methods were proposed. The first method was based on using 8x8 non-overlapping blocks and quantization table for DCT with compression. Second method incorporates the DWT technique, with quality of any stego images as enhanced to get correct hidden image. And last LSB as to store images with Key type security built in.
Similar to Modelling, Conception and Simulation of a Digital Watermarking System based on Hyperbolic Geometry (20)
Courier management system project report.pdfKamal Acharya
It is now-a-days very important for the people to send or receive articles like imported furniture, electronic items, gifts, business goods and the like. People depend vastly on different transport systems which mostly use the manual way of receiving and delivering the articles. There is no way to track the articles till they are received and there is no way to let the customer know what happened in transit, once he booked some articles. In such a situation, we need a system which completely computerizes the cargo activities including time to time tracking of the articles sent. This need is fulfilled by Courier Management System software which is online software for the cargo management people that enables them to receive the goods from a source and send them to a required destination and track their status from time to time.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
TECHNICAL TRAINING MANUAL GENERAL FAMILIARIZATION COURSEDuvanRamosGarzon1
AIRCRAFT GENERAL
The Single Aisle is the most advanced family aircraft in service today, with fly-by-wire flight controls.
The A318, A319, A320 and A321 are twin-engine subsonic medium range aircraft.
The family offers a choice of engines
Vaccine management system project report documentation..pdfKamal Acharya
The Division of Vaccine and Immunization is facing increasing difficulty monitoring vaccines and other commodities distribution once they have been distributed from the national stores. With the introduction of new vaccines, more challenges have been anticipated with this additions posing serious threat to the already over strained vaccine supply chain system in Kenya.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Modelling, Conception and Simulation of a Digital Watermarking System based on Hyperbolic Geometry
1. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
DOI: 10.5121/sipij.2021.12401 1
MODELLING, CONCEPTION AND SIMULATION OF A
DIGITAL WATERMARKING SYSTEM BASED ON
HYPERBOLIC GEOMETRY
Coulibaly Cheick Yacouba Rachid and Tiendrebeogo B. Telesphore
Department of Mathematics and Computer Science, Nazi Boni University, Bobo-
Dioulasso, Burkina Faso
ABSTRACT
The digital revolution has increased the production and exchange of high-value documents between
institutions, businesses and the general public. In order to secure these exchanges, it is essential to
guarantee the authenticity, integrity and ownership of these documents. Digital watermarking is a possible
solution to this challenge as it has already been used for copyright protection, source tracking and video
authentication. It also provides integrity protection, which is useful for many types of documents (official
documents, medical images). In this paper, we propose a new watermarking solution applicable to images
and based on the hyperbolic geometry. Our new solution is based on existing work in the field of digital
watermarking.
KEYWORDS
Digital watermarking, Harris point of interest, Poincaré disk, hyper-catadioptric projection, stereographic
projection
1. INTRODUCTION
Securing digital documents and intellectual property is a real challenge in this era of increasing
file transfer over the Internet [1].These data are easily hacked and given their value it is really
important to have solutions to protect them. These solutions must protect against interception,
duplication, falsification and corruption. One of these solutions is digital watermarking. Digital
watermarking consists in inserting in a digital document a visible or invisible mark, containing
information resistant to attacks trying to modify the mark [2]. There are several algorithms that
try to find a compromise between robustness and invisibility. However, none of them fully satisfy
both properties. They are limited and are intended to be used on very specific documents. To
date, there is no universal model that can be adapted to any type of document. Hyperbolic
geometry and its associates such as hypercatadiotry [3, p. 2012] and the Poincaré disk have
many properties that we exploit in this work. Our objective is to propose an image watermarking
technique that will complement existing cryptographic techniques for image delivery. In addition,
we use new image processing techniques [4] hat allow us to obtain more robustness and
imperceptibility. Our paper is structured as follows: we first present related work on digital
watermarking using geometric techniques. We then give an overview of the principles and
applications of digital watermarking, and describe our model. We then discuss some notions of
hyperbolic geometry, explain the Poincaré disk model, and present the principles of cryptography
in the context of hyperbolic tilings. Finally, we present our digital watermarking technique, and
provide a formal analysis of the robustness and perceptuality of our solution.
2. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
2
2. RELATED WORK
The increase in digital exchanges has favored the illicit exploitation of the contents of digital
documents. To overcome this problem, researchers have found solutions that involve digital
watermarking. The common principle of the various solutions consists in marking the work or the
object to be protected with an imperceptible signature which allows the identification of the
owner while remaining resistant to the attacks.
The different watermarking systems proposed in the literature are classified in one of the three
categories corresponding to their field of application which are: the spatial domain [5],the
frequency domain [5] and those which act in a hybrid domain [6]. the systems that operate
directly on the image are generally vulnerable to attacks, especially geometric ones, even if they
are simple to set up. For digital watermarking, they use pairs or blocks of pixels to which they
slightly modify and which respect previously established watermarking rules. Any geometric
transformation on the image mark often makes extraction impossible. Methods that operate in a
transformed plane (DCT, wavelets, Fourier, etc.) allow us to build watermarking systems that are
robust against attacks of a geometric nature (rotation, windowing, etc.), or signal processing
(compression, filtering, etc.).However, spatial techniques remain by far the fastest and simplest
modes of attack compared to techniques that operate in the transform plane[7]. Compared to the
use of cryptography to secure the exchanges, the digital watermarking offers to the stored
documents or in transit an authentication and a persistent integrity. Image watermarking can
therefore be a solution to secure image transfer. The objective of watermarking is to insert
information into the image in an invisible and indelible way. The insertion of the message can be
done in the spatial or frequency domain, or in a combination of the two domains [8] [9, p. 17].
Several existing techniques insert marks into various spatial primitives, such as the distance
between a vertex and a mesh center of gravity [10, p. 16], the local triangulation density [11, p.
12], or the relative position of a vertex with respect to its neighbors [12, p. 15] with the exception
of methods based on statistical shape descriptors [13, p. 16], these techniques are vulnerable to
attacks on connectivity. To address this vulnerability, some algorithms propose to do a
resampling preprocessing on the mesh to be tested before extraction [14, p. 08]. Another class of
algorithms consists of decomposing the mesh in the spectral domain, and then inserting the mark
into various frequency components depending on the intended application [15, p. 15] [16, p. 15].
These methods generally offer better inaudibility and also better robustness to geometric attacks.
Nevertheless, the fragility against connectivity attacks still exists. For example, Laplacian
spectral analysis of a 3D mesh is sensitive to changes in connectivity [15, p. 15]; iterative edge
decimation to construct a multi-resolution representation also depends on connectivity [17, p.
15]; furthermore, most wavelet analysis tools for a 3D mesh require that the mesh to be
decomposed be at least semi regular [18, p. 15]. In this article, we propose a new digital
watermarking technique that allows the creation of an imperceptible and attack-resistant
signature. Our technique is based on the projective geometric transformation of the image in
hyperbolic space after the extraction of the points of interest that will be used for the marking.
The identification of the interest points is similar to the principle of Harris [19].
3. WATERMARKING: TECHNIQUES AND PRINCIPLES
For better comprehension, we introduce watermarking techniques and then provide background
information on the principles of watermarking for the proposed approach, and we will present
some of its applications. We start our work by mentioning some of its applications, specifically
the securing of documents. We focus on discussing the principles of cryptography in light of the
purpose of watermarking.
3. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
3
3.1. Watermarking for Document Security
Figure 1: General representation of communication[20]
Consider [20] the illustration in Figure 1 where a sender named Alice transfers a document to a
receiver, named Bob. During this transmission, a third party, Charlie, may attempt to extract or
modify the data in the document. The document can thus be intercepted and its integrity can be
attacked. Figure 2 is a diagram representing key terminology used in document security, where
the primary term is cryptology, which is the science of information protection. Within
cryptology, the three main methods used are cryptography, steganography and watermarking.
These methods differ in their algorithms, the way they manipulate information, and the length of
time the information is protected. For example, the Figure 3 illustrates a weakness of processes
that use cryptography but a document is vulnerable to attack after decryption. However, we can
notice some points of similarity between these three methods as shown in Figure 4.
Figure 2: Security and safety methods diagram[20]
4. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
4
Figure 3: Encrypted document safety duration[20]
In the following, we will focus on digital documents. In general, cryptography is used to protect
the information of a document during its transmission on a network. It makes the document
unreadable from the moment it is encrypted until its final decryption. This is possible thanks to
the use of keys. Only the owners of the key(s) have access to the encrypted information.
This method has proven to be effective in protecting information during its transmission between
authorized parties. It is commonly used to prevent the viewing of certain programs on private
television channels by non-paying customers.
The principle of cryptography is to scramble data for security purposes during encryption and
decryption. To protect information "permanently" (i.e., beyond the transmission period),
steganography is often used.
Steganography is defined as the art of hiding information in a medium. There are two approaches
to steganography:
The first approach is to hide the information to be protected inside another document. This is
called "information hiding" or "data hiding". The principle of this approach is similar to that of
cryptography: information is inserted or extracted from the medium by means of codes generated
by keys. However, unlike cryptography, the protected information is not visible in the document.
The second approach to steganography is to embed a signature in a document to protect the
document from being compromised. This approach is known as "watermarking". Our work
focuses on this approach to steganography. Figure 4 provides a comparative illustration of the
features of watermarking versus other document security techniques.
5. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
5
Figure 4: Relations with other safety domain
Watermarking techniques can modify documents in two different approaches. The semantic
watermarking modifies the content of the document. The syntactic watermarking modifies the
document storage format. In both cases, the changes applied to the document are not intended to
affect its usability. On the other hand, the attacks on the documents aim at removing or
modifying the mark left by the watermarking algorithm. Indeed, according to the mode of attack,
the quality of the mark can be reduced (case of strong algorithms) or can be significantly
modified (case of weak algorithms). In addition, in information technology there are multiple
applications of watermarking, such as guaranteeing the integrity of video streams, identifying the
owner, proof of ownership, tracking transactions, authentication, copy control, insertion of
metadata.
4. PRINCIPLES OF WATERMARKING
We consider the following notations in the description of the various stages of the watermarking
process: D for any document and 0
D
for the original document. Any digital document is defined
as a series of binaries: {0,1}
D .A document is said to be of good quality during a transmission
if and only if:
* *
:{0,1} {0,1} {0,1}
q
F →
(0.1)
Where
q
F
is a quality function.
6. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
6
Thus, two documents are of equal quality if and only if :
'
( , ) 1
q
F D D =
(0.2)
q
F
can be considered as criteria of psychological perception.
As for the watermarking model, let's consider the following model:
Consider M and D as a pair of algorithms, denoted by : ( , )
D M , with M as the marking
algorithm and D as the document algorithm.
The document watermarking consists of the following:
* *
:{1,0} {0,1}* {0,1}
M
F →
(0.3)
Where M
F
is the watermarking function associated with
( , ) '
M D I D
= (0.4)
Where
'
D is the watermarked document and I is the information inserted in the original
document (called additional information). In the remainder of this paper, we focus on documents
representing digital images.
The syntactic model (consisting of insertion by addition), also referred to as the additive scheme
in watermarking, is illustrated in Figure 5: a signature is added to a digital image. We study the
case where the signature is generated in a pseudo-random way, on the basis of a key K . The
signature is then transformed into a message before being added to the coefficients of the image.
The coefficients of the image arise from the image itself or are the result of a space representation
change.
Figure 5:The additive Scheme for the signature insertion.
7. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
7
he semantic model (consisting of insertion by substitution), also referred as the substitute scheme
of watermarking, is illustrated in Figure 6: certain components of the image are replaced by the
signature. Such a signature is then initially obtained by applying a constraint (for example a
relation of order, a criterion of similarity, a geometrical property of the image) to the components
according to the message to be inserted.
Figure 6: Substitute Scheme of the signature insertion.
With regards to watermarking detection, let us consider the following model:
Let D
F be the detection function that allows for the recognition of the original image. This
function is defined as follows:
* *
{0,1} {0,1} {0,1}
D
F = →
(0.5)
Let
'
D and
'
I respectively be a suspicious document and any other (supposedly additional)
information, then we can state that a document is authentic (original document), if and only if:
' '
( , ) 1
D
F D I =
(0.6)
where
'
I I
= or
'
I I
. For the sender or the addressee, I will always be equal to
'
I (
'
I I
= )
Properties1 :
•
{ , }, ( ( , ), ) 1
D M
D I F F D I I
=
. These properties (in total) are called “Adjustment”.
•
{ , }, ( , ( , )) 1
q M
D I F D F D I
=
. These properties (in total) are called “Inaudibility”.
Figure 7 illustrates the specific case of a simplified detection technique that will be referred to in
this paper in the axis of the substitution scheme. In practice, we intend to use a hybrid technique,
which involves substitution and addition at the same time. However, with detection based on an
additive scheme and when it is about blind technique, we could use statistical methods (where the
original image is not available for detection). In this case, a measure of correlation can be made
for example.
8. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
8
Figure 7:Detection and reading of the signature
5. HARRIS POINT OF INTEREST
The Harris point detector is a common technique to detect points of interest in an image.
The points of interest have been described in order to reduce the maximum of information of an
image in a few points.
The point of interest is found thanks to the Moravecdetector which uses the autocorrelation
function of the image to measure the intensity differences between a patch and windows shifted
in several directions.
The article [21] explains in more detail the points of interest of Harris.
6. HYPERBOLIC GEOMETRY MODELS
In this section, we first present the properties of hyperbolic geometry, and then we illustrate the
steps of hyperbolic tiling construction, which are essential for the creation of our mark.
6.1. Properties of Hyperbolic Geometry
The basis of hyperbolic geometric is driven by Euclid’s five postulates[22, p. 50]. Thus,
hyperbolic geometry must be understood in light of Euclidian geometry. The basic elements of
Euclidian geometry are: the point, the straight line, the right angle, the intersection and the
congruence among angles.The five postulates are then as follows:
The straight-line postulate: a straight-line segment can be drawn joining any two points;
The continuation postulate: any straight-line segment can be extended indefinitely in a straight
line;
The circle postulate: given any straight-line segment, a circle can be drawn having this segment
as radius and one of its end-points as center;
9. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
9
The equal right angles postulate: all right angles are equal;
The parallel postulate: if two lines are drawn which intersect a third in such a way that the sum
of the inner angles on one side is less than two right angles, then the two lines inevitably must
intersect each other on that side if extended far enough.
Hyperbolic geometry, also referred to as Lobachevsky geometry, disagrees with Euclid's fifth
postulate and bases itself on the findings of Legendre[23, p. 896].Our work focuses on the
hyperbolic space around the dimension 2
n .The hyperbolic plan being of course the hyperbolic
space of dimension (i.e., size) 2. The hyperbolic space is a homeomorphous metric space (E, d) in
the Euclidean space
n
R .This is interesting because of the size of its group of isometries, which is
of dimension ( 1) / 2
n n + ; only the Euclidean and spheric spaces are as good. Although there are
many models of this metric space[24, p. 04], we are particularly interested in the model of the
half-hyperboloid ( , )
n
d
.
Figure 8: Hyperboloide
Figure 8 illustrates our hyperbolic geometric model where angles and geodesic are deformed. It
remains nonetheless useful in describing the isometries of the hyperbolic space. This
representation also plays a crucial role in the construction of tilings in following sections. Let us
note q the Lorentzian quadratic form on the vectorial space
n
V = R and b the associated
bilinear form. For 0
( , )
n
v x x
=
and 0
( , )
n
w y y
=
we have: 0 0 1 1
( , ) ... n n
b v w x y x y x y
= − + + +
and
( ) ( , )
q v b v v
= .
We note n
C
as the cone of the future of this Lorentzian form and n
H
as the top of the
hyperboloid:
1
0
1
0
/ ( ) 0 0
/ ( ) 1 0
n
n
n
n
C v q v andx
H v q v andx
+
+
=
= = −
R
R (0.7)
We still define the distance of two points v and '
v of n
H
as:
10. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
10
( , ') log([ , ', , '])
d v v p p v v
=
(0.8)
Where p , '
p are the points of the edge of the cone n
C which are on the same right as v and
'
v and where [p; p'; v; v'] is the bi-report of these four aligned points. Given such a model of the
hyperboloid, it is easy to describe the group of the isometries of the hyperbolic space. Indeed, the
regular hyperbolic tiling is a part of the group of isometries. By analogy with the Euclidian
geometry, we define the angle in hyperbolic geometry. We verify that, for the corresponding ball,
it coincides with the Euclidian angle.
The angle between two geodesic paths c1 and c2 of the hyperbolic space, which arise from the
same point 0 1 2
(0) (0)
x c c
= = is the real [0, ]
defined by the formula of the rope:
1 2
0
1
2 sin / 2 lim ( ( ), ( ))
x
d c t c t
t
→
=
(0.9)
This definition does not depend on a specific model. As each of the models are included in a
Euclidean space, we can differentiate the hyperbolic angle from the Euclidean angle.
6.2. Hyperbolic Tiling
In this section, we begin with Poincare's construction of periodic tiling for the hyperbolic plan.
This is followed by an overview of the hyperbolic analogues of the theorems of Bieberbach. We
begin with the dimension 2. Finally, we present the construction of non-periodic tiling, by means
of a single convex tile, for the hyperbolic plan. Regarding the construction of periodic tiling for
the hyperbolic plan, let us begin by describing in full the simplest construction of periodic
pavements for the hyperbolic plan as illustrated in Figure 9.
Figure 9 : A convex polygon in both projective and conform balls
As shown in Figure 10, this mechanism can infinitely tile the plan hyperbolic
11. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
11
Figure 10: The hyperbolic tiling in an infinity of the regular pentagons in the projective and conform balls
6.3. PoincaréDisk Model
The Poincarédisk is the unit disk called D which is the whole universe. Its border consists of unit
circles and is infinite. Points are represented by points; however, a Euclidian straight line
becomes the arc of a circle, which we call geodesic. One property of the Poincare model can be
misleading and that is distances are not preserved. If we observe the Poincare model from an
outside perspective, distance appears smaller than in reality (i.e. inside the plane). Because the
model is a representation of the hyperbolic plane in the Euclidean plane. In fact, the points which
seem the closest to the unit circle are, in reality, far away from the latter. The hyperbolic plane
has a boundary circle at infinity represented in the Poincare unit disk model (i.e the open unit
disk) by a circle of radius 1 and centered on the origin O. The open unit disk around $P_0$ is the
set of points whose complex modulus is less than 1:
1
w
[25, p. 12].
With
2 2
Re Im
( ) ( )
w W W
= +
(0.10)
It is important to remember certain hyperbolic tiling properties when considering Poincaré disk
model.
An elementary property of Euclidean space is the impossibility of creating more than two half-
planes without their crossing. Our integration is based on the geometric property of the
hyperbolic plane which allows the creation of areas called half-planes. As explained in[26], in the
hyperbolic plane, we can create $n$ of pairwise disjoint half-spaces, whatever the value of n .
In the Poincaré disk model, the distances between any two points M and N are given by
curves minimizing the distance between these two points and are called hyperbolic plane
geodesics. To calculate the length of a geodesic between two points M and N and thus obtain
their hyperbolic distance H
d
, we use the Poincaré metric which is an isometric invariant :
( , ) argcosh(1 2 )
H
d M N = +
(0.11)
With
12. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
12
2
2 2
(1 )(1 )
M N
M N
−
=
− −
(0.12)
For more details on the Poincaré metric, we refer the reader to the proof [27, p. 06]
7. BASIC PRINCIPLES
7.1. Our use of the Central Catadioptric System Geometry
Our watermarking solution, combines hyperbolic mirrors with the Poincaré disk model and can
be used in conventional cameras.It functions as a catadioptricsensor which is used by the majority
of systems that are based on omnidirectional vision. The constraint on the central point called C
O
(corresponding to the second focal spot of the mirror and the optical center of the Poincaré)
implies that the straight lines surrounding any point of the space belonging to the original image,
which we wish to watermark along with its projection onto the hyperbolic mirror, cross a unique
point on the Poincaré disk[28, p. 05].Under this constraint, every pixel on the image plan that
belongs to the Poincaré disk measures the intensity of the light reflected by the optical beam onto
the hyperbolic mirror passing through the central point. This is the first focus/focal point of the
optical mirror (called O) in a particular direction. The coordinates of its impact point on the
Poincaré disk can be determined as explained in the remainder. Such an approach is interesting as
it generates a correct geometric perspective that allows for a simplification of the projection
models and thus a simplification of the theoretical and practical image processing. In fact, tools
developed within the context of the visions perspective are then often adapted tothe set of the
central sensors. However, this condition is satisfied only for very particular reflector surfaces.
Baker and Nayar in [29, p. 99] determined the class of all the central catadioptric. In this case, we
are only concerned with the hyper-catadioptric system (i.e., the catadioptric system based on
hyperbolic mirrors).
7.2. Our Hyper-Catadioptric Model for Watermarking
Let us consider our catadioptric system obtained by combining an hyperboloid mirror with a lens
in the Poincaré disk form of focal e
f , the optical center of which is merged with the second
foyer of the hyperbolic mirror, which we called C
O
.
Our approach for building the hyper-catadioptric image on the Poincaré disk is illustrated in
Figure 11
13. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
13
Figure 11:Building the Hyper-Catadiotric image on the Poincaré disk
The approach shown in Figure 11 uses a subset of original image points that we wish to
watermark, called ( , , )
P X Y Z (considered to be the beginning of a mark element). Then, we first
proceed to a hyper-catadioptric projection on the hyperbolic mirror to obtain points called $
( , , )
m m m m
P X Y Z
, we then make a stereographic projection onto the Poincaré disk of the various
points defined by ( , )
p x y on the mirror.
7.3. Image Coordinates Computing
It has been proved [30, p. 02], and we agree, that the polar equation of our hyperbolic mirror is:
1 cos( )
p
p
e
=
+ (0.13)
In fact, the reduced Cartesian equation of hyperbole is equal to:
2 2
2 2
X Y
a b
−
(0.14)
Let us put
2 2
c a b
= + corresponding to focal half-length. Thus
c
e
a
=
and
2
b
p
a
=
correspond
respectively to the eccentricity and parameter given in the polar equation 16.
14. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
14
Let us consider the projection case. Let the 3D point ( , , )T
p X Y Z
= be projected onto the
hyperbolic mirror at the point
( , , )
m m m m
p X Y Z
= (hyper-catadioptric projection) where:
2 2 2
( , , ) ( , , )
T T
m m m
p
X Y Z X Y Z
X Y Z
=
+ + (0.15)
This point is then projected onto the image plan associated to the Poincaré disk at the point
( , )T
P z y
= by means of the following projection matrices:
0 0 1 0 0 0
0 0 0 1 0 0
0 0 1 0 0 1
1
m
m
m
X
x fe
Y
y fe
Z
z d
Where d is distance between the optical foyer of the Poincaré disk and the first foyer of the
hyperbolic mirror.
Thus, to respect the unique point of view,
2
2
1
e p
d
e
=
− (the Poincaré disk being situated in the
hyperboloid second optical foyer) and as cos( ) / | |
Z P
= , we end in the following relation:
2 2
2 2 2 2 2 2
2 2
1 1
1 1
( , ) ( , )
2 2
1 1
e e
feX feY
e e
p x y
e e
X Y Z Z X Y Z Z
e e
− −
+ +
=
+ + + + + +
+ + (0.16)
8. PROCESS OF THE MARK'S CREATION
For each point of interest of Harris we make a hyper-catadioptric projection on a hyperbolic
mirror then we calculate the coordinates of their images on the hyperboloid. Then we make a
stereographic projection (the half hyperboloid) in the Poincaré disk then we calculate the
coordinates of the different points in the Poincaré disk. The algorithm 3 describes in a way the
process of creation of the mark
15. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
15
Figure 12:Detection and extraction of Harris points of interest from an image
9. DIGITAL WATERMARKING AND MARK EXTRACTION PROCESS
To do the digital watermarking, we used a hybrid technique, the Discrete Cosine Transform
(DCT) combined with the Wavelet Transform (DWT).
9.1. Digital Watermarking Process
The watermarking by the DWT technique combined with DCT is described by the following
steps[31].
Step 1: Apply DWT to decompose the cover host image into four non-overlapping multi-
resolution sub-bands: LL1, HL1, LH1, and HH1.
Step 2: Apply DWT again to sub-band HL1 to get four smaller sub-bands and choose the HL2
sub-band Or, apply DWT to sub-band HH1 to get four smaller and choose the HH2 sub-band
Step 3: Divide the sub-band HL2 (or HH2) into 4 x 4 blocks.
16. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
16
Step 4: Apply DCT to each block in the chosen sub-band (HL2 or HH2).
Step 5: Re-formulate the grey-scale watermark image into a vector of zeros and ones.
Step 6: Generate two uncorrelated pseudorandom sequences. One sequence is used to embed the
watermark bit 0 0
( )
PN and the other sequence is sued to embed the watermark bit 1 1
( )
PN .
Number of elements in each of the two pseudorandom sequences must be equal to the number of
mid-band elements of the DCT-transformed DWT sub-bands.
Step 7: Embed the two pseudorandom sequences, 0
( )
PN and 1
( )
PN , with a gain factor , in
the DCT transformed 4x4 blocks of the selected DWT sub-bands of the host image. Embedding
is not applied to all coefficients of the DCT block, but only to the mid-band DCT coefficients. If
we donate X as the matrix of the midband coefficients of the DCT transformed block, then
embedding is done as follows:
If the watermark bit is 0 then
0
*
X X PN
= +
otherwise
if the watermark bit is 1 then, 1
*
X X PN
= +
Step 8: Apply inverse DCT (IDCT) to each block after its mid-band coefficients have been
modified to embed the watermark bits as described in the previous step.
Step 9: Apply the inverse DWT (IDWT) on the DWT transformed image, including the modified
sub-band, to produce the watermarked host image.
9.2. Process of Mark Extraction
the procedure of extraction of the mark is described in the following steps [31]:
Step 1: Apply DWT to decompose the watermarked image into four non-overlapping multi-
resolution subbands: LL1, HL1, LH1, and HH1.
Step 2: Apply DWT to HL1 to get four smaller subbands,and choose the sub-band HL2 Or, apply
DWT to the HH1 sub-band to get four smaller sub-bands, and choose the HH2 sub-band.
Step 3: Divide the sub-ban HL2 (or HH2) into 4*4 blocks.
Step 4: Apply DCT to each block in the chosen sub-band (HL2 or HH2), and extract the mid-
band coefficients of each DCT transformed block.
Step 5: Regenerate the two pseudorandom sequences 0
PN
and 1
PN
using the same seed used
in the watermark embedding procedure.
Step 6: For each block in the sub-band HL2 (or HH2), calculate the correlation between the mid-
band coefficients and the two generated pseudorandom sequences ( 0
PN
and 1
PN
). If the
17. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
17
correlation with the 0
PN was higher than the correlation with 1
PN , then the extracted
watermark bit is considered 0, otherwise the extracted watermark is considered 1.
Step 7: Reconstruct the watermark using the extracted watermark bits, and compute the
similarity between the original and extracted watermarks.
9.3. Performance Evaluation
For performance evaluation we use the PSNR, NCC and IF.
• PSNR [32] is an image quality measure used to find of the quality of the cover image
before and after the message is inserted. To determine the PSNR, we must first obtain the
value of MSE. The higher the PSNR value, the better the quality of the watermarked
image and the more similar it is to the cover image. The PSNR value can be determined
using the equation below.
2
1 1
1
( )
m n
ij ij
i j
MSE x y
mn = =
= −
(0.17)
m number of rows in cover image
n number of columns in cover image
ij
x
pixel value from cover image
ij
y
pixel value from stego image
2
10
2
10log [max(max( ),max( ))]
| |
x y
x y
+ (0.18)
• NCC [32] (normalized correlation coefficient) is a measure of the reliability of the result
after mark extraction. If the value of NCC is close to 1, then the similarity is also closer
to the image of the original message.
1 1
1 1 1 1
( , ) '( , )
( , ) '( , )
m n
i j
m n m n
i j i j
w i j xw i j
NCC
w i j w i j
= =
= = = =
=
(0.19)
Where
( , )
w i j coordinates of the pixel value of the cover image
'( , )
w i j coordinates of the pixel value of the mark
The Figure 13 illustrates the digital watermarking, the extraction of the marks as well as the
calculation of the performance measurement.
18. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
18
Figure 13:DWT and DCT Watermarking
10. CONCLUSION AND FUTURE WORK
In this paper, we have proposed a new digital watermarking technique based on the properties of
projective hyperbolic geometry. Our solution is based on a hybrid watermarking technique
applied to an image and integrates to this image a model resulting from the use of a hyperbolic
mirror and a Poincaré disk sensor. We have formally described our model and realized it. Our
future work will consist of implementing all aspects of our solution and performing a
performance analysis between our solution and existing ones.
REFERENCES
[1] B. Macq, P. R. Alface, and M. Montanola, ‘Applicability of Watermarking for Intellectual Property
Rights Protection in a 3D Printing Scenario’, in 20th International Conference on 3D Web
Technology, 2015, pp. 89–95.
[2] Z. Yuefeng and L. Li, ‘Digital Image Watermarking Algorithms Based on Dual Transform Domain
and Self-Recovery’, Int. J. Smart Sens. Intell. Syst., vol. 8, no. 1, pp. 199–219, 2015.
[3] F. Comby, C. C. de Kerleau, and O. Strauss, ‘Étalonnage de camérascatadioptriqueshyperboloïdes’,
p. 14.
[4] M. Kaur and V. K. Attri, ‘A Survey on Digital Image Watermarking and Its Techniques’, Int. J.
Signal Process. Image Process. Pattern Recognit., vol. 8, no. 5, pp. 145–150, 2015.
[5] Y. U., S. J.P., S. D., and S. P.K., ‘Different Watermarking Techniques & its Applications: A Review’,
Int. J. Sci. Eng. Res., vol. 5, no. 4, pp. 1288–1294, 2014.
[6] L. Saini and V. Shrivastava, ‘Analysis of Attacks on Hybrid DWT-DCT Algorithm for Digital Image
Watermarking With MATLAB’, Jul. 2014.
[7] G. Chawla, R. Saini, and R. Y. Kamaldeep, ‘Classification of Watermarking Based upon Various
Parameters’, Int. J. Comput. Appl. Inf. Technol., vol. 1, no. 2, pp. 16–19, 2012.
[8] K. D. Nagpal and D. S. Dabhade, ‘Performance Comparison of Two Hybrid Techniques for Image
Steganography in Frequency Domain’, Int. J. Innov. Res. Comput. Commun. Eng., vol. 3, no. 6, pp.
68–74, 2015.
[9] M. Ghazvini, E. M. Hachrood, and M. Mirzadi, ‘An Improved Image Watermarking Method in
Frequency Domain’, J. Appl. Secur. Res., vol. 12, no. 2, pp. 260–275, 2017.
[10] Y. B. Amar, I. Trabelsi, N. Dey, and M. S. Bouhlel, ‘Euclidean Distance Distortion Based Robust and
Blind Mesh Watermarking’, Int. J. Interact. Multimed. Artif. Intell., vol. 4, no. 2, pp. 46–51, 2016.
[11] O. Hosam, W. M. Sheta, B. A. B. Youssef, and M. A. Abdou, ‘Public Watermarking Scheme for 3D
Laser Scanned Archeological Models’, in IEEE Symposium on Computers and Communications,
2012, pp. 382–389.
19. Signal & Image Processing: An International Journal (SIPIJ) Vol.12, No.4, August 2021
19
[12] L. Gil-Je and Y. Kee–Young, ‘An Improved Double Image Digital Watermarking Scheme Using the
Position Property’, J. Multimed. Tools Appl., vol. 74, no. 17, pp. 7261–7283, 2015.
[13] B. Saliha and L. Slimane, ‘Efficient Descriptor for Full and Partial Shape Matching’, J. Multimed.
Tools Appl., vol. 75, no. 6, pp. 2989–3011, 2016.
[14] K. Wang, G. Lavoué, F. Denis, and A. Baskurt, ‘Hierarchical Watermarking of Semiregular Meshes
Based on Wavelet Transform’, IEEE Trans. Inf. FORENSICS Secur., vol. 3, no. 4, pp. 620–634,
2008.
[15] S. S. Sujatha, ‘Blind Wavelet Based Watermarking Technique for Image Authentication’, Int. J. Adv.
Res. Comput. Sci., vol. 6, no. 1, pp. 127–131, 2015.
[16] Y. H. Wankhede and S. D. Mali, ‘Data Hiding Technique Using Audio Watermarking’, Int. J. Eng.
Comput. Sci., vol. 4, no. 3, pp. 11109–11112, 2015.
[17] N. Aherrahrou and H. Tairi, ‘PDE based scheme for multi-modal medical image watermarking’, Int.
J. Biomed. Eng., vol. 14, pp. 108–126, 2015.
[18] L. Basyoni, H. I. Saleh, and M. B. Abdelhalim, ‘Enhanced Watermarking Scheme for 3D Mesh
Models’, in 7th International Conference on Information Technology, 2015, pp. 612–619.
[19] W. Peng, X. Hongling, L. Wenlin, and S. Wenlong, ‘Harris Scale Invariant Corner Detection
Algorithm Based on the Significant Region’, Int. J. Signal Process. Image Process. Pattern Recognit.,
vol. 9, no. 3, pp. 413–420, 2016.
[20] ‘Robust Formal Watermarking Model Based on the Hyperbolic Geometry for Image Security’, Int. J.
Recent Technol. Eng., vol. 9, no. 3, pp. 617–629, Sep. 2020, doi: 10.35940/ijrte.C4651.099320.
[21] ‘(PDF) An Analysis and Implementation of the Harris Corner Detector’.
https://www.researchgate.net/publication/328050891_An_Analysis_and_Implementation_of_the_Har
ris_Corner_Detector (accessed Jun. 16, 2021).
[22] D. Hilbert, ‘Foundations of Geometry’, PhD Thesis, Univerty of Göttingen, 1950.
[23] M. P., ‘Premiers principes de la MétagéométrieouGéométriegénérale’, Rev. Néo-Scolastique 3ème
Anné, vol. 1896, no. 10, pp. 143–170, 1896.
[24] T. S., Hyperbolic geometry: history, models, and axioms. 2004.
[25] D. T. Tiendrebeogo, ‘CheickAmedDiloma Gabriel Traore’, p. 65.
[26] M. A., Unafficheurgénériqued’arbres à l’aide de la géométriehyperbolique. 2000.
[27] A. F. Beardon and D. Minda, ‘The hyperbolic metric and geometric function theory’, 2006.
[28] S. L., ‘A catadioptric sensor with multiple viewpoints’, Robot. Auton. Syst., vol. 51, pp. 667–674,
2005.
[29] B. S. and N. S. K., ‘A theory of single-viewpoint catadioptric image formation’, Int. J. Comput. Vis.,
vol. 35, no. 2, pp. 1–22, 1999.
[30] B. D. A. et al., Geometry. 2002. [Online]. Available: http://www.cut-the-
knot.org/ctk/Parabola.shtml#Brannan
[31] ‘(PDF) Combined DWT-DCT digital image watermarking’.
https://www.researchgate.net/publication/26621646_Combined_DWT-
DCT_digital_image_watermarking?enrichId=rgreq-9434c057cfb4d8b92186b0e733e2c214-
XXX&enrichSource=Y292ZXJQYWdlOzI2NjIxNjQ2O0FTOjE1MzIyNDIxMjM4OTg5MkAxNDE
zNTQyOTA3OTQy&el=1_x_3&_esc=publicationCoverPdf (accessed Jul. 07, 2021).
[32] ‘An improved secure image hiding technique using PN-sequence based on DCT-OTP | IEEE
Conference Publication | IEEE Xplore’. https://ieeexplore.ieee.org/abstract/document/8276336
(accessed Jun. 16, 2021).
.
AUTHORS
Cheick Yacouba Rachid Coulibaly I have a master’s degree from Nazi Boni University
in information systems and decision support systems. My interest research topic is
image watermarking for decision supportand geolocation system .
Telesphore Tiendrebeogo PhD and overlay network and assistant professor at Nazi
Boni University. I have a master's degree in multimedia andreal time system. My
current research is on big data and image watermarking.