Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Permanent URI for this collectionhttps://hdl.handle.net/11147/7148

Browse

Search Results

Now showing 1 - 2 of 2
  • Article
    Citation - WoS: 55
    Citation - Scopus: 56
    Evaluation of an Artificial Intelligence System for Diagnosing Scaphoid Fracture on Direct Radiography
    (Springer Verlag, 2020) Özkaya, Emre; Topal, Fatih Esad; Bulut, Tuğrul; Gürsoy, Merve; Özuysal, Mustafa; Karakaya, Zeynep
    Purpose The aim of this study is to determine the diagnostic performance of artificial intelligence with the use of convolutional neural networks (CNN) for detecting scaphoid fractures on anteroposterior wrist radiographs. The performance of the deep learning algorithm was also compared with that of the emergency department (ED) physician and two orthopaedic specialists (less experienced and experienced in the hand surgery). Methods A total 390 patients with AP wrist radiographs were included in the study. The presence/absence of the fracture on radiographs was confirmed via CT. The diagnostic performance of the CNN, ED physician and two orthopaedic specialists (less experienced and experienced) as measured by AUC, sensitivity, specificity, F-Score and Youden index, to detect scaphoid fractures was evaluated and compared between the groups. Results The CNN had 76% sensitivity and 92% specificity, 0.840 AUC, 0.680 Youden index and 0.826Fscore values in identifying scaphoid fractures. The experienced orthopaedic specialist had the best diagnostic performance according to AUC. While CNN's performance was similar to a less experienced orthopaedic specialist, it was better than the ED physician. Conclusion The deep learning algorithm has the potential to be used for diagnosing scaphoid fractures on radiographs. Artificial intelligence can be useful for scaphoid fracture diagnosis particularly in the absence of an experienced orthopedist or hand surgeon.
  • Article
    Citation - WoS: 5
    Citation - Scopus: 5
    Instance Detection by Keypoint Matching Beyond the Nearest Neighbor
    (Springer Verlag, 2016) Uzyıldırım, Furkan Eren; Özuysal, Mustafa
    The binary descriptors are the representation of choice for real-time keypoint matching. However, they suffer from reduced matching rates due to their discrete nature. We propose an approach that can augment their performance by searching in the top K near neighbor matches instead of just the single nearest neighbor one. To pick the correct match out of the K near neighbors, we exploit statistics of descriptor variations collected for each keypoint in an off-line training phase. This is a similar approach to those that learn a patch specific keypoint representation. Unlike these approaches, we only use a keypoint specific score to rank the list of K near neighbors. Since this list can be efficiently computed with approximate nearest neighbor algorithms, our approach scales well to large descriptor sets.