International Conference

Permanent URI for this collectionhttps://dspace.psgrkcw.com/handle/123456789/162

Browse

Author: search.filters.author.Arunpriya C

Search Results

Now showing 1 - 4 of 4
  • No Thumbnail Available
    Item
    A COMPARATIVE ANALYSIS OF WEB BASED MULTIPLE SEQUENCE ALIGNMENT TOOLS USING CERTAIN METABOLICALLY IMPORTANT PROTEIN CODING GENE SEQUENCES
    (Dr.NGP Arts and Science College, Coimbatore, 2018-09-02) Boobashini S; Arunpriya C; Balasaravanan T
    Multiple sequence alignment is an alignment of three or more biological sequences, generally protein, DNA, or RNA. The input set of query sequences are assumed to have an evolutionary relationship i.e., they are descended from a common ancestor. The resulting MSA, sequence homology can be inferred and phylogenetic analysis can be conducted to assess the sequences' shared evolutionary origins. In this paper, six different mammalian species gene sequence were compared with human gene sequences. Metabolically important genes such as Amylase, ATPase, Cytochrome-B, Haemoglobin, and Insulin where chosen for comparison. The DNA sequences of FASTA format was retrieved from NCBI databank and used as input sequences for Multiple sequence analysis using ClustalW, MUSCLE, and T-Coffee. Multiple sequence alignment score and phylogenetic trees where obtained from all the three tools and discussed with the snapshots and findings.
  • No Thumbnail Available
    Item
    AN EFFICIENT LEAF RECOGNITION ALGORITHM FOR PLANT CLASSIFICATION USING SUPPORT VECTOR MACHINE
    (Periyar University, Salem., 2012-03-21) Arunpriya C; Balasaravanan T; Antony Selvadoss Thanamani
    Recognition of plants has become an active area of research as most of the plant species are at the risk of extinction. This paper uses an efficient machine learning approach for the classification purpose. This proposed approach consists of three phases such as preprocessing, feature extraction and classification. The preprocessing phase involves a typical image processing steps such as transforming to gray scale and boundary enhancement. The feature extraction phase derives the common DMF from five fundamental features. The main contribution of this approach is the Support Vector Machine (SVM) classification for efficient leaf recognition. 12 leaf features which are extracted and orthogonalized into 5 principal variables are given as input vector to the SVM. Classifier tested with flavia dataset and a real dataset and compared with k-NN approach, the proposed approach produces very high accuracy and takes very less execution time.
  • No Thumbnail Available
    Item
    AN EFFICIENT CANCER CLASSIFICATION USING EXPRESSIONS OF VERY FEW GENES USING SUPPORT VECTOR MACHINE
    (Sun College of Engineering and Technology, Nagercoil, 2011-03-24) Arunpriya C; Balasaravanan T; Antony Selvadoss Thanamani
    Gene expression profiling by microarray technique has been effectively utilized for classification and diagnostic guessing of cancer nodules. Several machine learning and data mining techniques are presently applied for identifying cancer using gene expression data. Though, these techniques have not been proposed to deal with the particular needs of gene microarray examination. Initially, microarray data is featured by a high-dimensional feature space repeatedly surpassing the sample space dimensionality by a factor of 100 or higher. Additionally, microarray data contains a high degree of noise. The majority of the existing techniques do not sufficiently deal with the drawbacks like dimensionality and noise. Gene ranking method is later introduced to overcome those problems. Some of the widely used Gene ranking techniques are T-Score, ANOVA, etc. But those techniques will sometimes wrongly predict the rank when large database is used. To overcome these issues, this paper proposes a technique called Enrichment Score for ranking purpose. The classifier used in the proposed technique is Support Vector Machine (SVM). The experiment is performed on lymphoma data set and the result shows the better accuracy of classification when compared to the conventional method.
  • No Thumbnail Available
    Item
    FACIAL ANIMATION TECHNIQUE
    (PSGR Krishnammal College for Women, Coimbatore, 2011-10-01) Arunpriya C; Antony Selvadoss Thanamani
    An unsolved problem in computer graphics is the construction and animation of realistic human facial models. Traditionally, facial models have been built painstakingly by manual digitization and animated by ad hoc parametrically controlled facial mesh deformations or kinematics approximation of muscle actions. Fortunately, animators are now able to digitize facial geometries through the use of scanning range sensors and animate them through the dynamic simulation of facial tissues and muscles. However, these techniques require considerable user input to construct facial models of individuals suitable for animation polygonal modeling specifies exactly each 3d point, which connected to each other as polygons. This is an exacting way to get topology. Patches indirectly defines a smooth curve surface from a set of control points. A small amount of control points can define a complex surface. One type of spline is called NURBS, which stands for Non Uniform Rational B-Splines. This type of batch allows each control point to have its own weight that can affect the "pinch'" of the curve at the point. So they are considered the most versatile of batches. They work very well for organic smooth objects so hence they are well suited for facial modeling.