Abstract: The inherent skin patterns created at the joints in the
finger exterior are referred as finger knuckle-print. It is exploited to
identify a person in a unique manner because the finger knuckle print
is greatly affluent in textures. In biometric system, the region of
interest is utilized for the feature extraction algorithm. In this paper,
local and global features are extracted separately. Fast Discrete
Orthonormal Stockwell Transform is exploited to extract the local
features. Global feature is attained by escalating the size of Fast
Discrete Orthonormal Stockwell Transform to infinity. Two features
are fused to increase the recognition accuracy. A matching distance is
calculated for both the features individually. Then two distances are
merged mutually to acquire the final matching distance. The
proposed scheme gives the better performance in terms of equal error
rate and correct recognition rate.
Abstract: Neurons in the nervous system communicate with
each other by producing electrical signals called spikes. To
investigate the physiological function of nervous system it is essential
to study the activity of neurons by detecting and sorting spikes in the
recorded signal. In this paper a method is proposed for considering
the spike sorting problem which is based on the nonlinear modeling
of spikes using exponential autoregressive model. The genetic
algorithm is utilized for model parameter estimation. In this regard
some selected model coefficients are used as features for sorting
purposes. For optimal selection of model coefficients, self-organizing
feature map is used. The results show that modeling of spikes with
nonlinear autoregressive model outperforms its linear counterpart.
Also the extracted features based on the coefficients of exponential
autoregressive model are better than wavelet based extracted features
and get more compact and well-separated clusters. In the case of
spikes different in small-scale structures where principal component
analysis fails to get separated clouds in the feature space, the
proposed method can obtain well-separated cluster which removes
the necessity of applying complex classifiers.
Abstract: Modelling of the earth's surface and evaluation of
urban environment, with 3D models, is an important research topic.
New stereo capabilities of high resolution optical satellites images,
such as the tri-stereo mode of Pleiades, combined with new image
matching algorithms, are now available and can be applied in urban
area analysis. In addition, photogrammetry software packages gained
new, more efficient matching algorithms, such as SGM, as well as
improved filters to deal with shadow areas, can achieve more dense
and more precise results.
This paper describes a comparison between 3D data extracted
from tri-stereo and dual stereo satellite images, combined with pixel
based matching and Wallis filter. The aim was to improve the
accuracy of 3D models especially in urban areas, in order to assess if
satellite images are appropriate for a rapid evaluation of urban
environments.
The results showed that 3D models achieved by Pleiades tri-stereo
outperformed, both in terms of accuracy and detail, the result
obtained from a Geo-eye pair. The assessment was made with
reference digital surface models derived from high resolution aerial
photography. This could mean that tri-stereo images can be
successfully used for the proposed urban change analyses.
Abstract: One image is worth more than thousand words.
Images if analyzed can reveal useful information. Low level image
processing deals with the extraction of specific feature from a single
image. Now the question arises: What technique should be used to
extract patterns of very large and detailed image database? The
answer of the question is: “Image Mining”. Image Mining deals with
the extraction of image data relationship, implicit knowledge, and
another pattern from the collection of images or image database. It is
nothing but the extension of Data Mining. In the following paper, not
only we are going to scrutinize the current techniques of image
mining but also present a new technique for mining images using
Genetic Algorithm.
Abstract: Speech enhancement is a long standing problem with
numerous applications like teleconferencing, VoIP, hearing aids and
speech recognition. The motivation behind this research work is to
obtain a clean speech signal of higher quality by applying the optimal
noise cancellation technique. Real-time adaptive filtering algorithms
seem to be the best candidate among all categories of the speech
enhancement methods. In this paper, we propose a speech
enhancement method based on Recursive Least Squares (RLS)
adaptive filter of speech signals. Experiments were performed on
noisy data which was prepared by adding AWGN, Babble and Pink
noise to clean speech samples at -5dB, 0dB, 5dB and 10dB SNR
levels. We then compare the noise cancellation performance of
proposed RLS algorithm with existing NLMS algorithm in terms of
Mean Squared Error (MSE), Signal to Noise ratio (SNR) and SNR
Loss. Based on the performance evaluation, the proposed RLS
algorithm was found to be a better optimal noise cancellation
technique for speech signals.
Abstract: In this paper, the improvement by deconvolution of
the depth resolution in Secondary Ion Mass Spectrometry (SIMS)
analysis is considered. Indeed, we have developed a new Tikhonov-
Miller deconvolution algorithm where a priori model of the solution
is included. This is a denoisy and pre-deconvoluted signal obtained
from: firstly, by the application of wavelet shrinkage algorithm,
secondly by the introduction of the obtained denoisy signal in an
iterative deconvolution algorithm. In particular, we have focused the
light on the effect of the iterations number on the evolution of the
deconvoluted signals. The SIMS profiles are multilayers of Boron in
Silicon matrix.
Abstract: The emerging Cognitive Radio is combo of both the
technologies i.e. Radio dynamics and software technology. It involve
wireless system with efficient coding, designing, and making them
artificial intelligent to take the decision according to the surrounding
environment and adopt themselves accordingly, so as to deliver the
best QoS. This is the breakthrough from fixed hardware and fixed
utilization of the spectrum. This software-defined approach of
research is centralized at user-definition and application driven
model, various software method are used for the optimization of the
wireless communication. This paper focused on the Spectrum
allocation technique using genetic algorithm GA to evolve radio,
represented by chromosomes. The chromosomes gene represents the
adjustable parameters in given radio and by using GA, evolving over
the generations, the optimized set of parameters are evolved, as per
the requirement of user and availability of the spectrum, in our
prototype the gene consist of 6 different parameters, and the best set
of parameters are evolved according to the application need and
availability of the spectrum holes and thus maintaining best QoS for
user, simultaneously maintaining licensed user rights. The analyzing
tool Matlab is used for the performance of the prototype.
Abstract: Different tools and technologies were implemented
for Crisis Response and Management (CRM) which is generally
using available network infrastructure for information exchange.
Depending on type of disaster or crisis, network infrastructure could
be affected and it could not be able to provide reliable connectivity.
Thus any tool or technology that depends on the connectivity could
not be able to fulfill its functionalities. As a solution, a new message
exchange framework has been developed. Framework provides
offline/online information exchange platform for CRM Information
Systems (CRMIS) and it uses XML compression and packet
prioritization algorithms and is based on open source web
technologies. By introducing offline capabilities to the web
technologies, framework will be able to perform message exchange
on unreliable networks. The experiments done on the simulation
environment provide promising results on low bandwidth networks
(56kbps and 28.8 kbps) with up to 50% packet loss and the solution is
to successfully transfer all the information on these low quality
networks where the traditional 2 and 3 tier applications failed.
Abstract: Clustering involves the partitioning of n objects into k
clusters. Many clustering algorithms use hard-partitioning techniques
where each object is assigned to one cluster. In this paper we propose
an overlapping algorithm MCOKE which allows objects to belong to
one or more clusters. The algorithm is different from fuzzy clustering
techniques because objects that overlap are assigned a membership
value of 1 (one) as opposed to a fuzzy membership degree. The
algorithm is also different from other overlapping algorithms that
require a similarity threshold be defined a priori which can be
difficult to determine by novice users.
Abstract: High Peak to Average Power Ratio (PAPR) of the
transmitted signal is a serious problem in multicarrier systems (MC),
such as Orthogonal Frequency Division Multiplexing (OFDM), or in
Multi-Carrier Code Division Multiple Access (MC-CDMA) systems,
due to large number of subcarriers. This effect is possible reduce with
some PAPR reduction techniques. Spreading sequences at the
presence of Saleh and Rapp models of high power amplifier (HPA)
have big influence on the behavior of system. In this paper we
investigate the bit-error-rate (BER) performance of MC-CDMA
systems. Basically we can see from simulations that the MC-CDMA
system with Iterative algorithm can be providing significantly better
results than the MC-CDMA system. The results of our analyses are
verified via simulation.
Abstract: Recent research in neural networks science and
neuroscience for modeling complex time series data and statistical
learning has focused mostly on learning from high input space and
signals. Local linear models are a strong choice for modeling local
nonlinearity in data series. Locally weighted projection regression is
a flexible and powerful algorithm for nonlinear approximation in
high dimensional signal spaces. In this paper, different learning
scenario of one and two dimensional data series with different
distributions are investigated for simulation and further noise is
inputted to data distribution for making different disordered
distribution in time series data and for evaluation of algorithm in
locality prediction of nonlinearity. Then, the performance of this
algorithm is simulated and also when the distribution of data is high
or when the number of data is less the sensitivity of this approach to
data distribution and influence of important parameter of local
validity in this algorithm with different data distribution is explained.
Abstract: In this paper we consider the rule reduct generation
problem. Rule Reduct Generation (RG) and Modified Rule
Generation (MRG) algorithms, that are used to solve this problem,
are well-known. Alternative to these algorithms, we develop Pruning
Rule Generation (PRG) algorithm. We compare the PRG algorithm
with RG and MRG.
Abstract: The number of Ground Motion Prediction Equations
(GMPEs) used for predicting peak ground acceleration (PGA) and
the number of earthquake recordings that have been used for fitting
these equations has increased in the past decades. The current PF-L
database contains 3550 recordings. Since the GMPEs frequently
model the peak ground acceleration the goal of the present study was
to refit a selection of 44 of the existing equation models for PGA in
light of the latest data. The algorithm Levenberg-Marquardt was used
for fitting the coefficients of the equations and the results are
evaluated both quantitatively by presenting the root mean squared
error (RMSE) and qualitatively by drawing graphs of the five best
fitted equations. The RMSE was found to be as low as 0.08 for the
best equation models. The newly estimated coefficients vary from the
values published in the original works.
Abstract: Job Scheduling plays an important role for efficient
utilization of grid resources available across different domains and
geographical zones. Scheduling of jobs is challenging and NPcomplete.
Evolutionary / Swarm Intelligence algorithms have been
extensively used to address the NP problem in grid scheduling.
Artificial Bee Colony (ABC) has been proposed for optimization
problems based on foraging behaviour of bees. This work proposes a
modified ABC algorithm, Cluster Heterogeneous Earliest First Min-
Min Artificial Bee Colony (CHMM-ABC), to optimally schedule
jobs for the available resources. The proposed model utilizes a novel
Heterogeneous Earliest Finish Time (HEFT) Heuristic Algorithm
along with Min-Min algorithm to identify the initial food source.
Simulation results show the performance improvement of the
proposed algorithm over other swarm intelligence techniques.
Abstract: In this paper, Bayesian online inference in models of
data series are constructed by change-points algorithm, which
separated the observed time series into independent series and study
the change and variation of the regime of the data with related
statistical characteristics. variation of statistical characteristics of time
series data often represent separated phenomena in the some
dynamical system, like a change in state of brain dynamical reflected
in EEG signal data measurement or a change in important regime of
data in many dynamical system. In this paper, prediction algorithm
for studying change point location in some time series data is
simulated. It is verified that pattern of proposed distribution of data
has important factor on simpler and smother fluctuation of hazard
rate parameter and also for better identification of change point
locations. Finally, the conditions of how the time series distribution
effect on factors in this approach are explained and validated with
different time series databases for some dynamical system.
Abstract: Performance of different filtering approaches depends
on modeling of dynamical system and algorithm structure. For
modeling and smoothing the data the evaluation of posterior
distribution in different filtering approach should be chosen carefully.
In this paper different filtering approaches like filter KALMAN,
EKF, UKF, EKS and smoother RTS is simulated in some trajectory
tracking of path and accuracy and limitation of these approaches are
explained. Then probability of model with different filters is
compered and finally the effect of the noise variance to estimation is
described with simulations results.
Abstract: This paper presents an evolutionary algorithm for
solving multi-objective optimization problems-based artificial neural
network (ANN). The multi-objective evolutionary algorithm used in
this study is genetic algorithm while ANN used is radial basis
function network (RBFN). The proposed algorithm named memetic
elitist Pareto non-dominated sorting genetic algorithm-based RBFN
(MEPGAN). The proposed algorithm is implemented on medical
diseases problems. The experimental results indicate that the
proposed algorithm is viable, and provides an effective means to
design multi-objective RBFNs with good generalization capability
and compact network structure. This study shows that MEPGAN
generates RBFNs coming with an appropriate balance between
accuracy and simplicity, comparing to the other algorithms found in
literature.
Abstract: Leukaemia is a blood cancer disease that contributes
to the increment of mortality rate in Malaysia each year. There are
two main categories for leukaemia, which are acute and chronic
leukaemia. The production and development of acute leukaemia cells
occurs rapidly and uncontrollable. Therefore, if the identification of
acute leukaemia cells could be done fast and effectively, proper
treatment and medicine could be delivered. Due to the requirement of
prompt and accurate diagnosis of leukaemia, the current study has
proposed unsupervised pixel segmentation based on clustering
algorithm in order to obtain a fully segmented abnormal white blood
cell (blast) in acute leukaemia image. In order to obtain the
segmented blast, the current study proposed three clustering
algorithms which are k-means, fuzzy c-means and moving k-means
algorithms have been applied on the saturation component image.
Then, median filter and seeded region growing area extraction
algorithms have been applied, to smooth the region of segmented
blast and to remove the large unwanted regions from the image,
respectively. Comparisons among the three clustering algorithms are
made in order to measure the performance of each clustering
algorithm on segmenting the blast area. Based on the good sensitivity
value that has been obtained, the results indicate that moving kmeans
clustering algorithm has successfully produced the fully
segmented blast region in acute leukaemia image. Hence, indicating
that the resultant images could be helpful to haematologists for
further analysis of acute leukaemia.
Abstract: Chemical Reaction Optimization (CRO) is an
optimization metaheuristic inspired by the nature of chemical
reactions as a natural process of transforming the substances from
unstable to stable states. Starting with some unstable molecules with
excessive energy, a sequence of interactions takes the set to a state of
minimum energy. Researchers reported successful application of the
algorithm in solving some engineering problems, like the quadratic
assignment problem, with superior performance when compared with
other optimization algorithms. We adapted this optimization
algorithm to the Printed Circuit Board Drilling Problem (PCBDP)
towards reducing the drilling time and hence improving the PCB
manufacturing throughput. Although the PCBDP can be viewed as
instance of the popular Traveling Salesman Problem (TSP), it has
some characteristics that would require special attention to the
transactions that explore the solution landscape. Experimental test
results using the standard CROToolBox are not promising for
practically sized problems, while it could find optimal solutions for
artificial problems and small benchmarks as a proof of concept.
Abstract: A Distributed Denial of Service (DDoS) attack is a
major threat to cyber security. It originates from the network layer or
the application layer of compromised/attacker systems which are
connected to the network. The impact of this attack ranges from the
simple inconvenience to use a particular service to causing major
failures at the targeted server. When there is heavy traffic flow to a
target server, it is necessary to classify the legitimate access and
attacks. In this paper, a novel method is proposed to detect DDoS
attacks from the traces of traffic flow. An access matrix is created
from the traces. As the access matrix is multi dimensional, Principle
Component Analysis (PCA) is used to reduce the attributes used for
detection. Two classifiers Naive Bayes and K-Nearest neighborhood
are used to classify the traffic as normal or abnormal. The
performance of the classifier with PCA selected attributes and actual
attributes of access matrix is compared by the detection rate and
False Positive Rate (FPR).