DentAssignNet: Assignment Network for Dental Cast Labeling in the Presence of Dental Abnormalities

IF 6.8 2区 医学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Journal of Biomedical and Health Informatics Pub Date : 2025-03-20 DOI:10.1109/JBHI.2025.3549685
Tudor Dascalu;Shaqayeq Ramezanzade;Azam Bakhshandeh;Lars Bjørndal;Raluca Iurcov;Tomaž Vrtovec;Bulat Ibragimov
{"title":"DentAssignNet: Assignment Network for Dental Cast Labeling in the Presence of Dental Abnormalities","authors":"Tudor Dascalu;Shaqayeq Ramezanzade;Azam Bakhshandeh;Lars Bjørndal;Raluca Iurcov;Tomaž Vrtovec;Bulat Ibragimov","doi":"10.1109/JBHI.2025.3549685","DOIUrl":null,"url":null,"abstract":"This study focuses on the challenging problem of labeling a collection of objects with inherent morphological and positional dependencies, where instances may be missing or duplicated. We integrate principles of assignment theory in the design of a convolutional neural network to find the optimal label set given pairwise geometrical features extracted from the candidate objects. The objective function aims to minimize the distance between the one-hot encoded labels of the objects and the scores produced by the model, with added emphasis on the scores corresponding to the optimal assignment plan. We tested our solution in the dental domain on the task of finding the teeth labels given a set of candidate instances. The study database included 1200 dental casts of upper and lower jaws from 600 patients. The model reached identification accuracies of 0.952 and 0.968 for the lower and upper jaws, respectively. Moreover, we presented a solution for generating teeth candidates using a multi-step pipeline consisting of coarse and fine segmentations. The algorithm was tested on a database consisting of 600 dental casts, reaching an F1 score of 0.968.","PeriodicalId":13073,"journal":{"name":"IEEE Journal of Biomedical and Health Informatics","volume":"29 7","pages":"4981-4990"},"PeriodicalIF":6.8000,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10935619","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Journal of Biomedical and Health Informatics","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10935619/","RegionNum":2,"RegionCategory":"医学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This study focuses on the challenging problem of labeling a collection of objects with inherent morphological and positional dependencies, where instances may be missing or duplicated. We integrate principles of assignment theory in the design of a convolutional neural network to find the optimal label set given pairwise geometrical features extracted from the candidate objects. The objective function aims to minimize the distance between the one-hot encoded labels of the objects and the scores produced by the model, with added emphasis on the scores corresponding to the optimal assignment plan. We tested our solution in the dental domain on the task of finding the teeth labels given a set of candidate instances. The study database included 1200 dental casts of upper and lower jaws from 600 patients. The model reached identification accuracies of 0.952 and 0.968 for the lower and upper jaws, respectively. Moreover, we presented a solution for generating teeth candidates using a multi-step pipeline consisting of coarse and fine segmentations. The algorithm was tested on a database consisting of 600 dental casts, reaching an F1 score of 0.968.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DentAssignNet:在牙齿异常情况下的牙模标记分配网络。
本研究的重点是标记具有固有形态和位置依赖性的对象集合的挑战性问题,其中实例可能缺失或重复。我们在卷积神经网络的设计中结合赋值理论的原理,从候选对象中提取成对的几何特征,找到最优的标记集。目标函数的目的是使目标的一热编码标签与模型产生的分数之间的距离最小,并强调与最优分配方案相对应的分数。我们在牙齿领域测试了我们的解决方案,任务是在给定一组候选实例的情况下找到牙齿标签。该研究数据库包括来自600名患者的1200个上下颌牙模。该模型对上颌和下颚的识别准确率分别达到0.952和0.968。此外,我们提出了一种使用由粗分割和细分割组成的多步骤管道生成候选牙齿的解决方案。该算法在600个牙模数据库上进行了测试,F1得分为0.968。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Journal of Biomedical and Health Informatics
IEEE Journal of Biomedical and Health Informatics COMPUTER SCIENCE, INFORMATION SYSTEMS-COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
CiteScore
13.60
自引率
6.50%
发文量
1151
期刊介绍: IEEE Journal of Biomedical and Health Informatics publishes original papers presenting recent advances where information and communication technologies intersect with health, healthcare, life sciences, and biomedicine. Topics include acquisition, transmission, storage, retrieval, management, and analysis of biomedical and health information. The journal covers applications of information technologies in healthcare, patient monitoring, preventive care, early disease diagnosis, therapy discovery, and personalized treatment protocols. It explores electronic medical and health records, clinical information systems, decision support systems, medical and biological imaging informatics, wearable systems, body area/sensor networks, and more. Integration-related topics like interoperability, evidence-based medicine, and secure patient data are also addressed.
期刊最新文献
Enhancing Lesion Segmentation via Medical Image-Mask Pair Synthesis using Phenotype-Conditioned Diffusion Models. EEGDTF: Time-Frequency Disentangled Diffusion for High-Fidelity EEG Signal Generation. Long-Term, Patient-Specific Seizure Prediction using Absolute Mean Instantaneous Frequency Difference (AMIFD) and Seizure Clustering. MFS-VQ-VAE: Synthesizing 7T-like MR images from 1.5T MR images with Prompt Attention in VQ-VAE. Multi-needle Localization for Pelvic Seed Implant Brachytherapy based on Tip-handle Detection and Matching.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1