An Optimized Framework Development of ABC Algorithm Along with SVMP Algorithm for Lung Cancer Detection
0
Citation
16
Reference
10
Related Paper
Keywords:
Algorithm design
A new algorithm of blind source separation based on genetic algorithm has been proposed in this paper. It is used with the iteration core of fixed-point algorithm to find the best separation matrix. It enhances the speed of algorithm and depends less on the selecting of training samples. At the same time, this algorithm has virtues of global convergence and high precision.
Separation (statistics)
Algorithm design
Matrix (chemical analysis)
Cite
Citations (9)
Low density parity check code is a kind of high-performance linear block code. It has excellent performance which is near the Shannon limit. LDPC has low decoding complexity, free structure and receives extensive attention. The typical decoding algorithm of LDPC is LLR BP algorithm, which is also called "sum-product algorithm". LLR BP algorithm is the best algorithm at present. But it needs complex computation, which causes great difficulty in its hardware design. To solve this problem, an algorithm that gets approximation of LLR BP algorithm is put forward, which is called min-sum algorithm. Min-sum algorithm greatly reduces the computation and makes the hardware design simpler, but its accuracy has a wide gap with BP algorithm. This article analyzes the reason why min-sum algorithm has errors, and puts forward an improved algorithm called min-sum linear approximation algorithm based on min-sum algorithm.
Berlekamp–Welch algorithm
Algorithm design
Noisy-channel coding theorem
Code (set theory)
Cite
Citations (9)
Under the premise of using Ford algorithm to obtain the shortest path in the link map, in this paper the path adjustment algorithm which is the combination of the genetic algorithm and ant colony algorithm is introduced. And the path adjustment algorithm is used to adjust and optimize the current shortest path. The definition of the genetic algorithm control function was to control the appropriate combination opportunity of the two algorithms. Taking advantage of genetic algorithm to produce the original results, they were transformed into the initial pheromones value needed by ant colony algorithm, then ant colony algorithm to get the best results. Through numerical simulation analysis, it is further description that the path adjustment algorithm's effectiveness and necessity.
Cultural algorithm
Algorithm design
Yen's algorithm
Suurballe's algorithm
Ant colony
Cite
Citations (2)
This paper propose an improved image filtering algorithm which is based on median filteringing algorithm and medium filteringing algorithm according to the simpleness of median filteringing algorithm and the significant denoising effect of medium filteringing algorithm. The new algorithm combines the two algorithms and thus gets a better filtering effect. We did the simulation using MATLAB, and then did the objective evaluation using the classical method PSNR. Simulation results showed that the new algorithm has a better denoising effect than the medium filteringing algorithm and reduces the denoising time as well. Thus the improved algorithm has a better practicalility.
Algorithm design
Cite
Citations (6)
In order to find the global optimal solution of the task partition results of data flow graph(DFG) based on reconfigurable cryptographic logic array, a task partition algorithm CBPGA combining genetic algorithm and cluster partition algorithm is proposed. The algorithm is first improved on the basis of the CBP algorithm, combined with the hardware structure of the array and the particularity of the cryptographic algorithm operation, the probability-based absorption method is adopted for the absorption of the node operator to generates initial population, and then use genetic algorithm(GA) to solve the global optimal solution. Using the number of divided blocks and communication cost as evaluation indicators, experiments show that the algorithm has a certain improvement compared to CBP algorithm and LSCBP algorithm.
Algorithm design
Partition problem
Graph partition
Dinic's algorithm
Cite
Citations (0)
LBG algorithm is a classical algorithm for vector quantization.The performance of entire algorithm combined with improved PCC algorithm is greatly improved.The results show the entire algorithm has fast convergence rate and excellent performance for codebook design.The improvement of PSNR for the proposed algorithm exceed 3.17 dB compared with that of the LBG algorithm.
Linde–Buzo–Gray algorithm
Algorithm design
Optimization algorithm
Cite
Citations (0)
A combined algorithm, based on the modified genetic algorithm and EWRLS algorithm, is presented in this paper. A modified genetic algorithm with dyadic mutation operator is also presented to enhance the response speed of genetic algorithm. The selection criteria of the switching threshold between the GA and EWRLS algorithm is also given by using robust minmax estimation method. This combined algorithm solves the tracking problem of time-varying system with fast parameter changes, which is very difficult to the RLS algorithm. It is not sensitive to the noise. Its good performance is verified by simulation studies.
Algorithm design
Cultural algorithm
Dinic's algorithm
Freivalds' algorithm
Selection algorithm
Cite
Citations (0)
In this paper,using the examples,based on generation function method to solve the problems of analysis of time complexity in complicated recurrence algorithm and the transform recurrence algorithm into efficient algorithm.On this condition,efficient combination algorithm can be designed.
Algorithm design
Dinic's algorithm
Freivalds' algorithm
Cite
Citations (0)
In order to find the optimal solution of task partitioning for data flow graph of cryptography algorithm based on reconfigurable logical array, a task partition algorithm ACP based on ant colony algorithm is proposed. The algorithm first improves the cluster partition algorithm according to the hardware structure of reconfigurable array. On the basis of the ant colony algorithm, many ants in the ant colony algorithm are used to traverse the nodes in the data flow graph, and the number of divided blocks and the cost of inter-cluster communication are used as cost functions to continuously optimize the initialized pheromone concentration matrix and improve the algorithm. The experimental results show that the algorithm has the ability to obtain the optimal solution more quickly and stably than the CBP algorithm and the LSCBP algorithm.
Dinic's algorithm
Traverse
Algorithm design
Partition problem
Ant colony
Graph partition
Cite
Citations (0)
Algorithm framework is the implementation of a feasible method of algorithm relocation. This paper defines the algorithm relocation, discusses how to design the algorithm frame selection operator and combination operation. Then it gives a method to define the selection operator and combination operation. Meaning determined by the algorithm framework is used to get the algorithm model, which can be generated from the algorithm to solve the problem. Finally, it discusses the relationship between algorithm framework and algorithm model and modular algorithm. Studying Algorithm Relocation and its operation is of great significance for software automation and machine learning.
Relocation
Algorithm design
Selection algorithm
Cite
Citations (0)