A Steganography Based on Optimal Multi-Threshold Block Labeling

Hiding secret data in digital images is one of the major researchfields in information security.Recently,reversible data hiding in encrypted images has attracted extensive attention due to the emergence of cloud services.This paper proposes a novel reversible data hiding method in encrypted images based on an optimal multi-threshold block labeling technique(OMTBL-RDHEI).In our scheme,the content owner encrypts the cover image with block permutation,pixel permutation,and stream cipher,which preserve the in-block correlation of pixel values.After uploading to the cloud service,the data hider applies the prediction error rearrangement(PER),the optimal threshold selection(OTS),and the multi-threshold labeling(MTL)methods to obtain a compressed version of the encrypted image and embed secret data into the vacated room.The receiver can extract the secret,restore the cover image,or do both according to his/her granted authority.The proposed MTL labels blocks of the encrypted image with a list of threshold values which is optimized with OTS based on the features of the current image.Experimental results show that labeling image blocks with the optimized threshold list can efficiently enlarge the amount of vacated room and thus improve the embedding capacity of an encrypted cover image.Security level of the proposed scheme is analyzed and the embedding capacity is compared with state-of-the-art schemes.Both are concluded with satisfactory performance.

Some Results for Exact Support Recovery of Block Joint Sparse Matrix via Block Multiple Measurement Vectors Algorithm

Block multiple measurement vectors (BMMV) is a reconstruction algorithm that can be used to recover the support of block K-joint sparse matrix X from Y = ΨX + V. In this paper, we propose a sufficient condition for accurate support recovery of the block K-joint sparse matrix via the BMMV algorithm in the noisy case. Furthermore, we show the optimality of the condition we proposed in the absence of noise when the problem reduces to single measurement vector case.

General Method of Combining Grover and Simon for Attacking Block Ciphers

The compatibility of different quantum algorithms should be considered when these algorithms are combined.In this paper,the method of combining Grover and Simon is studied for the first time,under some preconditions or assumptions.First,we give two preconditions of applying Grover’s algorithm,which ensure that the success probability of finding the marked element is close to 1.Then,based on these two preconditions,it is found out that the success probability of the quantum algorithm for FXconstruction is far less than 1.Furthermore,we give the design method of the Oracle function,and then present the general method of combining Grover and Simon algorithm for attacking block ciphers,with success probability close to 1.

A hybrid genetic-simulated annealing algorithm for optimization of hydraulic manifold blocks

This paper establishes a mathematical model of multi-objective optimization with behavior constraints in solid space based on the problem of optimal design of hydraulic manifold blocks （HMB）. Due to the limitation of its local search ability of genetic algorithm （GA） in solving a massive combinatorial optimization problem, simulated annealing （SA） is combined, the multi-parameter concatenated coding is adopted, and the memory function is added. Thus a hybrid genetic-simulated annealing with memory function is formed. Examples show that the modified algorithm can improve the local search ability in the solution space, and the solution quality.

Analysis and Design for Unsymmetrical Block Encryption Algorithm

This article explains the imbalance in DES and introduces the operators in IDEA. At last it puts forward a Unsym-metrical Block Encryption Algorithm which is achieved by adding some operators to DES.

BLOCK ADAPTIVE RECURSIVE ALGORITHM FOR VIDEO CONFERENCE CODING

This paper presents a new motion estimation algorithm for video conference signal coding. This type of algorithm is called block adaptive recursive algorithm (BARA). Simulation results show that this new algorithm has better performance than conventional ones.

Single bitmap block truncation coding of color images using hill climbing algorithm

In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Firstly,the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values.Then,the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap.Finally,the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values.Since the processing of each image block in SBBTC is independent and identical,parallel computing is applied to reduce the time consumption of this scheme.The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.

Adaptive block greedy algorithms for receiving multi-narrowband signal in compressive sensing radar reconnaissance receiver

This paper extends the application of compressive sensing(CS) to the radar reconnaissance receiver for receiving the multi-narrowband signal. By combining the concept of the block sparsity, the self-adaption methods, the binary tree search,and the residual monitoring mechanism, two adaptive block greedy algorithms are proposed to achieve a high probability adaptive reconstruction. The use of the block sparsity can greatly improve the efficiency of the support selection and reduce the lower boundary of the sub-sampling rate. Furthermore, the addition of binary tree search and monitoring mechanism with two different supports self-adaption methods overcome the instability caused by the fixed block length while optimizing the recovery of the unknown signal.The simulations and analysis of the adaptive reconstruction ability and theoretical computational complexity are given. Also, we verify the feasibility and effectiveness of the two algorithms by the experiments of receiving multi-narrowband signals on an analogto-information converter(AIC). Finally, an optimum reconstruction characteristic of two algorithms is found to facilitate efficient reception in practical applications.

