Comparison Of If Estimation Methods For Noise Robustness

Non-stationary signal modeling is a well addressed problem in the literature. Many methods have been proposed to model non-stationary signals such as time varying linear prediction and AM-FM modeling, the later being more popular. Estimation techniques to determine the AM-FM components of narrow-band signal, such as Hilbert transform, DESA1, DESA2, auditory processing approach, ZC approach, etc., are prevalent but their robustness to noise is not clearly addressed in the literature. This is critical for most practical applications, such as in communications. We explore the robustness of different AM-FM estimators in the presence of white Gaussian noise. Also, we have proposed three new methods for IF estimation based on non-uniform samples of the signal and multi-resolution analysis. Experimental results show that ZC based methods give better results than the popular methods such as DESA in clean condition as well as noisy condition.

A comparative study of speaker adaptation methods

For the problem of speaker adaptation in speech recognition, the performance depends on the availability of adaptation data. In this paper, we have compared several existing speaker adaptation methods, viz. maximum likelihood linear regression (MLLR), eigenvoice (EV), eigenspace-based MLLR (EMLLR), segmental eigenvoice (SEV) and hierarchical eigenvoice (HEV) based methods. We also develop a new method by modifying the existing HEV method for achieving further performance improvement in a limited available data scenario. In the sense of availability of adaptation data, the new modified HEV (MHEV) method is shown to perform better than all the existing methods throughout the range of operation except the case of MLLR at the availability of more adaptation data.

Edge-based connected component approach for skew correction of complex document images

Skew correction of complex document images is a difficult task. We propose an edge-based connected component approach for robust skew correction of documents with complex layout and content. The algorithm essentially consists of two steps - an 'initialization' step to determine the image orientation from the centroids of the connected components and a 'search' step to find the actual skew of the image. During initialization, we choose two different sets of points regularly spaced across the the image, one from the left to right and the other from top to bottom. The image orientation is determined from the slope between the two succesive nearest neighbors of each of the points in the chosen set. The search step finds succesive nearest neighbors that satisfy the parameters obtained in the initialization step. The final skew is determined from the slopes obtained in the 'search' step. Unlike other connected component based methods, the proposed method does not require any binarization step that generally precedes connected component analysis. The method works well for scanned documents with complex layout of any skew with a precision of 0.5 degrees.

A model based factorization approach for dense 3D recovery from monocular video

Feature track matrix factorization based methods have been attractive solutions to the Structure-front-motion (Sfnl) problem. Group motion of the feature points is analyzed to get the 3D information. It is well known that the factorization formulations give rise to rank deficient system of equations. Even when enough constraints exist, the extracted models are sparse due the unavailability of pixel level tracks. Pixel level tracking of 3D surfaces is a difficult problem, particularly when the surface has very little texture as in a human face. Only sparsely located feature points can be tracked and tracking error arc inevitable along rotating lose texture surfaces. However, the 3D models of an object class lie in a subspace of the set of all possible 3D models. We propose a novel solution to the Structure-from-motion problem which utilizes the high-resolution 3D obtained from range scanner to compute a basis for this desired subspace. Adding subspace constraints during factorization also facilitates removal of tracking noise which causes distortions outside the subspace. We demonstrate the effectiveness of our formulation by extracting dense 3D structure of a human face and comparing it with a well known Structure-front-motion algorithm due to Brand.

Suitability of a point-contact SAW-based stiffness transducer for biomedical applications

Methods of diagnosis in Biomedical applications can be broadly divided into contact and non-contact based methods. So far, ultrasound based methods have been found to be most favorable for non-contact, non-invasive diagnosis, especially in the case of tissue stiffness analysis. We report here, the fabrication and characterization details of a new contact based transducer system for qualitative determination of the stiffnesses of non-piezoelectric substrates using the phenomenon of Surface Acoustic Waves (SAW). Preliminary trials to study the functionality of this system were carried out on various metallic and non-metallic substrates, and the results were found to be satisfactory. To confirm the suitability of this system for biomedical applications, similar trials have been conducted on tissue mimicking phantoms with varying degrees of stiffness.

