Geometric matching in general is a di cult unsolved problem in computer vision. Fortunately, in many practical applications, some a priori knowledge exists which considerably simpli es the problem. In visual navigation, for example, the motion between successive positions is usually either small or approximately known, but a more precise registration is required for environment modeling. The al...

We consider the problem of solving least squares problems involving a matrix M of small displacement rank with respect to two matrices Z 1 and Z 2. We develop formulas for the generators of the matrix M (H) M in terms of the generators of M and show that the Cholesky factorization of the matrix M (H) M can be computed quickly if Z 1 is close to unitary and Z 2 is triangular and nilpotent. These...

we present a model and propose an approach to compute an approximate solution of fully fuzzy linear system $(ffls)$ of equations in which all the components of the coefficient matrix are either nonnegative or nonpositive. first, in discussing an $ffls$ with a nonnegative coefficient matrix, we consider an equivalent $ffls$ by using an appropriate permutation to simplify fuzzy multiplications. t...

In this paper a new class of simplified low-cost analog artificial neural networks with on chip adaptive learning algorithms are proposed for solving linear systems of algebraic equations in real time. The proposed learning algorithms for linear least squares (LS), total least squares (TLS) and data least squares (DLS) problems can be considered as modifications and extensions of well known alg...

two multivariate calibration methods are compared for the simultaneous chromatographic determination and separation of sulfamethoxazole (smx) and phthalazine (phz) by high performance liquid chromatography (hplc). multivariate calibration techniques such as classical least squares (cls) and inverse least squares (ils) were introduced into hplc to determine the quantification by using uv detecto...