Data hiding using pseudo magic squares for embedding high payload in digital images

Multimedia Tools and Applications - In this paper, a novel information hiding scheme based on pseudo magic squares is proposed. The pseudo magic square pattern is generated using the Knight’s...     

Efficient large payloads ternary matrix embedding

Matrix embedding (ME) can be exploited to improve the embedding efficiency for steganography by making fewer changes to the cover data. In ME, the sender and recipient agree on a parity check matrix (PCM) in advance. The PCM will be used by the sender to embed secret message into the cover data and later by the decoder to extract the embedded message. The embedding performance of ME is greatly influenced by the PCM thus the choice of PCM is crucial for ME. On the other hand, since larger sized PCM usually leads to higher embedding efficiency, how to keep the balance between the computational complexity and the embedding efficiency is also an important problem of ME. Based on these considerations, an efficient ternary ME method for large payloads data embedding is proposed in this paper. We utilize a specific matrix construction for PCM to improve embedding efficiency and a sub-optimal search strategy to reduce the computational complexity. The experimental results show that the proposed method achieves good embedding efficiency at low time cost and it outperforms some state-of-the-art works. For example, for a cover image with 512 × 512 pixels at an embedding rate of 1 bit per pixel, the proposed method can be implemented within 0.5 second in a personal computer with a rather high embedding efficiency as 3.89.     

Matrix embedding for large payloads

Matrix embedding is a previously introduced coding method that is used in steganography to improve the embedding efficiency (increase the number of bits embedded per embedding change). Higher embedding efficiency translates into better steganographic security. This gain is more important for long messages than for shorter ones because longer messages are, in general, easier to detect. In this paper, we present two new approaches to matrix embedding for large payloads suitable for practical steganographic schemes-one based on a family of codes constructed from simplex codes and the second one based on random linear codes of small dimension. The embedding efficiency of the proposed methods is evaluated with respect to theoretically achievable bounds.     

On-line frequency domain information for control of a flexible-linkrobot with varying payload

Experimental results are given for the endpoint position control of a single-link, very flexible robot arm carrying an unknown, varying payload. The control objective is to maintain endpoint position accuracy in the presence of flexure effects after rapid movement due to a rigid body slew-angle commanded position. Fast, simple, and efficient frequency domain schemes are used for online controller gain adjustment within an effective scheduling framework. Only endpoint acceleration and motor shaft angle measurements are utilized in relatively simple control laws where the appropriate gains have been scheduled as correlated to modal frequency information corresponding to a varying, unknown payload     

Minority codes with improved embedding efficiency for large payloads

Improving embedding efficiency is important for watermarking with large payloads. In this paper, we propose a coding scheme named Minority codes by observing the relationship between the populations and positions of the binary bits in a sequence whose length is an odd number. In such a sequence, there is always a bit value, whose population is minority. We observe that the positions of the minority bit in two complement sequences are the same. By using this property, we create Minority codes whose codebook is composed of a pair of complement sequences for each entry. Minority codes can be combined with watermarking algorithms to improve embedding efficiency, because we can always identify the codeword that causes fewer embedding changes according to the host image and the watermarking method. The performance of Minority codes is analyzed theoretically and supported experimentally. The complexity of Minority codes is quite low and suitable for large payloads.     

A high stego-image quality steganographic scheme with reversibility and high payload using multiple embedding strategy

Tian’s method is a breakthrough reversible data embedding scheme with high embedding capacity measured by bits per pixel (bpp) and good visual quality measured by peak signal-to-noise ratio (PSNR). However, the embedding capacity and visual quality of this method can be significantly improved. Thus, we propose a simple reversible steganographic scheme in spatial domain for digital images by using the multiple embedding strategy. The proposed method horizontally and vertically embeds one secret bit into one cover pixel pair. The experimental results show that the proposed reversible steganographic method achieves good visual quality and high embedding capacity. Specifically, with the one-layer embedding, the proposed method can obtain the embedding capacity of more than 0.5 bpp and the PSNR value greater than 54 dB for all test images. Especially, with the five-layer embedding, the proposed method has the embedding capacity of more than 2 bpp and the PSNR value higher than 52 dB for all test images. Therefore, the proposed method surpasses many existing reversible data embedding methods in terms of visual quality and embedding capacity.     

Improving embedding efficiency for digital steganography by exploiting similarities between secret and cover images

Multimedia Tools and Applications - Digital steganography is becoming a common tool for protecting sensitive communications in various applications such as crime/terrorism prevention whereby law...     

Markov bidirectional transfer matrix for detecting LSB speech steganography with low embedding rates

Steganalysis with low embedding rates is still a challenge in the field of information hiding. Speech signals are typically processed by wavelet packet decomposition, which is capable of depicting the details of signals with high accuracy. A steganography detection algorithm based on the Markov bidirectional transition matrix (MBTM) of the wavelet packet coefficient (WPC) of the second-order derivative-based speech signal is proposed. On basis of the MBTM feature, which can better express the correlation of WPC, a Support Vector Machine (SVM) classifier is trained by a large number of Least Significant Bit (LSB) hidden data with embedding rates of 1%, 3%, 5%, 8%,10%, 30%, 50%, and 80%. LSB matching steganalysis of speech signals with low embedding rates is achieved. The experimental results show that the proposed method has obvious superiorities in steganalysis with low embedding rates compared with the classic method using histogram moment features in the frequency domain (HMIFD) of the second-order derivative-based WPC and the second-order derivative-based Mel-frequency cepstral coefficients (MFCC). Especially when the embedding rate is only 3%, the accuracy rate improves by 17.8%, reaching 68.5%, in comparison with the method using HMIFD features of the second derivative WPC. The detection accuracy improves as the embedding rate increases.     