Molecular markers for discriminating Streptococcus pyogenes and S.dysgalactiae subspecies equisimilis

Given the increasing aetiological importance of Streptococcus dysgalactiae subspecies equisimilis in diseases which are primarily attributed to S. pyogenes, molecular markers are essential to distinguish these species and delineate their epidemiology more precisely. Many clinical microbiology laboratories rely on agglutination reactivity and biochemical tests to distinguish them. These methods have limitations which are particularly exacerbated when isolates with mixed properties are encountered. In order to provide additional distinguishing parameters that could be used to unequivocally discriminate these two common pathogens, we assess here three molecular targets: the speB gene, intergenic region upstream of the scpG gene (IRSG) and virPCR. Of these, the former two respectively gave positive and negative results for S. pyogenes, and negative and positive results for S. dysgalactiae subsp. equisimilis. Thus,a concerted use of these nucleic acid-based methods is particularly helpful in epidemiological surveillance to accurately assess the relative contribution of these species to streptococcal infections and diseases.

Site characterization model using least-square support vector machine and relevance vector machine based on corrected SPT data (N-c)

Statistical learning algorithms provide a viable framework for geotechnical engineering modeling. This paper describes two statistical learning algorithms applied for site characterization modeling based on standard penetration test (SPT) data. More than 2700 field SPT values (N) have been collected from 766 boreholes spread over an area of 220 sqkm area in Bangalore. To get N corrected value (N,), N values have been corrected (Ne) for different parameters such as overburden stress, size of borehole, type of sampler, length of connecting rod, etc. In three-dimensional site characterization model, the function N-c=N-c (X, Y, Z), where X, Y and Z are the coordinates of a point corresponding to N, value, is to be approximated in which N, value at any half-space point in Bangalore can be determined. The first algorithm uses least-square support vector machine (LSSVM), which is related to aridge regression type of support vector machine. The second algorithm uses relevance vector machine (RVM), which combines the strengths of kernel-based methods and Bayesian theory to establish the relationships between a set of input vectors and a desired output. The paper also presents the comparative study between the developed LSSVM and RVM model for site characterization. Copyright (C) 2009 John Wiley & Sons,Ltd.

Accelerated gradient based diffuse optical tomographic image reconstruction

Purpose: Fast reconstruction of interior optical parameter distribution using a new approach called Broyden-based model iterative image reconstruction (BMOBIIR) and adjoint Broyden-based MOBIIR (ABMOBIIR) of a tissue and a tissue mimicking phantom from boundary measurement data in diffuse optical tomography (DOT). Methods: DOT is a nonlinear and ill-posed inverse problem. Newton-based MOBIIR algorithm, which is generally used, requires repeated evaluation of the Jacobian which consumes bulk of the computation time for reconstruction. In this study, we propose a Broyden approach-based accelerated scheme for Jacobian computation and it is combined with conjugate gradient scheme (CGS) for fast reconstruction. The method makes explicit use of secant and adjoint information that can be obtained from forward solution of the diffusion equation. This approach reduces the computational time many fold by approximating the system Jacobian successively through low-rank updates. Results: Simulation studies have been carried out with single as well as multiple inhomogeneities. Algorithms are validated using an experimental study carried out on a pork tissue with fat acting as an inhomogeneity. The results obtained through the proposed BMOBIIR and ABMOBIIR approaches are compared with those of Newton-based MOBIIR algorithm. The mean squared error and execution time are used as metrics for comparing the results of reconstruction. Conclusions: We have shown through experimental and simulation studies that Broyden-based MOBIIR and adjoint Broyden-based methods are capable of reconstructing single as well as multiple inhomogeneities in tissue and a tissue-mimicking phantom. Broyden MOBIIR and adjoint Broyden MOBIIR methods are computationally simple and they result in much faster implementations because they avoid direct evaluation of Jacobian. The image reconstructions have been carried out with different initial values using Newton, Broyden, and adjoint Broyden approaches. These algorithms work well when the initial guess is close to the true solution. However, when initial guess is far away from true solution, Newton-based MOBIIR gives better reconstructed images. The proposed methods are found to be stable with noisy measurement data. (C) 2011 American Association of Physicists in Medicine. DOI: 10.1118/1.3531572]

