Embedding Area Research Articles

U-TPE: A universal approximate thumbnail-preserving encryption method for lossless recovery

Due to the limited local storage space, more and more people are accustomed to uploading images to the cloud, which has aroused concerns about privacy leaks. The traditional solution is to encrypt the images directly. However, in this way, users cannot easily browse the images stored in the cloud. Obviously, the traditional method has lost the visual usability of cloud images. To solve this problem, the Thumbnail-Preserving Encryption (TPE) method is proposed. Although approximate-TPE is more efficient than ideal TPE, it cannot restore the original image without damage and cannot encrypt some images with texture features. Inspired by the above, we propose a universal approximate thumbnail-preserving encryption method with lossless recovery. This method divides the image into equal-sized chunks, each of which is further divided into an embedding area and an adjustment area. The pixels of the embedding area are recorded by prediction. Then, the auxiliary information necessary to restore the image is encrypted and hidden in the embedding area of the encrypted image. Finally, the pixel values of the adjustment area in each block are adjusted so that the average value is close to the original block. Experimental results show that the proposed method can not only restore images losslessly but also process images with different texture features, achieving good generality. On the BOWS2 dataset, all images can be encrypted by adjusting the block size. In addition, it can resist third-party face recognition and comparison, achieving satisfactory results in balancing privacy and visual usability.

Optimal 2D Placement of Virtual Objects in Physical Space for Augmented Reality Applications

Optimal 2D Placement of Virtual Objects in Physical Space for Augmented Reality Applications

A blind watermarking approach based on hybrid Imperialistic Competitive Algorithm and SURF points for color Images’ authentication

Currently, we are in the area of the digital big data world. Every day, people share billions of images over Internet from various sources. Ensuring images’ authorship rights and illegal modification and/or reproductions become a challenge. Their protection must meet current and secure development needs of multimedia applications. In this paper, we propose an efficient watermarking scheme based on combining Imperialistic Competitive Algorithm (ICA), Speed Up Robust Features (SURF) points and Discrete Cosine Transform (DCT). The high complexity and inappropriate embedding area could lead to weak performance of watermarking schemas. To address these problems, an ideal watermarking embedding area was proposed using ICA to provide an optimized cost and complexity. The watermark was embedded into the DCT coefficients of the selected embedding areas. The watermark was extracted in a blind way to ensure color image’ authentication. Experimental findings demonstrate that the proposed approach achieves promising performance in terms of robustness and imperceptibility in almost cases. The average PSNR exceeds 61db regarding the imperceptibility. For the robustness measured by the correlation coefficients between the original watermark and the extracted is close to 1 in almost cases.

Adaptive Image Steganography Using Fuzzy Enhancement and Grey Wolf Optimizer

Adaptive imagesteganography embeds secret messages into areas of cover images with complex features, including rich edges and complex textures. In this article, an adaptive image steganography technique based on the edge and complex texture areas of images is proposed, by comprehensively considering three rules in the design of image steganography. First, the embedding area is composed of the edge and complex texture areas of images, according to the complexity-first rule. Edge detection is realized by an improved fuzzy enhancement function, optimized by the grey wolf optimizer to detect both the weak and strong edges. Second, the minimum average classification error rate is used to assess the choice of the complex texture areas. Third, under the spreading rule, two different average filters and one KerBohme filter are used to design the cost function in the embedding areas. Finally, confidential information is adaptively embedded through syndrome-trellis codes. Experimental results show that the proposed algorithm outperforms seven classical adaptive image steganography algorithms on two steganalytic feature sets. The performance improvement is particularly significant when the payload is large.

Embedding Theorems and Area Operators on Bergman Spaces with Doubling Measure

We establish an embedding theorem for the weighted Bergman spaces induced by a positive Borel measure domega (y)dx with the doubling property omega (0,2t)le Comega (0,t). The characterization is given in terms of Carleson squares on the upper half-plane. As special cases, our result covers the standard weights and logarithmic weights. As an application, we also establish the boundedness of the area operator.

Embedding and Extraction of Color Image Digital Watermark Based on Quaternion Fourier Transform

With the rapid development of computer and network technology, digital products, especially color digital images, can be popularized on the Internet, but because of their easy access and large-scale copying characteristics, their copyright protection has become increasingly difficult, and piracy and infringement and other issues are becoming more and more serious. Therefore, watermarking technology has increasingly attracted people's attention. Whether it is using digital or color images as host graphics or watermarking materials, it has become one of the hottest watermarking technologies. This article intends to explore the method of embedding and extracting the color image digital watermark using quaternion Fourier transform, and theoretically analyzes the quaternion representation, quaternion Fourier transformation, and logarithmic polar coordinate transformation of color images. And select the middle and low frequency area of the final real part of the quaternion Fourier transform as the embedding area, and carry out the method and process of watermark embedding and extraction. The simulation results show that, in the most typical attack form, the above-mentioned dynamic watermark embedding and extraction algorithm can not only effectively combat filtering attacks and noise intrusion, but also has absolute advantages in combating shear damage.

