The speech signal is different from the typical audio in terms of spectral bandwidth, intensity distribution, and signal continuity, thus how to achieve high imperceptibility and strong robustness for speech steganography is a big challenge. In this paper, we present a speech steganography scheme based on the parity-segmented method and the differential singular value decomposition (SVD). The selected discrete cosine transform (DCT) coefficients are divided into two segments according to parity order. In this way, the energy of the paired segments is approximately equal, therefore the changes in the singular values caused by data embedding are reduced, and high imperceptibility is achieved. Unlike the common SVD-based steganography, the differential SVD scheme can effectively remove the impact of amplitude scaling attack by embedding the secret message into the difference between the singular values. Experimental results show that the proposed method achieves high imperceptibility and strong robustness while resisting the state-of-the-art steganalytic methods. INDEX TERMS Steganography, differential SVD, paired segments, imperceptibility, amplitude scaling.

No abstract

This article presents the linear Proximal Support Vector Machine (PSVM) to the image steganalysis, and further generates a very efficient method called PSVM-LSMR through implementing PSVM by the state-of-the-art optimization method Least Square Minimum-Residual (LSMR). Also, motivated by extreme learning machine (ELM), a nonlinear algorithm PSVM-ELM is proposed for the image steganalysis. It is shown by the experiments with the wide stego schemes and rich steganalysis feature sets in both the spatial and JPEG domains that the PSVM can achieve comparable performance with Fisher Linear Discriminant (FLD) and ridge regression, and its computational time is far more less than that of them on large feature sets. The PSVM-LSMR is comparable to Ridge Regression implemented by LSMR (RR-LSMR), and both of them require the least computational time among all the competitions when dealing with medium or large feature sets. The nonlinear PSVM-ELM performs comparably or even better than FLD and ridge regression for the spatial domain steganographic schemes, and its computational time is apparently less than that of them on large feature sets.

No abstract

Most face recognition technology on smartphone, should deposit a photo and compare with the instant photo while validation, if the degree of similarity reaches a certain range, we consider it's his operation. However, it has many drawbacks. First, the program will take up a lot of CPU during comparison. Secondly, the pre-stored photos are easily replaced by hackers, leading to privacy information leakage. In this paper, we proposed a cloud-based identity recognition algorithm, and the standard images are stored in the Elastic Compute Service. When authenticating, our algorithm can determine whether the picture uploaded is consistent with the original picture.