Finite data performance of MUSIC and minimum norm methods

In the direction of arrival (DOA) estimation problem, we encounter both finite data and insufficient knowledge of array characterization. It is therefore important to study how subspace-based methods perform in such conditions. We analyze the finite data performance of the multiple signal classification (MUSIC) and minimum norm (min. norm) methods in the presence of sensor gain and phase errors, and derive expressions for the mean square error (MSE) in the DOA estimates. These expressions are first derived assuming an arbitrary array and then simplified for the special case of an uniform linear array with isotropic sensors. When they are further simplified for the case of finite data only and sensor errors only, they reduce to the recent results given in [9-12]. Computer simulations are used to verify the closeness between the predicted and simulated values of the MSE.

Partial instantiation methods for inference in first-order logic

Satisfiability algorithms for propositional logic have improved enormously in recently years. This improvement increases the attractiveness of satisfiability methods for first-order logic that reduce the problem to a series of ground-level satisfiability problems. R. Jeroslow introduced a partial instantiation method of this kind that differs radically from the standard resolution-based methods. This paper lays the theoretical groundwork for an extension of his method that is general enough and efficient enough for general logic programming with indefinite clauses. In particular we improve Jeroslow's approach by (1) extending it to logic with functions, (2) accelerating it through the use of satisfiers, as introduced by Gallo and Rago, and (3) simplifying it to obtain further speedup. We provide a similar development for a "dual" partial instantiation approach defined by Hooker and suggest a primal-dual strategy. We prove correctness of the primal and dual algorithms for full first-order logic with functions, as well as termination on unsatisfiable formulas. We also report some preliminary computational results.

Subspace Based Speech Enhancement Using Gaussian Mixture Model

Traditional subspace based speech enhancement (SSE)methods use linear minimum mean square error (LMMSE) estimation that is optimal if the Karhunen Loeve transform (KLT) coefficients of speech and noise are Gaussian distributed. In this paper, we investigate the use of Gaussian mixture (GM) density for modeling the non-Gaussian statistics of the clean speech KLT coefficients. Using Gaussian mixture model (GMM), the optimum minimum mean square error (MMSE) estimator is found to be nonlinear and the traditional LMMSE estimator is shown to be a special case. Experimental results show that the proposed method provides better enhancement performance than the traditional subspace based methods.Index Terms: Subspace based speech enhancement, Gaussian mixture density, MMSE estimation.

Subspace-based DOA estimation using Fractional Lower Order statistics

Direction Of Arrival (DOA) estimation, using a sensor array, in the presence of non-Gaussian noise using Fractional Lower-Order Moments (FLOM)matrices is studied. In this paper, a new FLOM based technique using the Fractional Lower Order Infinity Norm based Covariance (FLIC) Matrix is proposed. The bounded property and the low-rank subspace structure of the FLIC matrix is derived. Performance of FLIC based DOA estimation using MUSIC, ESPRIT, is shown to be better than other FLOM based methods.

Process Development for Functionalization of Cotton with Silver Nanoparticles Synthesized by Bio-based Approaches

Cotton is a widely used raw material for textiles but drawbacks regarding their poor mechanical properties often limit their applications as functional materials. The present investigation involved process development for one step coating of cotton with silver nanoparticles (SNP) synthesized using Azadirachta indica and Citrus limon extract to develop functional textiles. Addition of starch to functional textiles led to efficient binding of nanoparticles to fabric and led to drastic decrease in release of silver from fabricated textiles after ten washing cycles enhancing their environment friendliness. Differential scanning calorimetry, scanning electron microscopy, FT-IR analysis and mechanical studies demonstrated efficient binding of nanoparticles to fabric through bio-based processes. The functionalized textiles developed by the bio-based methods showed significant antibacterial activity against E. coli and S. aureus (with 99% microbial reduction). Present work offers a simple procedure for coating SNP using bio-based approaches with promising applications in specialized functions.

Pattern-growth based frequent serial episode discovery

