Viewpoint Invariant Recovery of Visual Surfaces from Sparse Data

An algorithm for the reconstruction of visual surfaces from sparse data is proposed. An important aspect of this algorithm is that the surface estimated from the sparse data is approximately invariant with respect to rigid transformation of the surface in 3D space. The algorithm is based on casting the problem as an ill-posed inverse problem that must be stabilized using a priori information related to the image and constraint formation. To form a surface estimate that is approximately invariant with respect to viewpoint, the stabilizing information is based on invariant surface characteristics. With appropriate approximations, this results in a convex functional to minimize, which is then solved using finite element analysis. The relationship of this algorithm to several previously proposed reconstruction algorithms is discussed, and several examples that demonstrate its effectiveness in reconstructing viewpoint-invariant surface estimates are given. >

[1]  A. N. Tikhonov,et al.  Solutions of ill-posed problems , 1977 .

[2]  Eric L. W. Grimson,et al.  From Images to Surfaces: A Computational Study of the Human Early Visual System , 1981 .

[3]  Demetri Terzopoulos,et al.  The Computation of Visible-Surface Representations , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Frank P. Ferrie,et al.  Darboux Frames, Snakes, and Super-Quadrics: Geometry from the Bottom Up , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Tomaso Poggio,et al.  Computational vision and regularization theory , 1985, Nature.

[6]  Alan C. Bovik,et al.  Improved initial approximation and intensity-guided discontinuity detection in visible-surface reconstruction , 1989, Comput. Vis. Graph. Image Process..

[7]  E. Delp,et al.  Invariant recovery of curves in m-dimensional space from sparse data , 1990 .

[8]  Paul J. Besl,et al.  Segmentation through symbolic surface descriptions , 1986 .

[9]  Grace Wahba,et al.  THREE TOPICS IN ILL-POSED PROBLEMS , 1987 .

[10]  Richard Szeliski,et al.  Fast surface interpolation using hierarchical basis functions , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[11]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[12]  Demetri Terzopoulos.  Multi-Level Reconstruction of Visual Surfaces: Variational Principles and Finite Element Representations , 1982 .

[13]  Robert J. Renka,et al.  A Storage-efficient Method for Construction of a Thiessen Triangulation , 1982 .

[14]  Alan C. Bovik,et al.  Improving visible-surface reconstruction , 1988, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition.

[15]  J. Meinguet.  Multivariate interpolation at arbitrary points made simple , 1979 .

[16]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[17]  David Lee,et al.  One-Dimensional Regularization with Discontinuities , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[18]  Scott Kirkpatrick,et al.  Optimization by Simmulated Annealing , 1983, Sci..

[19]  John R. Kender,et al.  Visual Surface Reconstruction Using Sparse Depth Data , 1986, CVPR 1986.

[20]  Edward J. Delp,et al.  Invariant reconstruction of visual surfaces , 1989, [1989] Proceedings. Workshop on Interpretation of 3D Scenes.

[21]  Steven W. Zucker,et al.  Inferring Surface Trace and Differential Structure from 3-D Images , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  Demetri Terzopoulos,et al.  Multilevel computational processes for visual surface reconstruction , 1983, Comput. Vis. Graph. Image Process..

[23]  R. Courant,et al.  Methods of Mathematical Physics , 1962 .

[24]  Steven W. Zucker,et al.  Trace Inference, Curvature Consistency, and Curve Detection , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[25]  Brian G. Schunck,et al.  Discontinuity preserving surface reconstruction , 1989, Proceedings CVPR '89: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[26]  Tomaso Poggio,et al.  Probabilistic Solution of Ill-Posed Problems in Computational Vision , 1987 .

[27]  John R. Kender,et al.  Information Based Complexity Applied to Optimal Recovery of the 2 1/2-D Sketch , 1985 .

[28]  Alan C. Bovik,et al.  Visible surface reconstruction via local minimax approximation , 1988, Pattern Recognit..

[29]  Jean Duchon,et al.  Splines minimizing rotation-invariant semi-norms in Sobolev spaces , 1976, Constructive Theory of Functions of Several Variables.

[30]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[31]  Andrew Blake,et al.  Comparison of the Efficiency of Deterministic and Stochastic Algorithms for Visual Reconstruction , 1989, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  Ramesh C. Jain,et al.  Invariant surface characteristics for 3D object recognition in range images , 1985, Comput. Vis. Graph. Image Process..

[33]  B. Julesz.  Binocular depth perception of computer-generated patterns , 1960 .

[34]  I. Faux,et al.  Computational Geometry for Design and Manufacture , 1979 .

[35]  Demetri Terzopoulos,et al.  Regularization of Inverse Visual Problems Involving Discontinuities , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[36]  J Mayhew,et al.  The Interpretation of Stereo-Disparity Information: The Computation of Surface Orientation and Depth , 1982, Perception.