Abstract: Uncontrolled growth of abnormal cells in the lung in the form of tumor can be either benign (non-cancerous) or malignant (cancerous). Patients with Lung Cancer (LC) have an average of five years life span expectancy provided diagnosis, detection and prediction, which reduces many treatment options to risk of invasive surgery increasing survival rate. Computed Tomography (CT), Positron Emission Tomography (PET), and Magnetic Resonance Imaging (MRI) for earlier detection of cancer are common. Gaussian filter along with median filter used for smoothing and noise removal, Histogram Equalization (HE) for image enhancement gives the best results without inviting further opinions. Lung cavities are extracted and the background portion other than two lung cavities is completely removed with right and left lungs segmented separately. Region properties measurements area, perimeter, diameter, centroid and eccentricity measured for the tumor segmented image, while texture is characterized by Gray-Level Co-occurrence Matrix (GLCM) functions, feature extraction provides Region of Interest (ROI) given as input to classifier. Two levels of classifications, K-Nearest Neighbor (KNN) is used for determining patient condition as normal or abnormal, while Artificial Neural Networks (ANN) is used for identifying the cancer stage is employed. Discrete Wavelet Transform (DWT) algorithm is used for the main feature extraction leading to best efficiency. The developed technology finds encouraging results for real time information and on line detection for future research.
Abstract: Centroid terms are single words that semantically and
topically characterise text documents and so may serve as their
very compact representation in automatic text processing. In the
present paper, centroids are used to measure the relevance of text
documents with respect to a given search query. Thus, a new graphbased
paradigm for searching texts in large corpora is proposed
and evaluated against keyword-based methods. The first, promising
experimental results demonstrate the usefulness of the centroid-based
search procedure. It is shown that especially the routing of search
queries in interactive and decentralised search systems can be greatly
improved by applying this approach. A detailed discussion on further
fields of its application completes this contribution.
Abstract: Data mining technique used in the field of clustering is a subject of active research and assists in biological pattern recognition and extraction of new knowledge from raw data. Clustering means the act of partitioning an unlabeled dataset into groups of similar objects. Each group, called a cluster, consists of objects that are similar between themselves and dissimilar to objects of other groups. Several clustering methods are based on partitional clustering. This category attempts to directly decompose the dataset into a set of disjoint clusters leading to an integer number of clusters that optimizes a given criterion function. The criterion function may emphasize a local or a global structure of the data, and its optimization is an iterative relocation procedure. The K-Means algorithm is one of the most widely used partitional clustering techniques. Since K-Means is extremely sensitive to the initial choice of centers and a poor choice of centers may lead to a local optimum that is quite inferior to the global optimum, we propose a strategy to initiate K-Means centers. The improved K-Means algorithm is compared with the original K-Means, and the results prove how the efficiency has been significantly improved.
Abstract: Hand gesture recognition is a technique used to locate, detect, and recognize a hand gesture. Detection and recognition are concepts of Artificial Intelligence (AI). AI concepts are applicable in Human Computer Interaction (HCI), Expert systems (ES), etc. Hand gesture recognition can be used in sign language interpretation. Sign language is a visual communication tool. This tool is used mostly by deaf societies and those with speech disorder. Communication barriers exist when societies with speech disorder interact with others. This research aims to build a hand recognition system for Lesotho’s Sesotho and English language interpretation. The system will help to bridge the communication problems encountered by the mentioned societies. The system has various processing modules. The modules consist of a hand detection engine, image processing engine, feature extraction, and sign recognition. Detection is a process of identifying an object. The proposed system uses Canny pruning Haar and Haarcascade detection algorithms. Canny pruning implements the Canny edge detection. This is an optimal image processing algorithm. It is used to detect edges of an object. The system employs a skin detection algorithm. The skin detection performs background subtraction, computes the convex hull, and the centroid to assist in the detection process. Recognition is a process of gesture classification. Template matching classifies each hand gesture in real-time. The system was tested using various experiments. The results obtained show that time, distance, and light are factors that affect the rate of detection and ultimately recognition. Detection rate is directly proportional to the distance of the hand from the camera. Different lighting conditions were considered. The more the light intensity, the faster the detection rate. Based on the results obtained from this research, the applied methodologies are efficient and provide a plausible solution towards a light-weight, inexpensive system which can be used for sign language interpretation.
Abstract: Transportation Problem (TP) is based on supply and demand of commodities transported from one source to the different destinations. Usual methods for finding solution of TPs are North-West Corner Rule, Least Cost Method Vogel’s Approximation Method etc. The transportation costs tend to vary at each time. We can use fuzzy numbers which would give solution according to this situation. In this study the Best Candidate Method (BCM) is applied. For ranking Centroid Ranking Technique (CRT) and Robust Ranking Technique have been adopted to transform the fuzzy TP and the above methods are applied to EDWARDS Vacuum Company, Crawley, in West Sussex in the United Kingdom. A Comparative study is also given. We see that the transportation cost can be minimized by the application of CRT under BCM.
Abstract: Built-up columns have been widely employed by practice engineers in the design and construction of buildings and bridges. However, failures have been observed in this type of columns in previous seismic events. This study analyses the performance of built-up columns with different configurations of battens when it is subjected to seismic loads. Four columns with different size of battens were simulated and subjected to three different intensities of axial load along with a lateral cyclic load. Results indicate that the size of battens influences significantly the seismic behavior of columns. Lower shear capacity of battens results in higher ultimate strength and ductility for built-up columns. It is observed that intensity of axial load has a significant effect on the ultimate strength of columns, but it is less influential on the yield strength. For a given drift value, the stress level in the centroid of smaller size battens is significantly more than that of larger size battens signifying damage concentration in battens rather than chords. It is concluded that design of battens for shear demand lower than code specified values only slightly reduces initial stiffness of columns; however, it improves seismic performance of battened columns.
Abstract: Community detection is an extremely useful technique
in understanding the structure and function of a social network.
Louvain algorithm, which is based on Newman-Girman modularity
optimization technique, is extensively used as a computationally
efficient method extract the communities in social networks. It
has been suggested that the nodes that are in close geographical
proximity have a higher tendency of forming communities. Variants
of the Newman-Girman modularity measure such as dist-modularity
try to normalize the effect of geographical proximity to extract
geographically dispersed communities, at the expense of losing
the information about the geographically proximate communities.
In this work, we propose a method to extract geographically
dispersed communities while preserving the information about the
geographically proximate communities, by analyzing the ‘community
network’, where the centroids of communities would be considered as
network nodes. We suggest that the inter-community link strengths,
which are normalized over the community sizes, may be used
to identify and extract the ‘overlay communities’. The overlay
communities would have relatively higher link strengths, despite
being relatively apart in their spatial distribution. We apply this
method to the Gowalla online social network, which contains
the geographical signatures of its users, and identify the overlay
communities within it.
Abstract: In this paper, we present an adaptive controller for decentralized coordination problem of multiple non-holonomic agents. The performance of the presented Multi-Agent Bounded Gain Forgetting (BGF) Composite Adaptive controller is compared against the tracking error criterion with a Feedback Linearization controller. By using the method, the sensor nodes move and reconfigure themselves in a coordinated way in response to a sensed environment. The multi-agent coordination is achieved through Centroidal Voronoi Tessellations and Coverage Control. Also, a consensus protocol is used for synchronization of the parameter vectors. The two controllers are given with their Lyapunov stability analysis and their stability is verified with simulation results. The simulations are carried out in MATLAB and ROS environments. Better performance is obtained with BGF Adaptive Controller.
Abstract: Hyperspectral imagery (HSI) typically provides a
wealth of information captured in a wide range of the
electromagnetic spectrum for each pixel in the image. Hence, a
pixel in HSI is a high-dimensional vector of intensities with a
large spectral range and a high spectral resolution. Therefore, the
semantic interpretation is a challenging task of HSI analysis. We
focused in this paper on object classification as HSI semantic
interpretation. However, HSI classification still faces some issues,
among which are the following: The spatial variability of spectral
signatures, the high number of spectral bands, and the high cost
of true sample labeling. Therefore, the high number of spectral
bands and the low number of training samples pose the problem of
the curse of dimensionality. In order to resolve this problem, we
propose to introduce the process of dimensionality reduction trying
to improve the classification of HSI. The presented approach is a
semi-supervised band selection method based on spatial hypergraph
embedding model to represent higher order relationships with
different weights of the spatial neighbors corresponding to the
centroid of pixel. This semi-supervised band selection has been
developed to select useful bands for object classification. The
presented approach is evaluated on AVIRIS and ROSIS HSIs
and compared to other dimensionality reduction methods. The
experimental results demonstrate the efficacy of our approach
compared to many existing dimensionality reduction methods for
HSI classification.
Abstract: In this paper, we present a fast and efficient mesh coarsening algorithm for 3D triangular meshes. Theis approach can be applied to very complex 3D meshes of arbitrary topology and with millions of vertices. The algorithm is based on the clustering of the input mesh elements, which divides the faces of an input mesh into a given number of clusters for clustering purpose by approximating the Centroidal Voronoi Tessellation of the input mesh. Once a clustering is achieved, it provides us an efficient way to construct uniform tessellations, and therefore leads to good coarsening of polygonal meshes. With proliferation of 3D scanners, this coarsening algorithm is particularly useful for reverse engineering applications of 3D models, which in many cases are dense, non-uniform, irregular and arbitrary topology. Examples demonstrating effectiveness of the new algorithm are also included in the paper.
Abstract: In this study, we report calculations of gate capacitance of AlGaN/GaN HEMTs with nextnano device simulation software. We have used a physical gate capacitance model for III-V FETs that incorporates quantum capacitance and centroid capacitance in the channel. These simulations explore various device structures with different values of barrier thickness and channel thickness. A detailed understanding of the impact of gate capacitance in HEMTs will allow us to determine their role in future 10 nm physical gate length node.
Abstract: Rough set theory is used to handle uncertainty and incomplete information by applying two accurate sets, Lower approximation and Upper approximation. In this paper, the rough clustering algorithms are improved by adopting the Similarity, Dissimilarity–Similarity and Entropy based initial centroids selection method on three different clustering algorithms namely Entropy based Rough K-Means (ERKM), Similarity based Rough K-Means (SRKM) and Dissimilarity-Similarity based Rough K-Means (DSRKM) were developed and executed by yeast dataset. The rough clustering algorithms are validated by cluster validity indexes namely Rand and Adjusted Rand indexes. An experimental result shows that the ERKM clustering algorithm perform effectively and delivers better results than other clustering methods. Outlier detection is an important task in data mining and very much different from the rest of the objects in the clusters. Entropy based Rough Outlier Factor (EROF) method is seemly to detect outlier effectively for yeast dataset. In rough K-Means method, by tuning the epsilon (ᶓ) value from 0.8 to 1.08 can detect outliers on boundary region and the RKM algorithm delivers better results, when choosing the value of epsilon (ᶓ) in the specified range. An experimental result shows that the EROF method on clustering algorithm performed very well and suitable for detecting outlier effectively for all datasets. Further, experimental readings show that the ERKM clustering method outperformed the other methods.
Abstract: Given the increase in the number of e-commerce sites,
the number of competitors has become very important. This means
that companies have to take appropriate decisions in order to meet the
expectations of their customers and satisfy their needs. In this paper,
we present a case study of applying LRFM (length, recency,
frequency and monetary) model and clustering techniques in the
sector of electronic commerce with a view to evaluating customers’
values of the Moroccan e-commerce websites and then developing
effective marketing strategies. To achieve these objectives, we adopt
LRFM model by applying a two-stage clustering method. In the first
stage, the self-organizing maps method is used to determine the best
number of clusters and the initial centroid. In the second stage, kmeans
method is applied to segment 730 customers into nine clusters
according to their L, R, F and M values. The results show that the
cluster 6 is the most important cluster because the average values of
L, R, F and M are higher than the overall average value. In addition,
this study has considered another variable that describes the mode of
payment used by customers to improve and strengthen clusters’
analysis. The clusters’ analysis demonstrates that the payment method is
one of the key indicators of a new index which allows to assess the
level of customers’ confidence in the company's Website.
Abstract: The relationship dependence between RSS and distance
in an enclosed environment is an important consideration because it is
a factor that can influence the reliability of any localization algorithm
founded on RSS. Several algorithms effectively reduce the variance of
RSS to improve localization or accuracy performance. Our proposed
algorithm essentially avoids this pitfall and consequently, its high
adaptability in the face of erratic radio signal. Using 3 anchors in
close proximity of each other, we are able to establish that RSS can be
used as reliable indicator for localization with an acceptable degree of
accuracy. Inherent in this concept, is the ability for each prospective
anchor to validate (guarantee) the position or the proximity of the
other 2 anchors involved in the localization and vice versa. This
procedure ensures that the uncertainties of radio signals due to
multipath effects in enclosed environments are minimized. A major
driver of this idea is the implicit topological relationship among
sensors due to raw radio signal strength. The algorithm is an area
based algorithm; however, it does not trade accuracy for precision
(i.e the size of the returned area).
Abstract: Localization of nodes is one of the key issues of
Wireless Sensor Network (WSN) that gained a wide attention in
recent years. The existing localization techniques can be generally
categorized into two types: range-based and range-free. Compared
with rang-based schemes, the range-free schemes are more costeffective,
because no additional ranging devices are needed. As a
result, we focus our research on the range-free schemes. In this paper
we study three types of range-free location algorithms to compare the
localization error and energy consumption of each one. Centroid
algorithm requires a normal node has at least three neighbor anchors,
while DV-hop algorithm doesn’t have this requirement. The third
studied algorithm is the amorphous algorithm similar to DV-Hop
algorithm, and the idea is to calculate the hop distance between two
nodes instead of the linear distance between them. The simulation
results show that the localization accuracy of the amorphous
algorithm is higher than that of other algorithms and the energy
consumption does not increase too much.
Abstract: Reliability allocation is quite important during early
design and development stages for a system to apportion its specified
reliability goal to subsystems. This paper improves the reliability
fuzzy allocation method, and gives concrete processes on determining
the factor and sub-factor sets, weight sets, judgment set, and
multi-stage fuzzy evaluation. To determine the weight of factor and
sub-factor sets, the modified trapezoidal numbers are proposed to
reduce errors caused by subjective factors. To decrease the fuzziness
in fuzzy division, an approximation method based on linear
programming is employed. To compute the explicit values of fuzzy
numbers, centroid method of defuzzification is considered. An
example is provided to illustrate the application of the proposed
reliability allocation method based on fuzzy arithmetic.
Abstract: Speech Segmentation is the measure of the change
point detection for partitioning an input speech signal into regions
each of which accords to only one speaker. In this paper, we apply
two features based on multi-scale product (MP) of the clean speech,
namely the spectral centroid of MP, and the zero crossings rate of
MP. We focus on multi-scale product analysis as an important tool
for segmentation extraction. The MP is based on making the product
of the speech wavelet transform coefficients (WTC). We have
estimated our method on the Keele database. The results show the
effectiveness of our method. It indicates that the two features can find
word boundaries, and extracted the segments of the clean speech.
Abstract: Lately, with the increasing number of location-based applications, demand for highly accurate and reliable indoor localization became urgent. This is a challenging problem, due to the measurement variance which is the consequence of various factors like obstacles, equipment properties and environmental changes in complex nature of indoor environments. In this paper we propose low-cost custom-setup infrastructure solution and localization algorithm based on the Weighted Centroid Localization (WCL) method. Localization accuracy is increased by several enhancements: calibration of RSSI values gained from wireless nodes, repetitive measurements of RSSI to exclude deviating values from the position estimation, and by considering orientation of the device according to the wireless nodes. We conducted several experiments to evaluate the proposed algorithm. High accuracy of ~1m was achieved.
Abstract: This paper proposes a new obstacle and collision
avoidance control laws for a three-dimensional swarm of boids.
The swarm exhibit collective emergent behaviors whilst avoiding the
obstacles in the workspace. While flocking, animals group up in order
to do various tasks and even a greater chance of evading predators. A
generalized algorithms for attraction to the centroid, inter-individual
swarm avoidance and obstacle avoidance is designed in this paper.
We present a set of new continuous time-invariant velocity control
laws is presented which is formulated via the Lyapunov-based control
scheme. The control laws proposed in this paper also ensures practical
stability of the system. The effectiveness of the proposed control laws
is demonstrated via computer simulations
Abstract: In this paper, we propose a solution to the motion
planning and control problem for a swarm of three-dimensional
boids. The swarm exhibit collective emergent behaviors within the
vicinity of the workspace. The capability of biological systems
to autonomously maneuver, track and pursue evasive targets in a
cluttered environment is vastly superior to any engineered system. It
is considered an emergent behavior arising from simple rules that are
followed by individuals and may not involve any central coordination.
A generalized, yet scalable algorithm for attraction to the centroid
and inter-individual swarm avoidance is proposed. We present a set
of new continuous time-invariant velocity control laws, formulated via
the Lyapunov-based control scheme for target attraction and collision
avoidance. The controllers provide a collision-free trajectory. The
control laws proposed in this paper also ensures practical stability
of the system. The effectiveness of the control laws is demonstrated
via computer simulations.