Skip to content
naulon
Not checkedNot checked for notices yet.

Dental Caries Detection Using Score-Based Multi-Input Deep Convolutional Neural Network

Andac Imak, Adalet Celebi, Kamran Siddique and 3 more

IEEE Access · 2022

doi:10.1109/access.2022.3150358 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Panoramic and periapical radiograph tools help dentists in diagnosing the most common dental diseases, such as dental caries. Generally, dental caries is manually diagnosed by dentists based on panoramic and periapical images. For several reasons, such as carelessness caused by heavy workload and inexperience, manual diagnosis may cause unnoticeable dental caries. Thus, computer-based intelligent vision systems supported by machine learning and image processing techniques are needed to prevent these negativities. This study proposed a novel approach for the automatic diagnosis of dental caries based on periapical images. The proposed procedure used a multi-input deep convolutional neural network ensemble (MI-DCNNE) model. Specifically, a score-based ensemble scheme was employed to increase the achievement of the proposed MI-DCNNE method. The inputs to the proposed approach were both raw periapical images and an enhanced form of it. The score fusion was carried out in the Softmax layer of the proposed multi-input CNN architecture. In the experimental works, a periapical image dataset (340 images) covering both caries and non-caries images were used for the performance evaluation of the proposed method. According to the results, it was seen that the proposed model is quite successful in the diagnosis of dental caries. The reported accuracy score is 99.13%. This result shows that the proposed MI-DCNNE model can effectively contribute to the classification of dental caries.

Abstract licence: CC BY-NC-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.