Your browser doesn't support javascript.
loading
Show: 20 | 50 | 100
Results 1 - 2 de 2
Filter
Add more filters










Database
Main subject
Language
Publication year range
1.
Acad Radiol ; 30(10): 2269-2279, 2023 10.
Article in English | MEDLINE | ID: mdl-37210268

ABSTRACT

RATIONALE AND OBJECTIVES: Finding comparison to relevant prior studies is a requisite component of the radiology workflow. The purpose of this study was to evaluate the impact of a deep learning tool simplifying this time-consuming task by automatically identifying and displaying the finding in relevant prior studies. MATERIALS AND METHODS: The algorithm pipeline used in this retrospective study, TimeLens (TL), is based on natural language processing and descriptor-based image-matching algorithms. The dataset used for testing comprised 3872 series of 246 radiology examinations from 75 patients (189 CTs, 95 MRIs). To ensure a comprehensive testing, five finding types frequently encountered in radiology practice were included: aortic aneurysm, intracranial aneurysm, kidney lesion, meningioma, and pulmonary nodule. After a standardized training session, nine radiologists from three university hospitals performed two reading sessions on a cloud-based evaluation platform resembling a standard RIS/PACS. The task was to measure the diameter of the finding-of-interest on two or more exams (a most recent and at least one prior exam): first without use of TL, and a second session at an interval of at least 21 days with the use of TL. All user actions were logged for each round, including time needed to measure the finding at all timepoints, number of mouse clicks, and mouse distance traveled. The effect of TL was evaluated in total, per finding type, per reader, per experience (resident vs. board-certified radiologist), and per modality. Mouse movement patterns were analyzed with heatmaps. To assess the effect of habituation to the cases, a third round of readings was performed without TL. RESULTS: Across scenarios, TL reduced the average time needed to assess a finding at all timepoints by 40.1% (107 vs. 65 seconds; p < 0.001). Largest accelerations were demonstrated for assessment of pulmonary nodules (-47.0%; p < 0.001). Less mouse clicks (-17.2%) were needed for finding evaluation with TL, and mouse distance traveled was reduced by 38.0%. Time needed to assess the findings increased from round 2 to round 3 (+27.6%; p < 0.001). Readers were able to measure a given finding in 94.4% of cases on the series initially proposed by TL as most relevant series for comparison. The heatmaps showed consistently simplified mouse movement patterns with TL. CONCLUSION: A deep learning tool significantly reduced both the amount of user interactions with the radiology image viewer and the time needed to assess findings of interest on cross-sectional imaging with relevant prior exams.


Subject(s)
Deep Learning , Humans , Retrospective Studies , Radiologists , Magnetic Resonance Imaging/methods , Tomography, X-Ray Computed/methods
2.
KDD ; 2014: 223-232, 2014 Aug.
Article in English | MEDLINE | ID: mdl-36844382

ABSTRACT

We present a clustering algorithm for discovering rare yet significant recurring classes across a batch of samples in the presence of random effects. We model each sample data by an infinite mixture of Dirichlet-process Gaussian-mixture models (DPMs) with each DPM representing the noisy realization of its corresponding class distribution in a given sample. We introduce dependencies across multiple samples by placing a global Dirichlet process prior over individual DPMs. This hierarchical prior introduces a sharing mechanism across samples and allows for identifying local realizations of classes across samples. We use collapsed Gibbs sampler for inference to recover local DPMs and identify their class associations. We demonstrate the utility of the proposed algorithm, processing a flow cytometry data set containing two extremely rare cell populations, and report results that significantly outperform competing techniques. The source code of the proposed algorithm is available on the web via the link: http://cs.iupui.edu/~dundar/aspire.htm.

SELECTION OF CITATIONS
SEARCH DETAIL
...