Low Complexity LID using Pruned Pattern Tables of LZW

We present two discriminative language modelling techniques for Lempel-Ziv-Welch (LZW) based LID system. The previous approach to LID using LZW algorithm was to directly use the LZW pattern tables forlanguage modelling. But, since the patterns in a language pattern table are shared by other language pattern tables, confusability prevailed in the LID task. For overcoming this, we present two pruning techniques (i) Language Specific (LS-LZW)-in which patterns common to more than one pattern table are removed. (ii) Length-Frequency product based (LF-LZW)-in which patterns having their length-frequency product below a threshold are removed. These approaches reduce the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score [LZW-WDS]) for non native languages and increases the LID performance considerably. Also the memory and computational requirements of these techniques are much less compared to basic LZW techniques.

Kernel-based spatial-color modeling for fast moving object tracking

Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.

Unraveling the packing pattern leading to gelation using SS NMR and X-ray diffraction: direct observation of the evolution of self-assembled fibers

A detailed understanding of the mode of packing patterns that leads to the gelation of low molecular mass gelators derived from bile acid esters was carried out using solid state NMR along with complementary techniques such as powder X-ray diffraction (PXRD), differential scanning calorimetry (DSC), thermogravimetric analysis (TGA) and polarizing optical microscopy (POM). Solid state C-13{H-1} cross polarization (CP) magic angle spinning (MAS) NMR of the low molecularmass gel in its native state was recorded for the first time. A close resemblance in the packing patterns of the gel, xerogel and bulk solid states was revealed upon comparing their C-13{H-1} CPMAS NMR spectral pattern. A doublet resonance pattern of C-13 signals in C-13{H-1}CPMAS NMR spectra were observed for the gelator molecules, whereas the non-gelators showed simple singlet resonance or resulted inthe formation of inclusion complexes/solvates. PXRD patterns revealed a close isomorphous nature of the gelators indicating the similarity in the mode of the packing pattern in their solid state. Direct imaging of the evolution of nanofibers (sol-gel transition) was carried out using POM, which proved the presence of self-assembled fibrillar networks (SAFINs) in the gel. Finally powder X-ray structure determination revealed the presence of two non-equivalent molecules in an asymmetric unit which is responsible for the doublet resonance pattern in the solid state NMR spectra.

A new approach for simple and rapid shape measurement of objects with surface discontinuities

A new approach for unwrapping phase maps, obtained during the measurement of 3-D surfaces using sinusoidal structured light projection technique, is proposed. "Takeda's method" is used to obtain the wrapped phase map. Proposed method of unwrapping makes use of an additional image of the object captured under the illumination of a specifically designed color-coded pattern. The new approach demonstrates, for the first time, a method of producing reliable unwrapping of objects even with surface discontinuities from a single-phase map. It is shown to be significantly faster and reliable than temporal phase unwrapping procedure that uses a complete exponential sequence. For example, if a measurement with the accuracy obtained by interrogating the object with S fringes in the projected pattern is carried out with both the methods, new method requires only 2 frames as compared to (log(2)S +1) frames required by the later method.

Novel composite coded pattern for small angle measurement using imaging method -art.no.62891D

A novel approach for measurement of small rotation angles using imaging method is proposed and demonstrated. A plane mirror placed on a precision rotating table is used for imaging the newly designed composite coded pattern. The imaged patterns are captured with the help of a CCD camera. The angular rotation of the plane mirror is determined from a pair of the images of the pattern, captured once before and once after affecting the tilt of the mirror. Both simulation and experimental results suggest that the proposed approach not only retains the advantages of the original imaging method but also contributes significantly to the enhancement of its measuring range (+/- 4.13 degrees with accuracy of the order of 1 arcsec).

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.

New phase unwrapping strategy for rapid and dense 3D data acquisition in structured light approach

Sinusoidal structured light projection (SSLP) technique, specifically-phase stepping method, is in widespread use to obtain accurate, dense 3-D data. But, if the object under investigation possesses surface discontinuities, phase unwrapping (an intermediate step in SSLP) stage mandatorily require several additional images, of the object with projected fringes (of different spatial frequencies), as input to generate a reliable 3D shape. On the other hand, Color-coded structured light projection (CSLP) technique is known to require a single image as in put, but generates sparse 3D data. Thus we propose the use of CSLP in conjunction with SSLP to obtain dense 3D data with minimum number of images as input. This approach is shown to be significantly faster and reliable than temporal phase unwrapping procedure that uses a complete exponential sequence. For example, if a measurement with the accuracy obtained by interrogating the object with 32 fringes in the projected pattern is carried out with both the methods, new strategy proposed requires only 5 frames as compared to 24 frames required by the later method.

