Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Gareth Howells is active.

Publication


Featured researches published by Gareth Howells.


Journal of Navigation | 2008

Autonomous Ship Collision Avoidance Navigation Concepts, Technologies and Techniques

Thomas Statheros; Gareth Howells; Klaus D. McDonald-Maier

This study provides both a spherical understanding about autonomous ship navigation for collision avoidance (CA) and a theoretical background of the reviewed work. Additionally, the human cognitive abilities and the collision avoidance regulations (COLREGs) for ship navigation are examined together with water based collision avoidance algorithms. The requirements for autonomous ship navigation are addressed in conjunction with the factors influencing ship collision avoidance. Humans are able to appreciate these factors and also perform ship navigation at a satisfactory level, but their critical decisions are highly subjective and can lead to error and potentially, to ship collision. The research for autonomous ship navigation may be grouped into the classical and soft computing based categories. Classical techniques are based on mathematical models and algorithms while soft-computing techniques are based on Artificial Intelligence (AI). The areas of AI for autonomous ship collision avoidance are examined in this paper are evolutionary algorithms, fuzzy logic, expert systems, and neural networks (NN), as well as a combination of them (hybrid system).


IEEE Transactions on Information Forensics and Security | 2008

Template-Free Biometric-Key Generation by Means of Fuzzy Genetic Clustering

Weiguo Sheng; Gareth Howells; Michael C. Fairhurst; Farzin Deravi

Biometric authentication is increasingly gaining popularity in a wide range of applications. However, the storage of the biometric templates and/or encryption keys that are necessary for such applications is a matter of serious concern, as the compromise of templates or keys necessarily compromises the information secured by those keys. In this paper, we propose a novel method, which requires storage of neither biometric templates nor encryption keys, by directly generating the keys from statistical features of biometric data. An outline of the process is as follows: given biometric samples, a set of statistical features is first extracted from each sample. On each feature subset or single feature, we model the intra and interuser variation by clustering the data into natural clusters using a fuzzy genetic clustering algorithm. Based on the modelling results, we subsequently quantify the consistency of each feature subset or single feature for each user. By selecting the most consistent feature subsets and/or single features for each user individually, we generate the key reliably without compromising its relative security. The proposed method is evaluated on handwritten signature data and compared with related methods, and the results are very promising.


IEEE Transactions on Information Forensics and Security | 2007

A Memetic Fingerprint Matching Algorithm

Weiguo Sheng; Gareth Howells; Michael C. Fairhurst; Farzin Deravi

Minutiae point pattern matching is the most common approach for fingerprint verification. Although many minutiae point pattern matching algorithms have been proposed, reliable automatic fingerprint verification remains as a challenging problem, both with respect to recovering the optimal alignment and the construction of an adequate matching function. In this paper, we develop a memetic fingerprint matching algorithm (MFMA) which aims to identify the optimal or near optimal global matching between two minutiae sets. Within the MFMA, we first introduce an efficient matching operation to produce an initial population of local alignment configurations by examining local features of minutiae. Then, we devise a hybrid evolutionary procedure by combining the use of the global search functionality of a genetic algorithm with a local improvement operator to search for the optimal or near optimal global alignment. Finally, we define a reliable matching function for fitness computation. The proposed algorithm was evaluated by means of a series of experiments conducted on the FVC2002 database and compared with previous work. Experimental results confirm that the MFMA is an effective and practical matching algorithm for fingerprint verification. The algorithm is faster and more accurate than a traditional genetic-algorithm-based method. It is also more accurate than a number of other methods implemented for comparison, though our method generally requires more computational time in performing fingerprint matching.


information assurance and security | 2007

Integrating Multi-Modal Circuit Features within an Efficient Encryption System

Evangelos Papoutsis; Gareth Howells; Andrew B. T. Hopkins; K. McDonald Maier

The problem of the incorporation of pattern features with unusual distributions is well known within pattern recognition systems even if not easily addressed. The problem is more acute when features are derived from characteristics of given integrated electronic circuits. The current paper introduces novel efficient techniques for normalising sets of features which are highly multi-modal in nature, so as to allow them to be incorporated within a single encryption key generation system based primarily on measured hardware characteristics. The utility of the proposed system lies in the observation that the need for data sent to and from remote network nodes to be secure and verified is substantial. Security can be improved by using encryption techniques based on keys, which are based on unique properties of the individual nodes within the network. This will serve both to minimize the need for key storage and sharing as well as to validate the initiator node of a message.


Pattern Recognition | 2009

Consensus fingerprint matching with genetically optimised approach

Weiguo Sheng; Gareth Howells; Michael C. Fairhurst; Farzin Deravi; Karl Harmer