Information hiding algorithm based on edge detection and holographic watermarking

In order to improve the robustness of the image watermarking and reduce the influence of the overall image quality of the carrier when watermark is embedded on the carrier, an edge detection method combined with holographic watermarking was proposed to realize the hiding of watermark information. The carrier image is processed by edge detection, the watermark embedding area is segmented in the carrier image, and the suitable embedding area is filtered according to the size of the watermark; the original watermark is processed by a four-step phase shift algorithm to generate a holographic watermark, and the holographic watermark is embedded in the selection The embedding area is completed to embed the watermark, and the carrier image which the watermark is embedded in is carrier image with watermark. The watermark extraction method is to perform the same edge detection segmentation and region screening on the watermark carrier image, find the embedded area of the watermark, extract the holographic watermark, perform holographic inverse transformation to obtain the original watermark image, and complete the watermark recovery. The algorithm which is based on edge detection and holographic watermarking reduces the influence of embedded watermark on the carrier image, increases the flexibility and concealment of embedded position, and improves the robustness of the image when it is under geometric attacks.

Time-effect observation of stimulating effect on acupoints after micro-invasion embedding in healthy subjects

To in vivo dynamically observe the time-effect characteristic of local stimulating effect on acupoints after micro-invasion embedding, which could provide references for the interval period of micro-invasion embedding. With magnetic resonance imaging (MRI) technique, the local T2WI fat-suppression images and T2 Mapping 8-echo sequence images were collected at multiple time points from 8 healthy subjects who received embedding at left Sanyinjiao (SP 6).After the 8-echo sequence images were transformed into T2 Mapping images by using software FuncTool, the T2 average value of embedding area was measured, and the changes of local signal strength of T2WI fat-suppression images and T2 average value along with time after embedding at left Sanyinjiao (SP 6)were analyzed. Compared before embedding, the signal strength of local T2WI fat-suppression images and the T2 average value began to increase 8 h after being embedded(P<0.01); the signal strength of T2WI fat-suppression images and the T2 average value were significantly increased 3 d and 7 d after being embedded(all P<0.01);the signal strength of local T2WI fat-suppression images and the T2 average value 14 d after being embedded were lower than those at previous 2 time points, but higher than those before embedding(both P<0.01); 21 d, 28 d and 35 d after embedding, the signal strength of local T2WI fat-suppression images and the T2 average value were similar to those before treatment (all P>0.05). After micro-invasion embedding at Sanyinjiao (SP 6), the stimulation effect period on acupoint is approximately 21 days.When applying micro-invasion embedding under similar condition at acupoints which has similar structure as Sanyinjiao (SP 6), the interval period of embedding could consider 21 days as a reference.

A robust medical image watermarking against salt and pepper noise for brain MRI images

The ever-growing numbers of medical digital images and the need to share them among specialists and hospitals for better and more accurate diagnosis require that patients' privacy be protected. During the transmission of medical images between hospitals or specialists through the network, the main priority is to protect a patient's documents against any act of tampering by unauthorised individuals. Because of this, there is a need for medical image authentication scheme to enable proper diagnosis on patient. In addition, medical images are also susceptible to salt and pepper impulse noise through the transmission in communication channels. This noise may also be intentionally used by the invaders to corrupt the embedded watermarks inside the medical images. A common drawback of existing watermarking methods is their weakness against salt and pepper noise. The research carried out in this work addresses the issue of designing a new watermarking method that can withstand high density of salt and pepper noise for brain MRI images. For this purpose, combination of a spatial domain watermarking method, channel coding and noise filtering schemes are used. The region of non-interest (RONI) of MRI images from five different databases are used as embedding area and electronic patient record (EPR) is considered as embedded data. The quality of watermarked image is evaluated using Peak Signal-to-Noise Ratio (PSNR) and Structural Similarity Index (SSIM), and the accuracy of the extracted watermark is assessed in terms of Bit Error Rate (BER).

The territorial dispossession by mega-mining and contract farming in Zacatecas, Mexico

