ADEWALE OPEOLUWA OGUNDE

Prof. ADEWALE OPEOLUWA OGUNDE

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2005 in Information Management & Computer Security
Verified
Journal Article
Closed access
OFO. Folorunso
O. Folorunso
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE

1 June 2020 in Journal of Computer Science
Verified
Journal Article
Open access
PDF file
DADaniel Akinbade
Daniel Akinbade
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE
MOMba Obasi Odim
Mba Obasi Odim
BOBosede Oyenike Oguntunde
Bosede Oyenike Oguntunde
Extracting texts from images with complex backgrounds is a major challenge today. Many existing Optical Character Recognition (OCR) systems could not handle this problem. As reported in the literature, some existing methods that can handle the problem still encounter major difficulties with extracting texts from images with sharp varying contours, touching word and skewed words from scanned documents and images with such complex backgrounds. There is, therefore, a need for new methods that could easily and efficiently extract texts from these images with complex backgrounds, which is the primary reason for this work. This study collected image data and investigated the processes involved in image processing and the techniques applied for data segmentation. It employed an adaptive thresholding algorithm to the selected images to properly segment text characters from the image’s complex background. It then used Tesseract, a machine learning product, to extract the text from the image file. The images used were coloured images sourced from the internet with different formats like jpg, png, webp and different resolutions. A custom adaptive algorithm was applied to the images to unify their complex backgrounds. This algorithm leveraged on the Gaussian thresholding algorithm. The algorithm differs from the conventional Gaussian algorithm as it dynamically generated the blocksize to apply threshing to the image. This ensured that, unlike conventional image segmentation, images were processed area-wise (in pixels) as specified by the algorithm at each instance. The system was implemented using Python 3.6 programming language. Experimentation involved fifty different images with complex backgrounds. The results showed that the system was able to extract English character-based texts from images with complex backgrounds with 69.7% word-level accuracy and 81.9% character-level accuracy. The proposed method in this study proved to be more efficient as it outperformed the existing methods in terms of the character level percentage accuracy.

3 August 2021 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
MFMichael Adebisi Fayemiwo
Michael Adebisi Fayemiwo
TOToluwase Ayobami Olowookere
Toluwase Ayobami Olowookere
SASamson Afolabi Arekete
Samson Afolabi Arekete
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE
MOMba Obasi Odim
Mba Obasi Odim
AKAderonke Anthonia Kayode
Aderonke Anthonia Kayode
Severe Acute Respiratory Syndrome Coronavirus 2 (SARS-Coronavirus-2 or SARS-CoV-2), which came into existence in 2019, is a viral pandemic that caused coronavirus disease 2019 (COVID-19) illnesses and death. Research showed that relentless efforts had been made to improve key performance indicators for detection, isolation, and early treatment. This paper used Deep Transfer Learning Model (DTL) for the classification of a real-life COVID-19 dataset of chest X-ray images in both binary (COVID-19 or Normal) and three-class (COVID-19, Viral-Pneumonia or Normal) classification scenarios. Four experiments were performed where fine-tuned VGG-16 and VGG-19 Convolutional Neural Networks (CNNs) with DTL were trained on both binary and three-class datasets that contain X-ray images. The system was trained with an X-ray image dataset for the detection of COVID-19. The fine-tuned VGG-16 and VGG-19 DTL were modelled by employing a batch size of 10 in 40 epochs, Adam optimizer for weight updates, and categorical cross-entropy loss function. The results showed that the fine-tuned VGG-16 and VGG-19 models produced an accuracy of 99.23% and 98.00%, respectively, in the binary task. In contrast, in the multiclass (three-class) task, the fine-tuned VGG-16 and VGG-19 DTL models produced an accuracy of 93.85% and 92.92%, respectively. Moreover, the fine-tuned VGG-16 and VGG-19 models have MCC of 0.98 and 0.96 respectively in the binary classification, and 0.91 and 0.89 for multiclass classification. These results showed strong positive correlations between the models’ predictions and the true labels. In the two classification tasks (binary and three-class), it was observed that the fine-tuned VGG-16 DTL model had stronger positive correlations in the MCC metric than the fine-tuned VGG-19 DTL model. The VGG-16 DTL model has a Kappa value of 0.98 as against 0.96 for the VGG-19 DTL model in the binary classification task, while in the three-class classification problem, the VGG-16 DTL model has a Kappa value of 0.91 as against 0.89 for the VGG-19 DTL model. This result is in agreement with the trend observed in the MCC metric. Hence, it was discovered that the VGG-16 based DTL model classified COVID-19 better than the VGG-19 based DTL model. Using the best performing fine-tuned VGG-16 DTL model, tests were carried out on 470 unlabeled image dataset, which was not used in the model training and validation processes. The test accuracy obtained for the model was 98%. The proposed models provided accurate diagnostics for both the binary and multiclass classifications, outperforming other existing models in the literature in terms of accuracy, as shown in this work.

