Abstract
The idea of compressed sensing (CS) can be applied to atomic force microscopy (AFM) to reduce the amount of data that needs to be sampled for accurate image reconstruction. The data sampling strategy and measurement matrix design in AFM have been discussed in previous work. However, standard CS image recovery needs to solve a large size convex optimization problem, which requires a lot of computational resources in terms of both time and memory. In this paper, we propose a new variant of the Matching Pursuit (MP) algorithm for image reconstruction based on CS in AFM. With this algorithm, the computational time and memory space for image reconstruction can be reduced significantly with only a small loss in image quality. The proposed algorithm is demonstrated through MATLAB simulation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
