published_or_final_version / abstract / Electrical and Electronic Engineering / Master / Master of Philosophy

(Uncorrected OCR) Abstract Abstract of thesis entitled Robust Statistics Based Adaptive Filtering Algorithms For Impulsive Noise Suppression Submitted by Yuexian Zou for the degree of Doctor of Philosophy at The University of Hong Kong in May 2000 The behavior of an adaptive filter is inherently decided by how its estimation error and the cost function are formulated under certain assumption of the involving signal statistics. This dissertation is concerned with the development of robust adaptive filtering in an impulsive noise environment based on the linear transversal filter (LTF) and the lattice-ladder filer (LLF) structures. Combining the linear adaptive filtering theory and robust statistics estimation techniques, two new cost functions, called the mean M -estimate error (MME) and the sum of weighted M -estimate error (SWME), are proposed. They can be taken as the generalizations of the well-known mean squared error (MSE) and the sum of weighted squares error (SWSE) cost functions when the involving signals are Gaussian. Based on the SWME cost function, the resulting optimal weight vector is governed by an M-estimate normal equation and a recursive least M -estimate (RLM) algorithm is derived. The RLM algorithm preserves the fast initial convergence, lower steady-state 11 Abstract derived. The RLM algorithm preserves the fast initial convergence, lower steady-state error and the robustness to the sudden system change of the recursive least squares (RLS) algorithm under Gaussian noise alone. Meanwhile, it has the ability to suppress impulse noise both in the desired and input signals. In addition, using the MME cost function, stochastic gradient based adaptive algorithms, named the least mean Mestimate (LMM) and its transform dOlnain version, the transform domain least mean Mestimate (TLMM) algorithms have been developed. The LMM and TLMM algorithms can be taken as the generalizations of the least-mean square (LMS) and transform domain normalized LMS (TLMS) algorithms, respectively. These two robust algorithms give similar performance as the LMS and TLMS algorithms under Gaussian noise alone and are able to suppress impulse noise appearing in the desired and input signals. It is noted that the performance and the computational complexity of the RLM, LMM and TLMM algorithms have a close relationship with the estimate of the threshold parameters for the M-estimate functions. A robust and effective recursive method has been suggested in this dissertation to estimate the variance of the estimation error and the required threshold parameters with certain confidence to suppress the impulsive noise. The mean and mean square convergence performances of the RLM and the LMM algorithms are evaluated, respectively, when the impulse noise is assumed to be contaminated Gaussian distribution. Motivated by the desirable features of the lattice-ladder filter, a new robust adaptive gradient lattice-ladder filtering algorithm is developed by minimizing an MME cost function together with an embedded robust impulse suppressing process, especially for impulses appearing in the filter input. The resultant robust gradient lattice-robust 111 Abstract normalized LMS (RGAL-RNLMS) algorithm perfonns comparably to the conventional GAL-NLMS algorithm under Gaussian noise alone; meanwhile, it has the capability of suppressing the adverse effects due to impulses in the input and the desired signals. The additional computational complexity compared to the GAL-NLMS algorithm is of O(Nw log Nw) + O(NfI log N,J . Extensive computer simulation studies are undertaken to evaluate the performance of the RLM, LMM, TLMM and the RGAL-RNLMS algorithms under the additive noise with either a contaminated Gaussian distribution or the symmetric alpha-stable (SaS ) distributions. The results substantiate the analysis and demonstrate the effectiveness and robustness of the developed robust adaptive filtering algorithms in suppressing impulsive noise both in the input and the desired signals of the adaptive filter. In conclusion, the proposed approaches in this dissertation present an attempt for developing robust adaptive filtering algorithms in impulsive noise environments and can be viewed as an extension of the linear adaptive filter theory. They may become reasonable and effective tools to solve adaptive filtering problems in a non-Gaussian environment in practice. IV / abstract / toc / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

published_or_final_version / Electrical and Electronic Engineering / Master / Master of Philosophy

No description available.

No description available.

The information in genomic or genetic data is influenced by various complex processes and appropriate mathematical modeling is required for studying the underlying processes and the data. This dissertation focuses on the formulation of mathematical models for certain problems in genomics and genetics studies and the development of algorithms for proposing efficient solutions. A Bayesian approach for the transcription factor (TF) motif discovery is examined and the extensions are proposed to deal with many interdependent parameters of the TF-DNA binding. The problem is described by statistical terms and a sequential Monte Carlo sampling method is employed for the estimation of unknown parameters. In particular, a class-based resampling approach is applied for the accurate estimation of a set of intrinsic properties of the DNA binding sites. Through statistical analysis of the gene expressions, a motif-based computational approach is developed for the inference of novel regulatory networks in a given bacterial genome. To deal with high false-discovery rates in the genome-wide TF binding predictions, the discriminative learning approaches are examined in the context of sequence classification, and a novel mathematical model is introduced to the family of kernel-based Support Vector Machines classifiers. Furthermore, the problem of haplotype phasing is examined based on the genetic data obtained from cost-effective genotyping technologies. Based on the identification and augmentation of a small and relatively more informative genotype set, a sparse dictionary selection algorithm is developed to infer the haplotype pairs for the sampled population. In a relevant context, to detect redundant information in the single nucleotide polymorphism (SNP) sites, the problem of representative (tag) SNP selection is introduced. An information theoretic heuristic is designed for the accurate selection of tag SNPs that capture the genetic diversity in a large sample set from multiple populations. The method is based on a multi-locus mutual information measure, reflecting a biological principle in the population genetics that is linkage disequilibrium.

Orientadores: João Marcos Travassos Romano, Leonardo Tomazeli Duarte / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-23T23:21:46Z (GMT). No. of bitstreams: 1 Zanetti_RicardoAntonio_M.pdf: 21586747 bytes, checksum: 452b3dadea31fa37e922d925b45c10be (MD5) Previous issue date: 2013 / Resumo: : O Resumo poderá ser visualizado no texto completo da tese digital / Abstract: : The complete Abstract is available with the full electronic / Mestrado / Telecomunicações e Telemática / Mestre em Engenharia Elétrica