No description available.

Kubernetes is a free, open-source container orchestration system for deploying and managing Docker containers that host microservices. Its cluster logs are extremely helpful in determining the root cause of a failure. However, as systems become more complex, locating failures becomes more difficult and time-consuming. This study aims to identify the classification algorithms that accurately classify the given log data and, at the same time, require fewer computational resources. Because the data is quite large, we begin with expert-based feature selection to reduce the data size. Following that, TF-IDF feature extraction is performed, and finally, we compare five classification algorithms, SVM, KNN, random forest, gradient boosting and MLP using several metrics. The results show that Random forest produces good accuracy while requiring fewer computational resources compared to other algorithms.

Background: Biometric identification plays a crucial role in various industries such as retail, and banking. Among the different biometric traits, iris patterns have become a reliable means of identification due to their unique features. In our thesis, we focus on evaluating and comparing different machine learning algorithms for irisrecognition. The main aim is to identify the algorithm that achieves the highestperformance for iris recognition. Objectives: The main objective of the thesis is to train, test, and evaluate the best performing model using the iris image dataset among the selected algorithmsthrough a literature review. Additionally, the goal is to compare different algorithms for a biometric recognition system that relies on iris features. Methods: Our research is supported by an extensive literature review that usesa wide range of scholarly articles specifically focused on iris recognition. Experimentation is also used to determine the most accurate machine-learning algorithm interms of accuracy. Results: Our experimentation results revealed that the accuracy rates for all themodels were as follows: CNN obtained the highest accuracy at 98.7%, while SVM and the SVM combination with hamming distance achieved 86% and 80%, respectively. Based on our research findings, we conclude that including hamming distancewith SVM did not result in improved accuracy compared to other classification algorithms. Finally, CNN achieved high accuracy in comparison to different algorithmsfor iris recognition. Conclusions: To achieve our research goals, we divided the dataset into three parts: 60% for training, 20% for testing, and another 20% for validation. Different techniques were used to train the algorithm with the training dataset. The results aretested for every algorithm to determine its accuracy. Among the selected algorithms, the convolutional neural network delivered an accurate performance with an accuracy of 98.7%. By employing performance metrics, we have effectively addressed theresearch questions and identified the most accurate algorithm for the iris recognitionsystem.

Thesis(M.Sc.(Computer Science)) -- University of Limpopo, 2020 / Speech emotion recognition (SER) refers to a technology that enables machines to detect and recognise human emotions from spoken phrases. In the literature, numerous attempts have been made to develop systems that can recognise human emotions from their voice, however, not much work has been done in the context of South African indigenous languages. The aim of this study was to develop an SER system that can classify and recognise six basic human emotions (i.e., sadness, fear, anger, disgust, happiness, and neutral) from speech spoken in Sepedi language (one of South Africa’s official languages). One of the major challenges encountered, in this study, was the lack of a proper corpus of emotional speech. Therefore, three different Sepedi emotional speech corpora consisting of acted speech data have been developed. These include a RecordedSepedi corpus collected from recruited native speakers (9 participants), a TV broadcast corpus collected from professional Sepedi actors, and an Extended-Sepedi corpus which is a combination of Recorded-Sepedi and TV broadcast emotional speech corpora. Features were extracted from the speech corpora and a data file was constructed. This file was used to train four machine learning (ML) algorithms (i.e., SVM, KNN, MLP and Auto-WEKA) based on 10 folds validation method. Three experiments were then performed on the developed speech corpora and the performance of the algorithms was compared. The best results were achieved when Auto-WEKA was applied in all the experiments. We may have expected good results for the TV broadcast speech corpus since it was collected from professional actors, however, the results showed differently. From the findings of this study, one can conclude that there are no precise or exact techniques for the development of SER systems, it is a matter of experimenting and finding the best technique for the study at hand. The study has also highlighted the scarcity of SER resources for South African indigenous languages. The quality of the dataset plays a vital role in the performance of SER systems. / National research foundation (NRF) and Telkom Center of Excellence (CoE)

Presented here is a novel tool to extract and track believable vortex core lines from unsteady Computational Fluid Dynamics data sets using multiple feature extraction algorithms. Existing work explored the possibility of extracting features concurrent with a running simulation using intelligent software agents, combining multiple algorithms' capabilities using subjective logic. This work modifies the steady-state approach to work with unsteady fluid dynamics and is designed to work within the Concurrent Agent-enabled Feature Extraction concept. Each agent's belief tuple is quantified using a predefined set of information. The information and functions necessary to set each component in each agent's belief tuple is given along with an explanation of the methods for setting the components. This method is applied to the analyses of flow in a lid-driven cavity and flow around a cylinder, which highlight strengths and weaknesses of the chosen algorithms and the potential for subjective logic to aid in understanding the resulting features. Feature tracking is successfully applied and is observed to have a significant impact on the opinion of the vortex core lines. In the lid-driven cavity data set, unsteady feature extraction modifications are shown to impact feature extraction results with moving vortex core lines. The Sujudi-Haimes algorithm is shown to be more believable when extracting the main vortex core lines of the cavity simulation while the Roth-Peikert algorithm succeeding in extracting the weaker vortex cores in the same simulation. Mesh type and time step is shown to have a significant effect on the method. In the curved wake of the cylinder data set, the Roth-Peikert algorithm more reliably detects vortex core lines which exist for a significant amount of time. the method was finally applied to a massive wind turbine simulation, where the importance of performing feature extraction in parallel is shown. The use of multiple extraction algorithms with subjective logic and feature tracking helps determine the expected probability that an extracted vortex core is believable. This approach may be applied to massive data sets which will greatly reduce analysis time and data size and will aid in a greater understanding of complex fluid flows.

