Fram evaluation as unified memory for convex optimization algorithms

Author(s):  
Gionata Cimini ◽  
Alberto Bemporad ◽  
Gianluca Ippoliti ◽  
Sauro Longhi
2016 ◽  
Vol 11 (2) ◽  
pp. 103-109
Author(s):  
Hongtu Zhao ◽  
Chong Chen ◽  
Chenxu Shi

As the most critical part of compressive sensing theory, reconstruction algorithm has an impact on the quality and speed of image reconstruction. After studying some existing convex optimization algorithms and greedy algorithms, we find that convex optimization algorithms should possess higher complexity to achieve higher reconstruction quality. Also, fixed atomic numbers used in most greedy algorithms increase the complexity of reconstruction. In this context, we propose a novel algorithm, called variable atomic number matching pursuit, which can improve the accuracy and speed of reconstruction. Simulation results show that variable atomic number matching pursuit is a fast and stable reconstruction algorithm and better than the other reconstruction algorithms under the same conditions.


Sign in / Sign up

Export Citation Format

Share Document