A deep person re-identification model with multi visual-semantic information embedding

Multimedia Tools and Applications - The local features of different body parts have been widely used to learn more discriminative representation for person re-identification, which act as either...     

Rich QR code with three-layer information using visual secret sharing scheme

Multimedia Tools and Applications - Owing to efficient machine recognition, QR codes have been widely used in many aspects such as information management, electronic identity and mobile payment....     

Entropy-based multi-view matrix completion for clustering with side information

Pattern Analysis and Applications - Multi-view clustering aims to group multi-view samples into different clusters based on the similarity. Since side information can describe the relation between...     

An extended matrix encoding algorithm for steganography of high embedding efficiency

F5 steganography is much different from most of LSB replacement or matching steganographic schemes, because matrix encoding is employed to increase embedding efficiency while reducing the number of necessary changes. By using this scheme, the hidden message inserted into carrier media imperceptibly can be transferred via a more secure subliminal channel. The embedding domain is the quantized DCT coefficients of JPEG image, which makes the scheme be immune to visual attack and statistical attack from the steganalyst. Based on this effective scheme, an extended matrix encoding algorithm is proposed to improve the performance further in this paper. By changing the hash function in matrix encoding and converting the coding mode, the embedding efficiency and embedding rate get increased to a large extent. Eventually, the experimental results demonstrate the extended algorithm is superior to the classic F5 steganography.     

NEG-MF:一种针对推荐系统的矩阵分解图嵌入模型

传统的矩阵分解图嵌入模型由于不对大量未知关系建模,其性能面临着很大的挑战性.为了提升矩阵分解模型的性能,提出了一种基于负采样技术的矩阵分解模型NEG-MF.该模型能够从跳数大于6的邻居节点中进行负采样,以降低模型生成图嵌入时对于负样本的偏差.在DBLP数据集上做的大量实验结果表明,相比其他的基线方法,基于NEG-MF的...     

Novel basis matrix creation and preprocessing algorithms for friendly progressive visual secret sharing with space-efficient shares

Multimedia Tools and Applications - The traditional k out of n Visual Secret Sharing (VSS) scheme encodes a secret binary image into n shares of random pattern. If the shares are printed onto...     

Privacy-preserving data hiding with robustness based on selective encryption and matrix embedding

Multimedia Tools and Applications - With the increasing need for privacy-preserving, data hiding in encrypted images has attracted more attention in the data hiding area. The existing data hiding...     

SVD based improved secret fragment visible mosaic image generation for information hiding

This paper proposes a new method for information hiding based on secret fragment visible mosaic image. This algorithm incorporates the application of color transfer for the mosaic image generation to hide the secret information. Since the RGB color space has strong correlation between three color channels, the modification process of any color is complicated in this color space. The large size of bit stream of recovery information of secret image block sequence creates an additional problem. We present a new way to solve these problems using the color transfer technique in correlated color space. The pixel value is considered as a three dimensional stochastic variable and image as a set of samples. Color transformation is achieved by the geometrical transformations such as translation, scaling and rotation. The correlation between the color spaces is measured and further used for the color transfer process by exploring the covariance. In order to get the robust encryption and lower bit rate requirement, the combination of logistic map and Chebyshev map is used to generate the encryption sequence of the secret image.     

Position control of very lightweight single-link flexible arms with large payload variations by using disturbance observers

In this article, a robust control scheme for trajectory tracking of very lightweight single-link flexible arms is discussed. Since the payload is one of the most variable parameters in a manipulator, the control is designed to achieve an accurate tracking of the desired tip trajectory for any value of the robot tip mass, or even for a tip mass changing during the maneuver. The proposed controller also guarantees stability for small uncertainties in parameters such as stiffness or motor friction. In addition, the effect of spillover on the performance of the controlled system is analyzed, and it is proven that stability and a good performance are preserved independently from the non-modeled high-order dynamics. The control scheme is based on a two nested loops structure. Each of these loops implements a Generalized Proportional Integral (GPI) controller. Moreover, the outer loop includes a disturbance compensation term based on a disturbance observer, which achieves the required insensitivity to payload changes. The theoretical analysis is supported by an extensive set of numerical simulations which shows controlled system response when variations in the robot payload, or dynamics neglected in the controller design, are considered. Finally, some experiments have been carried out in order to test the performance of the tip trajectory tracking of the proposed control system.     

Correction to: Aggregating neighborhood information for negative sampling for knowledge graph embedding

Neural Computing and Applications - Unfortunately, this article has been published with incorrect title.     

Multi-party quantum secret sharing with the single-particle quantum state to encode the information

We present a three-party quantum secret sharing (QSS) scheme via the entangled Greenberger–Horne–Zeilinger state. In this scheme, the sender Alice encodes her arbitrary secret information by means of preparing a single-particle quantum state. The agent Bob obtains his shared information according to his hobby, while Charlie can easily calculate his shared information. The proposed scheme is secure. It is shown that even a dishonest agent, who may avoid the security checking, cannot obtain any useful information. Moreover, we further investigate the multi-party QSS scheme which allows most agents to predetermine their information.     

EmbAssi: embedding assignment costs for similarity search in large graph databases

Data Mining and Knowledge Discovery - The graph edit distance is an intuitive measure to quantify the dissimilarity of graphs, but its computation is $$mathsf {NP}$$ -hard and challenging in...