371 research outputs found
Recovering Missing Coefficients in DCT-Transformed Images
A general method for recovering missing DCT coefficients in DCT-transformed
images is presented in this work. We model the DCT coefficients recovery
problem as an optimization problem and recover all missing DCT coefficients via
linear programming. The visual quality of the recovered image gradually
decreases as the number of missing DCT coefficients increases. For some images,
the quality is surprisingly good even when more than 10 most significant DCT
coefficients are missing. When only the DC coefficient is missing, the proposed
algorithm outperforms existing methods according to experimental results
conducted on 200 test images. The proposed recovery method can be used for
cryptanalysis of DCT based selective encryption schemes and other applications.Comment: 4 pages, 4 figure
An Improved DC Recovery Method from AC Coefficients of DCT-Transformed Images
Motivated by the work of Uehara et al. [1], an improved method to recover DC
coefficients from AC coefficients of DCT-transformed images is investigated in
this work, which finds applications in cryptanalysis of selective multimedia
encryption. The proposed under/over-flow rate minimization (FRM) method employs
an optimization process to get a statistically more accurate estimation of
unknown DC coefficients, thus achieving a better recovery performance. It was
shown by experimental results based on 200 test images that the proposed DC
recovery method significantly improves the quality of most recovered images in
terms of the PSNR values and several state-of-the-art objective image quality
assessment (IQA) metrics such as SSIM and MS-SSIM.Comment: 6 pages, 6 figures, ICIP 201
A NOVEL JOINT PERCEPTUAL ENCRYPTION AND WATERMARKING SCHEME (JPEW) WITHIN JPEG FRAMEWORK
Due to the rapid growth in internet and multimedia technologies, many new
commercial applications like video on demand (VOD), pay-per-view and real-time
multimedia broadcast etc, have emerged. To ensure the integrity and confidentiality of
the multimedia content, the content is usually watermarked and then encrypted or vice
versa. If the multimedia content needs to be watermarked and encrypted at the same
time, the watermarking function needs to be performed first followed by encryption
function. Hence, if the watermark needs to be extracted then the multimedia data
needs to be decrypted first followed by extraction of the watermark. This results in
large computational overhead. The solution provided in the literature for this problem
is by using what is called partial encryption, in which media data are partitioned into
two parts - one to be watermarked and the other is encrypted. In addition, some
multimedia applications i.e. video on demand (VOD), Pay-TV, pay-per-view etc,
allow multimedia content preview which involves „perceptual‟ encryption wherein all
or some selected part of the content is, perceptually speaking, distorted with an
encryption key. Up till now no joint perceptual encryption and watermarking scheme
has been proposed in the literature.
In this thesis, a novel Joint Perceptual Encryption and Watermarking (JPEW)
scheme is proposed that is integrated within JPEG standard. The design of JPEW
involves the design and development of both perceptual encryption and watermarking
schemes that are integrated in JPEG and feasible within the „partial‟ encryption
framework. The perceptual encryption scheme exploits the energy distribution of AC
components and DC components bitplanes of continuous-tone images and is carried
out by selectively encrypting these AC coefficients and DC components bitplanes.
The encryption itself is based on a chaos-based permutation reported in an earlier
work. Similarly, in contrast to the traditional watermarking schemes, the proposed
watermarking scheme makes use of DC component of the image and it is carried out
by selectively substituting certain bitplanes of DC components with watermark bits.
vi ii
Apart from the aforesaid JPEW, additional perceptual encryption scheme, integrated
in JPEG, has also been proposed. The scheme is outside of joint framework and
implements perceptual encryption on region of interest (ROI) by scrambling the DCT
blocks of the chosen ROI.
The performances of both, perceptual encryption and watermarking schemes are
evaluated and compared with Quantization Index modulation (QIM) based
watermarking scheme and reversible Histogram Spreading (RHS) based perceptual
encryption scheme. The results show that the proposed watermarking scheme is
imperceptible and robust, and suitable for authentication. Similarly, the proposed
perceptual encryption scheme outperforms the RHS based scheme in terms of number
of operations required to achieve a given level of perceptual encryption and provides
control over the amount of perceptual encryption. The overall security of the JPEW
has also been evaluated. Additionally, the performance of proposed separate
perceptual encryption scheme has been thoroughly evaluated in terms of security and
compression efficiency. The scheme is found to be simpler in implementation, have
insignificant effect on compression ratios and provide more options for the selection
of control factor
Literature Study On Cloud Based Healthcare File Protection Algorithms
There is a huge development in Computers and Cloud computing technology, the trend in recent years is to outsource information storage on Cloud-based services. The cloud provides large storage space. Cloud-based service providers such as Dropbox, Google Drive, are providing users with infinite and low-cost storage. In this project we aim at presenting a protection method through by encrypting and decrypting the files to provide enhanced level of protection. To encrypt the file that we upload in cloud, we make use of double encryption technique. The file is been encrypted twice one followed by the other using two algorithms. The order in which the algorithms are used is that, the file is first encrypted using AES algorithm, now this file will be in the encrypted format and this encrypted file is again encrypted using RSA algorithm. The corresponding keys are been generated during the execution of the algorithm. This is done in order to increase the security level. The various parameters that we have considered here are security level, speed, data confidentiality, data integrity and cipher text size. Our project is more efficient as it satisfies all the parameters whereas the conventional methods failed to do so. The Cloud we used is Dropbox to store the content of the file which is in the encrypted format using AES and RSA algorithms and corresponding key is generated which can be used to decrypt the file. While uploading the file the double encryption technique is been implemented
Digital watermarking in medical images
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 05/12/2005.This thesis addresses authenticity and integrity of medical images using watermarking. Hospital Information Systems (HIS), Radiology Information Systems (RIS) and Picture Archiving and Communication Systems (P ACS) now form the information infrastructure for today's healthcare as these provide new ways to store, access and distribute medical data that also involve some security risk. Watermarking can be seen as an additional tool for security measures. As the medical tradition is very strict with the quality of biomedical images, the watermarking method must be reversible or if not, region of Interest (ROI) needs to be defined and left intact. Watermarking should also serve as an integrity control and should be able to authenticate the medical image. Three watermarking techniques were proposed. First, Strict Authentication Watermarking (SAW) embeds the digital signature of the image in the ROI and the image can be reverted back to its original value bit by bit if required. Second, Strict Authentication Watermarking with JPEG Compression (SAW-JPEG) uses the same principal as SAW, but is able to survive some degree of JPEG compression. Third, Authentication Watermarking with Tamper Detection and Recovery (AW-TDR) is able to localise tampering, whilst simultaneously reconstructing the original image
Digital rights management techniques for H.264 video
This work aims to present a number of low-complexity digital rights management (DRM) methodologies for the H.264 standard. Initially, requirements to enforce DRM are analyzed and understood. Based on these requirements, a framework is constructed which puts forth different possibilities that can be explored to satisfy the objective. To implement computationally efficient DRM methods, watermarking and content based copy detection are then chosen as the preferred methodologies.
The first approach is based on robust watermarking which modifies the DC residuals of 4×4 macroblocks within I-frames. Robust watermarks are appropriate for content protection and proving ownership. Experimental results show that the technique exhibits encouraging rate-distortion (R-D) characteristics while at the same time being computationally efficient.
The problem of content authentication is addressed with the help of two methodologies: irreversible and reversible watermarks. The first approach utilizes the highest frequency coefficient within 4×4 blocks of the I-frames after CAVLC en- tropy encoding to embed a watermark. The technique was found to be very effect- ive in detecting tampering. The second approach applies the difference expansion (DE) method on IPCM macroblocks within P-frames to embed a high-capacity reversible watermark. Experiments prove the technique to be not only fragile and reversible but also exhibiting minimal variation in its R-D characteristics.
The final methodology adopted to enforce DRM for H.264 video is based on the concept of signature generation and matching. Specific types of macroblocks within each predefined region of an I-, B- and P-frame are counted at regular intervals in a video clip and an ordinal matrix is constructed based on their count. The matrix is considered to be the signature of that video clip and is matched with longer video sequences to detect copies within them. Simulation results show that the matching methodology is capable of not only detecting copies but also its location within a longer video sequence. Performance analysis depict acceptable false positive and false negative rates and encouraging receiver operating charac- teristics. Finally, the time taken to match and locate copies is significantly low which makes it ideal for use in broadcast and streaming applications
- …