Two-step Nonnegative Matrix Factorization Algorithm for the Approximate Realization of Hidden Markov Models

We propose a two-step algorithm for the construction of a Hidden Markov Model (HMM) of assigned size, i.e. cardinality of the state space of the underlying Markov chain, whose $n$-dimensional distribution is closest in divergence to a given distribution. The algorithm is based on the factorization of a pseudo Hankel matrix, defined in terms of the given distribution, into the product of a tall and a wide nonnegative matrix. The implementation is based on the nonnegative matrix factorization (NMF) algorithm. To evaluate the performance of our algorithm we produced some numerical simulations in the context of HMM order reduction.Comment: presented at MTNS2010 - Budapest, July 201

Comparison of physics-based, semi-empirical and neural network-based models for model-based combustion control in a 3.0 L diesel engine

A comparison of four different control-oriented models has been carried out in this paper for the simulation of the main combustion metrics in diesel engines, i.e., combustion phasing, peak firing pressure, and brake mean effective pressure. The aim of the investigation has been to understand the potential of each approach in view of their implementation in the engine control unit (ECU) for onboard combustion control applications. The four developed control-oriented models, namely the baseline physics-based model, the artificial neural network (ANN) physics-based model, the semi-empirical model, and direct ANN model, have been assessed and compared under steady-state conditions and over the Worldwide Harmonized Heavy-duty Transient Cycle (WHTC) for a Euro VI FPT F1C 3.0 L diesel engine. Moreover, a new procedure has been introduced for the selection of the input parameters. The direct ANN model has shown the best accuracy in the estimation of the combustion metrics under both steady-state/transient operating conditions, since the root mean square errors are of the order of 0.25/1.1 deg, 0.85/9.6 bar, and 0.071/0.7 bar for combustion phasing, peak firing pressure, and brake mean effective pressure, respectively. Moreover, it requires the least computational time, that is, less than 50 µs when the model is run on a rapid prototyping device. Therefore, it can be considered the best candidate for model-based combustion control applications

Approximation of Nonnegative Systems by Finite Impulse Response Convolutions

We pose the deterministic, nonparametric, approximation problem for scalar nonnegative input/output systems via finite impulse response convolutions, based on repeated observations of input/output signal pairs. The problem is converted into a nonnegative matrix factorization with special structure for which we use Csiszár's I-divergenceas the criterion of optimality. Conditions are given, on the input/output data, that guarantee the existence and uniqueness of the minimum. We propose an algorithm of the alternating minimization type for I-divergence minimization, and study its asymptotic behavior. For the case of noisy observations, we give the large sample properties of the statistical version of the minimization problem. Numerical experiments confirm the asymptotic results and exhibit the fast convergence of the proposed algorithm

The Inverse Problem of Positive Autoconvolution

We pose the problem of approximating optimally a given nonnegative signal with the scalar autoconvolution of a nonnegative signal. The I-divergence is chosen as the optimality criterion being well suited to incorporate nonnegativity constraints. After proving the existence of an optimal approximation, we derive an iterative descent algorithm of the alternating minimization type to find a minimizer. The algorithm is based on the lifting technique developed by Csiszár and Tusnádi and exploits the optimality properties of the related minimization problems in the larger space. We study the asymptotic behavior of the iterative algorithm and prove, among other results, that its limit points are Kuhn-Tucker points of the original minimization problem. Numerical experiments confirm the asymptotic results and exhibit the fast convergence of the proposed algorithm