The article aims to study land management to boost mining megaprojects and contract farming in Zacatecas, which generates rootless accumulation and destroys natural and human life. This is also a relevant study on development in Zacatecas as it takes into consideration the new spaces for capital accumulation (food, minerals and water) that destroy the territories in Latin America and, by extension, in Mexico. The guiding question tackles main projects plundering natural commons that have been implemented by the extractive capital in Zacatecas and how the government influences in implementing these projects. The hypothesis states that the territorial dispossession caused by extractive megaprojects in mining and contract farming under the control of corporate capital during the neoliberal management in Zacatecas focused on the looting of natural commons, exploitation of cheap labor and transfer of economic surplus, human and environmental degradation. The preliminary results indicate that the state of Zacatecas has become a social embedding area where corporate capital deprives communities of natural and human wealth and overexploits cheap labor.

A Novel DWT-Based Watermarking for Image with The SIFT

A kind of scale invariant features transformation (SIFT for short) operators on DWT domain are proposed for watermarking algorithm. Firstly, the low frequency of the image is obtained by DWT. And then the SIFT transformation is used to calculate the key feature points for the low frequency sub-image. Based on the chosen space’s key points with moderate scale, a circular area as watermark embedding area is constructed. According to the research and final results, the novel digital watermark algorithm is proposed benefiting from the characteristics of SIFT’s key points and local time-frequency of DWT. The algorithm not only has good robustness to resist on such operations as compression, shearing, noise addition, median filtering and scaling, but also has good inhibition to possible watermark fake verification.

Joint fingerprinting and decryption content security protection method for remote sensing images based on neighborhood similarity

The joint fingerprinting and decryption (JFD) framework has high efficiency and can provide comprehensive, effective content security protection for remote sensing images. However, the fingerprint is generated by random partial decryption in JFD, which will lead to obvious degradation of image quality after embedding fingerprints and will severely impact the precision and further application of remote sensing images. In order to solve this problem, an improved JFD scheme based on neighborhood similarity is proposed in this paper, where the image is partitioned into different regions, and the regions that affect future application most are excluded from the fingerprint embedding area. Moreover, neighborhood similarity is defined in order to evaluate the change of pixel correlation, and areas with good neighborhood similarity after encryption are chosen to embed fingerprints. The experimental results prove that the fingerprinted image has a good image quality, and it will not affect the following application such as edge extraction and unsupervised classification, etc. Therefore, it is a suitable content security protection method for remote sensing image.

Multiple Causal Window Based Reversible Data Embedding

Reversible data embedding is a technique that embeds data into an image in a reversible manner. An important aspect of reversible data embedding is to find embedding area in the image and to embed the data into it. In the conventional reversible techniques, the visual quality is not taken into account which resulted in a poor quality of the embedded images. Hence the histogram modification based reversible data hiding technique using multiple causal windows is proposed which predicts the embedding level with the help of the pixel value, edge value, Just Noticeable Difference(JND) value. Using this data embedding level the data is embedded into the pixels. The pixel level adjustment considering the Human Visual System (HVS) characteristics is also made to reduce the distortion caused by data embedding. This significantly improves the data embedding capacity along with greater visual quality. The proposed method includes three phases: (i).Construction of casual window and calculation of edge and JND values in which the casual window determines the pixel values, the edge and the JND values are calculated (ii).Data embedding which is the process of embedding the data into the original image (iii). Data extractor and image recovery where the original image is recovered and the embedded bits are obtained. The experimental results and performance comparison with other reversible data hiding algorithms are presented to demonstrate the validity of the proposed algorithm. The experimental results show that the Performance of the proposed system on an average shows an accuracy of 95%.

Content security protection for remote sensing images integrating selective content encryption and digital fingerprint

Content security protection methods should be adopted to guarantee the security of highly sensitive remote sensing images during their transmission and usage. The joint fingerprinting and decryption (JFD) framework, which integrates encryption and fingerprinting, can provide comprehensive, effective content security protection for remote sensing information. However, several challenges need to be overcome. In order to solve the contradictory relationship between encryption security and fingerprinted image quality in JFD, a selective content encryption strategy is proposed to enhance encryption security and a new method for choosing fingerprint embedding area is proposed to reduce partial decryption's influence on image quality. Furthermore, a new method for generating and controlling fingerprints is introduced to JFD to eliminate its vulnerability to collusion attacks. The experiment results show that the proposed techniques are highly effective. Because of its high security, good fingerprinted image quality and high data processing and transmission speed, the new JFD scheme is an effective content security protection approach for remote sensing images, especially suitable for massive remote sensing images.

Clinical Significance of Tumor Regression Grade in Rectal Cancer with Preoperative Chemoradiotherapy

