| Abstract: | A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors. |
| Description: | International Scholarly Research Network ISRN Discrete Mathematics Volume 2012, Article ID 583671, 8 pages doi:10.5402/2012/583671 |
| URI: | http://dyuthi.cusat.ac.in/purl/4212 |
| Files | Size |
|---|---|
| Median Sets and Median Number of a Graph.pdf | (1.907Mb) |
| Abstract: | The focus of this article is to develop computationally efficient mathematical morphology operators on hypergraphs. To this aim we consider lattice structures on hypergraphs on which we build morphological operators. We develop a pair of dual adjunctions between the vertex set and the hyper edge set of a hypergraph H, by defining a vertex-hyperedge correspondence. This allows us to recover the classical notion of a dilation/erosion of a subset of vertices and to extend it to subhypergraphs of H. Afterward, we propose several new openings, closings, granulometries and alternate sequential filters acting (i) on the subsets of the vertex and hyperedge set of H and (ii) on the subhypergraphs of a hypergraph |
| Description: | arXiv preprint arXiv:1402.4258 |
| URI: | http://dyuthi.cusat.ac.in/purl/4225 |
| Files | Size |
|---|---|
| Morphological filtering on hypergraphs.pdf | (203.1Kb) |
| Abstract: | Optical Character Recognition plays an important role in Digital Image Processing and Pattern Recognition. Even though ambient study had been performed on foreign languages like Chinese and Japanese, effort on Indian script is still immature. OCR in Malayalam language is more complex as it is enriched with largest number of characters among all Indian languages. The challenge of recognition of characters is even high in handwritten domain, due to the varying writing style of each individual. In this paper we propose a system for recognition of offline handwritten Malayalam vowels. The proposed method uses Chain code and Image Centroid for the purpose of extracting features and a two layer feed forward network with scaled conjugate gradient for classification |
| Description: | Emerging Trends in Electrical and Computer Technology (ICETECT), 2011 International Conference on |
| URI: | http://dyuthi.cusat.ac.in/purl/4196 |
| Files | Size |
|---|---|
| Offline Handwri ... n Chain Code Histogram.pdf | (1.324Mb) |
| Abstract: | For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes |
| Description: | arXiv preprint arXiv:1312.3182 |
| URI: | http://dyuthi.cusat.ac.in/purl/4226 |
| Files | Size |
|---|---|
| On The Center S ... of Some Graph Classes.pdf | (198.9Kb) |
| Abstract: | The set of vertices that maximize (minimize) the remoteness is the antimedian (median) set of the profile. It is proved that for an arbitrary graph G and S V (G) it can be decided in polynomial time whether S is the antimedian set of some profile. Graphs in which every antimedian set is connected are also considered. |
| URI: | http://dyuthi.cusat.ac.in/purl/4217 |
| Files | Size |
|---|---|
| On the generali ... blemantimedian subsets.pdf | (142.4Kb) |
| Abstract: | A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x 2 V.G/ the sum of distances from x to the vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary median graphs with respect to their isometric embeddings in hypercubes. In particular, a relation between the vertices in a median graph G whose remoteness function is maximum (antimedian set of G) with the antimedian set of the host hypercube is found. While for odd profiles the antimedian set is an independent set that lies in the strict boundary of a median graph, there exist median graphs in which special even profiles yield a constant remoteness function. We characterize such median graphs in two ways: as the graphs whose periphery transversal number is 2, and as the graphs with the geodetic number equal to 2. Finally, we present an algorithm that, given a graph G on n vertices and m edges, decides in O.mlog n/ time whether G is a median graph with geodetic number 2 |
| Description: | Discrete Applied Mathematics 157 (2009) 3679- 3688 |
| URI: | http://dyuthi.cusat.ac.in/purl/4197 |
| Files | Size |
|---|---|
| On the remoteness function in median graphs.pdf | (609.5Kb) |
| Abstract: | This work proposes a parallel genetic algorithm for compressing scanned document images. A fitness function is designed with Hausdorff distance which determines the terminating condition. The algorithm helps to locate the text lines. A greater compression ratio has achieved with lesser distortion |
| Description: | 2010 International Conference on Electronics and Information Engineering (ICEIE 2010) vol 2,V2-483-V2-487 |
| URI: | http://dyuthi.cusat.ac.in/purl/4215 |
| Files | Size |
|---|---|
| Parallel Geneti ... mpression Optimization.pdf | (793.8Kb) |
| Abstract: | Learning Disability (LD) is a classification including several disorders in which a child has difficulty in learning in a typical manner, usually caused by an unknown factor or factors. LD affects about 15% of children enrolled in schools. The prediction of learning disability is a complicated task since the identification of LD from diverse features or signs is a complicated problem. There is no cure for learning disabilities and they are life-long. The problems of children with specific learning disabilities have been a cause of concern to parents and teachers for some time. The aim of this paper is to develop a new algorithm for imputing missing values and to determine the significance of the missing value imputation method and dimensionality reduction method in the performance of fuzzy and neuro fuzzy classifiers with specific emphasis on prediction of learning disabilities in school age children. In the basic assessment method for prediction of LD, checklists are generally used and the data cases thus collected fully depends on the mood of children and may have also contain redundant as well as missing values. Therefore, in this study, we are proposing a new algorithm, viz. the correlation based new algorithm for imputing the missing values and Principal Component Analysis (PCA) for reducing the irrelevant attributes. After the study, it is found that, the preprocessing methods applied by us improves the quality of data and thereby increases the accuracy of the classifiers. The system is implemented in Math works Software Mat Lab 7.10. The results obtained from this study have illustrated that the developed missing value imputation method is very good contribution in prediction system and is capable of improving the performance of a classifier. |
| Description: | I.J. Intelligent Systems and Applications, 2013, 12, 34-52 |
| URI: | http://dyuthi.cusat.ac.in/purl/4209 |
| Files | Size |
|---|---|
| Performance Imp ... in School-age Children.pdf | (779.6Kb) |
| Abstract: | The Majority Strategy for finding medians of a set of clients on a graph can be relaxed in the following way: if we are at v, then we move to a neighbor w if there are at least as many clients closer to w than to v (thus ignoring the clients at equal distance from v and w). The graphs on which this Plurality Strategy always finds the set of all medians are precisely those for which the set of medians induces always a connected subgraph |
| Description: | Report/Econometric Institute, Erasmus University Rotterdam |
| URI: | http://dyuthi.cusat.ac.in/purl/4208 |
| Files | Size |
|---|---|
| The Plurality Strategy on Graphs.pdf | (149.0Kb) |
| Abstract: | This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabilities. By finding the relationship between these attributes, the redundant attributes can be eliminated and core attributes determined. Also, rule mining is performed in rough sets using the algorithm LEM1. The prediction of LD is accurately done by using Rosetta, the rough set tool kit for analysis of data. The result obtained from this study is compared with the output of a similar study conducted by us using Support Vector Machine (SVM) with Sequential Minimal Optimisation (SMO) algorithm. It is found that, using the concepts of reduct and global covering, we can easily predict the learning disabilities in children |
| Description: | International Journal of Computer and Electrical Engineering, Vol.3, No.1, February, 2011 1793-8163 |
| URI: | http://dyuthi.cusat.ac.in/purl/4194 |
| Files | Size |
|---|---|
| Prediction of K ... ldren Using Rough Sets.pdf | (1.457Mb) |
| Abstract: | This paper highlights the prediction of Learning Disabilities (LD) in school-age children using two classification methods, Support Vector Machine (SVM) and Decision Tree (DT), with an emphasis on applications of data mining. About 10% of children enrolled in school have a learning disability. Learning disability prediction in school age children is a very complicated task because it tends to be identified in elementary school where there is no one sign to be identified. By using any of the two classification methods, SVM and DT, we can easily and accurately predict LD in any child. Also, we can determine the merits and demerits of these two classifiers and the best one can be selected for the use in the relevant field. In this study, Sequential Minimal Optimization (SMO) algorithm is used in performing SVM and J48 algorithm is used in constructing decision trees. |
| Description: | (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (2) , 2011, 829-835 |
| URI: | http://dyuthi.cusat.ac.in/purl/4202 |
| Files | Size |
|---|---|
| Prediction of L ... SVM and Decision Tree.pdf | (385.3Kb) |
| Abstract: | The aim of this study is to show the importance of two classification techniques, viz. decision tree and clustering, in prediction of learning disabilities (LD) of school-age children. LDs affect about 10 percent of all children enrolled in schools. The problems of children with specific learning disabilities have been a cause of concern to parents and teachers for some time. Decision trees and clustering are powerful and popular tools used for classification and prediction in Data mining. Different rules extracted from the decision tree are used for prediction of learning disabilities. Clustering is the assignment of a set of observations into subsets, called clusters, which are useful in finding the different signs and symptoms (attributes) present in the LD affected child. In this paper, J48 algorithm is used for constructing the decision tree and K-means algorithm is used for creating the clusters. By applying these classification techniques, LD in any child can be identified |
| URI: | http://dyuthi.cusat.ac.in/purl/4192 |
| Files | Size |
|---|---|
| Significance Of ... Learning Disabilities.pdf | (200.4Kb) |
| Abstract: | The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H. |
| Description: | Networks vol 56(2),pp 90-94 |
| URI: | http://dyuthi.cusat.ac.in/purl/4203 |
| Files | Size |
|---|---|
| Simultaneous Em ... d Antimedian Subgraphs.pdf | (146.2Kb) |
| Abstract: | A spectral angle based feature extraction method, Spectral Clustering Independent Component Analysis (SC-ICA), is proposed in this work to improve the brain tissue classification from Magnetic Resonance Images (MRI). SC-ICA provides equal priority to global and local features; thereby it tries to resolve the inefficiency of conventional approaches in abnormal tissue extraction. First, input multispectral MRI is divided into different clusters by a spectral distance based clustering. Then, Independent Component Analysis (ICA) is applied on the clustered data, in conjunction with Support Vector Machines (SVM) for brain tissue analysis. Normal and abnormal datasets, consisting of real and synthetic T1-weighted, T2-weighted and proton density/fluid-attenuated inversion recovery images, were used to evaluate the performance of the new method. Comparative analysis with ICA based SVM and other conventional classifiers established the stability and efficiency of SC-ICA based classification, especially in reproduction of small abnormalities. Clinical abnormal case analysis demonstrated it through the highest Tanimoto Index/accuracy values, 0.75/98.8%, observed against ICA based SVM results, 0.17/96.1%, for reproduced lesions. Experimental results recommend the proposed method as a promising approach in clinical and pathological studies of brain diseases |
| Description: | Biomedical Signal Processing and Control 8 (2013) 667– 674 |
| URI: | http://dyuthi.cusat.ac.in/purl/4228 |
| Files | Size |
|---|---|
| Spectral cluste ... ication from brain MRI.pdf | (1.561Mb) |
| Abstract: | Digit speech recognition is important in many applications such as automatic data entry, PIN entry, voice dialing telephone, automated banking system, etc. This paper presents speaker independent speech recognition system for Malayalam digits. The system employs Mel frequency cepstrum coefficient (MFCC) as feature for signal processing and Hidden Markov model (HMM) for recognition. The system is trained with 21 male and female voices in the age group of 20 to 40 years and there was 98.5% word recognition accuracy (94.8% sentence recognition accuracy) on a test set of continuous digit recognition task. |
| Description: | Nature & Biologically Inspired Computing, 2009. NaBIC 2009. World Congress on |
| URI: | http://dyuthi.cusat.ac.in/purl/4190 |
| Files | Size |
|---|---|
| Speech Recognition of Malayalam Numbers.pdf | (243.0Kb) |
| Abstract: | A graph G is strongly distance-balanced if for every edge uv of G and every i 0 the number of vertices x with d.x; u/ D d.x; v/ 1 D i equals the number of vertices y with d.y; v/ D d.y; u/ 1 D i. It is proved that the strong product of graphs is strongly distance-balanced if and only if both factors are strongly distance-balanced. It is also proved that connected components of the direct product of two bipartite graphs are strongly distancebalanced if and only if both factors are strongly distance-balanced. Additionally, a new characterization of distance-balanced graphs and an algorithm of time complexity O.mn/ for their recognition, wheremis the number of edges and n the number of vertices of the graph in question, are given |
| Description: | European Journal of Combinatorics 30 (2009) 1048- 1053 |
| URI: | http://dyuthi.cusat.ac.in/purl/4198 |
| Files | Size |
|---|---|
| Strongly distan ... phs and graph products.pdf | (373.0Kb) |
| Abstract: | In this paper, we propose a handwritten character recognition system for Malayalam language. The feature extraction phase consists of gradient and curvature calculation and dimensionality reduction using Principal Component Analysis. Directional information from the arc tangent of gradient is used as gradient feature. Strength of gradient in curvature direction is used as the curvature feature. The proposed system uses a combination of gradient and curvature feature in reduced dimension as the feature vector. For classification, discriminative power of Support Vector Machine (SVM) is evaluated. The results reveal that SVM with Radial Basis Function (RBF) kernel yield the best performance with 96.28% and 97.96% of accuracy in two different datasets. This is the highest accuracy ever reported on these datasets |
| Description: | I.J. Image, Graphics and Signal Processing, 2013, 4, 53-59 |
| URI: | http://dyuthi.cusat.ac.in/purl/4204 |
| Files | Size |
|---|---|
| A System for Of ... rs in Malayalam Script.pdf | (535.2Kb) |
| Abstract: | Speckle noise formed as a result of the coherent nature of ultrasound imaging affects the lesion detectability. We have proposed a new weighted linear filtering approach using Local Binary Patterns (LBP) for reducing the speckle noise in ultrasound images. The new filter achieves good results in reducing the noise without affecting the image content. The performance of the proposed filter has been compared with some of the commonly used denoising filters. The proposed filter outperforms the existing filters in terms of quantitative analysis and in edge preservation. The experimental analysis is done using various ultrasound images |
| Description: | I.J. Information Technology and Computer Science, 2013, 06, 1-9 |
| URI: | http://dyuthi.cusat.ac.in/purl/4210 |
| Files | Size |
|---|---|
| Ultrasound Imag ... ghted Linear Filtering.pdf | (978.9Kb) |
| Abstract: | This paper presents the application of wavelet processing in the domain of handwritten character recognition. To attain high recognition rate, robust feature extractors and powerful classifiers that are invariant to degree of variability of human writing are needed. The proposed scheme consists of two stages: a feature extraction stage, which is based on Haar wavelet transform and a classification stage that uses support vector machine classifier. Experimental results show that the proposed method is effective |
| Description: | Procedia Engineering 30 (2012) 598 – 605 |
| URI: | http://dyuthi.cusat.ac.in/purl/4195 |
| Files | Size |
|---|---|
| Unconstrained H ... tor Machine Classifier.pdf | (442.7Kb) |
| Abstract: | In our study we use a kernel based classification technique, Support Vector Machine Regression for predicting the Melting Point of Drug – like compounds in terms of Topological Descriptors, Topological Charge Indices, Connectivity Indices and 2D Auto Correlations. The Machine Learning model was designed, trained and tested using a dataset of 100 compounds and it was found that an SVMReg model with RBF Kernel could predict the Melting Point with a mean absolute error 15.5854 and Root Mean Squared Error 19.7576 |
| Description: | PROCEEDINGS OF ICETECT 2011 |
| URI: | http://dyuthi.cusat.ac.in/purl/4235 |
| Files | Size |
|---|---|
| Using Neural Ne ... Drug – like compounds.pdf | (1.156Mb) |
Dyuthi 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.