Scholarly

Skin Lesion Segmentation Using Color Channel Optimization and Clustering-based Histogram Thresholding

Year: 2009 Volume: 3 Issue: 12 364 - 372 Pages

Abstract: Automatic segmentation of skin lesions is the first step towards the automated analysis of malignant melanoma. Although numerous segmentation methods have been developed, few studies have focused on determining the most effective color space for melanoma application. This paper proposes an automatic segmentation algorithm based on color space analysis and clustering-based histogram thresholding, a process which is able to determine the optimal color channel for detecting the borders in dermoscopy images. The algorithm is tested on a set of 30 high resolution dermoscopy images. A comprehensive evaluation of the results is provided, where borders manually drawn by four dermatologists, are compared to automated borders detected by the proposed algorithm, applying three previously used metrics of accuracy, sensitivity, and specificity and a new metric of similarity. By performing ROC analysis and ranking the metrics, it is demonstrated that the best results are obtained with the X and XoYoR color channels, resulting in an accuracy of approximately 97%. The proposed method is also compared with two state-of-theart skin lesion segmentation methods.

Maximum Common Substructure Extraction in RNA Secondary Structures Using Clique Detection Approach

Year: 2008 Volume: 2 Issue: 9 3092 - 3101 Pages

Authors:
Shih-Yi Chao

Abstract: The similarity comparison of RNA secondary structures is important in studying the functions of RNAs. In recent years, most existing tools represent the secondary structures by tree-based presentation and calculate the similarity by tree alignment distance. Different to previous approaches, we propose a new method based on maximum clique detection algorithm to extract the maximum common structural elements in compared RNA secondary structures. A new graph-based similarity measurement and maximum common subgraph detection procedures for comparing purely RNA secondary structures is introduced. Given two RNA secondary structures, the proposed algorithm consists of a process to determine the score of the structural similarity, followed by comparing vertices labelling, the labelled edges and the exact degree of each vertex. The proposed algorithm also consists of a process to extract the common structural elements between compared secondary structures based on a proposed maximum clique detection of the problem. This graph-based model also can work with NC-IUB code to perform the pattern-based searching. Therefore, it can be used to identify functional RNA motifs from database or to extract common substructures between complex RNA secondary structures. We have proved the performance of this proposed algorithm by experimental results. It provides a new idea of comparing RNA secondary structures. This tool is helpful to those who are interested in structural bioinformatics.

NEAR: Visualizing Information Relations in Multimedia Repository A•VI•RE

Year: 2007 Volume: 1 Issue: 11 3549 - 3554 Pages

Abstract: This paper describes the NEAR (Navigating Exhibitions, Annotations and Resources) panel, a novel interactive visualization technique designed to help people navigate and interpret groups of resources, exhibitions and annotations by revealing hidden relations such as similarities and references. NEAR is implemented on A•VI•RE, an extended online information repository. A•VI•RE supports a semi-structured collection of exhibitions containing various resources and annotations. Users are encouraged to contribute, share, annotate and interpret resources in the system by building their own exhibitions and annotations. However, it is hard to navigate smoothly and efficiently in A•VI•RE because of its high capacity and complexity. We present a visual panel that implements new navigation and communication approaches that support discovery of implied relations. By quickly scanning and interacting with NEAR, users can see not only implied relations but also potential connections among different data elements. NEAR was tested by several users in the A•VI•RE system and shown to be a supportive navigation tool. In the paper, we further analyze the design, report the evaluation and consider its usage in other applications.

A Similarity Measure for Clustering and its Applications

Year: 2008 Volume: 2 Issue: 5 1587 - 1593 Pages

Abstract: This paper introduces a measure of similarity between two clusterings of the same dataset produced by two different algorithms, or even the same algorithm (K-means, for instance, with different initializations usually produce different results in clustering the same dataset). We then apply the measure to calculate the similarity between pairs of clusterings, with special interest directed at comparing the similarity between various machine clusterings and human clustering of datasets. The similarity measure thus can be used to identify the best (in terms of most similar to human) clustering algorithm for a specific problem at hand. Experimental results pertaining to the text categorization problem of a Portuguese corpus (wherein a translation-into-English approach is used) are presented, as well as results on the well-known benchmark IRIS dataset. The significance and other potential applications of the proposed measure are discussed.

A Combination of Similarity Ranking and Time for Social Research Paper Searching

Year: 2011 Volume: 5 Issue: 6 623 - 628 Pages

Authors:
P. Jomsri

