Joint decoding of multiple speech patterns for robust speech recognition

We are addressing a new problem of improving automatic speech recognition performance, given multiple utterances of patterns from the same class. We have formulated the problem of jointly decoding K multiple patterns given a single Hidden Markov Model. It is shown that such a solution is possible by aligning the K patterns using the proposed Multi Pattern Dynamic Time Warping algorithm followed by the Constrained Multi Pattern Viterbi Algorithm The new formulation is tested in the context of speaker independent isolated word recognition for both clean and noisy patterns. When 10 percent of speech is affected by a burst noise at -5 dB Signal to Noise Ratio (local), it is shown that joint decoding using only two noisy patterns reduces the noisy speech recognition error rate to about 51 percent, when compared to the single pattern decoding using the Viterbi Algorithm. In contrast a simple maximization of individual pattern likelihoods, provides only about 7 percent reduction in error rate.

Learning Feature Trajectories Using Gabor Filter Bank for Human Activity Segmentation and Recognition

We describe a novel method for human activity segmentation and interpretation in surveillance applications based on Gabor filter-bank features. A complex human activity is modeled as a sequence of elementary human actions like walking, running, jogging, boxing, hand-waving etc. Since human silhouette can be modeled by a set of rectangles, the elementary human actions can be modeled as a sequence of a set of rectangles with different orientations and scales. The activity segmentation is based on Gabor filter-bank features and normalized spectral clustering. The feature trajectories of an action category are learnt from training example videos using dynamic time warping. The combined segmentation and the recognition processes are very efficient as both the algorithms share the same framework and Gabor features computed for the former can be used for the later. We have also proposed a simple shadow detection technique to extract good silhouette which is necessary for good accuracy of an action recognition technique.

Recognition of active and inactive catalytic triads: A template based approach

It Is well established that a sequence template along with the database is a powerful tool for identifying the biological function of proteins. Here, we describe a method for predicting the catalytic nature of certain proteins among the several protein structures deposited in the Protein Data Bank (PDB) For the present study, we considered a catalytic triad template (Ser-His-Asp) found in serine proteases We found that a geometrically optimized active site template can be used as a highly selective tool for differentiating an active protein among several inactive proteins, based on their Ser-His-Asp interactions. For any protein to be proteolytic in nature, the bond angle between Ser O-gamma-Ser H-gamma His N-epsilon 2 in the catalytic triad needs to be between 115 degrees and 140 degrees The hydrogen bond distance between Ser H-gamma His N-epsilon 2 is more flexible in nature and it varies from 2 0 angstrom to 27 angstrom while in the case of His H-delta 1 Asp O-delta 1, it is from 1.6 angstrom to 2.0 angstrom In terms of solvent accessibility, most of the active proteins lie in the range of 10-16 angstrom(2), which enables easy accessibility to the substrate These observations hold good for most catalytic triads and they can be employed to predict proteolytic nature of these catalytic triads (C) 2010 Elsevier B V All rights reserved.

Online association policies in IEEE 802.11 WLANs

In this paper, we study the performance of client-Access Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with whom they can associate. We are interested in finding association policies which lead to optimal system performance. More specifically, we study the stability of different association policies as a function of the spatial distribution of arriving clients. We find for each policy the range of client arrival rates for which the system is stable. For small networks, we use Lyapunov function methods to formally establish the stability or instability of certain policies in specific scenarios. The RAT heuristic policy introduced in our prior work is shown to have very good stability properties when compared to several other natural policies. We also validate our analytical results by detailed simulation employing the IEEE 802.11 MAC.

Online client-AP association in WLANs

In many IEEE 802.11 WLAN deployments, wireless clients have a choice of access points (AP) to connect to. In current systems, clients associate with the access point with the strongest signal to noise ratio. However, such an association mechanism can lead to unequal load sharing, resulting in diminished system performance. In this paper, we first provide a numerical approach based on stochastic dynamic programming to find the optimal client-AP association algorithm for a small topology consisting of two access points. Using the value iteration algorithm, we determine the optimal association rule for the two-AP topology. Next, utilizing the insights obtained from the optimal association ride for the two-AP case, we propose a near-optimal heuristic that we call RAT. We test the efficacy of RAT by considering more realistic arrival patterns and a larger topology. Our results show that RAT performs very well in these scenarios as well. Moreover, RAT lends itself to a fairly simple implementation.

Probing Fluorine Interactions in a Polyhydroxylated Environment: Conservation of a C-F center dot center dot center dot H-C Recognition Motif in Presence of O-H center dot center dot center dot O Hydrogen Bonds

Three conformationally locked fluorinated polycyclitols have been specially crafted on a rigid trans-decalin backbone, employing a surprisingly facile pyridine-poly(hydrogen fluoride)-mediated stereospecific epoxide ring opening as the key reaction. Molecula design of the three fluorinated probes under study focused on providing an efficient platform for (a) evaluating the ability of covalently bonded fluorine, vis-a-vis the isosteric hydroxy group, to act as a H-bond acceptor and (b) examining the possibility for an organic fluorine moiety, placed suitably in a spatially invariant position, to engage an 1,3-diaxial OH functionality in a purported intramolecular O-H center dot center dot center dot F hydrogen bond. The present endeavour reveals that C(sp(3))-F center dot center dot center dot H-C(sp(3)) hydrogen bonds, though weak and lesser investigated, can indeed be observed and supramolecular recognition motifs, involving such interactions, can be conserved even in crystal structures laden with stronger O-H center dot center dot center dot O hydrogen bonds.

