oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 3 )

2019 ( 28 )

2018 ( 126 )

2017 ( 148 )

Custom range...

Search Results: 1 - 10 of 4470 matches for " Arnold Transform "
All listed articles are free for downloading (OA Articles)
Page 1 /4470
Display every page Item
A Fresnelet-Based Encryption of Medical Images using Arnold Transform
Muhammad Nazeer,Dai-Gyoung Kim,Bibi Nargis,Yasir Mehmood Malik
International Journal of Advanced Computer Sciences and Applications , 2013,
Abstract: Medical images are commonly stored in digital media and transmitted via Internet for certain uses. If a medical information image alters, this can lead to a wrong diagnosis which may create a serious health problem. Moreover, medical images in digital form can easily be modified by wiping off or adding small pieces of information intentionally for certain illegal purposes. Hence, the reliability of medical images is an important criterion in a hospital information system. In this paper, the Fresnelet transform is employed along with appropriate handling of the Arnold transform and the discrete cosine transform to provide secure distribution of medical images. This method presents a new data hiding system in which steganography and cryptography are used to prevent unauthorized data access. The experimental results exhibit high imperceptibility for embedded images and significant encryption of information images.
The best image scrambling degree of binary image based on Arnold transform
二值图像Arnold变换的最佳置乱度

HUANG Liang-yong,XIAO De-gui,
黄良永
,肖德贵

计算机应用 , 2009,
Abstract: In the context of digital watermark technology, this paper introduced binary image based Arnold transform and periodicity, and discussed the calculation methods of image scrambling degree in detail so that it elaborated the best formula of image scrambling degree with the combination of pixel value variance as well as pixels and 4 differ of the gray-level. The results show that the calculating method of the best image scrambling degree can well reveal the consistency of binary image scrambling degree and subjective visual effects.
Encryption Algorithm of Colored Watermark Image Based on Arnold Transform and Lorenz Chaos System
基于Arnold变换和Lorenz混沌系统的彩色水印图像加密算法

WANG Li-Li,
王丽丽

