A Brief Review of RIDH

The Reversible image data hiding (RIDH) is one of the novel approaches in the security field. In the highly sensitive domains like Medical, Military, Research labs, it is important to recover the cover image successfully, Hence, without applying the normal steganography, we can use RIDH to get the better result. Reversible data hiding has a advantage over image data hiding that it can give you double security surely

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

Randomized Symmetric Crypto Spatial Fusion Steganographic System

The image fusion steganographic system embeds encrypted messages in decomposed multimedia carriers using a pseudorandom generator but it fails to evaluate the contents of the cover image. This results in the secret data being embedded in smooth regions, which leads to visible distortion that affects the imperceptibility and confidentiality. To solve this issue, as well as to improve the quality and robustness of the system, the Randomized Symmetric Crypto Spatial Fusion Steganography System is proposed in this study. It comprises three-subsystem bitwise encryption, spatial fusion, and bitwise embedding. First, bitwise encryption encrypts the message using bitwise operation to improve the confidentiality. Then, spatial fusion decomposes and evaluates the region of embedding on the basis of sharp intensity and capacity. This restricts the visibility of distortion and provides a high embedding capacity. Finally, the bitwise embedding system embeds the encrypted message through differencing the pixels in the region by 1, checking even or odd options and not equal to zero constraints. This reduces the modification rate to avoid distortion. The proposed heuristic algorithm is implemented in the blue channel, to which the human visual system is less sensitive. It was tested using standard IST natural images with steganalysis algorithms and resulted in better quality, imperceptibility, embedding capacity and invulnerability to various attacks compared to other steganographic systems

Hiding Data in Image using Extended Pixel Mapping Method

— Internet technologies are currently charring an important role in our day to day life. It has the benefit as well as disadvantages also.This in term generates the needs of data activity technology for maintaining the secrecy of the key information. The steganograpic concept of data hiding is used in this method. The method used spatial domain technique. This algorithm used image as a carrier medium for hiding the data. In this pixel component are used for hiding the data. For achieving this pixel index value and their position are calculated. According to this key will be generated and by using key data is hided.Experimental result shows that the perceptual quality of hided image is high in this technique. The key idea of this project is to hide the data in carrier image and retrieve data from carrier image without affecting without affecting the perceptual transparency of the data hided image. This system provides compression of data so that payload capacity of the system will be increases. DOI: 10.17762/ijritcc2321-8169.150512

Selected Papers from the First International Symposium on Future ICT (Future-ICT 2019) in Conjunction with 4th International Symposium on Mobile Internet Security (MobiSec 2019)

The International Symposium on Future ICT (Future-ICT 2019) in conjunction with the 4th International Symposium on Mobile Internet Security (MobiSec 2019) was held on 17–19 October 2019 in Taichung, Taiwan. The symposium provided academic and industry professionals an opportunity to discuss the latest issues and progress in advancing smart applications based on future ICT and its relative security. The symposium aimed to publish high-quality papers strictly related to the various theories and practical applications concerning advanced smart applications, future ICT, and related communications and networks. It was expected that the symposium and its publications would be a trigger for further related research and technology improvements in this field

A Data Hiding Method Based on Partition Variable Block Size with Exclusive-or Operation on Binary Image

In this paper, we propose a high capacity data hiding method applying in binary images. Since a binary image has only two colors, black or white, it is hard to hide data imperceptible. The capacities and imperception are always in a trade-off problem. Before embedding we shuffle the secret data by a pseudo-random number generator to keep more secure. We divide the host image into several non-overlapping (2n+1) by (2n+1) sub-blocks in an M by N host image as many as possible, where n can equal 1, 2, 3 , …, or min(M,N). Then we partition each sub-block into four overlapping (n+1) by (n+1) sub-blocks. We skip the all blacks or all whites in each (2n+1) by (2n+1) sub-blocks. We consider all four (n+1) by (n+1) sub-blocks to check the XOR between the non overlapping parts and center pixel of the (2n+1) by (2n+1) sub-block, it embed n 2 bits in each (n+1) by (n+1) sub-block, totally are 4*n 2 . The entire host image can be embedded 4×n 2×M/(2n+1)×N/(2n+1) bits. The extraction way is simply to test the XOR between center pixel with their non-overlapping part of each sub-block. All embedding bits are collected and shuffled back to the original order. The adaptive means the partitioning sub-block may affect the capacities and imperception that we want to select. The experimental results show that the method provides the large embedding capacity and keeps imperceptible and reveal the host image lossless

Pixel grouping of digital images for reversible data hiding

Pixel Grouping (PG) of digital images has been a key consideration in recent development of the Reversible Data Hiding (RDH) schemes. While a PG kernel with neighborhood pixels helps compute image groups for better embedding rate-distortion performance, only horizontal neighborhood pixel group of size 1×3 has so far been considered. In this paper, we formulate PG kernels of sizes 3×1, 2×3 and 3×2 and investigate their effect on the rate-distortion performance of a prominent PG-based RDH scheme. Specially, a kernel of size 3×2 (or 2×3) that creates a pair of pixel-trios having triangular shape and offers a greater possible correlation among the pixels. This kernel thus can be better utilized for improving a PG-based RDH scheme. Considering this, we develop and present an improved PG-based RDH scheme and the computational models of its key processes. Experimental results demonstrated that our proposed RDH scheme offers reasonably better  embedding rate-distortion performance than the original scheme

WG1N5315 - Response to Call for AIC evaluation methodologies and compression technologies for medical images: LAR Codec

This document presents the LAR image codec as a response to Call for AIC evaluation methodologies and compression technologies for medical images.This document describes the IETR response to the specific call for contributions of medical imaging technologies to be considered for AIC. The philosophy behind our coder is not to outperform JPEG2000 in compression; our goal is to propose an open source, royalty free, alternative image coder with integrated services. While keeping the compression performances in the same range as JPEG2000 but with lower complexity, our coder also provides services such as scalability, cryptography, data hiding, lossy to lossless compression, region of interest, free region representation and coding