Generic Techniques in General Purpose GPU Programming with Applications to Ant Colony and Image Processing Algorithms

In 2006 NVIDIA introduced a new unified GPU architecture facilitating general-purpose computation on the GPU. The following year NVIDIA introduced CUDA, a parallel programming architecture for developing general purpose applications for direct execution on the new unified GPU. CUDA exposes the GPU's massively parallel architecture of the GPU so that parallel code can be written to execute much faster than its sequential counterpart. Although CUDA abstracts the underlying architecture, fully utilising and scheduling the GPU is non-trivial and has given rise to a new active area of research. Due to the inherent complexities pertaining to GPU development, in this thesis we explore and find efficient parallel mappings of existing and new parallel algorithms on the GPU using NVIDIA CUDA. We place particular emphasis on metaheuristics, image processing and designing reusable techniques and mappings that can be applied to other problems and domains. We begin by focusing on Ant Colony Optimisation (ACO), a nature inspired heuristic approach for solving optimisation problems. We present a versatile improved data-parallel approach for solving the Travelling Salesman Problem using ACO resulting in significant speedups. By extending our initial work, we show how existing mappings of ACO on the GPU are unable to compete against their sequential counterpart when common CPU optimisation strategies are employed and detail three distinct candidate set parallelisation strategies for execution on the GPU. By further extending our data-parallel approach we present the first implementation of an ACO-based edge detection algorithm on the GPU to reduce the execution time and improve the viability of ACO-based edge detection. We finish by presenting a new color edge detection technique using the volume of a pixel in the HSI color space along with a parallel GPU implementation that is able to withstand greater levels of noise than existing algorithms

An Efficient Technique for Color Image Classification Based On Lower Feature Content

Image classification is backbone for image data available   around us. It is necessary to use  a technique for classified the data in a particular class. In multiclass classification used different Classifier technique  for the classification of data, such as binary classifier and support vector machine .In this paper we used an efficient classification technique as radial basis function.  A Radial Basis Function (RBF) neural network has an input layer, a hidden layer and an output layer. The neurons in the hidden layer contain Gaussian transfer functions whose outputs are inversely proportional to the distance from the center of the neuron. For classification of data support vector machine (SVM) is used as binary classifier.  The some  approaches commonly used are the One-Against-One (1A1), One-Against-All (1AA),and SVM as Ant Colony Optimization(ACO). SVM-ACO decrease unclassified data and also decrease noise with outer line of data. Here SVM-RBF reduce noise with outer line data and complexity more than SVM-ACO. Keywords-- Image classification; feature sampling; support vector machine; ACO; RBF

Secure and Efficient Video Transmission in VANET

Currently, vehicular communications have become a reality used by various applications, especially applications that broadcast video in real time. However, the video quality received is penalized by the poor characteristics of the transmission channel (availability, non-stationarity, the ration of signal-to-noise, etc.). To improve and ensure minimum video quality at reception, we propose in this work a mechanism entitled “Secure and Efficient Transmission of Videos in VANET (SETV)”. It's based on the "Quality of Experience (QoE)" and using hierarchical packet management. This last is based on the importance of the images of the stream video. To this end, the use of transmission error correction with uneven error protection has proven to be effective in delivering high quality videos with low network overhead. This is done based on the specific details of video encoding and actual network conditions such as signal to noise ratio, network density, vehicle position and current packet loss rate (PLR) not to mention the prediction of the future DPP.Machine learning models were developed on our work to estimate perceived audio-visual quality. The protocol previously gathers information about its neighbouring vehicles to perform distributed jump reinforcement learning. The simulation results obtained for several types of realistic vehicular scenarios show that our proposed mechanism offers significant improvements in terms of video quality on reception and end-to-end delay compared to conventional schemes. The results prove that the proposed mechanism has showed 11% to 18% improvement in video quality and 9% load gain compared to ShieldHEVC

Computational Optimizations for Machine Learning

The present book contains the 10 articles finally accepted for publication in the Special Issue “Computational Optimizations for Machine Learning” of the MDPI journal Mathematics, which cover a wide range of topics connected to the theory and applications of machine learning, neural networks and artificial intelligence. These topics include, among others, various types of machine learning classes, such as supervised, unsupervised and reinforcement learning, deep neural networks, convolutional neural networks, GANs, decision trees, linear regression, SVM, K-means clustering, Q-learning, temporal difference, deep adversarial networks and more. It is hoped that the book will be interesting and useful to those developing mathematical algorithms and applications in the domain of artificial intelligence and machine learning as well as for those having the appropriate mathematical background and willing to become familiar with recent advances of machine learning computational optimization mathematics, which has nowadays permeated into almost all sectors of human life and activity