Bit-plane Complexity Segmentation Research Articles

Secret data sharing through coverless video steganography based on bit plane segmentation

Recently information hiding is acquiring significance with the rising multimedia content over the web. Coverless steganography has been perceived as quite possibly the most solid way to deal with moving classified information and has turned into a research problem area. Considering video as a transporter, coverless steganography is expanding prominently because of its greater number of features than other transporters like text and images. Usually, the existing scheme hides confidential information based on single-frame features in the video. A secret data sharing through coverless video steganography technique based on bit-plane segmentation has been proposed. After extracting frames from the video, each frame is split into multiple bit-planes using BPCS(Bit-plane complexity segmentation). The hash sequences are obtained from these bit-planes by calculating the mean values of corresponding bit-plane sub-blocks. A retrieval database is constructed, including the relation between obtained hash sequences and bit-plane features. To begin with, the sender altered the secret data into a piece stream and divided it into equivalent lengths. The related retrieval information matching the fragmented secret information is transmitted to the recipient over the insecure channel. The experimental results show that the proposed technique achieves better robustness to various attacks, larger capacity, less time cost for extracting hash sequences, and a higher concealing success rate than existing coverless video steganography techniques.

Steganography: Combination of Least Significant Bit (LSB) and Bit-Plane Complexity Segmentation (BPCS) Methods for Hiding Massage on Image and Audio

Steganography: Combination of Least Significant Bit (LSB) and Bit-Plane Complexity Segmentation (BPCS) Methods for Hiding Massage on Image and Audio

STEGANOGRAPHY IMPLEMENTATION OF INSERTION OF CONFIDENTIAL DATA ON DIGITAL IMAGE MEDIA

Sending confidential messages through the internet is very vulnerable to theft, many irresponsible parties try to get information from these messages for personal gain. So that the secret message can only be read and understood by certain parties, a way is needed to hide the message, namely with steganography. Steganography is a technique to hide messages in media such as text, images, audio and video so that the media that is inserted looks like normal. Bit-Plane Complexity Segmentation (BPCS) is a steganographic method used in message embedding. This method has a large message insertion capacity. The insertion is done by replacing the complex bit-pane with a secret message block. In this final project, a software is developed that applies the steganography method with the BPCS method on uncompressed images. In addition, tests were conducted to analyze the suitability of the BPCS method on uncompressed images. The final result obtained is a software capable of handling message insertion. The conclusion of this research is that the BPCS algorithm is proven to be able to solve the problem of inserting messages into image media.

A Proposal to Improve the Bit Plane Steganography based on the Complexity Calculation Technique

The video steganography technique is being studied and applied a lot today because of its benefits. In particular, the video steganography technique using Bit-Plane Complexity Segmentation (BPCS) has increasingly proven its effectiveness compared to other methods. In this paper, based on the theoretical basis of the BPCS method, we propose a new method to improve the efficiency of the steganography process. Accordingly, our improvement proposal in this paper is improving the complexity formula of the bit planes. Our new formula not only has improved the steganographic thresholds in the bit planes to find more planes hiding secret information, but also has ensured the amount of information hidden in the video and their safety. The experimental results in the paper have not only demonstrated the effectiveness of our proposed method but also provided a new mechanism for digital image analysis in general and video steganography techniques in particular.

Implementasi Metode Bit Plane Complexity Segmentation pada Citra Digital dalam Penyembunyian Pesan Rahasia

Tapping secret message information often occurs in communication media. Safeguarding information or data distributed is very important to maintain confidentiality, integrity and authenticity. In steganography, there are several digital media that can be used as covers to hide the existence of a message, such as: Image, Audio, Text, and Video. The cover media research used in digital imagery is the Bit-Plane Complexity Segmentation Method. Bit-plane complexity segmentation (BPCS) is a steganography technique that has a large capacity, because it can hold confidential data with a relatively large capacity when compared to other steganography methods. It is expected that this research can minimize the leakage of important information that is very confidential and detrimental if it is known by others.

Data hiding using bit plane complexity segmentation steganography

Steganography is the basis of information covering the puzzle in some other data (we call it the ship), leaving no obvious evidence of data change. Most conventional steganographic strategies is limited data that hide the limit. They can cover up just 10% (or less) of the information measures of the vessel. This is on the grounds that the standard of those procedures was either to supplant an uncommon piece of the recurrence parts of the vessel picture, or to supplant all the slightest critical image bits with a secret multi-valued data. Our new Steganography uses the image as vessel information, and we enter the data in the bit-plane mystery vessel. This strategy makes use of human attributes, through which people cannot see the structure of any form of data exclusively damned pair, for example. We can replace most of the «Commotion like" regions in the bit-planes of the puzzle vessel image data without deteriorating the quality of the photos. We called our steganography "BPCS-steganography," which remains a Bit-Plane Complexity Segmentation steganography.

