The H∞ control problem for linear discrete-time descriptor systems which are of high index and possibly non-regular is considered. The goal is to compute a descriptor feedback such that the closed loop system is stable, causal, and H∞ norm bounded by a prescibed real number. In a recent solution of this problem, where causality is established by a preliminary feedback and where stability and H∞...

The 2D Fourier Descriptor is an elegant and powerful technique for 2D shape analysis. This paper intends to extend such technique to 3D. Though conceptually natural, such an extension is not trivial in that two critical problems, the spherical parametrization and invariants construction, must be solved. By using a newly developed surface parametrization method–the discrete conformal mapping (DC...

This paper considers the problems of stability, stabilization and H∞ control via memoryless state feedback for uncertain discrete-time Markovian jump linear systems with mode-dependent time delays. Based on linear matrix inequalities, delay-dependent solutions are obtained by using a descriptor model transformation of the system and by applying a new bounding technique for cross terms. Numerica...

A polynomial design algorithm for innovation/residual generation for fault diagnosis is given. The class of systems considered is linear stochastic state-space and descriptor systems in both continuous and discrete time. A new class of residual generators based on stochastic models is defined and design algorithms are derived. The algorithms is based on standard operations such as null-space co...

We consider discrete-time linear periodic descriptor systems and study the concepts of solvability and conditionability introduced by D. Luenberger. We prove that solvability is equivalent to conditionability, just as in the time-invariant case. We give a characterization of solvability/conditionability in terms of a cyclic matrix pencil and, furthermore, propose a simple test via the periodic ...

This paper considers a new tracking control problem for a class of nonlinear stochastic descriptor systems, where the tracked target is a given joint probability density function (JPDF). The controlled plants can be represented by multivariate discrete-time descriptor systems with non-Gaussian disturbances and nonlinear output equations. The control objective is to find crisp algorithms such th...

We establish a unified approach to stability analysis for switched linear descriptor systems under arbitrary switching in both continuous-time and discrete-time domains. The approach is based on common quadratic Lyapunov functions incorporated with linear matrix inequalities (LMIs). We show that if there is a common quadratic Lyapunov function for the stability of all subsystems, then the switc...

The aim of this paper is to examine the effectiveness of combining three popular tools used in pattern recognition, which are the Active Appearance Model (AAM), the two-dimensional discrete cosine transform (2D-DCT), and Kernel Fisher Analysis (KFA), for face recognition across age variations. For this purpose, we first used AAM to generate an AAM-based face representation; then, we applied 2D-...

In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed shape descriptor is based on a multiscale representation of the discrete set of points, sampled from the internal and external contour points of the query and the candidate shapes. In this approach, dissimilarity between ...

The binary descriptors are the representation of choice for real-time keypoint matching. However, they suffer from reduced matching rates due to their discrete nature. We propose an approach that can augment their performance by searching in the top K near neighbor matches instead of just the single nearest neighbor one. To pick the correct match out of the K near neighbors, we exploit statisti...