Smoothing Method for Minimax Problems
Computational Optimization and Applications
Proceedings of the 5th international conference on Information processing in sensor networks
Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing
Computer Communications
Expert Systems with Applications: An International Journal
Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit
Foundations of Computational Mathematics
Comparison among five evolutionary-based optimization algorithms
Advanced Engineering Informatics
High-resolution radar via compressed sensing
IEEE Transactions on Signal Processing
Application of compressive sensing to sparse channel estimation
IEEE Communications Magazine
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
IEEE Transactions on Information Theory
Efficient feedback scheme based on compressed sensing in MIMO wireless networks
Computers and Electrical Engineering
Hi-index | 0.00 |
Compressed sensing (CS) is considered as a promising signal processing technique, and successful applications of the CS theory depend mainly on the accuracy and speed of the reconstruction algorithms. In this paper, a generalized objective functional, which has been developed using the combinational estimation and an extended stabilizing functional, is proposed. An efficient iterative scheme, which integrates the beneficial advantages of the homotopy method, the shuffled frog-leaping (SFL) algorithm and the harmony search (HS) algorithm, is designed for searching a possible global optimal solution. Numerical simulations are implemented to evaluate the numerical performances and effectiveness of the proposed algorithm. Excellent numerical performances and encouraging results are observed. For the cases considered in this paper, a dramatic improvement in the reconstruction accuracy is achieved, which indicates that the proposed algorithm is a promising candidate for solving CS inverse problem.