Classification in kernel machines consists of a nonlinear transformation of input data into a feature space, followed by a separation with a linear hyperplane. This transformation is expressed through a kernel function, which is capable of computing similarities between two data points in an abstract geometric space for which individual point vectors are computationally intractable. In this pap...

We give geometric explanations and proofs of various mirror symmetry conjectures for T-invariant Calabi-Yau manifolds when instanton corrections are absent. This uses fiberwise Fourier transformation together with base Legendre transformation. We discuss mirror transformations of (i) moduli spaces of complex structures and complexified symplectic structures, Hp,q’s, Yukawa couplings; (ii) sl (2...

We propose a geometric matching technique in which line segments and elliptical arcs are used as edge features. The use of these higher-order features renders feature representation efficient. We derive distance measures to evaluate the similarity between the features of the model and those of the image. The model transformation parameters are found by searching a 3-D transformation space using...

the pseudo-elastic behavior of shape memory alloy (sma) truss and cantilever beam are investigated. brinson’s one-dimensional material model, which uses the twinned and detwinned martensite fractions separately as internal variables, is applied in the algorithm to establish the sma stress-strain characteristics. this material model also incorporates different young’s modulus for austenitic and ...

Point matching is the task of finding a set of correspondences between two sets of points under some geometric transformation. A local search algorithm for point matching is presented, and shown to be effective at solving problems where the point sets are related by a projective transformation. Random starts local search is shown to be capable of solving very difficult point matching problems, ...

This paper presents a recursive query language solution for the shortest path problem based on the transformation of a cyclic geometric graph into an acyclic time graph, i.e. an acyclic Petri Net specifying the possible transitions (turns) between successive rides on different roads. Using this transformation, the shortest path problem is transformed into a fastest tour problem. The time comple...

in this paper, we used a shape matching algorithm to recognize farsi digits. for each sampled point on the contour of a shape, we obtain a descriptor showing the distribution of the other points of the contour, with respect to this point. based on these descriptors, we find the corresponding points of the two contours and take the sum of their distances as a dissimilarity measure between two sh...

Application of stochastic geometry methods to pattern recognition is analyzed. The paper is based on Trace-transformations of original images introduced in [1] into images on the Mobius band. Trace–transformation is a new geometrical transformation, which is connected with image scanning on complex trajectories, including random parameters trajectories. Based on this new geometric transformatio...

In this paper, we introduce and investigate a general transformation or change of Finsler metrics, which is referred to as a generalized β-conformal change: L(x, y) −→ L(x, y) = f(eL(x, y), β(x, y)). This transformation combines both β-change and conformal change in a general setting. The change, under this transformation, of the fundamental Finsler connections, together with their associated g...

This paper presents an incremental method to 3D transformation by VQS structures. For interpolated scaling, rotation and translation between two animation key frames, with constant intervals in size, angle and distance, the proposed approach reduces the VQS transformation cost by more than an half. Moreover, all interpolations for VQS key frames are performed implicitly at no cost. In other wor...