PurposeNeoadjuvant chemoradiotherapy applied to the locally advanced rectal cancer reduces local recurrence and improves survival. We assessed tumor regression grade (TRG) and its influence on survival in rectal cancer patients treated with chemoradiotherapy followed by surgical resection.MethodsWe studied 108 patients that were seen at our hospital between August 2004 and December 2008. Patients received preoperative chemoradiotherapy consisting of 5-fluorouracil and leucovorin by continous infusion during the first and fifth week, delivered with concurrent pelvic radiation of 50.4 Gy, followed by radical surgery at 6-8 weeks. The TRG was determined by the amount of fibrosis in the tumor embedding area and was divided into 5 grades based on the relative amount of fibrosis. We analyzed all preoperative clinicopathologic factors, postoperative pathologic stages, TRG and prognosis, retrospectively.ResultsDownstaging of rectal cancer through neoadjuvant chemoradiotherapy occurred in 64 (59%) patients. The numbers of total regressions (TRG4), good regressions (TRG3), moderate regressions (TRG2), minor regressions (TRG1), and no regression (TRG0) were 19 (18%), 65 (60%), 17 (16%), 6 (5%), and 1 (1%) respectively. The TRG was inversely correlated with perineural invasion and lymphovascular invasion (P = 0.008, P = 0.032). The local recurrence rate declined as the tumor regression grade increased (P = 0.032). The 19 patients with TRG4 had a better three-year disease free survival than the 89 patients with TRG0-3 (P = 0.034). The 16 patients with pathologic complete remission (pCR) had a better three-year disease free survival than the 92 patients with non-pCR (P = 0.025).ConclusionHigher TRG after preoperative chemoradiotherapy for rectal cancer closely correlates with better survival and low local recurrence. The TRG is considered to be a significant prognostic factor.

Block-based reversible data embedding

This paper proposes a block-based reversible data embedding method applied to grayscale cover images. The image is first divided into two areas: data embedding area and auxiliary information embedding area. The data embedding area is further partitioned into 3∗3 blocks. According to two predefined thresholds, all the blocks are divided into three categories: smooth, normal or complex. The complex blocks do not embed any data. A smooth block will embed twice the data of a normal block. After predicting the edge direction in a smooth or normal block, Alattar's difference expansion of a generalized integer transform method is exploited to embed data into each vector in the block. Then, the location map and other auxiliary information are embedded in the auxiliary information embedding area using a novel least significant bit (LSB) substitution method. Our method not only improves the embedded image quality but also provides a higher payload capacity compared to Alattar's method. For some smoother images, the embedding capacity of the proposed method is higher than 1 bit/pixel in a single pass and also derives acceptable embedded image quality (PSNR⩾30). To the best of our knowledge, the proposed method is the first to do this.

改ざんを考慮した動画像の電子透かしに関する二，三の考察

Since illegal copying of digital contents is becoming a serious problem, this paper proposes a new digital watermarking method using motion compensated vectors of a digital video coding algorithm such as MPEG. The embedded information is protected by error correcting code from an alteration attack. The error probability of the embedded information after a re-encoding attack can potentially he made less than 10-5 for appropriate parameter values. The relationship between the SNR-of the proposed method and resistance to re-encoding attack is also considered. We also propose several new embedding methods that can improve the SNR of a video signal with a digital watermark by controlling the embedding area adaptively. We expect the proposed method to play an important role in copyright protection of multimedia contents in the coming network society.

Embedding area of d‐way shuffle graph on a VLSI model

AbstractAn important problem in the design of a VLSI chip is that of determining how much area is taken to embed a graph G into a planar grid when the VLSI chip is modeled using a graph called a planar grid and a circuit is expressed by a graph G representing wiring connections between elements. Discussed for various graphs will be the upper and lower bounds on the planar grid area into which a graph is embedded. In this paper we consider the problem of embedding a d‐way shuffle graph into a planar grid, using a model which has been extended so that a graph with degree five or more can be embedded. d‐way shuffle graphs are also of theoretical interest since data exchange can be done in high speed like a shuffle exchange graph and a CCC. By using a relationship between the number of crossings of a graph and its area, we show that for the infinite number of d and k an area proportional to dk+1/k)2 is required to embed a dk‐vertex, d‐way shuffle graph. Using this result, the previous lower bound of the area can be improved. Further, for an embedding of a graph G we present an embedding method of G which uses a graph with a known embedding area. By using this result we show that if d is a power of 2, a dk‐vertex, d‐way shuffle graph can be embedded in an area proportional to (dk+1/2)2.