In this paper, we propose a new algorithm in reversible data hiding, with the application associated with the quick response (QR) codes. QR codes are random patterns, which can be commonly observed on the corner of posters or webpages. The goal of QR codes aims at convenienceoriented applications for mobile phone users. People can use the mobile phone cameras to capture QR code at the corner of web page, and then the hyperlink corresponding to the QR code can be accessed instantly. Since QR code looks like random noise and it occupies a corner of the original image, its existence can greatly reduce the value of the original content. Thus, how to retain the value of original image, while keeping the capability for the instant access for webpages, would be the major concern of this paper. With the aid of our reversible data hiding technique, the QR codes can be hidden into the original image, and considerable increase in embedding capacity can be expected. Next, we propose a scheme such that when the image containing the QR code is browsed, the hyperlink corresponding to the QR code is accessed first. Then, the QR code could get vanished and the original image would be recovered to retain the information conveyed therein. Simulation results demonstrate the applicability of the proposed algorithm.
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.