Learn More
1-D Leap-Frog (L. Noakes, J. Math. Australian Soc. A, Vol. 64, pp. 37–50, 1999) is an iterative scheme for solving a class of nonquadratic optimization problems. In this paper a 2-D version of Leap-Frog is applied to a non optimization problem in computer vision, namely the recovery (so far as possible) of an unknown surface from 3 noisy camera images. This(More)
In this paper we analyze a specific problem within the context of recovering the geometric shape of an unknown surface from multiple noisy shading patterns generated by consecutive parallel illuminations by different light-sources. Shading-based single-view shape recovery in computer vision often leads to vector fields (i.e. estimated surface normals) which(More)
A novel formulation for spatial Pythagorean–hodograph (PH) curves, based on the geometric product of vectors from Clifford algebra, is proposed. Compared to the established quaternion representation, in which a hodograph is generated by a continuous sequence of scalings/rotations of a fixed unit vector n̂ , the new representation corresponds to a sequence(More)