Hybrid encoding method by assembling the magic-matrix scrambling method and the binary encoding method in image hiding

2011 ◽  
Vol 284 (7) ◽  
pp. 1778-1784 ◽  
Author(s):  
Kuang Tsan Lin
Keyword(s):  
Image Hiding ◽  
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.

Dynamic Three-Dimensional Shape Measurement Based on Regional Binary Encoding Method

2013 ◽  
Vol 40 (10) ◽  
pp. 1008004
Author(s):  
黄华权 Huang Huaquan ◽  
吴庆阳 Wu Qingyang ◽  
贺威 He Wei
Keyword(s):  
Three Dimensional ◽  
Shape Measurement ◽  
Binary Encoding ◽  
Dimensional Shape ◽  
Encoding Method ◽  
Three Dimensional Shape

A stream-based method to detect differences between XML documents

2016 ◽  
Vol 43 (1) ◽  
pp. 39-53
Author(s):  
Bumsuk Jang ◽  
SeongHun Park ◽  
Young-guk Ha
Keyword(s):  
Execution Time ◽  
Detection Method ◽  
State Of The Art ◽  
Xml Documents ◽  
Difference Detection ◽  
Binary Encoding ◽  
Structured Analysis ◽  
Time Optimality ◽  
Improved Performance ◽  
Encoding Method

Detecting differences between XML documents is one of most important research topics for XML. Since XML documents are generally considered to be organized in a tree structure, most previous research has attempted to detect differences using tree-matching algorithms. However, most tree-matching algorithms have inadequate performance owing to limitations in terms of the execution time, optimality and scalability. This study proposes a stream-based difference detection method in which an XML binary encoding algorithm is used to provide improved performance relative to that of previous tree-matching algorithms. A tree-structured analysis of XML is not essential in order to detect differences. We use a D-Path algorithm that has an optimal result quality for difference detection between two streams and has a lower time complexity than tree-based methods. We then modify the existing XML binary encoding method to tokenize the stream and the algorithm in order to support more operations than D-Path algorithm does. The experimental results reveal greater efficiency for the proposed method relative to tree-based methods. The execution time is at least 4 times faster than state-of-the-art tree-based methods. In addition, the scalability is much more efficient.

scholarly journals Differential Binary Encoding Method for Calibrating Image Sensors Based on IOFBs

Sensors ◽  
2012 ◽  
Vol 12 (4) ◽  
pp. 4133-4155 ◽  
Author(s):  
Pedro R. Fernández ◽  
José Luis Lázaro-Galilea ◽  
Alfredo Gardel ◽  
Felipe Espinosa ◽  
Ignacio Bravo ◽  
...  
Keyword(s):  
Image Sensors ◽  
Binary Encoding ◽  
Encoding Method

LZW differential evolution for binary encoding

2012 ◽  
Author(s):  
Orawan Watchanupaporn ◽  
Worasait Suwannik
Keyword(s):  
Differential Evolution ◽  
Binary Encoding
Sign in / Sign up

Export Citation Format

Share Document