78 research outputs found

    Hybrid chaotic map with L-shaped fractal Tromino for image encryption and decryption

    Get PDF
    Insecure communication in digital image security and image storing are considered as important challenges. Moreover, the existing approaches face problems related to improper security at the time of image encryption and decryption. In this research work, a wavelet environment is obtained by transforming the cover image utilizing integer wavelet transform (IWT) and hybrid discrete cosine transform (DCT) to completely prevent false errors. Then the proposed hybrid chaotic map with L-shaped fractal Tromino offers better security to maintain image secrecy by means of encryption and decryption. The proposed work uses fractal encryption with the combination of L-shaped Tromino theorem for enhancement of information hiding. The regions of L-shaped fractal Tromino are sensitive to variations, thus are embedded in the watermark based on a visual watermarking technique known as reversible watermarking. The experimental results showed that the proposed method obtained peak signal-to-noise ratio (PSNR) value of 56.82dB which is comparatively higher than the existing methods that are, Beddington, free, and Lawton (BFL) map with PSNR value of 8.10 dB, permutation substitution, and Boolean operation with PSNR value of 21.19 dB and deoxyribonucleic acid (DNA) level permutation-based logistic map with PSNR value of 21.27 dB

    A Robust Image Authentication Method Based on Wavelet Transform and Teager Energy Operator

    Full text link

    Digital rights management (DRM) - watermark encoding scheme for JPEG images

    Get PDF
    The aim of this dissertation is to develop a new algorithm to embed a watermark in JPEG compressed images, using encoding methods. This encompasses the embedding of proprietary information, such as identity and authentication bitstrings, into the compressed material. This watermark encoding scheme involves combining entropy coding with homophonic coding, in order to embed a watermark in a JPEG image. Arithmetic coding was used as the entropy encoder for this scheme. It is often desired to obtain a robust digital watermarking method that does not distort the digital image, even if this implies that the image is slightly expanded in size before final compression. In this dissertation an algorithm that combines homophonic and arithmetic coding for JPEG images was developed and implemented in software. A detailed analysis of this algorithm is given and the compression (in number of bits) obtained when using the newly developed algorithm (homophonic and arithmetic coding). This research shows that homophonic coding can be used to embed a watermark in a JPEG image by using the watermark information for the selection of the homophones. The proposed algorithm can thus be viewed as a ‘key-less’ encryption technique, where an external bitstring is used as a ‘key’ and is embedded intrinsically into the message stream. The algorithm has achieved to create JPEG images with minimal distortion, with Peak Signal to Noise Ratios (PSNR) of above 35dB. The resulting increase in the entropy of the file is within the expected 2 bits per symbol. This research endeavor consequently provides a unique watermarking technique for images compressed using the JPEG standard.Dissertation (MEng)--University of Pretoria, 2008.Electrical, Electronic and Computer Engineeringunrestricte

    Multibiometric security in wireless communication systems

    Get PDF
    This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 05/08/2010.This thesis has aimed to explore an application of Multibiometrics to secured wireless communications. The medium of study for this purpose included Wi-Fi, 3G, and WiMAX, over which simulations and experimental studies were carried out to assess the performance. In specific, restriction of access to authorized users only is provided by a technique referred to hereafter as multibiometric cryptosystem. In brief, the system is built upon a complete challenge/response methodology in order to obtain a high level of security on the basis of user identification by fingerprint and further confirmation by verification of the user through text-dependent speaker recognition. First is the enrolment phase by which the database of watermarked fingerprints with memorable texts along with the voice features, based on the same texts, is created by sending them to the server through wireless channel. Later is the verification stage at which claimed users, ones who claim are genuine, are verified against the database, and it consists of five steps. Initially faced by the identification level, one is asked to first present one’s fingerprint and a memorable word, former is watermarked into latter, in order for system to authenticate the fingerprint and verify the validity of it by retrieving the challenge for accepted user. The following three steps then involve speaker recognition including the user responding to the challenge by text-dependent voice, server authenticating the response, and finally server accepting/rejecting the user. In order to implement fingerprint watermarking, i.e. incorporating the memorable word as a watermark message into the fingerprint image, an algorithm of five steps has been developed. The first three novel steps having to do with the fingerprint image enhancement (CLAHE with 'Clip Limit', standard deviation analysis and sliding neighborhood) have been followed with further two steps for embedding, and extracting the watermark into the enhanced fingerprint image utilising Discrete Wavelet Transform (DWT). In the speaker recognition stage, the limitations of this technique in wireless communication have been addressed by sending voice feature (cepstral coefficients) instead of raw sample. This scheme is to reap the advantages of reducing the transmission time and dependency of the data on communication channel, together with no loss of packet. Finally, the obtained results have verified the claims

    Study and Implementation of Watermarking Algorithms

    Get PDF
    Water Making is the process of embedding data called a watermark into a multimedia object such that watermark can be detected or extracted later to make an assertion about the object. The object may be an audio, image or video. A copy of a digital image is identical to the original. This has in many instances, led to the use of digital content with malicious intent. One way to protect multimedia data against illegal recording and retransmission is to embed a signal, called digital signature or copyright label or watermark that authenticates the owner of the data. Data hiding, schemes to embed secondary data in digital media, have made considerable progress in recent years and attracted attention from both academia and industry. Techniques have been proposed for a variety of applications, including ownership protection, authentication and access control. Imperceptibility, robustness against moderate processing such as compression, and the ability to hide many bits are the basic but rat..

    Schémas de tatouage d'images, schémas de tatouage conjoint à la compression, et schémas de dissimulation de données

    Get PDF
    In this manuscript we address data-hiding in images and videos. Specifically we address robust watermarking for images, robust watermarking jointly with compression, and finally non robust data-hiding.The first part of the manuscript deals with high-rate robust watermarking. After having briefly recalled the concept of informed watermarking, we study the two major watermarking families : trellis-based watermarking and quantized-based watermarking. We propose, firstly to reduce the computational complexity of the trellis-based watermarking, with a rotation based embedding, and secondly to introduce a trellis-based quantization in a watermarking system based on quantization.The second part of the manuscript addresses the problem of watermarking jointly with a JPEG2000 compression step or an H.264 compression step. The quantization step and the watermarking step are achieved simultaneously, so that these two steps do not fight against each other. Watermarking in JPEG2000 is achieved by using the trellis quantization from the part 2 of the standard. Watermarking in H.264 is performed on the fly, after the quantization stage, choosing the best prediction through the process of rate-distortion optimization. We also propose to integrate a Tardos code to build an application for traitors tracing.The last part of the manuscript describes the different mechanisms of color hiding in a grayscale image. We propose two approaches based on hiding a color palette in its index image. The first approach relies on the optimization of an energetic function to get a decomposition of the color image allowing an easy embedding. The second approach consists in quickly obtaining a color palette of larger size and then in embedding it in a reversible way.Dans ce manuscrit nous abordons l’insertion de donnĂ©es dans les images et les vidĂ©os. Plus particuliĂšrement nous traitons du tatouage robuste dans les images, du tatouage robuste conjointement Ă  la compression et enfin de l’insertion de donnĂ©es (non robuste).La premiĂšre partie du manuscrit traite du tatouage robuste Ă  haute capacitĂ©. AprĂšs avoir briĂšvement rappelĂ© le concept de tatouage informĂ©, nous Ă©tudions les deux principales familles de tatouage : le tatouage basĂ© treillis et le tatouage basĂ© quantification. Nous proposons d’une part de rĂ©duire la complexitĂ© calculatoire du tatouage basĂ© treillis par une approche d’insertion par rotation, ainsi que d’autre part d’introduire une approche par quantification basĂ©e treillis au seind’un systĂšme de tatouage basĂ© quantification.La deuxiĂšme partie du manuscrit aborde la problĂ©matique de tatouage conjointement Ă  la phase de compression par JPEG2000 ou par H.264. L’idĂ©e consiste Ă  faire en mĂȘme temps l’étape de quantification et l’étape de tatouage, de sorte que ces deux Ă©tapes ne « luttent pas » l’une contre l’autre. Le tatouage au sein de JPEG2000 est effectuĂ© en dĂ©tournant l’utilisation de la quantification basĂ©e treillis de la partie 2 du standard. Le tatouage au sein de H.264 est effectuĂ© Ă  la volĂ©e, aprĂšs la phase de quantification, en choisissant la meilleure prĂ©diction via le processus d’optimisation dĂ©bit-distorsion. Nous proposons Ă©galement d’intĂ©grer un code de Tardos pour construire une application de traçage de traĂźtres.La derniĂšre partie du manuscrit dĂ©crit les diffĂ©rents mĂ©canismes de dissimulation d’une information couleur au sein d’une image en niveaux de gris. Nous proposons deux approches reposant sur la dissimulation d’une palette couleur dans son image d’index. La premiĂšre approche consiste Ă  modĂ©liser le problĂšme puis Ă  l’optimiser afin d’avoir une bonne dĂ©composition de l’image couleur ainsi qu’une insertion aisĂ©e. La seconde approche consiste Ă  obtenir, de maniĂšre rapide et sĂ»re, une palette de plus grande dimension puis Ă  l’insĂ©rer de maniĂšre rĂ©versible

    WG1N5315 - Response to Call for AIC evaluation methodologies and compression technologies for medical images: LAR Codec

    Get PDF
    This document presents the LAR image codec as a response to Call for AIC evaluation methodologies and compression technologies for medical images.This document describes the IETR response to the specific call for contributions of medical imaging technologies to be considered for AIC. The philosophy behind our coder is not to outperform JPEG2000 in compression; our goal is to propose an open source, royalty free, alternative image coder with integrated services. While keeping the compression performances in the same range as JPEG2000 but with lower complexity, our coder also provides services such as scalability, cryptography, data hiding, lossy to lossless compression, region of interest, free region representation and coding
    • 

    corecore