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...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.展开更多
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 a...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.展开更多
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 o...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.展开更多
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...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.展开更多
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.Althougt...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.展开更多
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, ...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.展开更多
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.
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 ...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.展开更多
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 cro...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.展开更多
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.Fi...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.展开更多
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 memor...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.展开更多
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 discusse...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.展开更多
针对传统SURF算法(speeded up robust features)在拼接高分辨率无人机航拍图像时运行速度慢、特征匹配率低的特点,提出了一种基于IB-SURF(image block-SURF)技术的无人机图像拼接算法。结合无人机定位定姿系统(position and orientation...针对传统SURF算法(speeded up robust features)在拼接高分辨率无人机航拍图像时运行速度慢、特征匹配率低的特点,提出了一种基于IB-SURF(image block-SURF)技术的无人机图像拼接算法。结合无人机定位定姿系统(position and orientation system,POS)求取图像重叠区域;构造掩模在无人机图像重叠区域检测特征点,减少特征提取时间;借助图像分块(image block,IB)的思想对图像划分网格,精简筛选特征点;引入Neighborhood-KNN(neighborhood-K nearest neighbors)进行特征点匹配,提高图像匹配效率。实验结果表明,IB-SURF算法有较快的运行速度和较高的特征匹配率,平均特征匹配率达到84.3%,特征匹配正确率超过95.1%,为图像高质量拼接提供了技术基础。展开更多
文摘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.
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant No.50375023)
文摘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.
基金Supported by the State Key Laboratory of Inflormation Security
文摘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.
基金Natural Science Fund of Anhui Province of China (050420101)
文摘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.
基金supported by the National Natural Science Foundation of China(61172159)
文摘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.
文摘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.
文摘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.
文摘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.
基金Supported by the National Natural Science Foundation of China(No.61402537)the Open Fund of Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis(No.HCIC201706)the Sichuan Science and Technology Programme(No.2018GZDZX0041)
文摘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.
文摘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.
基金Supported by the Aviation Science Fund of China(2009ZC15001)
文摘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.