Fingerprint matching has been approached using various criteria based on different extracted features. However, robust and accurate fingerprint matching is still a challenging problem. In this paper, we propose an improved integrated method which operates by first suggesting a consensus matching function, which combines different matching criteria based on heterogeneous features. We then devise a genetically guided approach to optimise the consensus matching function for simultaneous fingerprint alignment and verification. Since different features usually offer complementary information about the matching task, the consensus function is expected to improve the reliability of fingerprint matching. A related motivation for proposing such a function is to build a robust criterion that can perform well over a variety of different fingerprint matching instances. Additionally, by employing the global search functionality of a genetic algorithm along with a local matching operation for population initialisation, we aim to identify the optimal or near optimal global alignment between two fingerprints. The proposed algorithm is evaluated by means of a series of experiments conducted on public domain collections of fingerprint images and compared with previous work. Experimental results show that the consensus function can lead to a substantial improvement in performance while the local matching operation helps to identify promising initial alignment configurations, thereby speeding up the verification process. The resulting algorithm is more accurate than several other proposed methods which have been implemented for comparison.


adaptive hardware and systems | 2007

Key Generation for Secure Inter-satellite Communication

Evangelos Papoutsis; Gareth Howells; Andrew B. T. Hopkins; Klaus D. McDonald-Maier

This paper addresses issues relating to the generation of secure encryption keys for use in inter-satellite communications operating in a low power environment. It introduces techniques which possess the potential to generate encryption keys based on properties or features directly associated with the actual satellites and thus removing the necessity for key storage. This research investigates constraints associated with ensuring secure inter-satellite communications for satellite constellations. The need for data sent to and from satellites to be secure and verified is substantial. Security can be improved by using encryption techniques based on keys, which are based on unique properties of the individual nodes within the satellite network. This will serve both to minimize the need for key sharing as well as to validate the initiator node of a message.


Pattern Recognition Letters | 2015

Improving colour iris segmentation using a model selection technique

Yang Hu; Konstantinos Sirlantzis; Gareth Howells

Analysis of circle and ellipse based iris segmentation models.A novel model selection method to improve colour iris segmentation.Showing the effectiveness of HOG feature for model selection.Analysis of the experimental results on both mobile and static camera data. In this paper, we propose a novel method to improve the reliability and accuracy of colour iris segmentation for captures both from static and mobile devices. Our method is a fusion strategy based on selection among the segmentation outcomes of different segmentation methods or models. First, we present and analyse an iris segmentation framework which uses three different models to show that improvements can be obtained by selection among the outcomes generated by the three models. Then, we introduce a model selection method which defines the optimal segmentation based on a ring-shaped region around the outer segmentation boundary identified by each model. We use the histogram of oriented gradients (HOG) as features extracted from the ring-shaped region, and train a SVM-based classifier which provides the selection decision. Experiments on colour iris datasets, captured by mobile devices and static camera, show that the proposed method achieves an improved performance compared to the individual iris segmentation models and existing algorithms.


Journal of Intelligent and Robotic Systems | 2000

An Investigation of the Effects of Variable Vigilance within the RePART Neuro-Fuzzy Network

Anne M. P. Canuto; Gareth Howells; Michael C. Fairhurst

RePART is a variation of fuzzy ARTMAP to which a reward/punishment concept has been added. Previously, an improvement in performance of RePART had been noted compared with other ARTMAP-based models, such as fuzzy ARTMAP and ARTMAP-IC. In this paper, a wider investigation of RePART performance is described, in which RePART is analysed in relation to a multi-layer perceptron and a RAM-based network in a handwritten numeral recognition task. In the RePART network, a variable vigilance parameter is proposed in order to smooth the poor-generalisation problem of RePART. Firstly, the same vigilance is associated within every neuron – general variable vigilance. Secondly, an individual variable vigilance for each neuron – which takes into account its average and frequency of activation – is used. In a handwritten numeral recognition task using individual variable vigilance, RePART performance improved and demonstrated a performance comparable with alternative architectures such as fuzzy multi-layer perceptron and Radial RAM.


adaptive hardware and systems | 2007

Normalizing Discrete Circuit Features with Statistically Independent values for incorporation within a highly Secure Encryption System

Gareth Howells; Evangelos Papoutsis; Andrew B. T. Hopkins; Klaus D. McDonald-Maier

Protecting hardware devices from unwanted software attacks is a current area of major security concern. Coupled with the need to secure and verify data sent to and from such devices, the need to supply systems capable of uniquely identifying and securing hardware devices is considerable and imminent. This paper introduces techniques which possess the potential to generate unique identifying codes for given hardware devices based on measurable quantities or features associated with the given hardware and software configurations executing upon it. The techniques are investigated by considering abstract properties in order to validate primarily the feature normalization techniques employed prior to the code generation phase which allows features with highly variable distributions, and whose component values are independent of each other, to be employed within the code generation system.


Connection Science | 2000

An exploration of a new paradigm for weightless RAM-based neural networks

Gareth Howells; Michael C. Fairhurst; Fuad Rahman

This paper introduces a novel networking strategy for RAM-based neurons which significantly improves the training and recognition performance of such networks whilst maintaining the generalization capabilities achieved in previous network configurations. A number of different architectures are introduced, each using the same underlying principles. Initially, features which are common to all architectures are described, illustrating the basis of the underlying paradigm. Three architectures are then introduced illustrating different techniques of employing the paradigm to meet differing performance specifications. The architectures are described in terms of the structure of the neurons they employ. Details of the various training and recognition algorithms employed by the architectures are supplied in order to present a complete description of the operation of this class of artificial neural network.

Collaboration


Dive into the Gareth Howells's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge