Reversible Data Hiding Using Prediction-based Adaptive Embedding

[[abstract]]In this paper, we propose a new algorithm in reversible data hiding with prediction-based scheme. Reversible data hiding can be implemented with two types, one is by modifying the histogram of images, named the histogram-based scheme, and the other is by changing the difference value between neighboring pixels, called the difference-expansion-based (DE-based) method. Considering the ease of implementation, we employ the histogram-based scheme as the base, integrated with the DE-based methods, which is famous for the abundance in embedding capacity, in our algorithm. For hiding the secret information, the differences between original and predicted images are produced firstly, and they are intentionally altered to make reversible data hiding possible. By utilizing the advantages from the two types of methods, by change of histograms of difference values, global and local characteristics of original images can be utilized for hiding more capacity with acceptable quality of output image. With our method, it performs better in embedding capacity, image quality, and side information than conventional algorithm in literature. It also has the potential for the integration to relating algorithms for practical applications.[[sponsorship]]Korea Information Processing Society (KIPS)[[incitationindex]]EI[[conferencetype]]國際[[conferencedate]]20121220~20121222[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]Hong Kon

Reversible data hiding using enhanced prediction for progressive image transmission

[[conferencetype]]國際[[conferencedate]]20150128~20150131[[booktype]]紙本[[booktype]]電子版[[iscallforpapers]]

Watermarking for compressive sampling applications

[[abstract]]Compressive sampling is a newly developed topic in the field of data compression. For current researches, compressive sampling techniques focus on compression performances. There are very few papers aiming at the integration of watermarking into compressive sampling systems. In this paper, we propose an innovative scheme that considers the copyright protection of data with compressive sampling. By carefully utilizing the relationships between coefficients, very few amounts of transmitted coefficients are capable of reconstructing the image to some extent. Moreover, secret information embedded beforehand can be recovered with acceptable rate in correctly extracted bits even experiencing through the lossy channels for data delivery. Simulation results with our algorithm have demonstrated the effectiveness for integrating watermarking into compressive sampling systems.[[sponsorship]]IEEE; European Association for Biometrics[[conferencetype]]國際[[conferencedate]]20120718~20120720[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]Piraeus, Greec

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

New genetic loci link adipose and insulin biology to body fat distribution.

Body fat distribution is a heritable trait and a well-established predictor of adverse metabolic outcomes, independent of overall adiposity. To increase our understanding of the genetic basis of body fat distribution and its molecular links to cardiometabolic traits, here we conduct genome-wide association meta-analyses of traits related to waist and hip circumferences in up to 224,459 individuals. We identify 49 loci (33 new) associated with waist-to-hip ratio adjusted for body mass index (BMI), and an additional 19 loci newly associated with related waist and hip circumference measures (P < 5 × 10(-8)). In total, 20 of the 49 waist-to-hip ratio adjusted for BMI loci show significant sexual dimorphism, 19 of which display a stronger effect in women. The identified loci were enriched for genes expressed in adipose tissue and for putative regulatory elements in adipocytes. Pathway analyses implicated adipogenesis, angiogenesis, transcriptional regulation and insulin resistance as processes affecting fat distribution, providing insight into potential pathophysiological mechanisms

Hierarchy-based reversible data hiding

[[abstract]]In this paper, we propose a new method for reversible data hiding by employing the hierarchical relationships of original images. There are many parameters for accessing the performances of reversible data hiding algorithms, including the output image quality, the hiding capacity, and the overhead for decoding. Considering the ease of implementation and the little overhead needed for decoding, we employ modification of difference values between pixels by using histogram-based scheme with extensions to pyramidal structure by utilizing inherent characteristics of original images. By doing so, global and local characteristics of original images can be utilized for hiding more capacity with acceptable quality of output image. With our method, better performances can be obtained with enhanced image quality, the more embedding capacity, and comparable amount of side information for decoding. More importantly, the reversibility of our method is guaranteed, meaning that original image and hidden message can both be perfectly recovered at the decoder. Simulation results demonstrate that proposed method in this paper outperforms those in conventional algorithms.[[journaltype]]國外[[incitationindex]]SCI[[ispeerreviewed]]Y[[booktype]]紙本[[booktype]]電子版[[countrycodes]]GB

Error control for block-based compressed sensing with quadtree partition concepts

Block-based compressed sensing has been a popular topic in image compression researches. A major portion of papers with this topic concentrates on compression performances based on rate-distortion theory. Here, we focus on the performances of reconstructed images with the transmission over lossless and lossy channels. Conventional block-based compressed sensing chooses fixed-sized square blocks to perform encoding. With quadtree partition that is based on the characteristics of image regions, we can separate square blocks with different sizes, and then perform compressed sensing independently. By fixing the measurement rate in both cases, we can observe and compare the performances with fixed-sized blocks and those with quadtree partition with the different percentages of block sizes. Better performances with quadtree partition can be observed in most cases.補正完畢國際Nara, JapanJP

Enhancements of visual secret sharing with quick response codes

Visual secret sharing is the method for distributing a secret among a group by using images which can be seen by user groups. Each group holds a share, and with the sufficient amount of shares, the secret can be obtained. When the number of shares is below the threshold, secret would be unable to be acquired. We consider using the quick response (QR) codes, which can be captured by camera phones, to produce the shares for visual secret sharing. With the conventional method, reconstructed QR code can be captured and linked to the webpage while receiving insufficient number of shares, implying the leakage of secret. With our method, sufficient number of shares should be obtained to make the reconstructed QR code possible of delivering the information therein after capturing with the mobile phone camera. Hence, the security with visual secret sharing can be assured.補正完畢國際Nara, JapanJP

Error control for compressed sensing transmission with polar codes

[[notice]]補正完

Reversible data hiding with prediction-based multi-bit embedding and multi-level difference alteration

[[abstract]]Applications of digital rights management (DRM) have been developed for some years. Among them, watermarking or data hiding techniques work along with encryption algorithms to protect the copyright of multimedia contents. Nowadays, people tend to capture images with smart phones, and then they can transmit the image online instantly. Therefore, DRM relating issues have practical applications, and methods with reversible data hiding have also been developed. Among the categories in reversible data hiding, by altering the difference values relating to original image seems effective with good performance. We employ prediction techniques to produce the predicted image, and then to calculate the differences between original image and predicted one. Unlike conventional methods to embed one bit at a time, we embed multiple bits at a time based on the characteristics of images to look for enhanced amount of capacity. Simulation results have pointed out the enhancement in embedding capacities, and the improvements in overall performances over relating methods in literature.[[notice]]補正完