The Experts below are selected from a list of 4404 Experts worldwide ranked by ideXlab platform
Biing-hwang Juang - One of the best experts on this subject based on the ideXlab platform.
-
Nonlinear Compensation Using the Gauss–Newton Method for Noise-Robust Speech Recognition
IEEE Transactions on Audio Speech and Language Processing, 2012Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to estimating noise parameters of the prevalent nonlinear compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT), for noise-robust speech recognition. While iterative estimation of noise means in a generalized EM framework has been widely known, we demonstrate that such approaches are variants of the Gauss-Newton Method. Furthermore, we propose a novel noise variance estimation algorithm that is consistent with the Gauss-Newton principle. The formulation of the Gauss-Newton Method reduces the noise estimation problem to determining the Jacobians of the corrupted speech parameters. For sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate these Jacobians. The proposed noise estimation algorithm is evaluated for various compensation models on two tasks. The first is to fit a Gaussian mixture model (GMM) model to artificially corrupted samples, and the second is to perform speech recognition on the Aurora 2 database. The significant performance improvements confirm the efficacy of the Gauss-Newton Method to estimating the noise parameters of the nonlinear compensation models.
-
Non-linear noise compensation for robust speech recognition using Gauss-Newton Method
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to optimizing non-linear noise compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT). We demonstrate that the commonly used approaches that iteratively approximate the noise parameters in an EM framework are variants of the Gauss-Newton Method. Through the formulation of the Gauss-Newton Method for estimating noise means and variances, the noise estimation problems are reduced to determining the Jacobians of the noisy speech distributions. For the sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate the Jacobians. Experiments on the Aurora 2 database verify the efficacy of the Gauss-Newton Method to these noise compensation models.
-
ICASSP - Non-linear noise compensation for robust speech recognition using Gauss-Newton Method
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to optimizing non-linear noise compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT). We demonstrate that the commonly used approaches that iteratively approximate the noise parameters in an EM framework are variants of the Gauss-Newton Method. Through the formulation of the Gauss-Newton Method for estimating noise means and variances, the noise estimation problems are reduced to determining the Jacobians of the noisy speech distributions. For the sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate the Jacobians. Experiments on the Aurora 2 database verify the efficacy of the Gauss-Newton Method to these noise compensation models.
Yong Zhao - One of the best experts on this subject based on the ideXlab platform.
-
Nonlinear Compensation Using the Gauss–Newton Method for Noise-Robust Speech Recognition
IEEE Transactions on Audio Speech and Language Processing, 2012Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to estimating noise parameters of the prevalent nonlinear compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT), for noise-robust speech recognition. While iterative estimation of noise means in a generalized EM framework has been widely known, we demonstrate that such approaches are variants of the Gauss-Newton Method. Furthermore, we propose a novel noise variance estimation algorithm that is consistent with the Gauss-Newton principle. The formulation of the Gauss-Newton Method reduces the noise estimation problem to determining the Jacobians of the corrupted speech parameters. For sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate these Jacobians. The proposed noise estimation algorithm is evaluated for various compensation models on two tasks. The first is to fit a Gaussian mixture model (GMM) model to artificially corrupted samples, and the second is to perform speech recognition on the Aurora 2 database. The significant performance improvements confirm the efficacy of the Gauss-Newton Method to estimating the noise parameters of the nonlinear compensation models.
-
Non-linear noise compensation for robust speech recognition using Gauss-Newton Method
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to optimizing non-linear noise compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT). We demonstrate that the commonly used approaches that iteratively approximate the noise parameters in an EM framework are variants of the Gauss-Newton Method. Through the formulation of the Gauss-Newton Method for estimating noise means and variances, the noise estimation problems are reduced to determining the Jacobians of the noisy speech distributions. For the sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate the Jacobians. Experiments on the Aurora 2 database verify the efficacy of the Gauss-Newton Method to these noise compensation models.
-
ICASSP - Non-linear noise compensation for robust speech recognition using Gauss-Newton Method
2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP), 2011Co-Authors: Yong Zhao, Biing-hwang JuangAbstract:In this paper, we present the Gauss-Newton Method as a unified approach to optimizing non-linear noise compensation models, such as vector Taylor series (VTS), data-driven parallel model combination (DPMC), and unscented transform (UT). We demonstrate that the commonly used approaches that iteratively approximate the noise parameters in an EM framework are variants of the Gauss-Newton Method. Through the formulation of the Gauss-Newton Method for estimating noise means and variances, the noise estimation problems are reduced to determining the Jacobians of the noisy speech distributions. For the sampling-based compensations, we present two Methods, sample Jacobian average (SJA) and cross-covariance (XCOV), to evaluate the Jacobians. Experiments on the Aurora 2 database verify the efficacy of the Gauss-Newton Method to these noise compensation models.
Paulo Roberto De Oliveira - One of the best experts on this subject based on the ideXlab platform.
-
Convergence of the Gauss--Newton Method for Convex Composite Optimization under a Majorant Condition
Siam Journal on Optimization, 2013Co-Authors: Orizon P. Ferreira, M. L. N. Gonçalves, Paulo Roberto De OliveiraAbstract:Under the hypothesis that an initial point is a quasi-regular point, we use a majorant condition to present a new semilocal convergence analysis of an extension of the Gauss--Newton Method for solving convex composite optimization problems. In this analysis the conditions and proof of convergence are simplified by using a simple majorant condition to define regions where a Gauss--Newton sequence is well behaved.
-
Convergence of the Gauss–Newton Method for a special class of systems of equations under a majorant condition
Optimization, 2013Co-Authors: M. L. N. Gonçalves, Paulo Roberto De OliveiraAbstract:AbstractIn this paper, we study the Gauss–Newton Method for a special class of systems of non-linear equation. On the hypothesis that the derivative of the function under consideration satisfies a majorant condition, semi-local convergence analysis is presented. In this analysis, the conditions and proof of convergence are simplified by using a simple majorant condition to define regions where the Gauss–Newton sequence is ‘well behaved’. Moreover, special cases of the general theory are presented as applications.
-
Convergence of the Gauss-Newton Method for a special class of systems of equations under a majorant condition
arXiv: Optimization and Control, 2012Co-Authors: M. L. N. Gonçalves, Paulo Roberto De OliveiraAbstract:In this paper, we study the Gauss-Newton Method for a special class of systems of nonlinear equation. Under the hypothesis that the derivative of the function under consideration satisfies a majorant condition, semi-local convergence analysis is presented. In this analysis the conditions and proof of convergence are simplified by using a simple majorant condition to define regions where the Gauss-Newton sequence is "well behaved". Moreover, special cases of the general theory are presented as applications.
-
local convergence analysis of the gauss newton Method under a majorant condition
Journal of Complexity, 2011Co-Authors: Orizon P. Ferreira, M. L. N. Gonçalves, Paulo Roberto De OliveiraAbstract:The Gauss-Newton Method for solving nonlinear least squares problems is studied in this paper. Under the hypothesis that the derivative of the function associated with the least square problem satisfies a majorant condition, a local convergence analysis is presented. This analysis allows us to obtain the optimal convergence radius and the biggest range for the uniqueness of stationary point, and to unify two previous and unrelated results.
Ioannis K. Argyros - One of the best experts on this subject based on the ideXlab platform.
-
Gauss–Newton Method for convex optimization
A Contemporary Study of Iterative Methods, 2020Co-Authors: Á. Alberto Magreñán, Ioannis K. ArgyrosAbstract:The goal in this chapter is to present a finer convergence analysis of Gauss–Newton Method than in earlier works in order to expand the solvability of convex composite optimizations problems. The convergence of Gauss–Newton Method is based on the majorant and center-majorant functions.
-
Gauss–Newton Method
A Contemporary Study of Iterative Methods, 2020Co-Authors: Á. Alberto Magreñán, Ioannis K. ArgyrosAbstract:In this chapter we present the local convergence analysis of Gauss–Newton Method using the idea of restricted convergence domains, which allows us to improve previous results. Finally, some special cases and a numerical example are also given, validating the theoretical results.
-
Proximal Gauss–Newton Method
A Contemporary Study of Iterative Methods, 2020Co-Authors: Á. Alberto Magreñán, Ioannis K. ArgyrosAbstract:In this chapter we extend the solvability of penalized nonlinear least squares problems using the proximal Gauss–Newton Method. Moreover, a numerical example validating the theoretical results is also presented.
-
Gauss–Newton Method for convex composite optimization
A Contemporary Study of Iterative Methods, 2020Co-Authors: Á. Alberto Magreñán, Ioannis K. ArgyrosAbstract:In this chapter we extend the solvability of convex composite optimization problems using Gauss–Newton Method. We present the algorithm and study the regularity. Then we present the semilocal convergence study and finish with numerical examples validating the theoretical results.
-
Improved semi-local convergence of the Gauss-Newton Method for systems of equations
Journal of Mathematical Sciences and Modelling, 2018Co-Authors: Ioannis K. Argyros, Santhosh GeorgeAbstract:Our new technique of restricted convergence domains is employed to provide a finer convergence analysis of the Gauss-Newton Method in order to solve a certain class of systems of equations under a majorant condition. The advantages are obtained under the same computational cost as in earlier studies such as [5, 14]. Special cases and a numerical example are also given in this study.
Arye Nehorai - One of the best experts on this subject based on the ideXlab platform.
-
Information-Driven Distributed Maximum Likelihood Estimation Based on Gauss-Newton Method in Wireless Sensor Networks
IEEE Transactions on Signal Processing, 2007Co-Authors: Tong Zhao, Arye NehoraiAbstract:In this paper, we develop an energy-efficient distributed estimation Method that can be used in applications such as the estimation of a diffusive source and the localization and tracking of an acoustic target in wireless sensor networks. We first propose a statistical measurement model in which we separate the linear and nonlinear parameters. This modeling strategy reduce the processing complexity. We then study the distributed implementation of the Gauss-Newton Method in the maximum likelihood estimation. After that we propose a fully distributed estimation approach based on an incremental realization of the Gauss-Newton Method. We derive three modifications of the basic algorithm to improve the distributed processing performance while still considering the energy restriction. We implement the idea of information-driven collaborative signal processing and provide a sensor-node scheduling scheme in which the Cramer-Rao bound (CRB) is used as the performance and information utility measure to select the next sensor node. Numerical examples are used to study the performance of the distributed estimation, and we show that of the Methods considered here, the proposed multiple iteration Kalman filtering Method has the most advantages for wireless sensor networks.