As objects move, their changing shape produces a signature that can be measured by a radar system. That signature is called the micro-Doppler signature. The micro-Doppler signature of an object is a distinguishing characteristic for certain classes of objects. In this thesis features are extracted from the micro-Doppler signature and are used to classify objects. The scope of the objects is limited to humans walking and traveling vehicles. The micro-Doppler features are able to distinguish the two classes of objects. With a sufficient amount of training data, the micro-Doppler features may be used with learning algorithms to predict unknown objects detected by the radar with high accuracy.

One of the most pressing global health concerns is the impact of cancer, which remains a leading cause of death worldwide. The timeliness of detection and diagnosis is critical to maximizing the chances of successful treatment. Radiomics is an emerging medical imaging analysis proposed, which refers to the high-throughput extraction of a large number of image features. Radiomics generally refers to the use of CT, PET, MRI or Ultrasound imaging as input data, extracting expressive features from massive image-based data, and then using machine learning or statistical models for quantitative analysis and prediction of disease. Feature reduction is very critical in Radiomics as a large number of quantitative features can have redundant characteristics not necessarily important in the analysis process. Due to the immense features obtained from radiological images, the main objective of our research is the application of machine learning techniques to reduce the number of dimensions, thereby rendering the data more manageable. Radiomics involves several steps including: Imaging, segmentation, feature extraction, and analysis. Extracted features can be categorized in the description of tumor gray histograms, shape, texture features, and the tumor location and surrounding tissue. For this research, a large-scale CT dataset for Lung cancer diagnosis (Lung- PET-CT-Dx) which was collected by scholars from Medical University in Harbin in China is used to illustrate the dimension reduction techniques, which is a main part of radiomics process, via R, SAS and Python. The proposed reduction and analysis techniques in our research will entail; Principal Component Analysis, Clustering analysis (Hierarchical Clustering and K-means), and Manifold-based algorithms (Isometric Feature Mapping (ISOMAP).

A large number of image registration techniques have been developed for various types of sensors and applications, with the aim to improve the accuracy, computational complexity, generality, and robustness. They can be broadly classified into two categories: intensity-based and feature-based methods. The primary drawback of the intensity-based approaches is that it may fail unless the two images are misaligned by a moderate difference in scale, rotation, and translation. In addition, intensity-based methods lack the robustness in the presence of non-spatial distortions due to different imaging conditions between images. In this dissertation, the image registration is formulated as a two-stage hybrid approach combining both an initial matching and a final matching in a coarse-to-fine manner. In the proposed hybrid framework, the initial matching algorithm is applied at the coarsest scale of images, where the approximate transformation parameters could be first estimated. Subsequently, the robust gradient-based estimation algorithm is incorporated into the proposed hybrid approach using a multi-resolution scheme. Several novel and effective initial matching algorithms have been proposed for the first stage. The variations of the intensity characteristics between images may be large and non-uniform because of non-spatial distortions. Therefore, in order to effectively incorporate the gradient-based robust estimation into our proposed framework, one of the fundamental questions should be addressed: what is a good image representation to work with using gradient-based robust estimation under non-spatial distortions. With the initial matching algorithms applied at the highest level of decomposition, the proposed hybrid approach exhibits superior range of convergence. The gradient-based algorithms in the second stage yield a robust solution that precisely registers images with sub-pixel accuracy. A hierarchical iterative searching further enhances the convergence range and rate. The simulation results demonstrated that the proposed techniques provide significant benefits to the performance of image registration.

No / At present, almost all digital images are stored and transferred in their compressed format in which discrete cosine transform (DCT)-based compression remains one of the most important data compression techniques due to the efforts from JPEG. In order to save the computation and memory cost, it is desirable to have image processing operations such as feature extraction, image indexing, and pattern classifications implemented directly in the DCT domain. To this end, we present in this paper a generalized analysis of spatial relationships between the DCTs of any block and its sub-blocks. The results reveal that DCT coefficients of any block can be directly obtained from the DCT coefficients of its sub-blocks and that the interblock relationship remains linear. It is useful in extracting global features in compressed domain for general image processing tasks such as those widely used in pyramid algorithms and image indexing. In addition, due to the fact that the corresponding coefficient matrix of the linear combination is sparse, the computational complexity of the proposed algorithms is significantly lower than that of the existing methods.

Yes / The significant role of plants can be observed through the dependency of animals and humans on them. Oxygen, materials, food and the beauty of the world are contributed by plants. Climate change, the decrease in pollinators, and plant diseases are causing a significant decline in both quality and coverage ratio of the plants and crops on a global scale. In developed countries, above 80 percent of rural production is produced by sharecropping. However, due to widespread diseases in plants, yields are reported to have declined by more than a half. These diseases are identified and diagnosed by the agricultural and forestry department. Manual inspection on a large area of fields requires a huge amount of time and effort, thereby reduces the effectiveness significantly. To counter this problem, we propose an automatic disease detection and classification method in radish fields by using a camera attached to an unmanned aerial vehicle (UAV) to capture high quality images from the fields and analyze them by extracting both color and texture features, then we used K-means clustering to filter radish regions and feeds them into a fine-tuned GoogleNet to detect Fusarium wilt of radish efficiently at early stage and allow the authorities to take timely action which ensures the food safety for current and future generations. / Supported by Korea Institute of Planning and Evaluation for Technology in Food, Agriculture, Forestry and Fisheries(IPET) through Agri-Bio Industry Technology Development Program, funded by Ministry of Agriculture, Food and Rural Affairs(MAFRA) (316033-04-2-338 SB030).