Encrypting image by assembling the fractal-image addition method and the binary encoding method

2012 ◽  
Vol 285 (9) ◽  
pp. 2335-2342 ◽  
Author(s):  
Kuang Tsan Lin ◽  
Sheng Lih Yeh
Keyword(s):  
Addition Method ◽  
Fractal Image ◽  
Binary Encoding ◽  
Encoding Method

scholarly journals Hiding a Covert Digital Image by Assembling the RSA Encryption Method and the Binary Encoding Method

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Kuang Tsan Lin ◽  
Sheng Lih Yeh
Keyword(s):  
Digital Image ◽  
Binary Data ◽  
Holographic Image ◽  
Binary Encoding ◽  
Image Dimension ◽  
Encoding Method ◽  
Encryption Method

The Rivest-Shamir-Adleman (RSA) encryption method and the binary encoding method are assembled to form a hybrid hiding method to hide a covert digital image into a dot-matrix holographic image. First, the RSA encryption method is used to transform the covert image to form a RSA encryption data string. Then, all the elements of the RSA encryption data string are transferred into binary data. Finally, the binary data are encoded into the dot-matrix holographic image. The pixels of the dot-matrix holographic image contain seven groups of codes used for reconstructing the covert image. The seven groups of codes are identification codes, covert-image dimension codes, covert-image graylevel codes, pre-RSA bit number codes, RSA key codes, post-RSA bit number codes, and information codes. The reconstructed covert image derived from the dot-matrix holographic image and the original covert image are exactly the same.

Bond Graph Binary Encoding Method for Genetic Algorithms Applications

2003 ◽  
Author(s):  
Germa´n L. Di´az-Cuevas ◽  
Roger F. Ngwompo
Keyword(s):  
Genetic Algorithms ◽  
Dynamic Systems ◽  
Binary Code ◽  
Worked Examples ◽  
Bond Graphs ◽  
Binary Encoding ◽  
Coding Method ◽  
Performance Specifications ◽  
Model Equations ◽  
Encoding Method

A binary encoding method for bond graphs that can be used for genetic algorithms (GAs) applications is presented. The originality of the proposed coding is that it encompasses causal information. This ensures that causal analysis is taken into account in assessing the fitness of topologies generated in GA operations and the suitability of design candidates to meet performance specifications can be tested directly from the binary code as the model equations can be derived from it. The code is suitable for GAs applications on bond graphs (BG) for topology and parameter optimisation in automated synthesis of dynamic systems. The coding method and its possible applications are illustrated through worked examples.

scholarly journals A NOVEL FAST FRACTAL IMAGE COMPRESSION METHOD BASED ON DISTANCE CLUSTERING IN HIGH DIMENSIONAL SPHERE SURFACE

Fractals ◽  
2017 ◽  
Vol 25 (04) ◽  
pp. 1740004 ◽  
Author(s):  
SHUAI LIU ◽  
ZHENG PAN ◽  
XIAOCHUN CHENG
Keyword(s):  
Image Compression ◽  
High Dimensional ◽  
Dimensional Sphere ◽  
Compression Method ◽  
Sphere Surface ◽  
Fractal Image Compression ◽  
Fractal Compression ◽  
Fractal Image ◽  
Speed Up ◽  
Encoding Method

Fractal encoding method becomes an effective image compression method because of its high compression ratio and short decompressing time. But one problem of known fractal compression method is its high computational complexity and consequent long compressing time. To address this issue, in this paper, distance clustering in high dimensional sphere surface is applied to speed up the fractal compression method. Firstly, as a preprocessing strategy, an image is divided into blocks, which are mapped on high dimensional sphere surface. Secondly, a novel image matching method is presented based on distance clustering on high dimensional sphere surface. Then, the correctness and effectiveness properties of the mentioned method are analyzed. Finally, experimental results validate the positive performance gain of the method.

Multiresolution Analysis of Fractal Image Compression

Fractals ◽  
1997 ◽  
Vol 05 (supp01) ◽  
pp. 215-229
Author(s):  
Gregory Caso ◽  
C.-C. Jay Kuo
Keyword(s):  
Wavelet Transform ◽  
Image Compression ◽  
Domain Structure ◽  
Multiresolution Analysis ◽  
Transform Coding ◽  
Transform Domain ◽  
Fractal Image Compression ◽  
Fractal Image ◽  
Affine Mappings ◽  
Encoding Method

In this research, we perform a multiresolution analysis of the mappings used in fractal image compression. We derive the transform-domain structure of the mappings and demonstrate a close connection between fractal image compression and wavelet transform coding using the Haar basis. We show that under certain conditions, the mappings correspond to a hierarchy of affine mappings between the subbands of the transformed image. Our analysis provides new insights into the mechanism underlying fractal image compression, leads to a new non-iterative transform-domain decoding algorithm, and suggests a new transform-domain encoding method with extensions to wavelets other than the Haar transform.

A fractal image encoding method based on statistical loss used in agricultural image compression

2015 ◽  
Vol 75 (23) ◽  
pp. 15525-15536 ◽  
Author(s):  
Shuai Liu ◽  
Zhibin Zhang ◽  
Lingyun Qi ◽  
Ming Ma
Keyword(s):  
Image Compression ◽  
Image Encoding ◽  
Fractal Image ◽  
Encoding Method
Sign in / Sign up

Export Citation Format

Share Document