Evidence map›Paper›PMID 27774494›Full record

ArticleJournal of medical imaging (Bellingham, Wash.)2016

Optimized SIFTFlow for registration of whole-mount histology to reference optical images.

Rushin Shojaii, Anne L Martel

Open access · hybridAbstract read
In one paragraph

Article in Journal of medical imaging (Bellingham, Wash.), 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

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

0 citing papers in PubMed, 4 citations in OpenAlex.

No citing paper in PubMed yet.

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

2 authors at 1 institution in 1 country.

Rushin ShojaiiUniversity of Toronto , Department of Medical Biophysics, 2075 Bayview Avenue, Toronto, Ontario M4N 3M5, Canada.
Anne L MartelUniversity of Toronto, Department of Medical Biophysics, 2075 Bayview Avenue, Toronto, Ontario M4N 3M5, Canada; Sunnybrook Research Institute, Physical Sciences, 2075 Bayview Avenue, Toronto, Ontario M4N 3M5, Canada.
University of Toronto · CA

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The registration of two-dimensional histology images to reference images from other modalities is an important preprocessing step in the reconstruction of three-dimensional histology volumes. This is a challenging problem because of the differences in the appearances of histology images and other modalities, and the presence of large nonrigid deformations which occur during slide preparation. This paper shows the feasibility of using densely sampled scale-invariant feature transform (SIFT) features and a SIFTFlow deformable registration algorithm for coregistering whole-mount histology images with blockface optical images. We present a method for jointly optimizing the regularization parameters used by the SIFTFlow objective function and use it to determine the most appropriate values for the registration of breast lumpectomy specimens. We demonstrate that tuning the regularization parameters results in significant improvements in accuracy and we also show that SIFTFlow outperforms a previously described edge-based registration method. The accuracy of the histology images to blockface images registration using the optimized SIFTFlow method was assessed using an independent test set of images from five different lumpectomy specimens and the mean registration error was [Formula: see text].

Indexed as

deformable registrationdigital pathologypathology radiology correlationthree-dimensional histology

Identifiers

PMID27774494
PMCPMC5069282
OpenAlexW2538283503

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.