Abstract: Nowadays social media are important tools for web resource discovery. The performance and capabilities of web searches are vital, especially search results from social research paper bookmarking. This paper proposes a new algorithm for ranking method that is a combination of similarity ranking with paper posted time or CSTRank. The paper posted time is static ranking for improving search results. For this particular study, the paper posted time is combined with similarity ranking to produce a better ranking than other methods such as similarity ranking or SimRank. The retrieval performance of combination rankings is evaluated using mean values of NDCG. The evaluation in the experiments implies that the chosen CSTRank ranking by using weight score at ratio 90:10 can improve the efficiency of research paper searching on social bookmarking websites.

Forest Growth Simulation: Tropical Rain Forest Stand Table Projection

Year: 2012 Volume: 6 Issue: 5 548 - 553 Pages

Abstract: The study on the tree growth for four species groups of commercial timber in Koh Kong province, Cambodia-s tropical rainforest is described. The simulation for these four groups had been successfully developed in the 5-year interval through year-60. Data were obtained from twenty permanent sample plots in the duration of thirteen years. The aim for this study was to develop stand table simulation system of tree growth by the species group. There were five steps involved in the development of the tree growth simulation: aggregate the tree species into meaningful groups by using cluster analysis; allocate the trees in the diameter classes by the species group; observe the diameter movement of the species group. The diameter growth rate, mortality rate and recruitment rate were calculated by using some mathematical formula. Simulation equation had been created by combining those parameters. Result showed the dissimilarity of the diameter growth among species groups.

Computational Method for Annotation of Protein Sequence According to Gene Ontology Terms

Year: 2007 Volume: 1 Issue: 1 16 - 29 Pages

Abstract: Annotation of a protein sequence is pivotal for the understanding of its function. Accuracy of manual annotation provided by curators is still questionable by having lesser evidence strength and yet a hard task and time consuming. A number of computational methods including tools have been developed to tackle this challenging task. However, they require high-cost hardware, are difficult to be setup by the bioscientists, or depend on time intensive and blind sequence similarity search like Basic Local Alignment Search Tool. This paper introduces a new method of assigning highly correlated Gene Ontology terms of annotated protein sequences to partially annotated or newly discovered protein sequences. This method is fully based on Gene Ontology data and annotations. Two problems had been identified to achieve this method. The first problem relates to splitting the single monolithic Gene Ontology RDF/XML file into a set of smaller files that can be easy to assess and process. Thus, these files can be enriched with protein sequences and Inferred from Electronic Annotation evidence associations. The second problem involves searching for a set of semantically similar Gene Ontology terms to a given query. The details of macro and micro problems involved and their solutions including objective of this study are described. This paper also describes the protein sequence annotation and the Gene Ontology. The methodology of this study and Gene Ontology based protein sequence annotation tool namely extended UTMGO is presented. Furthermore, its basic version which is a Gene Ontology browser that is based on semantic similarity search is also introduced.

Photo Mosaic Smartphone Application in Client-Server Based Large-Scale Image Databases

Year: 2011 Volume: 5 Issue: 9 1021 - 1024 Pages

Abstract: In this paper we present a photo mosaic smartphone application in client-server based large-scale image databases. Photo mosaic is not a new concept, but there are very few smartphone applications especially for a huge number of images in the client-server environment. To support large-scale image databases, we first propose an overall framework working as a client-server model. We then present a concept of image-PAA features to efficiently handle a huge number of images and discuss its lower bounding property. We also present a best-match algorithm that exploits the lower bounding property of image-PAA. We finally implement an efficient Android-based application and demonstrate its feasibility.

Using Genetic Algorithm to Improve Information Retrieval Systems

Year: 2008 Volume: 2 Issue: 5 1562 - 1568 Pages

Abstract: This study investigates the use of genetic algorithms in information retrieval. The method is shown to be applicable to three well-known documents collections, where more relevant documents are presented to users in the genetic modification. In this paper we present a new fitness function for approximate information retrieval which is very fast and very flexible, than cosine similarity fitness function.

SeqWord Gene Island Sniffer: a Program to Study the Lateral Genetic Exchange among Bacteria

Year: 2009 Volume: 3 Issue: 10 2411 - 2416 Pages

Abstract: SeqWord Gene Island Sniffer, a new program for the identification of mobile genetic elements in sequences of bacterial chromosomes is presented. This program is based on the analysis of oligonucleotide usage variations in DNA sequences. 3,518 mobile genetic elements were identified in 637 bacterial genomes and further analyzed by sequence similarity and the functionality of encoded proteins. The results of this study are stored in an open database http://anjie.bi.up.ac.za/geidb/geidbhome. php). The developed computer program and the database provide the information valuable for further investigation of the distribution of mobile genetic elements and virulence factors among bacteria. The program is available for download at www.bi.up.ac.za/SeqWord/sniffer/index.html.

