Model of the low temperature magnetic phases of gadolinium gallium garnet

The magnetic behaviour of gadolinium gallium garnet in an external magnetic field at zero temperature is considered. For high fields a classical spin model of the gadolinium ions predicts a spin configuration that is periodic at the level of the smallest repeating unit cell. The quantum version of the model is treated via a truncated Holstein-Primakoff transformation with axes defined by the classical spin configuration, and the magnon excitation bands are calculated. The model predicts a transition in the field range of 1.9-2.1 T, sensitive to the direction of the applied field, which is caused by one or more magnon modes becoming soft as the field is decreased. In general the soft modes occur at incommensurate wavevectors and therefore break the periodicity of the spin configuration below the transition. One exception occurs when the field aligns with one of the principle crystal axes, in which case periodicity of the spin configuration is found to be maintained on a larger crystallographic cubic cell even below the transition. This simple case is studied in more detail. Comparisons are drawn with existing experimental data, and further experimental tests of the model are suggested. [Abstract copyright: © 2021 IOP Publishing Ltd.

Authenticity Preservation with Histogram-Based Reversible Data Hiding and Quadtree Concepts

With the widespread use of identification systems, establishing authenticity with sensors has become an important research issue. Among the schemes for making authenticity verification based on information security possible, reversible data hiding has attracted much attention during the past few years. With its characteristics of reversibility, the scheme is required to fulfill the goals from two aspects. On the one hand, at the encoder, the secret information needs to be embedded into the original image by some algorithms, such that the output image will resemble the input one as much as possible. On the other hand, at the decoder, both the secret information and the original image must be correctly extracted and recovered, and they should be identical to their embedding counterparts. Under the requirement of reversibility, for evaluating the performance of the data hiding algorithm, the output image quality, named imperceptibility, and the number of bits for embedding, called capacity, are the two key factors to access the effectiveness of the algorithm. Besides, the size of side information for making decoding possible should also be evaluated. Here we consider using the characteristics of original images for developing our method with better performance. In this paper, we propose an algorithm that has the ability to provide more capacity than conventional algorithms, with similar output image quality after embedding, and comparable side information produced. Simulation results demonstrate the applicability and better performance of our algorithm

Protection of medical images and patient related information in healthcare: Using an intelligent and reversible watermarking technique

This work presents an intelligent technique based on reversible watermarking for protecting patient and medical related information. In the proposed technique ‘IRW-Med’, the concept of companding function is exploited for reducing embedding distortion, while Integer Wavelet Transform (IWT) is used as an embedding domain for achieving reversibility. Histogram processing is employed to avoid underflow/overflow. In addition, the learning capabilities of Genetic Programming (GP) are exploited for intelligent wavelet coefficient selection. In this context, GP is used to evolve models that not only make an optimal tradeoff between imperceptibility and capacity of the watermark, but also exploit the wavelet coefficient hidden dependencies and information related to the type of sub band. The novelty of the proposed IRW-Med technique lies in its ability to generate a model that can find optimal wavelet coefficients for embedding, and also acts as a companding factor for watermark embedding. The proposed IRW-Med is thus able to embed watermark with low distortion, take out the hidden information, and also recovers the original image. The proposed IRW-Med technique is effective with respect to capacity and imperceptibility and effectiveness is demonstrated through experimental comparisons with existing techniques using standard images as well as a publically available medical image dataset

Generalized PVO‐based dynamic block reversible data hiding for secure transmission using firefly algorithm

In this paper, we proposed a novel generalized pixel value ordering–based reversible data hiding using firefly algorithm (GPVOFA). The sequence of minimum and maximum number pixels value has been used to embed the secret data while prediction and modification are held on minimum, and the maximum number of pixel blocks is used to embed the secret data into multiple bits. The host image is divided into the size of noncoinciding dynamic blocks on the basis of firefly quadtree partition, whereas rough blocks are divided into a larger size; moreover, providing more embedding capacity used small flat blocks size and optimal location in the block to write the information. Our proposed method becomes able to embed large data into a host image with low distortion. The rich experimental results are better, as compared with related preceding arts

Modified BCH data hiding scheme for JPEG steganography

In this article, a new Bose-Chaudhuri-Hochquenghem (BCH)-based data hiding scheme for JPEG steganography is presented. Traditional data hiding approaches hide data into each block, where all the blocks are not overlapping each other. However, in the proposed method, two consecutive blocks can be overlapped to form a combined block which is larger than a single block, but smaller than two consecutive nonoverlapping blocks in size. In order to embed more amounts of data into the combined block than a single block, the BCH-based data hiding scheme has to be redesigned. In this article, we propose a way to get a joint solution for hiding data into two blocks with intersected coefficients such that any modification of the intersected area does not affect the data hiding process into both blocks. Due to hiding more amounts of data into the intersected area, embedding capacity is increased. On the other hand, the nonzero DCT coefficient stream is modified to achieve better steganalysis and to reduce the distortion impact after data hiding. This approach carefully inserts or removes 1 or-1 coefficients into or from the DCT coefficient stream according to the rule proposed in this article. Experimental results show that the proposed algorithms work well and their performance is significant