ArticleInformation processing in medical imaging : proceedings of the ... conference2011
Actin filament segmentation using dynamic programming.
Article in Information processing in medical imaging : proceedings of the ... conference, 2011. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 2 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
2 citing papers in PubMed.
- Use of artificial neural networks to identify and analyze polymerized actin-based cytoskeletal structures in 3D confocal images.Quantitative biology (Beijing, China) · 2023Article
- An integrated enhancement and reconstruction strategy for the quantitative extraction of actin stress fibers from fluorescence micrographs.BMC bioinformatics · 2017Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
We introduce a novel algorithm for actin filament segmentation in 2D TIRFM image sequences. This problem is difficult because actin filaments dynamically change shapes during their growth, and the TIRFM images are usually noisy. We ask a user to specify the two tips of a filament of interest in the first frame. We then model the segmentation problem in an image sequence as a temporal chain, where its states are tip locations; given candidate tip locations, actin filaments' body points are inferred by a dynamic programming method, which adaptively generates candidate solutions. Combining candidate tip locations and their inferred body points, the temporal chain model is efficiently optimized using another dynamic programming method. Evaluation on noisy TIRFM image sequences demonstrates the accuracy and robustness of this approach.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.