Nonlinear orthogonal projection
نویسندگان
چکیده
منابع مشابه
Filtering En Restarting Orthogonal Projection Methods Filtering En Restarting Orthogonal Projection Methods
We consider the class of the Orthogonal Projection Methods (OPM) to solve iteratively large and generalised eigenvalue problems. An OPM is a method that projects a large eigenvalue problem on a smaller subspace. In this subspace, an approximation of the eigenvalue spectrum can be computed from a small eigenvalue problem using a direct method. We show that many iterative eigenvalue solvers, such...
متن کاملNonlinear Estimation of Hyperspectral Mixture Pixel Proportion Based on Kernel Orthogonal Subspace Projection
A kernel orthogonal subspace projection (KOSP) algorithm has been developed for nonlinear approximating subpixel proportion in this paper. The algorithm applies linear regressive model to the feature space induced by a Mercer kernel, and can therefore be used to recursively construct the minimum mean squared-error regressor. The algorithm includes two steps: the first step is to select the feat...
متن کاملArt and Nonlinear Projection
Nonlinear projection is a current area of research in computer graphics and provides a meeting place between science and art. We begin by examining several cases of how and when artists choose to use nonlinear projection as opposed to perspective projection. We then provide a brief review of different techniques for nonlinear projection described in computer graphics literature. We expand upon ...
متن کاملOrthogonal Margin Maximization Projection for Gait Recognition
An efficient supervised orthogonal nonlinear dimensionality reduction algorithm, namely orthogonal margin maximization projection (OMMP), is presented for gait recognition in this paper. Taking the local neighborhood geometry structure and class information into account, the proposed algorithm aims to find a projecting matrix by maximizing the local neighborhood margin between the different cla...
متن کاملOn Diagonally Relaxed Orthogonal Projection Methods
We propose and study a block-iterative projections method for solving linear equations and/or inequalities. The method allows diagonal component-wise relaxation in conjunction with orthogonal projections onto the individual hyperplanes of the system, and is thus called diagonally-relaxed orthogonal projections (DROP). Diagonal relaxation has proven useful in accelerating the initial convergence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Polonici Mathematici
سال: 1994
ISSN: 0066-2216,1730-6272
DOI: 10.4064/ap-59-1-1-31