Image registration is a basic task in computer vision, for its wide potential applications in image stitching, stereo vision, motion estimation, and etc. Most current methods achieve image registration by estimating a global homography matrix between candidate images with point-feature-based matching or direct prediction. However, as real-world 3D scenes have point-variant photograph distances (depth), a unified homography matrix is not sufficient to depict the specific pixel-wise relations between two images. Some researchers try to alleviate this problem by predicting multiple homography matrixes for different patches or segmentation areas in images; in this letter, we tackle this problem with further refinement, i.e. matching images with pixel-wise, depth-aware homography estimation. Firstly, we construct an efficient convolutional network, theDPH-Net, to predict the essential parameters causing image deviation, the rotation ($R$) and translation ($T$) of cameras. Then, we feed-in an image depth map for the calculation of initial pixel-wise homography matrixes, which are refined with an online optimization scheme. Finally, with the estimated pixel-specific homography parameters, pixel correspondences between candidate images can be easily computed for registration. Compared with state-of-the-art image registration algorithms, the proposedDPH-Nethas the highest performance of 0.912 EPE and 0.977 SSIM, demonstrating the effectiveness of adding depth information and estimating pixel-wise homography into the image registration process.

Steganography is an important technology for ensuring the security of cyberspace and the privacy of communications. In the last decade, emerging biotechnology has made it possible for DNA to be used as a promising steganographic carrier with high hidden capacity, high imperceptibility and high feasibility. However, severe statistical distortion might appear in steganographic carriers generated by existing DNA steganographies when they are compared with the natural ones. Therefore, efforts are being made to seek an advanced strategy to generate quasi-natural steganographic carriers with a strong anti-steganalysis capability. In this work, we first thoroughly analyze and model the numerous complicated statistical properties that exist in natural DNA chains, and then utilize the LSTM model to learn the serialized statistical properties. After obtaining an optimal sequence model that highly satisfies the statistical properties of natural DNA chains, we utilize the Adaptive Dynamic Grouping (ADG) algorithm to perform information hiding. In addition, we have carried out experimental analysis and verification from the perspectives of perceptual-imperceptibility, statistical-imperceptibility, and anti-steganalysis capability, all of which show that our proposed steganography method vastly outperforms previous DNA steganographic methods, taking a successful step towards achieving higher security DNA steganography.