Use of One Time Pad Algorithm for Bit Plane Security Improvement

BPCS (Bit-Plane Complexity Segmentation) which is one of the steganography techniques that utilizes the human vision characteristics that cannot see the change in binary patterns that occur in the image. This technique performs message insertion by making a switch to a high-complexity bit-plane or noise-like regions with bits of secret messages. Bit messages that were previously stored precisely result the message extraction process to be done easily by rearranging a set of previously stored characters in noise-like region in the image. Therefore the secret message becomes easily known by others. In this research, the process of replacing bit plane with message bits is modified by utilizing One Time Pad cryptography technique which aims to increase security in bit plane. In the tests performed, the combination of One Time Pad cryptographic algorithm to the steganography technique of BPCS works well in the insertion of messages into the vessel image, although in insertion into low-dimensional images is poor. The comparison of the original image with the stegoimage looks identical and produces a good quality image with a mean value of PSNR above 30db when using a largedimensional image as the cover messages.

Vernam Conjugated Manipulation of Bit-plane Complexity Segmentation

Vernam Conjugated Manipulation of Bit-plane Complexity Segmentation

An efficient hybrid security mechanism based on chaos and improved BPCS

Commonly used security mechanisms such as cryptography and steganography suffer from weaknesses when used in a standalone manner. Extra efforts in the form of additional permutations/diffusions etc. result in higher ciphering/deciphering time complexity. Thus, there is a requirement for a security mechanism(s) which can provide adequate security without putting a considerable burden on ciphering/deciphering time complexity. This paper is an effort in this direction. The paper proposes a hybrid mechanism that employs chaotic based encryption scheme to encrypt data and an improved Bit-Plane Complexity Segmentation Steganography algorithm to embed the data. The proposed mechanism uses two new complexity measures to differentiate between noisy regions and simple ones appropriately. The scheme was implemented in MATLAB, and the simulation results show that the proposed mechanism has high embedding capacity, high security with a moderate decrease in PSNR value and is computationally fast.

Klasifikasi Bit-Plane Noise untuk Penyisipan Pesan pada Teknik Steganography BPCS Menggunakan Fuzzy Inference Sistem Mamdani

Bit-Plane Complexity Segmentation (BPCS) is a fairly new steganography technique. The most important process in BPCS is the calculation of complexity value of a bit-plane. The bit-plane complexity is calculated by looking at the amount of bit changes contained in a bit-plane. If a bit-plane has a high complexity, the bi-plane is categorized as a noise bit-plane that does not contain valuable information on the image. Classification of the bit-plane using the set cripst set (noise/not) is not fair, where a little difference of the value will significantly change the status of the bit-plane. The purpose of this study is to apply the principles of fuzzy sets to classify the bit-plane into three sets that are informative, partly informative, and the noise region. Classification of the bit-plane into a fuzzy set is expected to classify the bit-plane in a more objective approach and ultimately message capacity of the images can be improved by using the Mamdani fuzzy inference to take decisions which bit-plane will be replaced with a message based on the classification of bit-plane and the size of the message that will be inserted. This research is able to increase the capability of BPCS steganography techniques to insert a message in bit-pane with more precise so that the container image quality would be better. It can be seen that the PSNR value of original image and stego-image is only slightly different.

English

Nowadays, Internet has become a convenient way for data transmission due to a fast development of modern technology. Data transmission over internet is done in many ways such as email, sms, via chat application etc. Protection for confidential data send over internet has become a necessity as unauthorized access to data by an intruder accessing it have become common, hacker also attack data via viruses for their own benefits have raised concern for protecting data. Various data hiding methods are being implemented such as steganography, cryptography and hybrid cryptography. This paper gives overview of steganography, its methods and review of existing BPCS (Bit Plane Complexity Segmentation) steganography technique which can be used to increase the data embedding capacity of image.

A New Information Hiding Method Based on Improved BPCS Steganography

Bit-plane complexity segmentation (BPCS) steganography is advantageous in its capacity and imperceptibility. The important step of BPCS steganography is how to locate noisy regions in a cover image exactly. The regular method, black-and-white border complexity, is a simple and easy way, but it is not always useful, especially for periodical patterns. Run-length irregularity and border noisiness are introduced in this paper to work out this problem. Canonical Cray coding (CGC) is also used to replace pure binary coding (PBC), because CGC makes use of characteristic of human vision system. Conjugation operation is applied to convert simple blocks into complex ones. In order to contradict BPCS steganalysis, improved BPCS steganography algorithm adopted different bit-planes with different complexity. The higher the bit-plane is, the smaller the complexity is. It is proven that the improved BPCS steganography is superior to BPCS steganography by experiment.

