منابع مشابه
Affine Subspace Representation for Feature Description
This paper proposes a novel Affine Subspace Representation (ASR) descriptor to deal with affine distortions induced by viewpoint changes. Unlike the traditional local descriptors such as SIFT, ASR inherently encodes local information of multi-view patches, making it robust to affine distortions while maintaining a high discriminative ability. To this end, PCA is used to represent affinewarped p...
متن کاملOn the Complements of Affine Subspace Arrangements
Let V be an l−dimensional real vector space. A subspace arrangement A is a finite collection of affine subspaces in V . There is no assumption on the dimension of the elements of A. Let M(A) = V −∪A∈AA be the complement of A. A method of calculating the additive structure of H(M(A)) was given in [G-MP] using stratified Morse theory, proving that H(M(A)) depends only on the set of all intersecti...
متن کاملSubspace operations in affine Klingenberg spaces
In two previous papers we introduced the notion of an Affine Klingenberg space A and presented a geometric description of its free subspaces. Presently, we consider the operations of join, intersection and parallelism on the free subspaces of A. As in the case of ordinary affine spaces, we obtain the Parallel Postulate. The situation with join and intersection is not that straightforward. In pa...
متن کاملSymmetry-free SDP Relaxations for Affine Subspace Clustering
We consider clustering problems where the goal is to determine an optimal partition of a given point set in Euclidean space in terms of a collection of affine subspaces. While there is vast literature on heuristics for this kind of problem, such approaches are known to be susceptible to poor initializations and getting trapped in bad local optima. We alleviate these issues by introducing a semi...
متن کاملAn Efficient Algorithm for Workspace Generation of Delta Robot
Dimensional synthesis of a parallel robot may be the initial stage of its design process, which is usually carried out based on a required workspace. Since optimization of the links lengths of the robot for the workspace is usually done, the workspace computation process must be run numerous times. Hence, importance of the efficiency of the algorithm and the CPU time of the workspace computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2008
ISSN: 1027-5487
DOI: 10.11650/twjm/1500405179