Evidence map›Paper›PMID 33872961›Full record

ArticleMedical image analysis2021

Faster Mean-shift: GPU-accelerated clustering for cosine embedding-based cell segmentation and tracking.

Mengyang Zhao, Aadarsh Jha, Quan Liu, Bryan A Millis, Anita Mahadevan-Jansen, Le Lu, Bennett A Landman, Matthew J Tyska, Yuankai Huo

Abstract read
In one paragraph

Article in Medical image analysis, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 39 papers.

0numbers the graph read from it
0cells of the map it votes in
39citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

39 citing papers in PubMed.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

9 authors.

Mengyang ZhaoThayer School of Engineering, Dartmouth College, Hanover, NH 03755, USA. Electronic address: Mengyang.Zhao@dartmouth.edu.
Aadarsh JhaDepartment of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN 37235, USA.
Quan LiuDepartment of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN 37235, USA.
Bryan A MillisDepartment of Cell and Developmental Biology, Vanderbilt University, Nashville, TN 37235, USA.
Anita Mahadevan-JansenDepartment of Biomedical Engineering, Vanderbilt University, Nashville, TN 37235, USA.
Le LuPAII Inc., Bethesda, MD 20817, USA.
Bennett A LandmanDepartment of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN 37235, USA.
Matthew J TyskaDepartment of Cell and Developmental Biology, Vanderbilt University, Nashville, TN 37235, USA.
Yuankai HuoDepartment of Electrical Engineering and Computer Science, Vanderbilt University, Nashville, TN 37235, USA. Electronic address: yuankai.huo@vanderbilt.edu.

Funding

Molecular basis of brush border assemblyR01DK095811 · NIDDK · VANDERBILT UNIVERSITY · PI MATTHEW J TYSKA · 2013 to 2026
$4.9M
Role of I-BAR proteins in enterocyte differentiationR01DK111949 · NIDDK · VANDERBILT UNIVERSITY · PI MATTHEW J TYSKA · 2017 to 2026
$4.2M
NIDDK NIH HHS R01 DK095811NIDDK NIH HHS R01 DK111949
6 · The paper itself

Abstract

Recently, single-stage embedding based deep learning algorithms gain increasing attention in cell segmentation and tracking. Compared with the traditional "segment-then-associate" two-stage approach, a single-stage algorithm not only simultaneously achieves consistent instance cell segmentation and tracking but also gains superior performance when distinguishing ambiguous pixels on boundaries and overlaps. However, the deployment of an embedding based algorithm is restricted by slow inference speed (e.g., ≈1-2 min per frame). In this study, we propose a novel Faster Mean-shift algorithm, which tackles the computational bottleneck of embedding based cell segmentation and tracking. Different from previous GPU-accelerated fast mean-shift algorithms, a new online seed optimization policy (OSOP) is introduced to adaptively determine the minimal number of seeds, accelerate computation, and save GPU memory. With both embedding simulation and empirical validation via the four cohorts from the ISBI cell tracking challenge, the proposed Faster Mean-shift algorithm achieved 7-10 times speedup compared to the state-of-the-art embedding based cell instance segmentation and tracking algorithm. Our Faster Mean-shift algorithm also achieved the highest computational speed compared to other GPU benchmarks with optimized memory consumption. The Faster Mean-shift is a plug-and-play model, which can be employed on other pixel embedding based clustering inference for medical image analysis. (Plug-and-play model is publicly available: https://github.com/masqm/Faster-Mean-Shift).

Indexed as

AlgorithmsCell TrackingCluster AnalysisCell segmentationCell trackingEmbeddingGPUMean-shift

Identifiers

PMID33872961
PMCPMC10237323

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

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.