Frequent episode discovery is a popular framework for pattern discovery from sequential data. It has found many applications in domains like alarm management in telecommunication networks, fault analysis in the manufacturing plants, predicting user behavior in web click streams and so on. In this paper, we address the discovery of serial episodes. In the episodes context, there have been multiple ways to quantify the frequency of an episode. Most of the current algorithms for episode discovery under various frequencies are apriori-based level-wise methods. These methods essentially perform a breadth-first search of the pattern space. However currently there are no depth-first based methods of pattern discovery in the frequent episode framework under many of the frequency definitions. In this paper, we try to bridge this gap. We provide new depth-first based algorithms for serial episode discovery under non-overlapped and total frequencies. Under non-overlapped frequency, we present algorithms that can take care of span constraint and gap constraint on episode occurrences. Under total frequency we present an algorithm that can handle span constraint. We provide proofs of correctness for the proposed algorithms. We demonstrate the effectiveness of the proposed algorithms by extensive simulations. We also give detailed run-time comparisons with the existing apriori-based methods and illustrate scenarios under which the proposed pattern-growth algorithms perform better than their apriori counterparts. (C) 2013 Elsevier B.V. All rights reserved.

Importance of amino-terminus in maintenance of oligomeric structure of cytosolic serine hydroxymethyltransferase

The role of the amino and carboxyl-terminal regions of cytosolic serine hydroxymethyltransferase (SHMT) in subunit assembly and catalysis was studied using six amino-terminal (lacking the first 6, 14, 30, 49, 58, and 75 residues) and two carboxyl-terminal (lacking the last 49 and 185 residues) deletion mutants. These mutants were constructed from a full length cDNA clone using restriction enzyme/PCR-based methods and overexpressed in Escherichia coli. The overexpressed proteins, des-(A1-K6)-SHMT and des-(A1- W14)-SHMT were present in the soluble fraction and they were purified to homogeneity. The deletion clones, for des-(A1–V30)-SHMT and des-(A1–L49)-SHMT were expressed at very low levels, whereas des-(A1–R58)-SHMT, des-(A1–G75)-SHMT, des-(Q435–F483)-SHMT and des-(L299-F483)-SHMT mutant proteins were not soluble and formed inclusion bodies. Des-(A1–K6)-SHMT and des-(A1–W14)-SHMT catalyzed both the tetrahydrofolate-dependent and tetrahydrofolate-independent reactions, generating characteristic spectral intermediates with glycine and tetrahydrofolate. The two mutants had similar kinetic parameters to that of the recombinant SHMT (rSHMT). However, at 55 °C, the des-(A1–W14)-SHMT lost almost all the activity within 5 min, while at the same temperature rSHMT and des-(A1–K6)-SHMT retained 85% and 70% activity, respectively. Thermal denaturation studies showed that des-(A1–W14)-SHMT had a lower apparent melting temperature (52°C) compared to rSHMT (56°C) and des-(A1–K6)-SHMT (55 °C), suggesting that N-terminal deletion had resulted in a decrease in the thermal stability of the enzyme. Further, urea induced inactivation of the enzymes revealed that 50% inactivation occurred at a lower urea concentration (1.2 ± 0.1 M) in the case of des-(A1–W14)-SHMT compared to rSHMT (1.8 ±0.1 M) and des-(A1–K6)-SHMT (1.7 ±0.1 M). The apoenzyme of des-(A1- W14)-SHMT was present predominantly in the dimer form, whereas the apoenzymes of rSHMT and des-(A1–K6)-SHMT were a mixture of tetramers (≈75% and ≈65%, respectively) and dimers. While, rSHMT and des-(A1–K6)-SHMT apoenzymes could be reconstituted upon the addition of pyridoxal-5'-phosphate to 96% and 94% enzyme activity, respectively, des-(A1–W14)-SHMT apoenzyme could be reconstituted only upto 22%. The percentage activity regained correlated with the appearance of visible CD at 425 nm and with the amount of enzyme present in the tetrameric form upon reconstitution as monitored by gel filtration. These results demonstrate that, in addition to the cofactor, the N-terminal arm plays an important role in stabilizing the tetrameric structure of SHMT.