Extended Distributed Framework for Feature Extraction in Remote Sensing Imagery with High Resolution

Remote Sensing imagery is used vastly in the areas of human activities investigation, environmental changes monitoring and geo-spatial data updation in a rapidly increasing way. Humans can easily and appropriately interpret the normally shot pictures but this is a difficult task for the computer to automatically interpret information from the given images. One of the prominent phases is in finding the way to extract the projected information from the given imagery and its conversion to wrath-ful data which can be used for further research. The motto is the generation of an algorithm which aims to be very efficient during of processing of huge images that include enhancement of efficiency in processing, correlation finding amongst given data and extraction of continuous features. In order to accomplish all these purposes as stated above, we hereby put forward an algorithm Extended Feature Extraction and Detection in High Resolution Remote Sensing (HRRS) Imagery to detect rivers. The proposed system is established with Hadoop Distributed Framework in order to enhance the efficiency of total system.

A Distributed Ant Colony Optimization in Edge Detection

With the rise of image data and increased complexity of tasks in edge detection, conventional artificial intelligence techniques have been severely impacted. To be able to solve even greaterproblems of the future, learning algorithms must maintain high speed and accuracy through economical means. Traditional edge detection approaches cannot detect edges in images in a timely manner due to memory and computational time constraints. In this work, a novel parallelized ant colony optimization technique in a distributed framework provided by the Hadoop/Map-Reduce infrastructure is proposed to improve the edge detection capabilities. Moreover, a filtering technique is applied to reduce the noisy background of images to achieve significant improvement in the accuracy of edge detection. Close examinations of the implementation of the proposed algorithm are discussed and demonstrated through experiments. Results reveal high classification accuracy and significant improvementsin speedup, scaleup and sizeup compared to the standard algorithms.

Efficient Distributed Matrix Factorization Alternating Least Squares (EDMFALS) for Recommendation Systems Using Spark

With the emergence of e-commerce and social networking systems, the use of recommendation systems gained popularity to predict the user ratings of an item. Since the large volume of data is generated from various sources at high speed, predicting the ratings accurately in real-time adds enormous benefit to the users while choosing the correct item. So a recommendation system must be capable enough to predict the rating accurately when the data are large. Apache Spark is a distributed framework well suited for processing large datasets and real-time data streams. In this paper, we propose an efficient matrix factorisation algorithm based on Spark MLlib alternating least squares (ALS) for collaborative filtering. The optimisations used for the proposed algorithm using Tungsten improved the performance of the algorithm significantly while doing the predictions. The experimental results prove that the proposed work is significantly faster for top-N recommendations and rating predictions compared with the existing works.

A distributed framework to investigate the entity relatedness problem in large RDF knowledge bases

The entity relatedness problem refers to the question of exploring a knowledge base, represented as an RDF graph, to discover and understand how two entities are connected. This question can be addressed by implementing a path search strategy, which combines an entity similarity measure, with an expansion limit, to reduce the path search space and a path ranking measure to order the relevant paths between a given pair of entities in the RDF graph. This paper first introduces DCoEPinKB, an in-memory distributed framework that addresses the entity relatedness problem. Then, it presents an evaluation of path search strategies using DCoEPinKB over real data collected from DBpedia. The results provide insights about the performance of the path search strategies.

Enhancing learning capabilities of movement primitives under distributed probabilistic framework for flexible assembly tasks

This paper presents a novel probabilistic distributed framework based on movement primitives for flexible robot assembly. Since the modern advanced industrial cell usually deals with various scenarios that are not fixed via-point trajectories but highly reconfigurable tasks, the industrial robots used in these applications must be capable of adapting and learning new in-demand skills without programming experts. Therefore, we propose a probabilistic framework that could accommodate various learning abilities trained with different movement-primitive datasets, separately. Derived from the Bayesian Committee Machine, this framework could infer new adapting trajectories with weighted contributions of each training dataset. To verify the feasibility of our proposed imitation learning framework, the simulation comparison with the state-of-the-art movement learning framework task-parametrised GMM is conducted. Several key aspects, such as generalisation capability, learning accuracy and computation expense, are discussed and compared. Moreover, two real-world experiments, i.e. riveting picking and nutplate picking, are further tested with the YuMi collaborative robot to verify the application feasibility in industrial assembly manufacturing.

A Regularization-Based Big Data Framework for Winter Precipitation Forecasting on Streaming Data

In the current paper, we propose a machine learning forecasting model for the accurate prediction of qualitative weather information on winter precipitation types, utilized in Apache Spark Streaming distributed framework. The proposed model receives storage and processes data in real-time, in order to extract useful knowledge from different sensors related to weather data. In following, the numerical weather prediction model aims at forecasting the weather type given three precipitation classes namely rain, freezing rain, and snow as recorded in the Automated Surface Observing System (ASOS) network. For depicting the effectiveness of our proposed schema, a regularization technique for feature selection so as to avoid overfitting is implemented. Several classification models covering three different categorization methods namely the Bayesian, decision trees, and meta/ensemble methods, have been investigated in a real dataset. The experimental analysis illustrates that the utilization of the regularization technique could offer a significant boost in forecasting performance.