On a sub-Stiefel Procrustes problem arising in computer vision
نویسندگان
چکیده
In this paper we consider a Procrustes problem on the set of sub-Stiefel matrices. A sub-Stiefel matrix is a matrix that results from deleting simultaneously the last row and the last column of an orthogonal matrix. An iterative algorithm for computing the solution of the sub-Stiefel Procrustes problem is proposed. For these purposes we investigate the properties of sub-Stiefel matrices. We also relate the sub-Stiefel Procrustes problem with the Stiefel Procrustes problem and compare it with the orthogonal Procrustes problem.
منابع مشابه
The Procrustes Problem for Orthogonal Stiefel Matrices
In this paper we consider the Procrustes problem on the manifold of orthogonal Stiefel matrices. Given matrices A 2 R mk , B 2 R mp , m p k, we seek the minimum of kA?BQk 2 for all matrices Q 2 R pk , Q T Q = I kk. We introduce a class of relaxation methods for generating minimizing sequences and ooer a geometric interpretation of these methods. Results of numerical experiments illustrating the...
متن کاملReliable Exterior Orientation by a Robust Anisotropic Orthogonal Procrustes Algorithm
The paper presents a robust version of a recent anisotropic orthogonal Procrustes algorithm that has been proposed to solve the socalled camera exterior orientation problem in computer vision and photogrammetry. In order to identify outliers, that are common in visual data, we propose an algorithm based on Least Median of Squares to detect a minimal outliers-free sample, and a Forward Search pr...
متن کاملExtensions of the Hestenes-Stiefel and Polak-Ribiere-Polyak conjugate gradient methods with sufficient descent property
Using search directions of a recent class of three--term conjugate gradient methods, modified versions of the Hestenes-Stiefel and Polak-Ribiere-Polyak methods are proposed which satisfy the sufficient descent condition. The methods are shown to be globally convergent when the line search fulfills the (strong) Wolfe conditions. Numerical experiments are done on a set of CUTEr unconstrained opti...
متن کاملRobot Motion Vision Pait I: Theory
A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...
متن کاملMotion Estimation in Computer Vision: Optimization on Stiefel Manifolds
Motion recovery from image correspondences is typically a problem of optimizing an objective function associated with the epipolar (or LonguetHiggins) constraint. This objective function is defined on the so called essential manifold. In this paper, the intrinsic Riemannian structure of the essential manifold is thoroughly studied. Based on existing optimization techniques on Riemannian manifol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerical Lin. Alg. with Applic.
دوره 22 شماره
صفحات -
تاریخ انتشار 2015