The iterative process, Xn+i = X„i2I — AX„), for computing A-1, is generalized to obtain the generalized inverse. An iterative method for inverting a matrix, due to Schulz [1], is based on the convergence of the sequence of matrices, defined recursively by (1) Xn+x = X„i21 AX«) (n 0, 1, • • ■ ) to the inverse A~l of A, whenever X0 approximates A"1. In this note the process ( 1 ) is generalized t...

Situation calculus action theories allow full first-order expressiveness but, typically, restricted cases are studied such that projection or progression become decidable or first-order, respectively, and computationally feasible. In this work we focus on KBs that are specified as generalized databases with equality constraints, thus able to finitely represent complete information over possibly...

In this paper, we introduce and investigate two new generalized mixed equilibrium problems and explore the relationship between them and the properties of their solutions in Banach spaces. Based on the generalized f -projection, we construct hybrid algorithms to find common fixed points of a countable family of quasi-φnonexpansive mappings in Banach spaces, a common element of the set of soluti...

We present the intuitive interpretation of a ne epipolar geometry for the orthographic, scaled orthographic, and paraperspective projection models in terms of the factorization method for the generalized a ne projection (GAP) model proposed by Fujiki and Kurata (1997). Using the GAP model introduced by Mundy and Zisserman (1992), each a ne projection model can be resolved into the orthographic ...

In a scene observed from a fixed viewpoint, the set of shadow boundaries in an image changes as a point light source (nearby or at infinity) assumes different locations. We show that for any finite set of point light sources illuminating an object viewed under either orthographic or perspective projection, there is an equivalence class of object shapes having the same set of shadows. Members of...