scispace - formally typeset
Search or ask a question
Author

Mohamed Hisham Jaward

Bio: Mohamed Hisham Jaward is an academic researcher from Monash University Malaysia Campus. The author has contributed to research in topics: Particle filter & Monte Carlo method. The author has an hindex of 11, co-authored 29 publications receiving 601 citations. Previous affiliations of Mohamed Hisham Jaward include University of Bristol & Monash University.

Papers
More filters
Journal ArticleDOI
TL;DR: A thorough review of state-of-the-art techniques used in recent hand gesture and sign language recognition research, suitably categorized into different stages: data acquisition, pre-processing, segmentation, feature extraction and classification.
Abstract: Hand gesture recognition serves as a key for overcoming many difficulties and providing convenience for human life. The ability of machines to understand human activities and their meaning can be utilized in a vast array of applications. One specific field of interest is sign language recognition. This paper provides a thorough review of state-of-the-art techniques used in recent hand gesture and sign language recognition research. The techniques reviewed are suitably categorized into different stages: data acquisition, pre-processing, segmentation, feature extraction and classification, where the various algorithms at each stage are elaborated and their merits compared. Further, we also discuss the challenges and limitations faced by gesture recognition research in general, as well as those exclusive to sign language recognition. Overall, it is hoped that the study may provide readers with a comprehensive introduction into the field of automated gesture and sign language recognition, and further facilitate future research efforts in this area.

344 citations

Journal ArticleDOI
TL;DR: A novel particle filtering based approach to fault detection in non- linear stochastic systems is developed here and the effectiveness of this new method is demonstrated through Monte Carlo simulations and the detection performance is compared with that using the extended Kalman filter on a non-linear system.
Abstract: Much of the development in model-based fault detection techniques for dynamic stochastic systems has relied on the system model being linear and the noise and disturbances being Gaussian. Linearized approximations have been used in the non-linear systems case. However, linearization techniques, being approximate, tend to suffer from poor detection or high false alarm rates. A novel particle filtering based approach to fault detection in non-linear stochastic systems is developed here. One of the appealing advantages of the new approach is that the complete probability distribution information of the state estimates from particle filter is utilized for fault detection, whereas, only the mean and covariance of an approximate Gaussian distribution are used in a coventional extended Kalman filter-based approach. Another advantage of the new approach is its applicability to general non-linear system with non-Gaussian noise and disturbances. The effectiveness of this new method is demonstrated through Monte Car...

83 citations

Proceedings ArticleDOI
24 Jul 2006
TL;DR: The proposed particle filter (PF) embeds a data association technique based on the joint probabilistic data association (JPDA) which handles the uncertainty of the measurement origin and is able to cope with partial occlusions and to recover the tracks after temporary loss.
Abstract: The particle filtering technique with multiple cues such as colour, texture and edges as observation features is a powerful technique for tracking deformable objects in image sequences with complex backgrounds. In this paper, our recent work (Brasnett et al., 2005) on single object tracking using particle filters is extended to multiple objects. In the proposed scheme, track initialisation is embedded in the particle filter without relying on an external object detection scheme. The proposed scheme avoids the use of hybrid state estimation for the estimation of number of active objects and its associated state vectors as proposed in (Czyz et al., 2005). The number of active objects and track management are handled by means of probabilities of the number of active objects in a given frame. These probabilities are shown to be easily estimated by the Monte Carlo data association algorithm used in our algorithm. The proposed particle filter (PF) embeds a data association technique based on the joint probabilistic data association (JPDA) which handles the uncertainty of the measurement origin. The algorithm is able to cope with partial occlusions and to recover the tracks after temporary loss. The probabilities calculated for data associations take part in the calculation of probabilities of the number of objects. We evaluate the performance of the proposed filter on various real-world video sequences with appearing and disappearing targets.

58 citations

Journal ArticleDOI
TL;DR: This study considers and reports on the most advanced security countermeasures within the areas of autonomic, encryption, and learning-based approaches, and uncover security challenges that may be met by the research community regarding security implementation in heterogeneous IoT environment.
Abstract: Internet of Things (IoT) facilitates the integration between objects and different sensors to provide communication among them without human intervention. However, the extensive demand for IoT and its various applications has continued to grow, coupled with the need to achieve foolproof security requirements. IoT produces a vast amount of data under several constraints such as low processor, power, and memory. These constraints, along with the invaluable data produced by IoT devices, make IoT vulnerable to various security attacks. This paper presents an overview of IoT, its well-known system architecture, enabling technologies, and discusses security challenges and goals. Furthermore, we analyze security vulnerabilities and provide state-of-the-art security taxonomy. The taxonomy of the most relevant and current IoT security attacks is presented for application, network, and physical layers. While most other surveys studied one of the areas of security measures, this study considers and reports on the most advanced security countermeasures within the areas of autonomic, encryption, and learning-based approaches. Additionally, we uncover security challenges that may be met by the research community regarding security implementation in heterogeneous IoT environment. Finally, we provide different visions about possible security solutions and future research directions.

58 citations

Proceedings ArticleDOI
09 May 2016
TL;DR: A novel framework comprising established image processing techniques is proposed to recognise images of several sign language gestures and is able to recognize and translate 16 different American Sign Language gestures with an overall accuracy of 97.13%.
Abstract: Due to the relative lack of pervasive sign language usage within our society, deaf and other verbally-challenged people tend to face difficulty in communicating on a daily basis. Our study thus aims to provide research into a sign language translator applied on the smartphone platform, due to its portability and ease of use. In this paper, a novel framework comprising established image processing techniques is proposed to recognise images of several sign language gestures. More specifically, we initially implement Canny edge detection and seeded region growing to segment the hand gesture from its background. Feature points are then extracted with Speeded Up Robust Features (SURF) algorithm, whose features are derived through Bag of Features (BoF). Support Vector Machine (SVM) is subsequently applied to classify our gesture image dataset; where the trained dataset is used to recognize future sign language gesture inputs. The proposed framework has been successfully implemented on smartphone platforms, and experimental results show that it is able to recognize and translate 16 different American Sign Language gestures with an overall accuracy of 97.13%.

