Ionut Emil Iacob

Dr. Ionut Emil Iacob

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
4 April 2023 in Modelling
Verified
Journal Article
Open access
PDF file
MIMohammad Anwarul Islam
Mohammad Anwarul Islam
IIIonut Emil Iacob
Ionut Emil Iacob
The automatic character recognition of historic documents gained more attention from scholars recently, due to the big improvements in computer vision, image processing, and digitization. While Neural Networks, the current state-of-the-art models used for image recognition, are very performant, they typically suffer from using large amounts of training data. In our study we manually built our own relatively small dataset of 404 characters by cropping letter images from a popular historic manuscript, the Electronic Beowulf. To compensate for the small dataset we use ImageDataGenerator, a Python library was used to augment our Beowulf manuscript’s dataset. The training dataset was augmented once, twice, and thrice, which we call resampling 1, resampling 2, and resampling 3, respectively. To classify the manuscript’s character images efficiently, we developed a customized Convolutional Neural Network (CNN) model. We conducted a comparative analysis of the results achieved by our proposed model with other machine learning (ML) models such as support vector machine (SVM), K-nearest neighbor (KNN), decision tree (DT), random forest (RF), and XGBoost. We used pretrained models such as VGG16, MobileNet, and ResNet50 to extract features from character images. We then trained and tested the above ML models and recorded the results. Moreover, we validated our proposed CNN model against the well-established MNIST dataset. Our proposed CNN model achieves very good recognition accuracies of 88.67%, 90.91%, and 98.86% in the cases of resampling 1, resampling 2, and resampling 3, respectively, for the Beowulf manuscript’s data. Additionally, our CNN model achieves the benchmark recognition accuracy of 99.03% for the MNIST dataset.

19 July 2019 in International Journal of Machine Learning and Cybernetics
Verified
Journal Article
Closed access
PDF file
DDDuleep Rathgamage Don
Duleep Rathgamage Don
IIIonut Emil Iacob
Ionut Emil Iacob

20 October 2018 in The College Mathematics Journal
Verified
Journal Article
Closed access
AGArtur Grygorian
Artur Grygorian
IIIonut Emil Iacob
Ionut Emil Iacob
(2018). A Concise Proof of the Triangle Inequality for the Jaccard Distance. The College Mathematics Journal: Vol. 49, No. 5, pp. 363-365.


23 October 2018 in arXiv
Verified
Preprint
Open access
PDF file
DDDuleep Rathgamage Don
Duleep Rathgamage Don
IIIonut Emil Iacob
Ionut Emil Iacob
We present DCSVM, an efficient algorithm for multi-class classification using Support Vector Machines. DCSVM is a divide and conquer algorithm which relies on data sparsity in high dimensional space and performs a smart partitioning of the whole training data set into disjoint subsets that are easily separable. A single prediction performed between two partitions eliminates at once one or more classes in one partition, leaving only a reduced number of candidate classes for subsequent steps. The algorithm continues recursively, reducing the number of classes at each step, until a final binary decision is made between the last two classes left in the competition. In the best case scenario, our algorithm makes a final decision between $k$ classes in $O(\log k)$ decision steps and in the worst case scenario DCSVM makes a final decision in $k-1$ steps, which is not worse than the existent techniques.

17 December 2017 in arXiv
Verified
Preprint
Open access
PDF file
DDD. Dmitrishin
D. Dmitrishin
IIIonut Emil Iacob
Ionut Emil Iacob
ISI. Skrinnik
I. Skrinnik
ASA. Stokolos
A. Stokolos
We present a new solution for fundamental problems in nonlinear dynamical systems: finding, verifying, and stabilizing cycles. The solution we propose consists of a new control method based on mixing previous states of the system (or the functions of these states). This approach allows us to locally stabilize and to find a priori unknown cycles of a given length. Our method generalizes and improves on the existing one dimensional space solutions to multi-dimensional space while using the geometric complex functions theory rather than a linear algebra approach. Several numerical examples are considered. All statements and formulas are given in final form. The formulas derivation and reasoning may be found in the cited references. The article focuses on practical applications of methods and algorithms.