A Novel Decoder Based on Parallel Genetic Algorithms for Linear Block Codes

Genetic algorithms offer very good performances for solving large optimization problems, especially in the domain of error-correcting codes. However, they have a major drawback related to the time complexity and memory occupation when running on a uniprocessor computer. This paper proposes a parallel decoder for linear block codes, using parallel genetic algorithms (PGA). The good performance and time complexity are confirmed by theoretical study and by simulations on BCH(63,30,14) codes over both AWGN and flat Rayleigh fading channels. The simulation results show that the coding gain between parallel and single genetic algorithm is about 0.7 dB at BER = 10﹣5 with only 4 processors.

An Electronic Image Stabilization Algorithm Based on Efficient Block Matching on the Bitplane

This paper proposes an electronic image stabilization algorithm based on efficient block matching on the plane. This algorithm uses a hexagonal search algorithm, and uses the bit-planes to estimate and compensate for the translational motion between video sequences at the same time;As for the rotary motion vector generated in the video sequences, in order to highlight the intensity change of the image sequence, the algorithm firstly conducts Laplace transform for the reference frame, then select a number of characteristics at the image edge to make block matching with the current frame, calculate and compensate for the rotational movement that may exist finally. Through theoretical analysis and simula-tion, we prove that, as for a mixed translational and rotational motion video sequences, the proposed algorithm can reduce required time for block matching computation ,while improving the accuracy of the electronic image stabilization.

A New Eighth Order Implicit Block Algorithms for the Direct Solution of Second Order Ordinary Differential Equations

This paper focuses on derivation of a uniform order 8 implicit block method for the direct solution of general second order differential equations through continuous coefficients of Linear Multi-step Method (LMM). The continuous formulation and its first derivatives were evaluated at some selected grid and off grid points to obtain our proposed method. The superiority of the method over the existing methods is established numerically.

Research on Concrete Beam Crack Recognition Algorithm Based on Block Threshold Value Image Processing

To solve the problem that the digital image recognition accuracy of concrete structure cracks is not high under the condition of uneven ill umination and complex surface color of concrete structure,this paper has proposed a block segmentation method of maximum entropy threshold based on the digital image data obtained by the ACTIS automatic detection system.The steps in this research are as follows:1.The crack digital images of concrete specimens with typical fea-tures were collected by using the Actis system of KURABO Co,Ltd,of Japan in the concrete beam bending test.2.The images are segmented into blocks to dis-tinguish backgrounds of different grayscale.3.The max imum interclass average gray difference method is used to distinguish the sub-blocks and screen out the image blocks that need to be segmented.4.Segmentation is made to the image with 2D max imum entropy threshold segmentation method to obtain the binary image,and the target image can be obtained by screening the connected domain features of the binary image.Results have shown that compared with other algo-rithms,the proposed method can effectively decrease the image over-segmentation and under segmentation rates,highlight the characteristics of the target cracks,solve the problems of excessive difference between the identified length and actual length of cracks caused by background gray level change and uneven ilumnination,and effectively improve the recognition accuracy of bridge concrete cracks.

Solving Job-Shop Scheduling Problems by Genetic Algorithms Based on Building Block Hypothesis

In this paper, we propose a new genetic algorithm for job-shop scheduling problems （JSP）. The proposed method uses the operation-based representation, based on schema theorem and building block hypothesis, a new crossover is proposed ： By selecting short, low order highly fit schemas to genetic operator, the crossover can exchange meaningful ordering information of parents effectively and can search the global optimization. Simulation results on MT benchmark problem coded by C ＋ ＋ show that our genetic operators are very powerful and suitable to job-shop scheduling problems and our method outperforms the previous GA-based approaches.

AN IMPROVED FAST BLIND DECONVOLUTION ALGORITHM BASED ON DECORRELATION AND BLOCK MATRIX

In order to alleviate the shortcomings of most blind deconvolution algorithms,this paper proposes an improved fast algorithm for blind deconvolution based on decorrelation technique and broadband block matrix.Althougth the original algorithm can overcome the shortcomings of current blind deconvolution algorithms,it has a constraint that the number of the source signals must be less than that of the channels.The improved algorithm deletes this constraint by using decorrelation technique.Besides,the improved algorithm raises the separation speed in terms of improving the computing methods of the output signal matrix.Simulation results demonstrate the validation and fast separation of the improved algorithm.

