离散 SUPPOSe:应用于荧光显微镜图像的更快、更准确的超分辨率新方法

Q3 Physics and Astronomy Results in Optics Pub Date : 2024-06-12 DOI:10.1016/j.rio.2024.100715
Sandra Martínez , Oscar E. Martínez
{"title":"离散 SUPPOSe:应用于荧光显微镜图像的更快、更准确的超分辨率新方法","authors":"Sandra Martínez ,&nbsp;Oscar E. Martínez","doi":"10.1016/j.rio.2024.100715","DOIUrl":null,"url":null,"abstract":"<div><p>In this article we define Discrete SUPPOSe, a new and faster version of the single shot super resolution SUPPOSe (Superposition of virtual point sources) method. The SUPPOSe method for super-resolution of fluorescent microscope images relies in assuming that the sample source distribution can be modeled as a superposition of virtual point sources of equal intensities distributed in a continuous space, converting the ill posed deconvolution problem into a well posed one. In this work we present a faster new method that consists on discretizing the continuum problem, using a normalized covariance instead of a <span><math><msup><mrow><mi>χ</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> for the fitting function and hence transforming the convolution (the main computational time) into a multiplication, and modifying the mutation step of the genetic algorithm. We compare precision, accuracy, resolution and computation time. It is also shown that despite the spatial discretization in Discrete SUPPOSe similar figures for precision, accuracy and resolution are obtained. The algorithm was implemented in Matlab running on a CPU obtaining with a speed improvement factor of more than 15 for one image of 48 × 48 pixels. Processing images in parallel in a 16 cores CPU a 1Mpixel image is computed 240 times faster than the standard SUPPOSe in a 2600 core GPU. Experimental images were used to validate the method.</p></div>","PeriodicalId":21151,"journal":{"name":"Results in Optics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666950124001123/pdfft?md5=da27dde52c5a75c094c1701c0873fd99&pid=1-s2.0-S2666950124001123-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Discrete SUPPOSe: A new, faster and accurate superresolution method for applications to fluorescence microscopy images\",\"authors\":\"Sandra Martínez ,&nbsp;Oscar E. Martínez\",\"doi\":\"10.1016/j.rio.2024.100715\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this article we define Discrete SUPPOSe, a new and faster version of the single shot super resolution SUPPOSe (Superposition of virtual point sources) method. The SUPPOSe method for super-resolution of fluorescent microscope images relies in assuming that the sample source distribution can be modeled as a superposition of virtual point sources of equal intensities distributed in a continuous space, converting the ill posed deconvolution problem into a well posed one. In this work we present a faster new method that consists on discretizing the continuum problem, using a normalized covariance instead of a <span><math><msup><mrow><mi>χ</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> for the fitting function and hence transforming the convolution (the main computational time) into a multiplication, and modifying the mutation step of the genetic algorithm. We compare precision, accuracy, resolution and computation time. It is also shown that despite the spatial discretization in Discrete SUPPOSe similar figures for precision, accuracy and resolution are obtained. The algorithm was implemented in Matlab running on a CPU obtaining with a speed improvement factor of more than 15 for one image of 48 × 48 pixels. Processing images in parallel in a 16 cores CPU a 1Mpixel image is computed 240 times faster than the standard SUPPOSe in a 2600 core GPU. Experimental images were used to validate the method.</p></div>\",\"PeriodicalId\":21151,\"journal\":{\"name\":\"Results in Optics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2666950124001123/pdfft?md5=da27dde52c5a75c094c1701c0873fd99&pid=1-s2.0-S2666950124001123-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Results in Optics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2666950124001123\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Physics and Astronomy\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Results in Optics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2666950124001123","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Physics and Astronomy","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们定义了离散 SUPPOSe,它是单次超分辨率 SUPPOSe(虚拟点源叠加)方法的一个新的更快版本。用于荧光显微镜图像超分辨的 SUPPOSe 方法依赖于假设样本源分布可以建模为分布在连续空间中的等强度虚拟点源的叠加,从而将不确定的解卷积问题转换为确定的问题。在这项工作中,我们提出了一种更快的新方法,包括将连续问题离散化,使用归一化协方差而不是 χ2 来拟合函数,从而将卷积(主要计算时间)转化为乘法,以及修改遗传算法的突变步骤。我们对精度、准确度、分辨率和计算时间进行了比较。结果还表明,尽管在离散 SUPPOSe 中进行了空间离散化处理,但还是获得了相似的精度、准确度和分辨率数据。该算法是在 Matlab 中实现的,运行在 CPU 上,对于一幅 48 × 48 像素的图像,速度提高了 15 倍以上。在 16 核 CPU 中并行处理图像时,100 万像素图像的计算速度是 2600 核 GPU 中标准 SUPPOSe 的 240 倍。实验图像用于验证该方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Discrete SUPPOSe: A new, faster and accurate superresolution method for applications to fluorescence microscopy images

In this article we define Discrete SUPPOSe, a new and faster version of the single shot super resolution SUPPOSe (Superposition of virtual point sources) method. The SUPPOSe method for super-resolution of fluorescent microscope images relies in assuming that the sample source distribution can be modeled as a superposition of virtual point sources of equal intensities distributed in a continuous space, converting the ill posed deconvolution problem into a well posed one. In this work we present a faster new method that consists on discretizing the continuum problem, using a normalized covariance instead of a χ2 for the fitting function and hence transforming the convolution (the main computational time) into a multiplication, and modifying the mutation step of the genetic algorithm. We compare precision, accuracy, resolution and computation time. It is also shown that despite the spatial discretization in Discrete SUPPOSe similar figures for precision, accuracy and resolution are obtained. The algorithm was implemented in Matlab running on a CPU obtaining with a speed improvement factor of more than 15 for one image of 48 × 48 pixels. Processing images in parallel in a 16 cores CPU a 1Mpixel image is computed 240 times faster than the standard SUPPOSe in a 2600 core GPU. Experimental images were used to validate the method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Results in Optics
Results in Optics Physics and Astronomy-Atomic and Molecular Physics, and Optics
CiteScore
2.50
自引率
0.00%
发文量
115
审稿时长
71 days
期刊最新文献
Effect of annealing and roughness on the magnetic-optical, adhesive, nano-mechanical, and electrical properties of Co60Fe20Dy20 films Monocrystalline photovoltaic material based symmetrical and unsymmetrical Triple-Series Parallel-Ladder configuration for harvesting maximum power under partial shading conditions Editorial to the Special Issue “Nanophotonics and optical fibers: New avenues for sensing and active devices” A holistic understanding of optical properties in amorphous H-terminated Si-nanostructures: Combining TD-DFT with AIMD Diabetic retinopathy detection through generative AI techniques: A review
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1