This paper presents an efticient technique for real-time tracking of a single moving object in terrestrial scenes using a stationary camera. The tracking algorithm is based on the Linear Prediction (LP) solved by the Maximum Entropy Method (MEM). It attempts to predict the centroid of the moving object in the next frame, based on several past centroid measurements. Using a second order of the L...

Applications in materials, medicine, and computers are being discovered where the control of events at the molecular and nanoscopic scales is critical to product quality, while the primary manipulation of these events during processing occurs at macroscopic length scales. In such applications, one of the most significant engineering challenges is to achieve control over phenomena that occur sim...

This paper discusses predictor-corrector iteration schemes (PC iteration schemes) based on direct collocation-based Runge-Kutta-Nystr??m corrector methods (RKN corrector methods) for solving nonstiff initial-value problems (IVPs) for systems of special second-order differential equations y??(t)=f(y(t)). Our approach is to regard the well-known parallel-iterated RKN methods (PIRKN methods) as PC...

The smooth variable structure filter (SVSF) is a relatively new state and parameter estimation technique. Introduced in 2007, it is based on the sliding mode concept, and is formulated in a predictor-corrector fashion. The main advantages of the SVSF, over other estimation methods, are robustness to modeling errors and uncertainties, and its ability to detect system changes. Recent developments...

A-priori individual interconnect length estimates can be used to make placement efficient and reduce delay and power consumption in a circuit. However, finding lengths of individual interconnects before their terminals have been placed can be a daunting task. In this thesis, the main characteristics that need to be considered while designing an individual a-priori length estimation technique fo...

Two predictor-corrector methods of order m = Ω(logn) are proposed for solving sufficient linear complementarity problems. The methods produce a sequence of iterates in the N− ∞ neighborhood of the central path. The first method requires an explicit upper bound κ of the handicap of the problem while the second method does not. Both methods have O((1 + κ)1+1/m √ nL) iteration complexity. They are...

A nonoverlapping domain decomposition method for some time-dependent convection-diffusion equations is presented. It combines predictor-corrector technique, modified upwind differences with explicit/implicit coupling to provide intrinsic parallelism, and unconditional stability while improving the accuracy. Both rigorous mathematical analysis and numerical experiments are carried out to illustr...

It has been shown in various papers that most interior-point algorithms and their analysis can be generalized to semidefinite optimization. This paper presents an extension of the recent variant of Mehrotra’s predictor-corrector algorithm that was proposed by Salahi et al. (2005) for linear optimization problems. Based on the NT (Nesterov and Todd 1997) direction as Newton search direction it i...

This article provides an analysis for the delay fractional differential equations in Caputo sense by an introduction of an improved predictorcorrector formula. The delay term is expressed either as a constant or time varying. The implication of this new approach is used to improvise the algorithm. A vivid description of the convergence and detailed error analysis of the improved predictor-corre...

Three primal-dual interior-point algorithms for homogeneous cone programming are presented. They are a short-step algorithm, a large-update algorithm, and a predictor-corrector algorithm. These algorithms are described and analyzed based on a characterization of homogeneous cone via T -algebra. The analysis show that the algorithms have polynomial iteration complexity.