Now showing items 1-20 of 51
Next Page| Abstract: | Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is much richer, despite the fact that their diameter is at most 3. We also discuss almost self-centered graphs among partial cubes and among k-chordal graphs, classes of graphs that generalize median and chordal graphs, respectively. Characterizations of almost self-centered graphs among these two classes seem elusive |
| Description: | TAIWANESE JOURNAL OF MATHEMATICS Vol. 16, No. 5, pp. 1911-1922, October 2012 |
| URI: | http://dyuthi.cusat.ac.in/purl/4213 |
| Files | Size |
|---|---|
| Almost Self-Centered Median And Chordal Graphs.pdf | (225.6Kb) |
| Abstract: | Antimedian graphs are introduced as the graphs in which for every triple of vertices there exists a unique vertex x that maximizes the sum of the distances from x to the vertices of the triple. The Cartesian product of graphs is antimedian if and only if its factors are antimedian. It is proved that multiplying a non-antimedian vertex in an antimedian graph yields a larger antimedian graph. Thin even belts are introduced and proved to be antimedian. A characterization of antimedian trees is given that leads to a linear recognition algorithm. |
| URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2009 |
| Files | Size |
|---|---|
| Antimedian graphs.pdf | (151.5Kb) |
| Abstract: | This paper attempts to develop an improved tool, which would read two dimensional(2D) cardiac MRI images and compute areas and volume of the scar tissue. Here the computation would be done on the cardiac MR images to quantify the extent of damage inflicted by myocardial infarction on the cardiac muscle (myocardium) using Interpolation |
| Description: | PROCEEDINGS OF ICETECT 2011 |
| URI: | http://dyuthi.cusat.ac.in/purl/4236 |
| Files | Size |
|---|---|
| Area and Volume ... rt using Interpolation.pdf | (2.006Mb) |
| Abstract: | Learning disability (LD) is a neurological condition that affects a child’s brain and impairs his ability to carry out one or many specific tasks. LD affects about 10% of children enrolled in schools. There is no cure for learning disabilities and they are lifelong. The problems of children with specific learning disabilities have been a cause of concern to parents and teachers for some time. Just as there are many different types of LDs, there are a variety of tests that may be done to pinpoint the problem The information gained from an evaluation is crucial for finding out how the parents and the school authorities can provide the best possible learning environment for child. This paper proposes a new approach in artificial neural network (ANN) for identifying LD in children at early stages so as to solve the problems faced by them and to get the benefits to the students, their parents and school authorities. In this study, we propose a closest fit algorithm data preprocessing with ANN classification to handle missing attribute values. This algorithm imputes the missing values in the preprocessing stage. Ignoring of missing attribute values is a common trend in all classifying algorithms. But, in this paper, we use an algorithm in a systematic approach for classification, which gives a satisfactory result in the prediction of LD. It acts as a tool for predicting the LD accurately, and good information of the child is made available to the concerned |
| Description: | Neural Comput & Applic (2012) 21:1757–1763 DOI 10.1007/s00521-011-0619-1 |
| URI: | http://dyuthi.cusat.ac.in/purl/4206 |
| Files | Size |
|---|---|
| Attribute reduc ... learning disabilities.pdf | (286.9Kb) |
| Abstract: | Malayalam is one of the 22 scheduled languages in India with more than 130 million speakers. This paper presents a report on the development of a speaker independent, continuous transcription system for Malayalam. The system employs Hidden Markov Model (HMM) for acoustic modeling and Mel Frequency Cepstral Coefficient (MFCC) for feature extraction. It is trained with 21 male and female speakers in the age group ranging from 20 to 40 years. The system obtained a word recognition accuracy of 87.4% and a sentence recognition accuracy of 84%, when tested with a set of continuous speech data. |
| Description: | International Journal of Computer Applications (0975 – 8887) Volume 19– No.5, April 2011 |
| URI: | http://dyuthi.cusat.ac.in/purl/4200 |
| Files | Size |
|---|---|
| Automated Trans ... for Malayalam Language.pdf | (207.7Kb) |
| Abstract: | An antimedian of a pro le = (x1; x2; : : : ; xk) of vertices of a graph G is a vertex maximizing the sum of the distances to the elements of the pro le. The antimedian function is de ned on the set of all pro les on G and has as output the set of antimedians of a pro le. It is a typical location function for nding a location for an obnoxious facility. The `converse' of the antimedian function is the median function, where the distance sum is minimized. The median function is well studied. For instance it has been characterized axiomatically by three simple axioms on median graphs. The median function behaves nicely on many classes of graphs. In contrast the antimedian function does not have a nice behavior on most classes. So a nice axiomatic characterization may not be expected. In this paper such a characterization is obtained for the two classes of graphs on which the antimedian is well-behaved: paths and hypercubes. |
| Description: | Discrete Mathematics, Algorithms and Applications |
| URI: | http://dyuthi.cusat.ac.in/purl/4201 |
| Files | Size |
|---|---|
| Axiomatic Chara ... n Paths and Hypercubes.pdf | (173.6Kb) |
| Abstract: | There are several centrality measures that have been introduced and studied for real world networks. They account for the different vertex characteristics that permit them to be ranked in order of importance in the network. Betweenness centrality is a measure of the influence of a vertex over the flow of information between every pair of vertices under the assumption that information primarily flows over the shortest path between them. In this paper we present betweenness centrality of some important classes of graphs. |
| Description: | arXiv preprint arXiv:1403.4701 |
| URI: | http://dyuthi.cusat.ac.in/purl/4221 |
| Files | Size |
|---|---|
| Betweenness Cen ... Some Classes of Graphs.pdf | (197.9Kb) |
| Abstract: | In this paper, we propose a multispectral analysis system using wavelet based Principal Component Analysis (PCA), to improve the brain tissue classification from MRI images. Global transforms like PCA often neglects significant small abnormality details, while dealing with a massive amount of multispectral data. In order to resolve this issue, input dataset is expanded by detail coefficients from multisignal wavelet analysis. Then, PCA is applied on the new dataset to perform feature analysis. Finally, an unsupervised classification with Fuzzy C-Means clustering algorithm is used to measure the improvement in reproducibility and accuracy of the results. A detailed comparative analysis of classified tissues with those from conventional PCA is also carried out. Proposed method yielded good improvement in classification of small abnormalities with high sensitivity/accuracy values, 98.9/98.3, for clinical analysis. Experimental results from synthetic and clinical data recommend the new method as a promising approach in brain tissue analysis. |
| Description: | I.J. Image, Graphics and Signal Processing, 2013, 8, 29-36 |
| URI: | http://dyuthi.cusat.ac.in/purl/4229 |
| Files | Size |
|---|---|
| Brain Tissue Cl ... pal Component Analysis.pdf | (491.3Kb) |
| Abstract: | A primary medium for the human beings to communicate through language is Speech. Automatic Speech Recognition is wide spread today. Recognizing single digits is vital to a number of applications such as voice dialling of telephone numbers, automatic data entry, credit card entry, PIN (personal identification number) entry, entry of access codes for transactions, etc. In this paper we present a comparative study of SVM (Support Vector Machine) and HMM (Hidden Markov Model) to recognize and identify the digits used in Malayalam speech. |
| URI: | http://dyuthi.cusat.ac.in/purl/4232 |
| Files | Size |
|---|---|
| A Comparative s ... alam Digit Recognition.pdf | (200.2Kb) |
| Abstract: | The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes |
| Description: | Algorithmica (2010) 57: 207–216 DOI 10.1007/s00453-008-9200-4 |
| URI: | http://dyuthi.cusat.ac.in/purl/4193 |
| Files | Size |
|---|---|
| Computing median and antimedian sets in median.pdf | (290.4Kb) |
| Abstract: | A connected digit speech recognition is important in many applications such as automated banking system, catalogue-dialing, automatic data entry, automated banking system, etc. This paper presents an optimum speaker-independent connected digit recognizer forMalayalam language. The system employs Perceptual Linear Predictive (PLP) cepstral coefficient for speech parameterization and continuous density Hidden Markov Model (HMM) in the recognition process. Viterbi algorithm is used for decoding. The training data base has the utterance of 21 speakers from the age group of 20 to 40 years and the sound is recorded in the normal office environment where each speaker is asked to read 20 set of continuous digits. The system obtained an accuracy of 99.5 % with the unseen data. |
| Description: | Sadhana Vol. 38, Part 6, December 2013, pp. 1339–1346 |
| URI: | http://dyuthi.cusat.ac.in/purl/4227 |
| Files | Size |
|---|---|
| Connected digit ... for Malayalam language.pdf | (242.7Kb) |
| Abstract: | The median problem is a classical problem in Location Theory: one searches for a location that minimizes the average distance to the sites of the clients. This is for desired facilities as a distribution center for a set of warehouses. More recently, for obnoxious facilities, the antimedian was studied. Here one maximizes the average distance to the clients. In this paper the mixed case is studied. Clients are represented by a profile, which is a sequence of vertices with repetitions allowed. In a signed profile each element is provided with a sign from f+; g. Thus one can take into account whether the client prefers the facility (with a + sign) or rejects it (with a sign). The graphs for which all median sets, or all antimedian sets, are connected are characterized. Various consensus strategies for signed profiles are studied, amongst which Majority, Plurality and Scarcity. Hypercubes are the only graphs on which Majority produces the median set for all signed profiles. Finally, the antimedian sets are found by the Scarcity Strategy on e.g. Hamming graphs, Johnson graphs and halfcubes |
| Description: | Ars Math. Contemp. 6 (2013) 127–145 |
| URI: | http://dyuthi.cusat.ac.in/purl/4234 |
| Files | Size |
|---|---|
| Consensus strat ... ned profiles on graphs.pdf | (315.9Kb) |
| Abstract: | Retrieval of similar anatomical structures of brain MR images across patients would help the expert in diagnosis of diseases. In this paper, modified local binary pattern with ternary encoding called modified local ternary pattern (MOD-LTP) is introduced, which is more discriminant and less sensitive to noise in near-uniform regions, to locate slices belonging to the same level from the brain MR image database. The ternary encoding depends on a threshold, which is a user-specified one or calculated locally, based on the variance of the pixel intensities in each window. The variancebased local threshold makes the MOD-LTP more robust to noise and global illumination changes. The retrieval performance is shown to improve by taking region-based moment features of MODLTP and iteratively reweighting the moment features of MOD-LTP based on the user’s feedback. The average rank obtained using iterated and weighted moment features of MOD-LTP with a local variance-based threshold, is one to two times better than rotational invariant LBP (Unay, D., Ekin, A. and Jasinschi, R.S. (2010) Local structure-based region-of-interest retrieval in brain MR images. IEEE Trans. Inf. Technol. Biomed., 14, 897–903.) in retrieving the first 10 relevant images |
| Description: | The Computer Journal,bxu008 |
| URI: | http://dyuthi.cusat.ac.in/purl/4224 |
| Files | Size |
|---|---|
| Content-Based I ... ith a Ternary Encoding.pdf | (2.206Mb) |
| Abstract: | Magnetic Resonance Imaging play a vital role in the decision-diagnosis process of brain MR images. For an accurate diagnosis of brain related problems, the experts mostly compares both T1 and T2 weighted images as the information presented in these two images are complementary. In this paper, rotational and translational invariant form of Local binary Pattern (LBP) with additional gray scale information is used to retrieve similar slices of T1 weighted images from T2 weighted images or vice versa. The incorporation of additional gray scale information on LBP can extract more local texture information. The accuracy of retrieval can be improved by extracting moment features of LBP and reweighting the features based on users’ feedback. Here retrieval is done in a single subject scenario where similar images of a particular subject at a particular level are retrieved, and multiple subjects scenario where relevant images at a particular level across the subjects are retrieved |
| Description: | International Journal of Electrical, Robotics, Electronics and Communications Engineering Vol:7 No:8, 2013 |
| URI: | http://dyuthi.cusat.ac.in/purl/4233 |
| Files | Size |
|---|---|
| Content Based I ... ross Different Classes.pdf | (1.187Mb) |
| Abstract: | Content Based Image Retrieval is one of the prominent areas in Computer Vision and Image Processing. Recognition of handwritten characters has been a popular area of research for many years and still remains an open problem. The proposed system uses visual image queries for retrieving similar images from database of Malayalam handwritten characters. Local Binary Pattern (LBP) descriptors of the query images are extracted and those features are compared with the features of the images in database for retrieving desired characters. This system with local binary pattern gives excellent retrieval performance |
| Description: | Neural Computing and Applications Vol 21(7),pp 1757-1763 |
| URI: | http://dyuthi.cusat.ac.in/purl/4207 |
| Files | Size |
|---|---|
| Content Based I ... Handwritten Characters.pdf | (547.1Kb) |
| Abstract: | Cryptosystem using linear codes was developed in 1978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a modified version of cryptosystem using concepts of linear codes. But these systems were not used frequently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key size. Error detection and correction can be done efficiently by simple decoding methods using the cryptosystem developed. Approach: Algebraic geometric codes are codes, generated using curves. The cryptosystem use basic concepts of elliptic curves cryptography and generator matrix. Decrypted information takes the form of a repetition code. Due to this complexity of decoding procedure is reduced. Error detection and correction can be carried out efficiently by solving a simple system of linear equations, there by imposing the concepts of security along with error detection and correction. Results: Implementation of the algorithm is done on MATLAB and comparative analysis is also done on various parameters of the system. Attacks are common to all cryptosystems. But by securely choosing curve, field and representation of elements in field, we can overcome the attacks and a stable system can be generated. Conclusion: The algorithm defined here protects the information from an intruder and also from the error in communication channel by efficient error correction methods. |
| URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2007 |
| Files | Size |
|---|---|
| A Cryptosystem using....pdf | (93.25Kb) |
| Abstract: | Performance of any continuous speech recognition system is dependent on the accuracy of its acoustic model. Hence, preparation of a robust and accurate acoustic model lead to satisfactory recognition performance for a speech recognizer. In acoustic modeling of phonetic unit, context information is of prime importance as the phonemes are found to vary according to the place of occurrence in a word. In this paper we compare and evaluate the effect of context dependent tied (CD tied) models, context dependent (CD) and context independent (CI) models in the perspective of continuous speech recognition of Malayalam language. The database for the speech recognition system has utterance from 21 speakers including 11 female and 10 males. Our evaluation results show that CD tied models outperforms CI models over 21%. |
| Description: | Procedia Engineering,vol 30,pp 1081-1088 |
| URI: | http://dyuthi.cusat.ac.in/purl/4211 |
| Files | Size |
|---|---|
| Development & e ... ous speech recognition.pdf | (444.9Kb) |
| Abstract: | Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2 dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced. |
| Description: | Discrete Optimization 12 (2014) 150–154 |
| URI: | http://dyuthi.cusat.ac.in/purl/4220 |
| Files | Size |
|---|---|
| Equal opportuni ... raphs, and Wiener game.pdf | (367.3Kb) |
| Abstract: | Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kne, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed |
| Description: | arXiv preprint arXiv:1304.5378 |
| URI: | http://dyuthi.cusat.ac.in/purl/4230 |
| Files | Size |
|---|---|
| Fair Sets of Some Classes of Graphs.pdf | (443.4Kb) |
| Abstract: | Grey Level Co-occurrence Matrices (GLCM) are one of the earliest techniques used for image texture analysis. In this paper we defined a new feature called trace extracted from the GLCM and its implications in texture analysis are discussed in the context of Content Based Image Retrieval (CBIR). The theoretical extension of GLCM to n-dimensional gray scale images are also discussed. The results indicate that trace features outperform Haralick features when applied to CBIR. |
| Description: | International Journal of Computer Science, Engineering and Information Technology (IJCSEIT), Vol.2, No.2, April 2012 |
| URI: | http://dyuthi.cusat.ac.in/purl/4199 |
| Files | Size |
|---|---|
| Grey Level Co-O ... And Some New Features.pdf | (379.3Kb) |
Now showing items 1-20 of 51
Next PageDyuthi Digital Repository Copyright © 2007-2011 Cochin University of Science and Technology. Items in Dyuthi are protected by copyright, with all rights reserved, unless otherwise indicated.