MétaCan
Menu
Back to cohort
Record W2158659768 · doi:10.1109/iembs.2007.4353597

Stem-Cell Localization: A Deconvolution Problem

2007· article· en· W2158659768 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueConference proceedings · 2007
Typearticle
Languageen
FieldMedicine
TopicHematopoietic Stem Cell Transplantation
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsDeconvolutionStem cellComputer scienceSegmentationCellHaematopoiesisTracking (education)Blood cellArtificial intelligenceBiologyCell biologyImmunologyAlgorithm

Abstract

fetched live from OpenAlex

Hematopoietic Stem Cells (HSCs) form blood and immune cells and are responsible for the constant renewal of blood. To produce new blood cells, HSCs proliferate and differentiate to different blood cell types continuously during their lifetime. Hence they are of substantial interest in stem cell therapy and cancer research. To classify HSCs to different groups, they must be observed/tracked over time and their key features including cell size, shape, and motility must be extracted. The manual tracking is an onerous task and automated methods are in high demand. The first stage of an semi-automatic/automatic tracking system is cell segmentation. In our previous work we addressed the cell segmentation/localization problem. Modelling adjacent or splitting cells is very challenging and our previous methods might fail to accurately model a group of adjacent cells or a splitting cell. In this paper we address this issue and propose a deconvolution method to precisely model individual HSCs as well as adjacent (splitting) HSCs. An optimization algorithm is combined with a template matching method to segment cell regions and locate the cell centers.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.587
Threshold uncertainty score0.567

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.025
GPT teacher head0.265
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it