This paper addresses the recovery of structure and motion from two uncalibrated images of a scene under ful l perspective or under affine projection. Epipolar geometry, projective reconstruction, and affine reconstruction are elaborated in a way such that everyone having knowledge of linear algebra can understand the discussion without difficulty. A general expression of the fundamental matr ix...

The Affine partitioning framework, which unifies many useful program transforms such as unimodular transformations, loop fusion, fission, scaling, reindexing, and statement reordering, has been proved to be successful in automatic discovery of the loop-level parallelization in programs. The affine partition algorithm was improved from the aspects of compile-time and runtime efficiency in this p...

Extracting features is one of the core issues in pattern recognition, in which affine invariant is important method to recognize object under complex environment. To solve the issues of the error increasing and the low efficiency for affine invariant extraction algorithms, a improved feature extraction algorithm based on region partition is proposed. First, the algorithm gets the centroid and o...

In this paper we present the basic theory of the Monge-Ampère equation together with a selection of geometric applications, mainly to affine geometry. First we introduce the Monge-Ampère measure and the resultant notion of generalized solution of Aleksandrov. Then we discuss a priori estimates and regularity, followed by the existence and uniqueness of solutions to various boundary value proble...

We define a new family F̃w(X) of generating functions for w ∈ S̃n which are affine analogues of Stanley symmetric functions. We establish basic properties of these functions such as their symmetry and conjecture certain positivity properties. As an application, we relate these functions to the k-Schur functions of Lapointe, Lascoux and Morse as well as the cylindric Schur functions of Postnikov. ...

We study affine permutation diagrams and their labellings with positive integers. Balanced labellings of a Rothe diagram of a finite permutation were defined by FominGreene-Reiner-Shimozono, and we extend this notion to affine permutations. The balanced labellings give a natural encoding of the reduced decompositions of affine permutations. We show that the sum of weight monomials of the column...

Techniques based on Interval and Affine Arithmetic and their modifications are shown to provide reliable function range evaluation for the purposes of surface interrogation. In this paper we present a technique for the reliable interrogation of implicit surfaces using a modification of Affine Arithmetic called Revised Affine Arithmetic. We extend the range of functions presented in Revised Affi...

Affinely-Adjustable Robust Counterparts provide tractable alternatives to (two-stage) robust programs with arbitrary recourse. We apply them to robust network design with polyhedral demand uncertainty, introducing the affine routing principle. We compare the affine routing to the well-studied static and dynamic routing schemes for robust network design. All three schemes are embedded into the g...

the study of stability problems of functional equations was motivated by a question of s.m. ulam asked in 1940. the first result giving answer to this question is due to d.h. hyers. subsequently, his result was extended and generalized in several ways.we prove some hyperstability results for the equation g(ax+by)+g(cx+dy)=ag(x)+bg(y)on restricted domain. namely, we show, under some weak natural...