2013
DOI: 10.1117/12.2024967
|View full text |Cite
|
Sign up to set email alerts
|

Autofocusing in microscopy systems using graphics processing units

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4

Relationship

2
2

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…We remark that the metrics that were selected for this study have shown promising results under different microscopy modalities for the autofocus process of biological samples in preliminary studies. 10,22 With the aim of presenting the mathematical description of such algorithms, consider an image g from which we want to compute an AF , and whose intensity levels at coordinates i; j, for i ¼ 1; : : : ; M and j ¼ 1; : : : ; N, respectively, are represented as gði; jÞ. In the following description, the operator ⊗ denotes the usual convolution operation, and T denotes matrix transposition.…”
Section: Mathematical Description Of Autofocus Functionsmentioning
confidence: 99%
“…We remark that the metrics that were selected for this study have shown promising results under different microscopy modalities for the autofocus process of biological samples in preliminary studies. 10,22 With the aim of presenting the mathematical description of such algorithms, consider an image g from which we want to compute an AF , and whose intensity levels at coordinates i; j, for i ¼ 1; : : : ; M and j ¼ 1; : : : ; N, respectively, are represented as gði; jÞ. In the following description, the operator ⊗ denotes the usual convolution operation, and T denotes matrix transposition.…”
Section: Mathematical Description Of Autofocus Functionsmentioning
confidence: 99%
“…Both methods, DHM and OR-MAP, mainly rely on FFT transforms which requires O(M * N * log(M * N)) operations, being M * N the size of the image, therefore massively parallel GPUs are needed to process even low resolution images. Also First-Derivative methods have taken advantage of GPU architectures showing promising results [10]. Since these methods can be implemented by means of 2D convolutions, the computational complexity can be limited to O(M * N * k * k), being k the kernel size, or even O(M * N * 2 * k) in the case of separable filters.…”
Section: Introductionmentioning
confidence: 99%
“…Due to the high computational effort, these methods have been implemented in parallel computer systems such as clusters and GPUs. [21][22][23] In this work, a parallel implementation in GPU of a pixel-by-pixel image fusion of multifocus color images based on MGC is done. According to the image quality metrics, the proposed method is competitive to merge these kinds of images.…”
Section: Introductionmentioning
confidence: 99%