In this paper we consider the problem of extracting the shape of a smooth convex solid, V⊂ R 3 , from a set of N photographs. The method begins by extracting the edges of each photograph. These edges are used to form a cone whose apex is the camera centre, which is guaranteed to enclose V. For a strictly convex solid any two such cones will most likely touch at two places (Collings et al., 2004), whose coordinates then give two data points which lie on V along with the orientation of the surface at these points. A set of cameras observing V yields a cloud of such points and normals. A new type of implicit surface is fitted to both the points and their normals. The implicit surface has the property of minimising a linear combination of first, second and third order energies, as in (Dinh et al., 2002), but with the added refinement of incorporating information about the surface orientation at each constraint point.
[1]
Berthold K. P. Horn.
Robot vision
,
1986,
MIT electrical engineering and computer science series.
[2]
D Marr,et al.
Theory of edge detection
,
1979,
Proceedings of the Royal Society of London. Series B. Biological Sciences.
[3]
Greg Turk,et al.
Reconstructing Surfaces by Volumetric Regularization Using Radial Basis Functions
,
2002,
IEEE Trans. Pattern Anal. Mach. Intell..
[4]
Kiriakos N. Kutulakos,et al.
A Theory of Shape by Space Carving
,
2000,
International Journal of Computer Vision.
[5]
F. Girosi,et al.
From regularization to radial, tensor and additive splines
,
1993,
Proceedings of 1993 International Conference on Neural Networks (IJCNN-93-Nagoya, Japan).