Orientation Estimation Based on Weighted Projection onto Quadratic Polynomials
نویسنده
چکیده
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, methods have so far been very computationally demanding and/or not very robust. In this paper we present a novel method for computation of orientation tensors for signals of any dimensionality. The method is based on local weighted least squares approximations of the signal by second degree polynomials. It is shown how this can be implemented very efficiently by means of separable convolutions and that the method gives very accurate orientation estimates. We also introduce the new concept of orientation functionals, of which orientation tensors is a subclass. Finally we demonstrate the critical importance of using a proper weighting function in the local projection of the signal onto polynomials.
منابع مشابه
Constraints on Quadratic Curves Under Perspective Projection
In this paper we address the problem of 3D-location estimation based on quadratic-curved features. It is assumed that the true size and true shape of a feature in object space are known, along with its perspective projection in the image plane. In our approach, we decompose the 3D-location-estimation problem into a concatenated process of SD-orientation estimation and 3D-position estimation. In...
متن کاملOn Weighted Linear Least-Squares Problems Related to Interior Methods for Convex Quadratic Programming
It is known that the norm of the solution to a weighted linear least-squares problem is uniformly bounded for the set of diagonally dominant symmetric positive definite weight matrices. This result is extended to weight matrices that are nonnegative linear combinations of symmetric positive semidefinite matrices. Further, results are given concerning the strong connection between the boundednes...
متن کاملDegree Reduction of Disk Rational Bézier Curves Using Multi-objective Optimization Techniques
In this paper, we start by introducing a novel disk rational Bézier based on parallel projection, whose properties are also discussed. Then applying weighted least squares, multiobjective optimization techniques and constrained quadratic programming, we achieve multi-degree reduction of this kind of disk rational Bézier curve. The paper also gives error estimation and shows some numerical examp...
متن کاملOn a conjecture for weighted interpolation using Chebyshev polynomials of the third and fourth kinds
A conjecture for the projection norm (or Lebesgue constant) of a weighted interpolation method based on the zeros of Chebyshev polynomials of the third and fourth kinds is resolved. This conjecture was made in a paper by J. C. Mason and G. H. Elliott in 1995. The proof of the conjecture is achieved by relating the projection norm to that of a weighted interpolation method based on zeros of Cheb...
متن کاملA quadratic programming based cluster correspondence projection algorithm for fast point matching
Point matching is a challenging problem in the fields of computer vision, pattern recognition and medical image analysis, and correspondence estimation is the key step in point matching. This paper presents a quadratic programming based cluster correspondence projection (QPCCP) algorithm, where the optimal correspondences are searched via gradient descent and the constraints on the corresponden...
متن کامل