Heterogeneity induced strain localization in block-in-matrix-soils subjected to uniaxial loading using real-time CT scanning

Block-in-matrix-soils(bimsoils)are geological mixtures that have distinct structures consisting of relatively strong rock blocks and weak matrix soils.It is still a challenge to evaluate the mechanical behaviors of bimsoils because of the heterogeneity,chaotic structure,and lithological variability.As a result,only very limited laboratory studies have been reported on the evolution of their internal deformation.In this study,the deformation evolution of bimsoils under uniaxial loading is investigated using real-time X-ray computed tomography(CT)and image correlation algorithm(with a rock block percentage(RBP)of 40%).Three parameters,i.e.heterogeneity coefficient(K),correlation coefficient(CC),and standard deviation(STD)of displacement fields,are proposed to quantify the heterogeneity of the motion of the rock blocks and the progressive deformation of the bimsoils.Experimental results show that the rock blocks in bimsoils are prone to forming clusters with increasing loading,and the sliding surface goes around only one side of a cluster.Based on the movement of the rock blocks recorded by STD and CC,the progressive deformation of the bimsoils is quantitatively divided into three stages:initialization of the rotation of rock blocks,formation of rock block clusters,and formation of a shear band by rock blocks with significant rotation.Moreover,the experimental results demonstrate that the meso-motion of rock blocks controls the macroscopic mechanical properties of the samples.

Research on Welding Quality Traceability Model of Offshore Platform Block Construction Process

Quality traceability plays an essential role in assembling and welding offshore platform blocks.The improvement of the welding quality traceability system is conducive to improving the durability of the offshore platform and the process level of the offshore industry.Currently,qualitymanagement remains in the era of primary information,and there is a lack of effective tracking and recording of welding quality data.When welding defects are encountered,it is difficult to rapidly and accurately determine the root cause of the problem from various complexities and scattered quality data.In this paper,a composite welding quality traceability model for offshore platform block construction process is proposed,it contains the quality early-warning method based on long short-term memory and quality data backtracking query optimization algorithm.By fulfilling the training of the early-warning model and the implementation of the query optimization algorithm,the quality traceability model has the ability to assist enterprises in realizing the rapid identification and positioning of quality problems.Furthermore,the model and the quality traceability algorithm are checked by cases in actual working conditions.Verification analyses suggest that the proposed early-warningmodel for welding quality and the algorithmfor optimizing backtracking requests are effective and can be applied to the actual construction process.

Research on variable block size motion estimation algorithm for airborne image

A fast motion estimation algorithm for variable block-size using the "line scan and block merge procedure" is proposed for airborne image compression modules.Full hardware implementation via FPGA is discussed in detail.The proposed pipelined architecture based on the line scan algorithm is capable of calculating the required 41 motion vectors of various size blocks supported by H.264 within a 16 X 16 block in parallel.An adaptive rate distortion cost function is used for various size block decision.The motion vectors of adjacent small blocks are merged to predict the motion vectors of larger blocks for reducing computation.Experimental results show that our proposed method has lower computational complexity than full search algorithm with slight quality decrease and little bit rate increase.Due to the high real-time processing speed it can be easily realized in hardware.

基于FPGA的TANGRAM分组密码算法实现

TANGRAM系列分组密码算法是一种采用比特切片方法,适合多种软硬件平台的系列分组密码算法。针对TANGRAM-128/128算法,使用Verilog HDL对该算法进行FPGA实现并提出设计方案。首先,介绍了TANGRAM密码算法的特点和流程,提出了针对TANGRAM密码算法进行44轮加/解密迭代计算的方案,该方案采取有限状态机的方法有效降低了资源消耗;其次,基于国产高云云源平台,完成了基于高云FPGA的算法工程实现,以及功能仿真和数据的正确性验证,同时在QuartusⅡ13.1.0平台上也进行了相关测试,用以比较。测试结果表明,TANGRAM系列分组密码算法基于Altera公司的CycloneⅣE系列EP4CE40F29C6芯片进行工程实现,最大时钟频率为138.64 MHz,加/解密速率为403.30 Mbps;基于高云半导体GW2A-55系列芯片的最大时钟频率为96.537 MHz,加/解密速率为280.80 Mbps。