压缩传感
匹配追踪
算法
分辨率(逻辑)
显微镜
极限(数学)
噪音(视频)
人工智能
计算机科学
图像分辨率
信号重构
匹配(统计)
信噪比(成像)
迭代重建
信号(编程语言)
计算机视觉
光学
图像(数学)
信号处理
数学
物理
电信
数学分析
雷达
统计
程序设计语言
作者
Hehe Ma,Yuexia Shu,Xin Liu
摘要
Super-resolution localization microscopy (SRLM) breaks the diffraction limit, making possible the observation of sub-cellular structures. Challenges remain in SRLM due to a long data acquisition time. To overcome the limitation, the methods based on compressed sensing (CS) have been proposed. However, at the current stage, the widely used sparsity-based localization methods, e.g., interior point method (IPM), is computationally intensive. To address the problem, in this paper, we introduce an alternative CS reconstruction method to super-resolution imaging model, which is achieved by using gOMP (generalized Orthogonal Matching Pursuit). A series of numerical simulations with varying emitter densities and signal-to-noise rations (SNRs) are performed to evaluate the performance of gOMP method. The results show that whatever gOMP or IPM is used in SRLM, the obtained localization accuracy is similar. But, the data-processing time of gOMP can be significantly reduced (< 100 times) than the previous reported IPM method. As a result, gOMP provides the potential for reducing the computational cost while maintaining a desired spatial resolution, which is beneficial for SRLM imaging.
科研通智能强力驱动
Strongly Powered by AbleSci AI