Multi-Pattern Viterbi Algorithm for joint decoding of multiple speech patterns

Joint decoding of multiple speech patterns so as to improve speech recognition performance is important, especially in the presence of noise. In this paper, we propose a Multi-Pattern Viterbi algorithm (MPVA) to jointly decode and recognize multiple speech patterns for automatic speech recognition (ASR). The MPVA is a generalization of the Viterbi Algorithm to jointly decode multiple patterns given a Hidden Markov Model (HMM). Unlike the previously proposed two stage Constrained Multi-Pattern Viterbi Algorithm (CMPVA),the MPVA is a single stage algorithm. MPVA has the advantage that it cart be extended to connected word recognition (CWR) and continuous speech recognition (CSR) problems. MPVA is shown to provide better speech recognition performance than the earlier techniques: using only two repetitions of noisy speech patterns (-5 dB SNR, 10% burst noise), the word error rate using MPVA decreased by 28.5%, when compared to using individual decoding. (C) 2010 Elsevier B.V. All rights reserved.

Nonlinear programming solutions for controlling the vibration pattern of stretched strings

The problem of controlling the vibration pattern of a driven string is considered. The basic question dealt with here is to find the control forces which reduce the energy of vibration of a driven string over a prescribed portion of its length while maintaining the energy outside that length above a desired value. The criterion of keeping the response outside the region of energy reduction as close to the original response as possible is introduced as an additional constraint. The slack unconstrained minimization technique (SLUMT) has been successfully applied to solve the above problem. The effect of varying the phase of the control forces (which results in a six-variable control problem) is then studied. The nonlinear programming techniques which have been effectively used to handle problems involving many variables and constraints therefore offer a powerful tool for the solution of vibration control problems.

Tyrphostin-A47 inhibitable tyrosine phosphorylation of flagellar proteins is associated with distinct alteration of motility pattern in hamster spermatozoa

To acquire fertilizing potential, mammalian spermatozoa must undergo capacitation and acrosome reaction. Our earlier work showed that pentoxifylline (0.45 mM), a sperm motility stimulant, induced an early onset of hamster sperm capacitation associated with tyrosine phosphorylation of 45-80 kDa proteins, localized to the mid-piece of the sperm tail. To assess the role of protein tyrosine phosphorylation in sperm capacitation, we used tyrphostin-A47 (TP-47), a specific protein tyrosine kinase inhibitor. The dose-dependent (0.1-0.5 mM) inhibition of tyrosine phosphorylation by TP-47 was associated with inhibition of hyperactivated motility and 0.5 mM TP-47-treated spermatozoa exhibited a distinct circular motility pattern. This was accompanied by hypo-tyrosine phosphorylation of 45-60 kDa proteins, localized to the principal piece of the intact-sperm and the outer dense fiber-like structures in detergent treated-sperm. Sperm kinematic analysis (by CASA) of spermatozoa, exhibiting circular motility (at 1st hr), showed lower values of straight line velocity, curvilinear velocity and average path velocity, compared to untreated controls. Other TP-47 analogues, tyrphostin-AG1478 and -AG1296, had no effect either on kinematic parameters or sperm protein tyrosine phosphorylation. These studies indicate that TP-47-induced circular motility of spermatozoa is compound-specific and that the tyrosine phosphorylation status of 45-60 kDa flagellum-localized proteins could be key regulators of sperm flagellar bending pattern, associated with the hyperactivation of hamster spermatozoa.

A heuristic clustering algorithm using union of overlapping pattern-cells

Relative geometric arrangements of the sample points, with reference to the structure of the imbedding space, produce clusters. Hence, if each sample point is imagined to acquire a volume of a small M-cube (called pattern-cell), depending on the ranges of its (M) features and number (N) of samples; then overlapping pattern-cells would indicate naturally closer sample-points. A chain or blob of such overlapping cells would mean a cluster and separate clusters would not share a common pattern-cell between them. The conditions and an analytic method to find such an overlap are developed. A simple, intuitive, nonparametric clustering procedure, based on such overlapping pattern-cells is presented. It may be classified as an agglomerative, hierarchical, linkage-type clustering procedure. The algorithm is fast, requires low storage and can identify irregular clusters. Two extensions of the algorithm, to separate overlapping clusters and to estimate the nature of pattern distributions in the sample space, are also indicated.

A knowledge-based approach to pattern generation

Pattern Cognition is looked at from the functional view point. The need for knowledge in synthesizing such patterns is explained and various aspects of knowledge-based pattern generation are highlighted. This approach to the generation of patterns is detailed with a concrete example.