Vietnam Journal of Computer Science

Bangladesh, being a densely populated country, hinges on agriculture for the security of finance and food to a large extent. Hence, both the fruits’ quantity and quality turn out to be very important, which can be degraded due to the attacks of various diseases. Automated fruit disease recognition can help fruit farmers, especially remote farmers, for whom adequate cultivation support is required. Two daunting problems, namely disease detection, and disease classification are raised by automated fruit disease recognition. In this research, we conduct an intense investigation of the applicability of automated recognition of the diseases of three available Bangladeshi local fruits, viz. guava, jackfruit, and papaya. After exerting four notable segmentation algorithms, $K$-means clustering segmentation algorithm is selected to segregate the disease-contaminated parts from a fruit image. Then some discriminatory features are extracted from these disease-contaminated parts. Nine noteworthy classification algorithms are applied for disease classification to thoroughly get the measure of their merits. It is observed that random forest outperforms the eight other classifiers by disclosing an accuracy of 96.8% and 89.59% for guava and jackfruit, respectively, whereas support vector machine attains an accuracy of 94.9% for papaya, which can be claimed good as well as attractive for forthcoming research.

Hindi is the national language of India. However, most of the Government records, resolutions, news, etc. are documented in English which remote villagers may not understand. This fact motivates to develop an automatic language translation system from English to Hindi. Machine translation is the process of translating a text in one natural language into another natural language using computer system. Grammatical structure of Hindi language is very much complex than English language. The structural difference between English and Hindi language makes it difficult to achieve good quality translation results. In this paper, phrase-based statistical machine translation approach (PBSMT) is used for translation. Translation, reordering and language model are main working components of a PBSMT system. This paper evaluates the impact of various combinations of these PBSMT system parameters on automated English to Hindi language translation quality. Freely available n-gram-based BLEU metric and TER metric are used for evaluating the results.

Fully automatic brain image classification of MR brain images is of great importance for research and clinical studies, since the precise detection may lead to a better treatment. In this work, an efficient method based on Multiple-Instance Learning (MIL) is proposed for the automatic classification of low-grade and high-grade MR brain tumor images. The main advantage of MIL-based approach over other classification methods is that MIL considers an image as a group of instances rather than a single instance, thus facilitating an effective learning process. The mi-Graph-based MIL approach is proposed for this classification. Two different implementations of MIL-based classification, viz. Patch-based MIL (PBMIL) and Superpixel-based MIL (SPBMIL), are made in this study. The combined feature set of LBP, SIFT and FD is used for the classification. The accuracies of low-grade–high-grade tumor image classification algorithm using SPBMIL method performed on $T_1$, $T_2$ and FLAIR images read 99.2765%, 99.4195% and 99.2265%, respectively. The error rate of the proposed classification system was noted to be insignificant and hence this automated classification system could be used for the classification of images with different pathological conditions, types and disease statuses.

These days identification of a person is an integral part of many computer-based solutions. It is a key characteristic for access control, customized services, and a proof of identity. Over the last couple of decades, many new techniques were introduced for how to identify human faces. This approach investigates the human face identification based on frontal images by producing ratios from distances between the different features and their locations. Moreover, this extended version includes an investigation of identification based on side profile by extracting and diagnosing the feature sets with geometric ratio expressions which are calculated into feature vectors. The last stage involves using weighted means to calculate the resemblance. The approach considers an explainable Artificial Intelligence (XAI) approach. Findings, based on a small dataset, achieve that the used approach offers promising results. Further research could have a great influence on how faces and face-profiles can be identified. Performance of the proposed system is validated using metrics such as Precision, False Acceptance Rate, False Rejection Rate, and True Positive Rate. Multiple simulations indicate an Equal Error Rate of 0.89. This work is an extended version of the paper submitted in ACIIDS 2020.

Whether for optimizing the speed of microprocessors or for sequence analysis in molecular biology — evolutionary algorithms are used in astoundingly many fields. Also, the art was influenced by evolutionary algorithms — with principles of natural evolution works of art that can be created or imitated, whereby initially generated art is put through an iterated process of selection and modification. This paper covers an application in which given images are emulated evolutionary using a finite number of semi-transparent overlapping polygons, which also became known under the name “Evolution of Mona Lisa”. In this context, different approaches to solve the problem are tested and presented here. In particular, we want to investigate whether Hill Climbing Algorithm in combination with Delaunay Triangulation and Canny Edge Detector that extracts the initial population directly from the original image performs better than the conventional Hill Climbing and Genetic Algorithm, where the initial population is generated randomly.

Due to the increasing number of Web Services with the same functionality, selecting a Web Service that best serves the needs of the Web Client has become a tremendously challenging task. Present approaches use non-functional parameters of the Web Services but they do not consider any preprocessing of the set of functionally Similar Web Services. The lack of preprocessing results in increased use of computational resources due to unnecessary processing of Web Services that have a very low to no chance of satisfying the consumer’s requirements. In this paper, we propose an Ensemble classification method for preprocessing and a Web Service Selection method based on the Quality of Service (QoS) parameters. Once the most eligible Web Services are enumerated through classification, they are ranked using the Technique of Order Preference by Similarity to Ideal Solution (TOPSIS) method with Analytic Hierarchy Process (AHP) used for weight calculation. A prototype of the method is developed, and experiments are conducted on a real-world Web Services dataset. Results demonstrate the feasibility of the proposed method.