27 October 2019 in Engineering Reports
Verified
Journal Article
Open access
PDF file
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE
JIJoy Oseremen Idialu
Joy Oseremen Idialu
The difficulty in securing students industrial work experience scheme (SIWES) placements has negatively affected the final grades of some undergraduates. A recommender system is hereby proposed to solve this problem. This system will use past SIWES data to recommend potential organizations to future SIWES students. Research data collection was through an online questionnaire, with 200 respondents. The data was divided into a training data set (70%) and test data set (30%). Collaborative filtering recommendation approach was employed using the C4.5 algorithm to classify the data and generate a decision tree model from the training data set. The model generated was used to predict the class label of the test data set. Results from the data analysis carried out revealed that Kappa statistics was 0.7839, mean absolute error = 0.0058, and root mean squared error = 0.0586. In addition, true positive rate = 0.788, recall = 0.788, precision = 0.749, F‐measure = 0.755, MCC = 0.760, ROC = 0.985, and PRC = 0.813. The high values obtained indicates that the model was predicting with a high level of accuracy, ie, 78.84% correctly classified instances. The developed model was used as a knowledge base to develop a very beneficial front‐end web application, tagged “RecommendIT” where students can enter their preferences and view company recommendations.

1 November 2015 in Egyptian Informatics Journal
Verified
Journal Article
Open access
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE
OFO. Folorunso
O. Folorunso
ASA.S. Sodiya
A.S. Sodiya
The extraction of patterns and rules from large distributed databases through existing Distributed Association Rule Mining (DARM) systems is still faced with enormous challenges such as high response times, high communication costs and inability to adapt to the constantly changing databases. In this work, a Partition Enhanced Mining Algorithm (PEMA) is presented to address these problems. In PEMA, the Association Rule Mining Coordinating Agent receives a request and decides the appropriate data sites, partitioning strategy and mining agents to use. The mining process is divided into two stages. In the first stage, the data agents horizontally segment the databases with small average transaction length into relatively smaller partitions based on the number of available sites and the available memory. On the other hand, databases with relatively large average transaction length were vertically partitioned. After this, Mobile Agent-Based Association Rule Mining-Agents, which are the mining agents, carry out the discovery of the local frequent itemsets. At the second stage, the local frequent itemsets were incrementally integrated by the from one data site to another to get the global frequent itemsets. This reduced the response time and communication cost in the system. Results from experiments conducted on real datasets showed that the average response time of PEMA showed an improvement over existing algorithms. Similarly, PEMA incurred lower communication costs with average size of messages exchanged lower when compared with benchmark DARM systems. This result showed that PEMA could be efficiently deployed for efficient discovery of valuable knowledge in distributed databases.

1 January 2017 in Advances in Science, Technology and Engineering Systems Journal
Verified
Journal Article
Open access
AOADEWALE OPEOLUWA OGUNDE
ADEWALE OPEOLUWA OGUNDE
AOAjibola Rasaq Olanbo
Ajibola Rasaq Olanbo
A Web-Based Decision Support System for Evaluating Soil Suitability for Cassava Cultivation Volume 2, Issue 1, Page No 42-50, 2017 Adewale Opeoluwa Ogunde