计算机系统应用 , 2012,
Abstract: This algorithm uses the Arnold transformation and the color image scrambling definition, to solve the Lorenz chaos system's dynamic equation, to obtain three chaos sequences. Then it carries on scrambling processing after Arnold scrambling's each color component. The simulation experiment result indicated that this algorithm has overcome the Arnold transformation and the Lorenz chaos system's shortcoming, can resist many kinds of attacks, enables the high security of the colored watermark image.
Strongly Robust and Highly Secured DWT-SVD Based Color Image Watermarking: Embedding Data in All Y, U, V Color Spaces
Baisa L. Gunjal,Suresh N. Mali
International Journal of Information Technology and Computer Science , 2012,
Abstract: In this paper ‘DWT-SVD’ based Color Image Watermarking technique in YUV color space using Arnold Transform is proposed. The RGB color image is converted into YUV color space. Image is decomposed by 3 level DWT and then SVD is applied. The security is increased with watermark scrambling using Arnold Transform. The watermark is embedded in all Y,U and V color spaces in HL3 region. The decomposition is done with ‘Haar’ which is simple, symmetric and orthogonal wavelet and the direct weighting factor is used in watermark embedding and extraction process is used. PSNR and Normalized Correlations (NC) values are tested for 10 different values of flexing factor. We got maximum PSNR up to 52.3337 for Y channel and average value of NC equal to 0.99 indicating best recovery of watermark. The proposed scheme is non blind and strongly robust to different attacks like compression, scaling, rotation, cropping and Noise addition which is tested with standard database image of size 512x512 and watermark of size 64X64.
Digital Watermarking Algorithm based on Singular Value Decomposition and Arnold Transform
Divya Saxena
International Journal of Electronics and Computer Science Engineering , 2012,
Abstract: basically the Watermarking process is use for hiding secret information for labeling digital picture. This paper presents a method of watermark embedding and extracting which is based on SVD (singular value decomposition) and Arnold Transform. The SVD is a linear algebra technique used for diagonalizable matrices and it transfer of convert most of the signal energy into very few singular values. The embedded position is selected according to the secret key which is obtained during the course of the scrambling degree calculation in Arnold transform. The experimental results showed that the Arnold transformation helpful in digital watermarking process. A group of experiments are used for test the effectiveness of the proposed algorithm, and experimental results show that the scheme is effectiveness and robust against different image processing operation. The experimental results show that the proposed method has high PSNR and NC results under general image processing.
Blind 3D Model Watermarking based on Multi-Resolution Representation and Fuzzy Logic
Sharvari C. Tamane,Ratnadeep R. Deshmukh
International Journal of Computer Science & Information Technology , 2012,
Abstract: Insertion of a text message, audio data or/and an image into another image or 3D model is called as a watermarking process. Watermarking has variety of applications like: Copyright Protection, Owner Identification, Copy Protection and Data Hiding etc., depending upon the type of watermark insertion algorithm. Watermark remains in the content after applying various attacks without any distortions. The blind watermarking method used in the system is based on a wavelet transform, a fuzzy inference system and a multi-resolution representation (MRR) of the 3d model. The watermark scrambled by Arnold Transform is embedded in the wavelet coefficients at third resolution level of the MRR. Fuzzy logic approach used in the method makes it to approximate the best possible gain with an accurate scaling factor so that the watermark remains invisible. The fuzzy input variables are computed for each wavelet coefficient in the 3D model. The output of the fuzzy system is a single value which is a perceptual value for each corresponding wavelet coefficient. Thus, the fuzzy perceptual mask combines all these nonlinear variables to build a simple, easy to use HVS model. Results shows that the system is robust against affine transformations, smoothing, cropping and noise attacks.
A Security Enhanced Robust Steganography Algorithm for Data Hiding
Siddharth Singh,Tanveer J Siddiqui
International Journal of Computer Science Issues , 2012,
Abstract: In this paper, a new robust steganography algorithm based on discrete cosine transform (DCT), Arnold transform and chaotic system is proposed. The chaotic system is used to generate a random sequence to be used for spreading data in the middle frequency band DCT coefficient of the cover image. The security is further enhanced by scrambling the secret data using Arnold Cat map before embedding. The recovery process is blind. A series of experiments is conducted to prove the security and robustness of the proposed algorithm. The experimental results demonstrate that the proposed algorithm achieves higher security and robustness against JPEG compression, addition of noise, low pass filtering and cropping attacks as compared to other existing algorithms for data hiding in the DCT domain.
Secure Image Encryption without Size Limitation Using Arnold Transform and Random Strategies
Zhenjun Tang,Xianquan Zhang
Journal of Multimedia , 2011, DOI: 10.4304/jmm.6.2.202-206
Abstract: Encryption is an efficient way to protect the contents of digital media. Arnold transform is a significant technique of image encryption, but has weaknesses in security and applications to images of any size. To solve these problems, we propose an image encryption scheme using Arnold transform and random strategies. It is achieved by dividing the image into random overlapping square blocks, generating random iterative numbers and random encryption order, and scrambling pixels of each block using Arnold transform. Experimental results show that the proposed encryption scheme is robust and secure. It has no size limitation, indicating the application to any size images.
2D Triangular Mappings and Their Applications in Scrambling Rectangle Image
Li-Ping Shao,Zheng Qin,Hong-Jiang Gao,Xing-Chen Heng
Information Technology Journal , 2008,
Abstract: The conventional 2D matrix transform represented by 2D Arnold transform and 2D Fibonacci-Q transform is applied widely in the security of image information, because of its easily selected scrambling variables and its abilities in enduring erasing, cropping and compression attacks. However, this scrambling method can only be used to scramble square image. For any rectangle image with its width not equal to its height, it needs to be expanded into square image or divided into several square images before using 2D matrix transform to scramble it, which adds the extra space or increases the computation cost. To address this problem, this study proposes two kinds of 2D matrix transforms called 2D triangular mappings and also gives their corresponding inverse transforms. The proposed mappings can be used to scramble or recover rectangle image directly and their iterative cost is low. The cost to scramble or recover image for one time is only the numbers of pixels and our proposed mappings need not to compute the iterative period in advance. Experiments show the proposed mappings validity in scrambling rectangle image, low cost in scrambling and recovering rectangle image and robustness in enduring erasing, cropping and compressing attacks.
Image zero-watermarking algorithm based on Contourlet transform and singular value decomposition
基于Contourlet变换和奇异值分解的图像零水印算法

ZENG Fan-juan,ZHOU An-ming,
曾凡娟
,周安民

计算机应用 , 2008,
Abstract: An image zero-watermarking algorithm was proposed based on contourlet transform and singular value decompositon. After the coutourlet transform, the original image was decomposed into series of multi scale, local and directional subimages. The singular value of low frequency component is decomposed. The watermark is embedded and extracted from the first singular value of the every block of image. Experimental results show that the digital image watermarking Algorithm has a good transparence of embedded watermark image and is robust against attacks such as added noise, JPEG compression and cropping. The reliability of watermark extraction was enhanced.
Page 1 /4470
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.