Memory-based reasoning approach for pattern recognition of binary images

Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.

Plasticity in the primary binding site of galactose/N-acetylgalactosamine-specific lectins - Implication of the C-H center dot center dot center dot O hydrogen bond at the specificity-determining C-4 locus of the saccharide in 4-methoxygalactose recognition by jacalin and winged bean (basic) agglutinin I

It is currently believed that an unsubstituted axial hydroxyl at the specificity-determining C-4 locus of galactose is indispensable for recognition by galactose/N-acetylgalactosamine-specific lectins. Titration calorimetry demonstrates that 4-methoxygalactose retains binding allegiance to the Moraceae lectin jacalin and the Leguminosae lectin, winged bean (basic) agglutinin (WBA I). The binding reactions were driven by dominant favorable enthalpic contributions and exhibited significant enthalpy-entropy compensation. Proton NMR titration of C-methoxygalactose with jacalin and WBA I resulted in broadening of the sugar resonances without any change in chemical shift. The alpha-and beta-anomers of 4-methoxygalactose were found to be in slow exchange with free and lectin-bound states. Both the anomers experience magnetically equivalent environments at the respective binding sites. The binding constants derived from the dependence of NMR line widths on 4-methoxygalactose concentration agreed well with those obtained from titration calorimetry. The results unequivocally demonstrate that the loci corresponding to the axially oriented C-4 hydroxyl group of galactose within the primary binding site of these lectins exhibit plasticity. These analyses suggest, for the first time, the existence of C-H ... O-type hydrogen-bond(s) in protein-carbohydrate interactions in general and between the C-4 locus of galactose derivative and the lectins jacalin and WBA I in particular.

CHITRA: Cognitive handprinted input-trained recursively analyzing system for recognition of alphanumeric characters

A novel system for recognition of handprinted alphanumeric characters has been developed and tested. The system can be employed for recognition of either the alphabet or the numeral by contextually switching on to the corresponding branch of the recognition algorithm. The two major components of the system are the multistage feature extractor and the decision logic tree-type catagorizer. The importance of ldquogoodrdquo features over sophistication in the classification procedures was recognized, and the feature extractor is designed to extract features based on a variety of topological, morphological and similar properties. An information feedback path is provided between the decision logic and the feature extractor units to facilitate an interleaved or recursive mode of operation. This ensures that only those features essential to the recognition of a particular sample are extracted each time. Test implementation has demonstrated the reliability of the system in recognizing a variety of handprinted alphanumeric characters with close to 100% accuracy.

An online-implementable differential evolution tuned all-aspect guidance law

This paper proposes a differential evolution based method of improving the performance of conventional guidance laws at high heading errors, without resorting to techniques from optimal control theory, which are complicated and suffer from several limitations. The basic guidance law is augmented with a term that is a polynomial function of the heading error. The values of the coefficients of the polynomial are found by applying the differential evolution algorithm. The results are compared with the basic guidance law, and the all-aspect proportional navigation laws in the literature. A scheme for online implementation of the proposed law for application in practice is also given. (c) 2010 Elsevier Ltd. All rights reserved.

Artificial database for character recognition research

This paper describes a technique for artificial generation of learning and test sample sets suitable for character recognition research. Sample sets of English (Latin), Malayalam, Kannada and Tamil characters are generated easily through their prototype specifications by the endpoint co-ordinates, nature of segments and connectivity.

Ruthenium-Oxygen Coordination-Driven Self-Assembly of a Ru-8(II) Incomplete Prism: Synthesis, Structure, and Shape-Selective Molecular Recognition Study

Coordination-driven self-assembly of 1,3,5-benzenetricarboxylate (tma; 1) and oxalato-bridged p-cymeneruthenium(II) building block Ru-2(mu-eta(4)-C2O4)(MeOH)(2)(eta(6)-p-cymene)(2)](O3SCF3)(2) (2) affords an unusual octanuclear incomplete prism Ru-8(eta(6)-p-cymene)(8)(tma)(2)(mu-eta(4)-C2O4)(2)(OMe)(4)](O3SCF3)( 2) (3), which exhibits a remarkable shape-selective binding affinity for neutral phenolic compounds via hydrogen-bonding interactions (p-cymene = p-(PrC6H4Me)-Pr-i). Such a binding was confirmed by single-crystal X-ray diffraction analysis using 1,3,5-trihydroxybenzene as an analyte.

Character recognition — A review

The machine replication of human reading has been the subject of intensive research for more than three decades. A large number of research papers and reports have already been published on this topic. Many commercial establishments have manufactured recognizers of varying capabilities. Handheld, desk-top, medium-size and large systems costing as high as half a million dollars are available, and are in use for various applications. However, the ultimate goal of developing a reading machine having the same reading capabilities of humans still remains unachieved. So, there still is a great gap between human reading and machine reading capabilities, and a great amount of further effort is required to narrow-down this gap, if not bridge it. This review is organized into six major sections covering a general overview (an introduction), applications of character recognition techniques, methodologies in character recognition, research work in character recognition, some practical OCRs and the conclusions.