Protein-Protein Interaction Detection Based on Substring Sensitivity Measure

Year: 2007 Volume: 1 Issue: 1 9 - 15 Pages

Abstract: Detecting protein-protein interactions is a central problem in computational biology and aberrant such interactions may have implicated in a number of neurological disorders. As a result, the prediction of protein-protein interactions has recently received considerable attention from biologist around the globe. Computational tools that are capable of effectively identifying protein-protein interactions are much needed. In this paper, we propose a method to detect protein-protein interaction based on substring similarity measure. Two protein sequences may interact by the mean of the similarities of the substrings they contain. When applied on the currently available protein-protein interaction data for the yeast Saccharomyces cerevisiae, the proposed method delivered reasonable improvement over the existing ones.

Health Assessment of Electronic Products using Mahalanobis Distance and Projection Pursuit Analysis

Year: 2008 Volume: 2 Issue: 2 273 - 281 Pages

Abstract: With increasing complexity in electronic systems there is a need for system level anomaly detection and fault isolation. Anomaly detection based on vector similarity to a training set is used in this paper through two approaches, one the preserves the original information, Mahalanobis Distance (MD), and the other that compresses the data into its principal components, Projection Pursuit Analysis. These methods have been used to detect deviations in system performance from normal operation and for critical parameter isolation in multivariate environments. The study evaluates the detection capability of each approach on a set of test data with known faults against a baseline set of data representative of such “healthy" systems.

Position Based Routing Protocol with More Reliability in Mobile Ad Hoc Network

Year: 2009 Volume: 3 Issue: 1 72 - 75 Pages

Abstract: Position based routing protocols are the kinds of routing protocols, which they use of nodes location information, instead of links information to routing. In position based routing protocols, it supposed that the packet source node has position information of itself and it's neighbors and packet destination node. Greedy is a very important position based routing protocol. In one of it's kinds, named MFR (Most Forward Within Radius), source node or packet forwarder node, sends packet to one of it's neighbors with most forward progress towards destination node (closest neighbor to destination). Using distance deciding metric in Greedy to forward packet to a neighbor node, is not suitable for all conditions. If closest neighbor to destination node, has high speed, in comparison with source node or intermediate packet forwarder node speed or has very low remained battery power, then packet loss probability is increased. Proposed strategy uses combination of metrics distancevelocity similarity-power, to deciding about giving the packet to which neighbor. Simulation results show that the proposed strategy has lower lost packets average than Greedy, so it has more reliability.

Biodiesel as an Alternative Fuel for Diesel Engines

Year: 2009 Volume: 3 Issue: 9 488 - 490 Pages

Abstract: There is growing interest in biodiesel (fatty acid methyl ester or FAME) because of the similarity in its properties when compared to those of diesel fuels. Diesel engines operated on biodiesel have lower emissions of carbon monoxide, unburned hydrocarbons, particulate matter, and air toxics than when operated on petroleum-based diesel fuel. Production of fatty acid methyl ester (FAME) from rapeseed (nonedible oil) fatty acid distillate having high free fatty acids (FFA) was investigated in this work. Conditions for esterification process of rapeseed oil were 1.8 % H2SO4 as catalyst, MeOH/oil of molar ratio 2 : 0.1 and reaction temperature 65 °C, for a period of 3h. The yield of methyl ester was > 90 % in 1 h. The amount of FFA was reduced from 93 wt % to less than 2 wt % at the end of the esterification process. The FAME was pureed by neutralization with 1 M sodium hydroxide in water solution at a reaction temperature of 62 °C. The final FAME product met with the biodiesel quality standard, and ASTM D 6751.

A Novel Metric for Performance Evaluation of Image Fusion Algorithms

Year: 2007 Volume: 1 Issue: 7 2082 - 2087 Pages

Abstract: In this paper, we present a novel objective nonreference performance assessment algorithm for image fusion. It takes into account local measurements to estimate how well the important information in the source images is represented by the fused image. The metric is based on the Universal Image Quality Index and uses the similarity between blocks of pixels in the input images and the fused image as the weighting factors for the metrics. Experimental results confirm that the values of the proposed metrics correlate well with the subjective quality of the fused images, giving a significant improvement over standard measures based on mean squared error and mutual information.

