scholarly journals Lossless Watermarking Algorithm Based on Multiple-Base Notational System and Pixel Difference

CONVERTER ◽  
2021 ◽  
pp. 248-260
Author(s):  
Huan Song, Jiatao Kang, Zaihui Cao
Keyword(s):  
Current Data ◽  
Extraction Mechanism ◽  
Adjustment Mechanism ◽  
Information Embedding ◽  
Adaptive Adjustment ◽  
Pixel Value ◽  
Lossless Watermarking ◽  
Carrier Image ◽  
Base Selection ◽  
Notational System

In order to identify the authenticity of the industrial packaging, the solution to the current watermark technology is mainly to embed the same watermark capacity into each pixel value in the image, so that the watermark capacity is small, and the anti-distortion performance is not good. Data watermarking algorithm based on system and pixel difference. First divide the carrier image into non-overlapping sub-blocks, and calculate the pixel difference of each sub-block; introduce a hybrid system to obtain different bases. According to the pixel difference, the base selection rule is defined; considering the human visual characteristics, the pixel interval adaptive adjustment mechanism is designed to improve the coding technology and complete the watermark information embedding; finally, the watermark information extraction mechanism is established to restore the watermark. The experimental results show that compared with the current data watermarking algorithm, the proposed algorithm has ideal imperceptibility, as well as larger watermark capacity and lower distortion.

scholarly journals Optimization of Network Coding Resources Based on Improved Quantum Genetic Algorithm

Photonics ◽  
2021 ◽  
Vol 8 (11) ◽  
pp. 502
Author(s):  
Tianyang Liu ◽  
Qiang Sun ◽  
Huachun Zhou ◽  
Qi Wei
Keyword(s):  
Genetic Algorithm ◽  
Network Coding ◽  
Topological Structure ◽  
Rotation Angle ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Resource Optimization ◽  
Quantum Genetic Algorithm ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment

The problem of network coding resource optimization with a known topological structure is NP-hard. Traditional quantum genetic algorithms have the disadvantages of slow convergence and difficulty in finding the optimal solution when dealing with this problem. To overcome these disadvantages, this paper proposes an adaptive quantum genetic algorithm based on the cooperative mutation of gene number and fitness (GNF-QGA). This GNF-QGA adopts the rotation angle adaptive adjustment mechanism. To avoid excessive illegal individuals, an illegal solution adjustment mechanism is added to the GNF-QGA. A solid demonstration was provided that the proposed algorithm has a fast convergence speed and good optimization capability when solving network coding resource optimization problems.

scholarly journals On the stabilization of internally coupled map lattice systems

2004 ◽  
Vol 2004 (2) ◽  
pp. 345-356 ◽  
Author(s):  
Weihong Huang
Keyword(s):  
Steady State ◽  
Periodic Orbit ◽  
Local Stability ◽  
Sufficient Conditions ◽  
Coupled Map Lattice ◽  
Coupling Constants ◽  
Lattice Systems ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment ◽  
Effectiveness And Efficiency

The adaptive adjustment mechanism is applied to the stabilization of an internally coupled map lattice system defined byxi,t+1=G((1−αi−βi)xi,t+αixi+1,t+βixi−1,t), wheref:ℝ→ℝis a nonlinear map, andαandβare nonnegative coupling constants that satisfy the constraintαi+βi<1, for allx∈ℝ,i=1,2,…,n. Sufficient conditions and ranges of adjustment parameters that guarantee the local stability of a generic steady state have been provided. Numerical simulations have demonstrated the effectiveness and efficiency for this mechanism to stabilize the system to a generic unstable steady state or a periodic orbit.

scholarly journals Reversible Data Hiding in a Chaotic Encryption Domain Based on Odevity Verification

2021 ◽  
Vol 13 (6) ◽  
pp. 1-14
Author(s):  
Lianshan Liu ◽  
Xiaoli Wang ◽  
Lingzhuang Meng ◽  
Gang Tian ◽  
Ting Wang
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Chaotic Encryption ◽  
Original Image ◽  
Embedding Capacity ◽  
Logistic Mapping ◽  
Henon Mapping ◽  
Pixel Value ◽  
Carrier Image

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

An Adaptive Adjustment Mechanism for Carriage in ATTN Network

2016 ◽  
Vol 1 (1) ◽  
pp. 207
Author(s):  
Yongju Xian ◽  
Huailiang Yi ◽  
Qili Zhang
Keyword(s):  
Energy Consumption ◽  
Resource Utilization ◽  
Security Management ◽  
Utilization Rate ◽  
Simulation Platform ◽  
Font Size ◽  
Data Retention ◽  
Low Resource ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment

