Text Hiding in Coded Image Based on Quantization Level Modification and Chaotic Function

A text hiding method in codded image is presented in this paper that based on quantization level modification. The used image is transformed into wavelet domain by DWT and coefficient of transform is partitioned into predefined block size. Specific threshold has been used to classify these blocks into two types named smooth and complex. Each type has its own method of text hiding (binary data), for smooth blocks, secret bits which represent the text data are switched by the bitmap. In order to reduce distortion, the quantization levels are modified. To reach extra embedding payload the quantization level could carry extra two bits depending on other threshold. The complex block carry one data bit on each block and quantization levels are swapped to reduce distortion with bitmap flipping. The proposed method result shows a high signal to noise ratio, with studying capacity as important in this work

Adaptive speech compression based on AMBTC

Most of the AMBTC-based RDH (absolute instantaneous block truncation) schemes Cannot be decrypted because AMBTC, which is unknown to most device. Also, some of the RDH methods based on AMBTC. But the load capacity obtained is low. For this purpose, in this work, a scalable RDH scheme based on AMBTC was introduced from the AMBTC zip code. In contrast to the decoder-based AMBTC-based RDH methods that are only able to achieve a constant payload for adjust the audio. Due to its advantages, sound pressure has attracted a great deal of attention in the last 20 years. The main developments concern transmission requirements and storage capacity. The need for high-quality audio data has been increased due to sudden improvements in computer manufacturers and technologies. Therefore, the developments include speech compression technologies, in which the two compression classes are lossless. This paper aims to review techniques for specification compression methods using AMBTC (a momentary absolute block truncation notation based ) method, and to summarize their importance and uses

A review and open issues of multifarious image steganography techniques in spatial domain

Nowadays, information hiding is becoming a helpful technique and fetch more attention due fast growth of using internet, it is applied for sending secret information by using different techniques. Steganography is one of major important technique in information hiding. Steganography is science of concealing the secure information within a carrier object to provide the secure communication though the internet, so that no one can recognize and detect it’s except the sender & receiver. In steganography, many various carrier formats can be used such as an image, video, protocol, audio. The digital image is most popular used as a carrier file due its frequency on internet. There are many techniques variable for image steganography, each has own strong and weak points. In this study, we conducted a review of image steganography in spatial domain to explore the term image steganography by reviewing, collecting, synthesizing and analyze the challenges of different studies which related to this area published from 2014 to 2017. The aims of this review is provides an overview of image steganography and comparison between approved studies are discussed according to the pixel selection, payload capacity and embedding algorithm to open important research issues in the future works and obtain a robust method

A User Oriented Image Retrieval System using Halftoning BBTC

The objective of this paper is to develop a system for content based image retrieval (CBIR) by accomplishing the benefits of low complexity Ordered Dither Block Truncation Coding based on half toning technique for the generation of image content descriptor. In the encoding step ODBTC compresses an image block into corresponding quantizes and bitmap image. Two image features are proposed to index an image namely co-occurrence features and bitmap patterns which are generated using ODBTC encoded data streams without performing the decoding process. The CCF and BPF of an image are simply derived from the two quantizes and bitmap respectively by including visual codebooks. The proposed system based on block truncation coding image retrieval method is not only convenient for an image compression but it also satisfy the demands of users by offering effective descriptor to index images in CBIR system

Non Oblivious Watermarking Technique for JPEG2000 Compressed Images Using Arnold Scrambling of Unequal Size Watermark Blocks

In this paper, a watermarking technique for JPEG2000 compressed image is proposed. Scrambling of secret message is performed block-wise using Arnold Transform. Secret message is divided into non-overlapping blocks of unequal size and then Arnold transform is applied on each block and secret key is generated based on the periodicity of each block. Scrambled secret message is embedded into qualified significant wavelet coefficients of a cover image. After embedding the secret message into wavelet coefficients, the remaining processes of JPEG2000 standard are executed to compress the watermarked image at different compression rates. Scaling Factor (SF) is used to embed watermark into wavelet coefficients and the value of SF is stored into COM box of the code stream of JPEG2000 compressed image and this SF value and secret key are used to extract the embedded watermark on the receiver side. The performance of the proposed technique is robust to a variety of attacks like image cropping, salt and pepper noise, and rotation. Proposed technique is compared with the existing watermarking techniques for JPEG2000 compressed images to show its effectiveness

Quantization Watermarking for Joint Compression and Data Hiding Schemes

International audienceEnrichment and protection of JPEG2000 images is an important issue. Data hiding techniques are a good solution to solve these problems. In this context, we can consider the joint approach to introduce data hiding technique into JPEG2000 coding pipeline. Data hiding consists of imperceptibly altering multimedia content, to convey some information. This process is done in such a way that the hidden data is not perceptible to an observer. Digital watermarking is one type of data hiding. In addition to the imperceptibility and payload constraints, the watermark should be robust against a variety of manipulations or attacks. We focus on trellis coded quantization (TCQ) data hiding techniques and propose two JPEG2000 compression and data hiding schemes. The properties of TCQ quantization, defined in JPEG2000 part 2, are used to perform quantization and information embedding during the same time. The first scheme is designed for content description and management applications with the objective of achieving high payloads. The compression rate/imperceptibility/payload trade off is our main concern. The second joint scheme has been developed for robust watermarking and can have consequently many applications. We achieve the better imperceptibility/robustness trade off in the context of JPEG2000 compression. We provide some experimental results on the implementation of these two schemes

Bit Plane Coding Based Steganography Technique for JPEG2000 Images and Videos

In this paper, a Bit Plane Coding (BPC) based steganography technique for JPEG2000 images and Motion JPEG2000 video is proposed. Embedding in this technique is performed in the lowest significant bit planes of the wavelet coefficients of a cover image. In JPEG2000 standard, the number of bit planes of wavelet coefficients to be used in encoding is dependent on the compression rate and are used in Tier-2 process of JPEG2000. In the proposed technique, Tier-1 and Tier-2 processes of JPEG2000 and Motion JPEG2000 are executed twice on the encoder side to collect the information about the lowest bit planes of all code blocks of a cover image, which is utilized in embedding and transmitted to the decoder. After embedding secret data, Optimal Pixel Adjustment Process (OPAP) is applied on stego images to enhance its visual quality. Experimental results show that proposed technique provides large embedding capacity and better visual quality of stego images than existing steganography techniques for JPEG2000 compressed images and videos. Extracted secret image is similar to the original secret image

A New Paradigm for Improved Image Steganography by using Adaptive Number of Dominant Discrete Cosine Transform Coefficients

Image steganography camouflages secret messages in images by tampering image contents. There is a natural desire for hiding maximum secret information with the least possible distortions in the host image. This requires an algorithm that intelligently optimizes the capacity keeping the required imperceptibility of the image. This paper presents an image steganography scheme that preserves an adaptively chosen block of dominant coefficients from each Discrete Cosine Transform coefficients, whereas the rest of the coefficients are replaced with normalized secret image pixel values. Secret image pixel value are normalized in an adaptively chosen range. Embedding such kind of normalized data in adaptively chosen non-square L- shaped blocks utilize maximum embedding space available in each block that consequently results in maximizing payload capacity, while maintaining the image quality. This scheme achieved payload capacity up to 21.5 bit per pixel (bpp), while maintaining image quality of 38.24 dB peak signal to noise ratio.Comment: 9 page