An EM‐based adaptive multiple target tracking filter

Tracking targets of interest is one of the major research areas in radar surveillance systems. We formulate the problem as incomplete data estimation and apply EM to the MAP estimate. The resulting filter has a recursive structure analogous to the Kalman filter. The advantage is that the measurement‐update deals with multiple measurements in parallel and the parameter‐update estimates the system parameters on the fly. Experiments tracking separate targets in parallel show that tracking maintenance ratio of the proposed system is better than that of NNF and RMS position error is smaller than that of PDAF. Also, the system parameters are correctly obtained even from incorrect initial values. Copyright © 2001 John Wiley & Sons, Ltd.     

Simulation of Strength Distribution in Ground Ceramics by Incorporating Residual Stress Effect

Strength of ground ceramics may be affected by residual stress as well as surface flaws induced by grinding. Strength prediction for ground ceramics is convenient for mechanical design of ceramic components. In this article, a numerical procedure based on fracture mechanics was proposed to estimate strength distribution of ground ceramics by considering grinding-induced residual stress. Bending strength and residual stress of ground ceramics were measured for three grinding-conditions. By comparison of simulated results with experimental ones, it was revealed that strength characteristics in experiments were well simulated by using the proposed procedure.     

Motion and structure interpretation of an optical switch

This paper focuses on tracking, reconstruction and motion estimation of a well-defined MEMS optical switch from a microscopic view. For out-of-view reconstruction, a homography capable of transforming feature points and feature lines between a microscopic image and a CAD model of the switch is implemented. The homography between two sequential microscopic images is decomposed and factorized for motion estimation. Optical flow has also been explored to provide rough estimations of rotation centre and angle. The paper also illustrates motion parameter optimization principles to deal with uncertainty inherent in micro world. After non-linear optimization, estimation accuracy for rotation angle and rotation centre can reach 0.06° and pixel level, respectively.     

Robustness of classification rules that incorporate additional information

The discrimination problem for two normal populations with the same covariance matrix when additional information on the population is available is considered. A study of the robustness properties against training sample contamination of classification rules that incorporate this additional information is performed. These rules have received recently attention where their total misclassification probability (TMP) is proved to be lower than Fisher's linear discriminant rule. The results of a simulation study on the TMP which compares the behaviour of the new rules against Fisher's rule and some of its robustified versions under different types of contamination are presented. These results show that the rules that incorporate the additional information not only have lower TMP, but they also prevent against some types of contamination. In order to achieve prevention from all types of contamination a robustifed version of these rules is recommended.     

Bootstrapping the Local Periodogram of Locally Stationary Processes

Abstract. Locally stationary processes are non‐stationary stochastic processes the second‐order structure of which varies smoothly over time. In this paper, we develop a method to bootstrap the local periodogram of a locally stationary process. Our method generates pseudo local periodogram ordinates by combining a parametric time and non‐parametric frequency domain bootstrap approach. We first fit locally a time varying autoregressive model so as to capture the essential characteristics of the underlying process. A locally calculated non‐parametric correction in the frequency domain is then used so as to improve upon the locally parametric autoregressive fit. As an application, we investigate theoretically the asymptotic properties of the bootstrap method proposed applied to the class of local spectral means, local ratio statistics and local spectral density estimators. Some simulations demonstrate the ability of our method to give accurate estimates of the quantities of interest in finite sample situations and an application to a real‐life data‐set is presented.     

Grouped Approach for the Design of H.264/AVC Motion Estimation Architectures

This letter presents a novel approach for organizing computational resources into groups within H.264/AVC motion estimation architectures, leading to reductions of up to 75% in the equivalent gate count with respect to state‐of‐the‐art designs.     

Time and cost securing in complex large-scale projects

Meeting time and cost objectives in complex projects involves specific problems and risks. An attempt is made to analyse the components of total cost increase of a project caused by time delay. An outline is given as to how these considerations can be used to estimate cost increases in investors' decision situations as well as to ascertain fair contractual penalties and claims for compensation and for the evaluation of justified project acceleration costs.     

Frequency domain identification of Wiener models

This paper proposes a frequency domain algorithm for Wiener model identifications based on exploring the fundamental frequency and harmonics generated by the unknown nonlinearity. The convergence of the algorithm is established in the presence of white noise. No a priori knowledge of the structure of the nonlinearity is required and the linear part can be nonparametric.     

Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.