An application of the KL procedure for gappy data is presented to extend the well known factorization based algorithm for multi-image projective structure and motion. The predominant problem with factorization based techniques is that they require all points being reconstructed to be visible in all views, which is very unlikely in real scenes due to self occlusion. The approach presented here a...

In this paper, a robust adaptive actuator failure compensation control scheme is proposed for a class of multi input multi output linear systems with unknown time-varying state delay and in the presence of unknown actuator failures and external disturbance. The adaptive controller structure is designed based on the SPR-Lyapunov approach to achieve the control objective under the specific assump...

Rank determination issue is one of the most significant issues in non-negative matrix factorization (NMF) research. However, rank determination problem has not received so much emphasis as sparseness regularization problem. Usually, the rank of base matrix needs to be assumed. In this paper, we propose an unsupervised multi-level non-negative matrix factorization model to extract the hidden dat...

Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well tracked features. Such a set is in general not available in practical applications. There is thus a need for making factorization algorithms deal effectively with errors in the tracked features. We propose a new and computationally efficient algorithm fo...

The paper preposes a new scheme to promote the robustness of 3D structure and motion factorization from uncalibrated image sequences. First, an augmented affine factorization algorithm is proposed to circumvent the difficulty in image registration with imperfect data. Then, an alternative weighted factorization algorithm is designed to handle the missing data and measurement uncertainties in th...

In this article we present an overview of factorization methods for recovering structure and motion from image sequences. We distinguish these methods from general non-linear algorithms primarily by their bilinear formulation in motion and shape parameters. The bilinear formulation makes possible powerful and e cient solution techniques including Singular Value Decomposition. We show how factor...

It is shown that by assuming Gribov factorization to hold at low x one obtains a simple relation between the structure function of the proton and that of the photon. By interpreting an observed structure in deep inelastic scattering (DIS) of leptons on protons as belonging to the proton, one can relate it to the structure of the exchanged photon, and visa versa. Predictions are given for the st...

In this article the notion of quasi left factorization structure in a category X is given. It is proved that quasi left factorization structures correspond to subobjects of a predefined object in the category of laxed preordered valued presheaves, Lax(PrOrdX op ). The main result proves this correspondence is one to one when quasi left factorization structures are restricted to the so called QL...

In this paper, we consider the symbolic factorization step in computing the Cholesky factorization of a sparse symmetric positive definite matrix on distributedmemory multiprocessor systems. By exploiting the supernodal structure in the Cholesky factor, the performance of a previous parallel symbolic factorization algorithm is improved. Empirical tests demonstrate that there can be drastic redu...