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) |
Abstract: | Handwritten character recognition is always a frontier area of research in the field of pattern recognition and image processing and there is a large demand for OCR on hand written documents. Even though, sufficient studies have performed in foreign scripts like Chinese, Japanese and Arabic characters, only a very few work can be traced for handwritten character recognition of Indian scripts especially for the South Indian scripts. This paper provides an overview of offline handwritten character recognition in South Indian Scripts, namely Malayalam, Tamil, Kannada and Telungu |
Description: | National Conference on Indian Language Computing, Kochi, Feb 19-20, 2011 |
URI: | http://dyuthi.cusat.ac.in/purl/4191 |
Files | Size |
---|---|
Handwritten Cha ... ndian Scripts A Review.pdf | (189.7Kb) |
Abstract: | Few major Research works are going in the field of Handwriting Word Recognition (HWR) of Indian languages. This paper surveys the major works of offline/online handwritten word recognition. Techniques involved in word recognition are also discussed. Major works carried out in Bangla, Urdu, Tamil and Hindi are mentioned in this paper. Advancement towards HWR in other Indian languages are also discussed. Application of offline HWR is also discussed |
URI: | http://dyuthi.cusat.ac.in/purl/4223 |
Files | Size |
---|---|
HWR for Indian ... A Comprehensive Survey.pdf | (381.5Kb) |
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 15 % of children enrolled in schools. The prediction of LD is a vital and intricate job. The aim of this paper is to design an effective and powerful tool, using the two intelligent methods viz., Artificial Neural Network and Adaptive Neuro-Fuzzy Inference System, for measuring the percentage of LD that affected in school-age children. In this study, we are proposing some soft computing methods in data preprocessing for improving the accuracy of the tool as well as the classifier. The data preprocessing is performed through Principal Component Analysis for attribute reduction and closest fit algorithm is used for imputing missing values. The main idea in developing the LD prediction tool is not only to predict the LD present in children but also to measure its percentage along with its class like low or minor or major. The system is implemented in Mathworks Software MatLab 7.10. The results obtained from this study have illustrated that the designed prediction system or tool is capable of measuring the LD effectively |
Description: | Soft Comput (2014) 18:1093–1112 DOI 10.1007/s00500-013-1129-0 |
URI: | http://dyuthi.cusat.ac.in/purl/4219 |
Files | Size |
---|---|
Learning disabi ... ol using ANN and ANFIS.pdf | (2.950Mb) |
Abstract: | Axial brain slices containing similar anatomical structures are retrieved using features derived from the histogram of Local binary pattern (LBP). A rotation invariant description of texture in terms of texture patterns and their strength is obtained with the incorporation of local variance to the LBP, called Modified LBP (MOD-LBP). In this paper, we compare Histogram based Features of LBP (HF/LBP), against Histogram based Features of MOD-LBP (HF/MOD-LBP) in retrieving similar axial brain images. We show that replacing local histogram with a local distance transform based similarity metric further improves the performance of MOD-LBP based image retrieval |
Description: | 2012 IEEE International Conference on Computational Intelligence and Computing Research |
URI: | http://dyuthi.cusat.ac.in/purl/4205 |
Files | Size |
---|---|
Level Identific ... ogram of a LBP variant.pdf | (2.083Mb) |
Abstract: | Development of Malayalam speech recognition system is in its infancy stage; although many works have been done in other Indian languages. In this paper we present the first work on speaker independent Malayalam isolated speech recognizer based on PLP (Perceptual Linear Predictive) Cepstral Coefficient and Hidden Markov Model (HMM). The performance of the developed system has been evaluated with different number of states of HMM (Hidden Markov Model). The system is trained with 21 male and female speakers in the age group ranging from 19 to 41 years. The system obtained an accuracy of 99.5% with the unseen data |
Description: | International Journal of Advanced Information Technology (IJAIT) Vol. 1, No.5, October 2011 |
URI: | http://dyuthi.cusat.ac.in/purl/4214 |
Files | Size |
---|---|
Malayalam Isola ... P cepstral coefficient.pdf | (172.8Kb) |
Abstract: | The focus of this paper 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 hyperedge set of a hypergraph 𝐻, 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 𝐻. This paper also studies the concept of morphological adjunction on hypergraphs for which both the input and the output are hypergraphs |
Description: | ISRN Discrete Mathematics Volume 2014, Article ID 436419, 6 pages |
URI: | http://dyuthi.cusat.ac.in/purl/4222 |
Files | Size |
---|---|
Mathematical Mo ... peredge Correspondence.pdf | (2.544Mb) |
Abstract: | Following the Majority Strategy in graphs, other consensus strategies, namely Plurality Strategy, Hill Climbing and Steepest Ascent Hill Climbing strategies on graphs are discussed as methods for the computation of median sets of pro¯les. A review of algorithms for median computation on median graphs is discussed and their time complexities are compared. Implementation of the consensus strategies on median computation in arbitrary graphs is discussed |
Description: | Report/Econometric Institute, Erasmus University Rotterdam,EI 2007-34 |
URI: | http://dyuthi.cusat.ac.in/purl/4218 |
Files | Size |
---|---|
Median computat ... g consensus strategies.pdf | (195.4Kb) |
Abstract: | The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles. |
Description: | Discrete Applied Mathematics 156 (2008) 2882–2889 |
URI: | http://dyuthi.cusat.ac.in/purl/4216 |
Files | Size |
---|---|
The median func ... with bounded profiles.pdf | (410.2Kb) |
Abstract: | A periphery transversal of a median graph G is introduced as a set of vertices that meets all the peripheral subgraphs of G. Using this concept, median graphs with geodetic number 2 are characterized in two ways. They are precisely the median graphs that contain a periphery transversal of order 2 as well as the median graphs for which there exists a profile such that the remoteness function is constant on G. Moreover, an algorithm is presented that decides in O(mlog n) time whether a given graph G with n vertices and m edges is a median graph with geodetic number 2. Several additional structural properties of the remoteness function on hypercubes and median graphs are obtained and some problems listed |
Description: | University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Preprint series, Vol. 46 (2008), 1046 |
URI: | http://dyuthi.cusat.ac.in/purl/4237 |
Files | Size |
---|---|
Median Graphs, ... nd Geodetic Number Two.pdf | (256.4Kb) |
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: | A feasible way of implementing a temporal database is by mapping temporal data model onto a conventional data model followed by a commercial database management system. Even though extensions were proposed to standard SQL for supporting temporal databases, such proposals have not yet come across standardization processes. This paper attempts to implement database operators such as aggregates and universal quantifier for temporal databases, implemented on top of relational database systems, using currently available SQL standards. |
URI: | http://dyuthi.cusat.ac.in/xmlui/purl/2006 |
Files | Size |
---|---|
On Implementing Joins....pdf | (261.1Kb) |
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) |
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.