53 citations


Cited by
More filters
Journal ArticleDOI
01 Aug 2014
TL;DR: The current comprehensive survey provides an overview of most of these published works by grouping them in a broad taxonomy, and common issues in super-resolution algorithms, such as imaging models and registration algorithms, optimization of the cost functions employed, dealing with color information, improvement factors, assessment of super- resolution algorithms, and the most commonly employed databases are discussed.
Abstract: Super-resolution, the process of obtaining one or more high-resolution images from one or more low-resolution observations, has been a very attractive research topic over the last two decades. It has found practical applications in many real-world problems in different fields, from satellite and aerial imaging to medical image processing, to facial image analysis, text image analysis, sign and number plates reading, and biometrics recognition, to name a few. This has resulted in many research papers, each developing a new super-resolution algorithm for a specific purpose. The current comprehensive survey provides an overview of most of these published works by grouping them in a broad taxonomy. For each of the groups in the taxonomy, the basic concepts of the algorithms are first explained and then the paths through which each of these groups have evolved are given in detail, by mentioning the contributions of different authors to the basic concepts of each group. Furthermore, common issues in super-resolution algorithms, such as imaging models and registration algorithms, optimization of the cost functions employed, dealing with color information, improvement factors, assessment of super-resolution algorithms, and the most commonly employed databases are discussed.

602 citations

Journal ArticleDOI
TL;DR: In this paper, an online particle-filtering-based framework for fault diagnosis and failure prognosis in non-linear, non-Gaussian systems is proposed, which considers the implementation of two autonomous modules: a fault detection and identification (FDI) module uses a hybrid state-space model of the plant and a PF algorithm to estimate the state probability density function (pdf) of the system and calculates the probability of a fault condition in realtime.
Abstract: This paper introduces an on-line particle-filtering (PF)-based framework for fault diagnosis and failure prognosis in non-linear, non-Gaussian systems. This framework considers the implementation of two autonomous modules. A fault detection and identification (FDI) module uses a hybrid state-space model of the plant and a PF algorithm to estimate the state probability density function (pdf) of the system and calculates the probability of a fault condition in realtime. Once the anomalous condition is detected, the available state pdf estimates are used as initial conditions in prognostic routines. The failure prognostic module, on the other hand, predicts the evolution in time of the fault indicator and computes the pdf of the remaining useful life (RUL) of the faulty subsystem, using a non-linear state-space model (with unknown time-varying parameters) and a PF algorithm that updates the current state estimate. The outcome of the prognosis module provides information about the precision and accuracy of long-term predictions, RUL expectations and 95% confidence intervals for the condition under study. Data from a seeded fault test for a UH-60 planetary gear plate are used to validate the proposed approach.

428 citations

Journal ArticleDOI
08 Nov 2004
TL;DR: A detailed overview of particle methods, a set of powerful and versatile simulation-based methods to perform optimal state estimation in nonlinear non-Gaussian state-space models, is provided.
Abstract: Particle methods are a set of powerful and versatile simulation-based methods to perform optimal state estimation in nonlinear non-Gaussian state-space models. The ability to compute the optimal filter is central to solving important problems in areas such as change detection, parameter estimation, and control. Much recent work has been done in these areas. The objective of this paper is to provide a detailed overview of them.

352 citations

Journal ArticleDOI
TL;DR: In this paper, a modified particle filter, i.e., intelligent particle filter (IPF), is proposed, inspired from the genetic algorithm, which mitigates particle impoverishment and provides more accurate state estimation results compared with the general PF.
Abstract: The particle filter (PF) provides a kind of novel technique for estimating the hidden states of the nonlinear and/or non-Gaussian systems. However, the general PF always suffers from the particle impoverishment problem, which can lead to the misleading state estimation results. To cope with this problem, a modified particle filter, i.e., intelligent particle filter (IPF), is proposed in this paper. It is inspired from the genetic algorithm. The particle impoverishment in general PF mainly results from the poverty of particle diversity. In IPF, the genetic-operators-based strategy is designed to further improve the particle diversity. It should be pointed out that the general PF is a special case of the proposed IPF with the specified parameters. Two experiment examples show that IPF mitigates particle impoverishment and provides more accurate state estimation results compared with the general PF. Finally, the proposed IPF is implemented for real-time fault detection on a three-tank system, and the results are satisfactory.

304 citations

Journal ArticleDOI
TL;DR: This work considers the case where no accurate nor tractable model can be found, using a model-free approach, called Kernel change detection (KCD), and builds a dissimilarity measure in feature space between two sets of descriptors, shown to be asymptotically equivalent to the Fisher ratio in the Gaussian case.
Abstract: A number of abrupt change detection methods have been proposed in the past, among which are efficient model-based techniques such as the Generalized Likelihood Ratio (GLR) test. We consider the case where no accurate nor tractable model can be found, using a model-free approach, called Kernel change detection (KCD). KCD compares two sets of descriptors extracted online from the signal at each time instant: The immediate past set and the immediate future set. Based on the soft margin single-class Support Vector Machine (SVM), we build a dissimilarity measure in feature space between those sets, without estimating densities as an intermediary step. This dissimilarity measure is shown to be asymptotically equivalent to the Fisher ratio in the Gaussian case. Implementation issues are addressed; in particular, the dissimilarity measure can be computed online in input space. Simulation results on both synthetic signals and real music signals show the efficiency of KCD.

303 citations