Uncompressed Image Steganography using BPCS: Survey and Analysis

Steganography is the art and science of hide secret information in some carrier data without leaving any apparent evidence of data alternation. In the past, people use hidden tattoos, invisible ink or punching on papers to convey stenographic data. Now, information is first hide in digital image, text, video and audio. This paper discusses existing BPCS (Bit Plane Complexity Segmentation) steganography techniques and presences of some modification. BPCS technique makes use of the characteristics of the human visible system. BPCS scheme allows for large capacity of embedded secret data and is highly customized. This algorithm offers higher hiding capacity due to that it exploits the variance of complex regions in each bit plane. In contrast, the BPCS algorithm provided a much more effective method for obtaining a 50% capacity since visual attacks did not suffice for detection. Keywords: BPCS, Data security, Information hiding, Steganography, Stego image

The Efficiency of Data Hiding by Manipulating the DPCM Macroblocks in Compressed Video

Steganography is the idea of embedding a secret data in different media and has become an important regulation of methods of data integration. Although the still images are generally applied in the past, is very popular in recent years for the video. The techniques of video data hiding in recent year’s emphasis on the features generated by the video compression standard, a safer method for steganography uses MPEG-4/H.264 Bit Plane Complexity Segmentation (BPCS) algorithm is proposed in this approach. The reason for choosing such a video coverage is the enormous amount of data that can be hidden in each frame of MPEG-4 video. In other words, MPEG-4 has three types of images: I-frame, B, and P frames. Unlike other techniques used to hide data, such as the LSB algorithm, PBCS can achieve better results in both mathematics expression and human vision. In this paper, data is embedded in the videos of the I-frame until the BPCS can reach high levels of integration with low distortion based on the theory that regions of low noise-levels as in a picture can be replaced by noise without a significant loss of image quality. This approach invents data hidden in high-security environments. Experimental results show the success of hidden data in the selected and extracted data from the sequence of frames and also indicate the effectiveness of the implementation plan of steganography compressed video with high security features.

Secure Bit-Plane Based Steganography for Secret Communication

A secure method for steganography is proposed. Pixel-value differencing (PVD) steganography and bit-plane complexity segmentation (BPCS) steganography have the weakness of generating blocky effects and noise in smooth areas and being detectable with steganalysis. To overcome these weaknesses, a secure bit-plane based steganography method on the spatial domain is presented, which uses a robust measure to select noisy blocks for embedding messages. A matrix embedding technique is also applied to reduce the change of cover images. Given that the statistical property of cover images is well preserved in stego-images, the proposed method is undetectable by steganalysis that uses RS analysis or histogram-based analysis. The proposed method is compared with the PVD and BPCS steganography methods. Experimental results confirm that the proposed method is secure against potential attacks.

Novel steganalysis schemes for BPCS steganography

The content of message can be protected by using cryptographic technology, and the encrypted message can be further hidden by information hiding technology. least significant bit (LSB) substitution is a popular steganographic technique in spatial domain and it becomes a trendy topic in studying of detecting the LSB substitution technique. Bitplane complexity segmentation (BPCS) steganography proposed by Kawaguchi and Eason increases the embedding capacity to 50% while the capacity of the tradition LSB substitution only 10% of the cover media. Some BPCS steganalysis schemes are proposed based on the statistical characteristics, in which messages are embedded into least significant bitplane using the BPCS steganography. In the case of the messages embedding bypasses the LSB or into one more bitplanes, the foregoing steganalysis technique will become invalid. In this paper, two novel BPCS steganalysis schemes are proposed to overcome these attacks and to enhance the detective ability of BPCS steganalysis. Experiment results show the feasibility and correctness of the proposed schemes.

Application of bit-plane decomposition steganography to JPEG2000 encoded images

This letter presents a steganography method based on a JPEG2000 lossy compression scheme and bit-plane complexity segmentation (BPCS) steganography. It overcomes the lack of robustness of bit-plane-based steganography methods with respect to lossy compression of a dummy image: a critical shortcoming that has hampered deployment in a practical scenario. The proposed method is based on a seamless integration of the two schemes without compromising their desirable features and makes feasible the deployment of the merits of a BPCS steganography technique in a practical scenario where images are compressed before being transmitted over the network. Embedding rates of around 15% of the compressed image size were achieved for preembedding 1.0-bpp compressed images with no noticeable degradation in image quality.

BPCS steganography using EZW lossy compressed images

This paper presents a steganography method based on an embedded zerotree wavelet compression scheme and bit-plane complexity segmentation steganography. The proposed steganography enables us to use lossy compressed images as dummy files in bit-plane-based steganographic algorithms. Large embedding rates of around 25% of the compressed image size were achieved with little noticeable degradation in image quality.