| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
- Källén, Hanna, et al.
(författare)
-
Towards Grading Gleason Score using Generically Trained Deep convolutional Neural Networks
- 2016
-
Ingår i: 2016 IEEE 13th International Symposium on Biomedical Imaging (ISBI). - : Institute of Electrical and Electronics Engineers (IEEE). - 9781479923496 - 9781479923502 ; 2016-June, s. 1163-1167
-
Konferensbidrag (refereegranskat)abstract
- We developed an automatic algorithm with the purpose to assist pathologists to report Gleason score on malignant prostatic adenocarcinoma specimen. In order to detect and classify the cancerous tissue, a deep convolutional neural network that had been pre-trained on a large set of photographic images was used. A specific aim was to support intuitive interaction with the result, to let pathologists adjust and correct the output. Therefore, we have designed an algorithm that makes a spatial classification of the whole slide into the same growth patterns as pathologists do. The 22-layer network was cut at an earlier layer and the output from that layer was used to train both a random forest classifier and a support vector machines classifier. At a specific layer a small patch of the image was used to calculate a feature vector and an image is represented by a number of those vectors. We have classified both the individual patches and the entire images. The classification results were compared for different scales of the images and feature vectors from two different layers from the network. Testing was made on a dataset consisting of 213 images, all containing a single class, benign tissue or Gleason score 3-5. Using 10-fold cross validation the accuracy per patch was 81 %. For whole images, the accuracy was increased to 89 %.
|
|
| 5. |
|
|
| 6. |
- Weegar, Rebecka, et al.
(författare)
-
Linking Entities Across Images and Text
- 2015
-
Ingår i: Proceedings of the 19th Conference on Computational Language Learning. - Stroudsburg, PA, USA : Association for Computational Linguistics. - 9781941643778 ; , s. 185-193
-
Konferensbidrag (refereegranskat)abstract
- This paper describes a set of methods to link entities across images and text. Asa corpus, we used a data set of images, where each image is commented by a short caption and where the regions in the images are manually segmented and labeled with a category. We extracted the entity mentions from the captions and we computed a semantic similarity between the mentions and the region labels. We also measured the statistical associations between these mentions and the labels and we combined them with the semantic similarity to produce mappings in the form of pairs consisting of a region label and a caption entity. In a second step, we used the syntactic relationships between the mentions and the spatial relationships between the regions to rerank the lists of candidate mappings. To evaluate our methods, we annotated a test set of 200 images, where we manually linked the image regions to their corresponding mentions in the captions. Eventually, we could match objects in pictures to their correct mentions for nearly 89 percent of the segments, when such a matching exists.
|
|
| 7. |
- Aanæs, Henrik, et al.
(författare)
-
Factorization with erroneous data
- 2002
-
Konferensbidrag (refereegranskat)abstract
- Factorization algorithms for recovering structure and motion from an image stream have many advantages, but traditionally requires a set of well tracked feature points. This limits the usability since, correctly tracked feature points are not available in general. There is thus a need to make factorization algorithms deal successfully with incorrectly tracked feature points. We propose a new computationally efficient algorithm for applying an arbitrary error function in the factorization scheme, and thereby enable the use of robust statistical techniques and arbitrary noise models for individual feature points. These techniques and models effectively deal with feature point noise as well as feature mismatch and missing features. Furthermore, the algorithm includes a new method for Euclidean reconstruction that experimentally shows a significant improvement in convergence of the factorization algorithms. The proposed algorithm has been implemented in the Christy–Horaud factorization scheme and the results clearly illustrate a considerable increase in error tolerance.
|
|
| 8. |
|
|
| 9. |
- Andersson, Pontus, et al.
(författare)
-
FLIP: A Difference Evaluator for Alternating Images
- 2020
-
Ingår i: Proceedings of the ACM in Computer Graphics and Interactive Techniques. - : Association for Computing Machinery (ACM). - 2577-6193. ; 3:2, s. 1-23
-
Tidskriftsartikel (refereegranskat)abstract
- Image quality measures are becoming increasingly important in the field of computer graphics. For example, there is currently a major focus on generating photorealistic images in real time by combining path tracing with denoising, for which such quality assessment is integral. We present FLIP, which is a difference evaluator with a particular focus on the differences between rendered images and corresponding ground truths. Our algorithm produces a map that approximates the difference perceived by humans when alternating between two images. FLIP is a combination of modified existing building blocks, and the net result is surprisingly powerful. We have compared our work against a wide range of existing image difference algorithms and we have visually inspected over a thousand image pairs that were either retrieved from image databases or generated in-house. We also present results of a user study which indicate that our method performs substantially better, on average, than the other algorithms. To facilitate the use of FLIP, we provide source code in C++, MATLAB, NumPy/SciPy, and PyTorch.
|
|
| 10. |
- Arvidsson, Ida, et al.
(författare)
-
Deep learning prediction of quantitative coronary angiography values using myocardial perfusion images with a CZT camera
- 2023
-
Ingår i: Journal of Nuclear Cardiology. - : Springer Science and Business Media LLC. - 1071-3581 .- 1532-6551. ; 30:1, s. 116-126
-
Tidskriftsartikel (refereegranskat)abstract
- Purpose: Evaluate the prediction of quantitative coronary angiography (QCA) values from MPI, by means of deep learning. Methods: 546 patients (67% men) undergoing stress 99mTc-tetrofosmin MPI in a CZT camera in the upright and supine position were included (1092 MPIs). Patients were divided into two groups: ICA group included 271 patients who performed an ICA within 6 months of MPI and a control group with 275 patients with low pre-test probability for CAD and a normal MPI. QCA analyses were performed using radiologic software and verified by an expert reader. Left ventricular myocardium was segmented using clinical nuclear cardiology software and verified by an expert reader. A deep learning model was trained using a double cross-validation scheme such that all data could be used as test data as well. Results: Area under the receiver-operating characteristic curve for the prediction of QCA, with > 50% narrowing of the artery, by deep learning for the external test cohort: per patient 85% [95% confidence interval (CI) 84%-87%] and per vessel; LAD 74% (CI 72%-76%), RCA 85% (CI 83%-86%), LCx 81% (CI 78%-84%), and average 80% (CI 77%-83%). Conclusion: Deep learning can predict the presence of different QCA percentages of coronary artery stenosis from MPIs.
|
|
