2021
DOI: 10.1016/j.media.2021.102168
|View full text |Cite
|
Sign up to set email alerts
|

Data fusion and smoothing for probabilistic tracking of viral structures in fluorescence microscopy images

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 17 publications
(11 citation statements)
references
References 35 publications
0
11
0
Order By: Relevance
“…Features based on [11] use the keypoint movements to identify temporal patterns like directed or undirected motion.…”
Section: Methodsmentioning
confidence: 99%
“…Features based on [11] use the keypoint movements to identify temporal patterns like directed or undirected motion.…”
Section: Methodsmentioning
confidence: 99%
“…However, tracking these movements was laborious and challenging due to the large number of small vesicles, their low signal to noise ratio compared to the much brighter Golgi and their dispersed origins from Golgi mini-stacks throughout the cytoplasm (Figure 3A). Many different tracking algorithms have been developed in recent years that use deep learning (DL) methods to enhance target detection and object tracking [17][18][19][20][21][22][23][24][25][26][27][30][31][32]. However, these machine learning methods usually require an extensive training dataset that must be updated for each new experimental system, which can be impractical and time consuming, some were developed for particular imaging techniques, while others perform poorly in a noisy environment.…”
Section: The Msp-tracker and Msp-viewer Programsmentioning
confidence: 99%
“…Many different tracking algorithms have been developed in recent years [17][18][19][20][21][22][23][24][25] .…”
Section: Introductionmentioning
confidence: 99%
“…Afterwards, the intersection of all nearest neighbor queries is computed, which determines triple colocalizations within all three channels. Due to the data structure of k-d-trees, the nearest neighbor queries have an average running time of O(log(n)), where n is the number of particles in a channel [29], [31], [32]. Thus, this data structure is efficient, easy to construct, and well suited for finding nearest neighbors to determine triple colocalizations.…”
Section: A Quantification Of Colocalization Using Colocquantmentioning
confidence: 99%