Evidence map›Paper›PMID 37525464›Full record

ArticleBiophysical journal2023

Enhancing robustness, precision, and speed of traction force microscopy with machine learning.

Felix S Kratz, Lars Möllerherm, Jan Kierfeld

Open access · greenAbstract read
In one paragraph

Article in Biophysical journal, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
2.5field-weighted citation impact, top 11% of its field
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

5 citing papers in PubMed, 12 citations in OpenAlex.

  1. Review
  2. Article
  3. Review
  4. Review
  5. 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

3 authors at 1 institution in 1 country.

Felix S KratzDepartment of Physics, TU Dortmund University, Dortmund, Germany.
Lars MöllerhermDepartment of Physics, TU Dortmund University, Dortmund, Germany.
Jan KierfeldDepartment of Physics, TU Dortmund University, Dortmund, Germany. Electronic address: jan.kierfeld@tu-dortmund.de.
TU Dortmund University · DE

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Traction patterns of adherent cells provide important information on their interaction with the environment, cell migration, or tissue patterns and morphogenesis. Traction force microscopy is a method aimed at revealing these traction patterns for adherent cells on engineered substrates with known constitutive elastic properties from deformation information obtained from substrate images. Conventionally, the substrate deformation information is processed by numerical algorithms of varying complexity to give the corresponding traction field via solution of an ill-posed inverse elastic problem. We explore the capabilities of a deep convolutional neural network as a computationally more efficient and robust approach to solve this inversion problem. We develop a general purpose training process based on collections of circular force patches as synthetic training data, which can be subjected to different noise levels for additional robustness. The performance and the robustness of our approach against noise is systematically characterized for synthetic data, artificial cell models, and real cell images, which are subjected to different noise levels. A comparison with state-of-the-art Bayesian Fourier transform traction cytometry reveals the precision, robustness, and speed improvements achieved by our approach, leading to an acceleration of traction force microscopy methods in practical applications.

Indexed as

Machine LearningTractionBayes TheoremCell MovementMicroscopy, Atomic Force

Identifiers

PMID37525464
PMCPMC10502481
OpenAlexW4385399901

What OpenQuestion holds

Textmetadata
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.