Semantic segmentation of landcover for cropland mapping and area estimation using Machine Learning techniques

ABSTRACTThe paper has focussed on the global landcover for the identification of cropland areas. Population growth and rapid industrialization are somehow disturbing the agricultural lands and eventually the food production needed for human survival. Appropriate agricultural land monitoring requires proper management of land resources. The paper has proposed a method for cropland mapping by semantic segmentation of landcover to identify the cropland boundaries and estimate the cropland areas using machine learning techniques. The process has initially applied various filters to identify the features responsible for detecting the land boundaries through the edge detection process. The images are masked or annotated to produce the ground truth for the label identification of croplands, rivers, buildings, and backgrounds. The selected features are transferred to a machine learning model for the semantic segmentation process. The methodology has applied Random Forest, which has compared to two other techniques, Support Vector Machine and Multilayer perceptron, for the semantic segmentation process. Our dataset is composed of satellite images collected from the QGIS application. The paper has derived the conclusion that Random forest has given the best result for segmenting the image into different regions with 99% training accuracy and 90% test accuracy. The results are cross-validated by computing the Mean IoU and kappa coefficient that shows 93% and 69% score value respectively for Random Forest, found maximum among all. The paper has also calculated the area covered under the different segmented regions. Overall, Random Forest has produced promising results for semantic segmentation of landcover for cropland mapping

Estimation de paramètres de champs markoviens cachés avec applications à la segmentation d'images et la localisation de formes

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal

Shortest Route at Dynamic Location with Node Combination-Dijkstra Algorithm

Abstract— Online transportation has become a basic requirement of the general public in support of all activities to go to work, school or vacation to the sights. Public transportation services compete to provide the best service so that consumers feel comfortable using the services offered, so that all activities are noticed, one of them is the search for the shortest route in picking the buyer or delivering to the destination. Node Combination method can minimize memory usage and this methode is more optimal when compared to A* and Ant Colony in the shortest route search like Dijkstra algorithm, but can’t store the history node that has been passed. Therefore, using node combination algorithm is very good in searching the shortest distance is not the shortest route. This paper is structured to modify the node combination algorithm to solve the problem of finding the shortest route at the dynamic location obtained from the transport fleet by displaying the nodes that have the shortest distance and will be implemented in the geographic information system in the form of map to facilitate the use of the system. Keywords— Shortest Path, Algorithm Dijkstra, Node Combination, Dynamic Location (key words

Robust density modelling using the student's t-distribution for human action recognition

The extraction of human features from videos is often inaccurate and prone to outliers. Such outliers can severely affect density modelling when the Gaussian distribution is used as the model since it is highly sensitive to outliers. The Gaussian distribution is also often used as base component of graphical models for recognising human actions in the videos (hidden Markov model and others) and the presence of outliers can significantly affect the recognition accuracy. In contrast, the Student's t-distribution is more robust to outliers and can be exploited to improve the recognition rate in the presence of abnormal data. In this paper, we present an HMM which uses mixtures of t-distributions as observation probabilities and show how experiments over two well-known datasets (Weizmann, MuHAVi) reported a remarkable improvement in classification accuracy. © 2011 IEEE

Deep Learning Detected Nutrient Deficiency in Chili Plant

Chili is a staple commodity that also affects the Indonesian economy due to high market demand. Proven in June 2019, chili is a contributor to Indonesia's inflation of 0.20% from 0.55%. One factor is crop failure due to malnutrition. In this study, the aim is to explore Deep Learning Technology in agriculture to help farmers be able to diagnose their plants, so that their plants are not malnourished. Using the RCNN algorithm as the architecture of this system. Use 270 datasets in 4 categories. The dataset used is primary data with chili samples in Boyolali Regency, Indonesia. The chili we use are curly chili. The results of this study are computers that can recognize nutrient deficiencies in chili plants based on image input received with the greatest testing accuracy of 82.61% and has the best mAP value of 15.57%