In this paper, the problems of finding corresponding points from multiple perspective projection images, and estimating the 3-D points from which these points have arisen, are addressed. The problem of finding corresponding points is formulated as a hypothesis verification problem. Given a set of 2-D points, one from each of N perspective projection images, under the hypothesis that the points ...

Using elementary comparison geometry, we prove: Let (M, g) be a simplyconnected complete Riemannian manifold of dimension ≥ 3. Suppose that the sectional curvature K satisfies −1 − s(r) ≤ K ≤ −1, where r denotes distance to a fixed point in M . If limr→∞ e2r s(r) = 0, then (M, g) has to be isometric to H. The same proof also yields that if K satisfies −s(r) ≤ K ≤ 0 where limr→∞ r2 s(r) = 0, the...

A mapping 0 of a G-space R (Busemann [l ]) on itself is a locally isometric mapping if for each x£P there is a number r)x>0 such that (x), vx). The problem we are concerned with is that of determining conditions on a G-space R under which every locally isometric mapping of R on itself is an isometry. Several such conditions have ...

Recently, Dementhon 0 Davis [2] proposed a method for determining the pose of a 3-0 object with respect to a camera from 3-D to 2 0 point correspondences. The method consists of iteratively improving the pose computed with a weak perspective camera model to converge, at the limit, to a pose estimation computed with a perspective camera model. In this paper we show that the method of Dementhon €...

OBJECTIVE To establish preoperatively the localization of the cortical projection of the inferior choroidal point (ICP) and use it as a reliable landmark when approaching the temporal horn through a middle temporal gyrus access. To review relevant anatomical features regarding selective amigdalohippocampectomy (AH) for treatment of mesial temporal lobe epilepsy (MTLE). METHOD The cortical pro...

Among their competitors, projection depth and its induced estimators are very favorable because they can enjoy very high breakdown point robustness without having to pay the price of low e ciency, meanwhile providing a promising centeroutward ordering of multi-dimensional data. However, their further applications have been severely hindered due to their computational challenge in practice. In t...

Random Projection is a foundational research topic that connects a bunch of machine learning algorithms under a similar mathematical basis. It is used to reduce the dimensionality of the dataset by projecting the data points efficiently to a smaller dimensions while preserving the original relative distance between the data points. In this paper, we are intended to explain random projection met...

This paper addresses a registration refinement problem and presents an accurate and fast point-to-(tangent) plane technique. Point-to-plane approach is known to be very accurate for registration refinement of partial 3D surfaces. However, the computation complexity for finding the intersection point on a destination surface from a source control point is hindering the algorithm from real-time a...