Improved K-Modes for Categorical Clustering Using Weighted Dissimilarity Measure

Year: 2009 Volume: 3 Issue: 3 717 - 723 Pages

Abstract: K-Modes is an extension of K-Means clustering algorithm, developed to cluster the categorical data, where the mean is replaced by the mode. The similarity measure proposed by Huang is the simple matching or mismatching measure. Weight of attribute values contribute much in clustering; thus in this paper we propose a new weighted dissimilarity measure for K-Modes, based on the ratio of frequency of attribute values in the cluster and in the data set. The new weighted measure is experimented with the data sets obtained from the UCI data repository. The results are compared with K-Modes and K-representative, which show that the new measure generates clusters with high purity.

Numerical Simulation of unsteady MHD Flow and Heat Transfer of a Second Grade Fluid with Viscous Dissipation and Joule Heating using Meshfree Approach

Year: 2012 Volume: 6 Issue: 6 664 - 670 Pages

Abstract: In the present study, a numerical analysis is carried out to investigate unsteady MHD (magneto-hydrodynamic) flow and heat transfer of a non-Newtonian second grade viscoelastic fluid over an oscillatory stretching sheet. The flow is induced due to an infinite elastic sheet which is stretched oscillatory (back and forth) in its own plane. Effect of viscous dissipation and joule heating are taken into account. The non-linear differential equations governing the problem are transformed into system of non-dimensional differential equations using similarity transformations. A newly developed meshfree numerical technique Element free Galerkin method (EFGM) is employed to solve the coupled non linear differential equations. The results illustrating the effect of various parameters like viscoelastic parameter, Hartman number, relative frequency amplitude of the oscillatory sheet to the stretching rate and Eckert number on velocity and temperature field are reported in terms of graphs and tables. The present model finds its application in polymer extrusion, drawing of plastic films and wires, glass, fiber and paper production etc.

Watermarking Scheme for Color Images using Wavelet Transform based Texture Properties and Secret Sharing

Year: 2010 Volume: 4 Issue: 1 93 - 100 Pages

Abstract: In this paper, a new secure watermarking scheme for color image is proposed. It splits the watermark into two shares using (2, 2)- threshold Visual Cryptography Scheme (V CS) with Adaptive Order Dithering technique and embeds one share into high textured subband of Luminance channel of the color image. The other share is used as the key and is available only with the super-user or the author of the image. In this scheme only the super-user can reveal the original watermark. The proposed scheme is dynamic in the sense that to maintain the perceptual similarity between the original and the watermarked image the selected subband coefficients are modified by varying the watermark scaling factor. The experimental results demonstrate the effectiveness of the proposed scheme. Further, the proposed scheme is able to resist all common attacks even with strong amplitude.

Keywords:
VCS
Dithering
HVS
DWT.

Comparative Analysis of Diversity and Similarity Indices with Special Relevance to Vegetations around Sewage Drains

Year: 2012 Volume: 6 Issue: 9 609 - 611 Pages

Authors:
Ekta Singh

Abstract: Indices summarizing community structure are used to evaluate fundamental community ecology, species interaction, biogeographical factors, and environmental stress. Some of these indices are insensitive to gross community changes induced by contaminants of pollution. Diversity indices and similarity indices are reviewed considering their ecological application, both theoretical and practical. For some useful indices, empirical equations are given to calculate the expected maximum value of the indices to which the observed values can be related at any combination of sample sizes at the experimental sites. This paper examines the effects of sample size and diversity on the expected values of diversity indices and similarity indices, using various formulae. It has been shown that all indices are strongly affected by sample size and diversity. In some indices, this influence is greater than the others and an attempt has been made to deal with these influences.

Using Spectral Vectors and M-Tree for Graph Clustering and Searching in Graph Databases of Protein Structures

Year: 2009 Volume: 3 Issue: 8 2027 - 2032 Pages

Abstract: In this paper, we represent protein structure by using graph. A protein structure database will become a graph database. Each graph is represented by a spectral vector. We use Jacobi rotation algorithm to calculate the eigenvalues of the normalized Laplacian representation of adjacency matrix of graph. To measure the similarity between two graphs, we calculate the Euclidean distance between two graph spectral vectors. To cluster the graphs, we use M-tree with the Euclidean distance to cluster spectral vectors. Besides, M-tree can be used for graph searching in graph database. Our proposal method was tested with graph database of 100 graphs representing 100 protein structures downloaded from Protein Data Bank (PDB) and we compare the result with the SCOP hierarchical structure.

Top Journal

SUGGEST A JOURNAL