<span style="font-family: 'Arial','Arial'; font-size: 9pt;">Internet based on TCP/IP is now faced with the problem of scalability, security, management and energy consumption, while the patch to Internet doesn’t solve the drawback of IP n</span><span style="font-family: 'Arial','Arial'; font-size: 9pt;">etwork essentially, which further intensifies the complexity of the network. In this paper, based on the research of ATTN network, an adaptive adjustment mechanism is proposed aiming at the problem of data retention and low resource utilization rate in the automatic configuration of the carriages. In which by the forecast of data retention and resource utilization, the carrier routes are dynamically adjusted. Finally, the scheme is further optimized, and tested on ATTN simulation platform, which shows the performance of ATTN network is improved.</span>

scholarly journals NAAM-MOEA/D-Based Multitarget Firepower Resource Allocation Optimization in Edge Computing

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Liyuan Deng ◽  
Ping Yang ◽  
Weidong Liu ◽  
Lina Wang ◽  
Sifeng Wang ◽  
...  
Keyword(s):  
Resource Allocation ◽  
Damage Effect ◽  
Test Functions ◽  
Adjustment Mechanism ◽  
Population Evolution ◽  
Decision Mechanism ◽  
Calculation Process ◽  
Adaptive Adjustment ◽  
Simulation Results ◽  
Subproblem Optimization

In the edge environment, the multiobjective evolutionary algorithm based on decomposition (MOEA/D) has been widely used in the research of multitarget firepower resource allocation. However, as the MOEA/D algorithm uses a fixed neighborhood update mechanism, it is impossible to rationally allocate computing resources based on the difficulty of each subproblem optimization, which results in some problems such as reduced population evolution efficiency and poor evolution quality during the calculation process. In order to solve these problems, a decision mechanism for subproblems and population evolution stages is designed, and on this basis, a MOEA/D algorithm based on the neighborhood adaptive adjustment mechanism is proposed to adapt to the edge environment. The optimization model of multiobjective firepower resource allocation based on the maximization of damage effect and the minimization of strike cost is constructed and solved. Using the ZDT series of test functions for comparative experiments, the simulation results show that the proposed algorithm can balance the distribution and convergence of population evolution and obtain satisfactory optimization results.

scholarly journals Stabilizing high-order discrete dynamical systems by a lagged adaptive adjustment mechanism

2002 ◽  
Vol 7 (1) ◽  
pp. 59-68 ◽  
Author(s):  
Wiehong Huang
Keyword(s):  
Discrete System ◽  
High Speed ◽  
A Priori ◽  
Discrete Dynamical Systems ◽  
High Order ◽  
A Priori Information ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment ◽  
Effectiveness And Efficiency ◽  
Priori Information

A lagged adaptive adjustment mechanism has been developed to stabilize a high-order discrete system. Theoretical proofs and computer simulations have been provided to show the effectiveness and efficiency of this new mechanism in practice. The mechanism ensures that the adjusted system converges to its generic fixed points and achieves the convergence with a high speed. Besides, it requires neither a priori information about the system itself nor any external generated control signal.

scholarly journals Reversible data hiding in chaotic encryption domain based on odevity verification

2021 ◽  
Vol 13 (6) ◽  
pp. 0-0
Keyword(s):  
Data Hiding ◽  
Reversible Data Hiding ◽  
Signal To Noise Ratio ◽  
Chaotic Encryption ◽  
Original Image ◽  
Embedding Capacity ◽  
Logistic Mapping ◽  
Henon Mapping ◽  
Pixel Value ◽  
Carrier Image

On the premise of guaranteeing the visual effect, in order to improve the security of the image containing digital watermarking and restore the carrier image without distortion, reversible data hiding in chaotic encryption domain based on odevity verification was proposed. The original image was scrambled and encrypted by Henon mapping, and the redundancy between the pixels of the encrypted image was lost. Then, the embedding capacity of watermarking can be improved by using odevity verification, and the embedding location of watermarking can be randomly selected by using logistic mapping. When extracting the watermarking, the embedded data was judged according to the odevity of the pixel value of the embedding position of the watermarking, and the carrier image was restored nondestructively by odevity check image. The experimental results show that the peak signal-to-noise ratio (PSNR) of the original image is above 53 decibels after the image is decrypted and restored after embedding the watermarking in the encrypted domain, and the invisibility is good.

Sign in / Sign up

Export Citation Format

Share Document